TSTP Solution File: LCL201-1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : LCL201-1 : TPTP v8.1.2. Released v1.1.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:40 EDT 2024
% Result : Unsatisfiable 2.55s 0.70s
% Output : CNFRefutation 2.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 40 ( 19 unt; 0 def)
% Number of atoms : 68 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 59 ( 31 ~; 28 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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 : 86 ( 86 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [A] : axiom(or(not(or(A,A)),A)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f2,axiom,
! [A,B] : axiom(or(not(A),or(B,A))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f3,axiom,
! [A,B] : axiom(or(not(or(A,B)),or(B,A))),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p') ).
fof(f6,axiom,
! [X] :
( theorem(X)
| ~ axiom(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f7,axiom,
! [X,Y] :
( theorem(X)
| ~ axiom(or(not(Y),X))
| ~ theorem(Y) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p') ).
fof(f9,negated_conjecture,
~ theorem(or(not(not(or(p,q))),or(not(p),q))),
file('/export/starexec/sandbox2/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(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(not(or(p,q))),or(not(p),q))),
inference(cnf_transformation,[status(esa)],[f9]) ).
fof(f21,plain,
! [X0] :
( theorem(X0)
| ~ theorem(or(X0,X0)) ),
inference(resolution,[status(thm)],[f10,f17]) ).
fof(f54,plain,
! [X0,X1] :
( theorem(or(X0,X1))
| ~ theorem(or(X1,X0)) ),
inference(resolution,[status(thm)],[f12,f17]) ).
fof(f55,plain,
! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[status(thm)],[f12,f15]) ).
fof(f58,plain,
! [X0,X1,X2] :
( ~ theorem(or(X0,not(X1)))
| theorem(or(not(X2),X0))
| ~ axiom(or(not(X2),X1)) ),
inference(resolution,[status(thm)],[f54,f19]) ).
fof(f62,plain,
! [X0,X1,X2] :
( theorem(or(not(X0),or(X1,X2)))
| ~ axiom(or(not(X0),or(X2,X1))) ),
inference(resolution,[status(thm)],[f55,f19]) ).
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(f76,plain,
~ theorem(or(not(p),or(not(not(or(p,q))),q))),
inference(resolution,[status(thm)],[f71,f20]) ).
fof(f78,plain,
! [X0,X1] :
( ~ theorem(or(X0,or(or(X0,X1),X1)))
| theorem(or(X0,X1)) ),
inference(resolution,[status(thm)],[f71,f21]) ).
fof(f95,plain,
! [X0,X1] :
( theorem(or(X0,X1))
| ~ theorem(or(or(or(X0,X1),X1),X0)) ),
inference(resolution,[status(thm)],[f78,f54]) ).
fof(f244,plain,
! [X0,X1,X2] :
( ~ theorem(or(X0,not(or(X1,X2))))
| theorem(or(not(or(X2,X1)),X0)) ),
inference(resolution,[status(thm)],[f58,f12]) ).
fof(f246,plain,
! [X0,X1,X2] :
( ~ theorem(or(X0,not(or(X1,X2))))
| theorem(or(not(X2),X0)) ),
inference(resolution,[status(thm)],[f58,f11]) ).
fof(f251,plain,
! [X0,X1] : theorem(or(not(X0),or(X0,X1))),
inference(resolution,[status(thm)],[f62,f11]) ).
fof(f257,plain,
! [X0,X1,X2] :
( theorem(or(not(X0),or(X1,X2)))
| ~ axiom(or(not(X0),X1)) ),
inference(resolution,[status(thm)],[f251,f19]) ).
fof(f473,plain,
! [X0,X1,X2] :
( theorem(or(or(X0,X1),X2))
| ~ theorem(or(X0,or(or(or(or(X0,X1),X2),X2),X1))) ),
inference(resolution,[status(thm)],[f95,f71]) ).
fof(f768,plain,
! [X0,X1,X2] :
( theorem(or(not(X0),X1))
| ~ theorem(or(not(or(X2,X0)),X1)) ),
inference(resolution,[status(thm)],[f246,f54]) ).
fof(f1071,plain,
! [X0,X1,X2] : theorem(or(not(or(X0,X1)),or(or(X1,X0),X2))),
inference(resolution,[status(thm)],[f257,f12]) ).
fof(f1645,plain,
! [X0,X1,X2] : theorem(or(not(X0),or(or(X0,X1),X2))),
inference(resolution,[status(thm)],[f768,f1071]) ).
fof(f1653,plain,
! [X0,X1,X2] :
( theorem(or(not(X0),X1))
| ~ theorem(or(X1,not(or(X0,X2)))) ),
inference(resolution,[status(thm)],[f768,f244]) ).
fof(f1732,plain,
! [X0,X1,X2,X3] : theorem(or(not(X0),or(or(or(X1,X0),X2),X3))),
inference(resolution,[status(thm)],[f1645,f768]) ).
fof(f1979,plain,
! [X0,X1] : theorem(or(or(not(X0),X1),X0)),
inference(resolution,[status(thm)],[f473,f1732]) ).
fof(f3647,plain,
! [X0,X1,X2] : theorem(or(not(X0),or(not(not(or(X0,X1))),X2))),
inference(resolution,[status(thm)],[f1653,f1979]) ).
fof(f3918,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[f76,f3647]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : LCL201-1 : TPTP v8.1.2. Released v1.1.0.
% 0.04/0.14 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34 % Computer : n003.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:27:48 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % Drodi V3.6.0
% 2.55/0.70 % Refutation found
% 2.55/0.70 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 2.55/0.70 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 3.16/0.88 % Elapsed time: 0.526788 seconds
% 3.16/0.88 % CPU time: 3.181383 seconds
% 3.16/0.88 % Total memory used: 113.982 MB
% 3.16/0.88 % Net memory used: 110.553 MB
%------------------------------------------------------------------------------