%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : FLD059-4 : 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 : n019.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:50 PM UTC 2026
% Result : Unsatisfiable 3.72s 11.51s
% Output : CNFRefutation 3.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of formulae : 21 ( 9 unt; 0 def)
% Number of atoms : 47 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 54 ( 28 ~; 26 |; 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 : 25 ( 0 sgn 25 !; 0 ?; 16 :)
% 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(f22,axiom,
! [X2,X0,X1] :
( ~ less_or_equal(X2,X1)
| ~ less_or_equal(X0,X2)
| less_or_equal(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',transitivity_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(f27,axiom,
defined(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_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,
sum(a,a,u),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sum_4) ).
fof(f31,negated_conjecture,
~ less_or_equal(additive_identity,u),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_less_or_equal_5) ).
tcf(c_80,plain,
defined(a),
inference(cnf_transformation,[],[f27]) ).
tcf(c_82,negated_conjecture,
less_or_equal(additive_identity,a),
inference(cnf_transformation,[],[f29]) ).
tcf(c_83,negated_conjecture,
sum(a,a,u),
inference(cnf_transformation,[],[f30]) ).
tcf(c_84,negated_conjecture,
~ less_or_equal(additive_identity,u),
inference(cnf_transformation,[],[f31]) ).
tcf(c_86,plain,
! [X0: $i] :
( sum(additive_identity,X0,X0)
| ~ defined(X0) ),
inference(cnf_transformation,[],[f3]) ).
tcf(c_89,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_91,plain,
! [X0: $i,X1: $i,X2: $i] :
( less_or_equal(X0,X2)
| ~ less_or_equal(X1,X2)
| ~ less_or_equal(X0,X1) ),
inference(cnf_transformation,[],[f22]) ).
tcf(c_280,plain,
! [X0: $i] :
( less_or_equal(additive_identity,u)
| ~ less_or_equal(additive_identity,X0)
| ~ less_or_equal(X0,u) ),
inference(instantiation,[status(thm)],[c_91]) ).
tcf(c_285,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( less_or_equal(X2,u)
| ~ less_or_equal(X0,X3)
| ~ sum(X3,X1,u)
| ~ sum(X0,X1,X2) ),
inference(instantiation,[status(thm)],[c_89]) ).
tcf(c_337,plain,
! [X0: $i,X1: $i] :
( less_or_equal(X1,u)
| ~ less_or_equal(X0,a)
| ~ sum(a,a,u)
| ~ sum(X0,a,X1) ),
inference(instantiation,[status(thm)],[c_285]) ).
tcf(c_369,plain,
( less_or_equal(a,u)
| ~ less_or_equal(additive_identity,a)
| ~ sum(additive_identity,a,a)
| ~ sum(a,a,u) ),
inference(instantiation,[status(thm)],[c_337]) ).
tcf(c_370,plain,
( sum(additive_identity,a,a)
| ~ defined(a) ),
inference(instantiation,[status(thm)],[c_86]) ).
tcf(c_588,plain,
( less_or_equal(additive_identity,u)
| ~ less_or_equal(additive_identity,a)
| ~ less_or_equal(a,u) ),
inference(instantiation,[status(thm)],[c_280]) ).
tcf(c_589,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_588,c_370,c_369,c_83,c_84,c_82,c_80]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : FLD059-4 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/10.59 % Computer : n019.cluster.edu
% 0.10/10.59 % Model : x86_64 x86_64
% 0.10/10.59 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/10.59 % Memory : 8046.5625MB
% 0.10/10.59 % OS : Linux 6.8.0-71-generic
% 0.10/10.59 % CPULimit : 300
% 0.10/10.59 % WCLimit : 300
% 0.10/10.59 % DateTime : Fri Sep 25 10:59:15 UTC 2026
% 0.14/10.60 % CPUTime :
% 0.14/10.60 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/10.64 Running first-order theorem proving
% 0.14/10.64 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.14/10.65
% 0.14/10.65 % ======== iProver multi-core TPTP/SMT =========
% 0.14/10.65
% 0.14/10.65 % Detected problem language: tptp
% 0.14/10.66 % Proving...
% 3.72/11.51 % SZS status Started for theBenchmark.p
% 3.72/11.51 % SZS status Unsatisfiable for theBenchmark.p
% 3.72/11.51
% 3.72/11.51 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.72/11.51
% 3.72/11.51 % ------ iProver source info
% 3.72/11.51
% 3.72/11.51 % git: date: 2026-07-19 20:42:38 +0200
% 3.72/11.51 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.72/11.51 % git: non_committed_changes: false
% 3.72/11.51
% 3.72/11.51 % ------ Parsing...% successful
% 3.72/11.51
% 3.72/11.51
% 3.72/11.51 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Option_epr_non_horn_non_eq
% 3.72/11.51 %
% 3.72/11.51
% 3.72/11.51 % ------ Preprocessing... sf_s rm: 5 0s sf_e pe_s pe:1:0s pe_e sf_s rm: 0 0s sf_e pe_s pe_e %
% 3.72/11.51
% 3.72/11.51 % ------ Preprocessing...% ------ preprocesses with Option_epr_non_horn_non_eq
% 3.72/11.51 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.72/11.51 % ------ Proving...
% 3.72/11.51 % ------ Problem Properties
% 3.72/11.51
% 3.72/11.51 %
% 3.72/11.51 % clauses 14
% 3.72/11.51 % conjectures 3
% 3.72/11.51 % EPR 14
% 3.72/11.51 % Horn 13
% 3.72/11.51 % unary 6
% 3.72/11.51 % binary 2
% 3.72/11.51 % lits 32
% 3.72/11.51 % lits eq 0
% 3.72/11.51 % fd_pure 0
% 3.72/11.51 % fd_pseudo 0
% 3.72/11.51 % fd_cond 0
% 3.72/11.51 % fd_pseudo_cond 0
% 3.72/11.51 % AC symbols 0
% 3.72/11.51
% 3.72/11.51 % ------ Schedule EPR non Horn non eq is on
% 3.72/11.51
% 3.72/11.51 % ------ no equalities: superposition off
% 3.72/11.51
% 3.72/11.51 % ------ Input Options "--resolution_flag false" Time Limit: 70.
% 3.72/11.51
% 3.72/11.51
% 3.72/11.51 % ------
% 3.72/11.51 % Current options:
% 3.72/11.51 % ------
% 3.72/11.51
% 3.72/11.51
% 3.72/11.51 %
% 3.72/11.51
% 3.72/11.51 % ------ Proving...
% 3.72/11.51 %
% 3.72/11.51
% 3.72/11.51 % SZS status Unsatisfiable for theBenchmark.p
% 3.72/11.51
% 3.72/11.51 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.72/11.51
% 3.72/11.51
%------------------------------------------------------------------------------