%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : FLD069-3 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n012.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:15:53 PM UTC 2026
% Result : Unsatisfiable 2.02s 1.06s
% Output : CNFRefutation 2.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of formulae : 22 ( 11 unt; 0 def)
% Number of atoms : 46 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 50 ( 26 ~; 24 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 20 ( 0 sgn 20 !; 0 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] :
( ~ defined(X0)
| sum(additive_identity,X0,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',existence_of_identity_addition) ).
fof(f21,axiom,
! [X0,X1] :
( ~ less_or_equal(X1,X0)
| ~ less_or_equal(X0,X1)
| sum(additive_identity,X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',antisymmetry_of_order_relation) ).
fof(f24,axiom,
! [X2,X3,X0,X1,X4] :
( ~ sum(X3,X4,X1)
| ~ sum(X2,X4,X0)
| ~ less_or_equal(X2,X3)
| less_or_equal(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',compatibility_of_order_relation_and_addition) ).
fof(f28,axiom,
defined(b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_is_defined) ).
fof(f29,negated_conjecture,
less_or_equal(additive_identity,a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_3) ).
fof(f30,negated_conjecture,
less_or_equal(additive_identity,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_4) ).
fof(f31,negated_conjecture,
~ sum(additive_identity,b,additive_identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_sum_5) ).
fof(f32,negated_conjecture,
sum(a,b,additive_identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sum_6) ).
tcf(c_83,plain,
! [X0: $i] :
( sum(additive_identity,X0,X0)
| ~ defined(X0) ),
inference(cnf_transformation,[],[f3]) ).
tcf(c_101,plain,
! [X0: $i,X1: $i] :
( sum(additive_identity,X0,X1)
| ~ less_or_equal(X1,X0)
| ~ less_or_equal(X0,X1) ),
inference(cnf_transformation,[],[f21]) ).
tcf(c_104,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( less_or_equal(X2,X4)
| ~ less_or_equal(X0,X3)
| ~ sum(X3,X1,X4)
| ~ sum(X0,X1,X2) ),
inference(cnf_transformation,[],[f24]) ).
tcf(c_108,plain,
defined(b),
inference(cnf_transformation,[],[f28]) ).
tcf(c_109,negated_conjecture,
less_or_equal(additive_identity,a),
inference(cnf_transformation,[],[f29]) ).
tcf(c_110,negated_conjecture,
less_or_equal(additive_identity,b),
inference(cnf_transformation,[],[f30]) ).
tcf(c_111,negated_conjecture,
~ sum(additive_identity,b,additive_identity),
inference(cnf_transformation,[],[f31]) ).
tcf(c_112,negated_conjecture,
sum(a,b,additive_identity),
inference(cnf_transformation,[],[f32]) ).
tcf(c_297,plain,
( sum(additive_identity,b,additive_identity)
| ~ less_or_equal(additive_identity,b)
| ~ less_or_equal(b,additive_identity) ),
inference(instantiation,[status(thm)],[c_101]) ).
tcf(c_332,plain,
! [X0: $i,X1: $i,X2: $i] :
( less_or_equal(b,additive_identity)
| ~ less_or_equal(X0,X2)
| ~ sum(X2,X1,additive_identity)
| ~ sum(X0,X1,b) ),
inference(instantiation,[status(thm)],[c_104]) ).
tcf(c_336,plain,
( sum(additive_identity,b,b)
| ~ defined(b) ),
inference(instantiation,[status(thm)],[c_83]) ).
tcf(c_841,plain,
! [X0: $i] :
( less_or_equal(b,additive_identity)
| ~ less_or_equal(additive_identity,X0)
| ~ sum(additive_identity,b,b)
| ~ sum(X0,b,additive_identity) ),
inference(instantiation,[status(thm)],[c_332]) ).
tcf(c_4313,plain,
( less_or_equal(b,additive_identity)
| ~ less_or_equal(additive_identity,a)
| ~ sum(additive_identity,b,b)
| ~ sum(a,b,additive_identity) ),
inference(instantiation,[status(thm)],[c_841]) ).
tcf(c_4314,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_4313,c_336,c_297,c_111,c_112,c_109,c_110,c_108]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : FLD069-3 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.02 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.03/0.30 % Computer : n012.cluster.edu
% 0.03/0.30 % Model : x86_64 x86_64
% 0.03/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.30 % Memory : 8046.5625MB
% 0.03/0.30 % OS : Linux 6.8.0-71-generic
% 0.03/0.30 % CPULimit : 300
% 0.03/0.30 % WCLimit : 300
% 0.03/0.30 % DateTime : Fri Sep 25 11:03:36 UTC 2026
% 0.03/0.30 % CPUTime :
% 0.03/0.30 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.03/0.32 Running first-order theorem proving
% 0.03/0.32 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.03/0.32
% 0.03/0.32 % ======== iProver multi-core TPTP/SMT =========
% 0.03/0.32
% 0.03/0.32 % Detected problem language: tptp
% 0.06/0.33 % Proving...
% 2.02/1.06 % SZS status Started for theBenchmark.p
% 2.02/1.06 % SZS status Unsatisfiable for theBenchmark.p
% 2.02/1.06
% 2.02/1.06 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.02/1.06
% 2.02/1.06 % ------ iProver source info
% 2.02/1.06
% 2.02/1.06 % git: date: 2026-07-19 20:42:38 +0200
% 2.02/1.06 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.02/1.06 % git: non_committed_changes: false
% 2.02/1.06
% 2.02/1.06 % ------ Parsing...% successful
% 2.02/1.06
% 2.02/1.06
% 2.02/1.06 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.02/1.06
% 2.02/1.06 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.02/1.06
% 2.02/1.06 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.02/1.06 % ------ Proving...
% 2.02/1.06 % ------ Problem Properties
% 2.02/1.06
% 2.02/1.06 %
% 2.02/1.06 % clauses 32
% 2.02/1.06 % conjectures 4
% 2.02/1.06 % EPR 24
% 2.02/1.06 % Horn 29
% 2.02/1.06 % unary 9
% 2.02/1.06 % binary 6
% 2.02/1.06 % lits 83
% 2.02/1.06 % lits eq 0
% 2.02/1.06 % fd_pure 0
% 2.02/1.06 % fd_pseudo 0
% 2.02/1.06 % fd_cond 0
% 2.02/1.06 % fd_pseudo_cond 0
% 2.02/1.06 % AC symbols 0
% 2.02/1.06
% 2.02/1.06 % ------ Schedule dynamic 5 is on
% 2.02/1.06
% 2.02/1.06 % ------ no equalities: superposition off
% 2.02/1.06
% 2.02/1.06 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.02/1.06
% 2.02/1.06
% 2.02/1.06 % ------
% 2.02/1.06 % Current options:
% 2.02/1.06 % ------
% 2.02/1.06
% 2.02/1.06
% 2.02/1.06 %
% 2.02/1.06
% 2.02/1.06 % ------ Proving...
% 2.02/1.06 %
% 2.02/1.06
% 2.02/1.06 % SZS status Unsatisfiable for theBenchmark.p
% 2.02/1.06
% 2.02/1.06 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.02/1.06
% 2.02/1.06
%------------------------------------------------------------------------------