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

% Computer : n012.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:22 EDT 2023

% Result   : Unsatisfiable 0.15s 0.54s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   17 (   9 unt;   0 def)
%            Number of atoms       :   29 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   26 (  14   ~;  12   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   45 (;  45   !;   0   ?)

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

fof(f2,axiom,
    ! [X,Y,Z,U] : is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(Y,Z),equivalent(equivalent(Y,U),equivalent(Z,U)))),X)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f3,negated_conjecture,
    ~ is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f4,plain,
    ! [Y] :
      ( ! [X] :
          ( ~ is_a_theorem(equivalent(X,Y))
          | ~ is_a_theorem(X) )
      | is_a_theorem(Y) ),
    inference(miniscoping,[status(esa)],[f1]) ).

fof(f5,plain,
    ! [X0,X1] :
      ( ~ is_a_theorem(equivalent(X0,X1))
      | ~ is_a_theorem(X0)
      | is_a_theorem(X1) ),
    inference(cnf_transformation,[status(esa)],[f4]) ).

fof(f6,plain,
    ! [X0,X1,X2,X3] : is_a_theorem(equivalent(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(equivalent(X1,X3),equivalent(X2,X3)))),X0)),
    inference(cnf_transformation,[status(esa)],[f2]) ).

fof(f7,plain,
    ~ is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))))),
    inference(cnf_transformation,[status(esa)],[f3]) ).

fof(f8,plain,
    ! [X0,X1,X2,X3] :
      ( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(equivalent(X1,X3),equivalent(X2,X3)))))
      | is_a_theorem(X0) ),
    inference(resolution,[status(thm)],[f6,f5]) ).

fof(f9,plain,
    ! [X0,X1,X2,X3,X4,X5] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(equivalent(X0,X2),equivalent(X1,X2))),equivalent(equivalent(X3,X4),equivalent(equivalent(X3,X5),equivalent(X4,X5))))),
    inference(resolution,[status(thm)],[f8,f6]) ).

fof(f10,plain,
    ! [X0,X1,X2] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X0,X2),equivalent(X1,X2)))),
    inference(resolution,[status(thm)],[f9,f8]) ).

fof(f21,plain,
    ! [X0,X1,X2] :
      ( ~ is_a_theorem(equivalent(X0,X1))
      | is_a_theorem(equivalent(equivalent(X0,X2),equivalent(X1,X2))) ),
    inference(resolution,[status(thm)],[f10,f5]) ).

fof(f23,plain,
    ! [X0,X1,X2] :
      ( ~ is_a_theorem(equivalent(X0,X1))
      | ~ is_a_theorem(equivalent(X0,X2))
      | is_a_theorem(equivalent(X1,X2)) ),
    inference(resolution,[status(thm)],[f21,f5]) ).

fof(f25,plain,
    ! [X0,X1,X2,X3,X4] :
      ( ~ is_a_theorem(equivalent(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(equivalent(X1,X3),equivalent(X2,X3)))),X4))
      | is_a_theorem(equivalent(X4,X0)) ),
    inference(resolution,[status(thm)],[f23,f6]) ).

fof(f77,plain,
    ! [X0] : is_a_theorem(equivalent(X0,X0)),
    inference(resolution,[status(thm)],[f25,f6]) ).

fof(f90,plain,
    ! [X0,X1] :
      ( ~ is_a_theorem(equivalent(X0,X1))
      | is_a_theorem(equivalent(X1,X0)) ),
    inference(resolution,[status(thm)],[f77,f23]) ).

fof(f93,plain,
    ! [X0,X1,X2,X3] : is_a_theorem(equivalent(X0,equivalent(X0,equivalent(equivalent(X1,X2),equivalent(equivalent(X1,X3),equivalent(X2,X3)))))),
    inference(resolution,[status(thm)],[f90,f6]) ).

fof(f94,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[f7,f93]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09  % Problem  : LCL130-1 : TPTP v8.1.2. Released v1.0.0.
% 0.05/0.10  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.09/0.30  % Computer : n012.cluster.edu
% 0.09/0.30  % Model    : x86_64 x86_64
% 0.09/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30  % Memory   : 8042.1875MB
% 0.09/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30  % CPULimit : 300
% 0.09/0.30  % WCLimit  : 300
% 0.09/0.30  % DateTime : Tue May 30 09:41:40 EDT 2023
% 0.09/0.30  % CPUTime  : 
% 0.09/0.30  % Drodi V3.5.1
% 0.15/0.54  % Refutation found
% 0.15/0.54  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.15/0.54  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.15/0.54  % Elapsed time: 0.022562 seconds
% 0.15/0.54  % CPU time: 0.031056 seconds
% 0.15/0.54  % Memory used: 4.087 MB
%------------------------------------------------------------------------------