TSTP Solution File: KLE144+2 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : KLE144+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n013.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 0.16s 0.42s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 24
% Syntax : Number of formulae : 124 ( 31 unt; 0 def)
% Number of atoms : 246 ( 74 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 227 ( 105 ~; 105 |; 4 &)
% ( 10 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 12 ( 10 usr; 10 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 119 (; 116 !; 3 ?)
% 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(f11,axiom,
! [A] : addition(one,multiplication(A,star(A))) = star(A),
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(f13,axiom,
! [A,B,C] :
( leq(addition(multiplication(A,C),B),C)
=> leq(multiplication(star(A),B),C) ),
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(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(f17,axiom,
! [A] : strong_iteration(A) = addition(star(A),multiplication(strong_iteration(A),zero)),
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] :
( leq(strong_iteration(star(X0)),strong_iteration(one))
& leq(strong_iteration(one),strong_iteration(star(X0))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f20,negated_conjecture,
~ ! [X0] :
( leq(strong_iteration(star(X0)),strong_iteration(one))
& leq(strong_iteration(one),strong_iteration(star(X0))) ),
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(f31,plain,
! [X0] : addition(one,multiplication(X0,star(X0))) = star(X0),
inference(cnf_transformation,[status(esa)],[f11]) ).
fof(f32,plain,
! [X0] : addition(one,multiplication(star(X0),X0)) = star(X0),
inference(cnf_transformation,[status(esa)],[f12]) ).
fof(f33,plain,
! [A,B,C] :
( ~ leq(addition(multiplication(A,C),B),C)
| leq(multiplication(star(A),B),C) ),
inference(pre_NNF_transformation,[status(esa)],[f13]) ).
fof(f34,plain,
! [X0,X1,X2] :
( ~ leq(addition(multiplication(X0,X1),X2),X1)
| leq(multiplication(star(X0),X2),X1) ),
inference(cnf_transformation,[status(esa)],[f33]) ).
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(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(f40,plain,
! [X0] : strong_iteration(X0) = addition(star(X0),multiplication(strong_iteration(X0),zero)),
inference(cnf_transformation,[status(esa)],[f17]) ).
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] :
( ~ leq(strong_iteration(star(X0)),strong_iteration(one))
| ~ leq(strong_iteration(one),strong_iteration(star(X0))) ),
inference(pre_NNF_transformation,[status(esa)],[f20]) ).
fof(f46,plain,
( ? [X0] : ~ leq(strong_iteration(star(X0)),strong_iteration(one))
| ? [X0] : ~ leq(strong_iteration(one),strong_iteration(star(X0))) ),
inference(miniscoping,[status(esa)],[f45]) ).
fof(f47,plain,
( ~ leq(strong_iteration(star(sk0_0)),strong_iteration(one))
| ~ leq(strong_iteration(one),strong_iteration(star(sk0_1))) ),
inference(skolemization,[status(esa)],[f46]) ).
fof(f48,plain,
( ~ leq(strong_iteration(star(sk0_0)),strong_iteration(one))
| ~ leq(strong_iteration(one),strong_iteration(star(sk0_1))) ),
inference(cnf_transformation,[status(esa)],[f47]) ).
fof(f49,plain,
( spl0_0
<=> leq(strong_iteration(star(sk0_0)),strong_iteration(one)) ),
introduced(split_symbol_definition) ).
fof(f51,plain,
( ~ leq(strong_iteration(star(sk0_0)),strong_iteration(one))
| spl0_0 ),
inference(component_clause,[status(thm)],[f49]) ).
fof(f52,plain,
( spl0_1
<=> leq(strong_iteration(one),strong_iteration(star(sk0_1))) ),
introduced(split_symbol_definition) ).
fof(f54,plain,
( ~ leq(strong_iteration(one),strong_iteration(star(sk0_1)))
| spl0_1 ),
inference(component_clause,[status(thm)],[f52]) ).
fof(f55,plain,
( ~ spl0_0
| ~ spl0_1 ),
inference(split_clause,[status(thm)],[f48,f49,f52]) ).
fof(f56,plain,
addition(one,star(one)) = star(one),
inference(paramodulation,[status(thm)],[f27,f31]) ).
fof(f60,plain,
! [X0,X1] :
( ~ leq(addition(multiplication(X0,X1),one),X1)
| leq(star(X0),X1) ),
inference(paramodulation,[status(thm)],[f26,f34]) ).
fof(f61,plain,
! [X0,X1] :
( ~ leq(addition(multiplication(X0,X1),one),X1)
| addition(star(X0),X1) = X1 ),
inference(resolution,[status(thm)],[f60,f43]) ).
fof(f65,plain,
! [X0] :
( ~ leq(addition(X0,one),one)
| addition(star(X0),one) = one ),
inference(paramodulation,[status(thm)],[f26,f61]) ).
fof(f67,plain,
( spl0_2
<=> leq(strong_iteration(one),strong_iteration(one)) ),
introduced(split_symbol_definition) ).
fof(f68,plain,
( leq(strong_iteration(one),strong_iteration(one))
| ~ spl0_2 ),
inference(component_clause,[status(thm)],[f67]) ).
fof(f69,plain,
( ~ leq(strong_iteration(one),strong_iteration(one))
| spl0_2 ),
inference(component_clause,[status(thm)],[f67]) ).
fof(f91,plain,
! [X0,X1] :
( ~ leq(X0,addition(multiplication(X1,X0),one))
| leq(X0,strong_iteration(X1)) ),
inference(paramodulation,[status(thm)],[f26,f39]) ).
fof(f100,plain,
( spl0_8
<=> leq(one,one) ),
introduced(split_symbol_definition) ).
fof(f102,plain,
( ~ leq(one,one)
| spl0_8 ),
inference(component_clause,[status(thm)],[f100]) ).
fof(f103,plain,
( spl0_9
<=> addition(star(one),one) = one ),
introduced(split_symbol_definition) ).
fof(f104,plain,
( addition(star(one),one) = one
| ~ spl0_9 ),
inference(component_clause,[status(thm)],[f103]) ).
fof(f106,plain,
( ~ leq(one,one)
| addition(star(one),one) = one ),
inference(paramodulation,[status(thm)],[f24,f65]) ).
fof(f107,plain,
( ~ spl0_8
| spl0_9 ),
inference(split_clause,[status(thm)],[f106,f100,f103]) ).
fof(f190,plain,
! [X0,X1,X2] : addition(X0,addition(X1,X2)) = addition(X2,addition(X0,X1)),
inference(paramodulation,[status(thm)],[f21,f22]) ).
fof(f208,plain,
! [X0,X1] : addition(X0,addition(X0,X1)) = addition(X0,X1),
inference(paramodulation,[status(thm)],[f24,f22]) ).
fof(f265,plain,
( addition(one,one) != one
| spl0_8 ),
inference(resolution,[status(thm)],[f102,f44]) ).
fof(f266,plain,
( one != one
| spl0_8 ),
inference(forward_demodulation,[status(thm)],[f24,f265]) ).
fof(f267,plain,
( $false
| spl0_8 ),
inference(trivial_equality_resolution,[status(esa)],[f266]) ).
fof(f268,plain,
spl0_8,
inference(contradiction_clause,[status(thm)],[f267]) ).
fof(f269,plain,
( addition(one,star(one)) = one
| ~ spl0_9 ),
inference(forward_demodulation,[status(thm)],[f21,f104]) ).
fof(f270,plain,
( star(one) = one
| ~ spl0_9 ),
inference(forward_demodulation,[status(thm)],[f56,f269]) ).
fof(f275,plain,
( addition(strong_iteration(one),strong_iteration(one)) != strong_iteration(one)
| spl0_2 ),
inference(resolution,[status(thm)],[f69,f44]) ).
fof(f276,plain,
( strong_iteration(one) != strong_iteration(one)
| spl0_2 ),
inference(forward_demodulation,[status(thm)],[f24,f275]) ).
fof(f277,plain,
( $false
| spl0_2 ),
inference(trivial_equality_resolution,[status(esa)],[f276]) ).
fof(f278,plain,
spl0_2,
inference(contradiction_clause,[status(thm)],[f277]) ).
fof(f282,plain,
! [X0,X1] :
( ~ leq(addition(multiplication(X0,one),X1),X0)
| leq(multiplication(X1,one),X0)
| ~ spl0_9 ),
inference(paramodulation,[status(thm)],[f270,f36]) ).
fof(f283,plain,
! [X0,X1] :
( ~ leq(addition(X0,X1),X0)
| leq(multiplication(X1,one),X0)
| ~ spl0_9 ),
inference(forward_demodulation,[status(thm)],[f26,f282]) ).
fof(f284,plain,
! [X0,X1] :
( ~ leq(addition(X0,X1),X0)
| leq(X1,X0)
| ~ spl0_9 ),
inference(forward_demodulation,[status(thm)],[f26,f283]) ).
fof(f310,plain,
! [X0,X1] :
( ~ leq(addition(X0,X1),X0)
| addition(X1,X0) = X0
| ~ spl0_9 ),
inference(resolution,[status(thm)],[f284,f43]) ).
fof(f314,plain,
! [X0,X1] :
( addition(X0,X1) = X1
| addition(addition(X1,X0),X1) != X1
| ~ spl0_9 ),
inference(resolution,[status(thm)],[f310,f44]) ).
fof(f315,plain,
! [X0,X1] :
( addition(X0,X1) = X1
| addition(X1,addition(X0,X1)) != X1
| ~ spl0_9 ),
inference(forward_demodulation,[status(thm)],[f22,f314]) ).
fof(f339,plain,
! [X0,X1] :
( ~ leq(addition(X0,X1),X1)
| addition(X0,X1) = X1
| ~ spl0_9 ),
inference(paramodulation,[status(thm)],[f21,f310]) ).
fof(f447,plain,
! [X0,X1] :
( addition(X0,X1) = X1
| addition(X1,addition(X1,X0)) != X1
| ~ spl0_9 ),
inference(paramodulation,[status(thm)],[f21,f315]) ).
fof(f952,plain,
! [X0,X1] :
( addition(X0,X1) = X1
| addition(X1,X0) != X1
| ~ spl0_9 ),
inference(backward_demodulation,[status(thm)],[f208,f447]) ).
fof(f967,plain,
! [X0] : addition(one,star(X0)) = addition(one,multiplication(star(X0),X0)),
inference(paramodulation,[status(thm)],[f32,f208]) ).
fof(f968,plain,
! [X0] : addition(one,star(X0)) = star(X0),
inference(forward_demodulation,[status(thm)],[f32,f967]) ).
fof(f1261,plain,
! [X0,X1,X2] : addition(X0,addition(X1,X2)) = addition(X1,addition(X0,X2)),
inference(paramodulation,[status(thm)],[f21,f190]) ).
fof(f1554,plain,
! [X0,X1] : multiplication(addition(one,X0),X1) = addition(X1,multiplication(X0,X1)),
inference(paramodulation,[status(thm)],[f27,f29]) ).
fof(f1608,plain,
( strong_iteration(one) = addition(one,multiplication(strong_iteration(one),zero))
| ~ spl0_9 ),
inference(paramodulation,[status(thm)],[f270,f40]) ).
fof(f1753,plain,
( spl0_39
<=> strong_iteration(one) = multiplication(strong_iteration(one),zero) ),
introduced(split_symbol_definition) ).
fof(f1754,plain,
( strong_iteration(one) = multiplication(strong_iteration(one),zero)
| ~ spl0_39 ),
inference(component_clause,[status(thm)],[f1753]) ).
fof(f1756,plain,
( spl0_40
<=> addition(multiplication(strong_iteration(one),zero),one) = multiplication(strong_iteration(one),zero) ),
introduced(split_symbol_definition) ).
fof(f1758,plain,
( addition(multiplication(strong_iteration(one),zero),one) != multiplication(strong_iteration(one),zero)
| spl0_40 ),
inference(component_clause,[status(thm)],[f1756]) ).
fof(f1759,plain,
( strong_iteration(one) = multiplication(strong_iteration(one),zero)
| addition(multiplication(strong_iteration(one),zero),one) != multiplication(strong_iteration(one),zero)
| ~ spl0_9 ),
inference(paramodulation,[status(thm)],[f1608,f952]) ).
fof(f1760,plain,
( spl0_39
| ~ spl0_40
| ~ spl0_9 ),
inference(split_clause,[status(thm)],[f1759,f1753,f1756,f103]) ).
fof(f1772,plain,
( spl0_41
<=> leq(strong_iteration(one),multiplication(strong_iteration(one),zero)) ),
introduced(split_symbol_definition) ).
fof(f1774,plain,
( ~ leq(strong_iteration(one),multiplication(strong_iteration(one),zero))
| spl0_41 ),
inference(component_clause,[status(thm)],[f1772]) ).
fof(f1775,plain,
( spl0_42
<=> addition(one,multiplication(strong_iteration(one),zero)) = multiplication(strong_iteration(one),zero) ),
introduced(split_symbol_definition) ).
fof(f1776,plain,
( addition(one,multiplication(strong_iteration(one),zero)) = multiplication(strong_iteration(one),zero)
| ~ spl0_42 ),
inference(component_clause,[status(thm)],[f1775]) ).
fof(f1778,plain,
( ~ leq(strong_iteration(one),multiplication(strong_iteration(one),zero))
| addition(one,multiplication(strong_iteration(one),zero)) = multiplication(strong_iteration(one),zero)
| ~ spl0_9 ),
inference(paramodulation,[status(thm)],[f1608,f339]) ).
fof(f1779,plain,
( ~ spl0_41
| spl0_42
| ~ spl0_9 ),
inference(split_clause,[status(thm)],[f1778,f1772,f1775,f103]) ).
fof(f1787,plain,
( addition(one,multiplication(strong_iteration(one),zero)) != multiplication(strong_iteration(one),zero)
| spl0_40 ),
inference(forward_demodulation,[status(thm)],[f21,f1758]) ).
fof(f1788,plain,
( strong_iteration(one) != multiplication(strong_iteration(one),zero)
| ~ spl0_9
| spl0_40 ),
inference(forward_demodulation,[status(thm)],[f1608,f1787]) ).
fof(f2012,plain,
( ~ leq(strong_iteration(one),addition(multiplication(one,strong_iteration(one)),zero))
| spl0_41 ),
inference(resolution,[status(thm)],[f1774,f39]) ).
fof(f2013,plain,
( ~ leq(strong_iteration(one),multiplication(one,strong_iteration(one)))
| spl0_41 ),
inference(forward_demodulation,[status(thm)],[f23,f2012]) ).
fof(f2014,plain,
( ~ leq(strong_iteration(one),strong_iteration(one))
| spl0_41 ),
inference(forward_demodulation,[status(thm)],[f27,f2013]) ).
fof(f2015,plain,
( $false
| ~ spl0_2
| spl0_41 ),
inference(forward_subsumption_resolution,[status(thm)],[f2014,f68]) ).
fof(f2016,plain,
( ~ spl0_2
| spl0_41 ),
inference(contradiction_clause,[status(thm)],[f2015]) ).
fof(f2017,plain,
( strong_iteration(one) = multiplication(strong_iteration(one),zero)
| ~ spl0_9
| ~ spl0_42 ),
inference(forward_demodulation,[status(thm)],[f1608,f1776]) ).
fof(f2018,plain,
( $false
| spl0_40
| ~ spl0_9
| ~ spl0_42 ),
inference(forward_subsumption_resolution,[status(thm)],[f2017,f1788]) ).
fof(f2019,plain,
( spl0_40
| ~ spl0_9
| ~ spl0_42 ),
inference(contradiction_clause,[status(thm)],[f2018]) ).
fof(f2025,plain,
! [X0] :
( ~ leq(X0,addition(multiplication(one,X0),zero))
| leq(X0,strong_iteration(one))
| ~ spl0_39 ),
inference(paramodulation,[status(thm)],[f1754,f39]) ).
fof(f2026,plain,
! [X0] :
( ~ leq(X0,multiplication(one,X0))
| leq(X0,strong_iteration(one))
| ~ spl0_39 ),
inference(forward_demodulation,[status(thm)],[f23,f2025]) ).
fof(f2027,plain,
! [X0] :
( ~ leq(X0,X0)
| leq(X0,strong_iteration(one))
| ~ spl0_39 ),
inference(forward_demodulation,[status(thm)],[f27,f2026]) ).
fof(f2098,plain,
! [X0] :
( leq(X0,strong_iteration(one))
| addition(X0,X0) != X0
| ~ spl0_39 ),
inference(resolution,[status(thm)],[f2027,f44]) ).
fof(f2099,plain,
! [X0] :
( leq(X0,strong_iteration(one))
| X0 != X0
| ~ spl0_39 ),
inference(forward_demodulation,[status(thm)],[f24,f2098]) ).
fof(f2100,plain,
! [X0] :
( leq(X0,strong_iteration(one))
| ~ spl0_39 ),
inference(trivial_equality_resolution,[status(esa)],[f2099]) ).
fof(f2101,plain,
( $false
| ~ spl0_39
| spl0_0 ),
inference(backward_subsumption_resolution,[status(thm)],[f51,f2100]) ).
fof(f2102,plain,
( ~ spl0_39
| spl0_0 ),
inference(contradiction_clause,[status(thm)],[f2101]) ).
fof(f2810,plain,
! [X0,X1] :
( ~ leq(X0,addition(one,multiplication(X1,X0)))
| leq(X0,strong_iteration(X1)) ),
inference(forward_demodulation,[status(thm)],[f21,f91]) ).
fof(f2813,plain,
( ~ leq(strong_iteration(one),addition(one,multiplication(star(sk0_1),strong_iteration(one))))
| spl0_1 ),
inference(resolution,[status(thm)],[f2810,f54]) ).
fof(f5836,plain,
( addition(strong_iteration(one),addition(one,multiplication(star(sk0_1),strong_iteration(one)))) != addition(one,multiplication(star(sk0_1),strong_iteration(one)))
| spl0_1 ),
inference(resolution,[status(thm)],[f2813,f44]) ).
fof(f5837,plain,
( addition(one,addition(strong_iteration(one),multiplication(star(sk0_1),strong_iteration(one)))) != addition(one,multiplication(star(sk0_1),strong_iteration(one)))
| spl0_1 ),
inference(forward_demodulation,[status(thm)],[f1261,f5836]) ).
fof(f5838,plain,
( addition(one,multiplication(addition(one,star(sk0_1)),strong_iteration(one))) != addition(one,multiplication(star(sk0_1),strong_iteration(one)))
| spl0_1 ),
inference(forward_demodulation,[status(thm)],[f1554,f5837]) ).
fof(f5839,plain,
( addition(one,multiplication(star(sk0_1),strong_iteration(one))) != addition(one,multiplication(star(sk0_1),strong_iteration(one)))
| spl0_1 ),
inference(forward_demodulation,[status(thm)],[f968,f5838]) ).
fof(f5840,plain,
( $false
| spl0_1 ),
inference(trivial_equality_resolution,[status(esa)],[f5839]) ).
fof(f5841,plain,
spl0_1,
inference(contradiction_clause,[status(thm)],[f5840]) ).
fof(f5842,plain,
$false,
inference(sat_refutation,[status(thm)],[f55,f107,f268,f278,f1760,f1779,f2016,f2019,f2102,f5841]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : KLE144+2 : TPTP v8.1.2. Released v4.0.0.
% 0.09/0.11 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.31 % Computer : n013.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue May 30 11:41:50 EDT 2023
% 0.16/0.31 % CPUTime :
% 0.16/0.32 % Drodi V3.5.1
% 0.16/0.42 % Refutation found
% 0.16/0.42 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.16/0.42 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.16/0.44 % Elapsed time: 0.120228 seconds
% 0.16/0.44 % CPU time: 0.316197 seconds
% 0.16/0.44 % Memory used: 24.794 MB
%------------------------------------------------------------------------------