TSTP Solution File: LCL257-1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : LCL257-1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n013.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:52 EDT 2024
% Result : Unsatisfiable 0.19s 0.50s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 3
% Syntax : Number of formulae : 29 ( 17 unt; 0 def)
% Number of atoms : 46 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 38 ( 21 ~; 17 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 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 : 68 ( 68 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X,Y] :
( ~ is_a_theorem(equivalent(X,Y))
| ~ is_a_theorem(X)
| is_a_theorem(Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f2,axiom,
! [X,Y,Z] : is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(Z,Y),equivalent(X,Z)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f3,negated_conjecture,
~ is_a_theorem(equivalent(x,equivalent(equivalent(y,z),equivalent(equivalent(z,x),y)))),
file('/export/starexec/sandbox/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] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X1),equivalent(X0,X2)))),
inference(cnf_transformation,[status(esa)],[f2]) ).
fof(f7,plain,
~ is_a_theorem(equivalent(x,equivalent(equivalent(y,z),equivalent(equivalent(z,x),y)))),
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f8,plain,
! [X0,X1,X2] :
( ~ is_a_theorem(equivalent(X0,X1))
| is_a_theorem(equivalent(equivalent(X2,X1),equivalent(X0,X2))) ),
inference(resolution,[status(thm)],[f6,f5]) ).
fof(f9,plain,
! [X0,X1,X2,X3] : is_a_theorem(equivalent(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(X3,X1))),equivalent(equivalent(X3,X2),X0))),
inference(resolution,[status(thm)],[f8,f6]) ).
fof(f11,plain,
! [X0,X1,X2,X3] :
( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(X3,X1))))
| is_a_theorem(equivalent(equivalent(X3,X2),X0)) ),
inference(resolution,[status(thm)],[f9,f5]) ).
fof(f14,plain,
! [X0,X1,X2,X3] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X0,X2),equivalent(equivalent(X3,X1),equivalent(X2,X3))))),
inference(resolution,[status(thm)],[f11,f9]) ).
fof(f16,plain,
! [X0,X1] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X0,X1))),
inference(resolution,[status(thm)],[f11,f6]) ).
fof(f18,plain,
! [X0,X1,X2] : is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(equivalent(X1,X2),X0))),
inference(resolution,[status(thm)],[f16,f8]) ).
fof(f19,plain,
! [X0,X1,X2] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X0,X2),equivalent(X2,X1)))),
inference(resolution,[status(thm)],[f18,f11]) ).
fof(f21,plain,
! [X0,X1,X2] :
( ~ is_a_theorem(equivalent(X0,equivalent(X1,X2)))
| is_a_theorem(equivalent(equivalent(X1,X2),X0)) ),
inference(resolution,[status(thm)],[f18,f5]) ).
fof(f22,plain,
! [X0,X1] : is_a_theorem(equivalent(equivalent(X0,X0),equivalent(X1,X1))),
inference(resolution,[status(thm)],[f19,f11]) ).
fof(f24,plain,
! [X0,X1,X2] :
( ~ is_a_theorem(equivalent(X0,X1))
| is_a_theorem(equivalent(equivalent(X0,X2),equivalent(X2,X1))) ),
inference(resolution,[status(thm)],[f19,f5]) ).
fof(f26,plain,
! [X0,X1,X2] : is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X1)),equivalent(equivalent(X2,X2),X0))),
inference(resolution,[status(thm)],[f22,f8]) ).
fof(f37,plain,
! [X0,X1,X2] :
( ~ is_a_theorem(equivalent(X0,equivalent(X1,X2)))
| ~ is_a_theorem(equivalent(X1,X2))
| is_a_theorem(X0) ),
inference(resolution,[status(thm)],[f21,f5]) ).
fof(f40,plain,
! [X0,X1,X2] :
( ~ is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(equivalent(X0,X2))
| is_a_theorem(equivalent(X2,X1)) ),
inference(resolution,[status(thm)],[f24,f5]) ).
fof(f41,plain,
! [X0,X1,X2] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X0,X1),equivalent(X2,X2)))),
inference(resolution,[status(thm)],[f26,f11]) ).
fof(f51,plain,
! [X0,X1,X2] :
( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X1),equivalent(X2,X2))))
| is_a_theorem(X0) ),
inference(resolution,[status(thm)],[f37,f22]) ).
fof(f54,plain,
! [X0] :
( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(y,z),equivalent(equivalent(z,x),y))))
| ~ is_a_theorem(equivalent(X0,x)) ),
inference(resolution,[status(thm)],[f40,f7]) ).
fof(f85,plain,
! [X0] : is_a_theorem(equivalent(X0,X0)),
inference(resolution,[status(thm)],[f51,f41]) ).
fof(f101,plain,
! [X0,X1] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X1,X0))),
inference(resolution,[status(thm)],[f85,f8]) ).
fof(f123,plain,
! [X0,X1,X2] :
( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(X2,X1))))
| is_a_theorem(X0) ),
inference(resolution,[status(thm)],[f101,f37]) ).
fof(f433,plain,
! [X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X0),X1)),
inference(resolution,[status(thm)],[f123,f14]) ).
fof(f451,plain,
! [X0] : ~ is_a_theorem(equivalent(equivalent(equivalent(X0,x),X0),equivalent(equivalent(y,z),equivalent(equivalent(z,x),y)))),
inference(resolution,[status(thm)],[f433,f54]) ).
fof(f1026,plain,
$false,
inference(resolution,[status(thm)],[f451,f6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL257-1 : TPTP v8.1.2. Released v2.0.0.
% 0.07/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34 % Computer : n013.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 : Mon Apr 29 20:09:04 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 % Drodi V3.6.0
% 0.19/0.50 % Refutation found
% 0.19/0.50 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.19/0.50 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.19/0.52 % Elapsed time: 0.165847 seconds
% 0.19/0.52 % CPU time: 1.226559 seconds
% 0.19/0.52 % Total memory used: 58.920 MB
% 0.19/0.52 % Net memory used: 55.743 MB
%------------------------------------------------------------------------------