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

% Computer : n029.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:16 EDT 2023

% Result   : Unsatisfiable 0.21s 0.60s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   17 (   8 unt;   0 def)
%            Number of atoms       :   31 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   30 (  16   ~;  14   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   5 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   41 (;  41   !;   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] : is_a_theorem(equivalent(X,equivalent(equivalent(Y,Z),equivalent(equivalent(Z,Y),X)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

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

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

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

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

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

fof(f8,plain,
    ! [X0,X1,X2] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(X1,X2))),
    inference(cnf_transformation,[status(esa)],[f3]) ).

fof(f9,plain,
    ~ is_a_theorem(equivalent(equivalent(a,b),equivalent(equivalent(c,a),equivalent(c,b)))),
    inference(cnf_transformation,[status(esa)],[f4]) ).

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

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

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

fof(f22,plain,
    ! [X0,X1,X2] :
      ( ~ is_a_theorem(equivalent(X0,X1))
      | ~ is_a_theorem(equivalent(X2,X0))
      | is_a_theorem(equivalent(X2,X1)) ),
    inference(resolution,[status(thm)],[f12,f11]) ).

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

fof(f35,plain,
    ! [X0,X1,X2,X3] :
      ( ~ is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X0),X3)))
      | is_a_theorem(equivalent(equivalent(X2,X1),X3)) ),
    inference(resolution,[status(thm)],[f31,f11]) ).

fof(f68,plain,
    ! [X0,X1,X2] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X0),equivalent(X2,X1)))),
    inference(resolution,[status(thm)],[f35,f7]) ).

fof(f69,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[f9,f68]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : LCL106-1 : TPTP v8.1.2. Released v1.0.0.
% 0.06/0.13  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.14/0.34  % Computer : n029.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 300
% 0.14/0.34  % DateTime : Tue May 30 10:01:22 EDT 2023
% 0.14/0.34  % CPUTime  : 
% 0.14/0.35  % Drodi V3.5.1
% 0.21/0.60  % Refutation found
% 0.21/0.60  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.21/0.60  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.21/0.60  % Elapsed time: 0.036202 seconds
% 0.21/0.60  % CPU time: 0.035834 seconds
% 0.21/0.60  % Memory used: 1.886 MB
%------------------------------------------------------------------------------