%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM019-1 : TPTP v9.3.1. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n020.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 02:23:14 PM UTC 2026
% Result : Unsatisfiable 2.37s 1.40s
% Output : CNFRefutation 2.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 12 ( 8 unt; 0 def)
% Number of atoms : 20 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 18 ( 10 ~; 8 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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 : 9 ( 0 sgn 9 !; 0 ?; 5 :)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X0] : equalish(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity) ).
fof(f8,axiom,
! [X2,X0,X1] :
( equalish(X1,X2)
| ~ equalish(X0,X2)
| ~ equalish(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity) ).
fof(f10,axiom,
equalish(a,aa),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_equals_aa) ).
fof(f11,negated_conjecture,
~ equalish(aa,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_b_equals_a) ).
tcf(c_66,plain,
! [X0: $i] : equalish(X0,X0),
inference(cnf_transformation,[],[f7]) ).
tcf(c_67,plain,
! [X0: $i,X1: $i,X2: $i] :
( equalish(X1,X2)
| ~ equalish(X0,X2)
| ~ equalish(X0,X1) ),
inference(cnf_transformation,[],[f8]) ).
tcf(c_69,plain,
equalish(a,aa),
inference(cnf_transformation,[],[f10]) ).
tcf(c_70,negated_conjecture,
~ equalish(aa,a),
inference(cnf_transformation,[],[f11]) ).
tcf(c_134,plain,
! [X0: $i] :
( equalish(aa,a)
| ~ equalish(X0,aa)
| ~ equalish(X0,a) ),
inference(instantiation,[status(thm)],[c_67]) ).
tcf(c_140,plain,
( equalish(aa,a)
| ~ equalish(a,aa)
| ~ equalish(a,a) ),
inference(instantiation,[status(thm)],[c_134]) ).
tcf(c_141,plain,
equalish(a,a),
inference(instantiation,[status(thm)],[c_66]) ).
tcf(c_142,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_141,c_140,c_70,c_69]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM019-1 : TPTP v9.3.1. Bugfixed v4.0.0.
% 0.00/0.03 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.36 % Computer : n020.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Thu Sep 24 02:41:03 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.41 Running first-order theorem proving
% 0.13/0.41 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.13/0.43
% 0.13/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.43
% 0.13/0.43 % Detected problem language: tptp
% 0.13/0.44 % Proving...
% 2.37/1.40 % SZS status Started for theBenchmark.p
% 2.37/1.40 % SZS status Unsatisfiable for theBenchmark.p
% 2.37/1.40
% 2.37/1.40 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.37/1.40
% 2.37/1.40 % ------ iProver source info
% 2.37/1.40
% 2.37/1.40 % git: date: 2026-07-19 20:42:38 +0200
% 2.37/1.40 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.37/1.40 % git: non_committed_changes: false
% 2.37/1.40
% 2.37/1.40 % ------ Parsing...% successful
% 2.37/1.40
% 2.37/1.40
% 2.37/1.40 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.37/1.40
% 2.37/1.40 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.37/1.40
% 2.37/1.40 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.37/1.40 % ------ Proving...
% 2.37/1.40 % ------ Problem Properties
% 2.37/1.40
% 2.37/1.40 %
% 2.37/1.40 % clauses 11
% 2.37/1.40 % conjectures 1
% 2.37/1.40 % EPR 4
% 2.37/1.40 % Horn 11
% 2.37/1.40 % unary 8
% 2.37/1.40 % binary 2
% 2.37/1.40 % lits 15
% 2.37/1.40 % lits eq 0
% 2.37/1.40 % fd_pure 0
% 2.37/1.40 % fd_pseudo 0
% 2.37/1.40 % fd_cond 0
% 2.37/1.40 % fd_pseudo_cond 0
% 2.37/1.40 % AC symbols 0
% 2.37/1.40
% 2.37/1.40 % ------ Schedule dynamic 5 is on
% 2.37/1.40
% 2.37/1.40 % ------ no equalities: superposition off
% 2.37/1.40
% 2.37/1.40 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.37/1.40
% 2.37/1.40
% 2.37/1.40 % ------
% 2.37/1.40 % Current options:
% 2.37/1.40 % ------
% 2.37/1.40
% 2.37/1.40
% 2.37/1.40 %
% 2.37/1.40
% 2.37/1.40 % ------ Proving...
% 2.37/1.40 %
% 2.37/1.40
% 2.37/1.40 % SZS status Unsatisfiable for theBenchmark.p
% 2.37/1.40
% 2.37/1.40 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.37/1.40
% 2.37/1.40
%------------------------------------------------------------------------------