TSTP Solution File: LCL193-1 by Drodi---3.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Drodi---3.5.1
% Problem  : LCL193-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s

% Computer : n016.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 : Wed May 31 12:18:35 EDT 2023

% Result   : Unsatisfiable 0.13s 0.38s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   20 (   8 unt;   0 def)
%            Number of atoms       :   39 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   43 (  24   ~;  19   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-1 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   34 (;  34   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f3,axiom,
    ! [A,B] : axiom(or(not(or(A,B)),or(B,A))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f5,axiom,
    ! [A,B,C] : axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f6,axiom,
    ! [X] :
      ( theorem(X)
      | ~ axiom(X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f7,axiom,
    ! [X,Y] :
      ( theorem(X)
      | ~ axiom(or(not(Y),X))
      | ~ theorem(Y) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f8,axiom,
    ! [X,Z,Y] :
      ( theorem(or(not(X),Z))
      | ~ axiom(or(not(X),Y))
      | ~ theorem(or(not(Y),Z)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f9,negated_conjecture,
    ~ theorem(or(not(or(not(q),r)),or(not(or(p,q)),or(r,p)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f12,plain,
    ! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
    inference(cnf_transformation,[status(esa)],[f3]) ).

fof(f14,plain,
    ! [X0,X1,X2] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
    inference(cnf_transformation,[status(esa)],[f5]) ).

fof(f15,plain,
    ! [X0] :
      ( theorem(X0)
      | ~ axiom(X0) ),
    inference(cnf_transformation,[status(esa)],[f6]) ).

fof(f16,plain,
    ! [Y] :
      ( ! [X] :
          ( theorem(X)
          | ~ axiom(or(not(Y),X)) )
      | ~ theorem(Y) ),
    inference(miniscoping,[status(esa)],[f7]) ).

fof(f17,plain,
    ! [X0,X1] :
      ( theorem(X0)
      | ~ axiom(or(not(X1),X0))
      | ~ theorem(X1) ),
    inference(cnf_transformation,[status(esa)],[f16]) ).

fof(f18,plain,
    ! [Z,Y] :
      ( ! [X] :
          ( theorem(or(not(X),Z))
          | ~ axiom(or(not(X),Y)) )
      | ~ theorem(or(not(Y),Z)) ),
    inference(miniscoping,[status(esa)],[f8]) ).

fof(f19,plain,
    ! [X0,X1,X2] :
      ( theorem(or(not(X0),X1))
      | ~ axiom(or(not(X0),X2))
      | ~ theorem(or(not(X2),X1)) ),
    inference(cnf_transformation,[status(esa)],[f18]) ).

fof(f20,plain,
    ~ theorem(or(not(or(not(q),r)),or(not(or(p,q)),or(r,p)))),
    inference(cnf_transformation,[status(esa)],[f9]) ).

fof(f22,plain,
    ! [X0,X1] :
      ( theorem(X0)
      | ~ axiom(or(not(X1),X0))
      | ~ axiom(X1) ),
    inference(resolution,[status(thm)],[f17,f15]) ).

fof(f23,plain,
    ! [X0] :
      ( ~ axiom(or(not(or(not(q),r)),X0))
      | ~ theorem(or(not(X0),or(not(or(p,q)),or(r,p)))) ),
    inference(resolution,[status(thm)],[f19,f20]) ).

fof(f179,plain,
    ! [X0,X1,X2] :
      ( theorem(or(not(or(X0,X1)),or(X0,X2)))
      | ~ axiom(or(not(X1),X2)) ),
    inference(resolution,[status(thm)],[f14,f22]) ).

fof(f299,plain,
    ! [X0] :
      ( ~ axiom(or(not(X0),or(r,p)))
      | ~ axiom(or(not(or(not(q),r)),or(not(or(p,q)),X0))) ),
    inference(resolution,[status(thm)],[f179,f23]) ).

fof(f411,plain,
    ~ axiom(or(not(or(not(q),r)),or(not(or(p,q)),or(p,r)))),
    inference(resolution,[status(thm)],[f299,f12]) ).

fof(f412,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f411,f14]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : LCL193-1 : TPTP v8.1.2. Released v1.1.0.
% 0.11/0.13  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34  % Computer : n016.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Tue May 30 10:13:44 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 0.13/0.35  % Drodi V3.5.1
% 0.13/0.38  % Refutation found
% 0.13/0.38  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.13/0.38  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.39  % Elapsed time: 0.035510 seconds
% 0.13/0.39  % CPU time: 0.164761 seconds
% 0.13/0.39  % Memory used: 13.647 MB
%------------------------------------------------------------------------------