%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : FLD003-1 : 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 : n014.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:34 PM UTC 2026
% Result : Unsatisfiable 4.35s 1.17s
% Output : CNFRefutation 4.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of formulae : 41 ( 15 unt; 3 def)
% Number of atoms : 111 ( 3 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 81 ( 42 ~; 39 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 4 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 30 ( 0 sgn 30 !; 0 ?; 17 :)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0] :
( ~ defined(X0)
| equalish(add(additive_identity,X0),X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',existence_of_identity_addition) ).
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(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(f10,axiom,
! [X0,X1] :
( ~ defined(X1)
| ~ defined(X0)
| defined(add(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',well_definedness_of_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(f23,axiom,
! [X2,X0,X1] :
( ~ equalish(X2,X1)
| ~ equalish(X0,X2)
| equalish(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',transitivity_of_equality) ).
fof(f24,axiom,
! [X2,X0,X1] :
( ~ equalish(X0,X2)
| ~ defined(X1)
| equalish(add(X0,X1),add(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',compatibility_of_equality_and_addition) ).
fof(f28,axiom,
defined(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_is_defined) ).
fof(f29,axiom,
defined(b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_is_defined) ).
fof(f30,negated_conjecture,
~ equalish(add(a,add(b,additive_inverse(b))),a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',add_not_equal_to_a_3) ).
tcf(c_80,plain,
! [X0: $i] :
( equalish(add(additive_identity,X0),X0)
| ~ defined(X0) ),
inference(cnf_transformation,[],[f2]) ).
tcf(c_81,plain,
! [X0: $i] :
( equalish(add(X0,additive_inverse(X0)),additive_identity)
| ~ defined(X0) ),
inference(cnf_transformation,[],[f3]) ).
tcf(c_82,plain,
! [X0: $i,X1: $i] :
( equalish(add(X0,X1),add(X1,X0))
| ~ defined(X1)
| ~ defined(X0) ),
inference(cnf_transformation,[],[f4]) ).
tcf(c_88,plain,
! [X0: $i,X1: $i] :
( defined(add(X0,X1))
| ~ defined(X1)
| ~ defined(X0) ),
inference(cnf_transformation,[],[f10]) ).
tcf(c_90,plain,
! [X0: $i] :
( defined(additive_inverse(X0))
| ~ defined(X0) ),
inference(cnf_transformation,[],[f12]) ).
tcf(c_101,plain,
! [X0: $i,X1: $i,X2: $i] :
( equalish(X0,X2)
| ~ equalish(X1,X2)
| ~ equalish(X0,X1) ),
inference(cnf_transformation,[],[f23]) ).
tcf(c_102,plain,
! [X0: $i,X1: $i,X2: $i] :
( equalish(add(X0,X2),add(X1,X2))
| ~ defined(X2)
| ~ equalish(X0,X1) ),
inference(cnf_transformation,[],[f24]) ).
tcf(c_106,plain,
defined(a),
inference(cnf_transformation,[],[f28]) ).
tcf(c_107,plain,
defined(b),
inference(cnf_transformation,[],[f29]) ).
tcf(c_108,negated_conjecture,
~ equalish(add(a,add(b,additive_inverse(b))),a),
inference(cnf_transformation,[],[f30]) ).
tcf(c_279,definition,
iPr_def_10 = additive_inverse(b),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_280,definition,
iPr_def_11 = add(b,iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_281,definition,
iPr_def_12 = add(a,iPr_def_11),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_282,negated_conjecture,
~ equalish(iPr_def_12,a),
inference(demodulation,[status(thm)],[c_108,c_279,c_280,c_281]) ).
tcf(c_709,plain,
( defined(iPr_def_10)
| ~ defined(b) ),
inference(superposition,[status(thm)],[c_279,c_90]) ).
tcf(c_710,plain,
defined(iPr_def_10),
inference(forward_subsumption_resolution,[status(thm)],[c_709,c_107]) ).
tcf(c_750,plain,
( equalish(add(b,iPr_def_10),additive_identity)
| ~ defined(b) ),
inference(superposition,[status(thm)],[c_279,c_81]) ).
tcf(c_752,plain,
( equalish(iPr_def_11,additive_identity)
| ~ defined(b) ),
inference(light_normalisation,[status(thm)],[c_750,c_280]) ).
tcf(c_753,plain,
equalish(iPr_def_11,additive_identity),
inference(forward_subsumption_resolution,[status(thm)],[c_752,c_107]) ).
tcf(c_791,plain,
( defined(iPr_def_11)
| ~ defined(iPr_def_10)
| ~ defined(b) ),
inference(superposition,[status(thm)],[c_280,c_88]) ).
tcf(c_796,plain,
defined(iPr_def_11),
inference(forward_subsumption_resolution,[status(thm)],[c_791,c_710,c_107]) ).
tcf(c_971,plain,
! [X0: $i] :
( equalish(iPr_def_12,a)
| ~ equalish(iPr_def_12,X0)
| ~ equalish(X0,a) ),
inference(instantiation,[status(thm)],[c_101]) ).
tcf(c_1097,plain,
( equalish(iPr_def_12,a)
| ~ equalish(iPr_def_12,add(additive_identity,a))
| ~ equalish(add(additive_identity,a),a) ),
inference(instantiation,[status(thm)],[c_971]) ).
tcf(c_1098,plain,
( equalish(add(additive_identity,a),a)
| ~ defined(a) ),
inference(instantiation,[status(thm)],[c_80]) ).
tcf(c_1157,plain,
( equalish(iPr_def_12,add(iPr_def_11,a))
| ~ defined(iPr_def_11)
| ~ defined(a) ),
inference(superposition,[status(thm)],[c_281,c_82]) ).
tcf(c_1165,plain,
equalish(iPr_def_12,add(iPr_def_11,a)),
inference(forward_subsumption_resolution,[status(thm)],[c_1157,c_796,c_106]) ).
tcf(c_1257,plain,
! [X0: $i] :
( equalish(iPr_def_12,X0)
| ~ equalish(add(iPr_def_11,a),X0) ),
inference(superposition,[status(thm)],[c_1165,c_101]) ).
tcf(c_2665,plain,
! [X0: $i] :
( equalish(iPr_def_12,add(X0,a))
| ~ defined(a)
| ~ equalish(iPr_def_11,X0) ),
inference(superposition,[status(thm)],[c_102,c_1257]) ).
tcf(c_2676,plain,
! [X0: $i] :
( equalish(iPr_def_12,add(X0,a))
| ~ equalish(iPr_def_11,X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2665,c_106]) ).
tcf(c_2682,plain,
( equalish(iPr_def_12,add(additive_identity,a))
| ~ equalish(iPr_def_11,additive_identity) ),
inference(instantiation,[status(thm)],[c_2676]) ).
tcf(c_2683,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_2682,c_1098,c_1097,c_753,c_282,c_106]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : FLD003-1 : 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.34 % Computer : n014.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.08/0.34 % CPULimit : 300
% 0.08/0.34 % WCLimit : 300
% 0.08/0.34 % DateTime : Fri Sep 25 10:33:47 UTC 2026
% 0.08/0.34 % CPUTime :
% 0.08/0.34 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/0.37 Running first-order theorem proving
% 0.08/0.37 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.38
% 0.13/0.38 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.38
% 0.13/0.38 % Detected problem language: tptp
% 0.13/0.40 % Proving...
% 4.35/1.17 % SZS status Started for theBenchmark.p
% 4.35/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 4.35/1.17
% 4.35/1.17 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.35/1.17
% 4.35/1.17 % ------ iProver source info
% 4.35/1.17
% 4.35/1.17 % git: date: 2026-07-19 20:42:38 +0200
% 4.35/1.17 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.35/1.17 % git: non_committed_changes: false
% 4.35/1.17
% 4.35/1.17 % ------ Parsing...% successful
% 4.35/1.17
% 4.35/1.17
% 4.35/1.17 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.35/1.17
% 4.35/1.17 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 4.35/1.17
% 4.35/1.17 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.35/1.17
% 4.35/1.17 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.35/1.17 % ------ Proving...
% 4.35/1.17 % ------ Problem Properties
% 4.35/1.17
% 4.35/1.17 %
% 4.35/1.17 % clauses 33
% 4.35/1.17 % conjectures 1
% 4.35/1.17 % EPR 13
% 4.35/1.17 % Horn 30
% 4.35/1.17 % unary 9
% 4.35/1.17 % binary 6
% 4.35/1.17 % lits 79
% 4.35/1.17 % lits eq 3
% 4.35/1.17 % fd_pure 0
% 4.35/1.17 % fd_pseudo 0
% 4.35/1.17 % fd_cond 0
% 4.35/1.17 % fd_pseudo_cond 0
% 4.35/1.17 % AC symbols 0
% 4.35/1.17
% 4.35/1.17 % ------ Schedule dynamic 5 is on
% 4.35/1.17
% 4.35/1.17 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.35/1.17
% 4.35/1.17
% 4.35/1.17 % ------
% 4.35/1.17 % Current options:
% 4.35/1.17 % ------
% 4.35/1.17
% 4.35/1.17
% 4.35/1.17 %
% 4.35/1.17
% 4.35/1.17 % ------ Proving...
% 4.35/1.17 %
% 4.35/1.17
% 4.35/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 4.35/1.17
% 4.35/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.35/1.17
% 4.35/1.17
%------------------------------------------------------------------------------