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

% Computer : n002.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:30 EDT 2023

% Result   : Unsatisfiable 0.13s 0.36s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   22 (  12 unt;   0 def)
%            Number of atoms       :   38 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   34 (  18   ~;  16   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-1 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-2 aty)
%            Number of variables   :   34 (;  34   !;   0   ?)

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

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

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

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

fof(f7,axiom,
    ! [X,Y] :
      ( theorem(X)
      | ~ axiom(or(not(Y),X))
      | ~ theorem(Y) ),
    file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p') ).

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

fof(f10,plain,
    ! [X0] : axiom(or(not(or(X0,X0)),X0)),
    inference(cnf_transformation,[status(esa)],[f1]) ).

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

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

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(p),not(not(p)))),
    inference(cnf_transformation,[status(esa)],[f9]) ).

fof(f22,plain,
    ! [X0] : theorem(or(not(or(X0,X0)),X0)),
    inference(resolution,[status(thm)],[f10,f15]) ).

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

fof(f40,plain,
    ! [X0] : theorem(or(not(X0),X0)),
    inference(resolution,[status(thm)],[f11,f23]) ).

fof(f62,plain,
    ! [X0,X1] :
      ( theorem(or(X0,X1))
      | ~ theorem(or(X1,X0)) ),
    inference(resolution,[status(thm)],[f12,f17]) ).

fof(f71,plain,
    ! [X0] : theorem(or(X0,not(X0))),
    inference(resolution,[status(thm)],[f62,f40]) ).

fof(f73,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[f20,f71]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : LCL178-1 : TPTP v8.1.2. Released v1.1.0.
% 0.03/0.13  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34  % Computer : n002.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 09:59:13 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.13/0.35  % Drodi V3.5.1
% 0.13/0.36  % Refutation found
% 0.13/0.36  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.13/0.36  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.20/0.37  % Elapsed time: 0.023833 seconds
% 0.20/0.37  % CPU time: 0.042655 seconds
% 0.20/0.37  % Memory used: 7.692 MB
%------------------------------------------------------------------------------