%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : NUM592+1 : TPTP v9.2.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n016.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:57 PM UTC 2026
% Result : Theorem 2.15s 1.92s
% Output : CNFRefutation 2.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 21 ( 7 unt; 0 def)
% Number of atoms : 75 ( 13 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 92 ( 38 ~; 33 |; 18 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% 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 : 24 ( 0 sgn 6 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
? [X1] :
( aElementOf0(X1,xT)
& ? [X2] :
( aSubsetOf0(X2,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
& isCountable0(X2)
& ! [X3] :
( ( aSet0(X3)
& aElementOf0(X3,slbdtsldtrb0(X2,xk)) )
=> sdtlpdtrp0(sdtlpdtrp0(xC,xi),X3) = X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(m__4545,hypothesis,
( aElementOf0(xu,xT)
& aSubsetOf0(xX,xY)
& isCountable0(xX)
& ! [X1] :
( ( aSet0(X1)
& aElementOf0(X1,slbdtsldtrb0(xX,xk)) )
=> sdtlpdtrp0(xd,X1) = xu ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4545) ).
fof(m__4448_02,hypothesis,
( xY = sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))
& xd = sdtlpdtrp0(xC,xi) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4448_02) ).
fof(c_0_3,negated_conjecture,
~ ? [X1] :
( aElementOf0(X1,xT)
& ? [X2] :
( aSubsetOf0(X2,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
& isCountable0(X2)
& ! [X3] :
( ( aSet0(X3)
& aElementOf0(X3,slbdtsldtrb0(X2,xk)) )
=> sdtlpdtrp0(sdtlpdtrp0(xC,xi),X3) = X1 ) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_4,negated_conjecture,
! [X352,X353] :
( ( aSet0(esk22_2(X352,X353))
| ~ aSubsetOf0(X353,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ isCountable0(X353)
| ~ aElementOf0(X352,xT) )
& ( aElementOf0(esk22_2(X352,X353),slbdtsldtrb0(X353,xk))
| ~ aSubsetOf0(X353,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ isCountable0(X353)
| ~ aElementOf0(X352,xT) )
& ( sdtlpdtrp0(sdtlpdtrp0(xC,xi),esk22_2(X352,X353)) != X352
| ~ aSubsetOf0(X353,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ isCountable0(X353)
| ~ aElementOf0(X352,xT) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])]) ).
fof(c_0_5,hypothesis,
! [X351] :
( aElementOf0(xu,xT)
& aSubsetOf0(xX,xY)
& isCountable0(xX)
& ( ~ aSet0(X351)
| ~ aElementOf0(X351,slbdtsldtrb0(xX,xk))
| sdtlpdtrp0(xd,X351) = xu ) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__4545])])]) ).
cnf(c_0_6,negated_conjecture,
( aElementOf0(esk22_2(X1,X2),slbdtsldtrb0(X2,xk))
| ~ aSubsetOf0(X2,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ isCountable0(X2)
| ~ aElementOf0(X1,xT) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,hypothesis,
xY = sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))),
inference(split_conjunct,[status(thm)],[m__4448_02]) ).
cnf(c_0_8,negated_conjecture,
( sdtlpdtrp0(sdtlpdtrp0(xC,xi),esk22_2(X1,X2)) != X1
| ~ aSubsetOf0(X2,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ isCountable0(X2)
| ~ aElementOf0(X1,xT) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,hypothesis,
xd = sdtlpdtrp0(xC,xi),
inference(split_conjunct,[status(thm)],[m__4448_02]) ).
cnf(c_0_10,hypothesis,
( sdtlpdtrp0(xd,X1) = xu
| ~ aSet0(X1)
| ~ aElementOf0(X1,slbdtsldtrb0(xX,xk)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,negated_conjecture,
( aElementOf0(esk22_2(X1,X2),slbdtsldtrb0(X2,xk))
| ~ aSubsetOf0(X2,xY)
| ~ isCountable0(X2)
| ~ aElementOf0(X1,xT) ),
inference(rw,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_12,hypothesis,
aSubsetOf0(xX,xY),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,hypothesis,
isCountable0(xX),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,negated_conjecture,
( sdtlpdtrp0(xd,esk22_2(X1,X2)) != X1
| ~ aSubsetOf0(X2,xY)
| ~ isCountable0(X2)
| ~ aElementOf0(X1,xT) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9]),c_0_7]) ).
cnf(c_0_15,hypothesis,
( sdtlpdtrp0(xd,esk22_2(X1,xX)) = xu
| ~ aElementOf0(X1,xT)
| ~ aSet0(esk22_2(X1,xX)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13])]) ).
cnf(c_0_16,hypothesis,
aElementOf0(xu,xT),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_17,negated_conjecture,
( aSet0(esk22_2(X1,X2))
| ~ aSubsetOf0(X2,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ isCountable0(X2)
| ~ aElementOf0(X1,xT) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_18,negated_conjecture,
~ aSet0(esk22_2(xu,xX)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_12]),c_0_13])])]),c_0_16])]) ).
cnf(c_0_19,negated_conjecture,
( aSet0(esk22_2(X1,X2))
| ~ aSubsetOf0(X2,xY)
| ~ isCountable0(X2)
| ~ aElementOf0(X1,xT) ),
inference(rw,[status(thm)],[c_0_17,c_0_7]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_12]),c_0_13]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : NUM592+1 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.10 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.11/0.30 % Computer : n016.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 300
% 0.11/0.30 % WCLimit : 300
% 0.11/0.30 % DateTime : Tue May 5 00:48:36 EDT 2026
% 0.11/0.30 % CPUTime :
% 0.11/0.31 % start to proof: theBenchmark
% 2.15/1.92 % Version : CSE_E---1.7
% 2.15/1.92 % Problem : theBenchmark.p
% 2.15/1.92 % SZS status Theorem for theBenchmark.p
% 2.15/1.92 % SZS output start CNFRefutation
% See solution above
% 2.15/1.93 % Total time : 1.371s
%------------------------------------------------------------------------------