TSTP Solution File: LCL107-1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : LCL107-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n022.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:22 EDT 2024
% Result : Unsatisfiable 0.11s 0.35s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 3
% Syntax : Number of formulae : 28 ( 18 unt; 0 def)
% Number of atoms : 41 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 28 ( 15 ~; 13 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 8 ( 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 : 126 ( 126 !; 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,V,W,V6] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),Z),equivalent(equivalent(U,V),equivalent(equivalent(equivalent(W,V),equivalent(W,U)),V6))),equivalent(Z,equivalent(equivalent(Y,X),V6)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f3,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(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,X4,X5,X6] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(equivalent(X3,X4),equivalent(equivalent(equivalent(X5,X4),equivalent(X5,X3)),X6))),equivalent(X2,equivalent(equivalent(X1,X0),X6)))),
inference(cnf_transformation,[status(esa)],[f2]) ).
fof(f7,plain,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(equivalent(e,b),equivalent(equivalent(a,e),c)))),
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f8,plain,
! [X0,X1,X2,X3,X4,X5,X6] :
( ~ is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(equivalent(X3,X4),equivalent(equivalent(equivalent(X5,X4),equivalent(X5,X3)),X6))))
| is_a_theorem(equivalent(X2,equivalent(equivalent(X1,X0),X6))) ),
inference(resolution,[status(thm)],[f6,f5]) ).
fof(f9,plain,
! [X0,X1,X2,X3,X4,X5,X6] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(equivalent(equivalent(X2,X1),equivalent(X2,X0)),X3)),equivalent(equivalent(equivalent(X4,X5),equivalent(equivalent(X6,X4),equivalent(X6,X5))),X3))),
inference(resolution,[status(thm)],[f8,f6]) ).
fof(f10,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(equivalent(equivalent(X3,equivalent(equivalent(X4,X5),equivalent(X4,X6))),equivalent(X3,equivalent(X5,X6))),X7)),equivalent(equivalent(X1,X2),X7))),
inference(resolution,[status(thm)],[f9,f8]) ).
fof(f12,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7,X8] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(X1,X3))),equivalent(X0,equivalent(X2,X3))),equivalent(equivalent(equivalent(X4,X5),equivalent(X4,X6)),X7)),equivalent(equivalent(equivalent(X8,X5),equivalent(X8,X6)),X7))),
inference(resolution,[status(thm)],[f10,f8]) ).
fof(f13,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( ~ is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(equivalent(equivalent(X3,equivalent(equivalent(X4,X5),equivalent(X4,X6))),equivalent(X3,equivalent(X5,X6))),X7)))
| is_a_theorem(equivalent(equivalent(X1,X2),X7)) ),
inference(resolution,[status(thm)],[f10,f5]) ).
fof(f14,plain,
! [X0,X1,X2,X3,X4,X5] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X1,equivalent(X2,X4)))),equivalent(X0,equivalent(X3,X4))),X5),X5)),
inference(resolution,[status(thm)],[f13,f10]) ).
fof(f18,plain,
! [X0,X1,X2,X3,X4,X5] :
( ~ is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X1,equivalent(X2,X4)))),equivalent(X0,equivalent(X3,X4))),X5))
| is_a_theorem(X5) ),
inference(resolution,[status(thm)],[f14,f5]) ).
fof(f22,plain,
! [X0,X1,X2,X3,X4,X5] : is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(equivalent(X3,equivalent(X4,X0)),equivalent(X3,equivalent(X4,equivalent(X1,X5))))),equivalent(X2,X5))),
inference(resolution,[status(thm)],[f18,f14]) ).
fof(f24,plain,
! [X0,X1,X2,X3,X4,X5] : is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(X1,equivalent(equivalent(X2,X3),equivalent(X2,X4)))),equivalent(X0,equivalent(X1,X5))),equivalent(equivalent(X3,X4),X5))),
inference(resolution,[status(thm)],[f18,f6]) ).
fof(f33,plain,
! [X0,X1,X2,X3,X4,X5] :
( ~ is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(equivalent(X3,equivalent(X4,X0)),equivalent(X3,equivalent(X4,equivalent(X1,X5))))))
| is_a_theorem(equivalent(X2,X5)) ),
inference(resolution,[status(thm)],[f22,f5]) ).
fof(f36,plain,
! [X0,X1,X2,X3,X4,X5] :
( ~ is_a_theorem(equivalent(equivalent(X0,equivalent(X1,equivalent(equivalent(X2,X3),equivalent(X2,X4)))),equivalent(X0,equivalent(X1,X5))))
| is_a_theorem(equivalent(equivalent(X3,X4),X5)) ),
inference(resolution,[status(thm)],[f24,f5]) ).
fof(f67,plain,
! [X0,X1,X2,X3,X4] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X0),equivalent(equivalent(equivalent(X3,X1),equivalent(X3,X2)),X4))),X4)),
inference(resolution,[status(thm)],[f33,f9]) ).
fof(f76,plain,
! [X0,X1,X2,X3,X4] : is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(X1,X2)),X3),equivalent(equivalent(X0,equivalent(equivalent(X4,X1),equivalent(X4,X2))),X3))),
inference(resolution,[status(thm)],[f36,f12]) ).
fof(f79,plain,
! [X0,X1,X2] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(equivalent(X1,X0),X2)),X2)),
inference(resolution,[status(thm)],[f36,f67]) ).
fof(f83,plain,
! [X0,X1,X2] :
( ~ is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X1,X0),X2)))
| is_a_theorem(X2) ),
inference(resolution,[status(thm)],[f79,f5]) ).
fof(f101,plain,
! [X0] : is_a_theorem(equivalent(X0,X0)),
inference(resolution,[status(thm)],[f76,f83]) ).
fof(f122,plain,
! [X0,X1,X2] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X0),equivalent(X2,X1)))),
inference(resolution,[status(thm)],[f101,f36]) ).
fof(f129,plain,
! [X0,X1,X2] :
( ~ is_a_theorem(equivalent(X0,X1))
| is_a_theorem(equivalent(equivalent(X2,X0),equivalent(X2,X1))) ),
inference(resolution,[status(thm)],[f122,f5]) ).
fof(f151,plain,
! [X0,X1,X2,X3] : is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(X0,equivalent(equivalent(X3,X1),equivalent(X3,X2))))),
inference(resolution,[status(thm)],[f129,f122]) ).
fof(f184,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)],[f151,f8]) ).
fof(f500,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[f7,f184]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : LCL107-1 : TPTP v8.1.2. Released v1.0.0.
% 0.06/0.12 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.11/0.32 % Computer : n022.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Apr 29 20:20:28 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.11/0.33 % Drodi V3.6.0
% 0.11/0.35 % Refutation found
% 0.11/0.35 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.11/0.35 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.11/0.37 % Elapsed time: 0.031064 seconds
% 0.11/0.37 % CPU time: 0.148924 seconds
% 0.11/0.37 % Total memory used: 24.084 MB
% 0.11/0.37 % Net memory used: 23.957 MB
%------------------------------------------------------------------------------