%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : FLD061-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 : n007.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 64.23s 11.64s
% Output : CNFRefutation 64.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 14
% Syntax : Number of formulae : 52 ( 18 unt; 0 def)
% Number of atoms : 120 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 135 ( 67 ~; 68 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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 : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 47 ( 0 sgn 47 !; 0 ?; 32 :)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0,X1] :
( ~ defined(X1)
| ~ defined(X0)
| equalish(add(X0,X1),add(X1,X0)) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',commutativity_addition) ).
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(f29,axiom,
defined(b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_is_defined) ).
fof(f30,axiom,
defined(c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_is_defined) ).
fof(f33,axiom,
defined(v),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',v_is_defined) ).
fof(f34,negated_conjecture,
equalish(add(a,c),u),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',add_equals_u_7) ).
fof(f35,negated_conjecture,
equalish(add(d,b),v),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',add_equals_v_8) ).
fof(f36,negated_conjecture,
less_or_equal(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_9) ).
fof(f37,negated_conjecture,
less_or_equal(c,d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_10) ).
fof(f38,negated_conjecture,
~ less_or_equal(u,v),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_less_or_equal_11) ).
tcf(c_88,plain,
defined(b),
inference(cnf_transformation,[],[f29]) ).
tcf(c_89,plain,
defined(c),
inference(cnf_transformation,[],[f30]) ).
tcf(c_92,plain,
defined(v),
inference(cnf_transformation,[],[f33]) ).
tcf(c_93,negated_conjecture,
equalish(add(a,c),u),
inference(cnf_transformation,[],[f34]) ).
tcf(c_94,negated_conjecture,
equalish(add(d,b),v),
inference(cnf_transformation,[],[f35]) ).
tcf(c_95,negated_conjecture,
less_or_equal(a,b),
inference(cnf_transformation,[],[f36]) ).
tcf(c_96,negated_conjecture,
less_or_equal(c,d),
inference(cnf_transformation,[],[f37]) ).
tcf(c_97,negated_conjecture,
~ less_or_equal(u,v),
inference(cnf_transformation,[],[f38]) ).
tcf(c_100,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_103,plain,
! [X0: $i,X1: $i] :
( equalish(add(X0,X1),add(X1,X0))
| ~ defined(X1)
| ~ defined(X0) ),
inference(cnf_transformation,[],[f4]) ).
tcf(c_107,plain,
! [X0: $i,X1: $i] :
( equalish(X1,X0)
| ~ equalish(X0,X1) ),
inference(cnf_transformation,[],[f22]) ).
tcf(c_108,plain,
! [X0: $i,X1: $i,X2: $i] :
( less_or_equal(X1,X2)
| ~ less_or_equal(X0,X2)
| ~ equalish(X0,X1) ),
inference(cnf_transformation,[],[f26]) ).
tcf(c_110,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_111,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_276,plain,
! [X0: $i] :
( less_or_equal(u,v)
| ~ less_or_equal(u,X0)
| ~ less_or_equal(X0,v) ),
inference(instantiation,[status(thm)],[c_111]) ).
tcf(c_287,plain,
! [X0: $i] :
( less_or_equal(v,X0)
| less_or_equal(X0,v)
| ~ defined(v)
| ~ defined(X0) ),
inference(instantiation,[status(thm)],[c_110]) ).
tcf(c_290,plain,
! [X0: $i,X1: $i] :
( less_or_equal(X1,v)
| ~ less_or_equal(X0,v)
| ~ equalish(X0,X1) ),
inference(instantiation,[status(thm)],[c_108]) ).
tcf(c_314,plain,
! [X0: $i,X1: $i] :
( less_or_equal(u,X1)
| ~ equalish(X0,u)
| ~ less_or_equal(X0,X1) ),
inference(instantiation,[status(thm)],[c_108]) ).
tcf(c_360,plain,
! [X0: $i] :
( less_or_equal(add(a,c),add(X0,c))
| ~ defined(c)
| ~ less_or_equal(a,X0) ),
inference(instantiation,[status(thm)],[c_100]) ).
tcf(c_380,plain,
! [X0: $i] :
( less_or_equal(u,X0)
| ~ equalish(add(a,c),u)
| ~ less_or_equal(add(a,c),X0) ),
inference(instantiation,[status(thm)],[c_314]) ).
tcf(c_588,plain,
( less_or_equal(v,v)
| ~ defined(v) ),
inference(instantiation,[status(thm)],[c_287]) ).
tcf(c_589,plain,
! [X0: $i] :
( less_or_equal(X0,v)
| ~ less_or_equal(v,v)
| ~ equalish(v,X0) ),
inference(instantiation,[status(thm)],[c_290]) ).
tcf(c_592,plain,
( less_or_equal(add(a,c),add(b,c))
| ~ defined(c)
| ~ less_or_equal(a,b) ),
inference(instantiation,[status(thm)],[c_360]) ).
tcf(c_724,plain,
equalish(v,add(d,b)),
inference(superposition,[status(thm)],[c_94,c_107]) ).
tcf(c_1562,plain,
( less_or_equal(u,add(b,c))
| ~ equalish(add(a,c),u)
| ~ less_or_equal(add(a,c),add(b,c)) ),
inference(instantiation,[status(thm)],[c_380]) ).
tcf(c_2507,plain,
! [X0: $i,X1: $i] :
( less_or_equal(add(X1,c),v)
| ~ less_or_equal(X0,v)
| ~ equalish(X0,add(X1,c)) ),
inference(instantiation,[status(thm)],[c_290]) ).
tcf(c_2862,plain,
( less_or_equal(u,v)
| ~ less_or_equal(u,add(b,c))
| ~ less_or_equal(add(b,c),v) ),
inference(instantiation,[status(thm)],[c_276]) ).
tcf(c_3858,plain,
! [X0: $i] :
( less_or_equal(add(X0,c),v)
| ~ less_or_equal(add(c,X0),v)
| ~ equalish(add(c,X0),add(X0,c)) ),
inference(instantiation,[status(thm)],[c_2507]) ).
tcf(c_3859,plain,
! [X0: $i] :
( equalish(add(c,X0),add(X0,c))
| ~ defined(c)
| ~ defined(X0) ),
inference(instantiation,[status(thm)],[c_103]) ).
tcf(c_7313,plain,
( less_or_equal(add(d,b),v)
| ~ less_or_equal(v,v)
| ~ equalish(v,add(d,b)) ),
inference(instantiation,[status(thm)],[c_589]) ).
tcf(c_21681,plain,
( equalish(add(c,b),add(b,c))
| ~ defined(c)
| ~ defined(b) ),
inference(instantiation,[status(thm)],[c_3859]) ).
tcf(c_26801,plain,
( less_or_equal(add(b,c),v)
| ~ less_or_equal(add(c,b),v)
| ~ equalish(add(c,b),add(b,c)) ),
inference(instantiation,[status(thm)],[c_3858]) ).
tcf(c_326947,plain,
! [X0: $i,X1: $i] :
( less_or_equal(X0,v)
| ~ less_or_equal(X1,v)
| ~ less_or_equal(X0,X1) ),
inference(instantiation,[status(thm)],[c_111]) ).
tcf(c_327115,plain,
! [X0: $i] :
( less_or_equal(X0,v)
| ~ less_or_equal(add(d,b),v)
| ~ less_or_equal(X0,add(d,b)) ),
inference(instantiation,[status(thm)],[c_326947]) ).
tcf(c_327583,plain,
! [X0: $i] :
( less_or_equal(add(X0,b),add(d,b))
| ~ defined(b)
| ~ less_or_equal(X0,d) ),
inference(instantiation,[status(thm)],[c_100]) ).
tcf(c_329008,plain,
( less_or_equal(add(c,b),add(d,b))
| ~ defined(b)
| ~ less_or_equal(c,d) ),
inference(instantiation,[status(thm)],[c_327583]) ).
tcf(c_330854,plain,
( less_or_equal(add(c,b),v)
| ~ less_or_equal(add(d,b),v)
| ~ less_or_equal(add(c,b),add(d,b)) ),
inference(instantiation,[status(thm)],[c_327115]) ).
tcf(c_330856,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_330854,c_329008,c_26801,c_21681,c_7313,c_2862,c_1562,c_724,c_592,c_588,c_93,c_97,c_95,c_96,c_88,c_89,c_92]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : FLD061-2 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.06 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.16/0.42 % Computer : n007.cluster.edu
% 0.16/0.42 % Model : x86_64 x86_64
% 0.16/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.42 % Memory : 8046.5625MB
% 0.16/0.42 % OS : Linux 6.8.0-71-generic
% 0.16/0.42 % CPULimit : 300
% 0.16/0.42 % WCLimit : 300
% 0.16/0.42 % DateTime : Fri Sep 25 10:58:08 UTC 2026
% 0.16/0.42 % CPUTime :
% 0.16/0.42 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.16/0.48 Running first-order theorem proving
% 0.16/0.48 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.24/0.50
% 0.24/0.50 % ======== iProver multi-core TPTP/SMT =========
% 0.24/0.50
% 0.24/0.50 % Detected problem language: tptp
% 0.24/0.52 % Proving...
% 64.23/11.64 % SZS status Started for theBenchmark.p
% 64.23/11.64 % SZS status Unsatisfiable for theBenchmark.p
% 64.23/11.64
% 64.23/11.64 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 64.23/11.64
% 64.23/11.64 % ------ iProver source info
% 64.23/11.64
% 64.23/11.64 % git: date: 2026-07-19 20:42:38 +0200
% 64.23/11.64 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 64.23/11.64 % git: non_committed_changes: false
% 64.23/11.64
% 64.23/11.64 % ------ Parsing...% successful
% 64.23/11.64
% 64.23/11.64
% 64.23/11.64 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 64.23/11.64
% 64.23/11.64 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 64.23/11.64
% 64.23/11.64 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 64.23/11.64 % ------ Proving...
% 64.23/11.64 % ------ Problem Properties
% 64.23/11.64
% 64.23/11.64 %
% 64.23/11.64 % clauses 31
% 64.23/11.64 % conjectures 5
% 64.23/11.64 % EPR 17
% 64.23/11.64 % Horn 30
% 64.23/11.64 % unary 12
% 64.23/11.64 % binary 3
% 64.23/11.64 % lits 70
% 64.23/11.64 % lits eq 0
% 64.23/11.64 % fd_pure 0
% 64.23/11.64 % fd_pseudo 0
% 64.23/11.64 % fd_cond 0
% 64.23/11.64 % fd_pseudo_cond 0
% 64.23/11.64 % AC symbols 0
% 64.23/11.64
% 64.23/11.64 % ------ Schedule dynamic 5 is on
% 64.23/11.64
% 64.23/11.64 % ------ no equalities: superposition off
% 64.23/11.64
% 64.23/11.64 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 64.23/11.64
% 64.23/11.64
% 64.23/11.64 % ------
% 64.23/11.64 % Current options:
% 64.23/11.64 % ------
% 64.23/11.64
% 64.23/11.64
% 64.23/11.64 %
% 64.23/11.64
% 64.23/11.64 % ------ Proving...
% 64.23/11.64 % Proof_search_loop: time out after: 21882 full_loop iterations
% 64.23/11.64
% 64.23/11.64 % ------ Input Options"1. --res_lit_sel adaptive --res_lit_sel_side num_symb" Time Limit: 15.
% 64.23/11.64
% 64.23/11.64
% 64.23/11.64 % ------
% 64.23/11.64 % Current options:
% 64.23/11.64 % ------
% 64.23/11.64
% 64.23/11.64
% 64.23/11.64 %
% 64.23/11.64
% 64.23/11.64 % ------ Proving...
% 64.23/11.64 %
% 64.23/11.64
% 64.23/11.64 % SZS status Unsatisfiable for theBenchmark.p
% 64.23/11.64
% 64.23/11.64 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 64.23/11.64
% 64.23/11.64
%------------------------------------------------------------------------------