%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : RNG121+4 : 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 : n004.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:39:13 PM UTC 2026
% Result : Theorem 3.62s 1.29s
% Output : CNFRefutation 3.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 28 ( 12 unt; 2 def)
% Number of atoms : 107 ( 32 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 94 ( 23 ~; 20 |; 50 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 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 : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-2 aty)
% Number of variables : 34 ( 0 sgn 14 !; 20 ?; 5 :)
% Comments :
%------------------------------------------------------------------------------
fof(f9,axiom,
! [X0] :
( aElement0(X0)
=> ( X0 = sdtpldt0(sz00,X0)
& sdtpldt0(X0,sz00) = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mAddZero) ).
fof(f39,axiom,
( aElement0(xb)
& aElement0(xa) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2091) ).
fof(f43,axiom,
( aElementOf0(xb,slsdtgt0(xb))
& ? [X0] :
( sdtasdt0(xb,X0) = xb
& aElement0(X0) )
& aElementOf0(sz00,slsdtgt0(xb))
& ? [X0] :
( sdtasdt0(xb,X0) = sz00
& aElement0(X0) )
& aElementOf0(xa,slsdtgt0(xa))
& ? [X0] :
( sdtasdt0(xa,X0) = xa
& aElement0(X0) )
& aElementOf0(sz00,slsdtgt0(xa))
& ? [X0] :
( sdtasdt0(xa,X0) = sz00
& aElement0(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2203) ).
fof(f53,conjecture,
( aElementOf0(xb,xI)
| ? [X0,X1] :
( sdtpldt0(X0,X1) = xb
& aElementOf0(X1,slsdtgt0(xb))
& aElementOf0(X0,slsdtgt0(xa)) )
| ? [X0,X1] :
( sdtpldt0(X0,X1) = xb
& aElementOf0(X1,slsdtgt0(xb))
& aElementOf0(X0,slsdtgt0(xa)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f54,negated_conjecture,
~ ( aElementOf0(xb,xI)
| ? [X0,X1] :
( sdtpldt0(X0,X1) = xb
& aElementOf0(X1,slsdtgt0(xb))
& aElementOf0(X0,slsdtgt0(xa)) )
| ? [X0,X1] :
( sdtpldt0(X0,X1) = xb
& aElementOf0(X1,slsdtgt0(xb))
& aElementOf0(X0,slsdtgt0(xa)) ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f64,plain,
( aElementOf0(xb,slsdtgt0(xb))
& ? [X3] :
( xb = sdtasdt0(xb,X3)
& aElement0(X3) )
& aElementOf0(sz00,slsdtgt0(xb))
& ? [X2] :
( sz00 = sdtasdt0(xb,X2)
& aElement0(X2) )
& aElementOf0(xa,slsdtgt0(xa))
& ? [X1] :
( xa = sdtasdt0(xa,X1)
& aElement0(X1) )
& aElementOf0(sz00,slsdtgt0(xa))
& ? [X0] :
( sdtasdt0(xa,X0) = sz00
& aElement0(X0) ) ),
inference(rectify,[],[f43]) ).
fof(f69,plain,
~ ( aElementOf0(xb,xI)
| ? [X2,X3] :
( xb = sdtpldt0(X2,X3)
& aElementOf0(X3,slsdtgt0(xb))
& aElementOf0(X2,slsdtgt0(xa)) )
| ? [X0,X1] :
( sdtpldt0(X0,X1) = xb
& aElementOf0(X1,slsdtgt0(xb))
& aElementOf0(X0,slsdtgt0(xa)) ) ),
inference(rectify,[],[f54]) ).
fof(f80,plain,
! [X0] :
( ~ aElement0(X0)
| ( X0 = sdtpldt0(sz00,X0)
& sdtpldt0(X0,sz00) = X0 ) ),
inference(ennf_transformation,[],[f9]) ).
fof(f127,plain,
( ~ aElementOf0(xb,xI)
& ! [X2,X3] :
( xb != sdtpldt0(X2,X3)
| ~ aElementOf0(X3,slsdtgt0(xb))
| ~ aElementOf0(X2,slsdtgt0(xa)) )
& ! [X0,X1] :
( sdtpldt0(X0,X1) != xb
| ~ aElementOf0(X1,slsdtgt0(xb))
| ~ aElementOf0(X0,slsdtgt0(xa)) ) ),
inference(ennf_transformation,[],[f69]) ).
fof(f178,plain,
( aElementOf0(xb,slsdtgt0(xb))
& xb = sdtasdt0(xb,sK35)
& aElement0(sK35)
& aElementOf0(sz00,slsdtgt0(xb))
& sz00 = sdtasdt0(xb,sK34)
& aElement0(sK34)
& aElementOf0(xa,slsdtgt0(xa))
& xa = sdtasdt0(xa,sK33)
& aElement0(sK33)
& aElementOf0(sz00,slsdtgt0(xa))
& sz00 = sdtasdt0(xa,sK32)
& aElement0(sK32) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK32,sK33,sK34,sK35]),skolemize(X0,sK32),skolemize(X1,sK33),skolemize(X2,sK34),skolemize(X3,sK35)],[f64]) ).
fof(f195,plain,
! [X0] :
( ~ aElement0(X0)
| sdtpldt0(sz00,X0) = X0 ),
inference(cnf_transformation,[],[f80]) ).
fof(f279,plain,
aElement0(xb),
inference(cnf_transformation,[],[f39]) ).
fof(f317,plain,
aElementOf0(xb,slsdtgt0(xb)),
inference(cnf_transformation,[],[f178]) ).
fof(f326,plain,
aElementOf0(sz00,slsdtgt0(xa)),
inference(cnf_transformation,[],[f178]) ).
fof(f371,plain,
! [X2,X3] :
( xb != sdtpldt0(X2,X3)
| ~ aElementOf0(X3,slsdtgt0(xb))
| ~ aElementOf0(X2,slsdtgt0(xa)) ),
inference(cnf_transformation,[],[f127]) ).
tcf(c_57,plain,
! [X0: $i] :
( ( sdtpldt0(sz00,X0) = X0 )
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f195]) ).
tcf(c_141,plain,
aElement0(xb),
inference(cnf_transformation,[],[f279]) ).
tcf(c_180,plain,
aElementOf0(sz00,slsdtgt0(xa)),
inference(cnf_transformation,[],[f326]) ).
tcf(c_189,plain,
aElementOf0(xb,slsdtgt0(xb)),
inference(cnf_transformation,[],[f317]) ).
tcf(c_232,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ aElementOf0(X1,slsdtgt0(xb))
| ~ aElementOf0(X0,slsdtgt0(xa))
| ( sdtpldt0(X0,X1) != xb ) ),
inference(cnf_transformation,[],[f371]) ).
tcf(c_7798,definition,
iPr_def_10 = slsdtgt0(xa),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_7799,definition,
iPr_def_11 = slsdtgt0(xb),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_7801,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ aElementOf0(X1,iPr_def_11)
| ~ aElementOf0(X0,iPr_def_10)
| ( sdtpldt0(X0,X1) != xb ) ),
inference(demodulation,[status(thm)],[c_232,c_7799,c_7798]) ).
tcf(c_9870,plain,
aElementOf0(sz00,iPr_def_10),
inference(light_normalisation,[status(thm)],[c_180,c_7798]) ).
tcf(c_9873,plain,
aElementOf0(xb,iPr_def_11),
inference(light_normalisation,[status(thm)],[c_189,c_7799]) ).
tcf(c_10049,plain,
sdtpldt0(sz00,xb) = xb,
inference(superposition,[status(thm)],[c_141,c_57]) ).
tcf(c_11201,plain,
( ~ aElementOf0(xb,iPr_def_11)
| ~ aElementOf0(sz00,iPr_def_10) ),
inference(superposition,[status(thm)],[c_10049,c_7801]) ).
tcf(c_11202,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_11201,c_9873,c_9870]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : RNG121+4 : 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.37 % Computer : n004.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Thu Sep 24 08:20:35 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/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.10/0.42
% 0.10/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.42
% 0.10/0.42 % Detected problem language: tptp
% 0.10/0.43 % Proving...
% 3.62/1.29 % SZS status Started for theBenchmark.p
% 3.62/1.29 % SZS status Theorem for theBenchmark.p
% 3.62/1.29
% 3.62/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.62/1.29
% 3.62/1.29 % ------ iProver source info
% 3.62/1.29
% 3.62/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 3.62/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.62/1.29 % git: non_committed_changes: false
% 3.62/1.29
% 3.62/1.29 % ------ Parsing...
% 3.62/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.62/1.29
% 3.62/1.29 % ------ Preprocessing... sup_sim: 2 sf_s rm: 2 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.62/1.29
% 3.62/1.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.62/1.29
% 3.62/1.29 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.62/1.29 % ------ Proving...
% 3.62/1.29 % ------ Problem Properties
% 3.62/1.29
% 3.62/1.29 %
% 3.62/1.29 % clauses 173
% 3.62/1.29 % conjectures 2
% 3.62/1.29 % EPR 48
% 3.62/1.29 % Horn 146
% 3.62/1.29 % unary 60
% 3.62/1.29 % binary 33
% 3.62/1.29 % lits 457
% 3.62/1.29 % lits eq 76
% 3.62/1.29 % fd_pure 0
% 3.62/1.29 % fd_pseudo 0
% 3.62/1.29 % fd_cond 5
% 3.62/1.29 % fd_pseudo_cond 11
% 3.62/1.29 % AC symbols 0
% 3.62/1.29
% 3.62/1.29 % ------ Schedule dynamic 5 is on
% 3.62/1.29
% 3.62/1.29 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.62/1.29
% 3.62/1.29
% 3.62/1.29 % ------
% 3.62/1.29 % Current options:
% 3.62/1.29 % ------
% 3.62/1.29
% 3.62/1.29
% 3.62/1.29 %
% 3.62/1.29
% 3.62/1.29 % ------ Proving...
% 3.62/1.29 %
% 3.62/1.29
% 3.62/1.29 % SZS status Theorem for theBenchmark.p
% 3.62/1.29
% 3.62/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.62/1.29
% 3.62/1.29
%------------------------------------------------------------------------------