%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM606+1 : 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 : n009.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:12 PM UTC 2026
% Result : Theorem 4.85s 2.23s
% Output : CNFRefutation 4.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 7
% Syntax : Number of formulae : 38 ( 15 unt; 0 def)
% Number of atoms : 129 ( 1 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 161 ( 70 ~; 65 |; 20 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 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 : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 51 ( 0 sgn 48 !; 3 ?; 16 :)
% Comments :
%------------------------------------------------------------------------------
fof(f10,axiom,
! [X0] :
( aSet0(X0)
=> ! [X1] :
( aSubsetOf0(X1,X0)
<=> ( ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,X0) )
& aSet0(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefSub) ).
fof(f14,axiom,
! [X0,X1,X2] :
( ( aSet0(X2)
& aSet0(X1)
& aSet0(X0) )
=> ( ( aSubsetOf0(X1,X2)
& aSubsetOf0(X0,X1) )
=> aSubsetOf0(X0,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSubTrans) ).
fof(f23,axiom,
( isCountable0(szNzAzT0)
& aSet0(szNzAzT0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mNATSet) ).
fof(f75,axiom,
( isCountable0(xS)
& aSubsetOf0(xS,szNzAzT0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3435) ).
fof(f98,axiom,
aSubsetOf0(xO,xS),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4998) ).
fof(f100,axiom,
( xQ != slcrc0
& aSubsetOf0(xQ,xO) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5093) ).
fof(f101,conjecture,
aSubsetOf0(xQ,szNzAzT0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f102,negated_conjecture,
~ aSubsetOf0(xQ,szNzAzT0),
inference(negated_conjecture,[status(cth)],[f101]) ).
fof(f103,plain,
~ aSubsetOf0(xQ,szNzAzT0),
inference(flattening,[],[f102]) ).
fof(f135,plain,
! [X0,X1,X2] :
( ~ aSet0(X2)
| ~ aSet0(X1)
| ~ aSet0(X0)
| ~ aSubsetOf0(X1,X2)
| ~ aSubsetOf0(X0,X1)
| aSubsetOf0(X0,X2) ),
inference(ennf_transformation,[],[f14]) ).
fof(f136,plain,
! [X0,X1,X2] :
( ~ aSet0(X2)
| ~ aSet0(X1)
| ~ aSet0(X0)
| ~ aSubsetOf0(X1,X2)
| ~ aSubsetOf0(X0,X1)
| aSubsetOf0(X0,X2) ),
inference(flattening,[],[f135]) ).
fof(f140,plain,
! [X0] :
( ~ aSet0(X0)
| ! [X1] :
( aSubsetOf0(X1,X0)
<=> ( ! [X2] :
( ~ aElementOf0(X2,X1)
| aElementOf0(X2,X0) )
& aSet0(X1) ) ) ),
inference(ennf_transformation,[],[f10]) ).
fof(f241,plain,
! [X0] :
( ~ aSet0(X0)
| ! [X1] :
( ( ~ aSubsetOf0(X1,X0)
| ( ! [X2] :
( ~ aElementOf0(X2,X1)
| aElementOf0(X2,X0) )
& aSet0(X1) ) )
& ( ? [X2] :
( aElementOf0(X2,X1)
& ~ aElementOf0(X2,X0) )
| ~ aSet0(X1)
| aSubsetOf0(X1,X0) ) ) ),
inference(nnf_transformation,[],[f140]) ).
fof(f242,plain,
! [X0] :
( ~ aSet0(X0)
| ! [X1] :
( ( ~ aSubsetOf0(X1,X0)
| ( ! [X2] :
( ~ aElementOf0(X2,X1)
| aElementOf0(X2,X0) )
& aSet0(X1) ) )
& ( ? [X2] :
( aElementOf0(X2,X1)
& ~ aElementOf0(X2,X0) )
| ~ aSet0(X1)
| aSubsetOf0(X1,X0) ) ) ),
inference(flattening,[],[f241]) ).
fof(f243,plain,
! [X0] :
( ~ aSet0(X0)
| ! [X1] :
( ( ~ aSubsetOf0(X1,X0)
| ( ! [X3] :
( ~ aElementOf0(X3,X1)
| aElementOf0(X3,X0) )
& aSet0(X1) ) )
& ( ? [X2] :
( aElementOf0(X2,X1)
& ~ aElementOf0(X2,X0) )
| ~ aSet0(X1)
| aSubsetOf0(X1,X0) ) ) ),
inference(rectify,[],[f242]) ).
fof(f244,plain,
! [X0] :
( ~ aSet0(X0)
| ! [X1] :
( ( ~ aSubsetOf0(X1,X0)
| ( ! [X3] :
( ~ aElementOf0(X3,X1)
| aElementOf0(X3,X0) )
& aSet0(X1) ) )
& ( ( aElementOf0(sK10(X0,X1),X1)
& ~ aElementOf0(sK10(X0,X1),X0) )
| ~ aSet0(X1)
| aSubsetOf0(X1,X0) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK10]),skolemize(X2,sK10(X0,X1))],[f243]) ).
fof(f296,plain,
aSubsetOf0(xS,szNzAzT0),
inference(cnf_transformation,[],[f75]) ).
fof(f347,plain,
aSubsetOf0(xO,xS),
inference(cnf_transformation,[],[f98]) ).
fof(f350,plain,
aSubsetOf0(xQ,xO),
inference(cnf_transformation,[],[f100]) ).
fof(f351,plain,
~ aSubsetOf0(xQ,szNzAzT0),
inference(cnf_transformation,[],[f103]) ).
fof(f352,plain,
! [X2,X0,X1] :
( ~ aSet0(X2)
| ~ aSet0(X1)
| ~ aSet0(X0)
| ~ aSubsetOf0(X1,X2)
| ~ aSubsetOf0(X0,X1)
| aSubsetOf0(X0,X2) ),
inference(cnf_transformation,[],[f136]) ).
fof(f356,plain,
! [X0,X1] :
( ~ aSet0(X0)
| ~ aSubsetOf0(X1,X0)
| aSet0(X1) ),
inference(cnf_transformation,[],[f244]) ).
fof(f367,plain,
aSet0(szNzAzT0),
inference(cnf_transformation,[],[f23]) ).
tcf(c_52,plain,
aSubsetOf0(xS,szNzAzT0),
inference(cnf_transformation,[],[f296]) ).
tcf(c_104,plain,
aSubsetOf0(xO,xS),
inference(cnf_transformation,[],[f347]) ).
tcf(c_106,plain,
aSubsetOf0(xQ,xO),
inference(cnf_transformation,[],[f350]) ).
tcf(c_108,negated_conjecture,
~ aSubsetOf0(xQ,szNzAzT0),
inference(cnf_transformation,[],[f351]) ).
tcf(c_109,plain,
! [X0: $i,X1: $i,X2: $i] :
( aSubsetOf0(X0,X2)
| ~ aSet0(X2)
| ~ aSet0(X1)
| ~ aSet0(X0)
| ~ aSubsetOf0(X1,X2)
| ~ aSubsetOf0(X0,X1) ),
inference(cnf_transformation,[],[f352]) ).
tcf(c_114,plain,
! [X0: $i,X1: $i] :
( aSet0(X0)
| ~ aSet0(X1)
| ~ aSubsetOf0(X0,X1) ),
inference(cnf_transformation,[],[f356]) ).
tcf(c_123,plain,
aSet0(szNzAzT0),
inference(cnf_transformation,[],[f367]) ).
tcf(c_383,plain,
! [X0: $i,X1: $i,X2: $i] :
( aSubsetOf0(X0,X2)
| ~ aSet0(X2)
| ~ aSet0(X1)
| ~ aSubsetOf0(X0,X1)
| ~ aSubsetOf0(X1,X2) ),
inference(global_subsumption_just,[status(thm)],[c_109,c_114,c_109]) ).
tcf(c_384,plain,
! [X0: $i,X1: $i,X2: $i] :
( aSubsetOf0(X0,X2)
| ~ aSet0(X2)
| ~ aSet0(X1)
| ~ aSubsetOf0(X1,X2)
| ~ aSubsetOf0(X0,X1) ),
inference(renaming,[status(thm)],[c_383]) ).
tcf(c_617,plain,
! [X0: $i,X1: $i,X2: $i] :
( aSubsetOf0(X0,X2)
| ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2)
| ~ aSubsetOf0(X0,X1) ),
inference(backward_subsumption_resolution,[status(thm)],[c_384,c_114]) ).
tcf(c_24347,plain,
! [X0: $i] :
( aSubsetOf0(xO,X0)
| ~ aSet0(X0)
| ~ aSubsetOf0(xS,X0) ),
inference(superposition,[status(thm)],[c_104,c_617]) ).
tcf(c_24348,plain,
! [X0: $i] :
( aSubsetOf0(xQ,X0)
| ~ aSet0(X0)
| ~ aSubsetOf0(xO,X0) ),
inference(superposition,[status(thm)],[c_106,c_617]) ).
tcf(c_24370,plain,
( aSubsetOf0(xQ,szNzAzT0)
| ~ aSet0(szNzAzT0)
| ~ aSubsetOf0(xO,szNzAzT0) ),
inference(instantiation,[status(thm)],[c_24348]) ).
tcf(c_24371,plain,
( aSubsetOf0(xO,szNzAzT0)
| ~ aSet0(szNzAzT0)
| ~ aSubsetOf0(xS,szNzAzT0) ),
inference(instantiation,[status(thm)],[c_24347]) ).
tcf(c_24372,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_24371,c_24370,c_108,c_52,c_123]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM606+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.36 % Computer : n009.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Thu Sep 24 04:52:59 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/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.43 % Proving...
% 4.85/2.23 % SZS status Started for theBenchmark.p
% 4.85/2.23 % SZS status Theorem for theBenchmark.p
% 4.85/2.23
% 4.85/2.23 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.85/2.23
% 4.85/2.23 % ------ iProver source info
% 4.85/2.23
% 4.85/2.23 % git: date: 2026-07-19 20:42:38 +0200
% 4.85/2.23 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.85/2.23 % git: non_committed_changes: false
% 4.85/2.23
% 4.85/2.23 % ------ Parsing...
% 4.85/2.23 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.85/2.23
% 4.85/2.23 % ------ Preprocessing... sup_sim: 2 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.85/2.23
% 4.85/2.23 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.85/2.23
% 4.85/2.23 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.85/2.23 % ------ Proving...
% 4.85/2.23 % ------ Problem Properties
% 4.85/2.23
% 4.85/2.23 %
% 4.85/2.23 % clauses 189
% 4.85/2.23 % conjectures 1
% 4.85/2.23 % EPR 47
% 4.85/2.23 % Horn 155
% 4.85/2.23 % unary 40
% 4.85/2.23 % binary 32
% 4.85/2.23 % lits 611
% 4.85/2.23 % lits eq 93
% 4.85/2.23 % fd_pure 0
% 4.85/2.23 % fd_pseudo 0
% 4.85/2.23 % fd_cond 8
% 4.85/2.23 % fd_pseudo_cond 23
% 4.85/2.23 % AC symbols 0
% 4.85/2.23
% 4.85/2.23 % ------ Schedule dynamic 5 is on
% 4.85/2.23
% 4.85/2.23 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.85/2.23
% 4.85/2.23
% 4.85/2.23 % ------
% 4.85/2.23 % Current options:
% 4.85/2.23 % ------
% 4.85/2.23
% 4.85/2.23
% 4.85/2.23 %
% 4.85/2.23
% 4.85/2.23 % ------ Proving...
% 4.85/2.23 %
% 4.85/2.23
% 4.85/2.23 % SZS status Theorem for theBenchmark.p
% 4.85/2.23
% 4.85/2.23 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.85/2.23
% 4.85/2.23
%------------------------------------------------------------------------------