%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : KLE139+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/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:29 PM UTC 2026
% Result : Theorem 8.63s 1.92s
% Output : CNFRefutation 8.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 36 ( 36 unt; 0 def)
% Number of atoms : 36 ( 35 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 6 ( 6 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 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 : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 57 ( 0 sgn 56 !; 1 ?; 26 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/KLE004+0.ax',additive_associativity) ).
fof(f5,axiom,
! [X0,X1,X2] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',multiplicative_associativity) ).
fof(f9,axiom,
! [X0,X1,X2] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',distributivity2) ).
fof(f10,axiom,
! [X0] : multiplication(zero,X0) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',left_annihilation) ).
fof(f12,axiom,
! [X0] : addition(one,multiplication(star(X0),X0)) = star(X0),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',star_unfold2) ).
fof(f17,axiom,
! [X0] : strong_iteration(X0) = addition(star(X0),multiplication(strong_iteration(X0),zero)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',isolation) ).
fof(f19,conjecture,
! [X0] : strong_iteration(X0) = addition(multiplication(strong_iteration(X0),X0),one),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f20,negated_conjecture,
~ ! [X0] : strong_iteration(X0) = addition(multiplication(strong_iteration(X0),X0),one),
inference(negated_conjecture,[status(cth)],[f19]) ).
fof(f21,plain,
? [X0] : strong_iteration(X0) != addition(multiplication(strong_iteration(X0),X0),one),
inference(ennf_transformation,[],[f20]) ).
fof(f25,plain,
strong_iteration(sK0) != addition(multiplication(strong_iteration(sK0),sK0),one),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f21]) ).
fof(f27,plain,
strong_iteration(sK0) != addition(multiplication(strong_iteration(sK0),sK0),one),
inference(cnf_transformation,[],[f25]) ).
fof(f28,plain,
! [X2,X0,X1] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
inference(cnf_transformation,[],[f9]) ).
fof(f30,plain,
! [X2,X0,X1] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
inference(cnf_transformation,[],[f5]) ).
fof(f32,plain,
! [X2,X0,X1] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(cnf_transformation,[],[f2]) ).
fof(f33,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f35,plain,
! [X0] : star(X0) = addition(one,multiplication(star(X0),X0)),
inference(cnf_transformation,[],[f12]) ).
fof(f39,plain,
! [X0] : strong_iteration(X0) = addition(star(X0),multiplication(strong_iteration(X0),zero)),
inference(cnf_transformation,[],[f17]) ).
fof(f43,plain,
! [X0] : zero = multiplication(zero,X0),
inference(cnf_transformation,[],[f10]) ).
tcf(c_49,negated_conjecture,
addition(multiplication(strong_iteration(sK0),sK0),one) != strong_iteration(sK0),
inference(cnf_transformation,[],[f27]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i,X2: $i] : addition(multiplication(X0,X1),multiplication(X2,X1)) = multiplication(addition(X0,X2),X1),
inference(cnf_transformation,[],[f28]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i,X2: $i] : multiplication(multiplication(X0,X1),X2) = multiplication(X0,multiplication(X1,X2)),
inference(cnf_transformation,[],[f30]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i,X2: $i] : addition(addition(X0,X1),X2) = addition(X0,addition(X1,X2)),
inference(cnf_transformation,[],[f32]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f33]) ).
tcf(c_57,plain,
! [X0: $i] : addition(one,multiplication(star(X0),X0)) = star(X0),
inference(cnf_transformation,[],[f35]) ).
tcf(c_61,plain,
! [X0: $i] : addition(star(X0),multiplication(strong_iteration(X0),zero)) = strong_iteration(X0),
inference(cnf_transformation,[],[f39]) ).
tcf(c_65,plain,
! [X0: $i] : multiplication(zero,X0) = zero,
inference(cnf_transformation,[],[f43]) ).
tcf(c_86,negated_conjecture,
addition(one,multiplication(strong_iteration(sK0),sK0)) != strong_iteration(sK0),
inference(theory_normalisation,[status(thm)],[c_49,c_54,c_55]) ).
tcf(c_499,plain,
! [X0: $i,X1: $i,X2: $i] : addition(X0,addition(X1,X2)) = addition(X1,addition(X0,X2)),
inference(superposition,[status(thm)],[c_54,c_55]) ).
tcf(c_604,plain,
! [X0: $i,X1: $i] : addition(one,addition(X0,multiplication(star(X1),X1))) = addition(X0,star(X1)),
inference(superposition,[status(thm)],[c_57,c_499]) ).
tcf(c_650,plain,
! [X0: $i] : addition(multiplication(strong_iteration(X0),zero),star(X0)) = strong_iteration(X0),
inference(theory_normalisation,[status(thm)],[c_61,c_54,c_55]) ).
tcf(c_734,plain,
! [X0: $i,X1: $i] : addition(multiplication(multiplication(strong_iteration(X0),zero),X1),multiplication(star(X0),X1)) = multiplication(strong_iteration(X0),X1),
inference(superposition,[status(thm)],[c_650,c_50]) ).
tcf(c_17346,plain,
! [X0: $i,X1: $i] : addition(multiplication(strong_iteration(X0),zero),multiplication(star(X0),X1)) = multiplication(strong_iteration(X0),X1),
inference(demodulation,[status(thm)],[c_734,c_52,c_65]) ).
tcf(c_17408,plain,
! [X0: $i] : addition(multiplication(strong_iteration(X0),zero),star(X0)) = addition(one,multiplication(strong_iteration(X0),X0)),
inference(superposition,[status(thm)],[c_17346,c_604]) ).
tcf(c_17437,plain,
! [X0: $i] : addition(one,multiplication(strong_iteration(X0),X0)) = strong_iteration(X0),
inference(light_normalisation,[status(thm)],[c_17408,c_650]) ).
tcf(c_17469,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_86,c_17437]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE139+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.55 % Computer : n016.cluster.edu
% 0.10/0.55 % Model : x86_64 x86_64
% 0.10/0.55 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.55 % Memory : 8046.5625MB
% 0.10/0.55 % OS : Linux 6.8.0-71-generic
% 0.10/0.55 % CPULimit : 300
% 0.10/0.55 % WCLimit : 300
% 0.10/0.55 % DateTime : Wed Sep 23 19:07:56 UTC 2026
% 0.10/0.55 % CPUTime :
% 0.10/0.55 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.58 Running first-order theorem proving
% 0.13/0.58 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.59
% 0.13/0.59 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.59
% 0.13/0.59 % Detected problem language: tptp
% 0.13/0.60 % Proving...
% 8.63/1.92 % SZS status Started for theBenchmark.p
% 8.63/1.92 % SZS status Theorem for theBenchmark.p
% 8.63/1.92
% 8.63/1.92 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 8.63/1.92
% 8.63/1.92 % ------ iProver source info
% 8.63/1.92
% 8.63/1.92 % git: date: 2026-07-19 20:42:38 +0200
% 8.63/1.92 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 8.63/1.92 % git: non_committed_changes: false
% 8.63/1.92
% 8.63/1.92 % ------ Parsing...
% 8.63/1.92 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 8.63/1.92
% 8.63/1.92 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 8.63/1.92
% 8.63/1.92 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 8.63/1.92
% 8.63/1.92 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 8.63/1.92 % ------ Proving...
% 8.63/1.92 % ------ Problem Properties
% 8.63/1.92
% 8.63/1.92 %
% 8.63/1.92 % clauses 20
% 8.63/1.92 % conjectures 1
% 8.63/1.92 % EPR 0
% 8.63/1.92 % Horn 20
% 8.63/1.92 % unary 15
% 8.63/1.92 % binary 5
% 8.63/1.92 % lits 25
% 8.63/1.92 % lits eq 17
% 8.63/1.92 % fd_pure 0
% 8.63/1.92 % fd_pseudo 0
% 8.63/1.92 % fd_cond 0
% 8.63/1.92 % fd_pseudo_cond 0
% 8.63/1.92 % AC symbols 1
% 8.63/1.92
% 8.63/1.92 % ------ Schedule dynamic 5 is on
% 8.63/1.92
% 8.63/1.92 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 8.63/1.92
% 8.63/1.92
% 8.63/1.92 % ------
% 8.63/1.92 % Current options:
% 8.63/1.92 % ------
% 8.63/1.92
% 8.63/1.92
% 8.63/1.92 %
% 8.63/1.92
% 8.63/1.92 % ------ Proving...
% 8.63/1.92 %
% 8.63/1.92
% 8.63/1.92 % SZS status Theorem for theBenchmark.p
% 8.63/1.92
% 8.63/1.92 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 8.63/1.92
% 8.63/1.92
%------------------------------------------------------------------------------