%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : FLD067-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 : n017.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.16s 11.32s
% Output : CNFRefutation 3.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 11
% Syntax : Number of formulae : 33 ( 14 unt; 2 def)
% Number of atoms : 103 ( 12 equ)
% Maximal formula atoms : 4 ( 3 avg)
% Number of connectives : 75 ( 39 ~; 36 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 28 ( 0 sgn 28 !; 0 ?; 20 :)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] :
( ~ defined(X0)
| equalish(add(X0,additive_inverse(X0)),additive_identity) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',existence_of_inverse_addition) ).
fof(f12,axiom,
! [X0] :
( ~ defined(X0)
| defined(additive_inverse(X0)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',well_definedness_of_additive_inverse) ).
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(f28,axiom,
defined(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_is_defined) ).
fof(f30,negated_conjecture,
less_or_equal(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_3) ).
fof(f31,negated_conjecture,
~ less_or_equal(additive_identity,add(b,additive_inverse(a))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_less_or_equal_4) ).
tcf(c_82,plain,
! [X0: $i] :
( equalish(add(X0,additive_inverse(X0)),additive_identity)
| ~ defined(X0) ),
inference(cnf_transformation,[],[f3]) ).
tcf(c_91,plain,
! [X0: $i] :
( defined(additive_inverse(X0))
| ~ defined(X0) ),
inference(cnf_transformation,[],[f12]) ).
tcf(c_98,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_105,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_107,plain,
defined(a),
inference(cnf_transformation,[],[f28]) ).
tcf(c_109,negated_conjecture,
less_or_equal(a,b),
inference(cnf_transformation,[],[f30]) ).
tcf(c_110,negated_conjecture,
~ less_or_equal(additive_identity,add(b,additive_inverse(a))),
inference(cnf_transformation,[],[f31]) ).
tcf(c_283,definition,
iPr_def_10 = additive_inverse(a),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_284,definition,
iPr_def_11 = add(b,iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_285,negated_conjecture,
~ less_or_equal(additive_identity,iPr_def_11),
inference(demodulation,[status(thm)],[c_110,c_283,c_284]) ).
tcf(c_287,plain,
! [X0: $i] : X0 = X0,
theory(equality) ).
tcf(c_291,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( less_or_equal(X0,X2)
| ~ less_or_equal(X1,X3)
| ( X2 != X3 )
| ( X0 != X1 ) ),
theory(equality) ).
tcf(c_299,plain,
additive_identity = additive_identity,
inference(instantiation,[status(thm)],[c_287]) ).
tcf(c_713,plain,
( defined(iPr_def_10)
| ~ defined(a) ),
inference(superposition,[status(thm)],[c_283,c_91]) ).
tcf(c_714,plain,
defined(iPr_def_10),
inference(forward_subsumption_resolution,[status(thm)],[c_713,c_107]) ).
tcf(c_754,plain,
( equalish(add(a,iPr_def_10),additive_identity)
| ~ defined(a) ),
inference(superposition,[status(thm)],[c_283,c_82]) ).
tcf(c_756,plain,
equalish(add(a,iPr_def_10),additive_identity),
inference(forward_subsumption_resolution,[status(thm)],[c_754,c_107]) ).
tcf(c_1017,plain,
! [X0: $i,X1: $i] :
( less_or_equal(additive_identity,iPr_def_11)
| ~ less_or_equal(X0,X1)
| ( iPr_def_11 != X1 )
| ( additive_identity != X0 ) ),
inference(instantiation,[status(thm)],[c_291]) ).
tcf(c_1105,plain,
! [X0: $i] :
( less_or_equal(additive_identity,iPr_def_11)
| ~ less_or_equal(X0,add(b,iPr_def_10))
| ( iPr_def_11 != add(b,iPr_def_10) )
| ( additive_identity != X0 ) ),
inference(instantiation,[status(thm)],[c_1017]) ).
tcf(c_1106,plain,
( less_or_equal(additive_identity,iPr_def_11)
| ~ less_or_equal(additive_identity,add(b,iPr_def_10))
| ( iPr_def_11 != add(b,iPr_def_10) )
| ( additive_identity != additive_identity ) ),
inference(instantiation,[status(thm)],[c_1105]) ).
tcf(c_1322,plain,
! [X0: $i] :
( less_or_equal(add(X0,iPr_def_10),add(b,iPr_def_10))
| ~ defined(iPr_def_10)
| ~ less_or_equal(X0,b) ),
inference(instantiation,[status(thm)],[c_98]) ).
tcf(c_1325,plain,
! [X0: $i,X1: $i] :
( less_or_equal(X1,add(b,iPr_def_10))
| ~ equalish(X0,X1)
| ~ less_or_equal(X0,add(b,iPr_def_10)) ),
inference(instantiation,[status(thm)],[c_105]) ).
tcf(c_2204,plain,
( less_or_equal(add(a,iPr_def_10),add(b,iPr_def_10))
| ~ defined(iPr_def_10)
| ~ less_or_equal(a,b) ),
inference(instantiation,[status(thm)],[c_1322]) ).
tcf(c_3788,plain,
! [X0: $i] :
( less_or_equal(X0,add(b,iPr_def_10))
| ~ equalish(add(a,iPr_def_10),X0)
| ~ less_or_equal(add(a,iPr_def_10),add(b,iPr_def_10)) ),
inference(instantiation,[status(thm)],[c_1325]) ).
tcf(c_3792,plain,
( less_or_equal(additive_identity,add(b,iPr_def_10))
| ~ equalish(add(a,iPr_def_10),additive_identity)
| ~ less_or_equal(add(a,iPr_def_10),add(b,iPr_def_10)) ),
inference(instantiation,[status(thm)],[c_3788]) ).
tcf(c_3793,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_3792,c_2204,c_1106,c_756,c_714,c_285,c_284,c_299,c_109]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : FLD067-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.11/10.40 % Computer : n017.cluster.edu
% 0.11/10.40 % Model : x86_64 x86_64
% 0.11/10.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/10.40 % Memory : 8046.5625MB
% 0.11/10.40 % OS : Linux 6.8.0-71-generic
% 0.11/10.40 % CPULimit : 300
% 0.11/10.40 % WCLimit : 300
% 0.11/10.40 % DateTime : Fri Sep 25 10:57:43 UTC 2026
% 0.11/10.40 % CPUTime :
% 0.11/10.41 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/10.44 Running first-order theorem proving
% 0.11/10.44 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/10.45
% 0.11/10.45 % ======== iProver multi-core TPTP/SMT =========
% 0.11/10.45
% 0.11/10.45 % Detected problem language: tptp
% 0.11/10.47 % Proving...
% 3.16/11.32 % SZS status Started for theBenchmark.p
% 3.16/11.32 % SZS status Unsatisfiable for theBenchmark.p
% 3.16/11.32
% 3.16/11.32 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.16/11.32
% 3.16/11.32 % ------ iProver source info
% 3.16/11.32
% 3.16/11.32 % git: date: 2026-07-19 20:42:38 +0200
% 3.16/11.32 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.16/11.32 % git: non_committed_changes: false
% 3.16/11.32
% 3.16/11.32 % ------ Parsing...% successful
% 3.16/11.32
% 3.16/11.32
% 3.16/11.32 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.16/11.32
% 3.16/11.32 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 3.16/11.32
% 3.16/11.32 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.16/11.32
% 3.16/11.32 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.16/11.32 % ------ Proving...
% 3.16/11.32 % ------ Problem Properties
% 3.16/11.32
% 3.16/11.32 %
% 3.16/11.32 % clauses 33
% 3.16/11.32 % conjectures 2
% 3.16/11.32 % EPR 14
% 3.16/11.32 % Horn 30
% 3.16/11.32 % unary 9
% 3.16/11.32 % binary 6
% 3.16/11.32 % lits 79
% 3.16/11.32 % lits eq 2
% 3.16/11.32 % fd_pure 0
% 3.16/11.32 % fd_pseudo 0
% 3.16/11.32 % fd_cond 0
% 3.16/11.32 % fd_pseudo_cond 0
% 3.16/11.32 % AC symbols 0
% 3.16/11.32
% 3.16/11.32 % ------ Schedule dynamic 5 is on
% 3.16/11.32
% 3.16/11.32 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.16/11.32
% 3.16/11.32
% 3.16/11.32 % ------
% 3.16/11.32 % Current options:
% 3.16/11.32 % ------
% 3.16/11.32
% 3.16/11.32
% 3.16/11.32 %
% 3.16/11.32
% 3.16/11.32 % ------ Proving...
% 3.16/11.32 %
% 3.16/11.32
% 3.16/11.32 % SZS status Unsatisfiable for theBenchmark.p
% 3.16/11.32
% 3.16/11.32 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.16/11.32
% 3.16/11.32
%------------------------------------------------------------------------------