TSTP Solution File: LCL218-10 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : LCL218-10 : TPTP v8.1.2. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n006.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:42 EDT 2023
% Result : Timeout 297.81s 37.89s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 8
% Syntax : Number of formulae : 36 ( 36 unt; 0 def)
% Number of atoms : 36 ( 35 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-4 aty)
% Number of variables : 82 (; 82 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [A,B,C] : ifeq(A,A,B,C) = B,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f3,axiom,
! [A,B] : axiom(or(not(A),or(B,A))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f4,axiom,
! [A,B] : axiom(or(not(or(A,B)),or(B,A))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f5,axiom,
! [A,B,C] : axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f7,axiom,
! [X] : ifeq(axiom(X),true,theorem(X),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f8,axiom,
! [Y,X] : ifeq(theorem(Y),true,ifeq(axiom(or(not(Y),X)),true,theorem(X),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f9,axiom,
! [Y,Z,X] : ifeq(theorem(or(not(Y),Z)),true,ifeq(axiom(or(not(X),Y)),true,theorem(or(not(X),Z)),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f10,negated_conjecture,
theorem(or(not(or(not(or(p,q)),q)),or(not(p),q))) != true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f11,plain,
! [X0,X1,X2] : ifeq(X0,X0,X1,X2) = X1,
inference(cnf_transformation,[status(esa)],[f1]) ).
fof(f13,plain,
! [X0,X1] : axiom(or(not(X0),or(X1,X0))) = true,
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f14,plain,
! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))) = true,
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f15,plain,
! [X0,X1,X2] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))) = true,
inference(cnf_transformation,[status(esa)],[f5]) ).
fof(f17,plain,
! [X0] : ifeq(axiom(X0),true,theorem(X0),true) = true,
inference(cnf_transformation,[status(esa)],[f7]) ).
fof(f18,plain,
! [X0,X1] : ifeq(theorem(X0),true,ifeq(axiom(or(not(X0),X1)),true,theorem(X1),true),true) = true,
inference(cnf_transformation,[status(esa)],[f8]) ).
fof(f19,plain,
! [X0,X1,X2] : ifeq(theorem(or(not(X0),X1)),true,ifeq(axiom(or(not(X2),X0)),true,theorem(or(not(X2),X1)),true),true) = true,
inference(cnf_transformation,[status(esa)],[f9]) ).
fof(f20,plain,
theorem(or(not(or(not(or(p,q)),q)),or(not(p),q))) != true,
inference(cnf_transformation,[status(esa)],[f10]) ).
fof(f27,plain,
! [X0,X1] : ifeq(true,true,theorem(or(not(or(X0,X1)),or(X1,X0))),true) = true,
inference(paramodulation,[status(thm)],[f14,f17]) ).
fof(f28,plain,
! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))) = true,
inference(forward_demodulation,[status(thm)],[f11,f27]) ).
fof(f49,plain,
! [X0,X1,X2] : ifeq(theorem(or(X0,or(X1,X2))),true,ifeq(true,true,theorem(or(X1,or(X0,X2))),true),true) = true,
inference(paramodulation,[status(thm)],[f15,f18]) ).
fof(f50,plain,
! [X0,X1,X2] : ifeq(theorem(or(X0,or(X1,X2))),true,theorem(or(X1,or(X0,X2))),true) = true,
inference(forward_demodulation,[status(thm)],[f11,f49]) ).
fof(f122,plain,
! [X0,X1,X2] : ifeq(theorem(or(not(or(X0,X1)),X2)),true,ifeq(true,true,theorem(or(not(or(X1,X0)),X2)),true),true) = true,
inference(paramodulation,[status(thm)],[f14,f19]) ).
fof(f123,plain,
! [X0,X1,X2] : ifeq(theorem(or(not(or(X0,X1)),X2)),true,theorem(or(not(or(X1,X0)),X2)),true) = true,
inference(forward_demodulation,[status(thm)],[f11,f122]) ).
fof(f126,plain,
! [X0,X1,X2] : ifeq(theorem(or(not(or(X0,X1)),X2)),true,ifeq(true,true,theorem(or(not(X1),X2)),true),true) = true,
inference(paramodulation,[status(thm)],[f13,f19]) ).
fof(f127,plain,
! [X0,X1,X2] : ifeq(theorem(or(not(or(X0,X1)),X2)),true,theorem(or(not(X1),X2)),true) = true,
inference(forward_demodulation,[status(thm)],[f11,f126]) ).
fof(f434,plain,
! [X0,X1] : ifeq(true,true,theorem(or(X0,or(not(or(X1,X0)),X1))),true) = true,
inference(paramodulation,[status(thm)],[f28,f50]) ).
fof(f435,plain,
! [X0,X1] : theorem(or(X0,or(not(or(X1,X0)),X1))) = true,
inference(forward_demodulation,[status(thm)],[f11,f434]) ).
fof(f963,plain,
! [X0,X1,X2] : ifeq(true,true,theorem(or(not(or(X0,X1)),or(not(or(X2,not(or(X1,X0)))),X2))),true) = true,
inference(paramodulation,[status(thm)],[f435,f123]) ).
fof(f964,plain,
! [X0,X1,X2] : theorem(or(not(or(X0,X1)),or(not(or(X2,not(or(X1,X0)))),X2))) = true,
inference(forward_demodulation,[status(thm)],[f11,f963]) ).
fof(f18060,plain,
! [X0,X1,X2] : ifeq(true,true,theorem(or(not(X0),or(not(or(X1,not(or(X0,X2)))),X1))),true) = true,
inference(paramodulation,[status(thm)],[f964,f127]) ).
fof(f18061,plain,
! [X0,X1,X2] : theorem(or(not(X0),or(not(or(X1,not(or(X0,X2)))),X1))) = true,
inference(forward_demodulation,[status(thm)],[f11,f18060]) ).
fof(f239223,plain,
! [X0,X1,X2] : ifeq(true,true,theorem(or(not(or(X0,not(or(X1,X2)))),or(not(X1),X0))),true) = true,
inference(paramodulation,[status(thm)],[f18061,f50]) ).
fof(f239224,plain,
! [X0,X1,X2] : theorem(or(not(or(X0,not(or(X1,X2)))),or(not(X1),X0))) = true,
inference(forward_demodulation,[status(thm)],[f11,f239223]) ).
fof(f268129,plain,
! [X0,X1,X2] : ifeq(true,true,theorem(or(not(or(not(or(X0,X1)),X2)),or(not(X0),X2))),true) = true,
inference(paramodulation,[status(thm)],[f239224,f123]) ).
fof(f268130,plain,
! [X0,X1,X2] : theorem(or(not(or(not(or(X0,X1)),X2)),or(not(X0),X2))) = true,
inference(forward_demodulation,[status(thm)],[f11,f268129]) ).
fof(f303102,plain,
true != true,
inference(backward_demodulation,[status(thm)],[f268130,f20]) ).
fof(f303103,plain,
$false,
inference(trivial_equality_resolution,[status(esa)],[f303102]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.09 % Problem : LCL218-10 : TPTP v8.1.2. Released v7.3.0.
% 0.07/0.10 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.30 % Computer : n006.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Tue May 30 09:44:32 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.10/0.30 % Drodi V3.5.1
% 297.81/37.89 % Refutation found
% 297.81/37.89 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 297.81/37.89 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 300.37/38.21 % SZS status Timeout for theBenchmark.p: Process timeout. CPU time limit exceeded (SIGXCPU)
%------------------------------------------------------------------------------