%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUN069+2 : 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 2.39s 1.30s
% Output : CNFRefutation 2.39s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f77ERROR: Could not build tree for root c_901ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
? [X0] :
! [X1] :
( ( X1 = X0
& r1(X1) )
| ( X1 != X0
& ~ r1(X1) ) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/NUM008+0.ax',axiom_2) ).
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(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(f67,plain,
r1(sK0),
inference(equality_resolution,[],[f25]) ).
fof(f69,plain,
! [X0] : r2(X0,sK1(X0)),
inference(equality_resolution,[],[f29]) ).
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_77,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ r1(X0)
| ~ r2(X0,X1) ),
inference(cnf_transformation,[],[f77]) ).
tcf(c_680,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ r1(X0)
| ~ r2(X0,X1) ),
inference(demodulation,[status(thm)],[c_77]) ).
tcf(c_900,plain,
! [X0: $i] : ~ r1(X0),
inference(superposition,[status(thm)],[c_52,c_680]) ).
tcf(c_901,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_50,c_900]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUN069+2 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.38 % Computer : n007.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Thu Sep 24 05:51:23 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 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.12/0.43
% 0.12/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.43
% 0.12/0.43 % Detected problem language: tptp
% 0.12/0.45 % Proving...
% 2.39/1.30 % SZS status Started for theBenchmark.p
% 2.39/1.30 % SZS status Theorem for theBenchmark.p
% 2.39/1.30
% 2.39/1.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.39/1.30
% 2.39/1.30 % ------ iProver source info
% 2.39/1.30
% 2.39/1.30 % git: date: 2026-07-19 20:42:38 +0200
% 2.39/1.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.39/1.30 % git: non_committed_changes: false
% 2.39/1.30
% 2.39/1.30 % ------ Parsing...
% 2.39/1.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.39/1.30
% 2.39/1.30 % ------ Preprocessing... sup_sim: 1 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 2 sf_s rm: 3 0s sf_e pe_s pe_e %
% 2.39/1.30
% 2.39/1.30 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.39/1.30
% 2.39/1.30 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.39/1.30 % ------ Proving...
% 2.39/1.30 % ------ Problem Properties
% 2.39/1.30
% 2.39/1.30 %
% 2.39/1.30 % clauses 25
% 2.39/1.30 % conjectures 1
% 2.39/1.30 % EPR 5
% 2.39/1.30 % Horn 21
% 2.39/1.30 % unary 16
% 2.39/1.30 % binary 8
% 2.39/1.30 % lits 35
% 2.39/1.30 % lits eq 15
% 2.39/1.30 % fd_pure 0
% 2.39/1.30 % fd_pseudo 0
% 2.39/1.30 % fd_cond 1
% 2.39/1.30 % fd_pseudo_cond 2
% 2.39/1.30 % AC symbols 0
% 2.39/1.30
% 2.39/1.30 % ------ Schedule dynamic 5 is on
% 2.39/1.30
% 2.39/1.30 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.39/1.30
% 2.39/1.30
% 2.39/1.30 % ------
% 2.39/1.30 % Current options:
% 2.39/1.30 % ------
% 2.39/1.30
% 2.39/1.30
% 2.39/1.30 %
% 2.39/1.30
% 2.39/1.30 % ------ Proving...
% 2.39/1.30 %
% 2.39/1.30
% 2.39/1.30 % SZS status Theorem for theBenchmark.p
% 2.39/1.30
% 2.39/1.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.39/1.30
% 2.39/1.30
%------------------------------------------------------------------------------