%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUN067+2 : 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 : n026.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:29:55 PM UTC 2026
% Result : Theorem 2.24s 1.26s
% Output : CNFRefutation 2.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 20 ( 9 unt; 0 def)
% Number of atoms : 37 ( 13 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 38 ( 21 ~; 11 |; 6 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 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; 0 con; 1-1 aty)
% Number of variables : 33 ( 0 sgn 29 !; 4 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0] :
? [X1] :
! [X2] :
( ( X2 = X1
& r2(X0,X2) )
| ( X2 != X1
& ~ r2(X0,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_2) ).
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] :
! [X1] :
( X0 != X1
| ~ r1(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nonzerosexist) ).
fof(f13,negated_conjecture,
~ ? [X0] :
! [X1] :
( X0 != X1
| ~ r1(X1) ),
inference(negated_conjecture,[status(cth)],[f12]) ).
fof(f14,plain,
! [X0] :
? [X1] :
( X0 = X1
& r1(X1) ),
inference(ennf_transformation,[],[f13]) ).
fof(f16,plain,
! [X0,X2] :
( ( sK1(X0) = X2
& r2(X0,X2) )
| ( sK1(X0) != X2
& ~ r2(X0,X2) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X1,sK1(X0))],[f2]) ).
fof(f24,plain,
! [X0] :
( sK20(X0) = X0
& r1(sK20(X0)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK20]),skolemize(X1,sK20(X0))],[f14]) ).
fof(f30,plain,
! [X2,X0] :
( r2(X0,X2)
| sK1(X0) != X2 ),
inference(cnf_transformation,[],[f16]) ).
fof(f63,plain,
! [X2,X0,X1] :
( ~ r2(X0,X1)
| X1 != X2
| ~ r1(X2) ),
inference(cnf_transformation,[],[f11]) ).
fof(f64,plain,
! [X0] : sK20(X0) = X0,
inference(cnf_transformation,[],[f24]) ).
fof(f65,plain,
! [X0] : r1(sK20(X0)),
inference(cnf_transformation,[],[f24]) ).
fof(f71,plain,
! [X0] : r2(X0,sK1(X0)),
inference(equality_resolution,[],[f30]) ).
fof(f78,plain,
! [X2,X0] :
( ~ r2(X0,X2)
| ~ r1(X2) ),
inference(equality_resolution,[],[f63]) ).
tcf(c_52,plain,
! [X0: $i] : r2(X0,sK1(X0)),
inference(cnf_transformation,[],[f71]) ).
tcf(c_76,plain,
! [X0: $i,X1: $i] :
( ~ r1(X1)
| ~ r2(X0,X1) ),
inference(cnf_transformation,[],[f78]) ).
tcf(c_77,negated_conjecture,
! [X0: $i] : r1(sK20(X0)),
inference(cnf_transformation,[],[f65]) ).
tcf(c_78,negated_conjecture,
! [X0: $i] : sK20(X0) = X0,
inference(cnf_transformation,[],[f64]) ).
tcf(c_190,plain,
! [X0: $i] : r1(X0),
inference(demodulation,[status(thm)],[c_77,c_78]) ).
tcf(c_192,plain,
! [X0: $i,X1: $i] : ~ r2(X0,X1),
inference(forward_subsumption_resolution,[status(thm)],[c_76,c_190]) ).
tcf(c_193,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_52,c_192]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUN067+2 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/0.36 % Computer : n026.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Thu Sep 24 05:57:23 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/0.39 Running first-order theorem proving
% 0.13/0.39 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.13/0.40
% 0.13/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.40
% 0.13/0.40 % Detected problem language: tptp
% 0.13/0.42 % Proving...
% 2.24/1.26 % SZS status Started for theBenchmark.p
% 2.24/1.26 % SZS status Theorem for theBenchmark.p
% 2.24/1.26
% 2.24/1.26 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.24/1.26
% 2.24/1.26 % ------ iProver source info
% 2.24/1.26
% 2.24/1.26 % git: date: 2026-07-19 20:42:38 +0200
% 2.24/1.26 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.24/1.26 % git: non_committed_changes: false
% 2.24/1.26
% 2.24/1.26 % ------ Parsing...
% 2.24/1.26 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.24/1.26
% 2.24/1.26 % ------ Preprocessing...%
% 2.24/1.26
% 2.24/1.26 % SZS status Theorem for theBenchmark.p
% 2.24/1.26
% 2.24/1.26 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.24/1.26
% 2.24/1.26
%------------------------------------------------------------------------------