%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUN080+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:29:58 PM UTC 2026
% Result : Theorem 3.82s 1.33s
% Output : CNFRefutation 3.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 24 ( 11 unt; 0 def)
% Number of atoms : 66 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 73 ( 31 ~; 22 |; 20 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 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 : 6 ( 6 usr; 0 con; 1-2 aty)
% Number of variables : 72 ( 0 sgn 54 !; 18 ?; 29 :)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0] : id(X0,X0),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/NUM009+0.ax',axiom_1a) ).
fof(f15,axiom,
! [X0] :
? [X1] :
( ? [X2] :
( r3(X0,X2,X1)
& r1(X2) )
& id(X1,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM009+0.ax',axiom_4a) ).
fof(f19,conjecture,
? [X0,X1,X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( r2(X5,X4)
& r1(X5) )
& r2(X4,X3) )
& r3(X0,X3,X2) )
& id(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',xplustwoidy) ).
fof(f20,negated_conjecture,
~ ? [X0,X1,X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( r2(X5,X4)
& r1(X5) )
& r2(X4,X3) )
& r3(X0,X3,X2) )
& id(X2,X1) ),
inference(negated_conjecture,[status(cth)],[f19]) ).
fof(f21,plain,
! [X0,X1,X2] :
( ! [X3] :
( ! [X4] :
( ! [X5] :
( ~ r2(X5,X4)
| ~ r1(X5) )
| ~ r2(X4,X3) )
| ~ r3(X0,X3,X2) )
| ~ id(X2,X1) ),
inference(ennf_transformation,[],[f20]) ).
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(f28,plain,
! [X0] :
( r3(X0,sK13(X0),sK12(X0))
& r1(sK13(X0))
& id(sK12(X0),X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK12,sK13]),skolemize(X1,sK12(X0)),skolemize(X2,sK13(X0))],[f15]) ).
fof(f47,plain,
! [X0] : id(X0,X0),
inference(cnf_transformation,[],[f5]) ).
fof(f66,plain,
! [X0,X1] : r3(X0,X1,sK7(X0,X1)),
inference(cnf_transformation,[],[f26]) ).
fof(f69,plain,
! [X0,X1] : r2(X1,sK6(X0,X1)),
inference(cnf_transformation,[],[f26]) ).
fof(f78,plain,
! [X0] : r1(sK13(X0)),
inference(cnf_transformation,[],[f28]) ).
fof(f89,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ r2(X5,X4)
| ~ r1(X5)
| ~ r2(X4,X3)
| ~ r3(X0,X3,X2)
| ~ id(X2,X1) ),
inference(cnf_transformation,[],[f21]) ).
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_72,plain,
! [X0: $i,X1: $i] : r3(X0,X1,sK7(X0,X1)),
inference(cnf_transformation,[],[f66]) ).
tcf(c_80,plain,
! [X0: $i] : r1(sK13(X0)),
inference(cnf_transformation,[],[f78]) ).
tcf(c_91,negated_conjecture,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] :
( ~ r1(X5)
| ~ r2(X5,X4)
| ~ r2(X4,X1)
| ~ id(X2,X3)
| ~ r3(X0,X1,X2) ),
inference(cnf_transformation,[],[f89]) ).
tcf(c_421,negated_conjecture,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] :
( ~ r1(X5)
| ~ r2(X5,X4)
| ~ r2(X4,X1)
| ~ id(X2,X3)
| ~ r3(X0,X1,X2) ),
inference(demodulation,[status(thm)],[c_91]) ).
tcf(c_857,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( ~ r1(X4)
| ~ r2(X4,X3)
| ~ r2(X3,X1)
| ~ id(sK7(X0,X1),X2) ),
inference(superposition,[status(thm)],[c_72,c_421]) ).
tcf(c_910,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ r1(X2)
| ~ r2(X2,X0)
| ~ r2(X0,X1) ),
inference(superposition,[status(thm)],[c_57,c_857]) ).
tcf(c_974,plain,
! [X0: $i,X1: $i] :
( ~ r1(X0)
| ~ r2(X0,X1) ),
inference(superposition,[status(thm)],[c_69,c_910]) ).
tcf(c_1008,plain,
! [X0: $i] : ~ r1(X0),
inference(superposition,[status(thm)],[c_69,c_974]) ).
tcf(c_1010,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_80,c_1008]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUN080+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.12/0.37 % Computer : n010.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Thu Sep 24 05:58:19 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 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.12/0.44
% 0.12/0.44 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.44
% 0.12/0.44 % Detected problem language: tptp
% 0.12/0.45 % Proving...
% 3.82/1.33 % SZS status Started for theBenchmark.p
% 3.82/1.33 % SZS status Theorem for theBenchmark.p
% 3.82/1.33
% 3.82/1.33 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.82/1.33
% 3.82/1.33 % ------ iProver source info
% 3.82/1.33
% 3.82/1.33 % git: date: 2026-07-19 20:42:38 +0200
% 3.82/1.33 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.82/1.33 % git: non_committed_changes: false
% 3.82/1.33
% 3.82/1.33 % ------ Parsing...
% 3.82/1.33 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.82/1.33
% 3.82/1.33 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 3.82/1.33
% 3.82/1.33 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.82/1.33 % ------ Proving...
% 3.82/1.33 % ------ Problem Properties
% 3.82/1.33
% 3.82/1.33 %
% 3.82/1.33 % clauses 43
% 3.82/1.33 % conjectures 1
% 3.82/1.33 % EPR 16
% 3.82/1.33 % Horn 39
% 3.82/1.33 % unary 18
% 3.82/1.33 % binary 13
% 3.82/1.33 % lits 93
% 3.82/1.33 % lits eq 0
% 3.82/1.33 % fd_pure 0
% 3.82/1.33 % fd_pseudo 0
% 3.82/1.33 % fd_cond 0
% 3.82/1.33 % fd_pseudo_cond 0
% 3.82/1.33 % AC symbols 0
% 3.82/1.33
% 3.82/1.33 % ------ Schedule dynamic 5 is on
% 3.82/1.33
% 3.82/1.33 % ------ no equalities: superposition off
% 3.82/1.33
% 3.82/1.33 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.82/1.33
% 3.82/1.33
% 3.82/1.33 % ------
% 3.82/1.33 % Current options:
% 3.82/1.33 % ------
% 3.82/1.33
% 3.82/1.33
% 3.82/1.33 %
% 3.82/1.33
% 3.82/1.33 % ------ Proving...
% 3.82/1.33 %
% 3.82/1.33
% 3.82/1.33 % SZS status Theorem for theBenchmark.p
% 3.82/1.33
% 3.82/1.33 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.82/1.33
% 3.82/1.33
%------------------------------------------------------------------------------