%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : FLD037-1 : 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 : n007.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:43 PM UTC 2026
% Result : Unsatisfiable 1.97s 1.37s
% Output : CNFRefutation 1.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of formulae : 34 ( 17 unt; 2 def)
% Number of atoms : 77 ( 2 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 55 ( 28 ~; 27 |; 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 : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 23 ( 0 sgn 23 !; 0 ?; 13 :)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X0] :
( equalish(X0,additive_identity)
| ~ defined(X0)
| equalish(multiply(X0,multiplicative_inverse(X0)),multiplicative_identity) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',existence_of_inverse_multiplication) ).
fof(f15,axiom,
! [X0] :
( equalish(X0,additive_identity)
| ~ defined(X0)
| defined(multiplicative_inverse(X0)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',well_definedness_of_multiplicative_inverse) ).
fof(f22,axiom,
! [X0,X1] :
( ~ equalish(X1,X0)
| equalish(X0,X1) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/FLD001-0.ax',transitivity_of_equality) ).
fof(f25,axiom,
! [X2,X0,X1] :
( ~ equalish(X0,X2)
| ~ defined(X1)
| equalish(multiply(X0,X1),multiply(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',compatibility_of_equality_and_multiplication) ).
fof(f28,axiom,
defined(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_is_defined) ).
fof(f30,negated_conjecture,
~ equalish(a,additive_identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_not_equal_to_additive_identity_3) ).
fof(f31,negated_conjecture,
equalish(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_equals_b_4) ).
fof(f32,negated_conjecture,
~ equalish(multiplicative_identity,multiply(b,multiplicative_inverse(a))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiplicative_identity_not_equal_to_multiply_5) ).
tcf(c_87,plain,
! [X0: $i] :
( equalish(X0,additive_identity)
| equalish(multiply(X0,multiplicative_inverse(X0)),multiplicative_identity)
| ~ defined(X0) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_95,plain,
! [X0: $i] :
( equalish(X0,additive_identity)
| defined(multiplicative_inverse(X0))
| ~ defined(X0) ),
inference(cnf_transformation,[],[f15]) ).
tcf(c_102,plain,
! [X0: $i,X1: $i] :
( equalish(X1,X0)
| ~ equalish(X0,X1) ),
inference(cnf_transformation,[],[f22]) ).
tcf(c_103,plain,
! [X0: $i,X1: $i,X2: $i] :
( equalish(X0,X2)
| ~ equalish(X1,X2)
| ~ equalish(X0,X1) ),
inference(cnf_transformation,[],[f23]) ).
tcf(c_105,plain,
! [X0: $i,X1: $i,X2: $i] :
( equalish(multiply(X0,X2),multiply(X1,X2))
| ~ defined(X2)
| ~ equalish(X0,X1) ),
inference(cnf_transformation,[],[f25]) ).
tcf(c_108,plain,
defined(a),
inference(cnf_transformation,[],[f28]) ).
tcf(c_110,negated_conjecture,
~ equalish(a,additive_identity),
inference(cnf_transformation,[],[f30]) ).
tcf(c_111,negated_conjecture,
equalish(a,b),
inference(cnf_transformation,[],[f31]) ).
tcf(c_112,negated_conjecture,
~ equalish(multiplicative_identity,multiply(b,multiplicative_inverse(a))),
inference(cnf_transformation,[],[f32]) ).
tcf(c_287,definition,
iPr_def_10 = multiplicative_inverse(a),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_288,definition,
iPr_def_11 = multiply(b,iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_289,negated_conjecture,
~ equalish(multiplicative_identity,iPr_def_11),
inference(demodulation,[status(thm)],[c_112,c_287,c_288]) ).
tcf(c_290,negated_conjecture,
equalish(a,b),
inference(demodulation,[status(thm)],[c_111]) ).
tcf(c_291,negated_conjecture,
~ equalish(a,additive_identity),
inference(demodulation,[status(thm)],[c_110]) ).
tcf(c_773,plain,
( defined(multiplicative_inverse(a))
| ~ defined(a) ),
inference(superposition,[status(thm)],[c_95,c_291]) ).
tcf(c_775,plain,
( defined(iPr_def_10)
| ~ defined(a) ),
inference(light_normalisation,[status(thm)],[c_773,c_287]) ).
tcf(c_776,plain,
defined(iPr_def_10),
inference(forward_subsumption_resolution,[status(thm)],[c_775,c_108]) ).
tcf(c_1082,plain,
( equalish(a,additive_identity)
| equalish(multiply(a,iPr_def_10),multiplicative_identity)
| ~ defined(a) ),
inference(superposition,[status(thm)],[c_287,c_87]) ).
tcf(c_1086,plain,
equalish(multiply(a,iPr_def_10),multiplicative_identity),
inference(forward_subsumption_resolution,[status(thm)],[c_1082,c_291,c_108]) ).
tcf(c_1192,plain,
equalish(multiplicative_identity,multiply(a,iPr_def_10)),
inference(superposition,[status(thm)],[c_1086,c_102]) ).
tcf(c_1228,plain,
! [X0: $i] :
( equalish(multiplicative_identity,X0)
| ~ equalish(multiply(a,iPr_def_10),X0) ),
inference(superposition,[status(thm)],[c_1192,c_103]) ).
tcf(c_1766,plain,
! [X0: $i] :
( equalish(multiply(X0,iPr_def_10),iPr_def_11)
| ~ defined(iPr_def_10)
| ~ equalish(X0,b) ),
inference(superposition,[status(thm)],[c_288,c_105]) ).
tcf(c_1778,plain,
! [X0: $i] :
( equalish(multiply(X0,iPr_def_10),iPr_def_11)
| ~ equalish(X0,b) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1766,c_776]) ).
tcf(c_4691,plain,
( equalish(multiplicative_identity,iPr_def_11)
| ~ equalish(a,b) ),
inference(superposition,[status(thm)],[c_1778,c_1228]) ).
tcf(c_4692,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_4691,c_289,c_290]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : FLD037-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.38 % Computer : n007.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Fri Sep 25 10:45:08 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.44 Running first-order theorem proving
% 0.11/0.44 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.11/0.46
% 0.11/0.46 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.46
% 0.11/0.46 % Detected problem language: tptp
% 0.11/0.48 % Proving...
% 1.97/1.37 % SZS status Started for theBenchmark.p
% 1.97/1.37 % SZS status Unsatisfiable for theBenchmark.p
% 1.97/1.37
% 1.97/1.37 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.97/1.37
% 1.97/1.37 % ------ iProver source info
% 1.97/1.37
% 1.97/1.37 % git: date: 2026-07-19 20:42:38 +0200
% 1.97/1.37 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.97/1.37 % git: non_committed_changes: false
% 1.97/1.37
% 1.97/1.37 % ------ Parsing...% successful
% 1.97/1.37
% 1.97/1.37
% 1.97/1.37 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.97/1.37
% 1.97/1.37 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.97/1.37
% 1.97/1.37 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.97/1.37
% 1.97/1.37 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.97/1.37 % ------ Proving...
% 1.97/1.37 % ------ Problem Properties
% 1.97/1.37
% 1.97/1.37 %
% 1.97/1.37 % clauses 34
% 1.97/1.37 % conjectures 3
% 1.97/1.37 % EPR 15
% 1.97/1.37 % Horn 31
% 1.97/1.37 % unary 10
% 1.97/1.37 % binary 6
% 1.97/1.37 % lits 80
% 1.97/1.37 % lits eq 2
% 1.97/1.37 % fd_pure 0
% 1.97/1.37 % fd_pseudo 0
% 1.97/1.37 % fd_cond 0
% 1.97/1.37 % fd_pseudo_cond 0
% 1.97/1.37 % AC symbols 0
% 1.97/1.37
% 1.97/1.37 % ------ Schedule dynamic 5 is on
% 1.97/1.37
% 1.97/1.37 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.97/1.37
% 1.97/1.37
% 1.97/1.37 % ------
% 1.97/1.37 % Current options:
% 1.97/1.37 % ------
% 1.97/1.37
% 1.97/1.37
% 1.97/1.37 %
% 1.97/1.37
% 1.97/1.37 % ------ Proving...
% 1.97/1.37 %
% 1.97/1.37
% 1.97/1.37 % SZS status Unsatisfiable for theBenchmark.p
% 1.97/1.37
% 1.97/1.37 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.97/1.37
% 1.97/1.37
%------------------------------------------------------------------------------