TSTP Solution File: SEU705^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU705^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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:29:18 EDT 2024
% Result : Theorem 0.19s 0.47s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 24
% Syntax : Number of formulae : 47 ( 10 unt; 17 typ; 0 def)
% Number of atoms : 143 ( 45 equ; 0 cnn)
% Maximal formula atoms : 22 ( 4 avg)
% Number of connectives : 444 ( 44 ~; 40 |; 43 &; 284 @)
% ( 6 <=>; 27 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 9 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 25 ( 25 >; 0 *; 0 +; 0 <<)
% Number of symbols : 19 ( 17 usr; 10 con; 0-4 aty)
% Number of variables : 115 ( 27 ^ 82 !; 6 ?; 115 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
in: $i > $i > $o ).
thf(decl_23,type,
emptyset: $i ).
thf(decl_24,type,
setadjoin: $i > $i > $i ).
thf(decl_25,type,
setunion: $i > $i ).
thf(decl_26,type,
dsetconstr: $i > ( $i > $o ) > $i ).
thf(decl_27,type,
subset: $i > $i > $o ).
thf(decl_28,type,
subsetE: $o ).
thf(decl_29,type,
sepSubset: $o ).
thf(decl_30,type,
singleton: $i > $o ).
thf(decl_31,type,
theprop: $o ).
thf(decl_32,type,
ifSingleton: $o ).
thf(decl_33,type,
if: $i > $o > $i > $i > $i ).
thf(decl_34,type,
esk1_4: $i > $o > $i > $i > $i ).
thf(decl_35,type,
esk2_0: $i ).
thf(decl_36,type,
epred1_0: $o ).
thf(decl_37,type,
esk3_0: $i ).
thf(decl_38,type,
esk4_0: $i ).
thf(ifSingleton,axiom,
( ifSingleton
<=> ! [X1: $i,X6: $o,X3: $i] :
( ( in @ X3 @ X1 )
=> ! [X7: $i] :
( ( in @ X7 @ X1 )
=> ( singleton
@ ( dsetconstr @ X1
@ ^ [X8: $i] :
( ( X6
& ( X8 = X3 ) )
| ( ~ X6
& ( X8 = X7 ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifSingleton) ).
thf(singleton,axiom,
( singleton
= ( ^ [X1: $i] :
? [X3: $i] :
( ( in @ X3 @ X1 )
& ( X1
= ( setadjoin @ X3 @ emptyset ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',singleton) ).
thf(sepSubset,axiom,
( sepSubset
<=> ! [X1: $i,X4: $i > $o] :
( subset
@ ( dsetconstr @ X1
@ ^ [X3: $i] : ( X4 @ X3 ) )
@ X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sepSubset) ).
thf(if,axiom,
( if
= ( ^ [X1: $i,X9: $o,X3: $i,X7: $i] :
( setunion
@ ( dsetconstr @ X1
@ ^ [X8: $i] :
( ( X9
& ( X8 = X3 ) )
| ( ~ X9
& ( X8 = X7 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',if) ).
thf(theprop,axiom,
( theprop
<=> ! [X5: $i] :
( ( singleton @ X5 )
=> ( in @ ( setunion @ X5 ) @ X5 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',theprop) ).
thf(ifp,conjecture,
( subsetE
=> ( sepSubset
=> ( theprop
=> ( ifSingleton
=> ! [X1: $i,X10: $o,X3: $i] :
( ( in @ X3 @ X1 )
=> ! [X7: $i] :
( ( in @ X7 @ X1 )
=> ( in @ ( if @ X1 @ X10 @ X3 @ X7 ) @ X1 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifp) ).
thf(subsetE,axiom,
( subsetE
<=> ! [X1: $i,X2: $i,X3: $i] :
( ( subset @ X1 @ X2 )
=> ( ( in @ X3 @ X1 )
=> ( in @ X3 @ X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subsetE) ).
thf(c_0_7,plain,
( ifSingleton
<=> ! [X1: $i,X6: $o,X3: $i] :
( ( in @ X3 @ X1 )
=> ! [X7: $i] :
( ( in @ X7 @ X1 )
=> ( singleton
@ ( dsetconstr @ X1
@ ^ [Z0: $i] :
( ( X6
& ( Z0 = X3 ) )
| ( ~ X6
& ( Z0 = X7 ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[ifSingleton]) ).
thf(c_0_8,plain,
( singleton
= ( ^ [Z0: $i] :
? [X3: $i] :
( ( in @ X3 @ Z0 )
& ( Z0
= ( setadjoin @ X3 @ emptyset ) ) ) ) ),
inference(fof_simplification,[status(thm)],[singleton]) ).
thf(c_0_9,plain,
( sepSubset
<=> ! [X1: $i,X4: $i > $o] :
( subset
@ ( dsetconstr @ X1
@ ^ [Z0: $i] : ( X4 @ Z0 ) )
@ X1 ) ),
inference(fof_simplification,[status(thm)],[sepSubset]) ).
thf(c_0_10,plain,
( if
= ( ^ [Z0: $i,Z1: $o,Z2: $i,Z3: $i] :
( setunion
@ ( dsetconstr @ Z0
@ ^ [Z4: $i] :
( ( Z1
& ( Z4 = Z2 ) )
| ( ~ Z1
& Z4 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[if]) ).
thf(c_0_11,plain,
( ifSingleton
= ( ! [X1: $i,X6: $o,X3: $i] :
( ( in @ X3 @ X1 )
=> ! [X7: $i] :
( ( in @ X7 @ X1 )
=> ? [X26: $i] :
( ( in @ X26
@ ( dsetconstr @ X1
@ ^ [Z0: $i] :
( ( X6
& ( Z0 = X3 ) )
| ( ~ X6
& ( Z0 = X7 ) ) ) ) )
& ( ( dsetconstr @ X1
@ ^ [Z0: $i] :
( ( X6
& ( Z0 = X3 ) )
| ( ~ X6
& ( Z0 = X7 ) ) ) )
= ( setadjoin @ X26 @ emptyset ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_12,axiom,
( theprop
= ( ! [X5: $i] :
( ? [X25: $i] :
( ( in @ X25 @ X5 )
& ( X5
= ( setadjoin @ X25 @ emptyset ) ) )
=> ( in @ ( setunion @ X5 ) @ X5 ) ) ) ),
inference(apply_def,[status(thm)],[theprop,c_0_8]) ).
thf(c_0_13,negated_conjecture,
~ ( ! [X27: $i,X28: $i,X29: $i] :
( ( subset @ X27 @ X28 )
=> ( ( in @ X29 @ X27 )
=> ( in @ X29 @ X28 ) ) )
=> ( ! [X30: $i,X31: $i > $o] : ( subset @ ( dsetconstr @ X30 @ X31 ) @ X30 )
=> ( ! [X32: $i] :
( ? [X33: $i] :
( ( in @ X33 @ X32 )
& ( X32
= ( setadjoin @ X33 @ emptyset ) ) )
=> ( in @ ( setunion @ X32 ) @ X32 ) )
=> ( ! [X34: $i,X35: $o,X36: $i] :
( ( in @ X36 @ X34 )
=> ! [X37: $i] :
( ( in @ X37 @ X34 )
=> ? [X38: $i] :
( ( in @ X38
@ ( dsetconstr @ X34
@ ^ [Z0: $i] :
( ( X35
& ( Z0 = X36 ) )
| ( ~ X35
& ( Z0 = X37 ) ) ) ) )
& ( ( dsetconstr @ X34
@ ^ [Z0: $i] :
( ( X35
& ( Z0 = X36 ) )
| ( ~ X35
& ( Z0 = X37 ) ) ) )
= ( setadjoin @ X38 @ emptyset ) ) ) ) )
=> ! [X1: $i,X10: $o,X3: $i] :
( ( in @ X3 @ X1 )
=> ! [X7: $i] :
( ( in @ X7 @ X1 )
=> ( in
@ ( setunion
@ ( dsetconstr @ X1
@ ^ [Z0: $i] :
( ( X10
& ( Z0 = X3 ) )
| ( ~ X10
& ( Z0 = X7 ) ) ) ) )
@ X1 ) ) ) ) ) ) ),
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(assume_negation,[status(cth)],[ifp]),subsetE]),c_0_9]),c_0_10]),c_0_11]),c_0_12])]) ).
thf(c_0_14,negated_conjecture,
! [X39: $i,X40: $i,X41: $i,X42: $i,X43: $i > $o,X44: $i,X45: $i,X46: $i,X47: $o,X48: $i,X49: $i] :
( ( ~ ( subset @ X39 @ X40 )
| ~ ( in @ X41 @ X39 )
| ( in @ X41 @ X40 ) )
& ( subset @ ( dsetconstr @ X42 @ X43 ) @ X42 )
& ( ~ ( in @ X45 @ X44 )
| ( X44
!= ( setadjoin @ X45 @ emptyset ) )
| ( in @ ( setunion @ X44 ) @ X44 ) )
& ( ( in @ ( esk1_4 @ X46 @ X47 @ X48 @ X49 )
@ ( dsetconstr @ X46
@ ^ [Z0: $i] :
( ( X47
& ( Z0 = X48 ) )
| ( ~ X47
& ( Z0 = X49 ) ) ) ) )
| ~ ( in @ X49 @ X46 )
| ~ ( in @ X48 @ X46 ) )
& ( ( ( dsetconstr @ X46
@ ^ [Z0: $i] :
( ( X47
& ( Z0 = X48 ) )
| ( ~ X47
& ( Z0 = X49 ) ) ) )
= ( setadjoin @ ( esk1_4 @ X46 @ X47 @ X48 @ X49 ) @ emptyset ) )
| ~ ( in @ X49 @ X46 )
| ~ ( in @ X48 @ X46 ) )
& ( in @ esk3_0 @ esk2_0 )
& ( in @ esk4_0 @ esk2_0 )
& ~ ( in
@ ( setunion
@ ( dsetconstr @ esk2_0
@ ^ [Z0: $i] :
( ( epred1_0
& ( Z0 = esk3_0 ) )
| ( ~ epred1_0
& ( Z0 = esk4_0 ) ) ) ) )
@ esk2_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(fof_nnf,[status(thm)],[c_0_13])])])])])]) ).
thf(c_0_15,negated_conjecture,
! [X3: $i,X2: $i,X1: $i] :
( ( in @ X3 @ X2 )
| ~ ( subset @ X1 @ X2 )
| ~ ( in @ X3 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_16,negated_conjecture,
! [X4: $i > $o,X1: $i] : ( subset @ ( dsetconstr @ X1 @ X4 ) @ X1 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_17,negated_conjecture,
! [X1: $i,X2: $i,X4: $i > $o] :
( ( in @ X1 @ X2 )
| ~ ( in @ X1 @ ( dsetconstr @ X2 @ X4 ) ) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
thf(c_0_18,negated_conjecture,
! [X6: $o,X3: $i,X2: $i,X1: $i] :
( ( ( dsetconstr @ X1
@ ^ [Z0: $i] :
( ( X6
& ( Z0 = X2 ) )
| ( ~ X6
& ( Z0 = X3 ) ) ) )
= ( setadjoin @ ( esk1_4 @ X1 @ X6 @ X2 @ X3 ) @ emptyset ) )
| ~ ( in @ X3 @ X1 )
| ~ ( in @ X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_19,negated_conjecture,
! [X2: $i,X1: $i] :
( ( in @ ( setunion @ X2 ) @ X2 )
| ~ ( in @ X1 @ X2 )
| ( X2
!= ( setadjoin @ X1 @ emptyset ) ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_20,negated_conjecture,
! [X6: $o,X3: $i,X2: $i,X1: $i] :
( ( in @ ( esk1_4 @ X1 @ X6 @ X2 @ X3 )
@ ( dsetconstr @ X1
@ ^ [Z0: $i] :
( ( X6
& ( Z0 = X2 ) )
| ( ~ X6
& ( Z0 = X3 ) ) ) ) )
| ~ ( in @ X3 @ X1 )
| ~ ( in @ X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_21,negated_conjecture,
~ ( in
@ ( setunion
@ ( dsetconstr @ esk2_0
@ ^ [Z0: $i] :
( ( epred1_0
& ( Z0 = esk3_0 ) )
| ( ~ epred1_0
& ( Z0 = esk4_0 ) ) ) ) )
@ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_22,negated_conjecture,
in @ esk4_0 @ esk2_0,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_23,negated_conjecture,
in @ esk3_0 @ esk2_0,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_24,negated_conjecture,
! [X1: $i,X6: $o,X5: $i,X3: $i,X2: $i] :
( ( in @ X1 @ X2 )
| ~ ( in @ X1 @ ( setadjoin @ ( esk1_4 @ X2 @ X6 @ X3 @ X5 ) @ emptyset ) )
| ~ ( in @ X5 @ X2 )
| ~ ( in @ X3 @ X2 ) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
thf(c_0_25,negated_conjecture,
! [X1: $i] :
( ( in @ ( setunion @ ( setadjoin @ X1 @ emptyset ) ) @ ( setadjoin @ X1 @ emptyset ) )
| ~ ( in @ X1 @ ( setadjoin @ X1 @ emptyset ) ) ),
inference(er,[status(thm)],[c_0_19]) ).
thf(c_0_26,negated_conjecture,
! [X6: $o,X3: $i,X2: $i,X1: $i] :
( ( in @ ( esk1_4 @ X1 @ X6 @ X2 @ X3 ) @ ( setadjoin @ ( esk1_4 @ X1 @ X6 @ X2 @ X3 ) @ emptyset ) )
| ~ ( in @ X3 @ X1 )
| ~ ( in @ X2 @ X1 ) ),
inference(spm,[status(thm)],[c_0_20,c_0_18]) ).
thf(c_0_27,negated_conjecture,
~ ( in @ ( setunion @ ( setadjoin @ ( esk1_4 @ esk2_0 @ epred1_0 @ esk3_0 @ esk4_0 ) @ emptyset ) ) @ esk2_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_18]),c_0_22]),c_0_23])]) ).
thf(c_0_28,negated_conjecture,
! [X6: $o,X3: $i,X2: $i,X1: $i] :
( ( in @ ( setunion @ ( setadjoin @ ( esk1_4 @ X1 @ X6 @ X2 @ X3 ) @ emptyset ) ) @ X1 )
| ~ ( in @ X3 @ X1 )
| ~ ( in @ X2 @ X1 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
thf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_22]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SEU705^2 : TPTP v8.2.0. Released v3.7.0.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n027.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sun May 19 16:47:52 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.19/0.45 Running higher-order theorem proving
% 0.19/0.45 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.19/0.47 # Version: 3.1.0-ho
% 0.19/0.47 # Preprocessing class: HSSSSLSSSLMNSFN.
% 0.19/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47 # Starting ho_unfolding_6 with 1500s (5) cores
% 0.19/0.47 # Starting pre_casc_5 with 300s (1) cores
% 0.19/0.47 # Starting sh4l with 300s (1) cores
% 0.19/0.47 # Starting full_lambda_3 with 300s (1) cores
% 0.19/0.47 # pre_casc_5 with pid 29768 completed with status 0
% 0.19/0.47 # Result found by pre_casc_5
% 0.19/0.47 # Preprocessing class: HSSSSLSSSLMNSFN.
% 0.19/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47 # Starting ho_unfolding_6 with 1500s (5) cores
% 0.19/0.47 # Starting pre_casc_5 with 300s (1) cores
% 0.19/0.47 # SinE strategy is GSinE(CountFormulas,hypos,3,,5,20000,1.0,true)
% 0.19/0.47 # Search class: HHUSF-FFSF32-DSFFMFBN
% 0.19/0.47 # partial match(2): HHUSF-FFSF22-SSFFMFBN
% 0.19/0.47 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.47 # Starting new_ho_10 with 163s (1) cores
% 0.19/0.47 # new_ho_10 with pid 29772 completed with status 0
% 0.19/0.47 # Result found by new_ho_10
% 0.19/0.47 # Preprocessing class: HSSSSLSSSLMNSFN.
% 0.19/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47 # Starting ho_unfolding_6 with 1500s (5) cores
% 0.19/0.47 # Starting pre_casc_5 with 300s (1) cores
% 0.19/0.47 # SinE strategy is GSinE(CountFormulas,hypos,3,,5,20000,1.0,true)
% 0.19/0.47 # Search class: HHUSF-FFSF32-DSFFMFBN
% 0.19/0.47 # partial match(2): HHUSF-FFSF22-SSFFMFBN
% 0.19/0.47 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.47 # Starting new_ho_10 with 163s (1) cores
% 0.19/0.47 # Preprocessing time : 0.001 s
% 0.19/0.47 # Presaturation interreduction done
% 0.19/0.47
% 0.19/0.47 # Proof found!
% 0.19/0.47 # SZS status Theorem
% 0.19/0.47 # SZS output start CNFRefutation
% See solution above
% 0.19/0.47 # Parsed axioms : 19
% 0.19/0.47 # Removed by relevancy pruning/SinE : 12
% 0.19/0.47 # Initial clauses : 8
% 0.19/0.47 # Removed in clause preprocessing : 0
% 0.19/0.47 # Initial clauses in saturation : 8
% 0.19/0.47 # Processed clauses : 27
% 0.19/0.47 # ...of these trivial : 0
% 0.19/0.47 # ...subsumed : 2
% 0.19/0.47 # ...remaining for further processing : 25
% 0.19/0.47 # Other redundant clauses eliminated : 1
% 0.19/0.47 # Clauses deleted for lack of memory : 0
% 0.19/0.47 # Backward-subsumed : 0
% 0.19/0.47 # Backward-rewritten : 0
% 0.19/0.47 # Generated clauses : 18
% 0.19/0.47 # ...of the previous two non-redundant : 17
% 0.19/0.47 # ...aggressively subsumed : 0
% 0.19/0.47 # Contextual simplify-reflections : 1
% 0.19/0.47 # Paramodulations : 17
% 0.19/0.47 # Factorizations : 0
% 0.19/0.47 # NegExts : 0
% 0.19/0.47 # Equation resolutions : 1
% 0.19/0.47 # Disequality decompositions : 0
% 0.19/0.47 # Total rewrite steps : 4
% 0.19/0.47 # ...of those cached : 2
% 0.19/0.47 # Propositional unsat checks : 0
% 0.19/0.47 # Propositional check models : 0
% 0.19/0.47 # Propositional check unsatisfiable : 0
% 0.19/0.47 # Propositional clauses : 0
% 0.19/0.47 # Propositional clauses after purity: 0
% 0.19/0.47 # Propositional unsat core size : 0
% 0.19/0.47 # Propositional preprocessing time : 0.000
% 0.19/0.47 # Propositional encoding time : 0.000
% 0.19/0.47 # Propositional solver time : 0.000
% 0.19/0.47 # Success case prop preproc time : 0.000
% 0.19/0.47 # Success case prop encoding time : 0.000
% 0.19/0.47 # Success case prop solver time : 0.000
% 0.19/0.47 # Current number of processed clauses : 16
% 0.19/0.47 # Positive orientable unit clauses : 3
% 0.19/0.47 # Positive unorientable unit clauses: 0
% 0.19/0.47 # Negative unit clauses : 2
% 0.19/0.47 # Non-unit-clauses : 11
% 0.19/0.47 # Current number of unprocessed clauses: 4
% 0.19/0.47 # ...number of literals in the above : 18
% 0.19/0.47 # Current number of archived formulas : 0
% 0.19/0.47 # Current number of archived clauses : 8
% 0.19/0.47 # Clause-clause subsumption calls (NU) : 50
% 0.19/0.47 # Rec. Clause-clause subsumption calls : 42
% 0.19/0.47 # Non-unit clause-clause subsumptions : 3
% 0.19/0.47 # Unit Clause-clause subsumption calls : 1
% 0.19/0.47 # Rewrite failures with RHS unbound : 0
% 0.19/0.47 # BW rewrite match attempts : 0
% 0.19/0.47 # BW rewrite match successes : 0
% 0.19/0.47 # Condensation attempts : 27
% 0.19/0.47 # Condensation successes : 0
% 0.19/0.47 # Termbank termtop insertions : 2105
% 0.19/0.47 # Search garbage collected termcells : 467
% 0.19/0.47
% 0.19/0.47 # -------------------------------------------------
% 0.19/0.47 # User time : 0.005 s
% 0.19/0.47 # System time : 0.002 s
% 0.19/0.47 # Total time : 0.007 s
% 0.19/0.47 # Maximum resident set size: 1896 pages
% 0.19/0.47
% 0.19/0.47 # -------------------------------------------------
% 0.19/0.47 # User time : 0.008 s
% 0.19/0.47 # System time : 0.002 s
% 0.19/0.47 # Total time : 0.010 s
% 0.19/0.47 # Maximum resident set size: 1724 pages
% 0.19/0.47 % E---3.1 exiting
% 0.19/0.47 % E exiting
%------------------------------------------------------------------------------