TSTP Solution File: LCL253-1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : LCL253-1 : TPTP v8.1.2. Bugfixed v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n026.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:52 EDT 2023
% Result : Unsatisfiable 90.50s 11.82s
% Output : CNFRefutation 91.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 38 ( 17 unt; 0 def)
% Number of atoms : 66 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 58 ( 30 ~; 28 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 86 (; 86 !; 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(not(p),q)),or(not(not(or(not(p),not(r)))),not(or(not(q),not(r)))))),
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(not(p),q)),or(not(not(or(not(p),not(r)))),not(or(not(q),not(r)))))),
inference(cnf_transformation,[status(esa)],[f9]) ).
fof(f21,plain,
! [X0] :
( theorem(X0)
| ~ theorem(or(X0,X0)) ),
inference(resolution,[status(thm)],[f10,f17]) ).
fof(f41,plain,
! [X0,X1] :
( theorem(or(X0,X1))
| ~ theorem(X1) ),
inference(resolution,[status(thm)],[f11,f17]) ).
fof(f55,plain,
! [X0,X1] :
( theorem(or(X0,X1))
| ~ theorem(or(X1,X0)) ),
inference(resolution,[status(thm)],[f12,f17]) ).
fof(f56,plain,
! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[status(thm)],[f12,f15]) ).
fof(f75,plain,
! [X0,X1,X2] :
( theorem(or(not(X0),or(X1,X2)))
| ~ axiom(or(not(X0),or(X2,X1))) ),
inference(resolution,[status(thm)],[f56,f19]) ).
fof(f87,plain,
! [X0,X1,X2] :
( theorem(or(X0,or(X1,X2)))
| ~ theorem(or(X1,or(X0,X2))) ),
inference(resolution,[status(thm)],[f13,f17]) ).
fof(f89,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(f102,plain,
! [X0,X1,X2] :
( theorem(or(X0,or(X1,X2)))
| ~ theorem(or(X0,X2)) ),
inference(resolution,[status(thm)],[f87,f41]) ).
fof(f140,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)],[f89,f19]) ).
fof(f150,plain,
! [X0,X1] :
( ~ theorem(or(or(X0,X1),X1))
| theorem(or(X0,X1)) ),
inference(resolution,[status(thm)],[f102,f21]) ).
fof(f170,plain,
! [X0,X1,X2] :
( theorem(or(X0,or(X1,X2)))
| ~ theorem(or(or(X0,or(X1,X2)),X2)) ),
inference(resolution,[status(thm)],[f150,f102]) ).
fof(f240,plain,
! [X0,X1] : theorem(or(not(X0),or(X0,X1))),
inference(resolution,[status(thm)],[f75,f11]) ).
fof(f250,plain,
! [X0,X1] : theorem(or(X0,or(not(X0),X1))),
inference(resolution,[status(thm)],[f240,f87]) ).
fof(f327,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)],[f140,f14]) ).
fof(f981,plain,
! [X0,X1,X2,X3] :
( ~ theorem(or(not(or(X0,X1)),X2))
| theorem(or(or(not(or(X0,X3)),X2),not(or(not(X3),X1)))) ),
inference(resolution,[status(thm)],[f327,f55]) ).
fof(f3221,plain,
! [X0,X1,X2,X3] :
( ~ theorem(or(not(or(X0,X1)),or(X2,not(or(not(X3),X1)))))
| theorem(or(not(or(X0,X3)),or(X2,not(or(not(X3),X1))))) ),
inference(resolution,[status(thm)],[f981,f170]) ).
fof(f19149,plain,
! [X0,X1,X2] : theorem(or(not(or(X0,X1)),or(not(not(or(X0,X2))),not(or(not(X1),X2))))),
inference(resolution,[status(thm)],[f3221,f250]) ).
fof(f19150,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[f20,f19149]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : LCL253-1 : TPTP v8.1.2. Bugfixed v2.3.0.
% 0.08/0.10 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.09/0.30 % Computer : n026.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Tue May 30 09:57:28 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.09/0.31 % Drodi V3.5.1
% 90.50/11.82 % Refutation found
% 90.50/11.82 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 90.50/11.82 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 91.75/12.03 % Elapsed time: 11.702874 seconds
% 91.75/12.03 % CPU time: 91.590157 seconds
% 91.75/12.03 % Memory used: 662.486 MB
%------------------------------------------------------------------------------