%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : FLD067-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 : n015.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 3.16s 1.28s
% Output : CNFRefutation 3.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of formulae : 23 ( 13 unt; 1 def)
% Number of atoms : 52 ( 1 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 42 ( 22 ~; 20 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 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 : 6 ( 4 usr; 2 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 22 ( 0 sgn 22 !; 0 ?; 13 :)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0] :
( ~ defined(X0)
| sum(additive_inverse(X0),X0,additive_identity) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',existence_of_inverse_addition) ).
fof(f5,axiom,
! [X2,X0,X1] :
( ~ sum(X1,X0,X2)
| sum(X0,X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',commutativity_addition) ).
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(f30,negated_conjecture,
less_or_equal(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_4) ).
fof(f31,negated_conjecture,
sum(b,additive_inverse(a),u),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sum_5) ).
fof(f32,negated_conjecture,
~ less_or_equal(additive_identity,u),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_less_or_equal_6) ).
tcf(c_84,plain,
! [X0: $i] :
( sum(additive_inverse(X0),X0,additive_identity)
| ~ defined(X0) ),
inference(cnf_transformation,[],[f4]) ).
tcf(c_85,plain,
! [X0: $i,X1: $i,X2: $i] :
( sum(X1,X0,X2)
| ~ sum(X0,X1,X2) ),
inference(cnf_transformation,[],[f5]) ).
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_107,plain,
defined(a),
inference(cnf_transformation,[],[f27]) ).
tcf(c_110,negated_conjecture,
less_or_equal(a,b),
inference(cnf_transformation,[],[f30]) ).
tcf(c_111,negated_conjecture,
sum(b,additive_inverse(a),u),
inference(cnf_transformation,[],[f31]) ).
tcf(c_112,negated_conjecture,
~ less_or_equal(additive_identity,u),
inference(cnf_transformation,[],[f32]) ).
tcf(c_289,definition,
iPr_def_10 = additive_inverse(a),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_291,negated_conjecture,
sum(b,iPr_def_10,u),
inference(demodulation,[status(thm)],[c_111,c_289]) ).
tcf(c_746,plain,
( sum(iPr_def_10,a,additive_identity)
| ~ defined(a) ),
inference(superposition,[status(thm)],[c_289,c_84]) ).
tcf(c_747,plain,
sum(iPr_def_10,a,additive_identity),
inference(forward_subsumption_resolution,[status(thm)],[c_746,c_107]) ).
tcf(c_755,plain,
sum(a,iPr_def_10,additive_identity),
inference(superposition,[status(thm)],[c_747,c_85]) ).
tcf(c_1133,plain,
! [X0: $i,X1: $i,X2: $i] :
( less_or_equal(additive_identity,u)
| ~ less_or_equal(X0,X2)
| ~ sum(X2,X1,u)
| ~ sum(X0,X1,additive_identity) ),
inference(instantiation,[status(thm)],[c_104]) ).
tcf(c_1413,plain,
! [X0: $i] :
( less_or_equal(additive_identity,u)
| ~ less_or_equal(X0,b)
| ~ sum(b,iPr_def_10,u)
| ~ sum(X0,iPr_def_10,additive_identity) ),
inference(instantiation,[status(thm)],[c_1133]) ).
tcf(c_2643,plain,
( less_or_equal(additive_identity,u)
| ~ less_or_equal(a,b)
| ~ sum(b,iPr_def_10,u)
| ~ sum(a,iPr_def_10,additive_identity) ),
inference(instantiation,[status(thm)],[c_1413]) ).
tcf(c_2644,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_2643,c_755,c_291,c_112,c_110]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : FLD067-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/0.37 % Computer : n015.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Fri Sep 25 11:06:00 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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.10/0.42
% 0.10/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.42
% 0.10/0.42 % Detected problem language: tptp
% 0.10/0.44 % Proving...
% 3.16/1.28 % SZS status Started for theBenchmark.p
% 3.16/1.28 % SZS status Unsatisfiable for theBenchmark.p
% 3.16/1.28
% 3.16/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.16/1.28
% 3.16/1.28 % ------ iProver source info
% 3.16/1.28
% 3.16/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 3.16/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.16/1.28 % git: non_committed_changes: false
% 3.16/1.28
% 3.16/1.28 % ------ Parsing...% successful
% 3.16/1.28
% 3.16/1.28
% 3.16/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.16/1.28
% 3.16/1.28 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 3.16/1.28
% 3.16/1.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.16/1.28
% 3.16/1.28 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.16/1.28 % ------ Proving...
% 3.16/1.28 % ------ Problem Properties
% 3.16/1.28
% 3.16/1.28 %
% 3.16/1.28 % clauses 33
% 3.16/1.28 % conjectures 3
% 3.16/1.28 % EPR 24
% 3.16/1.28 % Horn 30
% 3.16/1.28 % unary 10
% 3.16/1.28 % binary 6
% 3.16/1.28 % lits 84
% 3.16/1.28 % lits eq 1
% 3.16/1.28 % fd_pure 0
% 3.16/1.28 % fd_pseudo 0
% 3.16/1.28 % fd_cond 0
% 3.16/1.28 % fd_pseudo_cond 0
% 3.16/1.28 % AC symbols 0
% 3.16/1.28
% 3.16/1.28 % ------ Schedule dynamic 5 is on
% 3.16/1.28
% 3.16/1.28 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.16/1.28
% 3.16/1.28
% 3.16/1.28 % ------
% 3.16/1.28 % Current options:
% 3.16/1.28 % ------
% 3.16/1.28
% 3.16/1.28
% 3.16/1.28 %
% 3.16/1.28
% 3.16/1.28 % ------ Proving...
% 3.16/1.28 %
% 3.16/1.28
% 3.16/1.28 % SZS status Unsatisfiable for theBenchmark.p
% 3.16/1.28
% 3.16/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.16/1.29
% 3.16/1.29
%------------------------------------------------------------------------------