%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : FLD067-2 : 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 : n001.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 4.68s 1.40s
% Output : CNFRefutation 4.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 12
% Syntax : Number of formulae : 43 ( 11 unt; 0 def)
% Number of atoms : 99 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 111 ( 55 ~; 56 |; 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 : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 42 ( 0 sgn 42 !; 0 ?; 27 :)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] :
( ~ defined(X0)
| equalish(add(X0,additive_inverse(X0)),additive_identity) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',existence_of_inverse_addition) ).
fof(f12,axiom,
! [X0] :
( ~ defined(X0)
| defined(additive_inverse(X0)) ),
file('/export/starexec/sandbox/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/sandbox/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/sandbox/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/sandbox/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/sandbox/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/sandbox/benchmark/Axioms/FLD001-0.ax',compatibility_of_equality_and_order_relation) ).
fof(f28,axiom,
defined(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_is_defined) ).
fof(f30,axiom,
defined(u),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',u_is_defined) ).
fof(f31,negated_conjecture,
less_or_equal(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_4) ).
fof(f32,negated_conjecture,
equalish(add(b,additive_inverse(a)),u),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',add_equals_u_5) ).
fof(f33,negated_conjecture,
~ less_or_equal(additive_identity,u),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_less_or_equal_6) ).
tcf(c_82,plain,
defined(a),
inference(cnf_transformation,[],[f28]) ).
tcf(c_84,plain,
defined(u),
inference(cnf_transformation,[],[f30]) ).
tcf(c_85,negated_conjecture,
less_or_equal(a,b),
inference(cnf_transformation,[],[f31]) ).
tcf(c_86,negated_conjecture,
equalish(add(b,additive_inverse(a)),u),
inference(cnf_transformation,[],[f32]) ).
tcf(c_87,negated_conjecture,
~ less_or_equal(additive_identity,u),
inference(cnf_transformation,[],[f33]) ).
tcf(c_89,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_92,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_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_102,plain,
! [X0: $i,X1: $i] :
( equalish(X1,X0)
| ~ equalish(X0,X1) ),
inference(cnf_transformation,[],[f22]) ).
tcf(c_103,plain,
! [X0: $i] :
( defined(additive_inverse(X0))
| ~ defined(X0) ),
inference(cnf_transformation,[],[f12]) ).
tcf(c_104,plain,
! [X0: $i] :
( equalish(add(X0,additive_inverse(X0)),additive_identity)
| ~ defined(X0) ),
inference(cnf_transformation,[],[f3]) ).
tcf(c_265,plain,
! [X0: $i] :
( less_or_equal(additive_identity,u)
| ~ equalish(X0,additive_identity)
| ~ less_or_equal(X0,u) ),
inference(instantiation,[status(thm)],[c_89]) ).
tcf(c_268,plain,
! [X0: $i] :
( less_or_equal(u,X0)
| less_or_equal(X0,u)
| ~ defined(u)
| ~ defined(X0) ),
inference(instantiation,[status(thm)],[c_92]) ).
tcf(c_269,plain,
! [X0: $i,X1: $i] :
( less_or_equal(X0,u)
| ~ less_or_equal(X1,u)
| ~ less_or_equal(X0,X1) ),
inference(instantiation,[status(thm)],[c_93]) ).
tcf(c_270,plain,
! [X0: $i,X1: $i] :
( less_or_equal(X1,u)
| ~ less_or_equal(X0,u)
| ~ equalish(X0,X1) ),
inference(instantiation,[status(thm)],[c_89]) ).
tcf(c_274,plain,
( less_or_equal(u,u)
| ~ defined(u) ),
inference(instantiation,[status(thm)],[c_268]) ).
tcf(c_286,plain,
! [X0: $i] :
( less_or_equal(X0,u)
| ~ less_or_equal(u,u)
| ~ equalish(u,X0) ),
inference(instantiation,[status(thm)],[c_270]) ).
tcf(c_298,plain,
! [X0: $i] :
( equalish(u,X0)
| ~ equalish(X0,u) ),
inference(instantiation,[status(thm)],[c_102]) ).
tcf(c_314,plain,
( equalish(u,add(b,additive_inverse(a)))
| ~ equalish(add(b,additive_inverse(a)),u) ),
inference(instantiation,[status(thm)],[c_298]) ).
tcf(c_336,plain,
( less_or_equal(add(b,additive_inverse(a)),u)
| ~ less_or_equal(u,u)
| ~ equalish(u,add(b,additive_inverse(a))) ),
inference(instantiation,[status(thm)],[c_286]) ).
tcf(c_402,plain,
! [X0: $i] :
( less_or_equal(X0,u)
| ~ less_or_equal(add(b,additive_inverse(a)),u)
| ~ less_or_equal(X0,add(b,additive_inverse(a))) ),
inference(instantiation,[status(thm)],[c_269]) ).
tcf(c_461,plain,
( defined(additive_inverse(a))
| ~ defined(a) ),
inference(instantiation,[status(thm)],[c_103]) ).
tcf(c_575,plain,
! [X0: $i] :
( less_or_equal(add(X0,additive_inverse(a)),u)
| ~ less_or_equal(add(b,additive_inverse(a)),u)
| ~ less_or_equal(add(X0,additive_inverse(a)),add(b,additive_inverse(a))) ),
inference(instantiation,[status(thm)],[c_402]) ).
tcf(c_576,plain,
! [X0: $i] :
( less_or_equal(add(X0,additive_inverse(a)),add(b,additive_inverse(a)))
| ~ defined(additive_inverse(a))
| ~ less_or_equal(X0,b) ),
inference(instantiation,[status(thm)],[c_91]) ).
tcf(c_1358,plain,
! [X0: $i] :
( less_or_equal(additive_identity,u)
| ~ equalish(add(X0,additive_inverse(a)),additive_identity)
| ~ less_or_equal(add(X0,additive_inverse(a)),u) ),
inference(instantiation,[status(thm)],[c_265]) ).
tcf(c_2086,plain,
( less_or_equal(additive_identity,u)
| ~ equalish(add(a,additive_inverse(a)),additive_identity)
| ~ less_or_equal(add(a,additive_inverse(a)),u) ),
inference(instantiation,[status(thm)],[c_1358]) ).
tcf(c_2087,plain,
( equalish(add(a,additive_inverse(a)),additive_identity)
| ~ defined(a) ),
inference(instantiation,[status(thm)],[c_104]) ).
tcf(c_3065,plain,
( less_or_equal(add(a,additive_inverse(a)),add(b,additive_inverse(a)))
| ~ less_or_equal(a,b)
| ~ defined(additive_inverse(a)) ),
inference(instantiation,[status(thm)],[c_576]) ).
tcf(c_4463,plain,
( less_or_equal(add(a,additive_inverse(a)),u)
| ~ less_or_equal(add(b,additive_inverse(a)),u)
| ~ less_or_equal(add(a,additive_inverse(a)),add(b,additive_inverse(a))) ),
inference(instantiation,[status(thm)],[c_575]) ).
tcf(c_4466,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_4463,c_3065,c_2087,c_2086,c_461,c_336,c_314,c_274,c_86,c_87,c_85,c_82,c_84]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : FLD067-2 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.07 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.16/0.43 % Computer : n001.cluster.edu
% 0.16/0.43 % Model : x86_64 x86_64
% 0.16/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.43 % Memory : 8046.5625MB
% 0.16/0.43 % OS : Linux 6.8.0-71-generic
% 0.16/0.43 % CPULimit : 300
% 0.16/0.43 % WCLimit : 300
% 0.16/0.43 % DateTime : Fri Sep 25 11:07:55 UTC 2026
% 0.16/0.44 % CPUTime :
% 0.16/0.44 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.20/0.49 Running first-order theorem proving
% 0.20/0.49 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.20/0.51
% 0.20/0.51 % ======== iProver multi-core TPTP/SMT =========
% 0.20/0.51
% 0.20/0.51 % Detected problem language: tptp
% 0.20/0.52 % Proving...
% 4.68/1.40 % SZS status Started for theBenchmark.p
% 4.68/1.40 % SZS status Unsatisfiable for theBenchmark.p
% 4.68/1.40
% 4.68/1.40 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.68/1.40
% 4.68/1.40 % ------ iProver source info
% 4.68/1.40
% 4.68/1.40 % git: date: 2026-07-19 20:42:38 +0200
% 4.68/1.40 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.68/1.40 % git: non_committed_changes: false
% 4.68/1.40
% 4.68/1.40 % ------ Parsing...% successful
% 4.68/1.40
% 4.68/1.40
% 4.68/1.40 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.68/1.40
% 4.68/1.40 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 4.68/1.40
% 4.68/1.40 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.68/1.40 % ------ Proving...
% 4.68/1.40 % ------ Problem Properties
% 4.68/1.40
% 4.68/1.40 %
% 4.68/1.40 % clauses 28
% 4.68/1.40 % conjectures 3
% 4.68/1.40 % EPR 13
% 4.68/1.40 % Horn 27
% 4.68/1.40 % unary 7
% 4.68/1.40 % binary 5
% 4.68/1.40 % lits 69
% 4.68/1.40 % lits eq 0
% 4.68/1.40 % fd_pure 0
% 4.68/1.40 % fd_pseudo 0
% 4.68/1.40 % fd_cond 0
% 4.68/1.40 % fd_pseudo_cond 0
% 4.68/1.40 % AC symbols 0
% 4.68/1.40
% 4.68/1.40 % ------ Schedule dynamic 5 is on
% 4.68/1.40
% 4.68/1.40 % ------ no equalities: superposition off
% 4.68/1.40
% 4.68/1.40 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.68/1.40
% 4.68/1.40
% 4.68/1.40 % ------
% 4.68/1.40 % Current options:
% 4.68/1.40 % ------
% 4.68/1.40
% 4.68/1.40
% 4.68/1.40 %
% 4.68/1.40
% 4.68/1.40 % ------ Proving...
% 4.68/1.40 %
% 4.68/1.40
% 4.68/1.40 % SZS status Unsatisfiable for theBenchmark.p
% 4.68/1.40
% 4.68/1.40 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.68/1.41
% 4.68/1.41
%------------------------------------------------------------------------------