%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUN089+2 : TPTP v9.3.1. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n010.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 1.19s 6.28s
% Output : CNFRefutation 1.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of formulae : 17 ( 8 unt; 0 def)
% Number of atoms : 40 ( 8 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 47 ( 24 ~; 15 |; 8 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 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 : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 25 ( 0 sgn 21 !; 4 ?; 5 :)
% Comments :
%------------------------------------------------------------------------------
fof(f11,axiom,
! [X0,X1] :
( ~ r2(X0,X1)
| ! [X2] :
( X2 != X1
| ~ r1(X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax',axiom_7a) ).
fof(f12,conjecture,
! [X0] :
( ! [X3] :
( ~ r1(X3)
| X3 != X0 )
| ! [X1] :
( ~ r2(X1,X0)
| ! [X2] :
( ~ r2(X2,X1)
| ~ r1(X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',zerouneqtwo) ).
fof(f13,negated_conjecture,
~ ! [X0] :
( ! [X3] :
( ~ r1(X3)
| X3 != X0 )
| ! [X1] :
( ~ r2(X1,X0)
| ! [X2] :
( ~ r2(X2,X1)
| ~ r1(X2) ) ) ),
inference(negated_conjecture,[status(cth)],[f12]) ).
fof(f14,plain,
? [X0] :
( ? [X3] :
( r1(X3)
& X0 = X3 )
& ? [X1] :
( r2(X1,X0)
& ? [X2] :
( r2(X2,X1)
& r1(X2) ) ) ),
inference(ennf_transformation,[],[f13]) ).
fof(f24,plain,
( r1(sK23)
& sK20 = sK23
& r2(sK21,sK20)
& r2(sK22,sK21)
& r1(sK22) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK20,sK21,sK22,sK23]),skolemize(X0,sK20),skolemize(X1,sK21),skolemize(X2,sK22),skolemize(X3,sK23)],[f14]) ).
fof(f63,plain,
! [X2,X0,X1] :
( ~ r2(X0,X1)
| X1 != X2
| ~ r1(X2) ),
inference(cnf_transformation,[],[f11]) ).
fof(f64,plain,
r1(sK23),
inference(cnf_transformation,[],[f24]) ).
fof(f65,plain,
sK20 = sK23,
inference(cnf_transformation,[],[f24]) ).
fof(f66,plain,
r2(sK21,sK20),
inference(cnf_transformation,[],[f24]) ).
fof(f72,plain,
r2(sK21,sK23),
inference(definition_unfolding,[],[f66,f65]) ).
fof(f82,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,[],[f82]) ).
tcf(c_79,negated_conjecture,
r2(sK21,sK23),
inference(cnf_transformation,[],[f72]) ).
tcf(c_80,negated_conjecture,
r1(sK23),
inference(cnf_transformation,[],[f64]) ).
tcf(c_390,plain,
! [X0: $i,X1: $i] :
( ~ r2(X1,X0)
| ( X0 != sK23 ) ),
inference(resolution_lifted,[status(thm)],[c_76,c_80]) ).
tcf(c_391,plain,
! [X0: $i] : ~ r2(X0,sK23),
inference(unflattening,[status(thm)],[c_390]) ).
tcf(c_415,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_79,c_391]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUN089+2 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/5.37 % Computer : n010.cluster.edu
% 0.10/5.37 % Model : x86_64 x86_64
% 0.10/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.37 % Memory : 8046.5625MB
% 0.10/5.37 % OS : Linux 6.8.0-71-generic
% 0.10/5.38 % CPULimit : 300
% 0.10/5.38 % WCLimit : 300
% 0.10/5.38 % DateTime : Thu Sep 24 06:01:33 UTC 2026
% 0.10/5.38 % CPUTime :
% 0.10/5.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/5.41 Running first-order theorem proving
% 0.14/5.42 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.14/5.43
% 0.14/5.43 % ======== iProver multi-core TPTP/SMT =========
% 0.14/5.43
% 0.14/5.43 % Detected problem language: tptp
% 0.14/5.44 % Proving...
% 1.19/6.28 % SZS status Started for theBenchmark.p
% 1.19/6.28 % SZS status Theorem for theBenchmark.p
% 1.19/6.28
% 1.19/6.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.19/6.28
% 1.19/6.28 % ------ iProver source info
% 1.19/6.28
% 1.19/6.28 % git: date: 2026-07-19 20:42:38 +0200
% 1.19/6.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.19/6.28 % git: non_committed_changes: false
% 1.19/6.28
% 1.19/6.28 % ------ Parsing...
% 1.19/6.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.19/6.28
% 1.19/6.28 % ------ Preprocessing... sup_sim: 1 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s%
% 1.19/6.28
% 1.19/6.28 % SZS status Theorem for theBenchmark.p
% 1.19/6.28
% 1.19/6.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.19/6.29
% 1.19/6.29
%------------------------------------------------------------------------------