TSTP Solution File: LCL287-3 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : LCL287-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 : Tue Apr 30 20:26:55 EDT 2024
% Result : Unsatisfiable 0.09s 0.38s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 10
% Syntax : Number of formulae : 54 ( 42 unt; 0 def)
% Number of atoms : 69 ( 8 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 34 ( 19 ~; 15 |; 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 : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 92 ( 92 !; 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,axiom,
! [P,Q] : equivalent(P,Q) = and(implies(P,Q),implies(Q,P)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f11,negated_conjecture,
~ theorem(equivalent(and(p,q),not(or(not(p),not(q))))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f12,plain,
! [X0] : axiom(implies(or(X0,X0),X0)),
inference(cnf_transformation,[status(esa)],[f1]) ).
fof(f13,plain,
! [X0,X1] : axiom(implies(X0,or(X1,X0))),
inference(cnf_transformation,[status(esa)],[f2]) ).
fof(f14,plain,
! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f15,plain,
! [X0,X1,X2] : axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f17,plain,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
inference(cnf_transformation,[status(esa)],[f6]) ).
fof(f18,plain,
! [X0] :
( theorem(X0)
| ~ axiom(X0) ),
inference(cnf_transformation,[status(esa)],[f7]) ).
fof(f19,plain,
! [Y] :
( ! [X] :
( theorem(X)
| ~ theorem(implies(Y,X)) )
| ~ theorem(Y) ),
inference(miniscoping,[status(esa)],[f8]) ).
fof(f20,plain,
! [X0,X1] :
( theorem(X0)
| ~ theorem(implies(X1,X0))
| ~ theorem(X1) ),
inference(cnf_transformation,[status(esa)],[f19]) ).
fof(f21,plain,
! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
inference(cnf_transformation,[status(esa)],[f9]) ).
fof(f22,plain,
! [X0,X1] : equivalent(X0,X1) = and(implies(X0,X1),implies(X1,X0)),
inference(cnf_transformation,[status(esa)],[f10]) ).
fof(f23,plain,
~ theorem(equivalent(and(p,q),not(or(not(p),not(q))))),
inference(cnf_transformation,[status(esa)],[f11]) ).
fof(f24,plain,
~ theorem(equivalent(and(p,q),not(implies(p,not(q))))),
inference(backward_demodulation,[status(thm)],[f17,f23]) ).
fof(f25,plain,
! [X0,X1] : and(X0,X1) = not(implies(X0,not(X1))),
inference(forward_demodulation,[status(thm)],[f17,f21]) ).
fof(f26,plain,
~ theorem(equivalent(and(p,q),and(p,q))),
inference(backward_demodulation,[status(thm)],[f25,f24]) ).
fof(f28,plain,
! [X0,X1,X2] : implies(implies(X0,not(X1)),X2) = or(and(X0,X1),X2),
inference(paramodulation,[status(thm)],[f25,f17]) ).
fof(f142,plain,
! [X0] : theorem(implies(or(X0,X0),X0)),
inference(resolution,[status(thm)],[f12,f18]) ).
fof(f145,plain,
! [X0,X1] : theorem(implies(X0,or(X1,X0))),
inference(resolution,[status(thm)],[f13,f18]) ).
fof(f149,plain,
! [X0] :
( theorem(X0)
| ~ theorem(or(X0,X0)) ),
inference(resolution,[status(thm)],[f142,f20]) ).
fof(f150,plain,
! [X0] : theorem(implies(implies(X0,not(X0)),not(X0))),
inference(paramodulation,[status(thm)],[f17,f142]) ).
fof(f151,plain,
! [X0] : theorem(or(and(X0,X0),not(X0))),
inference(forward_demodulation,[status(thm)],[f28,f150]) ).
fof(f152,plain,
! [X0,X1] :
( theorem(or(X0,X1))
| ~ theorem(X1) ),
inference(resolution,[status(thm)],[f145,f20]) ).
fof(f199,plain,
! [X0,X1] : theorem(implies(or(X0,X1),or(X1,X0))),
inference(resolution,[status(thm)],[f14,f18]) ).
fof(f218,plain,
! [X0,X1,X2] : theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
inference(resolution,[status(thm)],[f15,f18]) ).
fof(f236,plain,
! [X0,X1] :
( theorem(or(X0,X1))
| ~ theorem(or(X1,X0)) ),
inference(resolution,[status(thm)],[f199,f20]) ).
fof(f242,plain,
! [X0,X1] : theorem(implies(or(X0,not(X1)),implies(X1,X0))),
inference(paramodulation,[status(thm)],[f17,f199]) ).
fof(f364,plain,
! [X0] : theorem(or(not(X0),and(X0,X0))),
inference(resolution,[status(thm)],[f236,f151]) ).
fof(f365,plain,
! [X0] : theorem(implies(X0,and(X0,X0))),
inference(forward_demodulation,[status(thm)],[f17,f364]) ).
fof(f366,plain,
! [X0,X1] :
( theorem(or(X0,not(X1)))
| ~ theorem(implies(X1,X0)) ),
inference(paramodulation,[status(thm)],[f17,f236]) ).
fof(f374,plain,
! [X0] : theorem(implies(implies(X0,X0),equivalent(X0,X0))),
inference(paramodulation,[status(thm)],[f22,f365]) ).
fof(f426,plain,
! [X0,X1,X2] :
( theorem(or(X0,or(X1,X2)))
| ~ theorem(or(X1,or(X0,X2))) ),
inference(resolution,[status(thm)],[f218,f20]) ).
fof(f513,plain,
! [X0] :
( theorem(equivalent(X0,X0))
| ~ theorem(implies(X0,X0)) ),
inference(resolution,[status(thm)],[f374,f20]) ).
fof(f678,plain,
! [X0,X1] :
( theorem(implies(X0,X1))
| ~ theorem(or(X1,not(X0))) ),
inference(resolution,[status(thm)],[f242,f20]) ).
fof(f717,plain,
! [X0,X1] : theorem(or(or(X0,X1),not(X1))),
inference(resolution,[status(thm)],[f366,f145]) ).
fof(f782,plain,
! [X0,X1,X2] : theorem(or(X0,or(or(X1,X2),not(X2)))),
inference(resolution,[status(thm)],[f717,f152]) ).
fof(f1285,plain,
! [X0,X1,X2] : theorem(or(or(X0,X1),or(X2,not(X1)))),
inference(resolution,[status(thm)],[f426,f782]) ).
fof(f1308,plain,
! [X0,X1,X2] : theorem(or(or(X0,not(X1)),or(X2,X1))),
inference(resolution,[status(thm)],[f1285,f236]) ).
fof(f1546,plain,
! [X0,X1,X2] : theorem(or(X0,or(or(X1,not(X2)),X2))),
inference(resolution,[status(thm)],[f1308,f426]) ).
fof(f1715,plain,
! [X0,X1] : theorem(or(or(X0,not(X1)),X1)),
inference(resolution,[status(thm)],[f1546,f149]) ).
fof(f1729,plain,
! [X0,X1] : theorem(or(X0,or(X1,not(X0)))),
inference(resolution,[status(thm)],[f1715,f236]) ).
fof(f1741,plain,
! [X0,X1] : theorem(or(X0,or(X1,not(X1)))),
inference(resolution,[status(thm)],[f1729,f426]) ).
fof(f1775,plain,
! [X0] : theorem(or(X0,not(X0))),
inference(resolution,[status(thm)],[f1741,f149]) ).
fof(f1788,plain,
! [X0] : theorem(implies(X0,X0)),
inference(resolution,[status(thm)],[f1775,f678]) ).
fof(f1801,plain,
! [X0] : theorem(equivalent(X0,X0)),
inference(backward_subsumption_resolution,[status(thm)],[f513,f1788]) ).
fof(f1830,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[f26,f1801]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.11 % Problem : LCL287-3 : TPTP v8.1.2. Released v2.3.0.
% 0.08/0.12 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.09/0.32 % Computer : n024.cluster.edu
% 0.09/0.32 % Model : x86_64 x86_64
% 0.09/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.32 % Memory : 8042.1875MB
% 0.09/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.32 % CPULimit : 300
% 0.09/0.32 % WCLimit : 300
% 0.09/0.32 % DateTime : Mon Apr 29 20:12:21 EDT 2024
% 0.09/0.32 % CPUTime :
% 0.09/0.33 % Drodi V3.6.0
% 0.09/0.38 % Refutation found
% 0.09/0.38 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.09/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.09/0.40 % Elapsed time: 0.073192 seconds
% 0.09/0.40 % CPU time: 0.496916 seconds
% 0.09/0.40 % Total memory used: 57.526 MB
% 0.09/0.40 % Net memory used: 57.100 MB
%------------------------------------------------------------------------------