%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUN059+2 : TPTP v9.3.1. Bugfixed v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n015.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:54 PM UTC 2026
% Result : Theorem 2.96s 1.28s
% Output : CNFRefutation 2.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 45 ( 25 unt; 0 def)
% Number of atoms : 98 ( 25 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 93 ( 40 ~; 27 |; 26 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 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 : 7 ( 7 usr; 1 con; 0-2 aty)
% Number of variables : 103 ( 0 sgn 82 !; 21 ?; 36 :)
% 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(f4,axiom,
! [X0,X1] :
? [X2] :
! [X3] :
( ( X3 = X2
& r4(X0,X1,X3) )
| ( X3 != X2
& ~ r4(X0,X1,X3) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_4) ).
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(f9,axiom,
! [X0] :
? [X1] :
( ? [X3] :
( X1 = X3
& r1(X3) )
& ? [X2] :
( r4(X0,X2,X1)
& r1(X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_5a) ).
fof(f12,conjecture,
? [X0,X1,X2,X3] :
( ? [X5] :
( ? [X6] :
( r3(X6,X5,X3)
& r4(X0,X0,X6) )
& r4(X1,X1,X5) )
& ? [X4] :
( X3 = X4
& r4(X2,X2,X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fermattothepoweroftwo) ).
fof(f13,negated_conjecture,
~ ? [X0,X1,X2,X3] :
( ? [X5] :
( ? [X6] :
( r3(X6,X5,X3)
& r4(X0,X0,X6) )
& r4(X1,X1,X5) )
& ? [X4] :
( X3 = X4
& r4(X2,X2,X4) ) ),
inference(negated_conjecture,[status(cth)],[f12]) ).
fof(f14,plain,
! [X0,X1,X2,X3] :
( ! [X5] :
( ! [X6] :
( ~ r3(X6,X5,X3)
| ~ r4(X0,X0,X6) )
| ~ r4(X1,X1,X5) )
| ! [X4] :
( X3 != X4
| ~ r4(X2,X2,X4) ) ),
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(f18,plain,
! [X0,X1,X3] :
( ( sK3(X0,X1) = X3
& r4(X0,X1,X3) )
| ( sK3(X0,X1) != X3
& ~ r4(X0,X1,X3) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X2,sK3(X0,X1))],[f4]) ).
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(f22,plain,
! [X0] :
( sK14(X0) = sK16(X0)
& r1(sK16(X0))
& r4(X0,sK15(X0),sK14(X0))
& r1(sK15(X0)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK14,sK15,sK16]),skolemize(X1,sK14(X0)),skolemize(X2,sK15(X0)),skolemize(X3,sK16(X0))],[f9]) ).
fof(f26,plain,
! [X1] :
( sK0 = X1
| ~ r1(X1) ),
inference(cnf_transformation,[],[f15]) ).
fof(f37,plain,
! [X3,X0,X1] :
( r4(X0,X1,X3)
| sK3(X0,X1) != X3 ),
inference(cnf_transformation,[],[f18]) ).
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(f54,plain,
! [X0] : sK14(X0) = sK16(X0),
inference(cnf_transformation,[],[f22]) ).
fof(f55,plain,
! [X0] : r1(sK16(X0)),
inference(cnf_transformation,[],[f22]) ).
fof(f56,plain,
! [X0] : r4(X0,sK15(X0),sK14(X0)),
inference(cnf_transformation,[],[f22]) ).
fof(f57,plain,
! [X0] : r1(sK15(X0)),
inference(cnf_transformation,[],[f22]) ).
fof(f63,plain,
! [X2,X3,X0,X1,X6,X4,X5] :
( ~ r3(X6,X5,X3)
| ~ r4(X0,X0,X6)
| ~ r4(X1,X1,X5)
| X3 != X4
| ~ r4(X2,X2,X4) ),
inference(cnf_transformation,[],[f14]) ).
fof(f66,plain,
! [X0] : r4(X0,sK15(X0),sK16(X0)),
inference(definition_unfolding,[],[f56,f54]) ).
fof(f73,plain,
! [X0,X1] : r4(X0,X1,sK3(X0,X1)),
inference(equality_resolution,[],[f37]) ).
fof(f77,plain,
! [X2,X0,X1,X6,X4,X5] :
( ~ r3(X6,X5,X4)
| ~ r4(X0,X0,X6)
| ~ r4(X1,X1,X5)
| ~ r4(X2,X2,X4) ),
inference(equality_resolution,[],[f63]) ).
tcf(c_49,plain,
! [X0: $i] :
( ( X0 = sK0 )
| ~ r1(X0) ),
inference(cnf_transformation,[],[f26]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i] : r4(X0,X1,sK3(X0,X1)),
inference(cnf_transformation,[],[f73]) ).
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_69,plain,
! [X0: $i] : r1(sK15(X0)),
inference(cnf_transformation,[],[f57]) ).
tcf(c_70,plain,
! [X0: $i] : r4(X0,sK15(X0),sK16(X0)),
inference(cnf_transformation,[],[f66]) ).
tcf(c_71,plain,
! [X0: $i] : r1(sK16(X0)),
inference(cnf_transformation,[],[f55]) ).
tcf(c_77,negated_conjecture,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] :
( ~ r4(X5,X5,X2)
| ~ r4(X4,X4,X0)
| ~ r4(X3,X3,X1)
| ~ r3(X0,X1,X2) ),
inference(cnf_transformation,[],[f77]) ).
tcf(c_192,plain,
! [X0: $i] : r3(X0,sK13(X0),X0),
inference(light_normalisation,[status(thm)],[c_67,c_68]) ).
tcf(c_447,negated_conjecture,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] :
( ~ r4(X5,X5,X2)
| ~ r4(X4,X4,X0)
| ~ r4(X3,X3,X1)
| ~ r3(X0,X1,X2) ),
inference(demodulation,[status(thm)],[c_77]) ).
tcf(c_732,plain,
! [X0: $i] : sK13(X0) = sK0,
inference(superposition,[status(thm)],[c_66,c_49]) ).
tcf(c_733,plain,
! [X0: $i] : sK15(X0) = sK0,
inference(superposition,[status(thm)],[c_69,c_49]) ).
tcf(c_734,plain,
! [X0: $i] : sK16(X0) = sK0,
inference(superposition,[status(thm)],[c_71,c_49]) ).
tcf(c_735,plain,
! [X0: $i] : r3(X0,sK0,X0),
inference(demodulation,[status(thm)],[c_192,c_732]) ).
tcf(c_737,plain,
! [X0: $i] : r4(X0,sK0,sK16(X0)),
inference(demodulation,[status(thm)],[c_70,c_733]) ).
tcf(c_742,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ~ r4(X3,X3,sK0)
| ~ r4(X2,X2,X1)
| ~ r4(X0,X0,X1) ),
inference(superposition,[status(thm)],[c_735,c_447]) ).
tcf(c_753,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ r4(X2,X2,sK0)
| ~ r4(X0,X0,sK3(X1,X1)) ),
inference(superposition,[status(thm)],[c_56,c_742]) ).
tcf(c_776,plain,
! [X0: $i] : ~ r4(X0,X0,sK0),
inference(superposition,[status(thm)],[c_56,c_753]) ).
tcf(c_782,plain,
! [X0: $i] : r4(X0,sK0,sK0),
inference(light_normalisation,[status(thm)],[c_737,c_734]) ).
tcf(c_783,plain,
$false,
inference(superposition,[status(thm)],[c_782,c_776]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUN059+2 : TPTP v9.3.1. Bugfixed v7.4.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/0.37 % Computer : n015.cluster.edu
% 0.08/0.37 % Model : x86_64 x86_64
% 0.08/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.37 % Memory : 8046.5625MB
% 0.08/0.37 % OS : Linux 6.8.0-71-generic
% 0.08/0.37 % CPULimit : 300
% 0.08/0.37 % WCLimit : 300
% 0.08/0.37 % DateTime : Thu Sep 24 05:54:41 UTC 2026
% 0.08/0.37 % CPUTime :
% 0.08/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/0.41 Running first-order theorem proving
% 0.08/0.41 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.08/0.42
% 0.08/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.08/0.42
% 0.08/0.42 % Detected problem language: tptp
% 0.08/0.43 % Proving...
% 2.96/1.28 % SZS status Started for theBenchmark.p
% 2.96/1.28 % SZS status Theorem for theBenchmark.p
% 2.96/1.28
% 2.96/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.96/1.28
% 2.96/1.28 % ------ iProver source info
% 2.96/1.28
% 2.96/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 2.96/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.96/1.28 % git: non_committed_changes: false
% 2.96/1.28
% 2.96/1.28 % ------ Parsing...
% 2.96/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.96/1.28
% 2.96/1.28 % ------ Preprocessing... sup_sim: 1 sf_s rm: 1 0s sf_e pe_s pe_e %
% 2.96/1.28
% 2.96/1.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.96/1.28
% 2.96/1.28 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.96/1.28 % ------ Proving...
% 2.96/1.28 % ------ Problem Properties
% 2.96/1.28
% 2.96/1.28 %
% 2.96/1.28 % clauses 29
% 2.96/1.28 % conjectures 1
% 2.96/1.28 % EPR 5
% 2.96/1.28 % Horn 25
% 2.96/1.28 % unary 18
% 2.96/1.28 % binary 9
% 2.96/1.28 % lits 43
% 2.96/1.28 % lits eq 10
% 2.96/1.28 % fd_pure 0
% 2.96/1.28 % fd_pseudo 0
% 2.96/1.28 % fd_cond 1
% 2.96/1.28 % fd_pseudo_cond 4
% 2.96/1.28 % AC symbols 0
% 2.96/1.28
% 2.96/1.28 % ------ Schedule dynamic 5 is on
% 2.96/1.28
% 2.96/1.28 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.96/1.28
% 2.96/1.28
% 2.96/1.28 % ------
% 2.96/1.28 % Current options:
% 2.96/1.28 % ------
% 2.96/1.28
% 2.96/1.28
% 2.96/1.28 %
% 2.96/1.28
% 2.96/1.28 % ------ Proving...
% 2.96/1.28 %
% 2.96/1.28
% 2.96/1.28 % SZS status Theorem for theBenchmark.p
% 2.96/1.28
% 2.96/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.96/1.28
% 2.96/1.28
%------------------------------------------------------------------------------