%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : FLD060-2 : 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 : n026.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 22.22s 3.86s
% Output : CNFRefutation 22.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 13
% Syntax : Number of formulae : 51 ( 16 unt; 0 def)
% Number of atoms : 121 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 139 ( 69 ~; 70 |; 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 : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 49 ( 0 sgn 49 !; 0 ?; 34 :)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0,X1] :
( ~ defined(X1)
| ~ defined(X0)
| equalish(add(X0,X1),add(X1,X0)) ),
file('/export/starexec/sandbox2/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/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,axiom,
defined(b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_is_defined) ).
fof(f31,axiom,
defined(v),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',v_is_defined) ).
fof(f32,negated_conjecture,
equalish(add(a,a),u),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',add_equals_u_5) ).
fof(f33,negated_conjecture,
equalish(add(b,b),v),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',add_equals_v_6) ).
fof(f34,negated_conjecture,
less_or_equal(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_7) ).
fof(f35,negated_conjecture,
~ less_or_equal(u,v),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_less_or_equal_8) ).
tcf(c_84,plain,
defined(a),
inference(cnf_transformation,[],[f28]) ).
tcf(c_85,plain,
defined(b),
inference(cnf_transformation,[],[f29]) ).
tcf(c_87,plain,
defined(v),
inference(cnf_transformation,[],[f31]) ).
tcf(c_88,negated_conjecture,
equalish(add(a,a),u),
inference(cnf_transformation,[],[f32]) ).
tcf(c_89,negated_conjecture,
equalish(add(b,b),v),
inference(cnf_transformation,[],[f33]) ).
tcf(c_90,negated_conjecture,
less_or_equal(a,b),
inference(cnf_transformation,[],[f34]) ).
tcf(c_91,negated_conjecture,
~ less_or_equal(u,v),
inference(cnf_transformation,[],[f35]) ).
tcf(c_94,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_97,plain,
! [X0: $i,X1: $i] :
( equalish(add(X0,X1),add(X1,X0))
| ~ defined(X1)
| ~ defined(X0) ),
inference(cnf_transformation,[],[f4]) ).
tcf(c_101,plain,
! [X0: $i,X1: $i] :
( equalish(X1,X0)
| ~ equalish(X0,X1) ),
inference(cnf_transformation,[],[f22]) ).
tcf(c_102,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_104,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_105,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_261,plain,
! [X0: $i] :
( less_or_equal(u,v)
| ~ less_or_equal(X0,v)
| ~ equalish(X0,u) ),
inference(instantiation,[status(thm)],[c_102]) ).
tcf(c_266,plain,
( less_or_equal(u,v)
| ~ less_or_equal(add(a,a),v)
| ~ equalish(add(a,a),u) ),
inference(instantiation,[status(thm)],[c_261]) ).
tcf(c_275,plain,
! [X0: $i] :
( less_or_equal(v,X0)
| less_or_equal(X0,v)
| ~ defined(v)
| ~ defined(X0) ),
inference(instantiation,[status(thm)],[c_104]) ).
tcf(c_277,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_105]) ).
tcf(c_278,plain,
! [X0: $i,X1: $i] :
( less_or_equal(X1,v)
| ~ less_or_equal(X0,v)
| ~ equalish(X0,X1) ),
inference(instantiation,[status(thm)],[c_102]) ).
tcf(c_317,plain,
! [X0: $i] :
( less_or_equal(add(a,a),v)
| ~ less_or_equal(X0,v)
| ~ less_or_equal(add(a,a),X0) ),
inference(instantiation,[status(thm)],[c_277]) ).
tcf(c_347,plain,
! [X0: $i] :
( less_or_equal(add(a,a),add(X0,a))
| ~ defined(a)
| ~ less_or_equal(a,X0) ),
inference(instantiation,[status(thm)],[c_94]) ).
tcf(c_564,plain,
! [X0: $i] :
( less_or_equal(X0,v)
| ~ less_or_equal(v,v)
| ~ equalish(v,X0) ),
inference(instantiation,[status(thm)],[c_278]) ).
tcf(c_565,plain,
( less_or_equal(v,v)
| ~ defined(v) ),
inference(instantiation,[status(thm)],[c_275]) ).
tcf(c_567,plain,
( less_or_equal(add(a,a),add(b,a))
| ~ defined(a)
| ~ less_or_equal(a,b) ),
inference(instantiation,[status(thm)],[c_347]) ).
tcf(c_699,plain,
equalish(v,add(b,b)),
inference(superposition,[status(thm)],[c_89,c_101]) ).
tcf(c_6314,plain,
( less_or_equal(add(b,b),v)
| ~ less_or_equal(v,v)
| ~ equalish(v,add(b,b)) ),
inference(instantiation,[status(thm)],[c_564]) ).
tcf(c_7306,plain,
! [X0: $i] :
( equalish(add(a,X0),add(X0,a))
| ~ defined(a)
| ~ defined(X0) ),
inference(instantiation,[status(thm)],[c_97]) ).
tcf(c_18550,plain,
( less_or_equal(add(a,a),v)
| ~ less_or_equal(add(b,b),v)
| ~ less_or_equal(add(a,a),add(b,b)) ),
inference(instantiation,[status(thm)],[c_317]) ).
tcf(c_31737,plain,
( equalish(add(a,b),add(b,a))
| ~ defined(b)
| ~ defined(a) ),
inference(instantiation,[status(thm)],[c_7306]) ).
tcf(c_49461,plain,
! [X0: $i,X1: $i] :
( less_or_equal(add(a,a),X1)
| ~ less_or_equal(X0,X1)
| ~ less_or_equal(add(a,a),X0) ),
inference(instantiation,[status(thm)],[c_105]) ).
tcf(c_50036,plain,
! [X0: $i] :
( less_or_equal(add(a,a),X0)
| ~ less_or_equal(add(b,a),X0)
| ~ less_or_equal(add(a,a),add(b,a)) ),
inference(instantiation,[status(thm)],[c_49461]) ).
tcf(c_50624,plain,
! [X0: $i,X1: $i] :
( less_or_equal(add(X0,b),add(X1,b))
| ~ defined(b)
| ~ less_or_equal(X0,X1) ),
inference(instantiation,[status(thm)],[c_94]) ).
tcf(c_51874,plain,
( less_or_equal(add(a,a),add(b,b))
| ~ less_or_equal(add(b,a),add(b,b))
| ~ less_or_equal(add(a,a),add(b,a)) ),
inference(instantiation,[status(thm)],[c_50036]) ).
tcf(c_51935,plain,
! [X0: $i,X1: $i] :
( less_or_equal(X1,add(b,b))
| ~ equalish(X0,X1)
| ~ less_or_equal(X0,add(b,b)) ),
inference(instantiation,[status(thm)],[c_102]) ).
tcf(c_55268,plain,
! [X0: $i] :
( less_or_equal(add(X0,b),add(b,b))
| ~ defined(b)
| ~ less_or_equal(X0,b) ),
inference(instantiation,[status(thm)],[c_50624]) ).
tcf(c_67969,plain,
( less_or_equal(add(a,b),add(b,b))
| ~ defined(b)
| ~ less_or_equal(a,b) ),
inference(instantiation,[status(thm)],[c_55268]) ).
tcf(c_74179,plain,
! [X0: $i] :
( less_or_equal(X0,add(b,b))
| ~ equalish(add(a,b),X0)
| ~ less_or_equal(add(a,b),add(b,b)) ),
inference(instantiation,[status(thm)],[c_51935]) ).
tcf(c_85139,plain,
( less_or_equal(add(b,a),add(b,b))
| ~ less_or_equal(add(a,b),add(b,b))
| ~ equalish(add(a,b),add(b,a)) ),
inference(instantiation,[status(thm)],[c_74179]) ).
tcf(c_85140,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_85139,c_67969,c_51874,c_31737,c_18550,c_6314,c_699,c_567,c_565,c_266,c_88,c_91,c_90,c_84,c_85,c_87]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : FLD060-2 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.38 % Computer : n026.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Fri Sep 25 11:01:56 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 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.44
% 0.12/0.44 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.44
% 0.12/0.44 % Detected problem language: tptp
% 0.12/0.45 % Proving...
% 22.22/3.86 % SZS status Started for theBenchmark.p
% 22.22/3.86 % SZS status Unsatisfiable for theBenchmark.p
% 22.22/3.86
% 22.22/3.86 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 22.22/3.86
% 22.22/3.86 % ------ iProver source info
% 22.22/3.86
% 22.22/3.86 % git: date: 2026-07-19 20:42:38 +0200
% 22.22/3.86 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 22.22/3.86 % git: non_committed_changes: false
% 22.22/3.86
% 22.22/3.86 % ------ Parsing...% successful
% 22.22/3.86
% 22.22/3.86
% 22.22/3.86 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 22.22/3.86
% 22.22/3.86 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 22.22/3.86
% 22.22/3.86 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 22.22/3.86 % ------ Proving...
% 22.22/3.86 % ------ Problem Properties
% 22.22/3.86
% 22.22/3.86 %
% 22.22/3.86 % clauses 28
% 22.22/3.86 % conjectures 4
% 22.22/3.86 % EPR 14
% 22.22/3.86 % Horn 27
% 22.22/3.86 % unary 9
% 22.22/3.86 % binary 3
% 22.22/3.86 % lits 67
% 22.22/3.86 % lits eq 0
% 22.22/3.86 % fd_pure 0
% 22.22/3.86 % fd_pseudo 0
% 22.22/3.86 % fd_cond 0
% 22.22/3.86 % fd_pseudo_cond 0
% 22.22/3.86 % AC symbols 0
% 22.22/3.86
% 22.22/3.86 % ------ Schedule dynamic 5 is on
% 22.22/3.86
% 22.22/3.86 % ------ no equalities: superposition off
% 22.22/3.86
% 22.22/3.86 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 22.22/3.86
% 22.22/3.86
% 22.22/3.86 % ------
% 22.22/3.86 % Current options:
% 22.22/3.86 % ------
% 22.22/3.86
% 22.22/3.86
% 22.22/3.86 %
% 22.22/3.86
% 22.22/3.86 % ------ Proving...
% 22.22/3.86 %
% 22.22/3.86
% 22.22/3.86 % SZS status Unsatisfiable for theBenchmark.p
% 22.22/3.86
% 22.22/3.86 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 22.22/3.86
% 22.22/3.86
%------------------------------------------------------------------------------