TSTP Solution File: LCL101-1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : LCL101-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n003.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:21 EDT 2024
% Result : Unsatisfiable 0.20s 0.39s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 23 ( 15 unt; 0 def)
% Number of atoms : 34 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 24 ( 13 ~; 11 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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 : 70 ( 70 !; 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(equivalent(equivalent(equivalent(X,Y),equivalent(X,Z)),equivalent(Y,Z)),U),U)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f3,axiom,
! [X,Y,Z,U] : is_a_theorem(equivalent(X,equivalent(equivalent(equivalent(equivalent(Y,Z),equivalent(Y,U)),equivalent(Z,U)),X))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f4,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(equivalent(e,b),equivalent(equivalent(a,e),c)))),
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,X3] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(X1,X2)),X3),X3)),
inference(cnf_transformation,[status(esa)],[f2]) ).
fof(f8,plain,
! [X0,X1,X2,X3] : is_a_theorem(equivalent(X0,equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3)),X0))),
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f9,plain,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(equivalent(e,b),equivalent(equivalent(a,e),c)))),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f10,plain,
! [X0,X1,X2,X3] :
( ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(X1,X2)),X3))
| is_a_theorem(X3) ),
inference(resolution,[status(thm)],[f7,f6]) ).
fof(f11,plain,
! [X0,X1,X2,X3] :
( ~ is_a_theorem(X0)
| is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3)),X0)) ),
inference(resolution,[status(thm)],[f8,f6]) ).
fof(f12,plain,
! [X0,X1,X2,X3,X4,X5] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(X1,X2)),equivalent(equivalent(equivalent(X3,X4),equivalent(X3,X5)),equivalent(X4,X5)))),
inference(resolution,[status(thm)],[f10,f8]) ).
fof(f21,plain,
! [X0,X1,X2] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(X1,X2))),
inference(resolution,[status(thm)],[f12,f10]) ).
fof(f27,plain,
! [X0,X1,X2] :
( ~ is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X0,X2)))
| is_a_theorem(equivalent(X1,X2)) ),
inference(resolution,[status(thm)],[f21,f6]) ).
fof(f29,plain,
! [X0,X1] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X0,X1))),
inference(resolution,[status(thm)],[f27,f12]) ).
fof(f30,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)],[f27,f11]) ).
fof(f33,plain,
! [X0] : is_a_theorem(equivalent(X0,X0)),
inference(resolution,[status(thm)],[f29,f27]) ).
fof(f38,plain,
! [X0,X1,X2,X3,X4,X5] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(equivalent(equivalent(X2,X3),equivalent(X2,X4)),equivalent(X3,X4)),equivalent(equivalent(X5,X0),equivalent(X5,X1))))),
inference(resolution,[status(thm)],[f30,f8]) ).
fof(f39,plain,
! [X0,X1,X2] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X0),equivalent(X2,X1)))),
inference(resolution,[status(thm)],[f30,f33]) ).
fof(f40,plain,
! [X0,X1,X2,X3] : is_a_theorem(equivalent(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(X1,X3))),equivalent(X0,equivalent(X2,X3)))),
inference(resolution,[status(thm)],[f39,f10]) ).
fof(f58,plain,
! [X0,X1,X2,X3] :
( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(X1,X3))))
| is_a_theorem(equivalent(X0,equivalent(X2,X3))) ),
inference(resolution,[status(thm)],[f40,f6]) ).
fof(f106,plain,
! [X0,X1,X2,X3] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(equivalent(X3,X1),equivalent(equivalent(X0,X3),X2)))),
inference(resolution,[status(thm)],[f58,f38]) ).
fof(f538,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[f9,f106]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL101-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.14/0.34 % Computer : n003.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:03 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.14/0.35 % Drodi V3.6.0
% 0.20/0.39 % Refutation found
% 0.20/0.39 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.20/0.39 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.20/0.42 % Elapsed time: 0.062247 seconds
% 0.20/0.42 % CPU time: 0.343084 seconds
% 0.20/0.42 % Total memory used: 36.744 MB
% 0.20/0.42 % Net memory used: 36.405 MB
%------------------------------------------------------------------------------