%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : FLD070-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n020.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:54 PM UTC 2026
% Result : Unsatisfiable 1.41s 1.30s
% Output : CNFRefutation 1.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of formulae : 25 ( 9 unt; 0 def)
% Number of atoms : 54 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 60 ( 31 ~; 29 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 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 : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 26 ( 0 sgn 26 !; 0 ?; 16 :)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0] :
( ~ defined(X0)
| equalish(add(additive_identity,X0),X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',existence_of_identity_addition) ).
fof(f17,axiom,
! [X2,X0,X1] :
( ~ less_or_equal(X2,X1)
| ~ less_or_equal(X0,X2)
| less_or_equal(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',transitivity_of_order_relation) ).
fof(f19,axiom,
! [X2,X0,X1] :
( ~ less_or_equal(X0,X2)
| ~ defined(X1)
| less_or_equal(add(X0,X1),add(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',compatibility_of_order_relation_and_addition) ).
fof(f26,axiom,
! [X2,X0,X1] :
( ~ equalish(X2,X0)
| ~ less_or_equal(X2,X1)
| less_or_equal(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',compatibility_of_equality_and_order_relation) ).
fof(f29,axiom,
defined(b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_is_defined) ).
fof(f30,negated_conjecture,
less_or_equal(additive_identity,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_3) ).
fof(f31,negated_conjecture,
less_or_equal(additive_identity,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_4) ).
fof(f32,negated_conjecture,
~ less_or_equal(additive_identity,add(a,b)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_less_or_equal_5) ).
tcf(c_82,plain,
defined(b),
inference(cnf_transformation,[],[f29]) ).
tcf(c_83,negated_conjecture,
less_or_equal(additive_identity,a),
inference(cnf_transformation,[],[f30]) ).
tcf(c_84,negated_conjecture,
less_or_equal(additive_identity,b),
inference(cnf_transformation,[],[f31]) ).
tcf(c_85,negated_conjecture,
~ less_or_equal(additive_identity,add(a,b)),
inference(cnf_transformation,[],[f32]) ).
tcf(c_89,plain,
! [X0: $i] :
( equalish(add(additive_identity,X0),X0)
| ~ defined(X0) ),
inference(cnf_transformation,[],[f2]) ).
tcf(c_90,plain,
! [X0: $i,X1: $i,X2: $i] :
( less_or_equal(X2,X1)
| ~ equalish(X0,X2)
| ~ less_or_equal(X0,X1) ),
inference(cnf_transformation,[],[f26]) ).
tcf(c_91,plain,
! [X0: $i,X1: $i,X2: $i] :
( less_or_equal(add(X0,X2),add(X1,X2))
| ~ defined(X2)
| ~ less_or_equal(X0,X1) ),
inference(cnf_transformation,[],[f19]) ).
tcf(c_93,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,[],[f17]) ).
tcf(c_251,plain,
! [X0: $i] :
( less_or_equal(additive_identity,add(a,b))
| ~ less_or_equal(additive_identity,X0)
| ~ less_or_equal(X0,add(a,b)) ),
inference(instantiation,[status(thm)],[c_93]) ).
tcf(c_255,plain,
! [X0: $i] :
( less_or_equal(add(X0,b),add(a,b))
| ~ defined(b)
| ~ less_or_equal(X0,a) ),
inference(instantiation,[status(thm)],[c_91]) ).
tcf(c_257,plain,
( less_or_equal(add(additive_identity,b),add(a,b))
| ~ defined(b)
| ~ less_or_equal(additive_identity,a) ),
inference(instantiation,[status(thm)],[c_255]) ).
tcf(c_258,plain,
! [X0: $i,X1: $i] :
( less_or_equal(X1,add(a,b))
| ~ equalish(X0,X1)
| ~ less_or_equal(X0,add(a,b)) ),
inference(instantiation,[status(thm)],[c_90]) ).
tcf(c_284,plain,
! [X0: $i,X1: $i] :
( less_or_equal(X1,add(a,b))
| ~ equalish(add(X0,b),X1)
| ~ less_or_equal(add(X0,b),add(a,b)) ),
inference(instantiation,[status(thm)],[c_258]) ).
tcf(c_306,plain,
( equalish(add(additive_identity,b),b)
| ~ defined(b) ),
inference(instantiation,[status(thm)],[c_89]) ).
tcf(c_359,plain,
( less_or_equal(b,add(a,b))
| ~ equalish(add(additive_identity,b),b)
| ~ less_or_equal(add(additive_identity,b),add(a,b)) ),
inference(instantiation,[status(thm)],[c_284]) ).
tcf(c_537,plain,
( less_or_equal(additive_identity,add(a,b))
| ~ less_or_equal(additive_identity,b)
| ~ less_or_equal(b,add(a,b)) ),
inference(instantiation,[status(thm)],[c_251]) ).
tcf(c_539,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_537,c_359,c_306,c_257,c_85,c_83,c_84,c_82]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : FLD070-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.38 % Computer : n020.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Fri Sep 25 11:04:48 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 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.43
% 0.10/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.43
% 0.10/0.44 % Detected problem language: tptp
% 0.10/0.45 % Proving...
% 1.41/1.30 % SZS status Started for theBenchmark.p
% 1.41/1.30 % SZS status Unsatisfiable for theBenchmark.p
% 1.41/1.30
% 1.41/1.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.41/1.30
% 1.41/1.30 % ------ iProver source info
% 1.41/1.30
% 1.41/1.30 % git: date: 2026-07-19 20:42:38 +0200
% 1.41/1.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.41/1.30 % git: non_committed_changes: false
% 1.41/1.30
% 1.41/1.30 % ------ Parsing...% successful
% 1.41/1.30
% 1.41/1.30
% 1.41/1.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.41/1.30
% 1.41/1.30 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.41/1.30
% 1.41/1.30 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.41/1.30 % ------ Proving...
% 1.41/1.30 % ------ Problem Properties
% 1.41/1.30
% 1.41/1.30 %
% 1.41/1.30 % clauses 25
% 1.41/1.30 % conjectures 3
% 1.41/1.30 % EPR 12
% 1.41/1.30 % Horn 24
% 1.41/1.30 % unary 6
% 1.41/1.30 % binary 3
% 1.41/1.30 % lits 64
% 1.41/1.30 % lits eq 0
% 1.41/1.30 % fd_pure 0
% 1.41/1.30 % fd_pseudo 0
% 1.41/1.30 % fd_cond 0
% 1.41/1.30 % fd_pseudo_cond 0
% 1.41/1.30 % AC symbols 0
% 1.41/1.30
% 1.41/1.30 % ------ Schedule dynamic 5 is on
% 1.41/1.30
% 1.41/1.30 % ------ no equalities: superposition off
% 1.41/1.30
% 1.41/1.30 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.41/1.30
% 1.41/1.30
% 1.41/1.30 % ------
% 1.41/1.30 % Current options:
% 1.41/1.30 % ------
% 1.41/1.30
% 1.41/1.30
% 1.41/1.30 %
% 1.41/1.30
% 1.41/1.30 % ------ Proving...
% 1.41/1.30 %
% 1.41/1.30
% 1.41/1.30 % SZS status Unsatisfiable for theBenchmark.p
% 1.41/1.30
% 1.41/1.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.41/1.30
% 1.41/1.30
%------------------------------------------------------------------------------