%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : RNG072+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 : n013.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:44 PM UTC 2026
% Result : Theorem 3.91s 1.26s
% Output : CNFRefutation 3.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 35 ( 17 unt; 0 def)
% Number of atoms : 91 ( 3 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 105 ( 49 ~; 43 |; 10 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 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 : 12 ( 12 usr; 10 con; 0-2 aty)
% Number of variables : 30 ( 0 sgn 30 !; 0 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
fof(f10,axiom,
! [X0,X1] :
( ( aScalar0(X1)
& aScalar0(X0) )
=> aScalar0(sdtpldt0(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSumSc) ).
fof(f24,axiom,
! [X0,X1,X2,X3] :
( ( aScalar0(X3)
& aScalar0(X2)
& aScalar0(X1)
& aScalar0(X0) )
=> ( ( sdtlseqdt0(X2,X3)
& sdtlseqdt0(sz0z00,X2)
& sdtlseqdt0(X0,X1) )
=> sdtlseqdt0(sdtasdt0(X0,X2),sdtasdt0(X1,X3)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mLEMonM) ).
fof(f52,axiom,
( xR = sdtasdt0(xC,xG)
& aScalar0(xR) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1892) ).
fof(f53,axiom,
( xP = sdtasdt0(xE,xH)
& aScalar0(xP) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1911) ).
fof(f54,axiom,
( xS = sdtasdt0(xF,xD)
& aScalar0(xS) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1930) ).
fof(f61,axiom,
sdtlseqdt0(sdtpldt0(xR,xS),sdtpldt0(xP,xP)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2610) ).
fof(f62,axiom,
( sdtlseqdt0(sz0z00,sdtpldt0(xP,xP))
& sdtlseqdt0(sz0z00,sdtpldt0(xR,xS)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2628) ).
fof(f63,conjecture,
sdtlseqdt0(sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS)),sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f64,negated_conjecture,
~ sdtlseqdt0(sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS)),sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP))),
inference(negated_conjecture,[status(cth)],[f63]) ).
fof(f65,plain,
~ sdtlseqdt0(sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS)),sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP))),
inference(flattening,[],[f64]) ).
fof(f112,plain,
! [X0,X1] :
( ~ aScalar0(X1)
| ~ aScalar0(X0)
| aScalar0(sdtpldt0(X0,X1)) ),
inference(ennf_transformation,[],[f10]) ).
fof(f113,plain,
! [X0,X1] :
( ~ aScalar0(X1)
| ~ aScalar0(X0)
| aScalar0(sdtpldt0(X0,X1)) ),
inference(flattening,[],[f112]) ).
fof(f119,plain,
! [X0,X1,X2,X3] :
( ~ aScalar0(X3)
| ~ aScalar0(X2)
| ~ aScalar0(X1)
| ~ aScalar0(X0)
| ~ sdtlseqdt0(X2,X3)
| ~ sdtlseqdt0(sz0z00,X2)
| ~ sdtlseqdt0(X0,X1)
| sdtlseqdt0(sdtasdt0(X0,X2),sdtasdt0(X1,X3)) ),
inference(ennf_transformation,[],[f24]) ).
fof(f120,plain,
! [X0,X1,X2,X3] :
( ~ aScalar0(X3)
| ~ aScalar0(X2)
| ~ aScalar0(X1)
| ~ aScalar0(X0)
| ~ sdtlseqdt0(X2,X3)
| ~ sdtlseqdt0(sz0z00,X2)
| ~ sdtlseqdt0(X0,X1)
| sdtlseqdt0(sdtasdt0(X0,X2),sdtasdt0(X1,X3)) ),
inference(flattening,[],[f119]) ).
fof(f156,plain,
aScalar0(xR),
inference(cnf_transformation,[],[f52]) ).
fof(f158,plain,
aScalar0(xP),
inference(cnf_transformation,[],[f53]) ).
fof(f160,plain,
aScalar0(xS),
inference(cnf_transformation,[],[f54]) ).
fof(f168,plain,
sdtlseqdt0(sdtpldt0(xR,xS),sdtpldt0(xP,xP)),
inference(cnf_transformation,[],[f61]) ).
fof(f170,plain,
sdtlseqdt0(sz0z00,sdtpldt0(xR,xS)),
inference(cnf_transformation,[],[f62]) ).
fof(f171,plain,
~ sdtlseqdt0(sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS)),sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP))),
inference(cnf_transformation,[],[f65]) ).
fof(f204,plain,
! [X0,X1] :
( ~ aScalar0(X1)
| ~ aScalar0(X0)
| aScalar0(sdtpldt0(X0,X1)) ),
inference(cnf_transformation,[],[f113]) ).
fof(f209,plain,
! [X2,X3,X0,X1] :
( ~ aScalar0(X3)
| ~ aScalar0(X2)
| ~ aScalar0(X1)
| ~ aScalar0(X0)
| ~ sdtlseqdt0(X2,X3)
| ~ sdtlseqdt0(sz0z00,X2)
| ~ sdtlseqdt0(X0,X1)
| sdtlseqdt0(sdtasdt0(X0,X2),sdtasdt0(X1,X3)) ),
inference(cnf_transformation,[],[f120]) ).
tcf(c_78,plain,
aScalar0(xR),
inference(cnf_transformation,[],[f156]) ).
tcf(c_80,plain,
aScalar0(xP),
inference(cnf_transformation,[],[f158]) ).
tcf(c_82,plain,
aScalar0(xS),
inference(cnf_transformation,[],[f160]) ).
tcf(c_91,plain,
sdtlseqdt0(sdtpldt0(xR,xS),sdtpldt0(xP,xP)),
inference(cnf_transformation,[],[f168]) ).
tcf(c_92,plain,
sdtlseqdt0(sz0z00,sdtpldt0(xR,xS)),
inference(cnf_transformation,[],[f170]) ).
tcf(c_94,negated_conjecture,
~ sdtlseqdt0(sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS)),sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP))),
inference(cnf_transformation,[],[f171]) ).
tcf(c_127,plain,
! [X0: $i,X1: $i] :
( aScalar0(sdtpldt0(X0,X1))
| ~ aScalar0(X1)
| ~ aScalar0(X0) ),
inference(cnf_transformation,[],[f204]) ).
tcf(c_132,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( sdtlseqdt0(sdtasdt0(X0,X2),sdtasdt0(X1,X3))
| ~ aScalar0(X3)
| ~ aScalar0(X2)
| ~ aScalar0(X1)
| ~ aScalar0(X0)
| ~ sdtlseqdt0(sz0z00,X2)
| ~ sdtlseqdt0(X2,X3)
| ~ sdtlseqdt0(X0,X1) ),
inference(cnf_transformation,[],[f209]) ).
tcf(c_141,plain,
( aScalar0(sdtpldt0(xP,xP))
| ~ aScalar0(xP) ),
inference(instantiation,[status(thm)],[c_127]) ).
tcf(c_4483,plain,
( aScalar0(sdtpldt0(xR,xS))
| ~ aScalar0(xS)
| ~ aScalar0(xR) ),
inference(instantiation,[status(thm)],[c_127]) ).
tcf(c_5002,plain,
( ~ aScalar0(sdtpldt0(xP,xP))
| ~ aScalar0(sdtpldt0(xR,xS))
| ~ sdtlseqdt0(sz0z00,sdtpldt0(xR,xS))
| ~ sdtlseqdt0(sdtpldt0(xR,xS),sdtpldt0(xP,xP)) ),
inference(superposition,[status(thm)],[c_132,c_94]) ).
tcf(c_5005,plain,
( ~ aScalar0(sdtpldt0(xP,xP))
| ~ aScalar0(sdtpldt0(xR,xS)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_5002,c_92,c_91]) ).
tcf(c_5126,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_5005,c_4483,c_141,c_78,c_80,c_82]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : RNG072+2 : 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.35 % Computer : n013.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Thu Sep 24 08:04:51 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/0.39 Running first-order theorem proving
% 0.13/0.39 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.13/0.40
% 0.13/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.40
% 0.13/0.40 % Detected problem language: tptp
% 0.13/0.41 % Proving...
% 3.91/1.26 % SZS status Started for theBenchmark.p
% 3.91/1.26 % SZS status Theorem for theBenchmark.p
% 3.91/1.26
% 3.91/1.26 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.91/1.26
% 3.91/1.26 % ------ iProver source info
% 3.91/1.26
% 3.91/1.26 % git: date: 2026-07-19 20:42:38 +0200
% 3.91/1.26 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.91/1.26 % git: non_committed_changes: false
% 3.91/1.26
% 3.91/1.26 % ------ Parsing...
% 3.91/1.26 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.91/1.26
% 3.91/1.26 % ------ Preprocessing... sup_sim: 2 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e %
% 3.91/1.26
% 3.91/1.26 % ------ Preprocessing... gs_s sp: 4 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.91/1.26
% 3.91/1.26 % ------ Preprocessing... sf_s rm: 4 0s sf_e sf_s rm: 0 0s sf_e
% 3.91/1.26 % ------ Proving...
% 3.91/1.26 % ------ Problem Properties
% 3.91/1.26
% 3.91/1.26 %
% 3.91/1.26 % clauses 87
% 3.91/1.26 % conjectures 1
% 3.91/1.26 % EPR 25
% 3.91/1.26 % Horn 75
% 3.91/1.26 % unary 45
% 3.91/1.26 % binary 11
% 3.91/1.26 % lits 207
% 3.91/1.27 % lits eq 60
% 3.91/1.27 % fd_pure 0
% 3.91/1.27 % fd_pseudo 0
% 3.91/1.27 % fd_cond 1
% 3.91/1.27 % fd_pseudo_cond 5
% 3.91/1.27 % AC symbols 0
% 3.91/1.27
% 3.91/1.27 % ------ Schedule dynamic 5 is on
% 3.91/1.27
% 3.91/1.27 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.91/1.27
% 3.91/1.27
% 3.91/1.27 % ------
% 3.91/1.27 % Current options:
% 3.91/1.27 % ------
% 3.91/1.27
% 3.91/1.27
% 3.91/1.27 %
% 3.91/1.27
% 3.91/1.27 % ------ Proving...
% 3.91/1.27 %
% 3.91/1.27
% 3.91/1.27 % SZS status Theorem for theBenchmark.p
% 3.91/1.27
% 3.91/1.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.91/1.27
% 3.91/1.27
%------------------------------------------------------------------------------