%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : KLE143+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n001.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 : Fri Sep 25 01:52:30 PM UTC 2026
% Result : Theorem 18.28s 5.33s
% Output : CNFRefutation 18.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 16
% Syntax : Number of formulae : 87 ( 77 unt; 2 def)
% Number of atoms : 151 ( 70 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 28 ( 16 ~; 9 |; 1 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 114 ( 0 sgn 113 !; 1 ?; 54 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',additive_commutativity) ).
fof(f2,axiom,
! [X0,X1,X2] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',additive_associativity) ).
fof(f3,axiom,
! [X0] : addition(X0,zero) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',additive_identity) ).
fof(f4,axiom,
! [X0] : addition(X0,X0) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',idempotence) ).
fof(f5,axiom,
! [X0,X1,X2] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',multiplicative_associativity) ).
fof(f6,axiom,
! [X0] : multiplication(X0,one) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',multiplicative_right_identity) ).
fof(f7,axiom,
! [X0] : multiplication(one,X0) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',multiplicative_left_identity) ).
fof(f8,axiom,
! [X0,X1,X2] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',distributivity1) ).
fof(f9,axiom,
! [X0,X1,X2] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',distributivity2) ).
fof(f10,axiom,
! [X0] : multiplication(zero,X0) = zero,
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',left_annihilation) ).
fof(f15,axiom,
! [X0] : strong_iteration(X0) = addition(multiplication(X0,strong_iteration(X0)),one),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',infty_unfold1) ).
fof(f16,axiom,
! [X0,X1,X2] :
( leq(X2,addition(multiplication(X0,X2),X1))
=> leq(X2,multiplication(strong_iteration(X0),X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',infty_coinduction) ).
fof(f18,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> addition(X0,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',order) ).
fof(f19,conjecture,
! [X0] : multiplication(strong_iteration(X0),strong_iteration(X0)) = strong_iteration(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f20,negated_conjecture,
~ ! [X0] : multiplication(strong_iteration(X0),strong_iteration(X0)) = strong_iteration(X0),
inference(negated_conjecture,[status(cth)],[f19]) ).
fof(f23,plain,
! [X0,X1,X2] :
( ~ leq(X2,addition(multiplication(X0,X2),X1))
| leq(X2,multiplication(strong_iteration(X0),X1)) ),
inference(ennf_transformation,[],[f16]) ).
fof(f24,plain,
? [X0] : strong_iteration(X0) != multiplication(strong_iteration(X0),strong_iteration(X0)),
inference(ennf_transformation,[],[f20]) ).
fof(f25,plain,
! [X0,X1] :
( ( ~ leq(X0,X1)
| addition(X0,X1) = X1 )
& ( addition(X0,X1) != X1
| leq(X0,X1) ) ),
inference(nnf_transformation,[],[f18]) ).
fof(f26,plain,
strong_iteration(sK0) != multiplication(strong_iteration(sK0),strong_iteration(sK0)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f24]) ).
fof(f27,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f28,plain,
! [X2,X0,X1] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(cnf_transformation,[],[f2]) ).
fof(f29,plain,
! [X0] : addition(X0,zero) = X0,
inference(cnf_transformation,[],[f3]) ).
fof(f30,plain,
! [X0] : addition(X0,X0) = X0,
inference(cnf_transformation,[],[f4]) ).
fof(f31,plain,
! [X2,X0,X1] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
inference(cnf_transformation,[],[f5]) ).
fof(f32,plain,
! [X0] : multiplication(X0,one) = X0,
inference(cnf_transformation,[],[f6]) ).
fof(f33,plain,
! [X0] : multiplication(one,X0) = X0,
inference(cnf_transformation,[],[f7]) ).
fof(f34,plain,
! [X2,X0,X1] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
inference(cnf_transformation,[],[f8]) ).
fof(f35,plain,
! [X2,X0,X1] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
inference(cnf_transformation,[],[f9]) ).
fof(f36,plain,
! [X0] : zero = multiplication(zero,X0),
inference(cnf_transformation,[],[f10]) ).
fof(f41,plain,
! [X0] : strong_iteration(X0) = addition(multiplication(X0,strong_iteration(X0)),one),
inference(cnf_transformation,[],[f15]) ).
fof(f42,plain,
! [X2,X0,X1] :
( ~ leq(X2,addition(multiplication(X0,X2),X1))
| leq(X2,multiplication(strong_iteration(X0),X1)) ),
inference(cnf_transformation,[],[f23]) ).
fof(f44,plain,
! [X0,X1] :
( ~ leq(X0,X1)
| addition(X0,X1) = X1 ),
inference(cnf_transformation,[],[f25]) ).
fof(f45,plain,
! [X0,X1] :
( addition(X0,X1) != X1
| leq(X0,X1) ),
inference(cnf_transformation,[],[f25]) ).
fof(f46,plain,
strong_iteration(sK0) != multiplication(strong_iteration(sK0),strong_iteration(sK0)),
inference(cnf_transformation,[],[f26]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f27]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i,X2: $i] : addition(addition(X0,X1),X2) = addition(X0,addition(X1,X2)),
inference(cnf_transformation,[],[f28]) ).
tcf(c_51,plain,
! [X0: $i] : addition(X0,zero) = X0,
inference(cnf_transformation,[],[f29]) ).
tcf(c_52,plain,
! [X0: $i] : addition(X0,X0) = X0,
inference(cnf_transformation,[],[f30]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i,X2: $i] : multiplication(multiplication(X0,X1),X2) = multiplication(X0,multiplication(X1,X2)),
inference(cnf_transformation,[],[f31]) ).
tcf(c_54,plain,
! [X0: $i] : multiplication(X0,one) = X0,
inference(cnf_transformation,[],[f32]) ).
tcf(c_55,plain,
! [X0: $i] : multiplication(one,X0) = X0,
inference(cnf_transformation,[],[f33]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i,X2: $i] : addition(multiplication(X0,X1),multiplication(X0,X2)) = multiplication(X0,addition(X1,X2)),
inference(cnf_transformation,[],[f34]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i,X2: $i] : addition(multiplication(X0,X1),multiplication(X2,X1)) = multiplication(addition(X0,X2),X1),
inference(cnf_transformation,[],[f35]) ).
tcf(c_58,plain,
! [X0: $i] : multiplication(zero,X0) = zero,
inference(cnf_transformation,[],[f36]) ).
tcf(c_63,plain,
! [X0: $i] : addition(multiplication(X0,strong_iteration(X0)),one) = strong_iteration(X0),
inference(cnf_transformation,[],[f41]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i,X2: $i] :
( leq(X0,multiplication(strong_iteration(X1),X2))
| ~ leq(X0,addition(multiplication(X1,X0),X2)) ),
inference(cnf_transformation,[],[f42]) ).
tcf(c_66,plain,
! [X0: $i,X1: $i] :
( leq(X0,X1)
| ( addition(X0,X1) != X1 ) ),
inference(cnf_transformation,[],[f45]) ).
tcf(c_67,plain,
! [X0: $i,X1: $i] :
( ( addition(X0,X1) = X1 )
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f44]) ).
tcf(c_68,negated_conjecture,
multiplication(strong_iteration(sK0),strong_iteration(sK0)) != strong_iteration(sK0),
inference(cnf_transformation,[],[f46]) ).
tcf(c_86,plain,
! [X0: $i] : addition(one,multiplication(X0,strong_iteration(X0))) = strong_iteration(X0),
inference(theory_normalisation,[status(thm)],[c_63,c_50,c_49]) ).
tcf(c_206,definition,
iPr_def_10 = strong_iteration(sK0),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_207,definition,
iPr_def_11 = multiplication(iPr_def_10,iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_208,negated_conjecture,
iPr_def_11 != iPr_def_10,
inference(demodulation,[status(thm)],[c_68,c_206,c_207]) ).
tcf(c_517,plain,
addition(one,zero) = strong_iteration(zero),
inference(superposition,[status(thm)],[c_58,c_86]) ).
tcf(c_518,plain,
addition(one,multiplication(sK0,iPr_def_10)) = iPr_def_10,
inference(superposition,[status(thm)],[c_206,c_86]) ).
tcf(c_519,plain,
addition(zero,one) = strong_iteration(zero),
inference(theory_normalisation,[status(thm)],[c_517,c_50,c_49]) ).
tcf(c_520,plain,
! [X0: $i] : addition(zero,X0) = X0,
inference(superposition,[status(thm)],[c_51,c_49]) ).
tcf(c_559,plain,
strong_iteration(zero) = one,
inference(demodulation,[status(thm)],[c_519,c_520]) ).
tcf(c_597,plain,
! [X0: $i,X1: $i] : addition(X0,addition(X0,X1)) = addition(X0,X1),
inference(superposition,[status(thm)],[c_52,c_50]) ).
tcf(c_604,plain,
! [X0: $i] : addition(one,addition(multiplication(sK0,iPr_def_10),X0)) = addition(iPr_def_10,X0),
inference(superposition,[status(thm)],[c_518,c_50]) ).
tcf(c_717,plain,
! [X0: $i] : addition(one,strong_iteration(X0)) = strong_iteration(X0),
inference(superposition,[status(thm)],[c_86,c_597]) ).
tcf(c_723,plain,
! [X0: $i,X1: $i] : leq(X0,addition(X0,X1)),
inference(superposition,[status(thm)],[c_597,c_66]) ).
tcf(c_744,plain,
! [X0: $i,X1: $i] : leq(X0,addition(X1,X0)),
inference(superposition,[status(thm)],[c_49,c_723]) ).
tcf(c_746,plain,
! [X0: $i,X1: $i,X2: $i] : leq(addition(X0,X1),addition(X0,addition(X1,X2))),
inference(superposition,[status(thm)],[c_50,c_723]) ).
tcf(c_966,plain,
! [X0: $i] : addition(multiplication(one,X0),multiplication(multiplication(sK0,iPr_def_10),X0)) = multiplication(iPr_def_10,X0),
inference(superposition,[status(thm)],[c_518,c_57]) ).
tcf(c_978,plain,
! [X0: $i] : addition(X0,multiplication(multiplication(sK0,iPr_def_10),X0)) = multiplication(iPr_def_10,X0),
inference(light_normalisation,[status(thm)],[c_966,c_55]) ).
tcf(c_1529,plain,
! [X0: $i,X1: $i] : leq(X0,multiplication(strong_iteration(X1),X0)),
inference(superposition,[status(thm)],[c_744,c_64]) ).
tcf(c_1605,plain,
! [X0: $i] : leq(X0,multiplication(iPr_def_10,X0)),
inference(superposition,[status(thm)],[c_206,c_1529]) ).
tcf(c_1622,plain,
leq(iPr_def_10,iPr_def_11),
inference(superposition,[status(thm)],[c_207,c_1605]) ).
tcf(c_1625,plain,
addition(iPr_def_10,iPr_def_11) = iPr_def_11,
inference(superposition,[status(thm)],[c_1622,c_67]) ).
tcf(c_1666,plain,
! [X0: $i] : addition(multiplication(X0,iPr_def_10),multiplication(X0,iPr_def_11)) = multiplication(X0,iPr_def_11),
inference(superposition,[status(thm)],[c_1625,c_56]) ).
tcf(c_3624,plain,
! [X0: $i,X1: $i] : leq(addition(X0,one),addition(X0,strong_iteration(X1))),
inference(superposition,[status(thm)],[c_717,c_746]) ).
tcf(c_4680,plain,
! [X0: $i,X1: $i] : leq(addition(one,X0),addition(X0,strong_iteration(X1))),
inference(superposition,[status(thm)],[c_49,c_3624]) ).
tcf(c_28481,plain,
! [X0: $i] : addition(X0,multiplication(sK0,multiplication(iPr_def_10,X0))) = multiplication(iPr_def_10,X0),
inference(demodulation,[status(thm)],[c_978,c_53]) ).
tcf(c_28488,plain,
addition(iPr_def_10,multiplication(sK0,iPr_def_11)) = iPr_def_11,
inference(superposition,[status(thm)],[c_207,c_28481]) ).
tcf(c_45519,plain,
addition(one,multiplication(sK0,iPr_def_11)) = addition(iPr_def_10,multiplication(sK0,iPr_def_11)),
inference(superposition,[status(thm)],[c_1666,c_604]) ).
tcf(c_45548,plain,
addition(one,multiplication(sK0,iPr_def_11)) = iPr_def_11,
inference(light_normalisation,[status(thm)],[c_45519,c_28488]) ).
tcf(c_67673,plain,
! [X0: $i] : leq(iPr_def_11,addition(multiplication(sK0,iPr_def_11),strong_iteration(X0))),
inference(superposition,[status(thm)],[c_45548,c_4680]) ).
tcf(c_75139,plain,
! [X0: $i] : leq(iPr_def_11,multiplication(strong_iteration(sK0),strong_iteration(X0))),
inference(superposition,[status(thm)],[c_67673,c_64]) ).
tcf(c_75141,plain,
! [X0: $i] : leq(iPr_def_11,multiplication(iPr_def_10,strong_iteration(X0))),
inference(light_normalisation,[status(thm)],[c_75139,c_206]) ).
tcf(c_75153,plain,
leq(iPr_def_11,multiplication(iPr_def_10,one)),
inference(superposition,[status(thm)],[c_559,c_75141]) ).
tcf(c_75182,plain,
leq(iPr_def_11,iPr_def_10),
inference(demodulation,[status(thm)],[c_75153,c_54]) ).
tcf(c_75183,plain,
addition(iPr_def_11,iPr_def_10) = iPr_def_10,
inference(superposition,[status(thm)],[c_75182,c_67]) ).
tcf(c_75184,plain,
addition(iPr_def_10,iPr_def_11) = iPr_def_10,
inference(theory_normalisation,[status(thm)],[c_75183,c_50,c_49]) ).
tcf(c_75185,plain,
iPr_def_10 = iPr_def_11,
inference(demodulation,[status(thm)],[c_1625,c_75184]) ).
tcf(c_75657,plain,
iPr_def_10 != iPr_def_10,
inference(demodulation,[status(thm)],[c_208,c_75185]) ).
tcf(c_75658,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_75657]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE143+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.38 % Computer : n001.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Wed Sep 23 19:09:36 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.43
% 0.12/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.43
% 0.12/0.43 % Detected problem language: tptp
% 0.12/0.45 % Proving...
% 18.28/5.33 % SZS status Started for theBenchmark.p
% 18.28/5.33 % SZS status Theorem for theBenchmark.p
% 18.28/5.33
% 18.28/5.33 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 18.28/5.33
% 18.28/5.33 % ------ iProver source info
% 18.28/5.33
% 18.28/5.33 % git: date: 2026-07-19 20:42:38 +0200
% 18.28/5.33 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 18.28/5.33 % git: non_committed_changes: false
% 18.28/5.33
% 18.28/5.33 % ------ Parsing...
% 18.28/5.33 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 18.28/5.33
% 18.28/5.33 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 18.28/5.33
% 18.28/5.33 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 18.28/5.33
% 18.28/5.33 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 18.28/5.33 % ------ Proving...
% 18.28/5.33 % ------ Problem Properties
% 18.28/5.33
% 18.28/5.33 %
% 18.28/5.33 % clauses 22
% 18.28/5.33 % conjectures 1
% 18.28/5.33 % EPR 1
% 18.28/5.33 % Horn 22
% 18.28/5.33 % unary 17
% 18.28/5.33 % binary 5
% 18.28/5.33 % lits 27
% 18.28/5.33 % lits eq 19
% 18.28/5.33 % fd_pure 0
% 18.28/5.33 % fd_pseudo 0
% 18.28/5.33 % fd_cond 0
% 18.28/5.33 % fd_pseudo_cond 0
% 18.28/5.33 % AC symbols 1
% 18.28/5.33
% 18.28/5.33 % ------ Schedule dynamic 5 is on
% 18.28/5.33
% 18.28/5.33 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 18.28/5.33
% 18.28/5.33
% 18.28/5.33 % ------
% 18.28/5.33 % Current options:
% 18.28/5.33 % ------
% 18.28/5.33
% 18.28/5.33
% 18.28/5.33 %
% 18.28/5.33
% 18.28/5.33 % ------ Proving...
% 18.28/5.33 %
% 18.28/5.33
% 18.28/5.33 % SZS status Theorem for theBenchmark.p
% 18.28/5.33
% 18.28/5.33 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 18.28/5.33
% 18.28/5.33
%------------------------------------------------------------------------------