%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : RNG095+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 : 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:38:50 PM UTC 2026
% Result : Theorem 1.82s 1.29s
% Output : CNFRefutation 1.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 24 ( 7 unt; 0 def)
% Number of atoms : 56 ( 12 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 59 ( 27 ~; 18 |; 13 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 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 : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 25 ( 0 sgn 17 !; 8 ?; 7 :)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
aElement0(sz10),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsC_01) ).
fof(f29,axiom,
! [X0] :
( aElement0(X0)
=> ( aElementOf0(X0,sdtpldt1(xI,xJ))
& ? [X1,X2] :
( sdtpldt0(X1,X2) = X0
& aElementOf0(X2,xJ)
& aElementOf0(X1,xI) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1205_03) ).
fof(f31,conjecture,
? [X0,X1] :
( sdtpldt0(X0,X1) = sz10
& aElementOf0(X1,xJ)
& aElementOf0(X0,xI) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f32,negated_conjecture,
~ ? [X0,X1] :
( sdtpldt0(X0,X1) = sz10
& aElementOf0(X1,xJ)
& aElementOf0(X0,xI) ),
inference(negated_conjecture,[status(cth)],[f31]) ).
fof(f75,plain,
! [X0] :
( ~ aElement0(X0)
| ( aElementOf0(X0,sdtpldt1(xI,xJ))
& ? [X1,X2] :
( sdtpldt0(X1,X2) = X0
& aElementOf0(X2,xJ)
& aElementOf0(X1,xI) ) ) ),
inference(ennf_transformation,[],[f29]) ).
fof(f76,plain,
! [X0,X1] :
( sz10 != sdtpldt0(X0,X1)
| ~ aElementOf0(X1,xJ)
| ~ aElementOf0(X0,xI) ),
inference(ennf_transformation,[],[f32]) ).
fof(f96,plain,
! [X0] :
( ~ aElement0(X0)
| ( aElementOf0(X0,sdtpldt1(xI,xJ))
& sdtpldt0(sK13(X0),sK14(X0)) = X0
& aElementOf0(sK14(X0),xJ)
& aElementOf0(sK13(X0),xI) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK13,sK14]),skolemize(X1,sK13(X0)),skolemize(X2,sK14(X0))],[f75]) ).
fof(f98,plain,
aElement0(sz10),
inference(cnf_transformation,[],[f3]) ).
fof(f165,plain,
! [X0] :
( ~ aElement0(X0)
| sdtpldt0(sK13(X0),sK14(X0)) = X0 ),
inference(cnf_transformation,[],[f96]) ).
fof(f166,plain,
! [X0] :
( ~ aElement0(X0)
| aElementOf0(sK14(X0),xJ) ),
inference(cnf_transformation,[],[f96]) ).
fof(f167,plain,
! [X0] :
( ~ aElement0(X0)
| aElementOf0(sK13(X0),xI) ),
inference(cnf_transformation,[],[f96]) ).
fof(f170,plain,
! [X0,X1] :
( sz10 != sdtpldt0(X0,X1)
| ~ aElementOf0(X1,xJ)
| ~ aElementOf0(X0,xI) ),
inference(cnf_transformation,[],[f76]) ).
tcf(c_50,plain,
aElement0(sz10),
inference(cnf_transformation,[],[f98]) ).
tcf(c_116,plain,
! [X0: $i] :
( aElementOf0(sK13(X0),xI)
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f167]) ).
tcf(c_117,plain,
! [X0: $i] :
( aElementOf0(sK14(X0),xJ)
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f166]) ).
tcf(c_118,plain,
! [X0: $i] :
( ( sdtpldt0(sK13(X0),sK14(X0)) = X0 )
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f165]) ).
tcf(c_122,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ aElementOf0(X1,xJ)
| ~ aElementOf0(X0,xI)
| ( sdtpldt0(X0,X1) != sz10 ) ),
inference(cnf_transformation,[],[f170]) ).
tcf(c_3256,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ aElementOf0(X1,xJ)
| ~ aElementOf0(X0,xI)
| ( sdtpldt0(X0,X1) != sz10 ) ),
inference(demodulation,[status(thm)],[c_122]) ).
tcf(c_5063,plain,
sdtpldt0(sK13(sz10),sK14(sz10)) = sz10,
inference(superposition,[status(thm)],[c_50,c_118]) ).
tcf(c_5506,plain,
( ~ aElementOf0(sK14(sz10),xJ)
| ~ aElementOf0(sK13(sz10),xI) ),
inference(superposition,[status(thm)],[c_5063,c_3256]) ).
tcf(c_5520,plain,
( ~ aElement0(sz10)
| ~ aElementOf0(sK14(sz10),xJ) ),
inference(superposition,[status(thm)],[c_116,c_5506]) ).
tcf(c_5521,plain,
~ aElementOf0(sK14(sz10),xJ),
inference(forward_subsumption_resolution,[status(thm)],[c_5520,c_50]) ).
tcf(c_5692,plain,
~ aElement0(sz10),
inference(superposition,[status(thm)],[c_117,c_5521]) ).
tcf(c_5693,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_5692,c_50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : RNG095+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.37 % Computer : n004.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Thu Sep 24 08:12:06 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.41 Running first-order theorem proving
% 0.12/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.12/0.42
% 0.12/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.42
% 0.12/0.43 % Detected problem language: tptp
% 0.12/0.44 % Proving...
% 1.82/1.29 % SZS status Started for theBenchmark.p
% 1.82/1.29 % SZS status Theorem for theBenchmark.p
% 1.82/1.29
% 1.82/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.82/1.29
% 1.82/1.29 % ------ iProver source info
% 1.82/1.29
% 1.82/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 1.82/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.82/1.29 % git: non_committed_changes: false
% 1.82/1.29
% 1.82/1.29 % ------ Parsing...
% 1.82/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.82/1.29
% 1.82/1.29 % ------ 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: 1 0s sf_e pe_s pe_e %
% 1.82/1.29
% 1.82/1.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.82/1.29
% 1.82/1.29 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.82/1.29 % ------ Proving...
% 1.82/1.29 % ------ Problem Properties
% 1.82/1.29
% 1.82/1.29 %
% 1.82/1.29 % clauses 71
% 1.82/1.29 % conjectures 1
% 1.82/1.29 % EPR 12
% 1.82/1.29 % Horn 58
% 1.82/1.29 % unary 9
% 1.82/1.29 % binary 17
% 1.82/1.29 % lits 220
% 1.82/1.29 % lits eq 33
% 1.82/1.29 % fd_pure 0
% 1.82/1.29 % fd_pseudo 0
% 1.82/1.29 % fd_cond 1
% 1.82/1.29 % fd_pseudo_cond 8
% 1.82/1.29 % AC symbols 0
% 1.82/1.29
% 1.82/1.29 % ------ Schedule dynamic 5 is on
% 1.82/1.29
% 1.82/1.29 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.82/1.29
% 1.82/1.29
% 1.82/1.29 % ------
% 1.82/1.29 % Current options:
% 1.82/1.29 % ------
% 1.82/1.29
% 1.82/1.29
% 1.82/1.29 %
% 1.82/1.29
% 1.82/1.29 % ------ Proving...
% 1.82/1.29 %
% 1.82/1.29
% 1.82/1.29 % SZS status Theorem for theBenchmark.p
% 1.82/1.29
% 1.82/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.82/1.29
% 1.82/1.29
%------------------------------------------------------------------------------