%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUN088+3 : TPTP v9.3.1. Released v7.3.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 02:30:01 PM UTC 2026
% Result : Theorem 0.45s 1.30s
% Output : CNFRefutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of formulae : 17 ( 8 unt; 0 def)
% Number of atoms : 32 ( 7 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 34 ( 19 ~; 11 |; 4 &)
% ( 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 : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 16 ( 0 sgn 14 !; 2 ?; 2 :)
% Comments :
%------------------------------------------------------------------------------
fof(f11,axiom,
! [X0,X1] :
( ~ r2(X0,X1)
| ! [X2] :
( X2 != X1
| ~ r1(X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_7a) ).
fof(f12,conjecture,
! [X0] :
( ~ r1(X0)
| ! [X1] :
( ~ r2(X0,X1)
| X0 != X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',zerouneqone2) ).
fof(f13,negated_conjecture,
~ ! [X0] :
( ~ r1(X0)
| ! [X1] :
( ~ r2(X0,X1)
| X0 != X1 ) ),
inference(negated_conjecture,[status(cth)],[f12]) ).
fof(f14,plain,
? [X0] :
( r1(X0)
& ? [X1] :
( r2(X0,X1)
& X0 = X1 ) ),
inference(ennf_transformation,[],[f13]) ).
fof(f24,plain,
( r1(sK20)
& r2(sK20,sK21)
& sK20 = sK21 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK20,sK21]),skolemize(X0,sK20),skolemize(X1,sK21)],[f14]) ).
fof(f63,plain,
! [X2,X0,X1] :
( ~ r2(X0,X1)
| X1 != X2
| ~ r1(X2) ),
inference(cnf_transformation,[],[f11]) ).
fof(f64,plain,
r1(sK20),
inference(cnf_transformation,[],[f24]) ).
fof(f65,plain,
r2(sK20,sK21),
inference(cnf_transformation,[],[f24]) ).
fof(f66,plain,
sK20 = sK21,
inference(cnf_transformation,[],[f24]) ).
fof(f70,plain,
r2(sK21,sK21),
inference(definition_unfolding,[],[f65,f66]) ).
fof(f71,plain,
r1(sK21),
inference(definition_unfolding,[],[f64,f66]) ).
fof(f81,plain,
! [X2,X0] :
( ~ r2(X0,X2)
| ~ r1(X2) ),
inference(equality_resolution,[],[f63]) ).
tcf(c_76,plain,
! [X0: $i,X1: $i] :
( ~ r1(X1)
| ~ r2(X0,X1) ),
inference(cnf_transformation,[],[f81]) ).
tcf(c_77,negated_conjecture,
r2(sK21,sK21),
inference(cnf_transformation,[],[f70]) ).
tcf(c_78,negated_conjecture,
r1(sK21),
inference(cnf_transformation,[],[f71]) ).
tcf(c_92,plain,
( ~ r1(sK21)
| ~ r2(sK21,sK21) ),
inference(instantiation,[status(thm)],[c_76]) ).
tcf(c_93,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_92,c_77,c_78]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUN088+3 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.37 % Computer : n014.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Thu Sep 24 06:00:47 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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/0.43
% 0.11/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.43
% 0.11/0.43 % Detected problem language: tptp
% 0.11/0.44 % Proving...
% 0.45/1.30 % SZS status Started for theBenchmark.p
% 0.45/1.30 % SZS status Theorem for theBenchmark.p
% 0.45/1.30
% 0.45/1.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.45/1.30
% 0.45/1.30 % ------ iProver source info
% 0.45/1.30
% 0.45/1.30 % git: date: 2026-07-19 20:42:38 +0200
% 0.45/1.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.45/1.30 % git: non_committed_changes: false
% 0.45/1.30
% 0.45/1.30 % ------ Parsing...
% 0.45/1.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.45/1.30
% 0.45/1.30 % ------ Preprocessing...%
% 0.45/1.30
% 0.45/1.30 % SZS status Theorem for theBenchmark.p
% 0.45/1.30
% 0.45/1.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.45/1.30
% 0.45/1.30
%------------------------------------------------------------------------------