%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : KLE001+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 : n009.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:05 PM UTC 2026
% Result : Theorem 0.45s 1.29s
% Output : CNFRefutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 18 ( 7 unt; 0 def)
% Number of atoms : 32 ( 14 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 29 ( 15 ~; 8 |; 3 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 26 ( 0 sgn 23 !; 3 ?; 9 :)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0] : addition(X0,X0) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_idempotence) ).
fof(f12,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> addition(X0,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',order) ).
fof(f13,conjecture,
! [X0,X1,X2] :
( leq(X0,X1)
=> leq(addition(X0,X2),addition(X0,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f14,negated_conjecture,
~ ! [X0,X1,X2] :
( leq(X0,X1)
=> leq(addition(X0,X2),addition(X0,X2)) ),
inference(negated_conjecture,[status(cth)],[f13]) ).
fof(f15,plain,
? [X0,X1,X2] :
( leq(X0,X1)
& ~ leq(addition(X0,X2),addition(X0,X2)) ),
inference(ennf_transformation,[],[f14]) ).
fof(f16,plain,
! [X0,X1] :
( ( ~ leq(X0,X1)
| addition(X0,X1) = X1 )
& ( addition(X0,X1) != X1
| leq(X0,X1) ) ),
inference(nnf_transformation,[],[f12]) ).
fof(f17,plain,
( leq(sK0,sK1)
& ~ leq(addition(sK0,sK2),addition(sK0,sK2)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f15]) ).
fof(f21,plain,
! [X0] : addition(X0,X0) = X0,
inference(cnf_transformation,[],[f4]) ).
fof(f30,plain,
! [X0,X1] :
( addition(X0,X1) != X1
| leq(X0,X1) ),
inference(cnf_transformation,[],[f16]) ).
fof(f32,plain,
~ leq(addition(sK0,sK2),addition(sK0,sK2)),
inference(cnf_transformation,[],[f17]) ).
tcf(c_52,plain,
! [X0: $i] : addition(X0,X0) = X0,
inference(cnf_transformation,[],[f21]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i] :
( leq(X0,X1)
| ( addition(X0,X1) != X1 ) ),
inference(cnf_transformation,[],[f30]) ).
tcf(c_62,negated_conjecture,
~ leq(addition(sK0,sK2),addition(sK0,sK2)),
inference(cnf_transformation,[],[f32]) ).
tcf(c_74,plain,
! [X0: $i,X1: $i] :
( ( addition(X0,X1) != X1 )
| leq(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_60]) ).
tcf(c_75,plain,
! [X0: $i,X1: $i] :
( leq(X0,X1)
| ( addition(X0,X1) != X1 ) ),
inference(renaming,[status(thm)],[c_74]) ).
tcf(c_145,plain,
! [X0: $i,X1: $i] :
( ( addition(sK0,sK2) != X1 )
| ( addition(sK0,sK2) != X0 )
| ( addition(X0,X1) != X1 ) ),
inference(resolution_lifted,[status(thm)],[c_75,c_62]) ).
tcf(c_146,plain,
addition(addition(sK0,sK2),addition(sK0,sK2)) != addition(sK0,sK2),
inference(unflattening,[status(thm)],[c_145]) ).
tcf(c_149,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_146,c_52]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE001+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.36 % Computer : n009.cluster.edu
% 0.12/0.36 % Model : x86_64 x86_64
% 0.12/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.36 % Memory : 8046.5625MB
% 0.12/0.36 % OS : Linux 6.8.0-71-generic
% 0.12/0.36 % CPULimit : 300
% 0.12/0.36 % WCLimit : 300
% 0.12/0.36 % DateTime : Wed Sep 23 18:33:43 UTC 2026
% 0.12/0.36 % CPUTime :
% 0.12/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/0.40 Running first-order theorem proving
% 0.15/0.40 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.15/0.42
% 0.15/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.15/0.42
% 0.15/0.42 % Detected problem language: tptp
% 0.15/0.43 % Proving...
% 0.45/1.29 % SZS status Started for theBenchmark.p
% 0.45/1.29 % SZS status Theorem for theBenchmark.p
% 0.45/1.29
% 0.45/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.45/1.29
% 0.45/1.29 % ------ iProver source info
% 0.45/1.29
% 0.45/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 0.45/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.45/1.29 % git: non_committed_changes: false
% 0.45/1.29
% 0.45/1.29 % ------ Parsing...
% 0.45/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.45/1.29
% 0.45/1.29 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s %
% 0.45/1.29
% 0.45/1.29 % SZS status Theorem for theBenchmark.p
% 0.45/1.29
% 0.45/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.45/1.29
% 0.45/1.29
%------------------------------------------------------------------------------