TSTP Solution File: LCL666+1.001 by Drodi---3.3.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Drodi---3.3.3
% Problem  : LCL666+1.001 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s

% Computer : n025.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sun Sep 18 03:15:37 EDT 2022

% Result   : Theorem 0.13s 0.36s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   20 (   7 unt;   0 def)
%            Number of atoms       :   46 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   54 (  28   ~;  16   |;   8   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   3 prp; 0-2 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :   10 (   7   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X] : r1(X,X),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f2,conjecture,
    ~ ? [X] :
        ~ ( ~ ! [Y] :
                ( ~ r1(X,Y)
                | ~ ( p201(Y)
                    & p101(Y) ) )
          | ~ ( p201(X)
              & p101(X) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f3,negated_conjecture,
    ~ ~ ? [X] :
          ~ ( ~ ! [Y] :
                  ( ~ r1(X,Y)
                  | ~ ( p201(Y)
                      & p101(Y) ) )
            | ~ ( p201(X)
                & p101(X) ) ),
    inference(negated_conjecture,[status(cth)],[f2]) ).

fof(f4,plain,
    ! [X0] : r1(X0,X0),
    inference(cnf_transformation,[status(esa)],[f1]) ).

fof(f5,plain,
    ? [X] :
      ( ! [Y] :
          ( ~ r1(X,Y)
          | ~ p201(Y)
          | ~ p101(Y) )
      & p201(X)
      & p101(X) ),
    inference(pre_NNF_transformation,[status(esa)],[f3]) ).

fof(f6,plain,
    ( ! [Y] :
        ( ~ r1(sk0_0,Y)
        | ~ p201(Y)
        | ~ p101(Y) )
    & p201(sk0_0)
    & p101(sk0_0) ),
    inference(skolemization,[status(esa)],[f5]) ).

fof(f7,plain,
    ! [X0] :
      ( ~ r1(sk0_0,X0)
      | ~ p201(X0)
      | ~ p101(X0) ),
    inference(cnf_transformation,[status(esa)],[f6]) ).

fof(f8,plain,
    p201(sk0_0),
    inference(cnf_transformation,[status(esa)],[f6]) ).

fof(f9,plain,
    p101(sk0_0),
    inference(cnf_transformation,[status(esa)],[f6]) ).

fof(f10,plain,
    ( spl0_0
  <=> p201(sk0_0) ),
    introduced(split_symbol_definition) ).

fof(f12,plain,
    ( ~ p201(sk0_0)
    | spl0_0 ),
    inference(component_clause,[status(thm)],[f10]) ).

fof(f13,plain,
    ( spl0_1
  <=> p101(sk0_0) ),
    introduced(split_symbol_definition) ).

fof(f15,plain,
    ( ~ p101(sk0_0)
    | spl0_1 ),
    inference(component_clause,[status(thm)],[f13]) ).

fof(f16,plain,
    ( ~ p201(sk0_0)
    | ~ p101(sk0_0) ),
    inference(resolution,[status(thm)],[f4,f7]) ).

fof(f17,plain,
    ( ~ spl0_0
    | ~ spl0_1 ),
    inference(split_clause,[status(thm)],[f16,f10,f13]) ).

fof(f18,plain,
    ( $false
    | spl0_0 ),
    inference(forward_subsumption_resolution,[status(thm)],[f12,f8]) ).

fof(f19,plain,
    spl0_0,
    inference(contradiction_clause,[status(thm)],[f18]) ).

fof(f20,plain,
    ( $false
    | spl0_1 ),
    inference(forward_subsumption_resolution,[status(thm)],[f15,f9]) ).

fof(f21,plain,
    spl0_1,
    inference(contradiction_clause,[status(thm)],[f20]) ).

fof(f22,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f17,f19,f21]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : LCL666+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.33  % Computer : n025.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 300
% 0.13/0.33  % DateTime : Thu Sep  1 23:46:17 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.13/0.35  % Drodi V3.3.3
% 0.13/0.36  % Refutation found
% 0.13/0.36  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.36  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.36  % Elapsed time: 0.020362 seconds
% 0.13/0.36  % CPU time: 0.022035 seconds
% 0.13/0.36  % Memory used: 16.659 MB
%------------------------------------------------------------------------------