%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : FLD060-4 : 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 : n010.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:50 PM UTC 2026
% Result : Unsatisfiable 12.07s 2.68s
% Output : CNFRefutation 12.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of formulae : 37 ( 13 unt; 0 def)
% Number of atoms : 90 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 108 ( 55 ~; 53 |; 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 : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 47 ( 0 sgn 47 !; 0 ?; 34 :)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X2,X0,X1] :
( ~ sum(X1,X0,X2)
| sum(X0,X1,X2) ),
file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/benchmark/Axioms/FLD002-0.ax',compatibility_of_order_relation_and_addition) ).
fof(f27,axiom,
defined(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_is_defined) ).
fof(f28,axiom,
defined(b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_is_defined) ).
fof(f31,negated_conjecture,
less_or_equal(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_5) ).
fof(f32,negated_conjecture,
sum(a,a,u),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sum_6) ).
fof(f33,negated_conjecture,
sum(b,b,v),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sum_7) ).
fof(f34,negated_conjecture,
~ less_or_equal(u,v),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_less_or_equal_8) ).
tcf(c_87,plain,
! [X0: $i,X1: $i,X2: $i] :
( sum(X1,X0,X2)
| ~ sum(X0,X1,X2) ),
inference(cnf_transformation,[],[f5]) ).
tcf(c_101,plain,
! [X0: $i,X1: $i] :
( sum(X0,X1,add(X0,X1))
| ~ defined(X1)
| ~ defined(X0) ),
inference(cnf_transformation,[],[f19]) ).
tcf(c_104,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_106,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_109,plain,
defined(a),
inference(cnf_transformation,[],[f27]) ).
tcf(c_110,plain,
defined(b),
inference(cnf_transformation,[],[f28]) ).
tcf(c_113,negated_conjecture,
less_or_equal(a,b),
inference(cnf_transformation,[],[f31]) ).
tcf(c_114,negated_conjecture,
sum(a,a,u),
inference(cnf_transformation,[],[f32]) ).
tcf(c_115,negated_conjecture,
sum(b,b,v),
inference(cnf_transformation,[],[f33]) ).
tcf(c_116,negated_conjecture,
~ less_or_equal(u,v),
inference(cnf_transformation,[],[f34]) ).
tcf(c_298,plain,
! [X0: $i] :
( less_or_equal(u,v)
| ~ less_or_equal(u,X0)
| ~ less_or_equal(X0,v) ),
inference(instantiation,[status(thm)],[c_104]) ).
tcf(c_305,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_106]) ).
tcf(c_337,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_106]) ).
tcf(c_355,plain,
! [X0: $i,X1: $i] :
( less_or_equal(u,X1)
| ~ less_or_equal(a,X0)
| ~ sum(a,a,u)
| ~ sum(X0,a,X1) ),
inference(instantiation,[status(thm)],[c_305]) ).
tcf(c_570,plain,
! [X0: $i,X1: $i] :
( sum(X0,b,X1)
| ~ sum(b,X0,X1) ),
inference(instantiation,[status(thm)],[c_87]) ).
tcf(c_579,plain,
! [X0: $i,X1: $i] :
( less_or_equal(X1,v)
| ~ less_or_equal(X0,b)
| ~ sum(b,b,v)
| ~ sum(X0,b,X1) ),
inference(instantiation,[status(thm)],[c_337]) ).
tcf(c_628,plain,
! [X0: $i] :
( sum(X0,a,add(X0,a))
| ~ defined(a)
| ~ defined(X0) ),
inference(instantiation,[status(thm)],[c_101]) ).
tcf(c_954,plain,
! [X0: $i] :
( less_or_equal(u,X0)
| ~ less_or_equal(a,b)
| ~ sum(a,a,u)
| ~ sum(b,a,X0) ),
inference(instantiation,[status(thm)],[c_355]) ).
tcf(c_1027,plain,
! [X0: $i] :
( sum(X0,b,add(b,X0))
| ~ sum(b,X0,add(b,X0)) ),
inference(instantiation,[status(thm)],[c_570]) ).
tcf(c_1484,plain,
! [X0: $i] :
( less_or_equal(u,v)
| ~ less_or_equal(u,add(X0,a))
| ~ less_or_equal(add(X0,a),v) ),
inference(instantiation,[status(thm)],[c_298]) ).
tcf(c_2010,plain,
! [X0: $i,X1: $i] :
( less_or_equal(add(X1,a),v)
| ~ less_or_equal(X0,b)
| ~ sum(b,b,v)
| ~ sum(X0,b,add(X1,a)) ),
inference(instantiation,[status(thm)],[c_579]) ).
tcf(c_2081,plain,
( sum(a,b,add(b,a))
| ~ sum(b,a,add(b,a)) ),
inference(instantiation,[status(thm)],[c_1027]) ).
tcf(c_3242,plain,
( less_or_equal(u,add(b,a))
| ~ less_or_equal(a,b)
| ~ sum(a,a,u)
| ~ sum(b,a,add(b,a)) ),
inference(instantiation,[status(thm)],[c_954]) ).
tcf(c_7166,plain,
( sum(b,a,add(b,a))
| ~ defined(b)
| ~ defined(a) ),
inference(instantiation,[status(thm)],[c_628]) ).
tcf(c_9729,plain,
( less_or_equal(add(b,a),v)
| ~ less_or_equal(a,b)
| ~ sum(b,b,v)
| ~ sum(a,b,add(b,a)) ),
inference(instantiation,[status(thm)],[c_2010]) ).
tcf(c_14491,plain,
( less_or_equal(u,v)
| ~ less_or_equal(u,add(b,a))
| ~ less_or_equal(add(b,a),v) ),
inference(instantiation,[status(thm)],[c_1484]) ).
tcf(c_14492,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_14491,c_9729,c_7166,c_3242,c_2081,c_114,c_115,c_116,c_113,c_109,c_110]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : FLD060-4 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.35 % Computer : n010.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Fri Sep 25 11:00:14 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/0.39 Running first-order theorem proving
% 0.14/0.39 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.14/0.40
% 0.14/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.40
% 0.14/0.40 % Detected problem language: tptp
% 0.14/0.41 % Proving...
% 12.07/2.68 % SZS status Started for theBenchmark.p
% 12.07/2.68 % SZS status Unsatisfiable for theBenchmark.p
% 12.07/2.68
% 12.07/2.68 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 12.07/2.68
% 12.07/2.68 % ------ iProver source info
% 12.07/2.68
% 12.07/2.68 % git: date: 2026-07-19 20:42:38 +0200
% 12.07/2.68 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 12.07/2.68 % git: non_committed_changes: false
% 12.07/2.68
% 12.07/2.68 % ------ Parsing...% successful
% 12.07/2.68
% 12.07/2.68
% 12.07/2.68 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 12.07/2.68
% 12.07/2.68 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 12.07/2.68
% 12.07/2.68 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 12.07/2.68 % ------ Proving...
% 12.07/2.68 % ------ Problem Properties
% 12.07/2.68
% 12.07/2.68 %
% 12.07/2.68 % clauses 34
% 12.07/2.68 % conjectures 4
% 12.07/2.68 % EPR 26
% 12.07/2.68 % Horn 31
% 12.07/2.68 % unary 11
% 12.07/2.68 % binary 6
% 12.07/2.68 % lits 85
% 12.07/2.68 % lits eq 0
% 12.07/2.68 % fd_pure 0
% 12.07/2.68 % fd_pseudo 0
% 12.07/2.68 % fd_cond 0
% 12.07/2.68 % fd_pseudo_cond 0
% 12.07/2.68 % AC symbols 0
% 12.07/2.68
% 12.07/2.68 % ------ Input Options Time Limit: Unbounded
% 12.07/2.68
% 12.07/2.68
% 12.07/2.68 % ------
% 12.07/2.68 % Current options:
% 12.07/2.68 % ------
% 12.07/2.68
% 12.07/2.68
% 12.07/2.68 %
% 12.07/2.68
% 12.07/2.68 % ------ Proving...
% 12.07/2.68 %
% 12.07/2.68
% 12.07/2.68 % SZS status Unsatisfiable for theBenchmark.p
% 12.07/2.68
% 12.07/2.68 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 12.07/2.68
% 12.07/2.68
%------------------------------------------------------------------------------