%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM633+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 : n003.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:19 PM UTC 2026
% Result : Theorem 0.66s 1.17s
% Output : CNFRefutation 0.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of formulae : 26 ( 9 unt; 0 def)
% Number of atoms : 102 ( 25 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 122 ( 46 ~; 32 |; 35 &)
% ( 0 <=>; 9 =>; 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; 8 con; 0-2 aty)
% Number of variables : 35 ( 0 sgn 27 !; 8 ?; 7 :)
% Comments :
%------------------------------------------------------------------------------
fof(f94,axiom,
( isCountable0(sdtlbdtrb0(xd,szDzizrdt0(xd)))
& aElementOf0(szDzizrdt0(xd),xT) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4854) ).
fof(f96,axiom,
( isCountable0(xO)
& aSet0(xO) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4908) ).
fof(f98,axiom,
aSubsetOf0(xO,xS),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4998) ).
fof(f99,conjecture,
( ! [X0] :
( aElementOf0(X0,slbdtsldtrb0(xO,xK))
=> ( sdtlpdtrp0(xc,X0) = szDzizrdt0(xd)
& aElementOf0(X0,szDzozmdt0(xc))
& aSubsetOf0(X0,szNzAzT0)
& X0 != slcrc0 ) )
=> ? [X0] :
( ? [X1] :
( ! [X2] :
( aElementOf0(X2,slbdtsldtrb0(X1,xK))
=> sdtlpdtrp0(xc,X2) = X0 )
& isCountable0(X1)
& aSubsetOf0(X1,xS) )
& aElementOf0(X0,xT) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f100,negated_conjecture,
~ ( ! [X0] :
( aElementOf0(X0,slbdtsldtrb0(xO,xK))
=> ( sdtlpdtrp0(xc,X0) = szDzizrdt0(xd)
& aElementOf0(X0,szDzozmdt0(xc))
& aSubsetOf0(X0,szNzAzT0)
& X0 != slcrc0 ) )
=> ? [X0] :
( ? [X1] :
( ! [X2] :
( aElementOf0(X2,slbdtsldtrb0(X1,xK))
=> sdtlpdtrp0(xc,X2) = X0 )
& isCountable0(X1)
& aSubsetOf0(X1,xS) )
& aElementOf0(X0,xT) ) ),
inference(negated_conjecture,[status(cth)],[f99]) ).
fof(f108,plain,
~ ( ! [X0] :
( aElementOf0(X0,slbdtsldtrb0(xO,xK))
=> ( sdtlpdtrp0(xc,X0) = szDzizrdt0(xd)
& aElementOf0(X0,szDzozmdt0(xc))
& aSubsetOf0(X0,szNzAzT0)
& X0 != slcrc0 ) )
=> ? [X1] :
( ? [X2] :
( ! [X3] :
( aElementOf0(X3,slbdtsldtrb0(X2,xK))
=> sdtlpdtrp0(xc,X3) = X1 )
& isCountable0(X2)
& aSubsetOf0(X2,xS) )
& aElementOf0(X1,xT) ) ),
inference(rectify,[],[f100]) ).
fof(f232,plain,
( ! [X0] :
( ~ aElementOf0(X0,slbdtsldtrb0(xO,xK))
| ( sdtlpdtrp0(xc,X0) = szDzizrdt0(xd)
& aElementOf0(X0,szDzozmdt0(xc))
& aSubsetOf0(X0,szNzAzT0)
& X0 != slcrc0 ) )
& ! [X1] :
( ! [X2] :
( ? [X3] :
( aElementOf0(X3,slbdtsldtrb0(X2,xK))
& sdtlpdtrp0(xc,X3) != X1 )
| ~ isCountable0(X2)
| ~ aSubsetOf0(X2,xS) )
| ~ aElementOf0(X1,xT) ) ),
inference(ennf_transformation,[],[f108]) ).
fof(f302,plain,
( ! [X3] :
( ~ aElementOf0(X3,slbdtsldtrb0(xO,xK))
| ( szDzizrdt0(xd) = sdtlpdtrp0(xc,X3)
& aElementOf0(X3,szDzozmdt0(xc))
& aSubsetOf0(X3,szNzAzT0)
& slcrc0 != X3 ) )
& ! [X0] :
( ! [X1] :
( ? [X2] :
( aElementOf0(X2,slbdtsldtrb0(X1,xK))
& sdtlpdtrp0(xc,X2) != X0 )
| ~ isCountable0(X1)
| ~ aSubsetOf0(X1,xS) )
| ~ aElementOf0(X0,xT) ) ),
inference(rectify,[],[f232]) ).
fof(f303,plain,
( ! [X3] :
( ~ aElementOf0(X3,slbdtsldtrb0(xO,xK))
| ( szDzizrdt0(xd) = sdtlpdtrp0(xc,X3)
& aElementOf0(X3,szDzozmdt0(xc))
& aSubsetOf0(X3,szNzAzT0)
& slcrc0 != X3 ) )
& ! [X0] :
( ! [X1] :
( ( aElementOf0(sK29(X0,X1),slbdtsldtrb0(X1,xK))
& sdtlpdtrp0(xc,sK29(X0,X1)) != X0 )
| ~ isCountable0(X1)
| ~ aSubsetOf0(X1,xS) )
| ~ aElementOf0(X0,xT) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK29]),skolemize(X2,sK29(X0,X1))],[f302]) ).
fof(f494,plain,
aElementOf0(szDzizrdt0(xd),xT),
inference(cnf_transformation,[],[f94]) ).
fof(f497,plain,
isCountable0(xO),
inference(cnf_transformation,[],[f96]) ).
fof(f502,plain,
aSubsetOf0(xO,xS),
inference(cnf_transformation,[],[f98]) ).
fof(f503,plain,
! [X3] :
( ~ aElementOf0(X3,slbdtsldtrb0(xO,xK))
| szDzizrdt0(xd) = sdtlpdtrp0(xc,X3) ),
inference(cnf_transformation,[],[f303]) ).
fof(f507,plain,
! [X0,X1] :
( aElementOf0(sK29(X0,X1),slbdtsldtrb0(X1,xK))
| ~ isCountable0(X1)
| ~ aSubsetOf0(X1,xS)
| ~ aElementOf0(X0,xT) ),
inference(cnf_transformation,[],[f303]) ).
fof(f508,plain,
! [X0,X1] :
( sdtlpdtrp0(xc,sK29(X0,X1)) != X0
| ~ isCountable0(X1)
| ~ aSubsetOf0(X1,xS)
| ~ aElementOf0(X0,xT) ),
inference(cnf_transformation,[],[f303]) ).
tcf(c_238,plain,
aElementOf0(szDzizrdt0(xd),xT),
inference(cnf_transformation,[],[f494]) ).
tcf(c_243,plain,
isCountable0(xO),
inference(cnf_transformation,[],[f497]) ).
tcf(c_247,plain,
aSubsetOf0(xO,xS),
inference(cnf_transformation,[],[f502]) ).
tcf(c_248,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ isCountable0(X1)
| ~ aSubsetOf0(X1,xS)
| ~ aElementOf0(X0,xT)
| ( sdtlpdtrp0(xc,sK29(X0,X1)) != X0 ) ),
inference(cnf_transformation,[],[f508]) ).
tcf(c_249,negated_conjecture,
! [X0: $i,X1: $i] :
( aElementOf0(sK29(X0,X1),slbdtsldtrb0(X1,xK))
| ~ isCountable0(X1)
| ~ aSubsetOf0(X1,xS)
| ~ aElementOf0(X0,xT) ),
inference(cnf_transformation,[],[f507]) ).
tcf(c_253,negated_conjecture,
! [X0: $i] :
( ( sdtlpdtrp0(xc,X0) = szDzizrdt0(xd) )
| ~ aElementOf0(X0,slbdtsldtrb0(xO,xK)) ),
inference(cnf_transformation,[],[f503]) ).
tcf(c_443,plain,
! [X0: $i] :
( ( sdtlpdtrp0(xc,sK29(X0,xO)) = szDzizrdt0(xd) )
| ~ isCountable0(xO)
| ~ aSubsetOf0(xO,xS)
| ~ aElementOf0(X0,xT) ),
inference(superposition,[status(thm)],[c_249,c_253]) ).
tcf(c_884,plain,
! [X0: $i] :
( ( sdtlpdtrp0(xc,sK29(X0,xO)) = szDzizrdt0(xd) )
| ~ aElementOf0(X0,xT) ),
inference(global_subsumption_just,[status(thm)],[c_443,c_243,c_247,c_443]) ).
tcf(c_892,plain,
sdtlpdtrp0(xc,sK29(szDzizrdt0(xd),xO)) = szDzizrdt0(xd),
inference(superposition,[status(thm)],[c_238,c_884]) ).
tcf(c_1977,plain,
( ~ isCountable0(xO)
| ~ aSubsetOf0(xO,xS)
| ~ aElementOf0(szDzizrdt0(xd),xT) ),
inference(superposition,[status(thm)],[c_892,c_248]) ).
tcf(c_1978,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1977,c_238,c_247,c_243]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM633+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.10/0.35 % Computer : n003.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.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Thu Sep 24 05:02:52 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.39 Running first-order theorem proving
% 0.10/0.39 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.10/0.40
% 0.10/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.40
% 0.10/0.41 % Detected problem language: tptp
% 0.10/0.42 % Proving...
% 0.66/1.17 % SZS status Started for theBenchmark.p
% 0.66/1.17 % SZS status Theorem for theBenchmark.p
% 0.66/1.17
% 0.66/1.17 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.66/1.17
% 0.66/1.17 % ------ iProver source info
% 0.66/1.17
% 0.66/1.17 % git: date: 2026-07-19 20:42:38 +0200
% 0.66/1.17 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.66/1.17 % git: non_committed_changes: false
% 0.66/1.17
% 0.66/1.17 % ------ Parsing...
% 0.66/1.17 % ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.66/1.17 % ------ Proving...
% 0.66/1.17 % ------ Problem Properties
% 0.66/1.17
% 0.66/1.17 %
% 0.66/1.17 % clauses 205
% 0.66/1.17 % conjectures 6
% 0.66/1.17 % EPR 48
% 0.66/1.17 % Horn 166
% 0.66/1.17 % unary 37
% 0.66/1.17 % binary 38
% 0.66/1.17 % lits 685
% 0.66/1.17 % lits eq 102
% 0.66/1.17 % fd_pure 0
% 0.66/1.17 % fd_pseudo 0
% 0.66/1.17 % fd_cond 10
% 0.66/1.17 % fd_pseudo_cond 25
% 0.66/1.17 % AC symbols 0
% 0.66/1.17
% 0.66/1.17 % ------ Input Options Time Limit: Unbounded
% 0.66/1.17
% 0.66/1.17
% 0.66/1.17 % ------
% 0.66/1.17 % Current options:
% 0.66/1.17 % ------
% 0.66/1.17
% 0.66/1.17
% 0.66/1.17 %
% 0.66/1.17
% 0.66/1.17 % ------ Proving...
% 0.66/1.17 %
% 0.66/1.17
% 0.66/1.17 % SZS status Theorem for theBenchmark.p
% 0.66/1.17
% 0.66/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.66/1.17
% 0.66/1.17
%------------------------------------------------------------------------------