%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : KLE148+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 : 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 : Fri Sep 25 01:52:31 PM UTC 2026
% Result : Theorem 3.82s 1.19s
% Output : CNFRefutation 3.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of formulae : 40 ( 36 unt; 0 def)
% Number of atoms : 44 ( 43 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 9 ( 5 ~; 0 |; 2 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 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 : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 58 ( 0 sgn 56 !; 2 ?; 22 :)
% 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(f3,axiom,
! [X0] : addition(X0,zero) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',additive_identity) ).
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(f6,axiom,
! [X0] : multiplication(X0,one) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',multiplicative_right_identity) ).
fof(f8,axiom,
! [X0,X1,X2] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',distributivity1) ).
fof(f10,axiom,
! [X0] : multiplication(zero,X0) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',left_annihilation) ).
fof(f15,axiom,
! [X0] : strong_iteration(X0) = addition(multiplication(X0,strong_iteration(X0)),one),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',infty_unfold1) ).
fof(f19,conjecture,
! [X0,X1] :
( multiplication(X0,X1) = zero
=> multiplication(X0,strong_iteration(X1)) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f20,negated_conjecture,
~ ! [X0,X1] :
( multiplication(X0,X1) = zero
=> multiplication(X0,strong_iteration(X1)) = X0 ),
inference(negated_conjecture,[status(cth)],[f19]) ).
fof(f24,plain,
? [X0,X1] :
( multiplication(X0,X1) = zero
& multiplication(X0,strong_iteration(X1)) != X0 ),
inference(ennf_transformation,[],[f20]) ).
fof(f26,plain,
( zero = multiplication(sK0,sK1)
& sK0 != multiplication(sK0,strong_iteration(sK1)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[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(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(f34,plain,
! [X2,X0,X1] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
inference(cnf_transformation,[],[f8]) ).
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(f46,plain,
zero = multiplication(sK0,sK1),
inference(cnf_transformation,[],[f26]) ).
fof(f47,plain,
sK0 != multiplication(sK0,strong_iteration(sK1)),
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_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_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_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_68,negated_conjecture,
multiplication(sK0,strong_iteration(sK1)) != sK0,
inference(cnf_transformation,[],[f47]) ).
tcf(c_69,negated_conjecture,
multiplication(sK0,sK1) = zero,
inference(cnf_transformation,[],[f46]) ).
tcf(c_87,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_521,plain,
! [X0: $i] : multiplication(sK0,multiplication(sK1,X0)) = multiplication(zero,X0),
inference(superposition,[status(thm)],[c_69,c_53]) ).
tcf(c_524,plain,
! [X0: $i] : multiplication(sK0,multiplication(sK1,X0)) = zero,
inference(demodulation,[status(thm)],[c_521,c_58]) ).
tcf(c_550,plain,
! [X0: $i,X1: $i] : multiplication(sK0,addition(X0,multiplication(sK1,X1))) = addition(multiplication(sK0,X0),zero),
inference(superposition,[status(thm)],[c_524,c_56]) ).
tcf(c_565,plain,
! [X0: $i,X1: $i] : multiplication(sK0,addition(X0,multiplication(sK1,X1))) = multiplication(sK0,X0),
inference(demodulation,[status(thm)],[c_550,c_51]) ).
tcf(c_4196,plain,
multiplication(sK0,strong_iteration(sK1)) = multiplication(sK0,one),
inference(superposition,[status(thm)],[c_87,c_565]) ).
tcf(c_4199,plain,
multiplication(sK0,strong_iteration(sK1)) = sK0,
inference(demodulation,[status(thm)],[c_4196,c_54]) ).
tcf(c_4205,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_68,c_4199]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : KLE148+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.37 % Computer : n020.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Wed Sep 23 19:06:49 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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.10/0.42
% 0.10/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.42
% 0.10/0.42 % Detected problem language: tptp
% 0.10/0.43 % Proving...
% 3.82/1.19 % SZS status Started for theBenchmark.p
% 3.82/1.19 % SZS status Theorem for theBenchmark.p
% 3.82/1.19
% 3.82/1.19 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.82/1.19
% 3.82/1.19 % ------ iProver source info
% 3.82/1.19
% 3.82/1.19 % git: date: 2026-07-19 20:42:38 +0200
% 3.82/1.19 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.82/1.19 % git: non_committed_changes: false
% 3.82/1.19
% 3.82/1.19 % ------ Parsing...
% 3.82/1.19 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.82/1.19
% 3.82/1.19 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 3.82/1.19
% 3.82/1.19 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.82/1.19
% 3.82/1.19 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.82/1.19 % ------ Proving...
% 3.82/1.19 % ------ Problem Properties
% 3.82/1.19
% 3.82/1.19 %
% 3.82/1.19 % clauses 21
% 3.82/1.19 % conjectures 2
% 3.82/1.19 % EPR 0
% 3.82/1.19 % Horn 21
% 3.82/1.19 % unary 16
% 3.82/1.19 % binary 5
% 3.82/1.19 % lits 26
% 3.82/1.19 % lits eq 18
% 3.82/1.19 % fd_pure 0
% 3.82/1.19 % fd_pseudo 0
% 3.82/1.19 % fd_cond 0
% 3.82/1.19 % fd_pseudo_cond 0
% 3.82/1.19 % AC symbols 1
% 3.82/1.19
% 3.82/1.19 % ------ Input Options Time Limit: Unbounded
% 3.82/1.19
% 3.82/1.19
% 3.82/1.19 % ------
% 3.82/1.19 % Current options:
% 3.82/1.19 % ------
% 3.82/1.19
% 3.82/1.19
% 3.82/1.19 %
% 3.82/1.19
% 3.82/1.19 % ------ Proving...
% 3.82/1.19 %
% 3.82/1.19
% 3.82/1.19 % SZS status Theorem for theBenchmark.p
% 3.82/1.19
% 3.82/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.82/1.20
% 3.82/1.20
%------------------------------------------------------------------------------