%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM588+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n003.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 : Thu Sep 24 01:49:41 PM UTC 2026
% Result : Theorem 0.19s 5.87s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 1
% Syntax : Number of formulae : 10 ( 4 unt; 0 def)
% Number of atoms : 148 ( 14 equ)
% Maximal formula atoms : 44 ( 14 avg)
% Number of connectives : 169 ( 31 ~; 24 |; 78 &)
% ( 6 <=>; 30 =>; 0 <=; 0 <~>)
% Maximal formula depth : 35 ( 9 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-2 aty)
% Number of variables : 38 ( 0 sgn 36 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ! [X2] :
( ( isCountable0(X2)
& aSubsetOf0(X2,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1)))) )
& aSet0(X2)
& ! [X3] :
( aElementOf0(X3,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
<=> ( X3 != szmzizndt0(sdtlpdtrp0(xN,X1))
& aElementOf0(X3,sdtlpdtrp0(xN,X1))
& aElement0(X3) ) )
& aSet0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& ! [X3] :
( aElementOf0(X3,sdtlpdtrp0(xN,X1))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X1)),X3) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X1)),sdtlpdtrp0(xN,X1)) )
=> ! [X3] :
( ( aElementOf0(X3,slbdtsldtrb0(X2,xk))
& sbrdtbr0(X3) = xk
& aSubsetOf0(X3,X2)
& ! [X4] :
( aElementOf0(X4,X3)
=> aElementOf0(X4,X2) )
& aSet0(X3) )
=> ( ( ! [X4] :
( aElementOf0(X4,sdtlpdtrp0(xN,X1))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X1)),X4) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X1)),sdtlpdtrp0(xN,X1)) )
=> ( ( ! [X4] :
( aElementOf0(X4,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
<=> ( X4 != szmzizndt0(sdtlpdtrp0(xN,X1))
& aElementOf0(X4,sdtlpdtrp0(xN,X1))
& aElement0(X4) ) )
& aSet0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1)))) )
=> ( aElementOf0(X3,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))),xk))
| aSubsetOf0(X3,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
| ! [X4] :
( aElementOf0(X4,X3)
=> aElementOf0(X4,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1)))) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(c_0_1,negated_conjecture,
~ ! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ! [X2] :
( ( isCountable0(X2)
& aSubsetOf0(X2,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1)))) )
& aSet0(X2)
& ! [X3] :
( aElementOf0(X3,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
<=> ( X3 != szmzizndt0(sdtlpdtrp0(xN,X1))
& aElementOf0(X3,sdtlpdtrp0(xN,X1))
& aElement0(X3) ) )
& aSet0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& ! [X3] :
( aElementOf0(X3,sdtlpdtrp0(xN,X1))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X1)),X3) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X1)),sdtlpdtrp0(xN,X1)) )
=> ! [X3] :
( ( aElementOf0(X3,slbdtsldtrb0(X2,xk))
& sbrdtbr0(X3) = xk
& aSubsetOf0(X3,X2)
& ! [X4] :
( aElementOf0(X4,X3)
=> aElementOf0(X4,X2) )
& aSet0(X3) )
=> ( ( ! [X4] :
( aElementOf0(X4,sdtlpdtrp0(xN,X1))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X1)),X4) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X1)),sdtlpdtrp0(xN,X1)) )
=> ( ( ! [X4] :
( aElementOf0(X4,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
<=> ( X4 != szmzizndt0(sdtlpdtrp0(xN,X1))
& aElementOf0(X4,sdtlpdtrp0(xN,X1))
& aElement0(X4) ) )
& aSet0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1)))) )
=> ( aElementOf0(X3,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))),xk))
| aSubsetOf0(X3,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
| ! [X4] :
( aElementOf0(X4,X3)
=> aElementOf0(X4,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1)))) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_2,negated_conjecture,
~ ! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ! [X2] :
( ( isCountable0(X2)
& aSubsetOf0(X2,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1)))) )
& aSet0(X2)
& ! [X3] :
( aElementOf0(X3,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
<=> ( X3 != szmzizndt0(sdtlpdtrp0(xN,X1))
& aElementOf0(X3,sdtlpdtrp0(xN,X1))
& aElement0(X3) ) )
& aSet0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& ! [X3] :
( aElementOf0(X3,sdtlpdtrp0(xN,X1))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X1)),X3) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X1)),sdtlpdtrp0(xN,X1)) )
=> ! [X3] :
( ( aElementOf0(X3,slbdtsldtrb0(X2,xk))
& sbrdtbr0(X3) = xk
& aSubsetOf0(X3,X2)
& ! [X4] :
( aElementOf0(X4,X3)
=> aElementOf0(X4,X2) )
& aSet0(X3) )
=> ( ( ! [X4] :
( aElementOf0(X4,sdtlpdtrp0(xN,X1))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X1)),X4) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X1)),sdtlpdtrp0(xN,X1)) )
=> ( ( ! [X4] :
( aElementOf0(X4,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
<=> ( X4 != szmzizndt0(sdtlpdtrp0(xN,X1))
& aElementOf0(X4,sdtlpdtrp0(xN,X1))
& aElement0(X4) ) )
& aSet0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1)))) )
=> ( aElementOf0(X3,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))),xk))
| aSubsetOf0(X3,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
| ! [X4] :
( aElementOf0(X4,X3)
=> aElementOf0(X4,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1)))) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_3,negated_conjecture,
! [X61,X62,X63,X65,X66,X67] :
( ~ aElementOf0(esk17_0,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,esk15_0),szmzizndt0(sdtlpdtrp0(xN,esk15_0))),xk))
& ~ aSubsetOf0(esk17_0,sdtmndt0(sdtlpdtrp0(xN,esk15_0),szmzizndt0(sdtlpdtrp0(xN,esk15_0))))
& ~ aElementOf0(esk18_0,sdtmndt0(sdtlpdtrp0(xN,esk15_0),szmzizndt0(sdtlpdtrp0(xN,esk15_0))))
& aElementOf0(esk18_0,esk17_0)
& ( aElementOf0(X67,sdtmndt0(sdtlpdtrp0(xN,esk15_0),szmzizndt0(sdtlpdtrp0(xN,esk15_0))))
| X67 = szmzizndt0(sdtlpdtrp0(xN,esk15_0))
| ~ aElementOf0(X67,sdtlpdtrp0(xN,esk15_0))
| ~ aElement0(X67) )
& ( ~ aElementOf0(X67,sdtmndt0(sdtlpdtrp0(xN,esk15_0),szmzizndt0(sdtlpdtrp0(xN,esk15_0))))
| X67 != szmzizndt0(sdtlpdtrp0(xN,esk15_0)) )
& ( ~ aElementOf0(X67,sdtmndt0(sdtlpdtrp0(xN,esk15_0),szmzizndt0(sdtlpdtrp0(xN,esk15_0))))
| aElementOf0(X67,sdtlpdtrp0(xN,esk15_0)) )
& ( ~ aElementOf0(X67,sdtmndt0(sdtlpdtrp0(xN,esk15_0),szmzizndt0(sdtlpdtrp0(xN,esk15_0))))
| aElement0(X67) )
& aSet0(sdtmndt0(sdtlpdtrp0(xN,esk15_0),szmzizndt0(sdtlpdtrp0(xN,esk15_0))))
& ( sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,esk15_0)),X66)
| ~ aElementOf0(X66,sdtlpdtrp0(xN,esk15_0)) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,esk15_0)),sdtlpdtrp0(xN,esk15_0))
& aElementOf0(esk17_0,slbdtsldtrb0(esk16_0,xk))
& sbrdtbr0(esk17_0) = xk
& aSubsetOf0(esk17_0,esk16_0)
& ( aElementOf0(X65,esk16_0)
| ~ aElementOf0(X65,esk17_0) )
& aSet0(esk17_0)
& isCountable0(esk16_0)
& aSubsetOf0(esk16_0,sdtmndt0(sdtlpdtrp0(xN,esk15_0),szmzizndt0(sdtlpdtrp0(xN,esk15_0))))
& ( aElementOf0(X63,sdtmndt0(sdtlpdtrp0(xN,esk15_0),szmzizndt0(sdtlpdtrp0(xN,esk15_0))))
| ~ aElementOf0(X63,esk16_0) )
& aSet0(esk16_0)
& ( aElementOf0(X62,sdtmndt0(sdtlpdtrp0(xN,esk15_0),szmzizndt0(sdtlpdtrp0(xN,esk15_0))))
| X62 = szmzizndt0(sdtlpdtrp0(xN,esk15_0))
| ~ aElementOf0(X62,sdtlpdtrp0(xN,esk15_0))
| ~ aElement0(X62) )
& ( ~ aElementOf0(X62,sdtmndt0(sdtlpdtrp0(xN,esk15_0),szmzizndt0(sdtlpdtrp0(xN,esk15_0))))
| X62 != szmzizndt0(sdtlpdtrp0(xN,esk15_0)) )
& ( ~ aElementOf0(X62,sdtmndt0(sdtlpdtrp0(xN,esk15_0),szmzizndt0(sdtlpdtrp0(xN,esk15_0))))
| aElementOf0(X62,sdtlpdtrp0(xN,esk15_0)) )
& ( ~ aElementOf0(X62,sdtmndt0(sdtlpdtrp0(xN,esk15_0),szmzizndt0(sdtlpdtrp0(xN,esk15_0))))
| aElement0(X62) )
& aSet0(sdtmndt0(sdtlpdtrp0(xN,esk15_0),szmzizndt0(sdtlpdtrp0(xN,esk15_0))))
& ( sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,esk15_0)),X61)
| ~ aElementOf0(X61,sdtlpdtrp0(xN,esk15_0)) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,esk15_0)),sdtlpdtrp0(xN,esk15_0))
& aElementOf0(esk15_0,szNzAzT0) ),
inference(distribute,[status(thm)],[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_2])])])])])]) ).
cnf(c_0_4,negated_conjecture,
~ aElementOf0(esk18_0,sdtmndt0(sdtlpdtrp0(xN,esk15_0),szmzizndt0(sdtlpdtrp0(xN,esk15_0)))),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_5,negated_conjecture,
( ~ aElementOf0(X1,esk16_0)
| aElementOf0(X1,sdtmndt0(sdtlpdtrp0(xN,esk15_0),szmzizndt0(sdtlpdtrp0(xN,esk15_0)))) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
~ aElementOf0(esk18_0,esk16_0),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,negated_conjecture,
( ~ aElementOf0(X1,esk17_0)
| aElementOf0(X1,esk16_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,negated_conjecture,
aElementOf0(esk18_0,esk17_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_9,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM588+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/5.40 % Computer : n003.cluster.edu
% 0.14/5.40 % Model : x86_64 x86_64
% 0.14/5.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/5.40 % Memory : 8046.5625MB
% 0.14/5.40 % OS : Linux 6.8.0-71-generic
% 0.14/5.40 % CPULimit : 300
% 0.14/5.40 % WCLimit : 300
% 0.14/5.40 % DateTime : Mon Sep 21 02:43:50 UTC 2026
% 0.14/5.41 % CPUTime :
% 0.14/5.41 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/5.47 Running first-order theorem proving
% 0.14/5.47 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/5.87 % Version: 3.5.1
% 0.19/5.87 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/5.87 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/5.87 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/5.87 % Starting new_bool_3 with 300s (1) cores
% 0.19/5.87 % Starting new_bool_1 with 300s (1) cores
% 0.19/5.87 % Starting sh5l with 300s (1) cores
% 0.19/5.87 % new_bool_3 with pid 3236022 completed with status 0
% 0.19/5.87 % Result found by new_bool_3
% 0.19/5.87 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/5.87 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/5.87 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/5.87 % Starting new_bool_3 with 300s (1) cores
% 0.19/5.87 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.19/5.87 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/5.87 % Search class: FGHSF-SMLM32-MFFFFFNN
% 0.19/5.87 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/5.87 % Starting SubtermCWHack with 31s (1) cores
% 0.19/5.87 % SubtermCWHack with pid 3236025 completed with status 0
% 0.19/5.87 % Result found by SubtermCWHack
% 0.19/5.87 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/5.87 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/5.87 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/5.87 % Starting new_bool_3 with 300s (1) cores
% 0.19/5.87 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.19/5.87 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/5.87 % Search class: FGHSF-SMLM32-MFFFFFNN
% 0.19/5.87 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/5.87 % Starting SubtermCWHack with 31s (1) cores
% 0.19/5.87 % Preprocessing time : 0.089 s
% 0.19/5.87
% 0.19/5.87 % Proof found!
% 0.19/5.87 % SZS status Theorem
% 0.19/5.87 % SZS output start CNFRefutation
% See solution above
% 0.19/5.87 % Parsed axioms : 88
% 0.19/5.87 % Removed by relevancy pruning/SinE : 5
% 0.19/5.87 % Initial clauses : 4419
% 0.19/5.87 % Removed in clause preprocessing : 7
% 0.19/5.87 % Initial clauses in saturation : 4412
% 0.19/5.87 % Processed clauses : 327
% 0.19/5.87 % ...of these trivial : 3
% 0.19/5.87 % ...subsumed : 49
% 0.19/5.87 % ...remaining for further processing : 275
% 0.19/5.87 % Other redundant clauses eliminated : 23
% 0.19/5.87 % Clauses deleted for lack of memory : 0
% 0.19/5.87 % Backward-subsumed : 15
% 0.19/5.87 % Backward-rewritten : 5
% 0.19/5.87 % Generated clauses : 409
% 0.19/5.87 % ...of the previous two non-redundant : 333
% 0.19/5.87 % ...aggressively subsumed : 0
% 0.19/5.87 % Contextual simplify-reflections : 6
% 0.19/5.87 % Paramodulations : 385
% 0.19/5.87 % Factorizations : 0
% 0.19/5.87 % NegExts : 0
% 0.19/5.87 % Equation resolutions : 24
% 0.19/5.87 % Disequality decompositions : 0
% 0.19/5.87 % Total rewrite steps : 277
% 0.19/5.87 % ...of those cached : 232
% 0.19/5.87 % Propositional unsat checks : 0
% 0.19/5.87 % Propositional check models : 0
% 0.19/5.87 % Propositional check unsatisfiable : 0
% 0.19/5.87 % Propositional clauses : 0
% 0.19/5.87 % Propositional clauses after purity: 0
% 0.19/5.87 % Propositional unsat core size : 0
% 0.19/5.87 % Propositional preprocessing time : 0.000
% 0.19/5.87 % Propositional encoding time : 0.000
% 0.19/5.87 % Propositional solver time : 0.000
% 0.19/5.87 % Success case prop preproc time : 0.000
% 0.19/5.87 % Success case prop encoding time : 0.000
% 0.19/5.87 % Success case prop solver time : 0.000
% 0.19/5.87 % Current number of processed clauses : 236
% 0.19/5.87 % Positive orientable unit clauses : 62
% 0.19/5.87 % Positive unorientable unit clauses: 0
% 0.19/5.87 % Negative unit clauses : 20
% 0.19/5.87 % Non-unit-clauses : 154
% 0.19/5.87 % Current number of unprocessed clauses: 4396
% 0.19/5.87 % ...number of literals in the above : 52540
% 0.19/5.87 % Current number of archived formulas : 0
% 0.19/5.87 % Current number of archived clauses : 22
% 0.19/5.87 % Clause-clause subsumption calls (NU) : 3166
% 0.19/5.87 % Rec. Clause-clause subsumption calls : 2178
% 0.19/5.87 % Non-unit clause-clause subsumptions : 44
% 0.19/5.87 % Unit Clause-clause subsumption calls : 521
% 0.19/5.87 % Rewrite failures with RHS unbound : 0
% 0.19/5.87 % BW rewrite match attempts : 7
% 0.19/5.87 % BW rewrite match successes : 7
% 0.19/5.87 % Condensation attempts : 0
% 0.19/5.87 % Condensation successes : 0
% 0.19/5.87 % Termbank termtop insertions : 354698
% 0.19/5.87 % Search garbage collected termcells : 28618
% 0.19/5.87
% 0.19/5.87 % -------------------------------------------------
% 0.19/5.87 % User time : 0.332 s
% 0.19/5.87 % System time : 0.025 s
% 0.19/5.87 % Total time : 0.357 s
% 0.19/5.87 % Maximum resident set size: 15560 pages
% 0.19/5.87
% 0.19/5.87 % -------------------------------------------------
% 0.19/5.87 % User time : 0.336 s
% 0.19/5.87 % System time : 0.032 s
% 0.19/5.87 % Total time : 0.368 s
% 0.19/5.87 % Maximum resident set size: 4864 pages
% 0.19/5.87 % E exiting
%------------------------------------------------------------------------------