%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : NUM633+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 : n003.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:58:12 PM UTC 2026
% Result : Theorem 1.40s 1.76s
% Output : CNFRefutation 1.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 14 ( 5 unt; 0 def)
% Number of atoms : 57 ( 12 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 67 ( 24 ~; 18 |; 19 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% 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 : 17 ( 0 sgn 7 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ! [X1] :
( aElementOf0(X1,slbdtsldtrb0(xO,xK))
=> ( X1 != slcrc0
& aSubsetOf0(X1,szNzAzT0)
& aElementOf0(X1,szDzozmdt0(xc))
& sdtlpdtrp0(xc,X1) = szDzizrdt0(xd) ) )
=> ? [X1] :
( aElementOf0(X1,xT)
& ? [X2] :
( aSubsetOf0(X2,xS)
& isCountable0(X2)
& ! [X3] :
( aElementOf0(X3,slbdtsldtrb0(X2,xK))
=> sdtlpdtrp0(xc,X3) = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(m__4998,hypothesis,
aSubsetOf0(xO,xS),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4998) ).
fof(m__4908,hypothesis,
( aSet0(xO)
& isCountable0(xO) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4908) ).
fof(m__4854,hypothesis,
( aElementOf0(szDzizrdt0(xd),xT)
& isCountable0(sdtlbdtrb0(xd,szDzizrdt0(xd))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4854) ).
fof(c_0_4,negated_conjecture,
~ ( ! [X1] :
( aElementOf0(X1,slbdtsldtrb0(xO,xK))
=> ( X1 != slcrc0
& aSubsetOf0(X1,szNzAzT0)
& aElementOf0(X1,szDzozmdt0(xc))
& sdtlpdtrp0(xc,X1) = szDzizrdt0(xd) ) )
=> ? [X1] :
( aElementOf0(X1,xT)
& ? [X2] :
( aSubsetOf0(X2,xS)
& isCountable0(X2)
& ! [X3] :
( aElementOf0(X3,slbdtsldtrb0(X2,xK))
=> sdtlpdtrp0(xc,X3) = X1 ) ) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_5,negated_conjecture,
! [X375,X376,X377] :
( ( X375 != slcrc0
| ~ aElementOf0(X375,slbdtsldtrb0(xO,xK)) )
& ( aSubsetOf0(X375,szNzAzT0)
| ~ aElementOf0(X375,slbdtsldtrb0(xO,xK)) )
& ( aElementOf0(X375,szDzozmdt0(xc))
| ~ aElementOf0(X375,slbdtsldtrb0(xO,xK)) )
& ( sdtlpdtrp0(xc,X375) = szDzizrdt0(xd)
| ~ aElementOf0(X375,slbdtsldtrb0(xO,xK)) )
& ( aElementOf0(esk26_2(X376,X377),slbdtsldtrb0(X377,xK))
| ~ aSubsetOf0(X377,xS)
| ~ isCountable0(X377)
| ~ aElementOf0(X376,xT) )
& ( sdtlpdtrp0(xc,esk26_2(X376,X377)) != X376
| ~ aSubsetOf0(X377,xS)
| ~ isCountable0(X377)
| ~ aElementOf0(X376,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_4])])])])]) ).
cnf(c_0_6,negated_conjecture,
( sdtlpdtrp0(xc,X1) = szDzizrdt0(xd)
| ~ aElementOf0(X1,slbdtsldtrb0(xO,xK)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_7,negated_conjecture,
( aElementOf0(esk26_2(X1,X2),slbdtsldtrb0(X2,xK))
| ~ aSubsetOf0(X2,xS)
| ~ isCountable0(X2)
| ~ aElementOf0(X1,xT) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,hypothesis,
aSubsetOf0(xO,xS),
inference(split_conjunct,[status(thm)],[m__4998]) ).
cnf(c_0_9,hypothesis,
isCountable0(xO),
inference(split_conjunct,[status(thm)],[m__4908]) ).
cnf(c_0_10,negated_conjecture,
( sdtlpdtrp0(xc,esk26_2(X1,X2)) != X1
| ~ aSubsetOf0(X2,xS)
| ~ isCountable0(X2)
| ~ aElementOf0(X1,xT) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,negated_conjecture,
( sdtlpdtrp0(xc,esk26_2(X1,xO)) = szDzizrdt0(xd)
| ~ aElementOf0(X1,xT) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]),c_0_9])]) ).
cnf(c_0_12,hypothesis,
aElementOf0(szDzizrdt0(xd),xT),
inference(split_conjunct,[status(thm)],[m__4854]) ).
cnf(c_0_13,negated_conjecture,
$false,
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_10,c_0_11]),c_0_8]),c_0_9])])]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM633+1 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.12 % 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.16/0.33 % Computer : n003.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Tue May 5 00:52:26 EDT 2026
% 0.16/0.34 % CPUTime :
% 0.16/0.35 % start to proof: theBenchmark
% 1.40/1.76 % Version : CSE_E---1.7
% 1.40/1.76 % Problem : theBenchmark.p
% 1.40/1.76 % SZS status Theorem for theBenchmark.p
% 1.40/1.76 % SZS output start CNFRefutation
% See solution above
% 1.40/1.76 % Total time : 1.374s
%------------------------------------------------------------------------------