%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : NUM606+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 : n018.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:00 PM UTC 2026
% Result : Theorem 1.38s 1.75s
% Output : CNFRefutation 1.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 22 ( 10 unt; 0 def)
% Number of atoms : 65 ( 1 equ)
% Maximal formula atoms : 15 ( 2 avg)
% Number of connectives : 73 ( 30 ~; 28 |; 10 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 23 ( 0 sgn 13 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mSubTrans,axiom,
! [X1,X2,X3] :
( ( aSet0(X1)
& aSet0(X2)
& aSet0(X3) )
=> ( ( aSubsetOf0(X1,X2)
& aSubsetOf0(X2,X3) )
=> aSubsetOf0(X1,X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSubTrans) ).
fof(mDefSub,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aSubsetOf0(X2,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,X1) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefSub) ).
fof(m__3435,hypothesis,
( aSubsetOf0(xS,szNzAzT0)
& isCountable0(xS) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3435) ).
fof(mNATSet,axiom,
( aSet0(szNzAzT0)
& isCountable0(szNzAzT0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mNATSet) ).
fof(m__4998,hypothesis,
aSubsetOf0(xO,xS),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4998) ).
fof(m__,conjecture,
aSubsetOf0(xQ,szNzAzT0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(m__5093,hypothesis,
( aSubsetOf0(xQ,xO)
& xQ != slcrc0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5093) ).
fof(c_0_7,plain,
! [X196,X197,X198] :
( ~ aSet0(X196)
| ~ aSet0(X197)
| ~ aSet0(X198)
| ~ aSubsetOf0(X196,X197)
| ~ aSubsetOf0(X197,X198)
| aSubsetOf0(X196,X198) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSubTrans])]) ).
fof(c_0_8,plain,
! [X186,X187,X188,X189] :
( ( aSet0(X187)
| ~ aSubsetOf0(X187,X186)
| ~ aSet0(X186) )
& ( ~ aElementOf0(X188,X187)
| aElementOf0(X188,X186)
| ~ aSubsetOf0(X187,X186)
| ~ aSet0(X186) )
& ( aElementOf0(esk2_2(X186,X189),X189)
| ~ aSet0(X189)
| aSubsetOf0(X189,X186)
| ~ aSet0(X186) )
& ( ~ aElementOf0(esk2_2(X186,X189),X186)
| ~ aSet0(X189)
| aSubsetOf0(X189,X186)
| ~ aSet0(X186) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefSub])])])])])]) ).
cnf(c_0_9,plain,
( aSubsetOf0(X1,X3)
| ~ aSet0(X1)
| ~ aSet0(X2)
| ~ aSet0(X3)
| ~ aSubsetOf0(X1,X2)
| ~ aSubsetOf0(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
( aSet0(X1)
| ~ aSubsetOf0(X1,X2)
| ~ aSet0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
( aSubsetOf0(X1,X2)
| ~ aSubsetOf0(X3,X2)
| ~ aSubsetOf0(X1,X3)
| ~ aSet0(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_9,c_0_10]),c_0_10]) ).
cnf(c_0_12,hypothesis,
aSubsetOf0(xS,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3435]) ).
cnf(c_0_13,plain,
aSet0(szNzAzT0),
inference(split_conjunct,[status(thm)],[mNATSet]) ).
cnf(c_0_14,hypothesis,
( aSubsetOf0(X1,szNzAzT0)
| ~ aSubsetOf0(X1,xS) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).
cnf(c_0_15,hypothesis,
aSubsetOf0(xO,xS),
inference(split_conjunct,[status(thm)],[m__4998]) ).
cnf(c_0_16,hypothesis,
aSubsetOf0(xO,szNzAzT0),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
fof(c_0_17,negated_conjecture,
~ aSubsetOf0(xQ,szNzAzT0),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
cnf(c_0_18,hypothesis,
( aSubsetOf0(X1,szNzAzT0)
| ~ aSubsetOf0(X1,xO) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_16]),c_0_13])]) ).
cnf(c_0_19,hypothesis,
aSubsetOf0(xQ,xO),
inference(split_conjunct,[status(thm)],[m__5093]) ).
cnf(c_0_20,negated_conjecture,
~ aSubsetOf0(xQ,szNzAzT0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_21,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM606+1 : 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.16/0.33 % Computer : n018.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:49:32 EDT 2026
% 0.16/0.34 % CPUTime :
% 0.16/0.35 % start to proof: theBenchmark
% 1.38/1.75 % Version : CSE_E---1.7
% 1.38/1.75 % Problem : theBenchmark.p
% 1.38/1.75 % SZS status Theorem for theBenchmark.p
% 1.38/1.75 % SZS output start CNFRefutation
% See solution above
% 1.38/1.75 % Total time : 1.375s
%------------------------------------------------------------------------------