%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : KLE040+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 : n016.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:15 PM UTC 2026
% Result : Theorem 23.66s 5.60s
% Output : CNFRefutation 32.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 11
% Syntax : Number of formulae : 65 ( 52 unt; 2 def)
% Number of atoms : 128 ( 46 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 34 ( 19 ~; 12 |; 1 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 5 ( 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 80 ( 0 sgn 79 !; 1 ?; 38 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
file('/export/starexec/sandbox/benchmark/Axioms/KLE002+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/KLE002+0.ax',additive_associativity) ).
fof(f4,axiom,
! [X0] : addition(X0,X0) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',additive_idempotence) ).
fof(f7,axiom,
! [X0] : multiplication(one,X0) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',multiplicative_left_identity) ).
fof(f9,axiom,
! [X0,X1,X2] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',left_distributivity) ).
fof(f12,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> addition(X0,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',order) ).
fof(f13,axiom,
! [X0] : leq(addition(one,multiplication(X0,star(X0))),star(X0)),
file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',star_unfold_right) ).
fof(f15,axiom,
! [X0,X1,X2] :
( leq(addition(multiplication(X0,X1),X2),X1)
=> leq(multiplication(star(X0),X2),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',star_induction_left) ).
fof(f17,conjecture,
! [X0] : multiplication(star(X0),star(X0)) = star(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f18,negated_conjecture,
~ ! [X0] : multiplication(star(X0),star(X0)) = star(X0),
inference(negated_conjecture,[status(cth)],[f17]) ).
fof(f19,plain,
! [X0,X1,X2] :
( ~ leq(addition(multiplication(X0,X1),X2),X1)
| leq(multiplication(star(X0),X2),X1) ),
inference(ennf_transformation,[],[f15]) ).
fof(f21,plain,
? [X0] : star(X0) != multiplication(star(X0),star(X0)),
inference(ennf_transformation,[],[f18]) ).
fof(f22,plain,
! [X0,X1] :
( ( ~ leq(X0,X1)
| addition(X0,X1) = X1 )
& ( addition(X0,X1) != X1
| leq(X0,X1) ) ),
inference(nnf_transformation,[],[f12]) ).
fof(f23,plain,
star(sK0) != multiplication(star(sK0),star(sK0)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f21]) ).
fof(f24,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f25,plain,
! [X2,X0,X1] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(cnf_transformation,[],[f2]) ).
fof(f27,plain,
! [X0] : addition(X0,X0) = X0,
inference(cnf_transformation,[],[f4]) ).
fof(f30,plain,
! [X0] : multiplication(one,X0) = X0,
inference(cnf_transformation,[],[f7]) ).
fof(f32,plain,
! [X2,X0,X1] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
inference(cnf_transformation,[],[f9]) ).
fof(f35,plain,
! [X0,X1] :
( ~ leq(X0,X1)
| addition(X0,X1) = X1 ),
inference(cnf_transformation,[],[f22]) ).
fof(f36,plain,
! [X0,X1] :
( addition(X0,X1) != X1
| leq(X0,X1) ),
inference(cnf_transformation,[],[f22]) ).
fof(f37,plain,
! [X0] : leq(addition(one,multiplication(X0,star(X0))),star(X0)),
inference(cnf_transformation,[],[f13]) ).
fof(f39,plain,
! [X2,X0,X1] :
( ~ leq(addition(multiplication(X0,X1),X2),X1)
| leq(multiplication(star(X0),X2),X1) ),
inference(cnf_transformation,[],[f19]) ).
fof(f41,plain,
star(sK0) != multiplication(star(sK0),star(sK0)),
inference(cnf_transformation,[],[f23]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f24]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i,X2: $i] : addition(addition(X0,X1),X2) = addition(X0,addition(X1,X2)),
inference(cnf_transformation,[],[f25]) ).
tcf(c_52,plain,
! [X0: $i] : addition(X0,X0) = X0,
inference(cnf_transformation,[],[f27]) ).
tcf(c_55,plain,
! [X0: $i] : multiplication(one,X0) = X0,
inference(cnf_transformation,[],[f30]) ).
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,[],[f32]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i] :
( leq(X0,X1)
| ( addition(X0,X1) != X1 ) ),
inference(cnf_transformation,[],[f36]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i] :
( ( addition(X0,X1) = X1 )
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f35]) ).
tcf(c_62,plain,
! [X0: $i] : leq(addition(one,multiplication(X0,star(X0))),star(X0)),
inference(cnf_transformation,[],[f37]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i,X2: $i] :
( leq(multiplication(star(X0),X2),X1)
| ~ leq(addition(multiplication(X0,X1),X2),X1) ),
inference(cnf_transformation,[],[f39]) ).
tcf(c_66,negated_conjecture,
multiplication(star(sK0),star(sK0)) != star(sK0),
inference(cnf_transformation,[],[f41]) ).
tcf(c_182,definition,
iPr_def_10 = star(sK0),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_183,definition,
iPr_def_11 = multiplication(iPr_def_10,iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_184,negated_conjecture,
iPr_def_11 != iPr_def_10,
inference(demodulation,[status(thm)],[c_66,c_182,c_183]) ).
tcf(c_948,plain,
! [X0: $i] : leq(X0,X0),
inference(superposition,[status(thm)],[c_52,c_60]) ).
tcf(c_10806,plain,
! [X0: $i,X1: $i] : addition(X0,addition(X0,X1)) = addition(X0,X1),
inference(superposition,[status(thm)],[c_52,c_50]) ).
tcf(c_10852,plain,
! [X0: $i] : addition(addition(one,multiplication(X0,star(X0))),star(X0)) = star(X0),
inference(superposition,[status(thm)],[c_62,c_61]) ).
tcf(c_10864,plain,
! [X0: $i] : addition(one,addition(star(X0),multiplication(X0,star(X0)))) = star(X0),
inference(theory_normalisation,[status(thm)],[c_10852,c_50,c_49]) ).
tcf(c_10926,plain,
! [X0: $i,X1: $i,X2: $i] :
( leq(multiplication(star(X1),X0),X2)
| ~ leq(addition(X0,multiplication(X1,X2)),X2) ),
inference(superposition,[status(thm)],[c_49,c_64]) ).
tcf(c_10976,plain,
! [X0: $i,X1: $i] : leq(X0,addition(X0,X1)),
inference(superposition,[status(thm)],[c_10806,c_60]) ).
tcf(c_10990,plain,
! [X0: $i,X1: $i] : leq(X0,addition(X1,X0)),
inference(superposition,[status(thm)],[c_49,c_10976]) ).
tcf(c_11002,plain,
! [X0: $i,X1: $i,X2: $i] : leq(X0,addition(X1,addition(X2,X0))),
inference(superposition,[status(thm)],[c_50,c_10990]) ).
tcf(c_11626,plain,
! [X0: $i] : leq(one,star(X0)),
inference(superposition,[status(thm)],[c_10864,c_10976]) ).
tcf(c_11648,plain,
! [X0: $i] : leq(multiplication(X0,star(X0)),star(X0)),
inference(superposition,[status(thm)],[c_10864,c_11002]) ).
tcf(c_11795,plain,
leq(one,iPr_def_10),
inference(superposition,[status(thm)],[c_182,c_11626]) ).
tcf(c_11797,plain,
addition(one,iPr_def_10) = iPr_def_10,
inference(superposition,[status(thm)],[c_11795,c_61]) ).
tcf(c_11798,plain,
addition(iPr_def_10,one) = iPr_def_10,
inference(theory_normalisation,[status(thm)],[c_11797,c_50,c_49]) ).
tcf(c_11925,plain,
! [X0: $i] : addition(multiplication(iPr_def_10,X0),multiplication(one,X0)) = multiplication(iPr_def_10,X0),
inference(superposition,[status(thm)],[c_11798,c_57]) ).
tcf(c_11956,plain,
! [X0: $i] : addition(multiplication(iPr_def_10,X0),X0) = multiplication(iPr_def_10,X0),
inference(light_normalisation,[status(thm)],[c_11925,c_55]) ).
tcf(c_11957,plain,
! [X0: $i] : addition(X0,multiplication(iPr_def_10,X0)) = multiplication(iPr_def_10,X0),
inference(theory_normalisation,[status(thm)],[c_11956,c_50,c_49]) ).
tcf(c_11975,plain,
leq(multiplication(sK0,iPr_def_10),iPr_def_10),
inference(superposition,[status(thm)],[c_182,c_11648]) ).
tcf(c_11979,plain,
addition(multiplication(sK0,iPr_def_10),iPr_def_10) = iPr_def_10,
inference(superposition,[status(thm)],[c_11975,c_61]) ).
tcf(c_11980,plain,
addition(iPr_def_10,multiplication(sK0,iPr_def_10)) = iPr_def_10,
inference(theory_normalisation,[status(thm)],[c_11979,c_50,c_49]) ).
tcf(c_19783,plain,
addition(iPr_def_10,iPr_def_11) = iPr_def_11,
inference(superposition,[status(thm)],[c_183,c_11957]) ).
tcf(c_61055,plain,
( leq(multiplication(star(sK0),iPr_def_10),iPr_def_10)
| ~ leq(iPr_def_10,iPr_def_10) ),
inference(superposition,[status(thm)],[c_11980,c_10926]) ).
tcf(c_61075,plain,
( leq(iPr_def_11,iPr_def_10)
| ~ leq(iPr_def_10,iPr_def_10) ),
inference(light_normalisation,[status(thm)],[c_61055,c_182,c_183]) ).
tcf(c_61076,plain,
leq(iPr_def_11,iPr_def_10),
inference(forward_subsumption_resolution,[status(thm)],[c_61075,c_948]) ).
tcf(c_62668,plain,
addition(iPr_def_11,iPr_def_10) = iPr_def_10,
inference(superposition,[status(thm)],[c_61076,c_61]) ).
tcf(c_62669,plain,
addition(iPr_def_10,iPr_def_11) = iPr_def_10,
inference(theory_normalisation,[status(thm)],[c_62668,c_50,c_49]) ).
tcf(c_62670,plain,
iPr_def_10 = iPr_def_11,
inference(demodulation,[status(thm)],[c_19783,c_62669]) ).
tcf(c_62730,plain,
iPr_def_10 != iPr_def_10,
inference(demodulation,[status(thm)],[c_184,c_62670]) ).
tcf(c_62731,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_62730]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : KLE040+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.19/0.45 % Computer : n016.cluster.edu
% 0.19/0.45 % Model : x86_64 x86_64
% 0.19/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.45 % Memory : 8046.5625MB
% 0.19/0.45 % OS : Linux 6.8.0-71-generic
% 0.19/0.45 % CPULimit : 300
% 0.19/0.45 % WCLimit : 300
% 0.19/0.45 % DateTime : Wed Sep 23 18:49:11 UTC 2026
% 0.19/0.45 % CPUTime :
% 0.19/0.45 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.23/0.51 Running first-order theorem proving
% 0.23/0.51 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.23/0.52
% 0.23/0.52 % ======== iProver multi-core TPTP/SMT =========
% 0.23/0.52
% 0.23/0.53 % Detected problem language: tptp
% 0.23/0.54 % Proving...
% 23.66/5.60 % SZS status Started for theBenchmark.p
% 23.66/5.60 % SZS status Theorem for theBenchmark.p
% 23.66/5.60
% 23.66/5.60 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 23.66/5.60
% 23.66/5.60 % ------ iProver source info
% 23.66/5.60
% 23.66/5.60 % git: date: 2026-07-19 20:42:38 +0200
% 23.66/5.60 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 23.66/5.60 % git: non_committed_changes: false
% 23.66/5.60
% 23.66/5.60 % ------ Parsing...
% 23.66/5.60 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 23.66/5.60
% 23.66/5.60 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 23.66/5.60
% 23.66/5.60 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 23.66/5.60
% 23.66/5.60 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 23.66/5.60 % ------ Proving...
% 23.66/5.60 % ------ Problem Properties
% 23.66/5.60
% 23.66/5.60 %
% 23.66/5.60 % clauses 20
% 23.66/5.60 % conjectures 1
% 23.66/5.60 % EPR 1
% 23.66/5.60 % Horn 20
% 23.66/5.60 % unary 16
% 23.66/5.60 % binary 4
% 23.66/5.60 % lits 24
% 23.66/5.60 % lits eq 16
% 23.66/5.60 % fd_pure 0
% 23.66/5.60 % fd_pseudo 0
% 23.66/5.60 % fd_cond 0
% 23.66/5.60 % fd_pseudo_cond 0
% 23.66/5.60 % AC symbols 1
% 23.66/5.60
% 23.66/5.60 % ------ Schedule dynamic 5 is on
% 23.66/5.60
% 23.66/5.60 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 23.66/5.60
% 23.66/5.60
% 23.66/5.60 % ------
% 23.66/5.60 % Current options:
% 23.66/5.60 % ------
% 23.66/5.60
% 23.66/5.60
% 23.66/5.60 %
% 23.66/5.60
% 23.66/5.60 % ------ Proving...
% 23.66/5.60 %
% 23.66/5.60
% 23.66/5.60 % SZS status Theorem for theBenchmark.p
% 23.66/5.60
% 23.66/5.60 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 32.35/5.60
% 32.35/5.60
%------------------------------------------------------------------------------