%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU605^1 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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 21 03:28:30 EDT 2024
% Result : Theorem 0.35s 0.54s
% Output : CNFRefutation 0.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 154
% Syntax : Number of formulae : 176 ( 10 unt; 135 typ; 0 def)
% Number of atoms : 538 ( 52 equ; 0 cnn)
% Maximal formula atoms : 154 ( 13 avg)
% Number of connectives : 1017 ( 54 ~; 36 |; 135 &; 450 @)
% ( 33 <=>; 309 =>; 0 <=; 0 <~>)
% Maximal formula depth : 175 ( 17 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 66 ( 66 >; 0 *; 0 +; 0 <<)
% Number of symbols : 138 ( 135 usr; 127 con; 0-4 aty)
% Number of variables : 208 ( 27 ^ 169 !; 12 ?; 208 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
in: $i > $i > $o ).
thf(decl_24,type,
setextAx: $o ).
thf(decl_25,type,
emptyset: $i ).
thf(decl_26,type,
emptysetAx: $o ).
thf(decl_28,type,
setadjoinAx: $o ).
thf(decl_29,type,
powerset: $i > $i ).
thf(decl_30,type,
powersetAx: $o ).
thf(decl_32,type,
setunionAx: $o ).
thf(decl_34,type,
omega0Ax: $o ).
thf(decl_35,type,
omegaSAx: $o ).
thf(decl_36,type,
omegaIndAx: $o ).
thf(decl_37,type,
replAx: $o ).
thf(decl_38,type,
foundationAx: $o ).
thf(decl_39,type,
wellorderingAx: $o ).
thf(decl_41,type,
descrp: $o ).
thf(decl_42,type,
dsetconstr: $i > ( $i > $o ) > $i ).
thf(decl_43,type,
dsetconstrI: $o ).
thf(decl_44,type,
dsetconstrEL: $o ).
thf(decl_45,type,
dsetconstrER: $o ).
thf(decl_46,type,
exuE1: $o ).
thf(decl_48,type,
prop2setE: $o ).
thf(decl_49,type,
emptysetE: $o ).
thf(decl_50,type,
emptysetimpfalse: $o ).
thf(decl_51,type,
notinemptyset: $o ).
thf(decl_52,type,
exuE3e: $o ).
thf(decl_53,type,
setext: $o ).
thf(decl_54,type,
emptyI: $o ).
thf(decl_55,type,
noeltsimpempty: $o ).
thf(decl_56,type,
setbeta: $o ).
thf(decl_57,type,
nonempty: $i > $o ).
thf(decl_58,type,
nonemptyE1: $o ).
thf(decl_59,type,
nonemptyI: $o ).
thf(decl_60,type,
nonemptyI1: $o ).
thf(decl_61,type,
setadjoinIL: $o ).
thf(decl_62,type,
emptyinunitempty: $o ).
thf(decl_63,type,
setadjoinIR: $o ).
thf(decl_64,type,
setadjoinE: $o ).
thf(decl_65,type,
setadjoinOr: $o ).
thf(decl_66,type,
setoftrueEq: $o ).
thf(decl_67,type,
powersetI: $o ).
thf(decl_68,type,
emptyinPowerset: $o ).
thf(decl_69,type,
emptyInPowerset: $o ).
thf(decl_70,type,
powersetE: $o ).
thf(decl_71,type,
setunionI: $o ).
thf(decl_72,type,
setunionE: $o ).
thf(decl_73,type,
subPowSU: $o ).
thf(decl_74,type,
exuE2: $o ).
thf(decl_75,type,
nonemptyImpWitness: $o ).
thf(decl_76,type,
uniqinunit: $o ).
thf(decl_77,type,
notinsingleton: $o ).
thf(decl_78,type,
eqinunit: $o ).
thf(decl_79,type,
singletonsswitch: $o ).
thf(decl_80,type,
upairsetE: $o ).
thf(decl_81,type,
upairsetIL: $o ).
thf(decl_82,type,
upairsetIR: $o ).
thf(decl_83,type,
emptyE1: $o ).
thf(decl_84,type,
vacuousDall: $o ).
thf(decl_85,type,
quantDeMorgan1: $o ).
thf(decl_86,type,
quantDeMorgan2: $o ).
thf(decl_87,type,
quantDeMorgan3: $o ).
thf(decl_88,type,
quantDeMorgan4: $o ).
thf(decl_89,type,
prop2setI: $o ).
thf(decl_91,type,
prop2set2propI: $o ).
thf(decl_92,type,
notdexE: $o ).
thf(decl_93,type,
notdallE: $o ).
thf(decl_94,type,
exuI1: $o ).
thf(decl_95,type,
exuI3: $o ).
thf(decl_96,type,
exuI2: $o ).
thf(decl_97,type,
inCongP: $o ).
thf(decl_98,type,
in__Cong: $o ).
thf(decl_99,type,
exuE3u: $o ).
thf(decl_100,type,
exu__Cong: $o ).
thf(decl_101,type,
emptyset__Cong: $o ).
thf(decl_102,type,
setadjoin__Cong: $o ).
thf(decl_103,type,
powerset__Cong: $o ).
thf(decl_104,type,
setunion__Cong: $o ).
thf(decl_105,type,
omega__Cong: $o ).
thf(decl_106,type,
exuEu: $o ).
thf(decl_107,type,
descr__Cong: $o ).
thf(decl_108,type,
dsetconstr__Cong: $o ).
thf(decl_109,type,
subset: $i > $i > $o ).
thf(decl_112,type,
subsetI1: $o ).
thf(decl_113,type,
eqimpsubset2: $o ).
thf(decl_114,type,
eqimpsubset1: $o ).
thf(decl_115,type,
subsetI2: $o ).
thf(decl_116,type,
emptysetsubset: $o ).
thf(decl_117,type,
subsetE: $o ).
thf(decl_118,type,
subsetE2: $o ).
thf(decl_119,type,
notsubsetI: $o ).
thf(decl_120,type,
notequalI1: $o ).
thf(decl_121,type,
notequalI2: $o ).
thf(decl_122,type,
subsetRefl: $o ).
thf(decl_123,type,
subsetTrans: $o ).
thf(decl_124,type,
setadjoinSub: $o ).
thf(decl_125,type,
setadjoinSub2: $o ).
thf(decl_126,type,
subset2powerset: $o ).
thf(decl_127,type,
setextsub: $o ).
thf(decl_128,type,
subsetemptysetimpeq: $o ).
thf(decl_129,type,
powersetI1: $o ).
thf(decl_130,type,
powersetE1: $o ).
thf(decl_131,type,
inPowerset: $o ).
thf(decl_132,type,
powersetsubset: $o ).
thf(decl_133,type,
sepInPowerset: $o ).
thf(decl_134,type,
sepSubset: $o ).
thf(decl_136,type,
binunionIL: $o ).
thf(decl_137,type,
upairset2IR: $o ).
thf(decl_138,type,
binunionIR: $o ).
thf(decl_139,type,
binunionEcases: $o ).
thf(decl_140,type,
binunionE: $o ).
thf(decl_141,type,
binunionLsub: $o ).
thf(decl_142,type,
binunionRsub: $o ).
thf(decl_144,type,
binintersectI: $o ).
thf(decl_145,type,
binintersectSubset5: $o ).
thf(decl_146,type,
binintersectEL: $o ).
thf(decl_147,type,
binintersectLsub: $o ).
thf(decl_148,type,
binintersectSubset2: $o ).
thf(decl_149,type,
binintersectSubset3: $o ).
thf(decl_150,type,
binintersectER: $o ).
thf(decl_151,type,
disjointsetsI1: $o ).
thf(decl_152,type,
binintersectRsub: $o ).
thf(decl_153,type,
binintersectSubset4: $o ).
thf(decl_154,type,
binintersectSubset1: $o ).
thf(decl_155,type,
bs114d: $o ).
thf(decl_157,type,
setminus: $i > $i > $i ).
thf(decl_158,type,
setminusI: $o ).
thf(decl_159,type,
setminusEL: $o ).
thf(decl_160,type,
setminusER: $o ).
thf(decl_161,type,
setminusSubset2: $o ).
thf(decl_162,type,
esk1_1: $i > $i ).
thf(decl_163,type,
esk2_1: $i > $i ).
thf(decl_164,type,
esk3_4: $i > $i > ( $i > $o ) > ( $i > $o ) > $i ).
thf(decl_165,type,
esk4_4: $i > $i > ( $i > $o ) > ( $i > $o ) > $i ).
thf(decl_166,type,
esk5_0: $i ).
thf(decl_167,type,
esk6_0: $i ).
thf(decl_168,type,
esk7_0: $i ).
thf(nonempty,axiom,
( nonempty
= ( ^ [X2: $i] : ( X2 != emptyset ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nonempty) ).
thf(nonemptyI,axiom,
( nonemptyI
<=> ! [X4: $i,X1: $i > $o,X2: $i] :
( ( in @ X2 @ X4 )
=> ( ( X1 @ X2 )
=> ( nonempty
@ ( dsetconstr @ X4
@ ^ [X3: $i] : ( X1 @ X3 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nonemptyI) ).
thf(sepSubset,axiom,
( sepSubset
<=> ! [X4: $i,X1: $i > $o] :
( subset
@ ( dsetconstr @ X4
@ ^ [X2: $i] : ( X1 @ X2 ) )
@ X4 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sepSubset) ).
thf(sepInPowerset,axiom,
( sepInPowerset
<=> ! [X4: $i,X1: $i > $o] :
( in
@ ( dsetconstr @ X4
@ ^ [X2: $i] : ( X1 @ X2 ) )
@ ( powerset @ X4 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sepInPowerset) ).
thf(dsetconstr__Cong,axiom,
( dsetconstr__Cong
<=> ! [X4: $i,X5: $i] :
( ( X4 = X5 )
=> ! [X1: $i > $o,X17: $i > $o] :
( ! [X2: $i] :
( ( in @ X2 @ X4 )
=> ! [X3: $i] :
( ( in @ X3 @ X5 )
=> ( ( X2 = X3 )
=> ( ( X1 @ X2 )
<=> ( X17 @ X3 ) ) ) ) )
=> ( ( dsetconstr @ X4
@ ^ [X2: $i] : ( X1 @ X2 ) )
= ( dsetconstr @ X5
@ ^ [X2: $i] : ( X17 @ X2 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dsetconstr__Cong) ).
thf(emptyE1,axiom,
( emptyE1
<=> ! [X4: $i,X1: $i > $o] :
( ? [X2: $i] :
( ( in @ X2 @ X4 )
& ( X1 @ X2 ) )
=> ( ( ( dsetconstr @ X4
@ ^ [X2: $i] : ( X1 @ X2 ) )
= emptyset )
=> ~ $true ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',emptyE1) ).
thf(setoftrueEq,axiom,
( setoftrueEq
<=> ! [X4: $i] :
( ( dsetconstr @ X4
@ ^ [X2: $i] : $true )
= X4 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setoftrueEq) ).
thf(setbeta,axiom,
( setbeta
<=> ! [X4: $i,X1: $i > $o,X2: $i] :
( ( in @ X2 @ X4 )
=> ( ( in @ X2
@ ( dsetconstr @ X4
@ ^ [X3: $i] : ( X1 @ X3 ) ) )
<=> ( X1 @ X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setbeta) ).
thf(dsetconstrER,axiom,
( dsetconstrER
<=> ! [X4: $i,X1: $i > $o,X2: $i] :
( ( in @ X2
@ ( dsetconstr @ X4
@ ^ [X3: $i] : ( X1 @ X3 ) ) )
=> ( X1 @ X2 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dsetconstrER) ).
thf(dsetconstrEL,axiom,
( dsetconstrEL
<=> ! [X4: $i,X1: $i > $o,X2: $i] :
( ( in @ X2
@ ( dsetconstr @ X4
@ ^ [X3: $i] : ( X1 @ X3 ) ) )
=> ( in @ X2 @ X4 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dsetconstrEL) ).
thf(dsetconstrI,axiom,
( dsetconstrI
<=> ! [X4: $i,X1: $i > $o,X2: $i] :
( ( in @ X2 @ X4 )
=> ( ( X1 @ X2 )
=> ( in @ X2
@ ( dsetconstr @ X4
@ ^ [X3: $i] : ( X1 @ X3 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dsetconstrI) ).
thf(nonemptyImpWitness,axiom,
( nonemptyImpWitness
<=> ! [X4: $i] :
( ( nonempty @ X4 )
=> ? [X2: $i] :
( ( in @ X2 @ X4 )
& $true ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nonemptyImpWitness) ).
thf(nonemptyI1,axiom,
( nonemptyI1
<=> ! [X4: $i] :
( ? [X2: $i] : ( in @ X2 @ X4 )
=> ( nonempty @ X4 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nonemptyI1) ).
thf(nonemptyE1,axiom,
( nonemptyE1
<=> ! [X4: $i] :
( ( nonempty @ X4 )
=> ? [X2: $i] : ( in @ X2 @ X4 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nonemptyE1) ).
thf(setminusERneg,conjecture,
( setextAx
=> ( emptysetAx
=> ( setadjoinAx
=> ( powersetAx
=> ( setunionAx
=> ( omega0Ax
=> ( omegaSAx
=> ( omegaIndAx
=> ( replAx
=> ( foundationAx
=> ( wellorderingAx
=> ( descrp
=> ( dsetconstrI
=> ( dsetconstrEL
=> ( dsetconstrER
=> ( exuE1
=> ( prop2setE
=> ( emptysetE
=> ( emptysetimpfalse
=> ( notinemptyset
=> ( exuE3e
=> ( setext
=> ( emptyI
=> ( noeltsimpempty
=> ( setbeta
=> ( nonemptyE1
=> ( nonemptyI
=> ( nonemptyI1
=> ( setadjoinIL
=> ( emptyinunitempty
=> ( setadjoinIR
=> ( setadjoinE
=> ( setadjoinOr
=> ( setoftrueEq
=> ( powersetI
=> ( emptyinPowerset
=> ( emptyInPowerset
=> ( powersetE
=> ( setunionI
=> ( setunionE
=> ( subPowSU
=> ( exuE2
=> ( nonemptyImpWitness
=> ( uniqinunit
=> ( notinsingleton
=> ( eqinunit
=> ( singletonsswitch
=> ( upairsetE
=> ( upairsetIL
=> ( upairsetIR
=> ( emptyE1
=> ( vacuousDall
=> ( quantDeMorgan1
=> ( quantDeMorgan2
=> ( quantDeMorgan3
=> ( quantDeMorgan4
=> ( prop2setI
=> ( prop2set2propI
=> ( notdexE
=> ( notdallE
=> ( exuI1
=> ( exuI3
=> ( exuI2
=> ( inCongP
=> ( in__Cong
=> ( exuE3u
=> ( exu__Cong
=> ( emptyset__Cong
=> ( setadjoin__Cong
=> ( powerset__Cong
=> ( setunion__Cong
=> ( omega__Cong
=> ( exuEu
=> ( descr__Cong
=> ( dsetconstr__Cong
=> ( subsetI1
=> ( eqimpsubset2
=> ( eqimpsubset1
=> ( subsetI2
=> ( emptysetsubset
=> ( subsetE
=> ( subsetE2
=> ( notsubsetI
=> ( notequalI1
=> ( notequalI2
=> ( subsetRefl
=> ( subsetTrans
=> ( setadjoinSub
=> ( setadjoinSub2
=> ( subset2powerset
=> ( setextsub
=> ( subsetemptysetimpeq
=> ( powersetI1
=> ( powersetE1
=> ( inPowerset
=> ( powersetsubset
=> ( sepInPowerset
=> ( sepSubset
=> ( binunionIL
=> ( upairset2IR
=> ( binunionIR
=> ( binunionEcases
=> ( binunionE
=> ( binunionLsub
=> ( binunionRsub
=> ( binintersectI
=> ( binintersectSubset5
=> ( binintersectEL
=> ( binintersectLsub
=> ( binintersectSubset2
=> ( binintersectSubset3
=> ( binintersectER
=> ( disjointsetsI1
=> ( binintersectRsub
=> ( binintersectSubset4
=> ( binintersectSubset1
=> ( bs114d
=> ( setminusI
=> ( setminusEL
=> ( setminusER
=> ( setminusSubset2
=> ! [X4: $i,X5: $i,X2: $i] :
( ~ ( in @ X2 @ ( setminus @ X4 @ X5 ) )
=> ( ( in @ X2 @ X4 )
=> ( in @ X2 @ X5 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setminusERneg) ).
thf(setminusI,axiom,
( setminusI
<=> ! [X4: $i,X5: $i,X2: $i] :
( ( in @ X2 @ X4 )
=> ( ~ ( in @ X2 @ X5 )
=> ( in @ X2 @ ( setminus @ X4 @ X5 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setminusI) ).
thf(setminusSubset2,axiom,
( setminusSubset2
<=> ! [X4: $i,X5: $i] :
( ( subset @ X4 @ X5 )
=> ( ( setminus @ X4 @ X5 )
= emptyset ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setminusSubset2) ).
thf(setminusER,axiom,
( setminusER
<=> ! [X4: $i,X5: $i,X2: $i] :
( ( in @ X2 @ ( setminus @ X4 @ X5 ) )
=> ~ ( in @ X2 @ X5 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setminusER) ).
thf(setminusEL,axiom,
( setminusEL
<=> ! [X4: $i,X5: $i,X2: $i] :
( ( in @ X2 @ ( setminus @ X4 @ X5 ) )
=> ( in @ X2 @ X4 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setminusEL) ).
thf(c_0_19,plain,
( nonempty
= ( ^ [Z0: $i] : ( Z0 != emptyset ) ) ),
inference(fof_simplification,[status(thm)],[nonempty]) ).
thf(c_0_20,plain,
( nonemptyI
<=> ! [X4: $i,X1: $i > $o,X2: $i] :
( ( in @ X2 @ X4 )
=> ( ( X1 @ X2 )
=> ( nonempty
@ ( dsetconstr @ X4
@ ^ [Z0: $i] : ( X1 @ Z0 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[nonemptyI]) ).
thf(c_0_21,plain,
( sepSubset
<=> ! [X4: $i,X1: $i > $o] :
( subset
@ ( dsetconstr @ X4
@ ^ [Z0: $i] : ( X1 @ Z0 ) )
@ X4 ) ),
inference(fof_simplification,[status(thm)],[sepSubset]) ).
thf(c_0_22,plain,
( sepInPowerset
<=> ! [X4: $i,X1: $i > $o] :
( in
@ ( dsetconstr @ X4
@ ^ [Z0: $i] : ( X1 @ Z0 ) )
@ ( powerset @ X4 ) ) ),
inference(fof_simplification,[status(thm)],[sepInPowerset]) ).
thf(c_0_23,plain,
( dsetconstr__Cong
<=> ! [X4: $i,X5: $i] :
( ( X4 = X5 )
=> ! [X1: $i > $o,X17: $i > $o] :
( ! [X2: $i] :
( ( in @ X2 @ X4 )
=> ! [X3: $i] :
( ( in @ X3 @ X5 )
=> ( ( X2 = X3 )
=> ( ( X1 @ X2 )
<=> ( X17 @ X3 ) ) ) ) )
=> ( ( dsetconstr @ X4
@ ^ [Z0: $i] : ( X1 @ Z0 ) )
= ( dsetconstr @ X5
@ ^ [Z0: $i] : ( X17 @ Z0 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[dsetconstr__Cong]) ).
thf(c_0_24,plain,
( emptyE1
<=> ! [X4: $i,X1: $i > $o] :
( ? [X2: $i] :
( ( in @ X2 @ X4 )
& ( X1 @ X2 ) )
=> ( ( ( dsetconstr @ X4
@ ^ [Z0: $i] : ( X1 @ Z0 ) )
= emptyset )
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[emptyE1]) ).
thf(c_0_25,plain,
( setoftrueEq
<=> ! [X4: $i] :
( ( dsetconstr @ X4
@ ^ [Z0: $i] : $true )
= X4 ) ),
inference(fof_simplification,[status(thm)],[setoftrueEq]) ).
thf(c_0_26,plain,
( setbeta
<=> ! [X4: $i,X1: $i > $o,X2: $i] :
( ( in @ X2 @ X4 )
=> ( ( in @ X2
@ ( dsetconstr @ X4
@ ^ [Z0: $i] : ( X1 @ Z0 ) ) )
<=> ( X1 @ X2 ) ) ) ),
inference(fof_simplification,[status(thm)],[setbeta]) ).
thf(c_0_27,plain,
( dsetconstrER
<=> ! [X4: $i,X1: $i > $o,X2: $i] :
( ( in @ X2
@ ( dsetconstr @ X4
@ ^ [Z0: $i] : ( X1 @ Z0 ) ) )
=> ( X1 @ X2 ) ) ),
inference(fof_simplification,[status(thm)],[dsetconstrER]) ).
thf(c_0_28,plain,
( dsetconstrEL
<=> ! [X4: $i,X1: $i > $o,X2: $i] :
( ( in @ X2
@ ( dsetconstr @ X4
@ ^ [Z0: $i] : ( X1 @ Z0 ) ) )
=> ( in @ X2 @ X4 ) ) ),
inference(fof_simplification,[status(thm)],[dsetconstrEL]) ).
thf(c_0_29,plain,
( dsetconstrI
<=> ! [X4: $i,X1: $i > $o,X2: $i] :
( ( in @ X2 @ X4 )
=> ( ( X1 @ X2 )
=> ( in @ X2
@ ( dsetconstr @ X4
@ ^ [Z0: $i] : ( X1 @ Z0 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[dsetconstrI]) ).
thf(c_0_30,axiom,
( nonemptyImpWitness
= ( ! [X4: $i] :
( ( X4 != emptyset )
=> ? [X2: $i] :
( ( in @ X2 @ X4 )
& $true ) ) ) ),
inference(apply_def,[status(thm)],[nonemptyImpWitness,c_0_19]) ).
thf(c_0_31,axiom,
( nonemptyI1
= ( ! [X4: $i] :
( ? [X2: $i] : ( in @ X2 @ X4 )
=> ( X4 != emptyset ) ) ) ),
inference(apply_def,[status(thm)],[nonemptyI1,c_0_19]) ).
thf(c_0_32,plain,
( nonemptyI
= ( ! [X4: $i,X1: $i > $o,X2: $i] :
( ( in @ X2 @ X4 )
=> ( ( X1 @ X2 )
=> ( ( dsetconstr @ X4
@ ^ [Z0: $i] : ( X1 @ Z0 ) )
!= emptyset ) ) ) ) ),
inference(apply_def,[status(thm)],[c_0_20,c_0_19]) ).
thf(c_0_33,axiom,
( nonemptyE1
= ( ! [X4: $i] :
( ( X4 != emptyset )
=> ? [X2: $i] : ( in @ X2 @ X4 ) ) ) ),
inference(apply_def,[status(thm)],[nonemptyE1,c_0_19]) ).
thf(c_0_34,negated_conjecture,
~ ( setextAx
=> ( emptysetAx
=> ( setadjoinAx
=> ( powersetAx
=> ( setunionAx
=> ( omega0Ax
=> ( omegaSAx
=> ( omegaIndAx
=> ( replAx
=> ( foundationAx
=> ( wellorderingAx
=> ( descrp
=> ( ! [X69: $i,X70: $i > $o,X71: $i] :
( ( in @ X71 @ X69 )
=> ( ( X70 @ X71 )
=> ( in @ X71 @ ( dsetconstr @ X69 @ X70 ) ) ) )
=> ( ! [X72: $i,X73: $i > $o,X74: $i] :
( ( in @ X74 @ ( dsetconstr @ X72 @ X73 ) )
=> ( in @ X74 @ X72 ) )
=> ( ! [X75: $i,X76: $i > $o,X77: $i] :
( ( in @ X77 @ ( dsetconstr @ X75 @ X76 ) )
=> ( X76 @ X77 ) )
=> ( exuE1
=> ( prop2setE
=> ( emptysetE
=> ( emptysetimpfalse
=> ( notinemptyset
=> ( exuE3e
=> ( setext
=> ( emptyI
=> ( noeltsimpempty
=> ( ! [X78: $i,X79: $i > $o,X80: $i] :
( ( in @ X80 @ X78 )
=> ( ( in @ X80 @ ( dsetconstr @ X78 @ X79 ) )
<=> ( X79 @ X80 ) ) )
=> ( ! [X81: $i] :
( ( X81 != emptyset )
=> ? [X82: $i] : ( in @ X82 @ X81 ) )
=> ( ! [X83: $i,X84: $i > $o,X85: $i] :
( ( in @ X85 @ X83 )
=> ( ( X84 @ X85 )
=> ( ( dsetconstr @ X83 @ X84 )
!= emptyset ) ) )
=> ( ! [X86: $i] :
( ? [X87: $i] : ( in @ X87 @ X86 )
=> ( X86 != emptyset ) )
=> ( setadjoinIL
=> ( emptyinunitempty
=> ( setadjoinIR
=> ( setadjoinE
=> ( setadjoinOr
=> ( ! [X88: $i] :
( ( dsetconstr @ X88
@ ^ [Z0: $i] : $true )
= X88 )
=> ( powersetI
=> ( emptyinPowerset
=> ( emptyInPowerset
=> ( powersetE
=> ( setunionI
=> ( setunionE
=> ( subPowSU
=> ( exuE2
=> ( ! [X89: $i] :
( ( X89 != emptyset )
=> ? [X90: $i] :
( ( in @ X90 @ X89 )
& $true ) )
=> ( uniqinunit
=> ( notinsingleton
=> ( eqinunit
=> ( singletonsswitch
=> ( upairsetE
=> ( upairsetIL
=> ( upairsetIR
=> ( ! [X91: $i,X92: $i > $o] :
( ? [X93: $i] :
( ( in @ X93 @ X91 )
& ( X92 @ X93 ) )
=> ( ( ( dsetconstr @ X91 @ X92 )
= emptyset )
=> ~ $true ) )
=> ( vacuousDall
=> ( quantDeMorgan1
=> ( quantDeMorgan2
=> ( quantDeMorgan3
=> ( quantDeMorgan4
=> ( prop2setI
=> ( prop2set2propI
=> ( notdexE
=> ( notdallE
=> ( exuI1
=> ( exuI3
=> ( exuI2
=> ( inCongP
=> ( in__Cong
=> ( exuE3u
=> ( exu__Cong
=> ( emptyset__Cong
=> ( setadjoin__Cong
=> ( powerset__Cong
=> ( setunion__Cong
=> ( omega__Cong
=> ( exuEu
=> ( descr__Cong
=> ( ! [X94: $i,X95: $i] :
( ( X94 = X95 )
=> ! [X96: $i > $o,X97: $i > $o] :
( ! [X98: $i] :
( ( in @ X98 @ X94 )
=> ! [X99: $i] :
( ( in @ X99 @ X95 )
=> ( ( X98 = X99 )
=> ( ( X96 @ X98 )
<=> ( X97 @ X99 ) ) ) ) )
=> ( ( dsetconstr @ X94 @ X96 )
= ( dsetconstr @ X95 @ X97 ) ) ) )
=> ( subsetI1
=> ( eqimpsubset2
=> ( eqimpsubset1
=> ( subsetI2
=> ( emptysetsubset
=> ( subsetE
=> ( subsetE2
=> ( notsubsetI
=> ( notequalI1
=> ( notequalI2
=> ( subsetRefl
=> ( subsetTrans
=> ( setadjoinSub
=> ( setadjoinSub2
=> ( subset2powerset
=> ( setextsub
=> ( subsetemptysetimpeq
=> ( powersetI1
=> ( powersetE1
=> ( inPowerset
=> ( powersetsubset
=> ( ! [X100: $i,X101: $i > $o] : ( in @ ( dsetconstr @ X100 @ X101 ) @ ( powerset @ X100 ) )
=> ( ! [X102: $i,X103: $i > $o] : ( subset @ ( dsetconstr @ X102 @ X103 ) @ X102 )
=> ( binunionIL
=> ( upairset2IR
=> ( binunionIR
=> ( binunionEcases
=> ( binunionE
=> ( binunionLsub
=> ( binunionRsub
=> ( binintersectI
=> ( binintersectSubset5
=> ( binintersectEL
=> ( binintersectLsub
=> ( binintersectSubset2
=> ( binintersectSubset3
=> ( binintersectER
=> ( disjointsetsI1
=> ( binintersectRsub
=> ( binintersectSubset4
=> ( binintersectSubset1
=> ( bs114d
=> ( ! [X104: $i,X105: $i,X106: $i] :
( ( in @ X106 @ X104 )
=> ( ~ ( in @ X106 @ X105 )
=> ( in @ X106 @ ( setminus @ X104 @ X105 ) ) ) )
=> ( ! [X107: $i,X108: $i,X109: $i] :
( ( in @ X109 @ ( setminus @ X107 @ X108 ) )
=> ( in @ X109 @ X107 ) )
=> ( ! [X110: $i,X111: $i,X112: $i] :
( ( in @ X112 @ ( setminus @ X110 @ X111 ) )
=> ~ ( in @ X112 @ X111 ) )
=> ( ! [X113: $i,X114: $i] :
( ( subset @ X113 @ X114 )
=> ( ( setminus @ X113 @ X114 )
= emptyset ) )
=> ! [X4: $i,X5: $i,X2: $i] :
( ~ ( in @ X2 @ ( setminus @ X4 @ X5 ) )
=> ( ( in @ X2 @ X4 )
=> ( in @ X2 @ X5 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[setminusERneg]),setminusI]),c_0_21]),c_0_22]),c_0_23]),c_0_24]),c_0_25]),c_0_26]),c_0_27]),c_0_28]),c_0_29]),c_0_30]),c_0_31]),c_0_32]),c_0_33]),setminusSubset2]),setminusER]),setminusEL])])]) ).
thf(c_0_35,negated_conjecture,
! [X115: $i,X116: $i > $o,X117: $i,X118: $i,X119: $i > $o,X120: $i,X121: $i,X122: $i > $o,X123: $i,X124: $i,X125: $i > $o,X126: $i,X127: $i,X129: $i,X130: $i > $o,X131: $i,X132: $i,X133: $i,X134: $i,X135: $i,X137: $i,X138: $i > $o,X139: $i,X140: $i,X141: $i,X142: $i > $o,X143: $i > $o,X146: $i,X147: $i > $o,X148: $i,X149: $i > $o,X150: $i,X151: $i,X152: $i,X153: $i,X154: $i,X155: $i,X156: $i,X157: $i,X158: $i,X159: $i,X160: $i] :
( setextAx
& emptysetAx
& setadjoinAx
& powersetAx
& setunionAx
& omega0Ax
& omegaSAx
& omegaIndAx
& replAx
& foundationAx
& wellorderingAx
& descrp
& ( ~ ( in @ X117 @ X115 )
| ~ ( X116 @ X117 )
| ( in @ X117 @ ( dsetconstr @ X115 @ X116 ) ) )
& ( ~ ( in @ X120 @ ( dsetconstr @ X118 @ X119 ) )
| ( in @ X120 @ X118 ) )
& ( ~ ( in @ X123 @ ( dsetconstr @ X121 @ X122 ) )
| ( X122 @ X123 ) )
& exuE1
& prop2setE
& emptysetE
& emptysetimpfalse
& notinemptyset
& exuE3e
& setext
& emptyI
& noeltsimpempty
& ( ~ ( in @ X126 @ ( dsetconstr @ X124 @ X125 ) )
| ( X125 @ X126 )
| ~ ( in @ X126 @ X124 ) )
& ( ~ ( X125 @ X126 )
| ( in @ X126 @ ( dsetconstr @ X124 @ X125 ) )
| ~ ( in @ X126 @ X124 ) )
& ( ( X127 = emptyset )
| ( in @ ( esk1_1 @ X127 ) @ X127 ) )
& ( ~ ( in @ X131 @ X129 )
| ~ ( X130 @ X131 )
| ( ( dsetconstr @ X129 @ X130 )
!= emptyset ) )
& ( ~ ( in @ X133 @ X132 )
| ( X132 != emptyset ) )
& setadjoinIL
& emptyinunitempty
& setadjoinIR
& setadjoinE
& setadjoinOr
& ( ( dsetconstr @ X134
@ ^ [Z0: $i] : $true )
= X134 )
& powersetI
& emptyinPowerset
& emptyInPowerset
& powersetE
& setunionI
& setunionE
& subPowSU
& exuE2
& ( ( in @ ( esk2_1 @ X135 ) @ X135 )
| ( X135 = emptyset ) )
& ( $true
| ( X135 = emptyset ) )
& uniqinunit
& notinsingleton
& eqinunit
& singletonsswitch
& upairsetE
& upairsetIL
& upairsetIR
& ( ~ ( in @ X139 @ X137 )
| ~ ( X138 @ X139 )
| ( ( dsetconstr @ X137 @ X138 )
!= emptyset )
| ~ $true )
& vacuousDall
& quantDeMorgan1
& quantDeMorgan2
& quantDeMorgan3
& quantDeMorgan4
& prop2setI
& prop2set2propI
& notdexE
& notdallE
& exuI1
& exuI3
& exuI2
& inCongP
& in__Cong
& exuE3u
& exu__Cong
& emptyset__Cong
& setadjoin__Cong
& powerset__Cong
& setunion__Cong
& omega__Cong
& exuEu
& descr__Cong
& ( ( in @ ( esk3_4 @ X140 @ X141 @ X142 @ X143 ) @ X140 )
| ( ( dsetconstr @ X140 @ X142 )
= ( dsetconstr @ X141 @ X143 ) )
| ( X140 != X141 ) )
& ( ( in @ ( esk4_4 @ X140 @ X141 @ X142 @ X143 ) @ X141 )
| ( ( dsetconstr @ X140 @ X142 )
= ( dsetconstr @ X141 @ X143 ) )
| ( X140 != X141 ) )
& ( ( ( esk3_4 @ X140 @ X141 @ X142 @ X143 )
= ( esk4_4 @ X140 @ X141 @ X142 @ X143 ) )
| ( ( dsetconstr @ X140 @ X142 )
= ( dsetconstr @ X141 @ X143 ) )
| ( X140 != X141 ) )
& ( ~ ( X142 @ ( esk3_4 @ X140 @ X141 @ X142 @ X143 ) )
| ~ ( X143 @ ( esk4_4 @ X140 @ X141 @ X142 @ X143 ) )
| ( ( dsetconstr @ X140 @ X142 )
= ( dsetconstr @ X141 @ X143 ) )
| ( X140 != X141 ) )
& ( ( X142 @ ( esk3_4 @ X140 @ X141 @ X142 @ X143 ) )
| ( X143 @ ( esk4_4 @ X140 @ X141 @ X142 @ X143 ) )
| ( ( dsetconstr @ X140 @ X142 )
= ( dsetconstr @ X141 @ X143 ) )
| ( X140 != X141 ) )
& subsetI1
& eqimpsubset2
& eqimpsubset1
& subsetI2
& emptysetsubset
& subsetE
& subsetE2
& notsubsetI
& notequalI1
& notequalI2
& subsetRefl
& subsetTrans
& setadjoinSub
& setadjoinSub2
& subset2powerset
& setextsub
& subsetemptysetimpeq
& powersetI1
& powersetE1
& inPowerset
& powersetsubset
& ( in @ ( dsetconstr @ X146 @ X147 ) @ ( powerset @ X146 ) )
& ( subset @ ( dsetconstr @ X148 @ X149 ) @ X148 )
& binunionIL
& upairset2IR
& binunionIR
& binunionEcases
& binunionE
& binunionLsub
& binunionRsub
& binintersectI
& binintersectSubset5
& binintersectEL
& binintersectLsub
& binintersectSubset2
& binintersectSubset3
& binintersectER
& disjointsetsI1
& binintersectRsub
& binintersectSubset4
& binintersectSubset1
& bs114d
& ( ~ ( in @ X152 @ X150 )
| ( in @ X152 @ X151 )
| ( in @ X152 @ ( setminus @ X150 @ X151 ) ) )
& ( ~ ( in @ X155 @ ( setminus @ X153 @ X154 ) )
| ( in @ X155 @ X153 ) )
& ( ~ ( in @ X158 @ ( setminus @ X156 @ X157 ) )
| ~ ( in @ X158 @ X157 ) )
& ( ~ ( subset @ X159 @ X160 )
| ( ( setminus @ X159 @ X160 )
= emptyset ) )
& ~ ( in @ esk7_0 @ ( setminus @ esk5_0 @ esk6_0 ) )
& ( in @ esk7_0 @ esk5_0 )
& ~ ( in @ esk7_0 @ esk6_0 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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)],[c_0_34])])])])])])]) ).
thf(c_0_36,negated_conjecture,
~ ( in @ esk7_0 @ ( setminus @ esk5_0 @ esk6_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
thf(c_0_37,negated_conjecture,
! [X2: $i,X4: $i,X3: $i] :
( ( in @ X2 @ X4 )
| ( in @ X2 @ ( setminus @ X3 @ X4 ) )
| ~ ( in @ X2 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
thf(c_0_38,negated_conjecture,
in @ esk7_0 @ esk5_0,
inference(split_conjunct,[status(thm)],[c_0_35]) ).
thf(c_0_39,negated_conjecture,
~ ( in @ esk7_0 @ esk6_0 ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
thf(c_0_40,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38])]),c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU605^1 : TPTP v8.2.0. Released v3.7.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n023.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 16:31:08 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.50 Running higher-order theorem proving
% 0.20/0.50 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.35/0.54 # Version: 3.1.0-ho
% 0.35/0.54 # Preprocessing class: HSLMSLSSLLLCHFA.
% 0.35/0.54 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.35/0.54 # Starting ehoh_best5 with 300s (1) cores
% 0.35/0.54 # Starting almost_fo_3_lam with 300s (1) cores
% 0.35/0.54 # Starting new_bool_5 with 300s (1) cores
% 0.35/0.54 # Starting pre_casc_3 with 300s (1) cores
% 0.35/0.54 # Starting ho_unfolding_8 with 300s (1) cores
% 0.35/0.54 # Starting new_ho_10_cnf2 with 300s (1) cores
% 0.35/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.35/0.54 # Starting new_ho_5 with 300s (1) cores
% 0.35/0.54 # pre_casc_3 with pid 9808 completed with status 0
% 0.35/0.54 # Result found by pre_casc_3
% 0.35/0.54 # Preprocessing class: HSLMSLSSLLLCHFA.
% 0.35/0.54 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.35/0.54 # Starting ehoh_best5 with 300s (1) cores
% 0.35/0.54 # Starting almost_fo_3_lam with 300s (1) cores
% 0.35/0.54 # Starting new_bool_5 with 300s (1) cores
% 0.35/0.54 # Starting pre_casc_3 with 300s (1) cores
% 0.35/0.54 # SinE strategy is GSinE(CountFormulas,hypos,10,,5,20000,3.0,true)
% 0.35/0.54 # Search class: HGHSM-FFMM32-SHFMMFBN
% 0.35/0.54 # partial match(2): HGHSM-FFMM31-SHFMMSBN
% 0.35/0.54 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.35/0.54 # Starting new_ho_10 with 163s (1) cores
% 0.35/0.54 # new_ho_10 with pid 9813 completed with status 0
% 0.35/0.54 # Result found by new_ho_10
% 0.35/0.54 # Preprocessing class: HSLMSLSSLLLCHFA.
% 0.35/0.54 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.35/0.54 # Starting ehoh_best5 with 300s (1) cores
% 0.35/0.54 # Starting almost_fo_3_lam with 300s (1) cores
% 0.35/0.54 # Starting new_bool_5 with 300s (1) cores
% 0.35/0.54 # Starting pre_casc_3 with 300s (1) cores
% 0.35/0.54 # SinE strategy is GSinE(CountFormulas,hypos,10,,5,20000,3.0,true)
% 0.35/0.54 # Search class: HGHSM-FFMM32-SHFMMFBN
% 0.35/0.54 # partial match(2): HGHSM-FFMM31-SHFMMSBN
% 0.35/0.54 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.35/0.54 # Starting new_ho_10 with 163s (1) cores
% 0.35/0.54 # Preprocessing time : 0.002 s
% 0.35/0.54 # Presaturation interreduction done
% 0.35/0.54
% 0.35/0.54 # Proof found!
% 0.35/0.54 # SZS status Theorem
% 0.35/0.54 # SZS output start CNFRefutation
% See solution above
% 0.35/0.54 # Parsed axioms : 264
% 0.35/0.54 # Removed by relevancy pruning/SinE : 245
% 0.35/0.54 # Initial clauses : 132
% 0.35/0.54 # Removed in clause preprocessing : 2
% 0.35/0.54 # Initial clauses in saturation : 130
% 0.35/0.54 # Processed clauses : 260
% 0.35/0.54 # ...of these trivial : 0
% 0.35/0.54 # ...subsumed : 4
% 0.35/0.54 # ...remaining for further processing : 256
% 0.35/0.54 # Other redundant clauses eliminated : 7
% 0.35/0.54 # Clauses deleted for lack of memory : 0
% 0.35/0.54 # Backward-subsumed : 0
% 0.35/0.54 # Backward-rewritten : 0
% 0.35/0.54 # Generated clauses : 28
% 0.35/0.54 # ...of the previous two non-redundant : 19
% 0.35/0.54 # ...aggressively subsumed : 0
% 0.35/0.54 # Contextual simplify-reflections : 0
% 0.35/0.54 # Paramodulations : 21
% 0.35/0.54 # Factorizations : 0
% 0.35/0.54 # NegExts : 0
% 0.35/0.54 # Equation resolutions : 7
% 0.35/0.54 # Disequality decompositions : 0
% 0.35/0.54 # Total rewrite steps : 4
% 0.35/0.54 # ...of those cached : 1
% 0.35/0.54 # Propositional unsat checks : 0
% 0.35/0.54 # Propositional check models : 0
% 0.35/0.54 # Propositional check unsatisfiable : 0
% 0.35/0.54 # Propositional clauses : 0
% 0.35/0.54 # Propositional clauses after purity: 0
% 0.35/0.54 # Propositional unsat core size : 0
% 0.35/0.54 # Propositional preprocessing time : 0.000
% 0.35/0.54 # Propositional encoding time : 0.000
% 0.35/0.54 # Propositional solver time : 0.000
% 0.35/0.54 # Success case prop preproc time : 0.000
% 0.35/0.54 # Success case prop encoding time : 0.000
% 0.35/0.54 # Success case prop solver time : 0.000
% 0.35/0.54 # Current number of processed clauses : 123
% 0.35/0.54 # Positive orientable unit clauses : 110
% 0.35/0.54 # Positive unorientable unit clauses: 0
% 0.35/0.54 # Negative unit clauses : 3
% 0.35/0.54 # Non-unit-clauses : 10
% 0.35/0.54 # Current number of unprocessed clauses: 16
% 0.35/0.54 # ...number of literals in the above : 31
% 0.35/0.54 # Current number of archived formulas : 0
% 0.35/0.54 # Current number of archived clauses : 127
% 0.35/0.54 # Clause-clause subsumption calls (NU) : 53
% 0.35/0.54 # Rec. Clause-clause subsumption calls : 43
% 0.35/0.54 # Non-unit clause-clause subsumptions : 3
% 0.35/0.54 # Unit Clause-clause subsumption calls : 7
% 0.35/0.54 # Rewrite failures with RHS unbound : 0
% 0.35/0.54 # BW rewrite match attempts : 1
% 0.35/0.54 # BW rewrite match successes : 0
% 0.35/0.54 # Condensation attempts : 260
% 0.35/0.54 # Condensation successes : 0
% 0.35/0.54 # Termbank termtop insertions : 9812
% 0.35/0.54 # Search garbage collected termcells : 4111
% 0.35/0.54
% 0.35/0.54 # -------------------------------------------------
% 0.35/0.54 # User time : 0.013 s
% 0.35/0.54 # System time : 0.007 s
% 0.35/0.54 # Total time : 0.020 s
% 0.35/0.54 # Maximum resident set size: 2756 pages
% 0.35/0.54
% 0.35/0.54 # -------------------------------------------------
% 0.35/0.54 # User time : 0.021 s
% 0.35/0.54 # System time : 0.008 s
% 0.35/0.54 # Total time : 0.029 s
% 0.35/0.54 # Maximum resident set size: 1988 pages
% 0.35/0.54 % E---3.1 exiting
% 0.35/0.54 % E exiting
%------------------------------------------------------------------------------