%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : KLE083+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 : n001.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:21 PM UTC 2026
% Result : Theorem 3.86s 1.32s
% Output : CNFRefutation 3.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 12
% Syntax : Number of formulae : 48 ( 48 unt; 3 def)
% Number of atoms : 81 ( 47 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 8 ( 8 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 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; 3 con; 0-2 aty)
% Number of variables : 45 ( 0 sgn 44 !; 1 ?; 16 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_associativity) ).
fof(f3,axiom,
! [X0] : addition(X0,zero) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_identity) ).
fof(f7,axiom,
! [X0] : multiplication(one,X0) = X0,
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/KLE001+0.ax',left_distributivity) ).
fof(f13,axiom,
! [X0] : multiplication(antidomain(X0),X0) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+4.ax',domain1) ).
fof(f15,axiom,
! [X0] : addition(antidomain(antidomain(X0)),antidomain(X0)) = one,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+4.ax',domain3) ).
fof(f16,axiom,
! [X0] : domain(X0) = antidomain(antidomain(X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+4.ax',domain4) ).
fof(f21,conjecture,
! [X0] : X0 = multiplication(domain(X0),X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f22,negated_conjecture,
~ ! [X0] : X0 = multiplication(domain(X0),X0),
inference(negated_conjecture,[status(cth)],[f21]) ).
fof(f23,plain,
? [X0] : multiplication(domain(X0),X0) != X0,
inference(ennf_transformation,[],[f22]) ).
fof(f24,plain,
sK0 != multiplication(domain(sK0),sK0),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f23]) ).
fof(f25,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f26,plain,
! [X2,X0,X1] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(cnf_transformation,[],[f2]) ).
fof(f27,plain,
! [X0] : addition(X0,zero) = X0,
inference(cnf_transformation,[],[f3]) ).
fof(f31,plain,
! [X0] : multiplication(one,X0) = X0,
inference(cnf_transformation,[],[f7]) ).
fof(f33,plain,
! [X2,X0,X1] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
inference(cnf_transformation,[],[f9]) ).
fof(f36,plain,
! [X0] : zero = multiplication(antidomain(X0),X0),
inference(cnf_transformation,[],[f13]) ).
fof(f38,plain,
! [X0] : one = addition(antidomain(antidomain(X0)),antidomain(X0)),
inference(cnf_transformation,[],[f15]) ).
fof(f39,plain,
! [X0] : antidomain(antidomain(X0)) = domain(X0),
inference(cnf_transformation,[],[f16]) ).
fof(f44,plain,
sK0 != multiplication(domain(sK0),sK0),
inference(cnf_transformation,[],[f24]) ).
fof(f45,plain,
sK0 != multiplication(antidomain(antidomain(sK0)),sK0),
inference(definition_unfolding,[],[f44,f39]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f25]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i,X2: $i] : addition(addition(X0,X1),X2) = addition(X0,addition(X1,X2)),
inference(cnf_transformation,[],[f26]) ).
tcf(c_51,plain,
! [X0: $i] : addition(X0,zero) = X0,
inference(cnf_transformation,[],[f27]) ).
tcf(c_55,plain,
! [X0: $i] : multiplication(one,X0) = X0,
inference(cnf_transformation,[],[f31]) ).
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,[],[f33]) ).
tcf(c_60,plain,
! [X0: $i] : multiplication(antidomain(X0),X0) = zero,
inference(cnf_transformation,[],[f36]) ).
tcf(c_62,plain,
! [X0: $i] : addition(antidomain(antidomain(X0)),antidomain(X0)) = one,
inference(cnf_transformation,[],[f38]) ).
tcf(c_66,negated_conjecture,
multiplication(antidomain(antidomain(sK0)),sK0) != sK0,
inference(cnf_transformation,[],[f45]) ).
tcf(c_82,plain,
! [X0: $i] : addition(antidomain(X0),antidomain(antidomain(X0))) = one,
inference(theory_normalisation,[status(thm)],[c_62,c_50,c_49]) ).
tcf(c_128,definition,
iPr_def_10 = antidomain(sK0),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_129,definition,
iPr_def_11 = antidomain(iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_130,definition,
iPr_def_12 = multiplication(iPr_def_11,sK0),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_131,negated_conjecture,
iPr_def_12 != sK0,
inference(demodulation,[status(thm)],[c_66,c_128,c_129,c_130]) ).
tcf(c_215,plain,
addition(iPr_def_10,antidomain(iPr_def_10)) = one,
inference(superposition,[status(thm)],[c_128,c_82]) ).
tcf(c_217,plain,
addition(iPr_def_10,iPr_def_11) = one,
inference(light_normalisation,[status(thm)],[c_215,c_129]) ).
tcf(c_219,plain,
! [X0: $i] : multiplication(addition(iPr_def_10,iPr_def_11),X0) = X0,
inference(demodulation,[status(thm)],[c_55,c_217]) ).
tcf(c_221,plain,
multiplication(iPr_def_10,sK0) = zero,
inference(superposition,[status(thm)],[c_128,c_60]) ).
tcf(c_222,plain,
multiplication(iPr_def_11,iPr_def_10) = zero,
inference(superposition,[status(thm)],[c_129,c_60]) ).
tcf(c_226,plain,
! [X0: $i] : addition(X0,multiplication(iPr_def_11,iPr_def_10)) = X0,
inference(demodulation,[status(thm)],[c_51,c_222]) ).
tcf(c_228,plain,
multiplication(iPr_def_10,sK0) = multiplication(iPr_def_11,iPr_def_10),
inference(light_normalisation,[status(thm)],[c_221,c_222]) ).
tcf(c_231,plain,
! [X0: $i] : addition(multiplication(iPr_def_10,X0),multiplication(iPr_def_11,X0)) = X0,
inference(demodulation,[status(thm)],[c_219,c_57]) ).
tcf(c_235,plain,
addition(multiplication(iPr_def_10,sK0),iPr_def_12) = sK0,
inference(superposition,[status(thm)],[c_130,c_231]) ).
tcf(c_236,plain,
addition(iPr_def_12,multiplication(iPr_def_10,sK0)) = sK0,
inference(theory_normalisation,[status(thm)],[c_235,c_50,c_49]) ).
tcf(c_237,plain,
addition(iPr_def_12,multiplication(iPr_def_11,iPr_def_10)) = sK0,
inference(light_normalisation,[status(thm)],[c_236,c_228]) ).
tcf(c_244,plain,
addition(iPr_def_12,multiplication(iPr_def_11,iPr_def_10)) != iPr_def_12,
inference(demodulation,[status(thm)],[c_131,c_237]) ).
tcf(c_245,plain,
$false,
inference(ground_joinability,[status(thm)],[c_244,c_226]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE083+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.12/0.37 % Computer : n001.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Wed Sep 23 18:58:22 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.41 Running first-order theorem proving
% 0.12/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.12/0.42
% 0.12/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.42
% 0.12/0.43 % Detected problem language: tptp
% 0.12/0.44 % Proving...
% 3.86/1.32 % SZS status Started for theBenchmark.p
% 3.86/1.32 % SZS status Theorem for theBenchmark.p
% 3.86/1.32
% 3.86/1.32 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.86/1.32
% 3.86/1.32 % ------ iProver source info
% 3.86/1.32
% 3.86/1.32 % git: date: 2026-07-19 20:42:38 +0200
% 3.86/1.32 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.86/1.32 % git: non_committed_changes: false
% 3.86/1.32
% 3.86/1.32 % ------ Parsing...
% 3.86/1.32 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Option_UEQ
% 3.86/1.32 %
% 3.86/1.32
% 3.86/1.32 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 3.86/1.32
% 3.86/1.32 % ------ Preprocessing...% ------ preprocesses with Option_UEQ
% 3.86/1.32 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.86/1.32
% 3.86/1.32 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.86/1.32 % ------ Proving...
% 3.86/1.32 % ------ Problem Properties
% 3.86/1.32
% 3.86/1.32 %
% 3.86/1.32 % clauses 21
% 3.86/1.32 % conjectures 1
% 3.86/1.32 % EPR 1
% 3.86/1.32 % Horn 21
% 3.86/1.32 % unary 21
% 3.86/1.32 % binary 0
% 3.86/1.32 % lits 21
% 3.86/1.32 % lits eq 21
% 3.86/1.32 % fd_pure 0
% 3.86/1.32 % fd_pseudo 0
% 3.86/1.32 % fd_cond 0
% 3.86/1.32 % fd_pseudo_cond 0
% 3.86/1.32 % AC symbols 1
% 3.86/1.32
% 3.86/1.32 % ------ Schedule UEQ
% 3.86/1.32
% 3.86/1.32 % ------ Option_UEQ Time Limit: 10.
% 3.86/1.32
% 3.86/1.32
% 3.86/1.32 % ------
% 3.86/1.32 % Current options:
% 3.86/1.32 % ------
% 3.86/1.32
% 3.86/1.32
% 3.86/1.32 %
% 3.86/1.32
% 3.86/1.32 % ------ Proving...
% 3.86/1.32 %
% 3.86/1.32
% 3.86/1.32 % SZS status Theorem for theBenchmark.p
% 3.86/1.32
% 3.86/1.32 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.86/1.32
% 3.86/1.32
%------------------------------------------------------------------------------