%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : RNG086+2 : 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 : n008.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:47 PM UTC 2026
% Result : Theorem 3.43s 1.47s
% Output : CNFRefutation 3.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of formulae : 17 ( 7 unt; 0 def)
% Number of atoms : 54 ( 14 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 52 ( 15 ~; 9 |; 28 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 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 : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 20 ( 0 sgn 8 !; 12 ?; 4 :)
% Comments :
%------------------------------------------------------------------------------
fof(f26,axiom,
( aElement0(xz)
& aElementOf0(xy,sdtpldt1(xI,xJ))
& ? [X0,X1] :
( sdtpldt0(X0,X1) = xy
& aElementOf0(X1,xJ)
& aElementOf0(X0,xI) )
& aElementOf0(xx,sdtpldt1(xI,xJ))
& ? [X0,X1] :
( sdtpldt0(X0,X1) = xx
& aElementOf0(X1,xJ)
& aElementOf0(X0,xI) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__901) ).
fof(f27,conjecture,
? [X0,X1] :
( xx = sdtpldt0(X0,X1)
& aElementOf0(X1,xJ)
& aElementOf0(X0,xI) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f28,negated_conjecture,
~ ? [X0,X1] :
( xx = sdtpldt0(X0,X1)
& aElementOf0(X1,xJ)
& aElementOf0(X0,xI) ),
inference(negated_conjecture,[status(cth)],[f27]) ).
fof(f34,plain,
( aElement0(xz)
& aElementOf0(xy,sdtpldt1(xI,xJ))
& ? [X2,X3] :
( xy = sdtpldt0(X2,X3)
& aElementOf0(X3,xJ)
& aElementOf0(X2,xI) )
& aElementOf0(xx,sdtpldt1(xI,xJ))
& ? [X0,X1] :
( sdtpldt0(X0,X1) = xx
& aElementOf0(X1,xJ)
& aElementOf0(X0,xI) ) ),
inference(rectify,[],[f26]) ).
fof(f67,plain,
! [X0,X1] :
( sdtpldt0(X0,X1) != xx
| ~ aElementOf0(X1,xJ)
| ~ aElementOf0(X0,xI) ),
inference(ennf_transformation,[],[f28]) ).
fof(f82,plain,
( aElement0(xz)
& aElementOf0(xy,sdtpldt1(xI,xJ))
& xy = sdtpldt0(sK12,sK13)
& aElementOf0(sK13,xJ)
& aElementOf0(sK12,xI)
& aElementOf0(xx,sdtpldt1(xI,xJ))
& xx = sdtpldt0(sK10,sK11)
& aElementOf0(sK11,xJ)
& aElementOf0(sK10,xI) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK10,sK11,sK12,sK13]),skolemize(X0,sK10),skolemize(X1,sK11),skolemize(X2,sK12),skolemize(X3,sK13)],[f34]) ).
fof(f147,plain,
xx = sdtpldt0(sK10,sK11),
inference(cnf_transformation,[],[f82]) ).
fof(f148,plain,
aElementOf0(sK11,xJ),
inference(cnf_transformation,[],[f82]) ).
fof(f149,plain,
aElementOf0(sK10,xI),
inference(cnf_transformation,[],[f82]) ).
fof(f150,plain,
! [X0,X1] :
( sdtpldt0(X0,X1) != xx
| ~ aElementOf0(X1,xJ)
| ~ aElementOf0(X0,xI) ),
inference(cnf_transformation,[],[f67]) ).
tcf(c_107,plain,
aElementOf0(sK10,xI),
inference(cnf_transformation,[],[f149]) ).
tcf(c_108,plain,
aElementOf0(sK11,xJ),
inference(cnf_transformation,[],[f148]) ).
tcf(c_109,plain,
sdtpldt0(sK10,sK11) = xx,
inference(cnf_transformation,[],[f147]) ).
tcf(c_116,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ aElementOf0(X1,xJ)
| ~ aElementOf0(X0,xI)
| ( sdtpldt0(X0,X1) != xx ) ),
inference(cnf_transformation,[],[f150]) ).
tcf(c_2926,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ aElementOf0(X1,xJ)
| ~ aElementOf0(X0,xI)
| ( sdtpldt0(X0,X1) != xx ) ),
inference(demodulation,[status(thm)],[c_116]) ).
tcf(c_3789,plain,
( ~ aElementOf0(sK11,xJ)
| ~ aElementOf0(sK10,xI) ),
inference(superposition,[status(thm)],[c_109,c_2926]) ).
tcf(c_3790,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_3789,c_108,c_107]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : RNG086+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.56 % Computer : n008.cluster.edu
% 0.12/0.56 % Model : x86_64 x86_64
% 0.12/0.56 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.56 % Memory : 8046.5625MB
% 0.12/0.56 % OS : Linux 6.8.0-71-generic
% 0.12/0.56 % CPULimit : 300
% 0.12/0.56 % WCLimit : 300
% 0.12/0.56 % DateTime : Thu Sep 24 08:10:11 UTC 2026
% 0.12/0.56 % CPUTime :
% 0.14/0.56 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/0.60 Running first-order theorem proving
% 0.14/0.60 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.14/0.61
% 0.14/0.61 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.61
% 0.14/0.61 % Detected problem language: tptp
% 0.14/0.62 % Proving...
% 3.43/1.47 % SZS status Started for theBenchmark.p
% 3.43/1.47 % SZS status Theorem for theBenchmark.p
% 3.43/1.47
% 3.43/1.47 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.43/1.47
% 3.43/1.47 % ------ iProver source info
% 3.43/1.47
% 3.43/1.47 % git: date: 2026-07-19 20:42:38 +0200
% 3.43/1.47 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.43/1.47 % git: non_committed_changes: false
% 3.43/1.47
% 3.43/1.47 % ------ Parsing...
% 3.43/1.47 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.43/1.47
% 3.43/1.47 % ------ 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.43/1.47
% 3.43/1.47 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.43/1.47
% 3.43/1.47 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.43/1.47 % ------ Proving...
% 3.43/1.47 % ------ Problem Properties
% 3.43/1.47
% 3.43/1.47 %
% 3.43/1.47 % clauses 62
% 3.43/1.47 % conjectures 1
% 3.43/1.47 % EPR 12
% 3.43/1.47 % Horn 53
% 3.43/1.47 % unary 14
% 3.43/1.47 % binary 12
% 3.43/1.47 % lits 182
% 3.43/1.47 % lits eq 34
% 3.43/1.47 % fd_pure 0
% 3.43/1.47 % fd_pseudo 0
% 3.43/1.47 % fd_cond 1
% 3.43/1.47 % fd_pseudo_cond 8
% 3.43/1.47 % AC symbols 0
% 3.43/1.47
% 3.43/1.47 % ------ Schedule dynamic 5 is on
% 3.43/1.47
% 3.43/1.47 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.43/1.47
% 3.43/1.47
% 3.43/1.47 % ------
% 3.43/1.47 % Current options:
% 3.43/1.47 % ------
% 3.43/1.47
% 3.43/1.47
% 3.43/1.47 %
% 3.43/1.47
% 3.43/1.47 % ------ Proving...
% 3.43/1.47 %
% 3.43/1.47
% 3.43/1.47 % SZS status Theorem for theBenchmark.p
% 3.43/1.47
% 3.43/1.47 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.43/1.47
% 3.43/1.47
%------------------------------------------------------------------------------