%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : NUM571+1 : TPTP v9.2.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n001.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 04:57:52 PM UTC 2026
% Result : Theorem 1.34s 1.75s
% Output : CNFRefutation 1.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 18 ( 5 unt; 0 def)
% Number of atoms : 55 ( 16 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 52 ( 15 ~; 16 |; 18 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 3 ( 0 sgn 2 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
& isCountable0(sdtlpdtrp0(xN,xi)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(m__3702_02,hypothesis,
( xi != sz00
=> ( ? [X1] :
( aElementOf0(X1,szNzAzT0)
& szszuzczcdt0(X1) = xi )
& aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
& isCountable0(sdtlpdtrp0(xN,xi)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3702_02) ).
fof(m__3623,hypothesis,
( aFunction0(xN)
& szDzozmdt0(xN) = szNzAzT0
& sdtlpdtrp0(xN,sz00) = xS
& ! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( ( aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
& isCountable0(sdtlpdtrp0(xN,X1)) )
=> ( aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X1)),sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X1))) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3623) ).
fof(m__3435,hypothesis,
( aSubsetOf0(xS,szNzAzT0)
& isCountable0(xS) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3435) ).
fof(c_0_4,negated_conjecture,
~ ( aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
& isCountable0(sdtlpdtrp0(xN,xi)) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_5,negated_conjecture,
( ~ aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,xi)) ),
inference(fof_nnf,[status(thm)],[c_0_4]) ).
fof(c_0_6,hypothesis,
( ( aElementOf0(esk22_0,szNzAzT0)
| xi = sz00 )
& ( szszuzczcdt0(esk22_0) = xi
| xi = sz00 )
& ( aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
| xi = sz00 )
& ( isCountable0(sdtlpdtrp0(xN,xi))
| xi = sz00 ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3702_02])])])]) ).
cnf(c_0_7,negated_conjecture,
( ~ aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,xi)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,hypothesis,
( isCountable0(sdtlpdtrp0(xN,xi))
| xi = sz00 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,hypothesis,
( aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
| xi = sz00 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
( xi = sz00
| ~ aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,hypothesis,
xi = sz00,
inference(csr,[status(thm)],[c_0_9,c_0_10]) ).
fof(c_0_12,hypothesis,
! [X322] :
( aFunction0(xN)
& szDzozmdt0(xN) = szNzAzT0
& sdtlpdtrp0(xN,sz00) = xS
& ( aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X322)),sdtmndt0(sdtlpdtrp0(xN,X322),szmzizndt0(sdtlpdtrp0(xN,X322))))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X322),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X322))
| ~ aElementOf0(X322,szNzAzT0) )
& ( isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X322)))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X322),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X322))
| ~ aElementOf0(X322,szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3623])])])]) ).
cnf(c_0_13,negated_conjecture,
( ~ aSubsetOf0(sdtlpdtrp0(xN,sz00),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,sz00)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_11]),c_0_11]) ).
cnf(c_0_14,hypothesis,
sdtlpdtrp0(xN,sz00) = xS,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,hypothesis,
aSubsetOf0(xS,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3435]) ).
cnf(c_0_16,hypothesis,
isCountable0(xS),
inference(split_conjunct,[status(thm)],[m__3435]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_14]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUM571+1 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.13 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.34 % Computer : n001.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 300
% 0.15/0.34 % WCLimit : 300
% 0.15/0.34 % DateTime : Tue May 5 00:46:33 EDT 2026
% 0.15/0.34 % CPUTime :
% 0.15/0.35 % start to proof: theBenchmark
% 1.34/1.75 % Version : CSE_E---1.7
% 1.34/1.75 % Problem : theBenchmark.p
% 1.34/1.75 % SZS status Theorem for theBenchmark.p
% 1.34/1.75 % SZS output start CNFRefutation
% See solution above
% 1.34/1.75 % Total time : 1.377s
%------------------------------------------------------------------------------