%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : KLE038+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 : n002.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 4.57s 1.30s
% Output : CNFRefutation 4.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 9
% Syntax : Number of formulae : 54 ( 48 unt; 1 def)
% Number of atoms : 90 ( 35 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 20 ( 12 ~; 6 |; 1 &)
% ( 1 <=>; 0 =>; 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 : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 69 ( 0 sgn 68 !; 1 ?; 36 :)
% 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(f14,axiom,
! [X0] : leq(addition(one,multiplication(star(X0),X0)),star(X0)),
file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',star_unfold_left) ).
fof(f17,conjecture,
! [X0] : leq(X0,star(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f18,negated_conjecture,
~ ! [X0] : leq(X0,star(X0)),
inference(negated_conjecture,[status(cth)],[f17]) ).
fof(f21,plain,
? [X0] : ~ leq(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,
~ leq(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(f38,plain,
! [X0] : leq(addition(one,multiplication(star(X0),X0)),star(X0)),
inference(cnf_transformation,[],[f14]) ).
fof(f41,plain,
~ leq(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_63,plain,
! [X0: $i] : leq(addition(one,multiplication(star(X0),X0)),star(X0)),
inference(cnf_transformation,[],[f38]) ).
tcf(c_66,negated_conjecture,
~ leq(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,negated_conjecture,
~ leq(sK0,iPr_def_10),
inference(demodulation,[status(thm)],[c_66,c_182]) ).
tcf(c_470,plain,
leq(addition(one,multiplication(iPr_def_10,sK0)),iPr_def_10),
inference(superposition,[status(thm)],[c_182,c_63]) ).
tcf(c_489,plain,
! [X0: $i] : addition(addition(one,multiplication(star(X0),X0)),star(X0)) = star(X0),
inference(superposition,[status(thm)],[c_63,c_61]) ).
tcf(c_490,plain,
! [X0: $i] : addition(one,addition(star(X0),multiplication(star(X0),X0))) = star(X0),
inference(theory_normalisation,[status(thm)],[c_489,c_50,c_49]) ).
tcf(c_507,plain,
addition(addition(one,multiplication(iPr_def_10,sK0)),iPr_def_10) = iPr_def_10,
inference(superposition,[status(thm)],[c_470,c_61]) ).
tcf(c_508,plain,
addition(iPr_def_10,addition(one,multiplication(iPr_def_10,sK0))) = iPr_def_10,
inference(theory_normalisation,[status(thm)],[c_507,c_50,c_49]) ).
tcf(c_554,plain,
! [X0: $i,X1: $i] : addition(X0,addition(X0,X1)) = addition(X0,X1),
inference(superposition,[status(thm)],[c_52,c_50]) ).
tcf(c_733,plain,
! [X0: $i,X1: $i] : leq(X0,addition(X0,X1)),
inference(superposition,[status(thm)],[c_554,c_60]) ).
tcf(c_749,plain,
! [X0: $i,X1: $i] : leq(X0,addition(X1,X0)),
inference(superposition,[status(thm)],[c_49,c_733]) ).
tcf(c_755,plain,
! [X0: $i] : leq(one,star(X0)),
inference(superposition,[status(thm)],[c_490,c_733]) ).
tcf(c_762,plain,
leq(one,iPr_def_10),
inference(superposition,[status(thm)],[c_182,c_755]) ).
tcf(c_764,plain,
addition(one,iPr_def_10) = iPr_def_10,
inference(superposition,[status(thm)],[c_762,c_61]) ).
tcf(c_765,plain,
addition(iPr_def_10,one) = iPr_def_10,
inference(theory_normalisation,[status(thm)],[c_764,c_50,c_49]) ).
tcf(c_768,plain,
! [X0: $i,X1: $i,X2: $i] : leq(X0,addition(X1,addition(X2,X0))),
inference(superposition,[status(thm)],[c_50,c_749]) ).
tcf(c_781,plain,
! [X0: $i] : addition(iPr_def_10,addition(one,X0)) = addition(iPr_def_10,X0),
inference(superposition,[status(thm)],[c_765,c_50]) ).
tcf(c_786,plain,
! [X0: $i] : addition(multiplication(iPr_def_10,X0),multiplication(one,X0)) = multiplication(iPr_def_10,X0),
inference(superposition,[status(thm)],[c_765,c_57]) ).
tcf(c_789,plain,
! [X0: $i] : addition(multiplication(iPr_def_10,X0),X0) = multiplication(iPr_def_10,X0),
inference(light_normalisation,[status(thm)],[c_786,c_55]) ).
tcf(c_790,plain,
! [X0: $i] : addition(X0,multiplication(iPr_def_10,X0)) = multiplication(iPr_def_10,X0),
inference(theory_normalisation,[status(thm)],[c_789,c_50,c_49]) ).
tcf(c_794,plain,
addition(iPr_def_10,multiplication(iPr_def_10,sK0)) = iPr_def_10,
inference(demodulation,[status(thm)],[c_508,c_781]) ).
tcf(c_814,plain,
! [X0: $i,X1: $i,X2: $i] : leq(X0,addition(X1,addition(X0,X2))),
inference(superposition,[status(thm)],[c_49,c_768]) ).
tcf(c_3638,plain,
! [X0: $i,X1: $i] : leq(X0,addition(X1,multiplication(iPr_def_10,X0))),
inference(superposition,[status(thm)],[c_790,c_814]) ).
tcf(c_3900,plain,
leq(sK0,iPr_def_10),
inference(superposition,[status(thm)],[c_794,c_3638]) ).
tcf(c_3906,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_3900,c_183]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE038+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.11/0.36 % Computer : n002.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 : Wed Sep 23 18:46:33 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 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.14/0.41
% 0.14/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.41
% 0.14/0.41 % Detected problem language: tptp
% 0.14/0.42 % Proving...
% 4.57/1.30 % SZS status Started for theBenchmark.p
% 4.57/1.30 % SZS status Theorem for theBenchmark.p
% 4.57/1.30
% 4.57/1.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.57/1.30
% 4.57/1.30 % ------ iProver source info
% 4.57/1.30
% 4.57/1.30 % git: date: 2026-07-19 20:42:38 +0200
% 4.57/1.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.57/1.30 % git: non_committed_changes: false
% 4.57/1.30
% 4.57/1.30 % ------ Parsing...
% 4.57/1.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.57/1.30
% 4.57/1.30 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 4.57/1.30
% 4.57/1.30 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.57/1.30
% 4.57/1.30 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.57/1.30 % ------ Proving...
% 4.57/1.30 % ------ Problem Properties
% 4.57/1.30
% 4.57/1.30 %
% 4.57/1.30 % clauses 19
% 4.57/1.30 % conjectures 1
% 4.57/1.30 % EPR 1
% 4.57/1.30 % Horn 19
% 4.57/1.30 % unary 15
% 4.57/1.30 % binary 4
% 4.57/1.30 % lits 23
% 4.57/1.30 % lits eq 14
% 4.57/1.30 % fd_pure 0
% 4.57/1.30 % fd_pseudo 0
% 4.57/1.30 % fd_cond 0
% 4.57/1.30 % fd_pseudo_cond 0
% 4.57/1.30 % AC symbols 1
% 4.57/1.30
% 4.57/1.30 % ------ Schedule dynamic 5 is on
% 4.57/1.30
% 4.57/1.30 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.57/1.30
% 4.57/1.30
% 4.57/1.30 % ------
% 4.57/1.30 % Current options:
% 4.57/1.30 % ------
% 4.57/1.30
% 4.57/1.30
% 4.57/1.30 %
% 4.57/1.30
% 4.57/1.30 % ------ Proving...
% 4.57/1.30 %
% 4.57/1.30
% 4.57/1.30 % SZS status Theorem for theBenchmark.p
% 4.57/1.30
% 4.57/1.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.57/1.31
% 4.57/1.31
%------------------------------------------------------------------------------