%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : RNG115+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 : n001.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:12 PM UTC 2026
% Result : Theorem 4.19s 1.28s
% Output : CNFRefutation 4.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 24 ( 11 unt; 2 def)
% Number of atoms : 113 ( 39 equ)
% Maximal formula atoms : 11 ( 4 avg)
% Number of connectives : 125 ( 44 ~; 31 |; 48 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 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 : 7 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 45 ( 0 sgn 21 !; 24 ?; 4 :)
% Comments :
%------------------------------------------------------------------------------
fof(f45,axiom,
( ! [X0] :
( ( X0 != sz00
& ( aElementOf0(X0,xI)
| ? [X1,X2] :
( sdtpldt0(X1,X2) = X0
& aElementOf0(X2,slsdtgt0(xb))
& aElementOf0(X1,slsdtgt0(xa)) ) ) )
=> ~ iLess0(sbrdtbr0(X0),sbrdtbr0(xu)) )
& xu != sz00
& aElementOf0(xu,xI)
& ? [X0,X1] :
( sdtpldt0(X0,X1) = xu
& aElementOf0(X1,slsdtgt0(xb))
& aElementOf0(X0,slsdtgt0(xa)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2273) ).
fof(f47,conjecture,
? [X0,X1] :
( xu = sdtpldt0(X0,X1)
& ( aElementOf0(X1,slsdtgt0(xb))
| ? [X2] :
( sdtasdt0(xb,X2) = X1
& aElement0(X2) ) )
& ( aElementOf0(X0,slsdtgt0(xa))
| ? [X2] :
( sdtasdt0(xa,X2) = X0
& aElement0(X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f48,negated_conjecture,
~ ? [X0,X1] :
( xu = sdtpldt0(X0,X1)
& ( aElementOf0(X1,slsdtgt0(xb))
| ? [X2] :
( sdtasdt0(xb,X2) = X1
& aElement0(X2) ) )
& ( aElementOf0(X0,slsdtgt0(xa))
| ? [X2] :
( sdtasdt0(xa,X2) = X0
& aElement0(X2) ) ) ),
inference(negated_conjecture,[status(cth)],[f47]) ).
fof(f60,plain,
( ! [X2] :
( ( sz00 != X2
& ( aElementOf0(X2,xI)
| ? [X3,X4] :
( sdtpldt0(X3,X4) = X2
& aElementOf0(X4,slsdtgt0(xb))
& aElementOf0(X3,slsdtgt0(xa)) ) ) )
=> ~ iLess0(sbrdtbr0(X2),sbrdtbr0(xu)) )
& xu != sz00
& aElementOf0(xu,xI)
& ? [X0,X1] :
( sdtpldt0(X0,X1) = xu
& aElementOf0(X1,slsdtgt0(xb))
& aElementOf0(X0,slsdtgt0(xa)) ) ),
inference(rectify,[],[f45]) ).
fof(f62,plain,
~ ? [X0,X1] :
( xu = sdtpldt0(X0,X1)
& ( aElementOf0(X1,slsdtgt0(xb))
| ? [X3] :
( sdtasdt0(xb,X3) = X1
& aElement0(X3) ) )
& ( aElementOf0(X0,slsdtgt0(xa))
| ? [X2] :
( sdtasdt0(xa,X2) = X0
& aElement0(X2) ) ) ),
inference(rectify,[],[f48]) ).
fof(f116,plain,
( ! [X2] :
( sz00 = X2
| ( ~ aElementOf0(X2,xI)
& ! [X3,X4] :
( sdtpldt0(X3,X4) != X2
| ~ aElementOf0(X4,slsdtgt0(xb))
| ~ aElementOf0(X3,slsdtgt0(xa)) ) )
| ~ iLess0(sbrdtbr0(X2),sbrdtbr0(xu)) )
& xu != sz00
& aElementOf0(xu,xI)
& ? [X0,X1] :
( sdtpldt0(X0,X1) = xu
& aElementOf0(X1,slsdtgt0(xb))
& aElementOf0(X0,slsdtgt0(xa)) ) ),
inference(ennf_transformation,[],[f60]) ).
fof(f117,plain,
( ! [X2] :
( sz00 = X2
| ( ~ aElementOf0(X2,xI)
& ! [X3,X4] :
( sdtpldt0(X3,X4) != X2
| ~ aElementOf0(X4,slsdtgt0(xb))
| ~ aElementOf0(X3,slsdtgt0(xa)) ) )
| ~ iLess0(sbrdtbr0(X2),sbrdtbr0(xu)) )
& xu != sz00
& aElementOf0(xu,xI)
& ? [X0,X1] :
( sdtpldt0(X0,X1) = xu
& aElementOf0(X1,slsdtgt0(xb))
& aElementOf0(X0,slsdtgt0(xa)) ) ),
inference(flattening,[],[f116]) ).
fof(f119,plain,
! [X0,X1] :
( sdtpldt0(X0,X1) != xu
| ( ~ aElementOf0(X1,slsdtgt0(xb))
& ! [X3] :
( sdtasdt0(xb,X3) != X1
| ~ aElement0(X3) ) )
| ( ~ aElementOf0(X0,slsdtgt0(xa))
& ! [X2] :
( sdtasdt0(xa,X2) != X0
| ~ aElement0(X2) ) ) ),
inference(ennf_transformation,[],[f62]) ).
fof(f174,plain,
( ! [X2] :
( sz00 = X2
| ( ~ aElementOf0(X2,xI)
& ! [X3,X4] :
( sdtpldt0(X3,X4) != X2
| ~ aElementOf0(X4,slsdtgt0(xb))
| ~ aElementOf0(X3,slsdtgt0(xa)) ) )
| ~ iLess0(sbrdtbr0(X2),sbrdtbr0(xu)) )
& xu != sz00
& aElementOf0(xu,xI)
& xu = sdtpldt0(sK41,sK42)
& aElementOf0(sK42,slsdtgt0(xb))
& aElementOf0(sK41,slsdtgt0(xa)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK41,sK42]),skolemize(X0,sK41),skolemize(X1,sK42)],[f117]) ).
fof(f333,plain,
xu = sdtpldt0(sK41,sK42),
inference(cnf_transformation,[],[f174]) ).
fof(f334,plain,
aElementOf0(sK42,slsdtgt0(xb)),
inference(cnf_transformation,[],[f174]) ).
fof(f335,plain,
aElementOf0(sK41,slsdtgt0(xa)),
inference(cnf_transformation,[],[f174]) ).
fof(f342,plain,
! [X0,X1] :
( sdtpldt0(X0,X1) != xu
| ~ aElementOf0(X1,slsdtgt0(xb))
| ~ aElementOf0(X0,slsdtgt0(xa)) ),
inference(cnf_transformation,[],[f119]) ).
tcf(c_201,plain,
aElementOf0(sK41,slsdtgt0(xa)),
inference(cnf_transformation,[],[f335]) ).
tcf(c_202,plain,
aElementOf0(sK42,slsdtgt0(xb)),
inference(cnf_transformation,[],[f334]) ).
tcf(c_203,plain,
sdtpldt0(sK41,sK42) = xu,
inference(cnf_transformation,[],[f333]) ).
tcf(c_217,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ aElementOf0(X1,slsdtgt0(xb))
| ~ aElementOf0(X0,slsdtgt0(xa))
| ( sdtpldt0(X0,X1) != xu ) ),
inference(cnf_transformation,[],[f342]) ).
tcf(c_8003,definition,
iPr_def_10 = slsdtgt0(xa),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_8004,definition,
iPr_def_11 = slsdtgt0(xb),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_8005,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ aElementOf0(X1,iPr_def_11)
| ~ aElementOf0(X0,iPr_def_10)
| ( sdtpldt0(X0,X1) != xu ) ),
inference(demodulation,[status(thm)],[c_217,c_8004,c_8003]) ).
tcf(c_10115,plain,
aElementOf0(sK41,iPr_def_10),
inference(light_normalisation,[status(thm)],[c_201,c_8003]) ).
tcf(c_10116,plain,
aElementOf0(sK42,iPr_def_11),
inference(light_normalisation,[status(thm)],[c_202,c_8004]) ).
tcf(c_10231,plain,
( ~ aElementOf0(sK42,iPr_def_11)
| ~ aElementOf0(sK41,iPr_def_10) ),
inference(superposition,[status(thm)],[c_203,c_8005]) ).
tcf(c_10232,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_10231,c_10116,c_10115]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : RNG115+4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.03 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.36 % Computer : n001.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:24:37 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.40 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...
% 4.19/1.28 % SZS status Started for theBenchmark.p
% 4.19/1.28 % SZS status Theorem for theBenchmark.p
% 4.19/1.28
% 4.19/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.19/1.28
% 4.19/1.28 % ------ iProver source info
% 4.19/1.28
% 4.19/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 4.19/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.19/1.28 % git: non_committed_changes: false
% 4.19/1.28
% 4.19/1.28 % ------ Parsing...
% 4.19/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.19/1.28
% 4.19/1.28 % ------ Preprocessing... sup_sim: 1 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 %
% 4.19/1.28
% 4.19/1.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.19/1.28
% 4.19/1.28 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.19/1.28 % ------ Proving...
% 4.19/1.28 % ------ Problem Properties
% 4.19/1.28
% 4.19/1.28 %
% 4.19/1.28 % clauses 163
% 4.19/1.28 % conjectures 4
% 4.19/1.28 % EPR 42
% 4.19/1.28 % Horn 136
% 4.19/1.28 % unary 42
% 4.19/1.28 % binary 36
% 4.19/1.28 % lits 460
% 4.19/1.28 % lits eq 75
% 4.19/1.28 % fd_pure 0
% 4.19/1.28 % fd_pseudo 0
% 4.19/1.28 % fd_cond 5
% 4.19/1.28 % fd_pseudo_cond 11
% 4.19/1.28 % AC symbols 0
% 4.19/1.28
% 4.19/1.28 % ------ Schedule dynamic 5 is on
% 4.19/1.28
% 4.19/1.28 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.19/1.28
% 4.19/1.28
% 4.19/1.28 % ------
% 4.19/1.28 % Current options:
% 4.19/1.28 % ------
% 4.19/1.28
% 4.19/1.28
% 4.19/1.28 %
% 4.19/1.28
% 4.19/1.28 % ------ Proving...
% 4.19/1.28 %
% 4.19/1.28
% 4.19/1.28 % SZS status Theorem for theBenchmark.p
% 4.19/1.28
% 4.19/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.19/1.28
% 4.19/1.28
%------------------------------------------------------------------------------