%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : KLE003+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 : n008.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 1.18s 1.28s
% Output : CNFRefutation 1.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 14 ( 6 unt; 0 def)
% Number of atoms : 28 ( 27 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 26 ( 12 ~; 8 |; 3 &)
% ( 2 <=>; 0 =>; 0 <=; 1 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 2 ( 1 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 : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 11 ( 0 sgn 9 !; 2 ?; 1 :)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0] : addition(X0,X0) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_idempotence) ).
fof(f13,conjecture,
( ! [X0] : addition(X0,X0) = X0
<=> addition(one,one) = one ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f14,negated_conjecture,
~ ( ! [X0] : addition(X0,X0) = X0
<=> addition(one,one) = one ),
inference(negated_conjecture,[status(cth)],[f13]) ).
fof(f15,plain,
( ! [X0] : addition(X0,X0) = X0
<~> addition(one,one) = one ),
inference(ennf_transformation,[],[f14]) ).
fof(f16,plain,
( ( ! [X0] : addition(X0,X0) = X0
| addition(one,one) = one )
& ( ? [X0] : addition(X0,X0) != X0
| one != addition(one,one) ) ),
inference(nnf_transformation,[],[f15]) ).
fof(f17,plain,
( ( ! [X1] : addition(X1,X1) = X1
| addition(one,one) = one )
& ( ? [X0] : addition(X0,X0) != X0
| one != addition(one,one) ) ),
inference(rectify,[],[f16]) ).
fof(f18,plain,
( ( ! [X1] : addition(X1,X1) = X1
| addition(one,one) = one )
& ( sK0 != addition(sK0,sK0)
| one != addition(one,one) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f17]) ).
fof(f22,plain,
! [X0] : addition(X0,X0) = X0,
inference(cnf_transformation,[],[f4]) ).
fof(f31,plain,
( sK0 != addition(sK0,sK0)
| one != addition(one,one) ),
inference(cnf_transformation,[],[f18]) ).
tcf(c_52,plain,
! [X0: $i] : addition(X0,X0) = X0,
inference(cnf_transformation,[],[f22]) ).
tcf(c_60,negated_conjecture,
( ( addition(sK0,sK0) != sK0 )
| ( addition(one,one) != one ) ),
inference(cnf_transformation,[],[f31]) ).
tcf(c_65,plain,
addition(one,one) = one,
inference(instantiation,[status(thm)],[c_52]) ).
tcf(c_74,negated_conjecture,
addition(sK0,sK0) != sK0,
inference(global_subsumption_just,[status(thm)],[c_60,c_65,c_60]) ).
tcf(c_80,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_74,c_52]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE003+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.10/0.36 % Computer : n008.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Wed Sep 23 18:34:55 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/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.10/0.41
% 0.10/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.41
% 0.10/0.41 % Detected problem language: tptp
% 0.10/0.43 % Proving...
% 1.18/1.28 % SZS status Started for theBenchmark.p
% 1.18/1.28 % SZS status Theorem for theBenchmark.p
% 1.18/1.28
% 1.18/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.18/1.28
% 1.18/1.28 % ------ iProver source info
% 1.18/1.28
% 1.18/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 1.18/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.18/1.28 % git: non_committed_changes: false
% 1.18/1.28
% 1.18/1.28 % ------ Parsing...
% 1.18/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.18/1.28
% 1.18/1.28 % ------ Preprocessing...%
% 1.18/1.28
% 1.18/1.28 % SZS status Theorem for theBenchmark.p
% 1.18/1.28
% 1.18/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.18/1.28
% 1.18/1.28
%------------------------------------------------------------------------------