%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : KLE065+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 : n011.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:19 PM UTC 2026
% Result : Theorem 2.38s 1.26s
% Output : CNFRefutation 2.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of formulae : 53 ( 49 unt; 3 def)
% Number of atoms : 79 ( 56 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 11 ( 7 ~; 0 |; 2 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 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; 4 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 56 ( 0 sgn 54 !; 2 ?; 22 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+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/KLE001+0.ax',additive_associativity) ).
fof(f7,axiom,
! [X0] : multiplication(one,X0) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+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/KLE001+0.ax',left_distributivity) ).
fof(f11,axiom,
! [X0] : multiplication(zero,X0) = zero,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',left_annihilation) ).
fof(f13,axiom,
! [X0] : addition(X0,multiplication(domain(X0),X0)) = multiplication(domain(X0),X0),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+5.ax',domain1) ).
fof(f14,axiom,
! [X0,X1] : domain(multiplication(X0,X1)) = domain(multiplication(X0,domain(X1))),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+5.ax',domain2) ).
fof(f15,axiom,
! [X0] : addition(domain(X0),one) = one,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+5.ax',domain3) ).
fof(f16,axiom,
domain(zero) = zero,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+5.ax',domain4) ).
fof(f18,conjecture,
! [X0,X1] :
( multiplication(X0,X1) = zero
=> multiplication(X0,domain(X1)) = zero ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f19,negated_conjecture,
~ ! [X0,X1] :
( multiplication(X0,X1) = zero
=> multiplication(X0,domain(X1)) = zero ),
inference(negated_conjecture,[status(cth)],[f18]) ).
fof(f20,plain,
? [X0,X1] :
( multiplication(X0,X1) = zero
& zero != multiplication(X0,domain(X1)) ),
inference(ennf_transformation,[],[f19]) ).
fof(f21,plain,
( zero = multiplication(sK0,sK1)
& zero != multiplication(sK0,domain(sK1)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f20]) ).
fof(f22,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f23,plain,
! [X2,X0,X1] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(cnf_transformation,[],[f2]) ).
fof(f28,plain,
! [X0] : multiplication(one,X0) = X0,
inference(cnf_transformation,[],[f7]) ).
fof(f30,plain,
! [X2,X0,X1] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
inference(cnf_transformation,[],[f9]) ).
fof(f32,plain,
! [X0] : zero = multiplication(zero,X0),
inference(cnf_transformation,[],[f11]) ).
fof(f33,plain,
! [X0] : multiplication(domain(X0),X0) = addition(X0,multiplication(domain(X0),X0)),
inference(cnf_transformation,[],[f13]) ).
fof(f34,plain,
! [X0,X1] : domain(multiplication(X0,X1)) = domain(multiplication(X0,domain(X1))),
inference(cnf_transformation,[],[f14]) ).
fof(f35,plain,
! [X0] : one = addition(domain(X0),one),
inference(cnf_transformation,[],[f15]) ).
fof(f36,plain,
zero = domain(zero),
inference(cnf_transformation,[],[f16]) ).
fof(f38,plain,
zero = multiplication(sK0,sK1),
inference(cnf_transformation,[],[f21]) ).
fof(f39,plain,
zero != multiplication(sK0,domain(sK1)),
inference(cnf_transformation,[],[f21]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f22]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i,X2: $i] : addition(addition(X0,X1),X2) = addition(X0,addition(X1,X2)),
inference(cnf_transformation,[],[f23]) ).
tcf(c_55,plain,
! [X0: $i] : multiplication(one,X0) = X0,
inference(cnf_transformation,[],[f28]) ).
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,[],[f30]) ).
tcf(c_59,plain,
! [X0: $i] : multiplication(zero,X0) = zero,
inference(cnf_transformation,[],[f32]) ).
tcf(c_60,plain,
! [X0: $i] : addition(X0,multiplication(domain(X0),X0)) = multiplication(domain(X0),X0),
inference(cnf_transformation,[],[f33]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i] : domain(multiplication(X0,domain(X1))) = domain(multiplication(X0,X1)),
inference(cnf_transformation,[],[f34]) ).
tcf(c_62,plain,
! [X0: $i] : addition(domain(X0),one) = one,
inference(cnf_transformation,[],[f35]) ).
tcf(c_63,plain,
domain(zero) = zero,
inference(cnf_transformation,[],[f36]) ).
tcf(c_65,negated_conjecture,
multiplication(sK0,domain(sK1)) != zero,
inference(cnf_transformation,[],[f39]) ).
tcf(c_66,negated_conjecture,
multiplication(sK0,sK1) = zero,
inference(cnf_transformation,[],[f38]) ).
tcf(c_80,plain,
! [X0: $i] : addition(one,domain(X0)) = one,
inference(theory_normalisation,[status(thm)],[c_62,c_50,c_49]) ).
tcf(c_123,definition,
iPr_def_10 = multiplication(sK0,sK1),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_124,definition,
iPr_def_11 = domain(sK1),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_125,definition,
iPr_def_12 = multiplication(sK0,iPr_def_11),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_126,negated_conjecture,
iPr_def_10 = zero,
inference(demodulation,[status(thm)],[c_66,c_123]) ).
tcf(c_127,negated_conjecture,
iPr_def_12 != zero,
inference(demodulation,[status(thm)],[c_65,c_124,c_125]) ).
tcf(c_203,plain,
iPr_def_10 != iPr_def_12,
inference(light_normalisation,[status(thm)],[c_127,c_126]) ).
tcf(c_204,plain,
domain(iPr_def_10) = iPr_def_10,
inference(light_normalisation,[status(thm)],[c_63,c_126]) ).
tcf(c_211,plain,
! [X0: $i] : multiplication(iPr_def_10,X0) = iPr_def_10,
inference(light_normalisation,[status(thm)],[c_59,c_126]) ).
tcf(c_224,plain,
! [X0: $i] : domain(multiplication(X0,sK1)) = domain(multiplication(X0,iPr_def_11)),
inference(superposition,[status(thm)],[c_124,c_61]) ).
tcf(c_237,plain,
domain(multiplication(sK0,iPr_def_11)) = domain(iPr_def_10),
inference(superposition,[status(thm)],[c_123,c_224]) ).
tcf(c_243,plain,
domain(iPr_def_12) = iPr_def_10,
inference(light_normalisation,[status(thm)],[c_237,c_125,c_204]) ).
tcf(c_443,plain,
! [X0: $i,X1: $i] : addition(multiplication(one,X0),multiplication(domain(X1),X0)) = multiplication(one,X0),
inference(superposition,[status(thm)],[c_80,c_57]) ).
tcf(c_468,plain,
! [X0: $i,X1: $i] : addition(X0,multiplication(domain(X1),X0)) = X0,
inference(light_normalisation,[status(thm)],[c_443,c_55]) ).
tcf(c_470,plain,
! [X0: $i] : multiplication(domain(X0),X0) = X0,
inference(demodulation,[status(thm)],[c_60,c_468]) ).
tcf(c_482,plain,
multiplication(iPr_def_10,iPr_def_12) = iPr_def_12,
inference(superposition,[status(thm)],[c_243,c_470]) ).
tcf(c_511,plain,
iPr_def_10 = iPr_def_12,
inference(demodulation,[status(thm)],[c_482,c_211]) ).
tcf(c_512,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_511,c_203]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE065+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.10/0.35 % Computer : n011.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Wed Sep 23 18:49:42 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.10/0.35 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/0.39 Running first-order theorem proving
% 0.14/0.39 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.40
% 0.14/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.40
% 0.14/0.40 % Detected problem language: tptp
% 0.14/0.41 % Proving...
% 2.38/1.26 % SZS status Started for theBenchmark.p
% 2.38/1.26 % SZS status Theorem for theBenchmark.p
% 2.38/1.26
% 2.38/1.26 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.38/1.26
% 2.38/1.26 % ------ iProver source info
% 2.38/1.26
% 2.38/1.26 % git: date: 2026-07-19 20:42:38 +0200
% 2.38/1.26 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.38/1.26 % git: non_committed_changes: false
% 2.38/1.26
% 2.38/1.26 % ------ Parsing...
% 2.38/1.26 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Option_UEQ
% 2.38/1.26 %
% 2.38/1.26
% 2.38/1.26 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.38/1.26
% 2.38/1.26 % ------ Preprocessing...% ------ preprocesses with Option_UEQ
% 2.38/1.26 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.38/1.26
% 2.38/1.26 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 2.38/1.26 % ------ Proving...
% 2.38/1.26 % ------ Problem Properties
% 2.38/1.26
% 2.38/1.26 %
% 2.38/1.26 % clauses 21
% 2.38/1.26 % conjectures 2
% 2.38/1.26 % EPR 2
% 2.38/1.26 % Horn 21
% 2.38/1.26 % unary 21
% 2.38/1.26 % binary 0
% 2.38/1.26 % lits 21
% 2.38/1.26 % lits eq 21
% 2.38/1.26 % fd_pure 0
% 2.38/1.26 % fd_pseudo 0
% 2.38/1.26 % fd_cond 0
% 2.38/1.26 % fd_pseudo_cond 0
% 2.38/1.26 % AC symbols 1
% 2.38/1.26
% 2.38/1.26 % ------ Schedule UEQ
% 2.38/1.26
% 2.38/1.26 % ------ Option_UEQ Time Limit: 10.
% 2.38/1.26
% 2.38/1.26
% 2.38/1.26 % ------
% 2.38/1.26 % Current options:
% 2.38/1.26 % ------
% 2.38/1.26
% 2.38/1.26
% 2.38/1.26 %
% 2.38/1.26
% 2.38/1.26 % ------ Proving...
% 2.38/1.26 %
% 2.38/1.26
% 2.38/1.26 % SZS status Theorem for theBenchmark.p
% 2.38/1.26
% 2.38/1.26 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.38/1.26
% 2.38/1.26
%------------------------------------------------------------------------------