%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : KLE058+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 : n014.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:18 PM UTC 2026
% Result : Theorem 2.80s 11.33s
% Output : CNFRefutation 2.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 31 ( 31 unt; 1 def)
% Number of atoms : 42 ( 30 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 6 ( 6 ~; 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 : 3 ( 1 usr; 2 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 25 ( 0 sgn 25 !; 0 ?; 9 :)
% 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(f6,axiom,
! [X0] : multiplication(X0,one) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',multiplicative_right_identity) ).
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(f15,axiom,
! [X0] : addition(domain(X0),one) = one,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+5.ax',domain3) ).
fof(f18,conjecture,
domain(one) = one,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f19,negated_conjecture,
domain(one) != one,
inference(negated_conjecture,[status(cth)],[f18]) ).
fof(f20,plain,
one != domain(one),
inference(flattening,[],[f19]) ).
fof(f21,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f22,plain,
! [X2,X0,X1] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(cnf_transformation,[],[f2]) ).
fof(f26,plain,
! [X0] : multiplication(X0,one) = X0,
inference(cnf_transformation,[],[f6]) ).
fof(f32,plain,
! [X0] : multiplication(domain(X0),X0) = addition(X0,multiplication(domain(X0),X0)),
inference(cnf_transformation,[],[f13]) ).
fof(f34,plain,
! [X0] : one = addition(domain(X0),one),
inference(cnf_transformation,[],[f15]) ).
fof(f37,plain,
one != domain(one),
inference(cnf_transformation,[],[f20]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f21]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i,X2: $i] : addition(addition(X0,X1),X2) = addition(X0,addition(X1,X2)),
inference(cnf_transformation,[],[f22]) ).
tcf(c_54,plain,
! [X0: $i] : multiplication(X0,one) = X0,
inference(cnf_transformation,[],[f26]) ).
tcf(c_60,plain,
! [X0: $i] : addition(X0,multiplication(domain(X0),X0)) = multiplication(domain(X0),X0),
inference(cnf_transformation,[],[f32]) ).
tcf(c_62,plain,
! [X0: $i] : addition(domain(X0),one) = one,
inference(cnf_transformation,[],[f34]) ).
tcf(c_65,negated_conjecture,
domain(one) != one,
inference(cnf_transformation,[],[f37]) ).
tcf(c_79,plain,
! [X0: $i] : addition(one,domain(X0)) = one,
inference(theory_normalisation,[status(thm)],[c_62,c_50,c_49]) ).
tcf(c_120,definition,
iPr_def_10 = domain(one),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_121,negated_conjecture,
iPr_def_10 != one,
inference(demodulation,[status(thm)],[c_65,c_120]) ).
tcf(c_192,plain,
addition(one,iPr_def_10) = one,
inference(superposition,[status(thm)],[c_120,c_79]) ).
tcf(c_193,plain,
addition(iPr_def_10,one) = one,
inference(theory_normalisation,[status(thm)],[c_192,c_50,c_49]) ).
tcf(c_371,plain,
addition(one,domain(one)) = domain(one),
inference(superposition,[status(thm)],[c_54,c_60]) ).
tcf(c_384,plain,
addition(one,iPr_def_10) = iPr_def_10,
inference(light_normalisation,[status(thm)],[c_371,c_120]) ).
tcf(c_385,plain,
addition(iPr_def_10,one) = iPr_def_10,
inference(theory_normalisation,[status(thm)],[c_384,c_50,c_49]) ).
tcf(c_388,plain,
one = iPr_def_10,
inference(demodulation,[status(thm)],[c_193,c_385]) ).
tcf(c_393,plain,
iPr_def_10 != iPr_def_10,
inference(demodulation,[status(thm)],[c_121,c_388]) ).
tcf(c_394,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_393]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE058+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/10.39 % Computer : n014.cluster.edu
% 0.11/10.39 % Model : x86_64 x86_64
% 0.11/10.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/10.39 % Memory : 8046.5625MB
% 0.11/10.39 % OS : Linux 6.8.0-71-generic
% 0.11/10.39 % CPULimit : 300
% 0.11/10.39 % WCLimit : 300
% 0.11/10.39 % DateTime : Wed Sep 23 18:48:58 UTC 2026
% 0.11/10.40 % CPUTime :
% 0.16/10.40 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.16/10.44 Running first-order theorem proving
% 0.16/10.44 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.16/10.45
% 0.16/10.45 % ======== iProver multi-core TPTP/SMT =========
% 0.16/10.45
% 0.16/10.45 % Detected problem language: tptp
% 0.16/10.47 % Proving...
% 2.80/11.33 % SZS status Started for theBenchmark.p
% 2.80/11.33 % SZS status Theorem for theBenchmark.p
% 2.80/11.33
% 2.80/11.33 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.80/11.33
% 2.80/11.33 % ------ iProver source info
% 2.80/11.33
% 2.80/11.33 % git: date: 2026-07-19 20:42:38 +0200
% 2.80/11.33 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.80/11.33 % git: non_committed_changes: false
% 2.80/11.33
% 2.80/11.33 % ------ Parsing...
% 2.80/11.33 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Option_UEQ
% 2.80/11.33 %
% 2.80/11.33
% 2.80/11.33 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.80/11.33
% 2.80/11.33 % ------ Preprocessing...% ------ preprocesses with Option_UEQ
% 2.80/11.33 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.80/11.33
% 2.80/11.33 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 2.80/11.33 % ------ Proving...
% 2.80/11.33 % ------ Problem Properties
% 2.80/11.33
% 2.80/11.33 %
% 2.80/11.33 % clauses 18
% 2.80/11.33 % conjectures 1
% 2.80/11.33 % EPR 1
% 2.80/11.33 % Horn 18
% 2.80/11.33 % unary 18
% 2.80/11.33 % binary 0
% 2.80/11.33 % lits 18
% 2.80/11.33 % lits eq 18
% 2.80/11.33 % fd_pure 0
% 2.80/11.33 % fd_pseudo 0
% 2.80/11.33 % fd_cond 0
% 2.80/11.33 % fd_pseudo_cond 0
% 2.80/11.33 % AC symbols 1
% 2.80/11.33
% 2.80/11.33 % ------ Schedule UEQ
% 2.80/11.33
% 2.80/11.33 % ------ Option_UEQ Time Limit: 10.
% 2.80/11.33
% 2.80/11.33
% 2.80/11.33 % ------
% 2.80/11.33 % Current options:
% 2.80/11.33 % ------
% 2.80/11.33
% 2.80/11.33
% 2.80/11.33 %
% 2.80/11.33
% 2.80/11.33 % ------ Proving...
% 2.80/11.33 %
% 2.80/11.33
% 2.80/11.33 % SZS status Theorem for theBenchmark.p
% 2.80/11.33
% 2.80/11.33 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.80/11.33
% 2.80/11.33
%------------------------------------------------------------------------------