%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU556^1 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n004.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Sep 30 08:24:30 AM UTC 2026
% Result : Theorem 0.22s 0.27s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 13 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 314 ( 14 equ; 0 cnn)
% Maximal formula atoms : 78 ( 24 avg)
% Number of connectives : 338 ( 6 ~; 2 |; 79 &; 23 @)
% ( 0 <=>; 228 =>; 0 <=; 0 <~>)
% Maximal formula depth : 81 ( 26 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% Number of symbols : 79 ( 77 usr; 76 con; 0-2 aty)
% Number of variables : 21 ( 4 ^; 14 !; 3 ?; 21 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_24,type,
exu: ( $i > $o ) > $o ).
thf(decl_25,type,
setextAx: $o ).
thf(decl_27,type,
emptysetAx: $o ).
thf(decl_29,type,
setadjoinAx: $o ).
thf(decl_31,type,
powersetAx: $o ).
thf(decl_33,type,
setunionAx: $o ).
thf(decl_35,type,
omega0Ax: $o ).
thf(decl_36,type,
omegaSAx: $o ).
thf(decl_37,type,
omegaIndAx: $o ).
thf(decl_38,type,
replAx: $o ).
thf(decl_39,type,
foundationAx: $o ).
thf(decl_40,type,
wellorderingAx: $o ).
thf(decl_42,type,
descrp: $o ).
thf(decl_44,type,
dsetconstrI: $o ).
thf(decl_45,type,
dsetconstrEL: $o ).
thf(decl_46,type,
dsetconstrER: $o ).
thf(decl_47,type,
exuE1: $o ).
thf(decl_49,type,
prop2setE: $o ).
thf(decl_50,type,
emptysetE: $o ).
thf(decl_51,type,
emptysetimpfalse: $o ).
thf(decl_52,type,
notinemptyset: $o ).
thf(decl_53,type,
exuE3e: $o ).
thf(decl_54,type,
setext: $o ).
thf(decl_55,type,
emptyI: $o ).
thf(decl_56,type,
noeltsimpempty: $o ).
thf(decl_57,type,
setbeta: $o ).
thf(decl_59,type,
nonemptyE1: $o ).
thf(decl_60,type,
nonemptyI: $o ).
thf(decl_61,type,
nonemptyI1: $o ).
thf(decl_62,type,
setadjoinIL: $o ).
thf(decl_63,type,
emptyinunitempty: $o ).
thf(decl_64,type,
setadjoinIR: $o ).
thf(decl_65,type,
setadjoinE: $o ).
thf(decl_66,type,
setadjoinOr: $o ).
thf(decl_67,type,
setoftrueEq: $o ).
thf(decl_68,type,
powersetI: $o ).
thf(decl_69,type,
emptyinPowerset: $o ).
thf(decl_70,type,
emptyInPowerset: $o ).
thf(decl_71,type,
powersetE: $o ).
thf(decl_72,type,
setunionI: $o ).
thf(decl_73,type,
setunionE: $o ).
thf(decl_74,type,
subPowSU: $o ).
thf(decl_75,type,
exuE2: $o ).
thf(decl_76,type,
nonemptyImpWitness: $o ).
thf(decl_77,type,
uniqinunit: $o ).
thf(decl_78,type,
notinsingleton: $o ).
thf(decl_79,type,
eqinunit: $o ).
thf(decl_80,type,
singletonsswitch: $o ).
thf(decl_81,type,
upairsetE: $o ).
thf(decl_82,type,
upairsetIL: $o ).
thf(decl_83,type,
upairsetIR: $o ).
thf(decl_84,type,
emptyE1: $o ).
thf(decl_85,type,
vacuousDall: $o ).
thf(decl_86,type,
quantDeMorgan1: $o ).
thf(decl_87,type,
quantDeMorgan2: $o ).
thf(decl_88,type,
quantDeMorgan3: $o ).
thf(decl_89,type,
quantDeMorgan4: $o ).
thf(decl_90,type,
prop2setI: $o ).
thf(decl_92,type,
prop2set2propI: $o ).
thf(decl_93,type,
notdexE: $o ).
thf(decl_94,type,
notdallE: $o ).
thf(decl_95,type,
exuI1: $o ).
thf(decl_96,type,
exuI3: $o ).
thf(decl_97,type,
exuI2: $o ).
thf(decl_98,type,
inCongP: $o ).
thf(decl_99,type,
in__Cong: $o ).
thf(decl_100,type,
exuE3u: $o ).
thf(decl_101,type,
exu__Cong: $o ).
thf(decl_102,type,
emptyset__Cong: $o ).
thf(decl_103,type,
setadjoin__Cong: $o ).
thf(decl_104,type,
powerset__Cong: $o ).
thf(decl_105,type,
setunion__Cong: $o ).
thf(decl_106,type,
omega__Cong: $o ).
thf(decl_107,type,
epred1_0: $i > $o ).
thf(decl_108,type,
esk1_0: $i ).
thf(decl_109,type,
esk2_0: $i ).
thf(decl_110,type,
esk3_0: $i ).
thf(exuEu,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
=> ! [X1: $i > $o] :
( ( exu
@ ^ [X2: $i] : ( X1 @ X2 ) )
=> ! [X2: $i,X3: $i] :
( ( X1 @ X2 )
=> ( ( X1 @ X3 )
=> ( X2 = X3 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.MNy3pX0vw6/E---3.1_1318635.p',exuEu) ).
thf(exu,axiom,
( exu
= ( ^ [X1: $i > $o] :
? [X2: $i] :
( ( X1 @ X2 )
& ! [X3: $i] :
( ( X1 @ X3 )
=> ( X2 = X3 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.MNy3pX0vw6/E---3.1_1318635.p',exu) ).
thf(c_0_2,negated_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
=> ! [X1: $i > $o] :
( ( exu
@ ^ [X2: $i] : ( X1 @ X2 ) )
=> ! [X2: $i,X3: $i] :
( ( X1 @ X2 )
=> ( ( X1 @ X3 )
=> ( X2 = X3 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[exuEu]) ).
thf(c_0_3,plain,
( exu
= ( ^ [Z0: $i > $o] :
? [X2: $i] :
( ( Z0 @ X2 )
& ! [X3: $i] :
( ( Z0 @ X3 )
=> ( X2 = X3 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[exu]) ).
thf(c_0_4,negated_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
=> ! [X1: $i > $o] :
( ? [X22: $i] :
( ( X1 @ X22 )
& ! [X23: $i] :
( ( X1 @ X23 )
=> ( X22 = X23 ) ) )
=> ! [X2: $i,X3: $i] :
( ( X1 @ X2 )
=> ( ( X1 @ X3 )
=> ( X2 = X3 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_2]),c_0_3]) ).
thf(c_0_5,negated_conjecture,
! [X26: $i] :
( 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
& ( epred1_0 @ esk1_0 )
& ( ~ ( epred1_0 @ X26 )
| ( esk1_0 = X26 ) )
& ( epred1_0 @ esk2_0 )
& ( epred1_0 @ esk3_0 )
& ( esk2_0 != esk3_0 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])]) ).
thf(c_0_6,negated_conjecture,
! [X2: $i] :
( ( esk1_0 = X2 )
| ~ ( epred1_0 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_7,negated_conjecture,
epred1_0 @ esk3_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_8,negated_conjecture,
epred1_0 @ esk2_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_9,negated_conjecture,
esk2_0 != esk3_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_10,negated_conjecture,
esk3_0 = esk1_0,
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
thf(c_0_11,negated_conjecture,
esk2_0 = esk1_0,
inference(spm,[status(thm)],[c_0_6,c_0_8]) ).
thf(c_0_12,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU556^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.17 % Computer : n004.cluster.edu
% 0.09/0.17 % Model : x86_64 x86_64
% 0.09/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.17 % Memory : 8046.5625MB
% 0.09/0.17 % OS : Linux 6.8.0-71-generic
% 0.09/0.17 % CPULimit : 300
% 0.09/0.17 % WCLimit : 300
% 0.09/0.17 % DateTime : Tue Sep 29 13:49:52 UTC 2026
% 0.09/0.17 % CPUTime :
% 0.09/0.17 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.22 Running higher-order theorem proving
% 0.09/0.24 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/tmp/tmp.MNy3pX0vw6/E---3.1_1318635.p
% 0.22/0.27 % Version: 3.5.1-ho
% 0.22/0.27 % Preprocessing class: HSMSSLSSLLLCHSA.
% 0.22/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.27 % Starting new_ho_9 with 1500s (5) cores
% 0.22/0.27 % Starting post_as_ho9 with 300s (1) cores
% 0.22/0.27 % Starting sh2lt with 300s (1) cores
% 0.22/0.27 % Starting full_lambda_10 with 300s (1) cores
% 0.22/0.27 % post_as_ho9 with pid 1318656 completed with status 0
% 0.22/0.27 % Result found by post_as_ho9
% 0.22/0.27 % Preprocessing class: HSMSSLSSLLLCHSA.
% 0.22/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.27 % Starting new_ho_9 with 1500s (5) cores
% 0.22/0.27 % Starting post_as_ho9 with 300s (1) cores
% 0.22/0.27 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 0, sine = GSinE(CountFormulas,,true,1,0,2,20000,1.0,true))
% 0.22/0.27 % SinE strategy is GSinE(CountFormulas,,true,1,0,2,20000,1.0,true)
% 0.22/0.27 % Search class: HHUSF-FFSM00-SHSMMFNN
% 0.22/0.27 % partial match(2): HHUSF-FFSF00-SHSSMFNN
% 0.22/0.27 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.27 % Starting SubtermCWHack with 28s (1) cores
% 0.22/0.27 % SubtermCWHack with pid 1318661 completed with status 0
% 0.22/0.27 % Result found by SubtermCWHack
% 0.22/0.27 % Preprocessing class: HSMSSLSSLLLCHSA.
% 0.22/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.27 % Starting new_ho_9 with 1500s (5) cores
% 0.22/0.27 % Starting post_as_ho9 with 300s (1) cores
% 0.22/0.27 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 0, sine = GSinE(CountFormulas,,true,1,0,2,20000,1.0,true))
% 0.22/0.27 % SinE strategy is GSinE(CountFormulas,,true,1,0,2,20000,1.0,true)
% 0.22/0.27 % Search class: HHUSF-FFSM00-SHSMMFNN
% 0.22/0.27 % partial match(2): HHUSF-FFSF00-SHSSMFNN
% 0.22/0.27 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.27 % Starting SubtermCWHack with 28s (1) cores
% 0.22/0.27 % Preprocessing time : 0.001 s
% 0.22/0.27
% 0.22/0.27 % Proof found!
% 0.22/0.27 % SZS status Theorem
% 0.22/0.27 % SZS output start CNFRefutation
% See solution above
% 0.22/0.27 % Parsed axioms : 159
% 0.22/0.27 % Removed by relevancy pruning/SinE : 157
% 0.22/0.27 % Initial clauses : 77
% 0.22/0.27 % Removed in clause preprocessing : 0
% 0.22/0.27 % Initial clauses in saturation : 77
% 0.22/0.27 % Processed clauses : 80
% 0.22/0.27 % ...of these trivial : 0
% 0.22/0.27 % ...subsumed : 0
% 0.22/0.27 % ...remaining for further processing : 79
% 0.22/0.27 % Other redundant clauses eliminated : 0
% 0.22/0.27 % Clauses deleted for lack of memory : 0
% 0.22/0.27 % Backward-subsumed : 0
% 0.22/0.27 % Backward-rewritten : 3
% 0.22/0.27 % Generated clauses : 2
% 0.22/0.27 % ...of the previous two non-redundant : 3
% 0.22/0.27 % ...aggressively subsumed : 0
% 0.22/0.27 % Contextual simplify-reflections : 0
% 0.22/0.27 % Paramodulations : 2
% 0.22/0.27 % Factorizations : 0
% 0.22/0.27 % NegExts : 0
% 0.22/0.27 % Equation resolutions : 0
% 0.22/0.27 % Disequality decompositions : 0
% 0.22/0.27 % Total rewrite steps : 6
% 0.22/0.27 % ...of those cached : 3
% 0.22/0.27 % Propositional unsat checks : 0
% 0.22/0.27 % Propositional check models : 0
% 0.22/0.27 % Propositional check unsatisfiable : 0
% 0.22/0.27 % Propositional clauses : 0
% 0.22/0.27 % Propositional clauses after purity: 0
% 0.22/0.27 % Propositional unsat core size : 0
% 0.22/0.27 % Propositional preprocessing time : 0.000
% 0.22/0.27 % Propositional encoding time : 0.000
% 0.22/0.27 % Propositional solver time : 0.000
% 0.22/0.27 % Success case prop preproc time : 0.000
% 0.22/0.27 % Success case prop encoding time : 0.000
% 0.22/0.27 % Success case prop solver time : 0.000
% 0.22/0.27 % Current number of processed clauses : 76
% 0.22/0.27 % Positive orientable unit clauses : 75
% 0.22/0.27 % Positive unorientable unit clauses: 0
% 0.22/0.27 % Negative unit clauses : 0
% 0.22/0.27 % Non-unit-clauses : 1
% 0.22/0.27 % Current number of unprocessed clauses: 0
% 0.22/0.27 % ...number of literals in the above : 0
% 0.22/0.27 % Current number of archived formulas : 0
% 0.22/0.27 % Current number of archived clauses : 3
% 0.22/0.27 % Clause-clause subsumption calls (NU) : 0
% 0.22/0.27 % Rec. Clause-clause subsumption calls : 0
% 0.22/0.27 % Non-unit clause-clause subsumptions : 0
% 0.22/0.27 % Unit Clause-clause subsumption calls : 0
% 0.22/0.27 % Rewrite failures with RHS unbound : 0
% 0.22/0.27 % BW rewrite match attempts : 2
% 0.22/0.27 % BW rewrite match successes : 2
% 0.22/0.27 % Condensation attempts : 0
% 0.22/0.27 % Condensation successes : 0
% 0.22/0.27 % Termbank termtop insertions : 4313
% 0.22/0.27 % Search garbage collected termcells : 1771
% 0.22/0.27
% 0.22/0.27 % -------------------------------------------------
% 0.22/0.27 % User time : 0.005 s
% 0.22/0.27 % System time : 0.002 s
% 0.22/0.27 % Total time : 0.007 s
% 0.22/0.27 % Maximum resident set size: 4052 pages
% 0.22/0.27
% 0.22/0.27 % -------------------------------------------------
% 0.22/0.27 % User time : 0.011 s
% 0.22/0.27 % System time : 0.006 s
% 0.22/0.27 % Total time : 0.016 s
% 0.22/0.27 % Maximum resident set size: 5120 pages
% 0.22/0.27 % E exiting
%------------------------------------------------------------------------------