%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : KLE148+1 : 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 : n020.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:40 AM UTC 2026
% Result : Theorem 13.00s 3.68s
% Output : CNFRefutation 13.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 26 ( 24 unt; 0 def)
% Number of atoms : 28 ( 27 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 4 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 36 ( 3 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(additive_commutativity,axiom,
! [X0,X1] : addition(X0,X1) = addition(X1,X0) ).
fof(additive_identity,axiom,
! [X0] : addition(X0,zero) = X0 ).
fof(multiplicative_associativity,axiom,
! [X0,X1,X2] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2) ).
fof(multiplicative_right_identity,axiom,
! [X0] : multiplication(X0,one) = X0 ).
fof(distributivity1,axiom,
! [X0,X1,X2] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)) ).
fof(left_annihilation,axiom,
! [X0] : multiplication(zero,X0) = zero ).
fof(infty_unfold1,axiom,
! [X0] : 'strong$uiteration'(X0) = addition(multiplication(X0,'strong$uiteration'(X0)),one) ).
fof(goals,conjecture,
! [X0,X1] :
( multiplication(X0,X1) = zero
=> multiplication(X0,'strong$uiteration'(X1)) = X0 ) ).
fof(negated_conjecture,negated_conjecture,
~ ! [X0,X1] :
( multiplication(X0,X1) = zero
=> multiplication(X0,'strong$uiteration'(X1)) = X0 ),
inference(negate_conjecture,[status(cth)],[goals]) ).
cnf(c0,plain,
addition(X0,X1) = addition(X1,X0),
inference(clausification,[status(esa)],[additive_commutativity]) ).
cnf(c2,plain,
addition(X0,zero) = X0,
inference(clausification,[status(esa)],[additive_identity]) ).
cnf(c4,plain,
multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
inference(clausification,[status(esa)],[multiplicative_associativity]) ).
cnf(c5,plain,
multiplication(X0,one) = X0,
inference(clausification,[status(esa)],[multiplicative_right_identity]) ).
cnf(c7,plain,
multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
inference(clausification,[status(esa)],[distributivity1]) ).
cnf(c9,plain,
multiplication(zero,X0) = zero,
inference(clausification,[status(esa)],[left_annihilation]) ).
cnf(c14,plain,
'strong$uiteration'(X0) = addition(multiplication(X0,'strong$uiteration'(X0)),one),
inference(clausification,[status(esa)],[infty_unfold1]) ).
cnf(c19,plain,
multiplication(sK34,sK35) = zero,
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c20,plain,
multiplication(sK34,'strong$uiteration'(sK35)) != sK34,
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
multiplication(sK34,multiplication(sK35,X0)) = multiplication(zero,X0),
inference(superposition,[status(thm)],[c19,c4]) ).
cnf(d1,plain,
multiplication(sK34,addition(X1,multiplication(sK35,X0))) = addition(multiplication(sK34,X1),multiplication(zero,X0)),
inference(superposition,[status(thm)],[d0,c7]) ).
cnf(d2,plain,
multiplication(sK34,addition(X1,multiplication(sK35,X0))) = addition(multiplication(sK34,X1),zero),
inference(demodulation,[status(thm)],[d1,c9]) ).
cnf(d3,plain,
multiplication(sK34,addition(X0,multiplication(sK35,X1))) = multiplication(sK34,X0),
inference(demodulation,[status(thm)],[d2,c2]) ).
cnf(d4,plain,
'strong$uiteration'(X0) = addition(one,multiplication(X0,'strong$uiteration'(X0))),
inference(demodulation,[status(thm)],[c14,c0]) ).
cnf(d5,plain,
multiplication(sK34,'strong$uiteration'(sK35)) = multiplication(sK34,one),
inference(superposition,[status(thm)],[d4,d3]) ).
cnf(d6,plain,
multiplication(sK34,'strong$uiteration'(sK35)) = sK34,
inference(demodulation,[status(thm)],[d5,c5]) ).
cnf(d7,plain,
$false,
inference(resolution,[status(thm)],[c20,d6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : KLE148+1 : 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.09/0.36 % Computer : n020.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Fri Sep 25 19:28:04 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 13.00/3.68 % SZS status Theorem for theBenchmark.p
% 13.00/3.68 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------