TSTP Solution File: LCL236-3 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : LCL236-3 : TPTP v8.1.2. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n024.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:48 EDT 2023
% Result : Unsatisfiable 0.19s 0.45s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 9
% Syntax : Number of formulae : 42 ( 32 unt; 0 def)
% Number of atoms : 55 ( 6 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 30 ( 17 ~; 13 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 76 (; 76 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [A] : axiom(implies(or(A,A),A)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f2,axiom,
! [A,B] : axiom(implies(A,or(B,A))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f3,axiom,
! [A,B] : axiom(implies(or(A,B),or(B,A))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f4,axiom,
! [A,B,C] : axiom(implies(or(A,or(B,C)),or(B,or(A,C)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f6,axiom,
! [X,Y] : implies(X,Y) = or(not(X),Y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f7,axiom,
! [X] :
( theorem(X)
| ~ axiom(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f8,axiom,
! [X,Y] :
( theorem(X)
| ~ theorem(implies(Y,X))
| ~ theorem(Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f9,axiom,
! [P,Q] : and(P,Q) = not(or(not(P),not(Q))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f10,negated_conjecture,
~ theorem(implies(or(not(p),not(q)),not(and(p,q)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f11,plain,
! [X0] : axiom(implies(or(X0,X0),X0)),
inference(cnf_transformation,[status(esa)],[f1]) ).
fof(f12,plain,
! [X0,X1] : axiom(implies(X0,or(X1,X0))),
inference(cnf_transformation,[status(esa)],[f2]) ).
fof(f13,plain,
! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f14,plain,
! [X0,X1,X2] : axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f16,plain,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
inference(cnf_transformation,[status(esa)],[f6]) ).
fof(f17,plain,
! [X0] :
( theorem(X0)
| ~ axiom(X0) ),
inference(cnf_transformation,[status(esa)],[f7]) ).
fof(f18,plain,
! [Y] :
( ! [X] :
( theorem(X)
| ~ theorem(implies(Y,X)) )
| ~ theorem(Y) ),
inference(miniscoping,[status(esa)],[f8]) ).
fof(f19,plain,
! [X0,X1] :
( theorem(X0)
| ~ theorem(implies(X1,X0))
| ~ theorem(X1) ),
inference(cnf_transformation,[status(esa)],[f18]) ).
fof(f20,plain,
! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
inference(cnf_transformation,[status(esa)],[f9]) ).
fof(f21,plain,
~ theorem(implies(or(not(p),not(q)),not(and(p,q)))),
inference(cnf_transformation,[status(esa)],[f10]) ).
fof(f22,plain,
~ theorem(implies(implies(p,not(q)),not(and(p,q)))),
inference(backward_demodulation,[status(thm)],[f16,f21]) ).
fof(f23,plain,
! [X0,X1] : and(X0,X1) = not(implies(X0,not(X1))),
inference(forward_demodulation,[status(thm)],[f16,f20]) ).
fof(f25,plain,
! [X0,X1,X2] : implies(implies(X0,not(X1)),X2) = or(and(X0,X1),X2),
inference(paramodulation,[status(thm)],[f23,f16]) ).
fof(f26,plain,
~ theorem(or(and(p,q),not(and(p,q)))),
inference(backward_demodulation,[status(thm)],[f25,f22]) ).
fof(f148,plain,
! [X0] : theorem(implies(or(X0,X0),X0)),
inference(resolution,[status(thm)],[f11,f17]) ).
fof(f151,plain,
! [X0,X1] : theorem(implies(X0,or(X1,X0))),
inference(resolution,[status(thm)],[f12,f17]) ).
fof(f155,plain,
! [X0] :
( theorem(X0)
| ~ theorem(or(X0,X0)) ),
inference(resolution,[status(thm)],[f148,f19]) ).
fof(f158,plain,
! [X0,X1] :
( theorem(or(X0,X1))
| ~ theorem(X1) ),
inference(resolution,[status(thm)],[f151,f19]) ).
fof(f205,plain,
! [X0,X1] : theorem(implies(or(X0,X1),or(X1,X0))),
inference(resolution,[status(thm)],[f13,f17]) ).
fof(f224,plain,
! [X0,X1,X2] : theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
inference(resolution,[status(thm)],[f14,f17]) ).
fof(f242,plain,
! [X0,X1] :
( theorem(or(X0,X1))
| ~ theorem(or(X1,X0)) ),
inference(resolution,[status(thm)],[f205,f19]) ).
fof(f373,plain,
! [X0,X1] :
( theorem(or(X0,not(X1)))
| ~ theorem(implies(X1,X0)) ),
inference(paramodulation,[status(thm)],[f16,f242]) ).
fof(f433,plain,
! [X0,X1,X2] :
( theorem(or(X0,or(X1,X2)))
| ~ theorem(or(X1,or(X0,X2))) ),
inference(resolution,[status(thm)],[f224,f19]) ).
fof(f691,plain,
! [X0,X1] : theorem(or(or(X0,X1),not(X1))),
inference(resolution,[status(thm)],[f373,f151]) ).
fof(f715,plain,
! [X0,X1,X2] : theorem(or(X0,or(or(X1,X2),not(X2)))),
inference(resolution,[status(thm)],[f691,f158]) ).
fof(f1256,plain,
! [X0,X1,X2] : theorem(or(or(X0,X1),or(X2,not(X1)))),
inference(resolution,[status(thm)],[f433,f715]) ).
fof(f1296,plain,
! [X0,X1,X2] : theorem(or(or(X0,not(X1)),or(X2,X1))),
inference(resolution,[status(thm)],[f1256,f242]) ).
fof(f1533,plain,
! [X0,X1,X2] : theorem(or(X0,or(or(X1,not(X2)),X2))),
inference(resolution,[status(thm)],[f1296,f433]) ).
fof(f1679,plain,
! [X0,X1] : theorem(or(or(X0,not(X1)),X1)),
inference(resolution,[status(thm)],[f1533,f155]) ).
fof(f1693,plain,
! [X0,X1] : theorem(or(X0,or(X1,not(X0)))),
inference(resolution,[status(thm)],[f1679,f242]) ).
fof(f1705,plain,
! [X0,X1] : theorem(or(X0,or(X1,not(X1)))),
inference(resolution,[status(thm)],[f1693,f433]) ).
fof(f1739,plain,
! [X0] : theorem(or(X0,not(X0))),
inference(resolution,[status(thm)],[f1705,f155]) ).
fof(f1751,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[f26,f1739]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL236-3 : TPTP v8.1.2. Released v2.3.0.
% 0.13/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34 % Computer : n024.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:43:48 EDT 2023
% 0.19/0.34 % CPUTime :
% 0.19/0.35 % Drodi V3.5.1
% 0.19/0.45 % Refutation found
% 0.19/0.45 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.19/0.45 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.19/0.48 % Elapsed time: 0.132659 seconds
% 0.19/0.48 % CPU time: 0.267217 seconds
% 0.19/0.48 % Memory used: 25.018 MB
%------------------------------------------------------------------------------