%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : KLE059+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:18 PM UTC 2026
% Result : Theorem 1.64s 1.28s
% Output : CNFRefutation 1.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 18 unt; 0 def)
% Number of atoms : 26 ( 25 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 12 ( 8 ~; 0 |; 2 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 3 ( 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 27 ( 0 sgn 25 !; 2 ?; 7 :)
% 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(f17,axiom,
! [X0,X1] : domain(addition(X0,X1)) = addition(domain(X0),domain(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+5.ax',domain5) ).
fof(f18,conjecture,
! [X0,X1] :
( addition(X0,X1) = X1
=> addition(domain(X0),domain(X1)) = domain(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f19,negated_conjecture,
~ ! [X0,X1] :
( addition(X0,X1) = X1
=> addition(domain(X0),domain(X1)) = domain(X1) ),
inference(negated_conjecture,[status(cth)],[f18]) ).
fof(f20,plain,
? [X0,X1] :
( addition(X0,X1) = X1
& domain(X1) != addition(domain(X0),domain(X1)) ),
inference(ennf_transformation,[],[f19]) ).
fof(f21,plain,
( sK1 = addition(sK0,sK1)
& domain(sK1) != addition(domain(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(f37,plain,
! [X0,X1] : domain(addition(X0,X1)) = addition(domain(X0),domain(X1)),
inference(cnf_transformation,[],[f17]) ).
fof(f38,plain,
sK1 = addition(sK0,sK1),
inference(cnf_transformation,[],[f21]) ).
fof(f39,plain,
domain(sK1) != addition(domain(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_64,plain,
! [X0: $i,X1: $i] : addition(domain(X0),domain(X1)) = domain(addition(X0,X1)),
inference(cnf_transformation,[],[f37]) ).
tcf(c_65,negated_conjecture,
addition(domain(sK0),domain(sK1)) != domain(sK1),
inference(cnf_transformation,[],[f39]) ).
tcf(c_66,negated_conjecture,
addition(sK0,sK1) = sK1,
inference(cnf_transformation,[],[f38]) ).
tcf(c_81,negated_conjecture,
addition(domain(sK1),domain(sK0)) != domain(sK1),
inference(theory_normalisation,[status(thm)],[c_65,c_50,c_49]) ).
tcf(c_82,negated_conjecture,
addition(sK1,sK0) = sK1,
inference(theory_normalisation,[status(thm)],[c_66,c_50,c_49]) ).
tcf(c_120,plain,
domain(addition(sK1,sK0)) != domain(sK1),
inference(ac_demodulation,[status(thm)],[c_81,c_64,c_50,c_49]) ).
tcf(c_122,plain,
domain(sK1) != domain(sK1),
inference(light_normalisation,[status(thm)],[c_120,c_82]) ).
tcf(c_123,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_122]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE059+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.12/0.38 % Computer : n011.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Wed Sep 23 18:49:12 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.41 Running first-order theorem proving
% 0.12/0.41 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.12/0.42
% 0.12/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.42
% 0.12/0.42 % Detected problem language: tptp
% 0.12/0.44 % Proving...
% 1.64/1.28 % SZS status Started for theBenchmark.p
% 1.64/1.28 % SZS status Theorem for theBenchmark.p
% 1.64/1.28
% 1.64/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.64/1.28
% 1.64/1.28 % ------ iProver source info
% 1.64/1.28
% 1.64/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 1.64/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.64/1.28 % git: non_committed_changes: false
% 1.64/1.28
% 1.64/1.28 % ------ Parsing...
% 1.64/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Option_UEQ
% 1.64/1.28 %
% 1.64/1.28
% 1.64/1.28 % ------ Preprocessing...%
% 1.64/1.28
% 1.64/1.28 % SZS status Theorem for theBenchmark.p
% 1.64/1.28
% 1.64/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.64/1.28
% 1.64/1.28
%------------------------------------------------------------------------------