%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM592+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n011.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:26:08 PM UTC 2026
% Result : Theorem 6.31s 16.99s
% Output : CNFRefutation 6.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 3
% Syntax : Number of formulae : 40 ( 12 unt; 0 def)
% Number of atoms : 133 ( 25 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 167 ( 74 ~; 65 |; 25 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 9 con; 0-2 aty)
% Number of variables : 47 ( 0 sgn 41 !; 6 ?; 23 :)
% Comments :
%------------------------------------------------------------------------------
fof(f91,axiom,
( xd = sdtlpdtrp0(xC,xi)
& xY = sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4448_02) ).
fof(f93,axiom,
( ! [X0] :
( ( aElementOf0(X0,slbdtsldtrb0(xX,xk))
& aSet0(X0) )
=> sdtlpdtrp0(xd,X0) = xu )
& isCountable0(xX)
& aSubsetOf0(xX,xY)
& aElementOf0(xu,xT) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4545) ).
fof(f94,conjecture,
? [X0] :
( ? [X1] :
( ! [X2] :
( ( aElementOf0(X2,slbdtsldtrb0(X1,xk))
& aSet0(X2) )
=> sdtlpdtrp0(sdtlpdtrp0(xC,xi),X2) = X0 )
& isCountable0(X1)
& aSubsetOf0(X1,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& aElementOf0(X0,xT) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f95,negated_conjecture,
~ ? [X0] :
( ? [X1] :
( ! [X2] :
( ( aElementOf0(X2,slbdtsldtrb0(X1,xk))
& aSet0(X2) )
=> sdtlpdtrp0(sdtlpdtrp0(xC,xi),X2) = X0 )
& isCountable0(X1)
& aSubsetOf0(X1,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& aElementOf0(X0,xT) ),
inference(negated_conjecture,[status(cth)],[f94]) ).
fof(f218,plain,
( ! [X0] :
( ~ aElementOf0(X0,slbdtsldtrb0(xX,xk))
| ~ aSet0(X0)
| sdtlpdtrp0(xd,X0) = xu )
& isCountable0(xX)
& aSubsetOf0(xX,xY)
& aElementOf0(xu,xT) ),
inference(ennf_transformation,[],[f93]) ).
fof(f219,plain,
( ! [X0] :
( ~ aElementOf0(X0,slbdtsldtrb0(xX,xk))
| ~ aSet0(X0)
| sdtlpdtrp0(xd,X0) = xu )
& isCountable0(xX)
& aSubsetOf0(xX,xY)
& aElementOf0(xu,xT) ),
inference(flattening,[],[f218]) ).
fof(f220,plain,
! [X0] :
( ! [X1] :
( ? [X2] :
( aElementOf0(X2,slbdtsldtrb0(X1,xk))
& aSet0(X2)
& sdtlpdtrp0(sdtlpdtrp0(xC,xi),X2) != X0 )
| ~ isCountable0(X1)
| ~ aSubsetOf0(X1,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) )
| ~ aElementOf0(X0,xT) ),
inference(ennf_transformation,[],[f95]) ).
fof(f221,plain,
! [X0] :
( ! [X1] :
( ? [X2] :
( aElementOf0(X2,slbdtsldtrb0(X1,xk))
& aSet0(X2)
& sdtlpdtrp0(sdtlpdtrp0(xC,xi),X2) != X0 )
| ~ isCountable0(X1)
| ~ aSubsetOf0(X1,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) )
| ~ aElementOf0(X0,xT) ),
inference(flattening,[],[f220]) ).
fof(f288,plain,
! [X0] :
( ! [X1] :
( ( aElementOf0(sK25(X0,X1),slbdtsldtrb0(X1,xk))
& aSet0(sK25(X0,X1))
& sdtlpdtrp0(sdtlpdtrp0(xC,xi),sK25(X0,X1)) != X0 )
| ~ isCountable0(X1)
| ~ aSubsetOf0(X1,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) )
| ~ aElementOf0(X0,xT) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK25]),skolemize(X2,sK25(X0,X1))],[f221]) ).
fof(f467,plain,
xd = sdtlpdtrp0(xC,xi),
inference(cnf_transformation,[],[f91]) ).
fof(f468,plain,
xY = sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))),
inference(cnf_transformation,[],[f91]) ).
fof(f474,plain,
! [X0] :
( ~ aElementOf0(X0,slbdtsldtrb0(xX,xk))
| ~ aSet0(X0)
| xu = sdtlpdtrp0(xd,X0) ),
inference(cnf_transformation,[],[f219]) ).
fof(f475,plain,
isCountable0(xX),
inference(cnf_transformation,[],[f219]) ).
fof(f476,plain,
aSubsetOf0(xX,xY),
inference(cnf_transformation,[],[f219]) ).
fof(f477,plain,
aElementOf0(xu,xT),
inference(cnf_transformation,[],[f219]) ).
fof(f478,plain,
! [X0,X1] :
( aElementOf0(sK25(X0,X1),slbdtsldtrb0(X1,xk))
| ~ isCountable0(X1)
| ~ aSubsetOf0(X1,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ aElementOf0(X0,xT) ),
inference(cnf_transformation,[],[f288]) ).
fof(f479,plain,
! [X0,X1] :
( aSet0(sK25(X0,X1))
| ~ isCountable0(X1)
| ~ aSubsetOf0(X1,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ aElementOf0(X0,xT) ),
inference(cnf_transformation,[],[f288]) ).
fof(f480,plain,
! [X0,X1] :
( sdtlpdtrp0(sdtlpdtrp0(xC,xi),sK25(X0,X1)) != X0
| ~ isCountable0(X1)
| ~ aSubsetOf0(X1,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ aElementOf0(X0,xT) ),
inference(cnf_transformation,[],[f288]) ).
tcf(c_227,plain,
sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))) = xY,
inference(cnf_transformation,[],[f468]) ).
tcf(c_228,plain,
sdtlpdtrp0(xC,xi) = xd,
inference(cnf_transformation,[],[f467]) ).
tcf(c_234,plain,
aElementOf0(xu,xT),
inference(cnf_transformation,[],[f477]) ).
tcf(c_235,plain,
aSubsetOf0(xX,xY),
inference(cnf_transformation,[],[f476]) ).
tcf(c_236,plain,
isCountable0(xX),
inference(cnf_transformation,[],[f475]) ).
tcf(c_237,plain,
! [X0: $i] :
( ( sdtlpdtrp0(xd,X0) = xu )
| ~ aSet0(X0)
| ~ aElementOf0(X0,slbdtsldtrb0(xX,xk)) ),
inference(cnf_transformation,[],[f474]) ).
tcf(c_238,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ isCountable0(X1)
| ~ aElementOf0(X0,xT)
| ~ aSubsetOf0(X1,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ( sdtlpdtrp0(sdtlpdtrp0(xC,xi),sK25(X0,X1)) != X0 ) ),
inference(cnf_transformation,[],[f480]) ).
tcf(c_239,negated_conjecture,
! [X0: $i,X1: $i] :
( aSet0(sK25(X1,X0))
| ~ isCountable0(X0)
| ~ aElementOf0(X1,xT)
| ~ aSubsetOf0(X0,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) ),
inference(cnf_transformation,[],[f479]) ).
tcf(c_240,negated_conjecture,
! [X0: $i,X1: $i] :
( aElementOf0(sK25(X1,X0),slbdtsldtrb0(X0,xk))
| ~ isCountable0(X0)
| ~ aElementOf0(X1,xT)
| ~ aSubsetOf0(X0,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) ),
inference(cnf_transformation,[],[f478]) ).
tcf(c_2416,plain,
! [X0: $i,X1: $i] :
( aSet0(sK25(X0,X1))
| ~ isCountable0(X1)
| ~ aSubsetOf0(X1,xY)
| ~ aElementOf0(X0,xT) ),
inference(light_normalisation,[status(thm)],[c_239,c_227]) ).
tcf(c_2555,plain,
! [X0: $i,X1: $i] :
( aElementOf0(sK25(X0,X1),slbdtsldtrb0(X1,xk))
| ~ isCountable0(X1)
| ~ aSubsetOf0(X1,xY)
| ~ aElementOf0(X0,xT) ),
inference(light_normalisation,[status(thm)],[c_240,c_227]) ).
tcf(c_2656,plain,
! [X0: $i,X1: $i] :
( ~ isCountable0(X1)
| ~ aSubsetOf0(X1,xY)
| ~ aElementOf0(X0,xT)
| ( sdtlpdtrp0(xd,sK25(X0,X1)) != X0 ) ),
inference(light_normalisation,[status(thm)],[c_238,c_227,c_228]) ).
tcf(c_15479,plain,
! [X0: $i,X1: $i] :
( ~ isCountable0(X1)
| ~ aSubsetOf0(X1,xY)
| ~ aElementOf0(X0,xT)
| ( sdtlpdtrp0(xd,sK25(X0,X1)) != X0 ) ),
inference(demodulation,[status(thm)],[c_2656]) ).
tcf(c_15480,plain,
! [X0: $i,X1: $i] :
( aElementOf0(sK25(X0,X1),slbdtsldtrb0(X1,xk))
| ~ isCountable0(X1)
| ~ aSubsetOf0(X1,xY)
| ~ aElementOf0(X0,xT) ),
inference(demodulation,[status(thm)],[c_2555]) ).
tcf(c_15481,plain,
! [X0: $i,X1: $i] :
( aSet0(sK25(X0,X1))
| ~ isCountable0(X1)
| ~ aSubsetOf0(X1,xY)
| ~ aElementOf0(X0,xT) ),
inference(demodulation,[status(thm)],[c_2416]) ).
tcf(c_22711,plain,
! [X0: $i] :
( ( sdtlpdtrp0(xd,sK25(X0,xX)) = xu )
| ~ isCountable0(xX)
| ~ aSubsetOf0(xX,xY)
| ~ aElementOf0(X0,xT)
| ~ aSet0(sK25(X0,xX)) ),
inference(superposition,[status(thm)],[c_15480,c_237]) ).
tcf(c_22714,plain,
! [X0: $i] :
( ( sdtlpdtrp0(xd,sK25(X0,xX)) = xu )
| ~ aElementOf0(X0,xT)
| ~ aSet0(sK25(X0,xX)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_22711,c_236,c_235]) ).
tcf(c_22846,plain,
! [X0: $i] :
( ( sdtlpdtrp0(xd,sK25(X0,xX)) = xu )
| ~ isCountable0(xX)
| ~ aSubsetOf0(xX,xY)
| ~ aElementOf0(X0,xT) ),
inference(superposition,[status(thm)],[c_15481,c_22714]) ).
tcf(c_22847,plain,
! [X0: $i] :
( ( sdtlpdtrp0(xd,sK25(X0,xX)) = xu )
| ~ aElementOf0(X0,xT) ),
inference(forward_subsumption_resolution,[status(thm)],[c_22846,c_236,c_235]) ).
tcf(c_22863,plain,
sdtlpdtrp0(xd,sK25(xu,xX)) = xu,
inference(superposition,[status(thm)],[c_234,c_22847]) ).
tcf(c_22906,plain,
( ~ isCountable0(xX)
| ~ aSubsetOf0(xX,xY)
| ~ aElementOf0(xu,xT) ),
inference(superposition,[status(thm)],[c_22863,c_15479]) ).
tcf(c_22907,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_22906,c_236,c_235,c_234]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM592+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.08/0.34 % Computer : n011.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.07/15.62 % CPULimit : 300
% 0.07/15.62 % WCLimit : 300
% 0.07/15.62 % DateTime : Thu Sep 24 04:49:34 UTC 2026
% 0.07/15.62 % CPUTime :
% 0.07/15.62 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.07/15.66 Running first-order theorem proving
% 0.07/15.66 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/15.67
% 0.07/15.67 % ======== iProver multi-core TPTP/SMT =========
% 0.07/15.67
% 0.07/15.67 % Detected problem language: tptp
% 0.07/15.68 % Proving...
% 6.31/16.99 % SZS status Started for theBenchmark.p
% 6.31/16.99 % SZS status Theorem for theBenchmark.p
% 6.31/16.99
% 6.31/16.99 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 6.31/16.99
% 6.31/16.99 % ------ iProver source info
% 6.31/16.99
% 6.31/16.99 % git: date: 2026-07-19 20:42:38 +0200
% 6.31/16.99 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 6.31/16.99 % git: non_committed_changes: false
% 6.31/16.99
% 6.31/16.99 % ------ Parsing...
% 6.31/16.99 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 6.31/16.99
% 6.31/16.99 % ------ Preprocessing... sup_sim: 4 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 %
% 6.31/16.99
% 6.31/16.99 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 6.31/16.99
% 6.31/16.99 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 6.31/16.99 % ------ Proving...
% 6.31/16.99 % ------ Problem Properties
% 6.31/16.99
% 6.31/16.99 %
% 6.31/16.99 % clauses 189
% 6.31/16.99 % conjectures 0
% 6.31/16.99 % EPR 47
% 6.31/16.99 % Horn 150
% 6.31/16.99 % unary 37
% 6.31/16.99 % binary 25
% 6.31/16.99 % lits 639
% 6.31/16.99 % lits eq 96
% 6.31/16.99 % fd_pure 0
% 6.31/16.99 % fd_pseudo 0
% 6.31/16.99 % fd_cond 10
% 6.31/16.99 % fd_pseudo_cond 25
% 6.31/16.99 % AC symbols 0
% 6.31/16.99
% 6.31/16.99 % ------ Schedule dynamic 5 is on
% 6.31/16.99
% 6.31/16.99 % ------ no conjectures: strip conj schedule
% 6.31/16.99
% 6.31/16.99 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 6.31/16.99
% 6.31/16.99
% 6.31/16.99 % ------
% 6.31/16.99 % Current options:
% 6.31/16.99 % ------
% 6.31/16.99
% 6.31/16.99
% 6.31/16.99 %
% 6.31/16.99
% 6.31/16.99 % ------ Proving...
% 6.31/16.99 %
% 6.31/16.99
% 6.31/16.99 % SZS status Theorem for theBenchmark.p
% 6.31/16.99
% 6.31/16.99 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 6.31/16.99
% 6.31/16.99
%------------------------------------------------------------------------------