%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUN070+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 : n007.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:56 PM UTC 2026
% Result : Theorem 3.77s 1.42s
% Output : CNFRefutation 3.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 32 ( 13 unt; 0 def)
% Number of atoms : 99 ( 18 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 124 ( 57 ~; 43 |; 24 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 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 : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 71 ( 0 sgn 55 !; 16 ?; 23 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
? [X0] :
! [X1] :
( ( X1 = X0
& r1(X1) )
| ( X1 != X0
& ~ r1(X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_1) ).
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(f8,axiom,
! [X0] :
? [X1] :
( X1 = X0
& ? [X2] :
( r3(X0,X2,X1)
& r1(X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_4a) ).
fof(f12,conjecture,
? [X0] :
( ? [X4] :
( ? [X5] :
( r2(X5,X4)
& r1(X5) )
& X0 = X4 )
& ? [X1] :
( ? [X3] :
( r2(X3,X1)
& r1(X3) )
& ? [X2] :
( r3(X1,X2,X0)
& r1(X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',onepluszeroeqone) ).
fof(f13,negated_conjecture,
~ ? [X0] :
( ? [X4] :
( ? [X5] :
( r2(X5,X4)
& r1(X5) )
& X0 = X4 )
& ? [X1] :
( ? [X3] :
( r2(X3,X1)
& r1(X3) )
& ? [X2] :
( r3(X1,X2,X0)
& r1(X2) ) ) ),
inference(negated_conjecture,[status(cth)],[f12]) ).
fof(f14,plain,
! [X0] :
( ! [X4] :
( ! [X5] :
( ~ r2(X5,X4)
| ~ r1(X5) )
| X0 != X4 )
| ! [X1] :
( ! [X3] :
( ~ r2(X3,X1)
| ~ r1(X3) )
| ! [X2] :
( ~ r3(X1,X2,X0)
| ~ r1(X2) ) ) ),
inference(ennf_transformation,[],[f13]) ).
fof(f15,plain,
! [X1] :
( ( sK0 = X1
& r1(X1) )
| ( sK0 != X1
& ~ r1(X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f1]) ).
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(f21,plain,
! [X0] :
( sK12(X0) = X0
& r3(X0,sK13(X0),sK12(X0))
& r1(sK13(X0)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK12,sK13]),skolemize(X1,sK12(X0)),skolemize(X2,sK13(X0))],[f8]) ).
fof(f25,plain,
! [X1] :
( r1(X1)
| sK0 != X1 ),
inference(cnf_transformation,[],[f15]) ).
fof(f29,plain,
! [X2,X0] :
( r2(X0,X2)
| sK1(X0) != X2 ),
inference(cnf_transformation,[],[f16]) ).
fof(f51,plain,
! [X0] : sK12(X0) = X0,
inference(cnf_transformation,[],[f21]) ).
fof(f52,plain,
! [X0] : r3(X0,sK13(X0),sK12(X0)),
inference(cnf_transformation,[],[f21]) ).
fof(f53,plain,
! [X0] : r1(sK13(X0)),
inference(cnf_transformation,[],[f21]) ).
fof(f63,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ r2(X5,X4)
| ~ r1(X5)
| X0 != X4
| ~ r2(X3,X1)
| ~ r1(X3)
| ~ r3(X1,X2,X0)
| ~ r1(X2) ),
inference(cnf_transformation,[],[f14]) ).
fof(f67,plain,
r1(sK0),
inference(equality_resolution,[],[f25]) ).
fof(f69,plain,
! [X0] : r2(X0,sK1(X0)),
inference(equality_resolution,[],[f29]) ).
fof(f77,plain,
! [X2,X3,X1,X4,X5] :
( ~ r2(X5,X4)
| ~ r1(X5)
| ~ r2(X3,X1)
| ~ r1(X3)
| ~ r3(X1,X2,X4)
| ~ r1(X2) ),
inference(equality_resolution,[],[f63]) ).
tcf(c_50,plain,
r1(sK0),
inference(cnf_transformation,[],[f67]) ).
tcf(c_52,plain,
! [X0: $i] : r2(X0,sK1(X0)),
inference(cnf_transformation,[],[f69]) ).
tcf(c_66,plain,
! [X0: $i] : r1(sK13(X0)),
inference(cnf_transformation,[],[f53]) ).
tcf(c_67,plain,
! [X0: $i] : r3(X0,sK13(X0),sK12(X0)),
inference(cnf_transformation,[],[f52]) ).
tcf(c_68,plain,
! [X0: $i] : sK12(X0) = X0,
inference(cnf_transformation,[],[f51]) ).
tcf(c_77,negated_conjecture,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( ~ r1(X4)
| ~ r1(X3)
| ~ r1(X1)
| ~ r2(X4,X2)
| ~ r2(X3,X0)
| ~ r3(X0,X1,X2) ),
inference(cnf_transformation,[],[f77]) ).
tcf(c_81,plain,
r2(sK0,sK1(sK0)),
inference(instantiation,[status(thm)],[c_52]) ).
tcf(c_195,plain,
! [X0: $i] : r3(X0,sK13(X0),X0),
inference(light_normalisation,[status(thm)],[c_67,c_68]) ).
tcf(c_697,negated_conjecture,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( ~ r1(X4)
| ~ r1(X3)
| ~ r1(X1)
| ~ r2(X4,X2)
| ~ r2(X3,X0)
| ~ r3(X0,X1,X2) ),
inference(demodulation,[status(thm)],[c_77]) ).
tcf(c_956,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ r1(X2)
| ~ r1(X0)
| ~ r1(sK13(X1))
| ~ r2(X2,X1)
| ~ r2(X0,X1) ),
inference(superposition,[status(thm)],[c_195,c_697]) ).
tcf(c_957,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ r1(X2)
| ~ r1(X0)
| ~ r2(X2,X1)
| ~ r2(X0,X1) ),
inference(forward_subsumption_resolution,[status(thm)],[c_956,c_66]) ).
tcf(c_1019,plain,
! [X0: $i,X1: $i] :
( ~ r1(X1)
| ~ r1(X0)
| ~ r2(X0,sK1(X1)) ),
inference(superposition,[status(thm)],[c_52,c_957]) ).
tcf(c_1031,plain,
( ~ r1(sK0)
| ~ r2(sK0,sK1(sK0)) ),
inference(instantiation,[status(thm)],[c_1019]) ).
tcf(c_1032,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1031,c_81,c_50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : NUN070+2 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.07 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.15/0.43 % Computer : n007.cluster.edu
% 0.15/0.43 % Model : x86_64 x86_64
% 0.15/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.43 % Memory : 8046.5625MB
% 0.15/0.43 % OS : Linux 6.8.0-71-generic
% 0.15/0.43 % CPULimit : 300
% 0.15/0.43 % WCLimit : 300
% 0.15/0.43 % DateTime : Thu Sep 24 05:51:08 UTC 2026
% 0.15/0.44 % CPUTime :
% 0.15/0.44 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.21/0.50 Running first-order theorem proving
% 0.21/0.50 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.21/0.52
% 0.21/0.52 % ======== iProver multi-core TPTP/SMT =========
% 0.21/0.52
% 0.21/0.52 % Detected problem language: tptp
% 0.21/0.54 % Proving...
% 3.77/1.42 % SZS status Started for theBenchmark.p
% 3.77/1.42 % SZS status Theorem for theBenchmark.p
% 3.77/1.42
% 3.77/1.42 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.77/1.42
% 3.77/1.42 % ------ iProver source info
% 3.77/1.42
% 3.77/1.42 % git: date: 2026-07-19 20:42:38 +0200
% 3.77/1.42 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.77/1.42 % git: non_committed_changes: false
% 3.77/1.42
% 3.77/1.42 % ------ Parsing...
% 3.77/1.42 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.77/1.42
% 3.77/1.42 % ------ Preprocessing... sup_sim: 1 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 1 sf_s rm: 2 0s sf_e pe_s pe_e %
% 3.77/1.42
% 3.77/1.42 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.77/1.42
% 3.77/1.42 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.77/1.42 % ------ Proving...
% 3.77/1.42 % ------ Problem Properties
% 3.77/1.42
% 3.77/1.42 %
% 3.77/1.42 % clauses 27
% 3.77/1.42 % conjectures 1
% 3.77/1.42 % EPR 5
% 3.77/1.42 % Horn 23
% 3.77/1.42 % unary 17
% 3.77/1.42 % binary 8
% 3.77/1.42 % lits 42
% 3.77/1.42 % lits eq 12
% 3.77/1.42 % fd_pure 0
% 3.77/1.42 % fd_pseudo 0
% 3.77/1.42 % fd_cond 1
% 3.77/1.42 % fd_pseudo_cond 3
% 3.77/1.42 % AC symbols 0
% 3.77/1.42
% 3.77/1.42 % ------ Schedule dynamic 5 is on
% 3.77/1.42
% 3.77/1.42 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.77/1.42
% 3.77/1.42
% 3.77/1.42 % ------
% 3.77/1.42 % Current options:
% 3.77/1.42 % ------
% 3.77/1.42
% 3.77/1.42
% 3.77/1.42 %
% 3.77/1.42
% 3.77/1.42 % ------ Proving...
% 3.77/1.42 %
% 3.77/1.42
% 3.77/1.42 % SZS status Theorem for theBenchmark.p
% 3.77/1.42
% 3.77/1.42 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.77/1.42
% 3.77/1.42
%------------------------------------------------------------------------------