TSTP Solution File: LCL320-3 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : LCL320-3 : TPTP v8.1.2. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n016.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:57 EDT 2024
% Result : Unsatisfiable 24.25s 3.45s
% Output : CNFRefutation 24.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 9
% Syntax : Number of formulae : 51 ( 37 unt; 0 def)
% Number of atoms : 68 ( 2 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 36 ( 19 ~; 17 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 112 ( 112 !; 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(f5,axiom,
! [A,B,C] : axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))),
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,negated_conjecture,
~ theorem(or(implies(p,q),implies(not(p),q))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f10,plain,
! [X0] : axiom(implies(or(X0,X0),X0)),
inference(cnf_transformation,[status(esa)],[f1]) ).
fof(f11,plain,
! [X0,X1] : axiom(implies(X0,or(X1,X0))),
inference(cnf_transformation,[status(esa)],[f2]) ).
fof(f12,plain,
! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f13,plain,
! [X0,X1,X2] : axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f14,plain,
! [X0,X1,X2] : axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
inference(cnf_transformation,[status(esa)],[f5]) ).
fof(f15,plain,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
inference(cnf_transformation,[status(esa)],[f6]) ).
fof(f16,plain,
! [X0] :
( theorem(X0)
| ~ axiom(X0) ),
inference(cnf_transformation,[status(esa)],[f7]) ).
fof(f17,plain,
! [Y] :
( ! [X] :
( theorem(X)
| ~ theorem(implies(Y,X)) )
| ~ theorem(Y) ),
inference(miniscoping,[status(esa)],[f8]) ).
fof(f18,plain,
! [X0,X1] :
( theorem(X0)
| ~ theorem(implies(X1,X0))
| ~ theorem(X1) ),
inference(cnf_transformation,[status(esa)],[f17]) ).
fof(f19,plain,
~ theorem(or(implies(p,q),implies(not(p),q))),
inference(cnf_transformation,[status(esa)],[f9]) ).
fof(f20,plain,
! [X0] : theorem(implies(or(X0,X0),X0)),
inference(resolution,[status(thm)],[f10,f16]) ).
fof(f22,plain,
! [X0] :
( theorem(X0)
| ~ theorem(or(X0,X0)) ),
inference(resolution,[status(thm)],[f20,f18]) ).
fof(f27,plain,
! [X0,X1] : theorem(implies(X0,or(X1,X0))),
inference(resolution,[status(thm)],[f11,f16]) ).
fof(f29,plain,
! [X0,X1] :
( theorem(or(X0,X1))
| ~ theorem(X1) ),
inference(resolution,[status(thm)],[f27,f18]) ).
fof(f41,plain,
! [X0,X1] : theorem(implies(or(X0,X1),or(X1,X0))),
inference(resolution,[status(thm)],[f12,f16]) ).
fof(f90,plain,
! [X0,X1,X2] : theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
inference(resolution,[status(thm)],[f13,f16]) ).
fof(f99,plain,
! [X0,X1,X2] : theorem(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
inference(resolution,[status(thm)],[f14,f16]) ).
fof(f109,plain,
! [X0,X1] :
( theorem(or(X0,X1))
| ~ theorem(or(X1,X0)) ),
inference(resolution,[status(thm)],[f41,f18]) ).
fof(f113,plain,
! [X0,X1] : theorem(implies(or(X0,not(X1)),implies(X1,X0))),
inference(paramodulation,[status(thm)],[f15,f41]) ).
fof(f151,plain,
! [X0,X1] :
( theorem(or(X0,not(X1)))
| ~ theorem(implies(X1,X0)) ),
inference(paramodulation,[status(thm)],[f15,f109]) ).
fof(f165,plain,
! [X0,X1,X2] :
( theorem(or(X0,or(X1,X2)))
| ~ theorem(or(X1,or(X0,X2))) ),
inference(resolution,[status(thm)],[f90,f18]) ).
fof(f204,plain,
! [X0,X1] : theorem(or(or(X0,X1),not(X1))),
inference(resolution,[status(thm)],[f151,f27]) ).
fof(f219,plain,
! [X0,X1,X2] : theorem(or(X0,or(or(X1,X2),not(X2)))),
inference(resolution,[status(thm)],[f204,f29]) ).
fof(f232,plain,
! [X0,X1,X2] :
( theorem(implies(or(X0,X1),or(X0,X2)))
| ~ theorem(implies(X1,X2)) ),
inference(resolution,[status(thm)],[f99,f18]) ).
fof(f450,plain,
! [X0,X1,X2] : theorem(or(or(X0,X1),or(X2,not(X1)))),
inference(resolution,[status(thm)],[f165,f219]) ).
fof(f475,plain,
! [X0,X1,X2] : theorem(or(or(X0,not(X1)),or(X2,X1))),
inference(resolution,[status(thm)],[f450,f109]) ).
fof(f499,plain,
! [X0,X1,X2] : theorem(or(X0,or(or(X1,not(X2)),X2))),
inference(resolution,[status(thm)],[f475,f165]) ).
fof(f532,plain,
! [X0,X1] : theorem(or(or(X0,not(X1)),X1)),
inference(resolution,[status(thm)],[f499,f22]) ).
fof(f540,plain,
! [X0,X1] : theorem(or(X0,or(X1,not(X0)))),
inference(resolution,[status(thm)],[f532,f109]) ).
fof(f800,plain,
! [X0,X1,X2] : theorem(implies(or(X0,or(X1,not(X2))),or(X0,implies(X2,X1)))),
inference(resolution,[status(thm)],[f232,f113]) ).
fof(f802,plain,
! [X0,X1,X2] : theorem(implies(or(X0,or(X1,X2)),or(X0,or(X2,X1)))),
inference(resolution,[status(thm)],[f232,f41]) ).
fof(f815,plain,
! [X0,X1,X2] : theorem(implies(or(X0,X1),or(X0,or(X2,X1)))),
inference(resolution,[status(thm)],[f232,f27]) ).
fof(f3528,plain,
! [X0,X1,X2] :
( theorem(or(X0,implies(X1,X2)))
| ~ theorem(or(X0,or(X2,not(X1)))) ),
inference(resolution,[status(thm)],[f800,f18]) ).
fof(f3575,plain,
! [X0,X1,X2] :
( theorem(or(X0,or(X1,X2)))
| ~ theorem(or(X0,or(X2,X1))) ),
inference(resolution,[status(thm)],[f802,f18]) ).
fof(f3888,plain,
! [X0,X1,X2] :
( theorem(or(X0,or(X1,X2)))
| ~ theorem(or(X0,X2)) ),
inference(resolution,[status(thm)],[f815,f18]) ).
fof(f38649,plain,
! [X0,X1] : theorem(or(X0,implies(X0,X1))),
inference(resolution,[status(thm)],[f3528,f540]) ).
fof(f38736,plain,
! [X0,X1] : theorem(or(implies(X0,X1),X0)),
inference(resolution,[status(thm)],[f38649,f109]) ).
fof(f38856,plain,
! [X0,X1,X2] : theorem(or(implies(X0,X1),or(X2,X0))),
inference(resolution,[status(thm)],[f38736,f3888]) ).
fof(f45791,plain,
! [X0,X1,X2] : theorem(or(implies(X0,X1),or(X0,X2))),
inference(resolution,[status(thm)],[f3575,f38856]) ).
fof(f46017,plain,
! [X0,X1,X2] : theorem(or(or(X0,X1),implies(X0,X2))),
inference(resolution,[status(thm)],[f45791,f109]) ).
fof(f46166,plain,
! [X0,X1,X2] : theorem(or(implies(X0,X1),implies(not(X0),X2))),
inference(paramodulation,[status(thm)],[f15,f46017]) ).
fof(f50138,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[f19,f46166]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.13 % Problem : LCL320-3 : TPTP v8.1.2. Released v2.3.0.
% 0.09/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.09/0.34 % Computer : n016.cluster.edu
% 0.09/0.34 % Model : x86_64 x86_64
% 0.09/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.34 % Memory : 8042.1875MB
% 0.09/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.34 % CPULimit : 300
% 0.09/0.34 % WCLimit : 300
% 0.09/0.34 % DateTime : Mon Apr 29 20:54:10 EDT 2024
% 0.15/0.34 % CPUTime :
% 0.15/0.35 % Drodi V3.6.0
% 24.25/3.45 % Refutation found
% 24.25/3.45 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 24.25/3.45 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 24.69/3.53 % Elapsed time: 3.180792 seconds
% 24.69/3.53 % CPU time: 24.901903 seconds
% 24.69/3.53 % Total memory used: 281.687 MB
% 24.69/3.53 % Net memory used: 262.507 MB
%------------------------------------------------------------------------------