TSTP Solution File: LCL208-1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : LCL208-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n014.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:39 EDT 2023
% Result : Unsatisfiable 4.67s 1.00s
% Output : CNFRefutation 5.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 39 ( 22 unt; 0 def)
% Number of atoms : 64 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 58 ( 33 ~; 25 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 77 (; 77 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [A] : axiom(or(not(or(A,A)),A)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f2,axiom,
! [A,B] : axiom(or(not(A),or(B,A))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f3,axiom,
! [A,B] : axiom(or(not(or(A,B)),or(B,A))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f4,axiom,
! [A,B,C] : axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f5,axiom,
! [A,B,C] : axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f6,axiom,
! [X] :
( theorem(X)
| ~ axiom(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f7,axiom,
! [X,Y] :
( theorem(X)
| ~ axiom(or(not(Y),X))
| ~ theorem(Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f8,axiom,
! [X,Z,Y] :
( theorem(or(not(X),Z))
| ~ axiom(or(not(X),Y))
| ~ theorem(or(not(Y),Z)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f9,negated_conjecture,
~ theorem(or(not(or(p,q)),or(not(not(p)),q))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f10,plain,
! [X0] : axiom(or(not(or(X0,X0)),X0)),
inference(cnf_transformation,[status(esa)],[f1]) ).
fof(f11,plain,
! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
inference(cnf_transformation,[status(esa)],[f2]) ).
fof(f12,plain,
! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f13,plain,
! [X0,X1,X2] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f14,plain,
! [X0,X1,X2] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(cnf_transformation,[status(esa)],[f5]) ).
fof(f15,plain,
! [X0] :
( theorem(X0)
| ~ axiom(X0) ),
inference(cnf_transformation,[status(esa)],[f6]) ).
fof(f16,plain,
! [Y] :
( ! [X] :
( theorem(X)
| ~ axiom(or(not(Y),X)) )
| ~ theorem(Y) ),
inference(miniscoping,[status(esa)],[f7]) ).
fof(f17,plain,
! [X0,X1] :
( theorem(X0)
| ~ axiom(or(not(X1),X0))
| ~ theorem(X1) ),
inference(cnf_transformation,[status(esa)],[f16]) ).
fof(f18,plain,
! [Z,Y] :
( ! [X] :
( theorem(or(not(X),Z))
| ~ axiom(or(not(X),Y)) )
| ~ theorem(or(not(Y),Z)) ),
inference(miniscoping,[status(esa)],[f8]) ).
fof(f19,plain,
! [X0,X1,X2] :
( theorem(or(not(X0),X1))
| ~ axiom(or(not(X0),X2))
| ~ theorem(or(not(X2),X1)) ),
inference(cnf_transformation,[status(esa)],[f18]) ).
fof(f20,plain,
~ theorem(or(not(or(p,q)),or(not(not(p)),q))),
inference(cnf_transformation,[status(esa)],[f9]) ).
fof(f22,plain,
! [X0] : theorem(or(not(or(X0,X0)),X0)),
inference(resolution,[status(thm)],[f10,f15]) ).
fof(f23,plain,
! [X0,X1] :
( theorem(or(not(X0),X1))
| ~ axiom(or(not(X0),or(X1,X1))) ),
inference(resolution,[status(thm)],[f22,f19]) ).
fof(f24,plain,
! [X0] : theorem(or(not(or(or(X0,X0),or(X0,X0))),X0)),
inference(resolution,[status(thm)],[f23,f10]) ).
fof(f25,plain,
! [X0,X1] :
( theorem(or(not(X0),X1))
| ~ axiom(or(not(X0),or(or(X1,X1),or(X1,X1)))) ),
inference(resolution,[status(thm)],[f24,f19]) ).
fof(f69,plain,
! [X0] : theorem(or(not(or(X0,or(or(X0,X0),X0))),X0)),
inference(resolution,[status(thm)],[f13,f25]) ).
fof(f71,plain,
! [X0,X1,X2] :
( theorem(or(X0,or(X1,X2)))
| ~ theorem(or(X1,or(X0,X2))) ),
inference(resolution,[status(thm)],[f13,f17]) ).
fof(f74,plain,
! [X0,X1,X2] :
( theorem(or(not(or(X0,X1)),or(X0,X2)))
| ~ theorem(or(not(X1),X2)) ),
inference(resolution,[status(thm)],[f14,f17]) ).
fof(f76,plain,
~ theorem(or(not(not(p)),or(not(or(p,q)),q))),
inference(resolution,[status(thm)],[f71,f20]) ).
fof(f77,plain,
! [X0,X1,X2,X3] :
( ~ theorem(or(X0,or(not(X1),X2)))
| theorem(or(not(X3),or(X0,X2)))
| ~ axiom(or(not(X3),X1)) ),
inference(resolution,[status(thm)],[f71,f19]) ).
fof(f137,plain,
! [X0,X1,X2,X3] :
( ~ theorem(or(not(X0),X1))
| theorem(or(not(X2),or(X3,X1)))
| ~ axiom(or(not(X2),or(X3,X0))) ),
inference(resolution,[status(thm)],[f74,f19]) ).
fof(f235,plain,
! [X0,X1,X2,X3] :
( ~ theorem(or(X0,or(not(or(X1,X2)),X3)))
| theorem(or(not(or(X2,X1)),or(X0,X3))) ),
inference(resolution,[status(thm)],[f77,f12]) ).
fof(f237,plain,
! [X0,X1,X2,X3] :
( ~ theorem(or(X0,or(not(or(X1,X2)),X3)))
| theorem(or(not(X2),or(X0,X3))) ),
inference(resolution,[status(thm)],[f77,f11]) ).
fof(f332,plain,
! [X0,X1,X2,X3] :
( ~ theorem(or(not(or(X0,X1)),X2))
| theorem(or(not(or(not(X3),X1)),or(not(or(X0,X3)),X2))) ),
inference(resolution,[status(thm)],[f137,f14]) ).
fof(f962,plain,
! [X0] : ~ theorem(or(not(or(p,q)),or(not(or(X0,not(p))),q))),
inference(resolution,[status(thm)],[f237,f76]) ).
fof(f1079,plain,
! [X0] : ~ theorem(or(not(or(X0,not(p))),or(not(or(q,p)),q))),
inference(resolution,[status(thm)],[f962,f235]) ).
fof(f2111,plain,
! [X0] : ~ theorem(or(not(or(q,p)),or(not(or(not(p),X0)),q))),
inference(resolution,[status(thm)],[f1079,f235]) ).
fof(f2767,plain,
! [X0] : ~ theorem(or(not(or(not(p),X0)),or(not(or(q,p)),q))),
inference(resolution,[status(thm)],[f2111,f71]) ).
fof(f3104,plain,
! [X0] : ~ theorem(or(not(or(q,X0)),q)),
inference(resolution,[status(thm)],[f2767,f332]) ).
fof(f3122,plain,
$false,
inference(resolution,[status(thm)],[f3104,f69]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL208-1 : TPTP v8.1.2. Released v1.1.0.
% 0.12/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34 % Computer : n014.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 : Tue May 30 09:34:34 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.35 % Drodi V3.5.1
% 4.67/1.00 % Refutation found
% 4.67/1.00 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 4.67/1.00 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 5.16/1.04 % Elapsed time: 0.678532 seconds
% 5.16/1.04 % CPU time: 5.236968 seconds
% 5.16/1.04 % Memory used: 121.077 MB
%------------------------------------------------------------------------------