%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : NUM565+3 : 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:51 PM UTC 2026
% Result : Theorem 2.63s 2.39s
% Output : CNFRefutation 2.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 15 ( 8 unt; 0 def)
% Number of atoms : 50 ( 22 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 50 ( 15 ~; 9 |; 18 &)
% ( 1 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn 8 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
! [X1] :
( ( aSet0(X1)
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xS) )
& aSubsetOf0(X1,xS)
& sbrdtbr0(X1) = sz00
& aElementOf0(X1,slbdtsldtrb0(xS,sz00)) )
=> ( ( aSet0(slcrc0)
& ~ ? [X2] : aElementOf0(X2,slcrc0) )
=> sdtlpdtrp0(xc,X1) = sdtlpdtrp0(xc,slcrc0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(mCardEmpty,axiom,
! [X1] :
( aSet0(X1)
=> ( sbrdtbr0(X1) = sz00
<=> X1 = slcrc0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mCardEmpty) ).
fof(m__3462,hypothesis,
xK = sz00,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3462) ).
fof(c_0_3,negated_conjecture,
~ ! [X1] :
( ( aSet0(X1)
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xS) )
& aSubsetOf0(X1,xS)
& sbrdtbr0(X1) = sz00
& aElementOf0(X1,slbdtsldtrb0(xS,sz00)) )
=> ( ( aSet0(slcrc0)
& ~ ? [X2] : aElementOf0(X2,slcrc0) )
=> sdtlpdtrp0(xc,X1) = sdtlpdtrp0(xc,slcrc0) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_4,plain,
! [X243] :
( ( sbrdtbr0(X243) != sz00
| X243 = slcrc0
| ~ aSet0(X243) )
& ( X243 != slcrc0
| sbrdtbr0(X243) = sz00
| ~ aSet0(X243) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mCardEmpty])])]) ).
fof(c_0_5,negated_conjecture,
! [X366,X367] :
( aSet0(esk31_0)
& ( ~ aElementOf0(X366,esk31_0)
| aElementOf0(X366,xS) )
& aSubsetOf0(esk31_0,xS)
& sbrdtbr0(esk31_0) = sz00
& aElementOf0(esk31_0,slbdtsldtrb0(xS,sz00))
& aSet0(slcrc0)
& ~ aElementOf0(X367,slcrc0)
& sdtlpdtrp0(xc,esk31_0) != sdtlpdtrp0(xc,slcrc0) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
cnf(c_0_6,plain,
( X1 = slcrc0
| sbrdtbr0(X1) != sz00
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,hypothesis,
xK = sz00,
inference(split_conjunct,[status(thm)],[m__3462]) ).
cnf(c_0_8,negated_conjecture,
sbrdtbr0(esk31_0) = sz00,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( X1 = slcrc0
| sbrdtbr0(X1) != xK
| ~ aSet0(X1) ),
inference(rw,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,negated_conjecture,
sbrdtbr0(esk31_0) = xK,
inference(rw,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_11,negated_conjecture,
aSet0(esk31_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,negated_conjecture,
sdtlpdtrp0(xc,esk31_0) != sdtlpdtrp0(xc,slcrc0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,negated_conjecture,
esk31_0 = slcrc0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM565+3 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.12 % 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.33 % Computer : n001.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Tue May 5 00:46:03 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 2.63/2.39 % Version : CSE_E---1.7
% 2.63/2.39 % Problem : theBenchmark.p
% 2.63/2.39 % SZS status Theorem for theBenchmark.p
% 2.63/2.39 % SZS output start CNFRefutation
% See solution above
% 2.73/2.40 % Total time : 1.769s
%------------------------------------------------------------------------------