%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : FLD061-4 : 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 : n006.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 21.68s 3.82s
% Output : CNFRefutation 21.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of formulae : 38 ( 15 unt; 0 def)
% Number of atoms : 89 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 104 ( 53 ~; 51 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 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-3 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 45 ( 0 sgn 45 !; 0 ?; 32 :)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X2,X0,X1] :
( ~ sum(X1,X0,X2)
| sum(X0,X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',commutativity_addition) ).
fof(f19,axiom,
! [X0,X1] :
( ~ defined(X1)
| ~ defined(X0)
| sum(X0,X1,add(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',totality_of_addition) ).
fof(f22,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/FLD002-0.ax',transitivity_of_order_relation) ).
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/sandbox/benchmark/Axioms/FLD002-0.ax',compatibility_of_order_relation_and_addition) ).
fof(f28,axiom,
defined(b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_is_defined) ).
fof(f29,axiom,
defined(c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_is_defined) ).
fof(f33,negated_conjecture,
less_or_equal(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_7) ).
fof(f34,negated_conjecture,
less_or_equal(c,d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_8) ).
fof(f35,negated_conjecture,
sum(a,c,u),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sum_9) ).
fof(f36,negated_conjecture,
sum(d,b,v),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sum_10) ).
fof(f37,negated_conjecture,
~ less_or_equal(u,v),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_less_or_equal_11) ).
tcf(c_90,plain,
! [X0: $i,X1: $i,X2: $i] :
( sum(X1,X0,X2)
| ~ sum(X0,X1,X2) ),
inference(cnf_transformation,[],[f5]) ).
tcf(c_104,plain,
! [X0: $i,X1: $i] :
( sum(X0,X1,add(X0,X1))
| ~ defined(X1)
| ~ defined(X0) ),
inference(cnf_transformation,[],[f19]) ).
tcf(c_107,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,[],[f22]) ).
tcf(c_109,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_113,plain,
defined(b),
inference(cnf_transformation,[],[f28]) ).
tcf(c_114,plain,
defined(c),
inference(cnf_transformation,[],[f29]) ).
tcf(c_118,negated_conjecture,
less_or_equal(a,b),
inference(cnf_transformation,[],[f33]) ).
tcf(c_119,negated_conjecture,
less_or_equal(c,d),
inference(cnf_transformation,[],[f34]) ).
tcf(c_120,negated_conjecture,
sum(a,c,u),
inference(cnf_transformation,[],[f35]) ).
tcf(c_121,negated_conjecture,
sum(d,b,v),
inference(cnf_transformation,[],[f36]) ).
tcf(c_122,negated_conjecture,
~ less_or_equal(u,v),
inference(cnf_transformation,[],[f37]) ).
tcf(c_316,plain,
! [X0: $i] :
( less_or_equal(u,v)
| ~ less_or_equal(u,X0)
| ~ less_or_equal(X0,v) ),
inference(instantiation,[status(thm)],[c_107]) ).
tcf(c_338,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( less_or_equal(X2,v)
| ~ less_or_equal(X0,X3)
| ~ sum(X3,X1,v)
| ~ sum(X0,X1,X2) ),
inference(instantiation,[status(thm)],[c_109]) ).
tcf(c_466,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( less_or_equal(u,X2)
| ~ less_or_equal(X3,X0)
| ~ sum(X3,X1,u)
| ~ sum(X0,X1,X2) ),
inference(instantiation,[status(thm)],[c_109]) ).
tcf(c_562,plain,
! [X0: $i,X1: $i] :
( less_or_equal(X1,v)
| ~ less_or_equal(X0,d)
| ~ sum(d,b,v)
| ~ sum(X0,b,X1) ),
inference(instantiation,[status(thm)],[c_338]) ).
tcf(c_1871,plain,
! [X0: $i,X1: $i] :
( sum(X0,b,X1)
| ~ sum(b,X0,X1) ),
inference(instantiation,[status(thm)],[c_90]) ).
tcf(c_2851,plain,
! [X0: $i] :
( less_or_equal(X0,v)
| ~ less_or_equal(c,d)
| ~ sum(d,b,v)
| ~ sum(c,b,X0) ),
inference(instantiation,[status(thm)],[c_562]) ).
tcf(c_10303,plain,
! [X0: $i,X1: $i] :
( less_or_equal(u,X1)
| ~ less_or_equal(a,X0)
| ~ sum(a,c,u)
| ~ sum(X0,c,X1) ),
inference(instantiation,[status(thm)],[c_466]) ).
tcf(c_12399,plain,
! [X0: $i] :
( sum(X0,b,add(b,X0))
| ~ sum(b,X0,add(b,X0)) ),
inference(instantiation,[status(thm)],[c_1871]) ).
tcf(c_12400,plain,
! [X0: $i] :
( sum(b,X0,add(b,X0))
| ~ defined(b)
| ~ defined(X0) ),
inference(instantiation,[status(thm)],[c_104]) ).
tcf(c_20653,plain,
! [X0: $i] :
( less_or_equal(u,X0)
| ~ less_or_equal(a,b)
| ~ sum(a,c,u)
| ~ sum(b,c,X0) ),
inference(instantiation,[status(thm)],[c_10303]) ).
tcf(c_30201,plain,
( sum(b,c,add(b,c))
| ~ defined(c)
| ~ defined(b) ),
inference(instantiation,[status(thm)],[c_12400]) ).
tcf(c_30551,plain,
( less_or_equal(add(b,c),v)
| ~ less_or_equal(c,d)
| ~ sum(d,b,v)
| ~ sum(c,b,add(b,c)) ),
inference(instantiation,[status(thm)],[c_2851]) ).
tcf(c_30552,plain,
( sum(c,b,add(b,c))
| ~ sum(b,c,add(b,c)) ),
inference(instantiation,[status(thm)],[c_12399]) ).
tcf(c_40825,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_316]) ).
tcf(c_51652,plain,
( less_or_equal(u,add(b,c))
| ~ less_or_equal(a,b)
| ~ sum(a,c,u)
| ~ sum(b,c,add(b,c)) ),
inference(instantiation,[status(thm)],[c_20653]) ).
tcf(c_51653,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_51652,c_40825,c_30552,c_30551,c_30201,c_120,c_121,c_122,c_118,c_119,c_113,c_114]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : FLD061-4 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/0.35 % Computer : n006.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Fri Sep 25 11:00:32 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/0.39 Running first-order theorem proving
% 0.13/0.39 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.13/0.40
% 0.13/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.40
% 0.13/0.40 % Detected problem language: tptp
% 0.13/0.41 % Proving...
% 21.68/3.82 % SZS status Started for theBenchmark.p
% 21.68/3.82 % SZS status Unsatisfiable for theBenchmark.p
% 21.68/3.82
% 21.68/3.82 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 21.68/3.82
% 21.68/3.82 % ------ iProver source info
% 21.68/3.82
% 21.68/3.82 % git: date: 2026-07-19 20:42:38 +0200
% 21.68/3.82 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 21.68/3.82 % git: non_committed_changes: false
% 21.68/3.82
% 21.68/3.82 % ------ Parsing...% successful
% 21.68/3.82
% 21.68/3.82
% 21.68/3.82 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 21.68/3.82
% 21.68/3.82 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 21.68/3.82
% 21.68/3.82 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 21.68/3.82 % ------ Proving...
% 21.68/3.82 % ------ Problem Properties
% 21.68/3.82
% 21.68/3.82 %
% 21.68/3.82 % clauses 37
% 21.68/3.82 % conjectures 5
% 21.68/3.82 % EPR 29
% 21.68/3.82 % Horn 34
% 21.68/3.82 % unary 14
% 21.68/3.82 % binary 6
% 21.68/3.82 % lits 88
% 21.68/3.82 % lits eq 0
% 21.68/3.82 % fd_pure 0
% 21.68/3.82 % fd_pseudo 0
% 21.68/3.83 % fd_cond 0
% 21.68/3.83 % fd_pseudo_cond 0
% 21.68/3.83 % AC symbols 0
% 21.68/3.83
% 21.68/3.83 % ------ Schedule dynamic 5 is on
% 21.68/3.83
% 21.68/3.83 % ------ no equalities: superposition off
% 21.68/3.83
% 21.68/3.83 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 21.68/3.83
% 21.68/3.83
% 21.68/3.83 % ------
% 21.68/3.83 % Current options:
% 21.68/3.83 % ------
% 21.68/3.83
% 21.68/3.83
% 21.68/3.83 %
% 21.68/3.83
% 21.68/3.83 % ------ Proving...
% 21.68/3.83 %
% 21.68/3.83
% 21.68/3.83 % SZS status Unsatisfiable for theBenchmark.p
% 21.68/3.83
% 21.68/3.83 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 21.68/3.83
% 21.68/3.83
%------------------------------------------------------------------------------