%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUN069+1 : 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 : 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.44s 1.48s
% Output : CNFRefutation 3.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 26 ( 8 unt; 0 def)
% Number of atoms : 59 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 62 ( 29 ~; 17 |; 16 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 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 : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 40 ( 0 sgn 31 !; 9 ?; 16 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
? [X0] :
! [X1] :
( ( ~ id(X1,X0)
& ~ r1(X1) )
| ( r1(X1)
& id(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM009+0.ax',axiom_1) ).
fof(f5,axiom,
! [X0] : id(X0,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM009+0.ax',axiom_5) ).
fof(f12,axiom,
! [X0,X1] :
? [X2] :
( ? [X5] :
( r3(X0,X1,X5)
& r2(X5,X2) )
& ? [X3] :
( ? [X4] :
( r3(X0,X4,X3)
& r2(X1,X4) )
& id(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM009+0.ax',axiom_1a) ).
fof(f19,conjecture,
? [X0] :
( ? [X1] :
( r2(X1,X0)
& r1(X1) )
& id(X0,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',oneidone) ).
fof(f20,negated_conjecture,
~ ? [X0] :
( ? [X1] :
( r2(X1,X0)
& r1(X1) )
& id(X0,X0) ),
inference(negated_conjecture,[status(cth)],[f19]) ).
fof(f21,plain,
! [X0] :
( ! [X1] :
( ~ r2(X1,X0)
| ~ r1(X1) )
| ~ id(X0,X0) ),
inference(ennf_transformation,[],[f20]) ).
fof(f22,plain,
! [X1] :
( ( ~ id(X1,sK0)
& ~ r1(X1) )
| ( r1(X1)
& id(X1,sK0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f1]) ).
fof(f26,plain,
! [X0,X1] :
( r3(X0,X1,sK7(X0,X1))
& r2(sK7(X0,X1),sK4(X0,X1))
& r3(X0,sK6(X0,X1),sK5(X0,X1))
& r2(X1,sK6(X0,X1))
& id(sK5(X0,X1),sK4(X0,X1)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5,sK6,sK7]),skolemize(X2,sK4(X0,X1)),skolemize(X3,sK5(X0,X1)),skolemize(X4,sK6(X0,X1)),skolemize(X5,sK7(X0,X1))],[f12]) ).
fof(f31,plain,
! [X1] :
( ~ id(X1,sK0)
| r1(X1) ),
inference(cnf_transformation,[],[f22]) ).
fof(f47,plain,
! [X0] : id(X0,X0),
inference(cnf_transformation,[],[f5]) ).
fof(f69,plain,
! [X0,X1] : r2(X1,sK6(X0,X1)),
inference(cnf_transformation,[],[f26]) ).
fof(f89,plain,
! [X0,X1] :
( ~ r2(X1,X0)
| ~ r1(X1)
| ~ id(X0,X0) ),
inference(cnf_transformation,[],[f21]) ).
tcf(c_50,plain,
! [X0: $i] :
( r1(X0)
| ~ id(X0,sK0) ),
inference(cnf_transformation,[],[f31]) ).
tcf(c_57,plain,
! [X0: $i] : id(X0,X0),
inference(cnf_transformation,[],[f47]) ).
tcf(c_69,plain,
! [X0: $i,X1: $i] : r2(X0,sK6(X1,X0)),
inference(cnf_transformation,[],[f69]) ).
tcf(c_91,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ r1(X1)
| ~ r2(X1,X0)
| ~ id(X0,X0) ),
inference(cnf_transformation,[],[f89]) ).
tcf(c_95,plain,
id(sK0,sK0),
inference(instantiation,[status(thm)],[c_57]) ).
tcf(c_99,plain,
r2(sK0,sK6(sK0,sK0)),
inference(instantiation,[status(thm)],[c_69]) ).
tcf(c_104,plain,
( r1(sK0)
| ~ id(sK0,sK0) ),
inference(instantiation,[status(thm)],[c_50]) ).
tcf(c_122,plain,
! [X0: $i,X1: $i] :
( ~ r1(X1)
| ~ r2(X1,X0) ),
inference(global_subsumption_just,[status(thm)],[c_91,c_57,c_91]) ).
tcf(c_123,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ r1(X0)
| ~ r2(X0,X1) ),
inference(renaming,[status(thm)],[c_122]) ).
tcf(c_129,plain,
! [X0: $i,X1: $i] :
( ~ r2(X0,X1)
| ~ r1(X0) ),
inference(prop_impl_just,[status(thm)],[c_123]) ).
tcf(c_130,plain,
! [X0: $i,X1: $i] :
( ~ r1(X0)
| ~ r2(X0,X1) ),
inference(renaming,[status(thm)],[c_129]) ).
tcf(c_419,plain,
! [X0: $i,X1: $i] :
( ~ r1(X0)
| ~ r2(X0,sK6(X1,X0)) ),
inference(instantiation,[status(thm)],[c_130]) ).
tcf(c_420,plain,
( ~ r1(sK0)
| ~ r2(sK0,sK6(sK0,sK0)) ),
inference(instantiation,[status(thm)],[c_419]) ).
tcf(c_421,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_420,c_104,c_99,c_95]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUN069+1 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.40 % Computer : n007.cluster.edu
% 0.13/0.40 % Model : x86_64 x86_64
% 0.13/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.40 % Memory : 8046.5625MB
% 0.13/0.40 % OS : Linux 6.8.0-71-generic
% 0.13/0.40 % CPULimit : 300
% 0.13/0.40 % WCLimit : 300
% 0.13/0.40 % DateTime : Thu Sep 24 05:51:38 UTC 2026
% 0.13/0.41 % CPUTime :
% 0.13/0.41 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.47 Running first-order theorem proving
% 0.13/0.47 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.48
% 0.13/0.48 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.48
% 0.13/0.49 % Detected problem language: tptp
% 0.13/0.50 % Proving...
% 3.44/1.48 % SZS status Started for theBenchmark.p
% 3.44/1.48 % SZS status Theorem for theBenchmark.p
% 3.44/1.48
% 3.44/1.48 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.44/1.48
% 3.44/1.48 % ------ iProver source info
% 3.44/1.48
% 3.44/1.48 % git: date: 2026-07-19 20:42:38 +0200
% 3.44/1.48 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.44/1.48 % git: non_committed_changes: false
% 3.44/1.48
% 3.44/1.48 % ------ Parsing...
% 3.44/1.48 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.44/1.48
% 3.44/1.48 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 3.44/1.48
% 3.44/1.48 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.44/1.48 % ------ Proving...
% 3.44/1.48 % ------ Problem Properties
% 3.44/1.48
% 3.44/1.48 %
% 3.44/1.48 % clauses 43
% 3.44/1.48 % conjectures 0
% 3.44/1.48 % EPR 16
% 3.44/1.48 % Horn 39
% 3.44/1.48 % unary 18
% 3.44/1.48 % binary 14
% 3.44/1.48 % lits 90
% 3.44/1.48 % lits eq 0
% 3.44/1.48 % fd_pure 0
% 3.44/1.48 % fd_pseudo 0
% 3.44/1.48 % fd_cond 0
% 3.44/1.48 % fd_pseudo_cond 0
% 3.44/1.48 % AC symbols 0
% 3.44/1.48
% 3.44/1.48 % ------ Schedule dynamic 5 is on
% 3.44/1.48
% 3.44/1.48 % ------ no conjectures: strip conj schedule
% 3.44/1.48
% 3.44/1.48 % ------ no equalities: superposition off
% 3.44/1.48
% 3.44/1.48 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 3.44/1.48
% 3.44/1.48
% 3.44/1.48 % ------
% 3.44/1.48 % Current options:
% 3.44/1.48 % ------
% 3.44/1.48
% 3.44/1.48
% 3.44/1.48 %
% 3.44/1.48
% 3.44/1.48 % ------ Proving...
% 3.44/1.48 %
% 3.44/1.48
% 3.44/1.48 % SZS status Theorem for theBenchmark.p
% 3.44/1.48
% 3.44/1.48 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.44/1.48
% 3.44/1.48
%------------------------------------------------------------------------------