TSTP Solution File: LCL130-1 by Drodi---3.6.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Drodi---3.6.0
% 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 : n009.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 : Tue Apr 30 20:26:27 EDT 2024

% Result   : Unsatisfiable 0.14s 0.36s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   23 (  13 unt;   0 def)
%            Number of atoms       :   36 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   28 (  15   ~;  13   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    7 (   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   :   75 (  75   !;   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(f19,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(f21,plain,
    ! [X0,X1,X2,X3,X4] : is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(equivalent(X1,X3),equivalent(X2,X3)))),X4),equivalent(X0,X4))),
    inference(resolution,[status(thm)],[f19,f6]) ).

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

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

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

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

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

fof(f59,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(X0,X4)) ),
    inference(resolution,[status(thm)],[f21,f5]) ).

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

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

fof(f135,plain,
    ! [X0,X1] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X0,X1))),
    inference(resolution,[status(thm)],[f128,f9]) ).

fof(f179,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)],[f59,f135]) ).

fof(f272,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[f7,f179]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : LCL130-1 : TPTP v8.1.2. Released v1.0.0.
% 0.11/0.13  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.14/0.34  % Computer : n009.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 : Mon Apr 29 20:22:26 EDT 2024
% 0.14/0.34  % CPUTime  : 
% 0.14/0.35  % Drodi V3.6.0
% 0.14/0.36  % Refutation found
% 0.14/0.36  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.14/0.36  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.37  % Elapsed time: 0.026147 seconds
% 0.14/0.37  % CPU time: 0.060784 seconds
% 0.14/0.37  % Total memory used: 8.431 MB
% 0.14/0.37  % Net memory used: 8.403 MB
%------------------------------------------------------------------------------