%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : KLE141+2 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n008.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun Sep 27 07:43:39 AM UTC 2026
% Result : Theorem 24.47s 6.47s
% Output : CNFRefutation 24.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 27 ( 18 unt; 0 def)
% Number of atoms : 36 ( 16 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 17 ( 8 ~; 5 |; 2 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 41 ( 4 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(additive_associativity,axiom,
! [X0,X1,X2] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0) ).
fof(additive_identity,axiom,
! [X0] : addition(X0,zero) = X0 ).
fof(idempotence,axiom,
! [X0] : addition(X0,X0) = X0 ).
fof(multiplicative_right_identity,axiom,
! [X0] : multiplication(X0,one) = X0 ).
fof(multiplicative_left_identity,axiom,
! [X0] : multiplication(one,X0) = X0 ).
fof(infty_coinduction,axiom,
! [X0,X1,X2] :
( leq(X2,addition(multiplication(X0,X2),X1))
=> leq(X2,multiplication('strong$uiteration'(X0),X1)) ) ).
fof(order,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> addition(X0,X1) = X1 ) ).
fof(goals,conjecture,
! [X0] :
( leq('strong$uiteration'(one),multiplication('strong$uiteration'(one),X0))
& leq(multiplication('strong$uiteration'(one),X0),'strong$uiteration'(one)) ) ).
fof(negated_conjecture,negated_conjecture,
~ ! [X0] :
( leq('strong$uiteration'(one),multiplication('strong$uiteration'(one),X0))
& leq(multiplication('strong$uiteration'(one),X0),'strong$uiteration'(one)) ),
inference(negate_conjecture,[status(cth)],[goals]) ).
cnf(c1,plain,
addition(X0,addition(X1,X2)) = addition(addition(X0,X1),X2),
inference(clausification,[status(esa)],[additive_associativity]) ).
cnf(c2,plain,
addition(X0,zero) = X0,
inference(clausification,[status(esa)],[additive_identity]) ).
cnf(c3,plain,
addition(X0,X0) = X0,
inference(clausification,[status(esa)],[idempotence]) ).
cnf(c5,plain,
multiplication(X0,one) = X0,
inference(clausification,[status(esa)],[multiplicative_right_identity]) ).
cnf(c6,plain,
multiplication(one,X0) = X0,
inference(clausification,[status(esa)],[multiplicative_left_identity]) ).
cnf(c15,plain,
( leq(X0,multiplication('strong$uiteration'(X1),X2))
| ~ leq(X0,addition(multiplication(X1,X0),X2)) ),
inference(clausification,[status(esa)],[infty_coinduction]) ).
cnf(c18,plain,
( addition(X0,X1) != X1
| leq(X0,X1) ),
inference(clausification,[status(esa)],[order]) ).
cnf(c19,plain,
( ~ leq('strong$uiteration'(one),multiplication('strong$uiteration'(one),sK34))
| ~ leq(multiplication('strong$uiteration'(one),sK34),'strong$uiteration'(one)) ),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
( leq(X0,multiplication('strong$uiteration'(one),X1))
| ~ leq(X0,addition(X0,X1)) ),
inference(superposition,[status(thm)],[c6,c15]) ).
cnf(d1,plain,
addition(X0,addition(X0,X1)) = addition(X0,X1),
inference(superposition,[status(thm)],[c3,c1]) ).
cnf(d2,plain,
( leq(X0,addition(X0,X1))
| addition(X0,X1) != addition(X0,X1) ),
inference(superposition,[status(thm)],[d1,c18]) ).
cnf(d3,plain,
addition(X0,addition(X1,zero)) = addition(X0,X1),
inference(superposition,[status(thm)],[c1,c2]) ).
cnf(d4,plain,
addition(X1,X0) = addition(X1,X0),
inference(demodulation,[status(thm)],[d3,c2]) ).
cnf(d5,plain,
leq(X0,addition(X0,X1)),
inference(resolution,[status(thm)],[d4,d2]) ).
cnf(d6,plain,
leq(X0,multiplication('strong$uiteration'(one),X1)),
inference(resolution,[status(thm)],[d5,d0]) ).
cnf(d7,plain,
~ leq(multiplication('strong$uiteration'(one),sK34),'strong$uiteration'(one)),
inference(resolution,[status(thm)],[d6,c19]) ).
cnf(d8,plain,
leq(X0,'strong$uiteration'(one)),
inference(superposition,[status(thm)],[c5,d6]) ).
cnf(d9,plain,
$false,
inference(resolution,[status(thm)],[d8,d7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : KLE141+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.36 % Computer : n008.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Fri Sep 25 19:27:09 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 24.47/6.47 % SZS status Theorem for theBenchmark.p
% 24.47/6.47 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------