%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUN088+1 : 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 : 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:00 PM UTC 2026
% Result : Theorem 2.96s 6.55s
% Output : CNFRefutation 2.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 16 ( 7 unt; 0 def)
% Number of atoms : 38 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 46 ( 24 ~; 16 |; 6 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 19 ( 0 sgn 16 !; 3 ?; 4 :)
% Comments :
%------------------------------------------------------------------------------
fof(f18,axiom,
! [X0,X1] :
( ~ r2(X0,X1)
| ! [X2] :
( ~ r1(X2)
| ~ id(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM009+0.ax',axiom_7a) ).
fof(f19,conjecture,
! [X0] :
( ! [X2] :
( ~ r2(X2,X0)
| ~ r1(X2) )
| ! [X1] :
( ~ r1(X1)
| ~ id(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',zerounidone) ).
fof(f20,negated_conjecture,
~ ! [X0] :
( ! [X2] :
( ~ r2(X2,X0)
| ~ r1(X2) )
| ! [X1] :
( ~ r1(X1)
| ~ id(X1,X0) ) ),
inference(negated_conjecture,[status(cth)],[f19]) ).
fof(f21,plain,
? [X0] :
( ? [X2] :
( r2(X2,X0)
& r1(X2) )
& ? [X1] :
( r1(X1)
& id(X1,X0) ) ),
inference(ennf_transformation,[],[f20]) ).
fof(f31,plain,
( r2(sK22,sK20)
& r1(sK22)
& r1(sK21)
& id(sK21,sK20) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK20,sK21,sK22]),skolemize(X0,sK20),skolemize(X1,sK21),skolemize(X2,sK22)],[f21]) ).
fof(f89,plain,
! [X2,X0,X1] :
( ~ r2(X0,X1)
| ~ r1(X2)
| ~ id(X2,X1) ),
inference(cnf_transformation,[],[f18]) ).
fof(f90,plain,
r2(sK22,sK20),
inference(cnf_transformation,[],[f31]) ).
fof(f92,plain,
r1(sK21),
inference(cnf_transformation,[],[f31]) ).
fof(f93,plain,
id(sK21,sK20),
inference(cnf_transformation,[],[f31]) ).
tcf(c_90,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ r1(X0)
| ~ r2(X2,X1)
| ~ id(X0,X1) ),
inference(cnf_transformation,[],[f89]) ).
tcf(c_91,negated_conjecture,
id(sK21,sK20),
inference(cnf_transformation,[],[f93]) ).
tcf(c_92,negated_conjecture,
r1(sK21),
inference(cnf_transformation,[],[f92]) ).
tcf(c_94,negated_conjecture,
r2(sK22,sK20),
inference(cnf_transformation,[],[f90]) ).
tcf(c_455,plain,
! [X0: $i] :
( ~ r1(X0)
| ~ r2(sK22,sK20)
| ~ id(X0,sK20) ),
inference(instantiation,[status(thm)],[c_90]) ).
tcf(c_557,plain,
( ~ r1(sK21)
| ~ r2(sK22,sK20)
| ~ id(sK21,sK20) ),
inference(instantiation,[status(thm)],[c_455]) ).
tcf(c_558,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_557,c_91,c_94,c_92]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUN088+1 : 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/5.61 % Computer : n010.cluster.edu
% 0.11/5.61 % Model : x86_64 x86_64
% 0.11/5.61 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.61 % Memory : 8046.5625MB
% 0.11/5.61 % OS : Linux 6.8.0-71-generic
% 0.11/5.61 % CPULimit : 300
% 0.11/5.61 % WCLimit : 300
% 0.11/5.61 % DateTime : Thu Sep 24 06:00:53 UTC 2026
% 0.11/5.61 % CPUTime :
% 0.11/5.61 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/5.65 Running first-order theorem proving
% 0.11/5.65 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/5.67
% 0.11/5.67 % ======== iProver multi-core TPTP/SMT =========
% 0.11/5.67
% 0.11/5.67 % Detected problem language: tptp
% 0.11/5.68 % Proving...
% 2.96/6.55 % SZS status Started for theBenchmark.p
% 2.96/6.55 % SZS status Theorem for theBenchmark.p
% 2.96/6.55
% 2.96/6.55 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.96/6.55
% 2.96/6.55 % ------ iProver source info
% 2.96/6.55
% 2.96/6.55 % git: date: 2026-07-19 20:42:38 +0200
% 2.96/6.55 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.96/6.55 % git: non_committed_changes: false
% 2.96/6.55
% 2.96/6.55 % ------ Parsing...
% 2.96/6.55 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.96/6.55
% 2.96/6.55 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.96/6.55
% 2.96/6.55 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.96/6.55 % ------ Proving...
% 2.96/6.55 % ------ Problem Properties
% 2.96/6.55
% 2.96/6.55 %
% 2.96/6.55 % clauses 46
% 2.96/6.55 % conjectures 4
% 2.96/6.55 % EPR 19
% 2.96/6.55 % Horn 42
% 2.96/6.55 % unary 22
% 2.96/6.55 % binary 13
% 2.96/6.55 % lits 92
% 2.96/6.55 % lits eq 0
% 2.96/6.55 % fd_pure 0
% 2.96/6.55 % fd_pseudo 0
% 2.96/6.55 % fd_cond 0
% 2.96/6.55 % fd_pseudo_cond 0
% 2.96/6.55 % AC symbols 0
% 2.96/6.55
% 2.96/6.55 % ------ Schedule dynamic 5 is on
% 2.96/6.55
% 2.96/6.55 % ------ no equalities: superposition off
% 2.96/6.55
% 2.96/6.55 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.96/6.55
% 2.96/6.55
% 2.96/6.55 % ------
% 2.96/6.55 % Current options:
% 2.96/6.55 % ------
% 2.96/6.55
% 2.96/6.55
% 2.96/6.55 %
% 2.96/6.55
% 2.96/6.55 % ------ Proving...
% 2.96/6.55 %
% 2.96/6.55
% 2.96/6.55 % SZS status Theorem for theBenchmark.p
% 2.96/6.55
% 2.96/6.55 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.96/6.55
% 2.96/6.55
%------------------------------------------------------------------------------