%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : FLD064-3 : 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 : 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:52 PM UTC 2026
% Result : Unsatisfiable 3.50s 1.18s
% Output : CNFRefutation 3.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of formulae : 34 ( 15 unt; 1 def)
% Number of atoms : 83 ( 1 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 63 ( 33 ~; 30 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 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 : 6 ( 4 usr; 2 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 41 ( 0 sgn 41 !; 0 ?; 24 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X3,X0,X1,X4,X5] :
( ~ sum(X4,X5,X2)
| ~ sum(X3,X5,X1)
| ~ sum(X0,X3,X4)
| sum(X0,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',associativity_addition_1) ).
fof(f3,axiom,
! [X0] :
( ~ defined(X0)
| sum(additive_identity,X0,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',existence_of_identity_addition) ).
fof(f4,axiom,
! [X0] :
( ~ defined(X0)
| sum(additive_inverse(X0),X0,additive_identity) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/FLD002-0.ax',commutativity_addition) ).
fof(f15,axiom,
! [X0] :
( ~ defined(X0)
| defined(additive_inverse(X0)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',well_definedness_of_additive_inverse) ).
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/sandbox2/benchmark/Axioms/FLD002-0.ax',compatibility_of_order_relation_and_addition) ).
fof(f27,axiom,
defined(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_is_defined) ).
fof(f28,negated_conjecture,
less_or_equal(additive_identity,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_2) ).
fof(f29,negated_conjecture,
~ less_or_equal(additive_inverse(a),additive_identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_less_or_equal_3) ).
tcf(c_78,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] :
( sum(X0,X4,X5)
| ~ sum(X2,X3,X5)
| ~ sum(X1,X3,X4)
| ~ sum(X0,X1,X2) ),
inference(cnf_transformation,[],[f1]) ).
tcf(c_80,plain,
! [X0: $i] :
( sum(additive_identity,X0,X0)
| ~ defined(X0) ),
inference(cnf_transformation,[],[f3]) ).
tcf(c_81,plain,
! [X0: $i] :
( sum(additive_inverse(X0),X0,additive_identity)
| ~ defined(X0) ),
inference(cnf_transformation,[],[f4]) ).
tcf(c_82,plain,
! [X0: $i,X1: $i,X2: $i] :
( sum(X1,X0,X2)
| ~ sum(X0,X1,X2) ),
inference(cnf_transformation,[],[f5]) ).
tcf(c_92,plain,
! [X0: $i] :
( defined(additive_inverse(X0))
| ~ defined(X0) ),
inference(cnf_transformation,[],[f15]) ).
tcf(c_101,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_104,plain,
defined(a),
inference(cnf_transformation,[],[f27]) ).
tcf(c_105,negated_conjecture,
less_or_equal(additive_identity,a),
inference(cnf_transformation,[],[f28]) ).
tcf(c_106,negated_conjecture,
~ less_or_equal(additive_inverse(a),additive_identity),
inference(cnf_transformation,[],[f29]) ).
tcf(c_277,definition,
iPr_def_10 = additive_inverse(a),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_278,negated_conjecture,
~ less_or_equal(iPr_def_10,additive_identity),
inference(demodulation,[status(thm)],[c_106,c_277]) ).
tcf(c_279,negated_conjecture,
less_or_equal(additive_identity,a),
inference(demodulation,[status(thm)],[c_105]) ).
tcf(c_707,plain,
( defined(iPr_def_10)
| ~ defined(a) ),
inference(superposition,[status(thm)],[c_277,c_92]) ).
tcf(c_708,plain,
defined(iPr_def_10),
inference(forward_subsumption_resolution,[status(thm)],[c_707,c_104]) ).
tcf(c_738,plain,
( sum(iPr_def_10,a,additive_identity)
| ~ defined(a) ),
inference(superposition,[status(thm)],[c_277,c_81]) ).
tcf(c_739,plain,
sum(iPr_def_10,a,additive_identity),
inference(forward_subsumption_resolution,[status(thm)],[c_738,c_104]) ).
tcf(c_751,plain,
sum(a,iPr_def_10,additive_identity),
inference(superposition,[status(thm)],[c_739,c_82]) ).
tcf(c_1268,plain,
! [X0: $i,X1: $i,X2: $i] :
( sum(iPr_def_10,X1,X2)
| ~ sum(additive_identity,X0,X2)
| ~ sum(a,X0,X1) ),
inference(superposition,[status(thm)],[c_739,c_78]) ).
tcf(c_4518,plain,
! [X0: $i,X1: $i] :
( sum(iPr_def_10,X1,X0)
| ~ defined(X0)
| ~ sum(a,X0,X1) ),
inference(superposition,[status(thm)],[c_80,c_1268]) ).
tcf(c_4594,plain,
( sum(iPr_def_10,additive_identity,iPr_def_10)
| ~ defined(iPr_def_10) ),
inference(superposition,[status(thm)],[c_751,c_4518]) ).
tcf(c_4598,plain,
sum(iPr_def_10,additive_identity,iPr_def_10),
inference(forward_subsumption_resolution,[status(thm)],[c_4594,c_708]) ).
tcf(c_4715,plain,
sum(additive_identity,iPr_def_10,iPr_def_10),
inference(superposition,[status(thm)],[c_4598,c_82]) ).
tcf(c_4764,plain,
! [X0: $i,X1: $i] :
( less_or_equal(iPr_def_10,X1)
| ~ less_or_equal(additive_identity,X0)
| ~ sum(X0,iPr_def_10,X1) ),
inference(superposition,[status(thm)],[c_4715,c_101]) ).
tcf(c_6781,plain,
( less_or_equal(iPr_def_10,additive_identity)
| ~ less_or_equal(additive_identity,a) ),
inference(superposition,[status(thm)],[c_751,c_4764]) ).
tcf(c_6788,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_6781,c_278,c_279]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : FLD064-3 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.37 % Computer : n015.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Fri Sep 25 11:04:42 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/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.11/0.43
% 0.11/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.43
% 0.11/0.43 % Detected problem language: tptp
% 0.11/0.44 % Proving...
% 3.50/1.18 % SZS status Started for theBenchmark.p
% 3.50/1.18 % SZS status Unsatisfiable for theBenchmark.p
% 3.50/1.18
% 3.50/1.18 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.50/1.18
% 3.50/1.18 % ------ iProver source info
% 3.50/1.18
% 3.50/1.18 % git: date: 2026-07-19 20:42:38 +0200
% 3.50/1.18 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.50/1.18 % git: non_committed_changes: false
% 3.50/1.18
% 3.50/1.18 % ------ Parsing...% successful
% 3.50/1.18
% 3.50/1.18
% 3.50/1.18 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.50/1.18
% 3.50/1.18 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 3.50/1.18
% 3.50/1.18 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.50/1.18
% 3.50/1.18 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.50/1.18 % ------ Proving...
% 3.50/1.18 % ------ Problem Properties
% 3.50/1.18
% 3.50/1.18 %
% 3.50/1.18 % clauses 30
% 3.50/1.18 % conjectures 2
% 3.50/1.18 % EPR 21
% 3.50/1.18 % Horn 27
% 3.50/1.18 % unary 7
% 3.50/1.18 % binary 6
% 3.50/1.18 % lits 81
% 3.50/1.18 % lits eq 1
% 3.50/1.18 % fd_pure 0
% 3.50/1.18 % fd_pseudo 0
% 3.50/1.18 % fd_cond 0
% 3.50/1.18 % fd_pseudo_cond 0
% 3.50/1.18 % AC symbols 0
% 3.50/1.18
% 3.50/1.18 % ------ Schedule dynamic 5 is on
% 3.50/1.18
% 3.50/1.18 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.50/1.18
% 3.50/1.18
% 3.50/1.18 % ------
% 3.50/1.18 % Current options:
% 3.50/1.18 % ------
% 3.50/1.18
% 3.50/1.18
% 3.50/1.18 %
% 3.50/1.18
% 3.50/1.18 % ------ Proving...
% 3.50/1.18 %
% 3.50/1.18
% 3.50/1.18 % SZS status Unsatisfiable for theBenchmark.p
% 3.50/1.18
% 3.50/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.50/1.18
% 3.50/1.18
%------------------------------------------------------------------------------