%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : FLD064-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:51 PM UTC 2026
% Result : Unsatisfiable 10.08s 2.30s
% Output : CNFRefutation 10.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 12
% Syntax : Number of formulae : 41 ( 9 unt; 0 def)
% Number of atoms : 93 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 104 ( 52 ~; 52 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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 : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 43 ( 0 sgn 43 !; 0 ?; 27 :)
% 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(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(f11,axiom,
defined(additive_identity),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',well_definedness_of_additive_identity) ).
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(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(f18,axiom,
! [X0,X1] :
( ~ defined(X1)
| ~ defined(X0)
| less_or_equal(X1,X0)
| less_or_equal(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',totality_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(f22,axiom,
! [X0,X1] :
( ~ equalish(X1,X0)
| equalish(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',symmetry_of_equality) ).
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(f29,negated_conjecture,
less_or_equal(additive_identity,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_2) ).
fof(f30,negated_conjecture,
~ less_or_equal(additive_inverse(a),additive_identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_less_or_equal_3) ).
tcf(c_79,plain,
defined(a),
inference(cnf_transformation,[],[f28]) ).
tcf(c_80,negated_conjecture,
less_or_equal(additive_identity,a),
inference(cnf_transformation,[],[f29]) ).
tcf(c_81,negated_conjecture,
~ less_or_equal(additive_inverse(a),additive_identity),
inference(cnf_transformation,[],[f30]) ).
tcf(c_84,plain,
defined(additive_identity),
inference(cnf_transformation,[],[f11]) ).
tcf(c_85,plain,
! [X0: $i] :
( equalish(add(additive_identity,X0),X0)
| ~ defined(X0) ),
inference(cnf_transformation,[],[f2]) ).
tcf(c_86,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_87,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_88,plain,
! [X0: $i,X1: $i] :
( less_or_equal(X1,X0)
| less_or_equal(X0,X1)
| ~ defined(X1)
| ~ defined(X0) ),
inference(cnf_transformation,[],[f18]) ).
tcf(c_89,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_91,plain,
! [X0: $i] :
( defined(additive_inverse(X0))
| ~ defined(X0) ),
inference(cnf_transformation,[],[f12]) ).
tcf(c_92,plain,
! [X0: $i] :
( equalish(add(X0,additive_inverse(X0)),additive_identity)
| ~ defined(X0) ),
inference(cnf_transformation,[],[f3]) ).
tcf(c_94,plain,
! [X0: $i,X1: $i] :
( equalish(X1,X0)
| ~ equalish(X0,X1) ),
inference(cnf_transformation,[],[f22]) ).
tcf(c_111,plain,
( less_or_equal(additive_identity,additive_identity)
| ~ defined(additive_identity) ),
inference(instantiation,[status(thm)],[c_88]) ).
tcf(c_253,plain,
! [X0: $i] :
( less_or_equal(additive_inverse(a),additive_identity)
| ~ less_or_equal(X0,additive_identity)
| ~ equalish(X0,additive_inverse(a)) ),
inference(instantiation,[status(thm)],[c_86]) ).
tcf(c_257,plain,
( less_or_equal(additive_inverse(a),additive_identity)
| ~ less_or_equal(add(additive_identity,additive_inverse(a)),additive_identity)
| ~ equalish(add(additive_identity,additive_inverse(a)),additive_inverse(a)) ),
inference(instantiation,[status(thm)],[c_253]) ).
tcf(c_258,plain,
( equalish(add(additive_identity,additive_inverse(a)),additive_inverse(a))
| ~ defined(additive_inverse(a)) ),
inference(instantiation,[status(thm)],[c_85]) ).
tcf(c_267,plain,
( defined(additive_inverse(a))
| ~ defined(a) ),
inference(instantiation,[status(thm)],[c_91]) ).
tcf(c_311,plain,
! [X0: $i,X1: $i] :
( less_or_equal(add(additive_identity,additive_inverse(a)),X1)
| ~ less_or_equal(X0,X1)
| ~ less_or_equal(add(additive_identity,additive_inverse(a)),X0) ),
inference(instantiation,[status(thm)],[c_89]) ).
tcf(c_313,plain,
! [X0: $i] :
( less_or_equal(add(additive_identity,additive_inverse(a)),add(X0,additive_inverse(a)))
| ~ defined(additive_inverse(a))
| ~ less_or_equal(additive_identity,X0) ),
inference(instantiation,[status(thm)],[c_87]) ).
tcf(c_401,plain,
! [X0: $i,X1: $i] :
( less_or_equal(add(X1,additive_inverse(a)),additive_identity)
| ~ less_or_equal(X0,additive_identity)
| ~ equalish(X0,add(X1,additive_inverse(a))) ),
inference(instantiation,[status(thm)],[c_86]) ).
tcf(c_430,plain,
! [X0: $i,X1: $i] :
( less_or_equal(add(additive_identity,additive_inverse(a)),X1)
| ~ less_or_equal(add(X0,additive_inverse(a)),X1)
| ~ less_or_equal(add(additive_identity,additive_inverse(a)),add(X0,additive_inverse(a))) ),
inference(instantiation,[status(thm)],[c_311]) ).
tcf(c_898,plain,
! [X0: $i,X1: $i] :
( equalish(X1,add(X0,additive_inverse(a)))
| ~ equalish(add(X0,additive_inverse(a)),X1) ),
inference(instantiation,[status(thm)],[c_94]) ).
tcf(c_1562,plain,
( equalish(additive_identity,add(a,additive_inverse(a)))
| ~ equalish(add(a,additive_inverse(a)),additive_identity) ),
inference(instantiation,[status(thm)],[c_898]) ).
tcf(c_1563,plain,
( equalish(add(a,additive_inverse(a)),additive_identity)
| ~ defined(a) ),
inference(instantiation,[status(thm)],[c_92]) ).
tcf(c_3308,plain,
( less_or_equal(add(a,additive_inverse(a)),additive_identity)
| ~ less_or_equal(additive_identity,additive_identity)
| ~ equalish(additive_identity,add(a,additive_inverse(a))) ),
inference(instantiation,[status(thm)],[c_401]) ).
tcf(c_9680,plain,
! [X0: $i] :
( less_or_equal(add(additive_identity,additive_inverse(a)),X0)
| ~ less_or_equal(add(a,additive_inverse(a)),X0)
| ~ less_or_equal(add(additive_identity,additive_inverse(a)),add(a,additive_inverse(a))) ),
inference(instantiation,[status(thm)],[c_430]) ).
tcf(c_9682,plain,
( less_or_equal(add(additive_identity,additive_inverse(a)),additive_identity)
| ~ less_or_equal(add(a,additive_inverse(a)),additive_identity)
| ~ less_or_equal(add(additive_identity,additive_inverse(a)),add(a,additive_inverse(a))) ),
inference(instantiation,[status(thm)],[c_9680]) ).
tcf(c_22475,plain,
( less_or_equal(add(additive_identity,additive_inverse(a)),add(a,additive_inverse(a)))
| ~ less_or_equal(additive_identity,a)
| ~ defined(additive_inverse(a)) ),
inference(instantiation,[status(thm)],[c_313]) ).
tcf(c_22476,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_22475,c_9682,c_3308,c_1563,c_1562,c_267,c_258,c_257,c_111,c_81,c_80,c_79,c_84]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : FLD064-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.12/0.37 % Computer : n017.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Fri Sep 25 10:56:32 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.41 Running first-order theorem proving
% 0.12/0.41 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.12/0.42
% 0.12/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.42
% 0.12/0.42 % Detected problem language: tptp
% 0.12/0.43 % Proving...
% 10.08/2.30 % SZS status Started for theBenchmark.p
% 10.08/2.30 % SZS status Unsatisfiable for theBenchmark.p
% 10.08/2.30
% 10.08/2.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 10.08/2.30
% 10.08/2.30 % ------ iProver source info
% 10.08/2.30
% 10.08/2.30 % git: date: 2026-07-19 20:42:38 +0200
% 10.08/2.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 10.08/2.30 % git: non_committed_changes: false
% 10.08/2.30
% 10.08/2.30 % ------ Parsing...% successful
% 10.08/2.30
% 10.08/2.30
% 10.08/2.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 10.08/2.30
% 10.08/2.30 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 10.08/2.30
% 10.08/2.30 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 10.08/2.30 % ------ Proving...
% 10.08/2.30 % ------ Problem Properties
% 10.08/2.30
% 10.08/2.30 %
% 10.08/2.30 % clauses 25
% 10.08/2.30 % conjectures 2
% 10.08/2.30 % EPR 10
% 10.08/2.30 % Horn 24
% 10.08/2.30 % unary 4
% 10.08/2.30 % binary 5
% 10.08/2.30 % lits 66
% 10.08/2.30 % lits eq 0
% 10.08/2.30 % fd_pure 0
% 10.08/2.30 % fd_pseudo 0
% 10.08/2.30 % fd_cond 0
% 10.08/2.30 % fd_pseudo_cond 0
% 10.08/2.30 % AC symbols 0
% 10.08/2.30
% 10.08/2.30 % ------ Schedule dynamic 5 is on
% 10.08/2.30
% 10.08/2.30 % ------ no equalities: superposition off
% 10.08/2.30
% 10.08/2.30 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 10.08/2.30
% 10.08/2.30
% 10.08/2.30 % ------
% 10.08/2.30 % Current options:
% 10.08/2.30 % ------
% 10.08/2.30
% 10.08/2.30
% 10.08/2.30 %
% 10.08/2.30
% 10.08/2.30 % ------ Proving...
% 10.08/2.30 %
% 10.08/2.30
% 10.08/2.30 % SZS status Unsatisfiable for theBenchmark.p
% 10.08/2.30
% 10.08/2.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 10.08/2.30
% 10.08/2.30
%------------------------------------------------------------------------------