%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : RNG116+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.26s 1.28s
% Output : CNFRefutation 4.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 2
% Syntax : Number of formulae : 24 ( 12 unt; 0 def)
% Number of atoms : 58 ( 24 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 55 ( 21 ~; 12 |; 22 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 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 : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 18 ( 0 sgn 10 !; 8 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
fof(f47,axiom,
( xu = sdtpldt0(xk,xl)
& aElementOf0(xl,slsdtgt0(xb))
& ? [X0] :
( sdtasdt0(xb,X0) = xl
& aElement0(X0) )
& aElementOf0(xk,slsdtgt0(xa))
& ? [X0] :
( sdtasdt0(xa,X0) = xk
& aElement0(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2456) ).
fof(f48,conjecture,
? [X0,X1] :
( xu = sdtpldt0(sdtasdt0(xa,X0),sdtasdt0(xb,X1))
& aElement0(X1)
& aElement0(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f49,negated_conjecture,
~ ? [X0,X1] :
( xu = sdtpldt0(sdtasdt0(xa,X0),sdtasdt0(xb,X1))
& aElement0(X1)
& aElement0(X0) ),
inference(negated_conjecture,[status(cth)],[f48]) ).
fof(f63,plain,
( xu = sdtpldt0(xk,xl)
& aElementOf0(xl,slsdtgt0(xb))
& ? [X1] :
( sdtasdt0(xb,X1) = xl
& aElement0(X1) )
& aElementOf0(xk,slsdtgt0(xa))
& ? [X0] :
( sdtasdt0(xa,X0) = xk
& aElement0(X0) ) ),
inference(rectify,[],[f47]) ).
fof(f120,plain,
! [X0,X1] :
( xu != sdtpldt0(sdtasdt0(xa,X0),sdtasdt0(xb,X1))
| ~ aElement0(X1)
| ~ aElement0(X0) ),
inference(ennf_transformation,[],[f49]) ).
fof(f178,plain,
( xu = sdtpldt0(xk,xl)
& aElementOf0(xl,slsdtgt0(xb))
& xl = sdtasdt0(xb,sK44)
& aElement0(sK44)
& aElementOf0(xk,slsdtgt0(xa))
& xk = sdtasdt0(xa,sK43)
& aElement0(sK43) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK43,sK44]),skolemize(X0,sK43),skolemize(X1,sK44)],[f63]) ).
fof(f344,plain,
xu = sdtpldt0(xk,xl),
inference(cnf_transformation,[],[f178]) ).
fof(f346,plain,
xl = sdtasdt0(xb,sK44),
inference(cnf_transformation,[],[f178]) ).
fof(f347,plain,
aElement0(sK44),
inference(cnf_transformation,[],[f178]) ).
fof(f349,plain,
xk = sdtasdt0(xa,sK43),
inference(cnf_transformation,[],[f178]) ).
fof(f350,plain,
aElement0(sK43),
inference(cnf_transformation,[],[f178]) ).
fof(f351,plain,
! [X0,X1] :
( xu != sdtpldt0(sdtasdt0(xa,X0),sdtasdt0(xb,X1))
| ~ aElement0(X1)
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f120]) ).
tcf(c_214,plain,
aElement0(sK43),
inference(cnf_transformation,[],[f350]) ).
tcf(c_215,plain,
sdtasdt0(xa,sK43) = xk,
inference(cnf_transformation,[],[f349]) ).
tcf(c_217,plain,
aElement0(sK44),
inference(cnf_transformation,[],[f347]) ).
tcf(c_218,plain,
sdtasdt0(xb,sK44) = xl,
inference(cnf_transformation,[],[f346]) ).
tcf(c_220,plain,
sdtpldt0(xk,xl) = xu,
inference(cnf_transformation,[],[f344]) ).
tcf(c_221,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ aElement0(X1)
| ~ aElement0(X0)
| ( sdtpldt0(sdtasdt0(xa,X0),sdtasdt0(xb,X1)) != xu ) ),
inference(cnf_transformation,[],[f351]) ).
tcf(c_7960,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ aElement0(X1)
| ~ aElement0(X0)
| ( sdtpldt0(sdtasdt0(xa,X0),sdtasdt0(xb,X1)) != xu ) ),
inference(demodulation,[status(thm)],[c_221]) ).
tcf(c_10112,plain,
! [X0: $i] :
( ~ aElement0(sK43)
| ~ aElement0(X0)
| ( sdtpldt0(xk,sdtasdt0(xb,X0)) != xu ) ),
inference(superposition,[status(thm)],[c_215,c_7960]) ).
tcf(c_10115,plain,
! [X0: $i] :
( ~ aElement0(X0)
| ( sdtpldt0(xk,sdtasdt0(xb,X0)) != xu ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_10112,c_214]) ).
tcf(c_10143,plain,
( ~ aElement0(sK44)
| ( sdtpldt0(xk,xl) != xu ) ),
inference(superposition,[status(thm)],[c_218,c_10115]) ).
tcf(c_10144,plain,
~ aElement0(sK44),
inference(ground_joinability,[status(thm)],[c_10143,c_220]) ).
tcf(c_10145,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_10144,c_217]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : RNG116+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.08/0.36 % Computer : n001.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Thu Sep 24 08:24:52 UTC 2026
% 0.14/0.36 % CPUTime :
% 0.14/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 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.41
% 0.14/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.41
% 0.14/0.41 % Detected problem language: tptp
% 0.14/0.42 % Proving...
% 4.26/1.28 % SZS status Started for theBenchmark.p
% 4.26/1.28 % SZS status Theorem for theBenchmark.p
% 4.26/1.28
% 4.26/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.26/1.28
% 4.26/1.28 % ------ iProver source info
% 4.26/1.28
% 4.26/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 4.26/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.26/1.28 % git: non_committed_changes: false
% 4.26/1.28
% 4.26/1.28 % ------ Parsing...
% 4.26/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.26/1.28
% 4.26/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.26/1.28
% 4.26/1.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.26/1.28
% 4.26/1.28 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.26/1.28 % ------ Proving...
% 4.26/1.28 % ------ Problem Properties
% 4.26/1.28
% 4.26/1.28 %
% 4.26/1.28 % clauses 165
% 4.26/1.28 % conjectures 1
% 4.26/1.28 % EPR 44
% 4.26/1.28 % Horn 138
% 4.26/1.28 % unary 47
% 4.26/1.28 % binary 36
% 4.26/1.28 % lits 456
% 4.26/1.28 % lits eq 73
% 4.26/1.28 % fd_pure 0
% 4.26/1.28 % fd_pseudo 0
% 4.26/1.28 % fd_cond 5
% 4.26/1.28 % fd_pseudo_cond 11
% 4.26/1.28 % AC symbols 0
% 4.26/1.28
% 4.26/1.28 % ------ Schedule dynamic 5 is on
% 4.26/1.28
% 4.26/1.28 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.26/1.28
% 4.26/1.28
% 4.26/1.28 % ------
% 4.26/1.28 % Current options:
% 4.26/1.28 % ------
% 4.26/1.28
% 4.26/1.28
% 4.26/1.28 %
% 4.26/1.28
% 4.26/1.28 % ------ Proving...
% 4.26/1.28 %
% 4.26/1.28
% 4.26/1.28 % SZS status Theorem for theBenchmark.p
% 4.26/1.28
% 4.26/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.26/1.28
% 4.26/1.28
%------------------------------------------------------------------------------