%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : FLD039-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 : n019.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:44 PM UTC 2026
% Result : Unsatisfiable 2.42s 6.33s
% Output : CNFRefutation 2.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of formulae : 8 ( 5 unt; 0 def)
% Number of atoms : 11 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 8 ( 5 ~; 3 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 4 ( 0 sgn 4 !; 0 ?; 2 :)
% Comments :
%------------------------------------------------------------------------------
fof(f22,axiom,
! [X0,X1] :
( ~ equalish(X1,X0)
| equalish(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',symmetry_of_equality) ).
fof(f27,axiom,
~ equalish(additive_identity,multiplicative_identity),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',different_identities) ).
fof(f30,negated_conjecture,
equalish(multiplicative_identity,additive_identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiplicative_identity_equals_additive_identity_3) ).
tcf(c_100,plain,
! [X0: $i,X1: $i] :
( equalish(X1,X0)
| ~ equalish(X0,X1) ),
inference(cnf_transformation,[],[f22]) ).
tcf(c_105,plain,
~ equalish(additive_identity,multiplicative_identity),
inference(cnf_transformation,[],[f27]) ).
tcf(c_108,negated_conjecture,
equalish(multiplicative_identity,additive_identity),
inference(cnf_transformation,[],[f30]) ).
tcf(c_284,plain,
( equalish(additive_identity,multiplicative_identity)
| ~ equalish(multiplicative_identity,additive_identity) ),
inference(instantiation,[status(thm)],[c_100]) ).
tcf(c_285,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_284,c_105,c_108]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : FLD039-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/5.40 % Computer : n019.cluster.edu
% 0.11/5.40 % Model : x86_64 x86_64
% 0.11/5.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.40 % Memory : 8046.5625MB
% 0.11/5.40 % OS : Linux 6.8.0-71-generic
% 0.11/5.40 % CPULimit : 300
% 0.11/5.40 % WCLimit : 300
% 0.11/5.40 % DateTime : Fri Sep 25 10:47:57 UTC 2026
% 0.11/5.40 % CPUTime :
% 0.11/5.40 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/5.45 Running first-order theorem proving
% 0.11/5.45 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.11/5.46
% 0.11/5.46 % ======== iProver multi-core TPTP/SMT =========
% 0.11/5.46
% 0.11/5.46 % Detected problem language: tptp
% 0.11/5.47 % Proving...
% 2.42/6.33 % SZS status Started for theBenchmark.p
% 2.42/6.33 % SZS status Unsatisfiable for theBenchmark.p
% 2.42/6.33
% 2.42/6.33 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.42/6.33
% 2.42/6.33 % ------ iProver source info
% 2.42/6.33
% 2.42/6.33 % git: date: 2026-07-19 20:42:38 +0200
% 2.42/6.33 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.42/6.33 % git: non_committed_changes: false
% 2.42/6.33
% 2.42/6.33 % ------ Parsing...% successful
% 2.42/6.33
% 2.42/6.33
% 2.42/6.33 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.42/6.33
% 2.42/6.33 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.42/6.33
% 2.42/6.33 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.42/6.33 % ------ Proving...
% 2.42/6.33 % ------ Problem Properties
% 2.42/6.33
% 2.42/6.33 %
% 2.42/6.33 % clauses 30
% 2.42/6.33 % conjectures 2
% 2.42/6.33 % EPR 13
% 2.42/6.33 % Horn 27
% 2.42/6.33 % unary 6
% 2.42/6.33 % binary 6
% 2.42/6.33 % lits 76
% 2.42/6.33 % lits eq 0
% 2.42/6.33 % fd_pure 0
% 2.42/6.33 % fd_pseudo 0
% 2.42/6.33 % fd_cond 0
% 2.42/6.33 % fd_pseudo_cond 0
% 2.42/6.33 % AC symbols 0
% 2.42/6.33
% 2.42/6.33 % ------ Schedule dynamic 5 is on
% 2.42/6.33
% 2.42/6.33 % ------ no equalities: superposition off
% 2.42/6.33
% 2.42/6.33 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.42/6.33
% 2.42/6.33
% 2.42/6.33 % ------
% 2.42/6.33 % Current options:
% 2.42/6.33 % ------
% 2.42/6.33
% 2.42/6.33
% 2.42/6.33 %
% 2.42/6.33
% 2.42/6.33 % ------ Proving...
% 2.42/6.33 %
% 2.42/6.33
% 2.42/6.33 % SZS status Unsatisfiable for theBenchmark.p
% 2.42/6.33
% 2.42/6.33 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.42/6.33
% 2.42/6.33
%------------------------------------------------------------------------------