TSTP Solution File: KLE144+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : KLE144+1 : TPTP v8.1.2. Released v4.0.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:15:53 EDT 2023
% Result : Theorem 3.10s 0.82s
% Output : CNFRefutation 3.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 33
% Number of leaves : 23
% Syntax : Number of formulae : 129 ( 57 unt; 0 def)
% Number of atoms : 209 ( 69 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 144 ( 64 ~; 66 |; 2 &)
% ( 10 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 12 ( 10 usr; 10 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 137 (; 136 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [A,B] : addition(A,B) = addition(B,A),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f2,axiom,
! [C,B,A] : addition(A,addition(B,C)) = addition(addition(A,B),C),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f3,axiom,
! [A] : addition(A,zero) = A,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f4,axiom,
! [A] : addition(A,A) = A,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f6,axiom,
! [A] : multiplication(A,one) = A,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f7,axiom,
! [A] : multiplication(one,A) = A,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f9,axiom,
! [A,B,C] : multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f10,axiom,
! [A] : multiplication(zero,A) = zero,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f12,axiom,
! [A] : addition(one,multiplication(star(A),A)) = star(A),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f14,axiom,
! [A,B,C] :
( leq(addition(multiplication(C,A),B),C)
=> leq(multiplication(B,star(A)),C) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f15,axiom,
! [A] : strong_iteration(A) = addition(multiplication(A,strong_iteration(A)),one),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f16,axiom,
! [A,B,C] :
( leq(C,addition(multiplication(A,C),B))
=> leq(C,multiplication(strong_iteration(A),B)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f18,axiom,
! [A,B] :
( leq(A,B)
<=> addition(A,B) = B ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f19,conjecture,
! [X0] : strong_iteration(star(X0)) = strong_iteration(one),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f20,negated_conjecture,
~ ! [X0] : strong_iteration(star(X0)) = strong_iteration(one),
inference(negated_conjecture,[status(cth)],[f19]) ).
fof(f21,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[status(esa)],[f1]) ).
fof(f22,plain,
! [X0,X1,X2] : addition(X0,addition(X1,X2)) = addition(addition(X0,X1),X2),
inference(cnf_transformation,[status(esa)],[f2]) ).
fof(f23,plain,
! [X0] : addition(X0,zero) = X0,
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f24,plain,
! [X0] : addition(X0,X0) = X0,
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f26,plain,
! [X0] : multiplication(X0,one) = X0,
inference(cnf_transformation,[status(esa)],[f6]) ).
fof(f27,plain,
! [X0] : multiplication(one,X0) = X0,
inference(cnf_transformation,[status(esa)],[f7]) ).
fof(f29,plain,
! [X0,X1,X2] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
inference(cnf_transformation,[status(esa)],[f9]) ).
fof(f30,plain,
! [X0] : multiplication(zero,X0) = zero,
inference(cnf_transformation,[status(esa)],[f10]) ).
fof(f32,plain,
! [X0] : addition(one,multiplication(star(X0),X0)) = star(X0),
inference(cnf_transformation,[status(esa)],[f12]) ).
fof(f35,plain,
! [A,B,C] :
( ~ leq(addition(multiplication(C,A),B),C)
| leq(multiplication(B,star(A)),C) ),
inference(pre_NNF_transformation,[status(esa)],[f14]) ).
fof(f36,plain,
! [X0,X1,X2] :
( ~ leq(addition(multiplication(X0,X1),X2),X0)
| leq(multiplication(X2,star(X1)),X0) ),
inference(cnf_transformation,[status(esa)],[f35]) ).
fof(f37,plain,
! [X0] : strong_iteration(X0) = addition(multiplication(X0,strong_iteration(X0)),one),
inference(cnf_transformation,[status(esa)],[f15]) ).
fof(f38,plain,
! [A,B,C] :
( ~ leq(C,addition(multiplication(A,C),B))
| leq(C,multiplication(strong_iteration(A),B)) ),
inference(pre_NNF_transformation,[status(esa)],[f16]) ).
fof(f39,plain,
! [X0,X1,X2] :
( ~ leq(X0,addition(multiplication(X1,X0),X2))
| leq(X0,multiplication(strong_iteration(X1),X2)) ),
inference(cnf_transformation,[status(esa)],[f38]) ).
fof(f41,plain,
! [A,B] :
( ( ~ leq(A,B)
| addition(A,B) = B )
& ( leq(A,B)
| addition(A,B) != B ) ),
inference(NNF_transformation,[status(esa)],[f18]) ).
fof(f42,plain,
( ! [A,B] :
( ~ leq(A,B)
| addition(A,B) = B )
& ! [A,B] :
( leq(A,B)
| addition(A,B) != B ) ),
inference(miniscoping,[status(esa)],[f41]) ).
fof(f43,plain,
! [X0,X1] :
( ~ leq(X0,X1)
| addition(X0,X1) = X1 ),
inference(cnf_transformation,[status(esa)],[f42]) ).
fof(f44,plain,
! [X0,X1] :
( leq(X0,X1)
| addition(X0,X1) != X1 ),
inference(cnf_transformation,[status(esa)],[f42]) ).
fof(f45,plain,
? [X0] : strong_iteration(star(X0)) != strong_iteration(one),
inference(pre_NNF_transformation,[status(esa)],[f20]) ).
fof(f46,plain,
strong_iteration(star(sk0_0)) != strong_iteration(one),
inference(skolemization,[status(esa)],[f45]) ).
fof(f47,plain,
strong_iteration(star(sk0_0)) != strong_iteration(one),
inference(cnf_transformation,[status(esa)],[f46]) ).
fof(f50,plain,
strong_iteration(one) = addition(strong_iteration(one),one),
inference(paramodulation,[status(thm)],[f27,f37]) ).
fof(f55,plain,
( spl0_0
<=> leq(strong_iteration(one),strong_iteration(one)) ),
introduced(split_symbol_definition) ).
fof(f57,plain,
( ~ leq(strong_iteration(one),strong_iteration(one))
| spl0_0 ),
inference(component_clause,[status(thm)],[f55]) ).
fof(f65,plain,
( spl0_2
<=> leq(star(one),one) ),
introduced(split_symbol_definition) ).
fof(f67,plain,
( ~ leq(star(one),one)
| spl0_2 ),
inference(component_clause,[status(thm)],[f65]) ).
fof(f78,plain,
! [X0,X1] :
( ~ leq(addition(X0,X1),X0)
| leq(multiplication(X1,star(one)),X0) ),
inference(paramodulation,[status(thm)],[f26,f36]) ).
fof(f92,plain,
! [X0,X1] :
( ~ leq(one,addition(X0,X1))
| leq(one,multiplication(strong_iteration(X0),X1)) ),
inference(paramodulation,[status(thm)],[f26,f39]) ).
fof(f110,plain,
( spl0_8
<=> leq(one,strong_iteration(one)) ),
introduced(split_symbol_definition) ).
fof(f111,plain,
( leq(one,strong_iteration(one))
| ~ spl0_8 ),
inference(component_clause,[status(thm)],[f110]) ).
fof(f144,plain,
! [X0] :
( ~ leq(X0,X0)
| leq(multiplication(X0,star(one)),X0) ),
inference(paramodulation,[status(thm)],[f24,f78]) ).
fof(f154,plain,
strong_iteration(zero) = addition(zero,one),
inference(paramodulation,[status(thm)],[f30,f37]) ).
fof(f169,plain,
! [X0] : X0 = addition(zero,X0),
inference(paramodulation,[status(thm)],[f23,f21]) ).
fof(f177,plain,
! [X0,X1,X2] :
( ~ leq(X0,addition(X1,multiplication(X2,X0)))
| leq(X0,multiplication(strong_iteration(X2),X1)) ),
inference(paramodulation,[status(thm)],[f21,f39]) ).
fof(f210,plain,
! [X0] : leq(X0,X0),
inference(resolution,[status(thm)],[f44,f24]) ).
fof(f229,plain,
! [X0,X1] :
( leq(X0,X1)
| addition(X1,X0) != X1 ),
inference(paramodulation,[status(thm)],[f21,f44]) ).
fof(f245,plain,
( spl0_14
<=> strong_iteration(one) = strong_iteration(one) ),
introduced(split_symbol_definition) ).
fof(f247,plain,
( strong_iteration(one) != strong_iteration(one)
| spl0_14 ),
inference(component_clause,[status(thm)],[f245]) ).
fof(f248,plain,
( leq(one,strong_iteration(one))
| strong_iteration(one) != strong_iteration(one) ),
inference(paramodulation,[status(thm)],[f50,f229]) ).
fof(f249,plain,
( spl0_8
| ~ spl0_14 ),
inference(split_clause,[status(thm)],[f248,f110,f245]) ).
fof(f264,plain,
( $false
| spl0_14 ),
inference(trivial_equality_resolution,[status(esa)],[f247]) ).
fof(f265,plain,
spl0_14,
inference(contradiction_clause,[status(thm)],[f264]) ).
fof(f286,plain,
! [X0,X1] : addition(X0,addition(X0,X1)) = addition(X0,X1),
inference(paramodulation,[status(thm)],[f24,f22]) ).
fof(f353,plain,
( addition(one,strong_iteration(one)) = strong_iteration(one)
| ~ spl0_8 ),
inference(resolution,[status(thm)],[f111,f43]) ).
fof(f354,plain,
( $false
| spl0_0 ),
inference(forward_subsumption_resolution,[status(thm)],[f57,f210]) ).
fof(f355,plain,
spl0_0,
inference(contradiction_clause,[status(thm)],[f354]) ).
fof(f508,plain,
( spl0_30
<=> leq(multiplication(strong_iteration(one),star(one)),strong_iteration(one)) ),
introduced(split_symbol_definition) ).
fof(f510,plain,
( ~ leq(multiplication(strong_iteration(one),star(one)),strong_iteration(one))
| spl0_30 ),
inference(component_clause,[status(thm)],[f508]) ).
fof(f547,plain,
( spl0_37
<=> leq(multiplication(strong_iteration(one),star(one)),multiplication(strong_iteration(one),star(one))) ),
introduced(split_symbol_definition) ).
fof(f549,plain,
( ~ leq(multiplication(strong_iteration(one),star(one)),multiplication(strong_iteration(one),star(one)))
| spl0_37 ),
inference(component_clause,[status(thm)],[f547]) ).
fof(f560,plain,
( $false
| spl0_37 ),
inference(forward_subsumption_resolution,[status(thm)],[f549,f210]) ).
fof(f561,plain,
spl0_37,
inference(contradiction_clause,[status(thm)],[f560]) ).
fof(f574,plain,
strong_iteration(zero) = one,
inference(forward_demodulation,[status(thm)],[f169,f154]) ).
fof(f617,plain,
! [X0] : leq(multiplication(X0,star(one)),X0),
inference(forward_subsumption_resolution,[status(thm)],[f144,f210]) ).
fof(f618,plain,
( $false
| spl0_30 ),
inference(backward_subsumption_resolution,[status(thm)],[f510,f617]) ).
fof(f619,plain,
spl0_30,
inference(contradiction_clause,[status(thm)],[f618]) ).
fof(f623,plain,
leq(star(one),one),
inference(paramodulation,[status(thm)],[f27,f617]) ).
fof(f624,plain,
( $false
| spl0_2 ),
inference(forward_subsumption_resolution,[status(thm)],[f623,f67]) ).
fof(f625,plain,
spl0_2,
inference(contradiction_clause,[status(thm)],[f624]) ).
fof(f699,plain,
( spl0_44
<=> leq(zero,zero) ),
introduced(split_symbol_definition) ).
fof(f701,plain,
( ~ leq(zero,zero)
| spl0_44 ),
inference(component_clause,[status(thm)],[f699]) ).
fof(f712,plain,
( $false
| spl0_44 ),
inference(forward_subsumption_resolution,[status(thm)],[f701,f210]) ).
fof(f713,plain,
spl0_44,
inference(contradiction_clause,[status(thm)],[f712]) ).
fof(f716,plain,
! [X0,X1] : leq(X0,addition(X0,X1)),
inference(resolution,[status(thm)],[f286,f44]) ).
fof(f724,plain,
! [X0] : addition(one,star(X0)) = addition(one,multiplication(star(X0),X0)),
inference(paramodulation,[status(thm)],[f32,f286]) ).
fof(f725,plain,
! [X0] : addition(one,star(X0)) = star(X0),
inference(forward_demodulation,[status(thm)],[f32,f724]) ).
fof(f730,plain,
! [X0,X1] : addition(X0,addition(X1,X0)) = addition(X0,X1),
inference(paramodulation,[status(thm)],[f21,f286]) ).
fof(f754,plain,
! [X0,X1] : leq(X0,addition(X1,X0)),
inference(paramodulation,[status(thm)],[f21,f716]) ).
fof(f761,plain,
! [X0,X1,X2] : leq(X0,addition(X1,addition(X2,X0))),
inference(paramodulation,[status(thm)],[f22,f754]) ).
fof(f814,plain,
! [X0,X1,X2] : leq(X0,addition(X1,addition(X0,X2))),
inference(paramodulation,[status(thm)],[f21,f761]) ).
fof(f852,plain,
! [X0] :
( leq(one,addition(X0,strong_iteration(one)))
| ~ spl0_8 ),
inference(paramodulation,[status(thm)],[f353,f814]) ).
fof(f957,plain,
! [X0] :
( leq(one,multiplication(strong_iteration(X0),strong_iteration(one)))
| ~ spl0_8 ),
inference(resolution,[status(thm)],[f852,f92]) ).
fof(f976,plain,
! [X0] :
( addition(one,multiplication(strong_iteration(X0),strong_iteration(one))) = multiplication(strong_iteration(X0),strong_iteration(one))
| ~ spl0_8 ),
inference(resolution,[status(thm)],[f957,f43]) ).
fof(f977,plain,
! [X0] :
( addition(multiplication(strong_iteration(X0),strong_iteration(one)),one) = multiplication(strong_iteration(X0),strong_iteration(one))
| ~ spl0_8 ),
inference(forward_demodulation,[status(thm)],[f21,f976]) ).
fof(f1725,plain,
( spl0_50
<=> strong_iteration(strong_iteration(one)) = strong_iteration(strong_iteration(one)) ),
introduced(split_symbol_definition) ).
fof(f1727,plain,
( strong_iteration(strong_iteration(one)) != strong_iteration(strong_iteration(one))
| spl0_50 ),
inference(component_clause,[status(thm)],[f1725]) ).
fof(f1740,plain,
( $false
| spl0_50 ),
inference(trivial_equality_resolution,[status(esa)],[f1727]) ).
fof(f1741,plain,
spl0_50,
inference(contradiction_clause,[status(thm)],[f1740]) ).
fof(f2151,plain,
! [X0,X1] : addition(addition(X0,X1),addition(X0,X1)) = addition(addition(X0,X1),X0),
inference(paramodulation,[status(thm)],[f286,f730]) ).
fof(f2152,plain,
! [X0,X1] : addition(X0,X1) = addition(addition(X0,X1),X0),
inference(forward_demodulation,[status(thm)],[f24,f2151]) ).
fof(f2381,plain,
! [X0,X1] : addition(X0,X1) = addition(addition(X1,X0),X0),
inference(paramodulation,[status(thm)],[f21,f2152]) ).
fof(f3098,plain,
! [X0,X1] :
( ~ leq(X0,addition(X1,X0))
| leq(X0,multiplication(strong_iteration(one),X1)) ),
inference(paramodulation,[status(thm)],[f27,f177]) ).
fof(f3099,plain,
! [X0,X1] : leq(X0,multiplication(strong_iteration(one),X1)),
inference(forward_subsumption_resolution,[status(thm)],[f3098,f754]) ).
fof(f3116,plain,
! [X0] : leq(X0,strong_iteration(one)),
inference(paramodulation,[status(thm)],[f26,f3099]) ).
fof(f3126,plain,
! [X0] : addition(X0,strong_iteration(one)) = strong_iteration(one),
inference(resolution,[status(thm)],[f3116,f43]) ).
fof(f3148,plain,
! [X0] : addition(strong_iteration(one),X0) = strong_iteration(one),
inference(paramodulation,[status(thm)],[f2152,f3126]) ).
fof(f3161,plain,
! [X0,X1] :
( ~ leq(X0,strong_iteration(one))
| leq(X0,multiplication(strong_iteration(X1),strong_iteration(one))) ),
inference(paramodulation,[status(thm)],[f3126,f39]) ).
fof(f3162,plain,
! [X0,X1] : leq(X0,multiplication(strong_iteration(X1),strong_iteration(one))),
inference(forward_subsumption_resolution,[status(thm)],[f3161,f3116]) ).
fof(f4144,plain,
( spl0_69
<=> one = one ),
introduced(split_symbol_definition) ).
fof(f4146,plain,
( one != one
| spl0_69 ),
inference(component_clause,[status(thm)],[f4144]) ).
fof(f4149,plain,
( $false
| spl0_69 ),
inference(trivial_equality_resolution,[status(esa)],[f4146]) ).
fof(f4150,plain,
spl0_69,
inference(contradiction_clause,[status(thm)],[f4149]) ).
fof(f5035,plain,
! [X0] :
( ~ leq(strong_iteration(one),multiplication(strong_iteration(X0),strong_iteration(one)))
| leq(strong_iteration(one),multiplication(strong_iteration(strong_iteration(X0)),one))
| ~ spl0_8 ),
inference(paramodulation,[status(thm)],[f977,f39]) ).
fof(f5036,plain,
! [X0] :
( ~ leq(strong_iteration(one),multiplication(strong_iteration(X0),strong_iteration(one)))
| leq(strong_iteration(one),strong_iteration(strong_iteration(X0)))
| ~ spl0_8 ),
inference(forward_demodulation,[status(thm)],[f26,f5035]) ).
fof(f5037,plain,
! [X0] :
( leq(strong_iteration(one),strong_iteration(strong_iteration(X0)))
| ~ spl0_8 ),
inference(forward_subsumption_resolution,[status(thm)],[f5036,f3162]) ).
fof(f5106,plain,
! [X0] :
( addition(strong_iteration(one),strong_iteration(strong_iteration(X0))) = strong_iteration(strong_iteration(X0))
| ~ spl0_8 ),
inference(resolution,[status(thm)],[f5037,f43]) ).
fof(f5107,plain,
! [X0] :
( strong_iteration(one) = strong_iteration(strong_iteration(X0))
| ~ spl0_8 ),
inference(forward_demodulation,[status(thm)],[f3148,f5106]) ).
fof(f5155,plain,
! [X0] :
( strong_iteration(strong_iteration(X0)) = addition(multiplication(strong_iteration(X0),strong_iteration(one)),one)
| ~ spl0_8 ),
inference(paramodulation,[status(thm)],[f5107,f37]) ).
fof(f5156,plain,
! [X0] :
( strong_iteration(one) = addition(multiplication(strong_iteration(X0),strong_iteration(one)),one)
| ~ spl0_8 ),
inference(forward_demodulation,[status(thm)],[f5107,f5155]) ).
fof(f5157,plain,
! [X0] :
( strong_iteration(one) = multiplication(strong_iteration(X0),strong_iteration(one))
| ~ spl0_8 ),
inference(forward_demodulation,[status(thm)],[f977,f5156]) ).
fof(f5210,plain,
! [X0,X1] :
( multiplication(addition(X0,strong_iteration(X1)),strong_iteration(one)) = addition(multiplication(X0,strong_iteration(one)),strong_iteration(one))
| ~ spl0_8 ),
inference(paramodulation,[status(thm)],[f5157,f29]) ).
fof(f5211,plain,
! [X0,X1] :
( multiplication(addition(X0,strong_iteration(X1)),strong_iteration(one)) = strong_iteration(one)
| ~ spl0_8 ),
inference(forward_demodulation,[status(thm)],[f3126,f5210]) ).
fof(f5258,plain,
! [X0] :
( multiplication(addition(X0,one),strong_iteration(one)) = strong_iteration(one)
| ~ spl0_8 ),
inference(paramodulation,[status(thm)],[f574,f5211]) ).
fof(f5329,plain,
! [X0] :
( multiplication(addition(one,X0),strong_iteration(one)) = strong_iteration(one)
| ~ spl0_8 ),
inference(paramodulation,[status(thm)],[f2381,f5258]) ).
fof(f5406,plain,
! [X0] :
( multiplication(star(X0),strong_iteration(one)) = strong_iteration(one)
| ~ spl0_8 ),
inference(paramodulation,[status(thm)],[f725,f5329]) ).
fof(f5521,plain,
! [X0,X1] :
( ~ leq(strong_iteration(one),addition(X0,strong_iteration(one)))
| leq(strong_iteration(one),multiplication(strong_iteration(star(X1)),X0))
| ~ spl0_8 ),
inference(paramodulation,[status(thm)],[f5406,f177]) ).
fof(f5522,plain,
! [X0,X1] :
( ~ leq(strong_iteration(one),strong_iteration(one))
| leq(strong_iteration(one),multiplication(strong_iteration(star(X0)),X1))
| ~ spl0_8 ),
inference(forward_demodulation,[status(thm)],[f3126,f5521]) ).
fof(f5523,plain,
! [X0,X1] :
( leq(strong_iteration(one),multiplication(strong_iteration(star(X0)),X1))
| ~ spl0_8 ),
inference(forward_subsumption_resolution,[status(thm)],[f5522,f3116]) ).
fof(f5577,plain,
! [X0] :
( leq(strong_iteration(one),strong_iteration(star(X0)))
| ~ spl0_8 ),
inference(paramodulation,[status(thm)],[f26,f5523]) ).
fof(f5580,plain,
! [X0] :
( addition(strong_iteration(one),strong_iteration(star(X0))) = strong_iteration(star(X0))
| ~ spl0_8 ),
inference(resolution,[status(thm)],[f5577,f43]) ).
fof(f5581,plain,
! [X0] :
( strong_iteration(one) = strong_iteration(star(X0))
| ~ spl0_8 ),
inference(forward_demodulation,[status(thm)],[f3148,f5580]) ).
fof(f7696,plain,
( strong_iteration(one) != strong_iteration(one)
| ~ spl0_8 ),
inference(backward_demodulation,[status(thm)],[f5581,f47]) ).
fof(f7697,plain,
( ~ spl0_14
| ~ spl0_8 ),
inference(split_clause,[status(thm)],[f7696,f245,f110]) ).
fof(f7740,plain,
$false,
inference(sat_refutation,[status(thm)],[f249,f265,f355,f561,f619,f625,f713,f1741,f4150,f7697]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : KLE144+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.12 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.32 % Computer : n024.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Tue May 30 11:47:18 EDT 2023
% 0.10/0.32 % CPUTime :
% 0.10/0.33 % Drodi V3.5.1
% 3.10/0.82 % Refutation found
% 3.10/0.82 % SZS status Theorem for theBenchmark: Theorem is valid
% 3.10/0.82 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 3.50/0.86 % Elapsed time: 0.523119 seconds
% 3.50/0.86 % CPU time: 3.549464 seconds
% 3.50/0.86 % Memory used: 85.907 MB
%------------------------------------------------------------------------------