%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : FLD006-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 : n001.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 1.95s 1.32s
% Output : CNFRefutation 1.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 26 ( 11 unt; 1 def)
% Number of atoms : 56 ( 1 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 37 ( 20 ~; 17 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 17 ( 0 sgn 17 !; 0 ?; 9 :)
% 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(f11,axiom,
defined(additive_identity),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',well_definedness_of_additive_identity) ).
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(f22,axiom,
! [X0,X1] :
( ~ equalish(X1,X0)
| equalish(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',symmetry_of_equality) ).
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(f28,negated_conjecture,
~ equalish(additive_inverse(additive_identity),additive_identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_inverse_not_equal_to_additive_identity_1) ).
tcf(c_78,plain,
! [X0: $i] :
( equalish(add(additive_identity,X0),X0)
| ~ defined(X0) ),
inference(cnf_transformation,[],[f2]) ).
tcf(c_79,plain,
! [X0: $i] :
( equalish(add(X0,additive_inverse(X0)),additive_identity)
| ~ defined(X0) ),
inference(cnf_transformation,[],[f3]) ).
tcf(c_87,plain,
defined(additive_identity),
inference(cnf_transformation,[],[f11]) ).
tcf(c_88,plain,
! [X0: $i] :
( defined(additive_inverse(X0))
| ~ defined(X0) ),
inference(cnf_transformation,[],[f12]) ).
tcf(c_98,plain,
! [X0: $i,X1: $i] :
( equalish(X1,X0)
| ~ equalish(X0,X1) ),
inference(cnf_transformation,[],[f22]) ).
tcf(c_99,plain,
! [X0: $i,X1: $i,X2: $i] :
( equalish(X0,X2)
| ~ equalish(X1,X2)
| ~ equalish(X0,X1) ),
inference(cnf_transformation,[],[f23]) ).
tcf(c_104,negated_conjecture,
~ equalish(additive_inverse(additive_identity),additive_identity),
inference(cnf_transformation,[],[f28]) ).
tcf(c_271,definition,
iPr_def_10 = additive_inverse(additive_identity),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_272,negated_conjecture,
~ equalish(iPr_def_10,additive_identity),
inference(demodulation,[status(thm)],[c_104,c_271]) ).
tcf(c_683,plain,
( defined(iPr_def_10)
| ~ defined(additive_identity) ),
inference(superposition,[status(thm)],[c_271,c_88]) ).
tcf(c_684,plain,
defined(iPr_def_10),
inference(forward_subsumption_resolution,[status(thm)],[c_683,c_87]) ).
tcf(c_720,plain,
( equalish(add(additive_identity,iPr_def_10),additive_identity)
| ~ defined(additive_identity) ),
inference(superposition,[status(thm)],[c_271,c_79]) ).
tcf(c_722,plain,
equalish(add(additive_identity,iPr_def_10),additive_identity),
inference(forward_subsumption_resolution,[status(thm)],[c_720,c_87]) ).
tcf(c_726,plain,
equalish(additive_identity,add(additive_identity,iPr_def_10)),
inference(superposition,[status(thm)],[c_722,c_98]) ).
tcf(c_798,plain,
! [X0: $i] :
( equalish(additive_identity,X0)
| ~ equalish(add(additive_identity,iPr_def_10),X0) ),
inference(superposition,[status(thm)],[c_726,c_99]) ).
tcf(c_971,plain,
( equalish(iPr_def_10,additive_identity)
| ~ equalish(additive_identity,iPr_def_10) ),
inference(instantiation,[status(thm)],[c_98]) ).
tcf(c_976,plain,
( equalish(additive_identity,iPr_def_10)
| ~ defined(iPr_def_10) ),
inference(superposition,[status(thm)],[c_78,c_798]) ).
tcf(c_984,plain,
equalish(additive_identity,iPr_def_10),
inference(forward_subsumption_resolution,[status(thm)],[c_976,c_684]) ).
tcf(c_990,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_984,c_971,c_272]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : FLD006-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.10/0.60 % Computer : n001.cluster.edu
% 0.10/0.60 % Model : x86_64 x86_64
% 0.10/0.60 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.60 % Memory : 8046.5625MB
% 0.10/0.60 % OS : Linux 6.8.0-71-generic
% 0.10/0.60 % CPULimit : 300
% 0.10/0.60 % WCLimit : 300
% 0.10/0.60 % DateTime : Fri Sep 25 10:39:56 UTC 2026
% 0.10/0.60 % CPUTime :
% 0.10/0.60 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/0.64 Running first-order theorem proving
% 0.14/0.64 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.14/0.65
% 0.14/0.65 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.65
% 0.14/0.65 % Detected problem language: tptp
% 0.14/0.66 % Proving...
% 1.95/1.32 % SZS status Started for theBenchmark.p
% 1.95/1.32 % SZS status Unsatisfiable for theBenchmark.p
% 1.95/1.32
% 1.95/1.32 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.95/1.32
% 1.95/1.32 % ------ iProver source info
% 1.95/1.32
% 1.95/1.32 % git: date: 2026-07-19 20:42:38 +0200
% 1.95/1.32 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.95/1.32 % git: non_committed_changes: false
% 1.95/1.32
% 1.95/1.32 % ------ Parsing...% successful
% 1.95/1.32
% 1.95/1.32
% 1.95/1.32 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.95/1.32
% 1.95/1.32 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.95/1.32
% 1.95/1.32 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.95/1.32
% 1.95/1.32 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.95/1.32 % ------ Proving...
% 1.95/1.32 % ------ Problem Properties
% 1.95/1.32
% 1.95/1.32 %
% 1.95/1.32 % clauses 29
% 1.95/1.32 % conjectures 1
% 1.95/1.32 % EPR 11
% 1.95/1.32 % Horn 26
% 1.95/1.32 % unary 5
% 1.95/1.32 % binary 6
% 1.95/1.32 % lits 75
% 1.95/1.32 % lits eq 1
% 1.95/1.32 % fd_pure 0
% 1.95/1.32 % fd_pseudo 0
% 1.95/1.32 % fd_cond 0
% 1.95/1.32 % fd_pseudo_cond 0
% 1.95/1.32 % AC symbols 0
% 1.95/1.32
% 1.95/1.32 % ------ Schedule dynamic 5 is on
% 1.95/1.32
% 1.95/1.32 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.95/1.32
% 1.95/1.32
% 1.95/1.32 % ------
% 1.95/1.32 % Current options:
% 1.95/1.32 % ------
% 1.95/1.32
% 1.95/1.32
% 1.95/1.32 %
% 1.95/1.32
% 1.95/1.32 % ------ Proving...
% 1.95/1.32 %
% 1.95/1.32
% 1.95/1.32 % SZS status Unsatisfiable for theBenchmark.p
% 1.95/1.32
% 1.95/1.32 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.95/1.32
% 1.95/1.32
%------------------------------------------------------------------------------