%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : RNG102+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/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:38:56 PM UTC 2026
% Result : Theorem 3.76s 1.28s
% Output : CNFRefutation 3.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 28 ( 6 unt; 0 def)
% Number of atoms : 129 ( 41 equ)
% Maximal formula atoms : 17 ( 4 avg)
% Number of connectives : 167 ( 66 ~; 64 |; 32 &)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Maximal term depth : 3 ( 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-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 57 ( 0 sgn 44 !; 13 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
fof(f37,axiom,
! [X0] :
( aElement0(X0)
=> ! [X1] :
( X1 = slsdtgt0(X0)
<=> ( ! [X2] :
( aElementOf0(X2,X1)
<=> ? [X3] :
( sdtasdt0(X0,X3) = X2
& aElement0(X3) ) )
& aSet0(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefPrIdeal) ).
fof(f38,axiom,
aElement0(xc),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1905) ).
fof(f39,axiom,
( aElement0(xz)
& aElementOf0(xy,slsdtgt0(xc))
& aElementOf0(xx,slsdtgt0(xc)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1933) ).
fof(f41,conjecture,
? [X0] :
( sdtasdt0(xc,X0) = xy
& aElement0(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f42,negated_conjecture,
~ ? [X0] :
( sdtasdt0(xc,X0) = xy
& aElement0(X0) ),
inference(negated_conjecture,[status(cth)],[f41]) ).
fof(f99,plain,
! [X0] :
( ~ aElement0(X0)
| ! [X1] :
( X1 = slsdtgt0(X0)
<=> ( ! [X2] :
( aElementOf0(X2,X1)
<=> ? [X3] :
( sdtasdt0(X0,X3) = X2
& aElement0(X3) ) )
& aSet0(X1) ) ) ),
inference(ennf_transformation,[],[f37]) ).
fof(f100,plain,
! [X0] :
( xy != sdtasdt0(xc,X0)
| ~ aElement0(X0) ),
inference(ennf_transformation,[],[f42]) ).
fof(f133,plain,
! [X0] :
( ~ aElement0(X0)
| ! [X1] :
( ( slsdtgt0(X0) != X1
| ( ! [X2] :
( ( ~ aElementOf0(X2,X1)
| ? [X3] :
( sdtasdt0(X0,X3) = X2
& aElement0(X3) ) )
& ( ! [X3] :
( sdtasdt0(X0,X3) != X2
| ~ aElement0(X3) )
| aElementOf0(X2,X1) ) )
& aSet0(X1) ) )
& ( ? [X2] :
( ( aElementOf0(X2,X1)
| ? [X3] :
( sdtasdt0(X0,X3) = X2
& aElement0(X3) ) )
& ( ~ aElementOf0(X2,X1)
| ! [X3] :
( sdtasdt0(X0,X3) != X2
| ~ aElement0(X3) ) ) )
| ~ aSet0(X1)
| X1 = slsdtgt0(X0) ) ) ),
inference(nnf_transformation,[],[f99]) ).
fof(f134,plain,
! [X0] :
( ~ aElement0(X0)
| ! [X1] :
( ( slsdtgt0(X0) != X1
| ( ! [X2] :
( ( ~ aElementOf0(X2,X1)
| ? [X3] :
( sdtasdt0(X0,X3) = X2
& aElement0(X3) ) )
& ( ! [X3] :
( sdtasdt0(X0,X3) != X2
| ~ aElement0(X3) )
| aElementOf0(X2,X1) ) )
& aSet0(X1) ) )
& ( ? [X2] :
( ( aElementOf0(X2,X1)
| ? [X3] :
( sdtasdt0(X0,X3) = X2
& aElement0(X3) ) )
& ( ~ aElementOf0(X2,X1)
| ! [X3] :
( sdtasdt0(X0,X3) != X2
| ~ aElement0(X3) ) ) )
| ~ aSet0(X1)
| X1 = slsdtgt0(X0) ) ) ),
inference(flattening,[],[f133]) ).
fof(f135,plain,
! [X0] :
( ~ aElement0(X0)
| ! [X1] :
( ( slsdtgt0(X0) != X1
| ( ! [X5] :
( ( ~ aElementOf0(X5,X1)
| ? [X7] :
( sdtasdt0(X0,X7) = X5
& aElement0(X7) ) )
& ( ! [X6] :
( sdtasdt0(X0,X6) != X5
| ~ aElement0(X6) )
| aElementOf0(X5,X1) ) )
& aSet0(X1) ) )
& ( ? [X2] :
( ( aElementOf0(X2,X1)
| ? [X4] :
( sdtasdt0(X0,X4) = X2
& aElement0(X4) ) )
& ( ~ aElementOf0(X2,X1)
| ! [X3] :
( sdtasdt0(X0,X3) != X2
| ~ aElement0(X3) ) ) )
| ~ aSet0(X1)
| X1 = slsdtgt0(X0) ) ) ),
inference(rectify,[],[f134]) ).
fof(f136,plain,
! [X0] :
( ~ aElement0(X0)
| ! [X1] :
( ( slsdtgt0(X0) != X1
| ( ! [X5] :
( ( ~ aElementOf0(X5,X1)
| ( sdtasdt0(X0,sK21(X0,X5)) = X5
& aElement0(sK21(X0,X5)) ) )
& ( ! [X6] :
( sdtasdt0(X0,X6) != X5
| ~ aElement0(X6) )
| aElementOf0(X5,X1) ) )
& aSet0(X1) ) )
& ( ( ( aElementOf0(sK19(X0,X1),X1)
| ( sK19(X0,X1) = sdtasdt0(X0,sK20(X0,X1))
& aElement0(sK20(X0,X1)) ) )
& ( ~ aElementOf0(sK19(X0,X1),X1)
| ! [X3] :
( sdtasdt0(X0,X3) != sK19(X0,X1)
| ~ aElement0(X3) ) ) )
| ~ aSet0(X1)
| X1 = slsdtgt0(X0) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK19,sK20,sK21]),skolemize(X2,sK19(X0,X1)),skolemize(X4,sK20(X0,X1)),skolemize(X7,sK21(X0,X5))],[f135]) ).
fof(f219,plain,
! [X0,X1,X5] :
( ~ aElement0(X0)
| slsdtgt0(X0) != X1
| ~ aElementOf0(X5,X1)
| sdtasdt0(X0,sK21(X0,X5)) = X5 ),
inference(cnf_transformation,[],[f136]) ).
fof(f220,plain,
! [X0,X1,X5] :
( ~ aElement0(X0)
| slsdtgt0(X0) != X1
| ~ aElementOf0(X5,X1)
| aElement0(sK21(X0,X5)) ),
inference(cnf_transformation,[],[f136]) ).
fof(f226,plain,
aElement0(xc),
inference(cnf_transformation,[],[f38]) ).
fof(f228,plain,
aElementOf0(xy,slsdtgt0(xc)),
inference(cnf_transformation,[],[f39]) ).
fof(f232,plain,
! [X0] :
( xy != sdtasdt0(xc,X0)
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f100]) ).
fof(f243,plain,
! [X0,X5] :
( ~ aElement0(X0)
| ~ aElementOf0(X5,slsdtgt0(X0))
| aElement0(sK21(X0,X5)) ),
inference(equality_resolution,[],[f220]) ).
fof(f244,plain,
! [X0,X5] :
( ~ aElement0(X0)
| ~ aElementOf0(X5,slsdtgt0(X0))
| sdtasdt0(X0,sK21(X0,X5)) = X5 ),
inference(equality_resolution,[],[f219]) ).
tcf(c_136,plain,
! [X0: $i,X1: $i] :
( aElement0(sK21(X1,X0))
| ~ aElement0(X1)
| ~ aElementOf0(X0,slsdtgt0(X1)) ),
inference(cnf_transformation,[],[f243]) ).
tcf(c_137,plain,
! [X0: $i,X1: $i] :
( ( sdtasdt0(X1,sK21(X1,X0)) = X0 )
| ~ aElement0(X1)
| ~ aElementOf0(X0,slsdtgt0(X1)) ),
inference(cnf_transformation,[],[f244]) ).
tcf(c_138,plain,
aElement0(xc),
inference(cnf_transformation,[],[f226]) ).
tcf(c_140,plain,
aElementOf0(xy,slsdtgt0(xc)),
inference(cnf_transformation,[],[f228]) ).
tcf(c_144,negated_conjecture,
! [X0: $i] :
( ~ aElement0(X0)
| ( sdtasdt0(xc,X0) != xy ) ),
inference(cnf_transformation,[],[f232]) ).
tcf(c_5101,negated_conjecture,
! [X0: $i] :
( ~ aElement0(X0)
| ( sdtasdt0(xc,X0) != xy ) ),
inference(demodulation,[status(thm)],[c_144]) ).
tcf(c_6966,plain,
( aElement0(sK21(xc,xy))
| ~ aElement0(xc)
| ~ aElementOf0(xy,slsdtgt0(xc)) ),
inference(instantiation,[status(thm)],[c_136]) ).
tcf(c_7067,plain,
( ( sdtasdt0(xc,sK21(xc,xy)) = xy )
| ~ aElement0(xc)
| ~ aElementOf0(xy,slsdtgt0(xc)) ),
inference(instantiation,[status(thm)],[c_137]) ).
tcf(c_7531,plain,
( ~ aElement0(sK21(xc,xy))
| ( sdtasdt0(xc,sK21(xc,xy)) != xy ) ),
inference(instantiation,[status(thm)],[c_5101]) ).
tcf(c_7532,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_7531,c_7067,c_6966,c_140,c_138]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : RNG102+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.36 % Computer : n007.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Thu Sep 24 08:12:37 UTC 2026
% 0.13/0.36 % CPUTime :
% 0.13/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/0.39 Running first-order theorem proving
% 0.13/0.39 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.13/0.41
% 0.13/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.41
% 0.13/0.41 % Detected problem language: tptp
% 0.13/0.42 % Proving...
% 3.76/1.28 % SZS status Started for theBenchmark.p
% 3.76/1.28 % SZS status Theorem for theBenchmark.p
% 3.76/1.28
% 3.76/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.76/1.28
% 3.76/1.28 % ------ iProver source info
% 3.76/1.28
% 3.76/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 3.76/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.76/1.28 % git: non_committed_changes: false
% 3.76/1.28
% 3.76/1.28 % ------ Parsing...
% 3.76/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.76/1.28
% 3.76/1.28 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e %
% 3.76/1.28
% 3.76/1.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.76/1.28
% 3.76/1.28 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.76/1.28 % ------ Proving...
% 3.76/1.28 % ------ Problem Properties
% 3.76/1.28
% 3.76/1.28 %
% 3.76/1.28 % clauses 91
% 3.76/1.28 % conjectures 1
% 3.76/1.28 % EPR 15
% 3.76/1.28 % Horn 68
% 3.76/1.28 % unary 9
% 3.76/1.28 % binary 15
% 3.76/1.28 % lits 327
% 3.76/1.28 % lits eq 44
% 3.76/1.28 % fd_pure 0
% 3.76/1.28 % fd_pseudo 0
% 3.76/1.28 % fd_cond 3
% 3.76/1.28 % fd_pseudo_cond 11
% 3.76/1.28 % AC symbols 0
% 3.76/1.28
% 3.76/1.28 % ------ Schedule dynamic 5 is on
% 3.76/1.28
% 3.76/1.28 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.76/1.28
% 3.76/1.28
% 3.76/1.28 % ------
% 3.76/1.28 % Current options:
% 3.76/1.28 % ------
% 3.76/1.28
% 3.76/1.28
% 3.76/1.28 %
% 3.76/1.28
% 3.76/1.28 % ------ Proving...
% 3.76/1.28 %
% 3.76/1.28
% 3.76/1.28 % SZS status Theorem for theBenchmark.p
% 3.76/1.28
% 3.76/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.76/1.28
% 3.76/1.28
%------------------------------------------------------------------------------