TSTP Solution File: LCL494+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : LCL494+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n007.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 : 600s
% DateTime : Sun Jul 17 10:11:31 EDT 2022
% Result : Theorem 0.21s 1.42s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 19
% Syntax : Number of formulae : 68 ( 34 unt; 0 def)
% Number of atoms : 123 ( 21 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 94 ( 39 ~; 36 |; 8 &)
% ( 5 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 13 ( 11 usr; 11 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 10 con; 0-2 aty)
% Number of variables : 87 ( 6 sgn 40 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(r2,axiom,
( r2
<=> ! [X4,X5] : is_a_theorem(implies(X5,or(X4,X5))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',r2) ).
fof(op_implies_or,axiom,
( op_implies_or
=> ! [X1,X2] : implies(X1,X2) = or(not(X1),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+1.ax',op_implies_or) ).
fof(op_implies_and,axiom,
( op_implies_and
=> ! [X1,X2] : implies(X1,X2) = not(and(X1,not(X2))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+1.ax',op_implies_and) ).
fof(modus_ponens,axiom,
( modus_ponens
<=> ! [X1,X2] :
( ( is_a_theorem(X1)
& is_a_theorem(implies(X1,X2)) )
=> is_a_theorem(X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',modus_ponens) ).
fof(r3,axiom,
( r3
<=> ! [X4,X5] : is_a_theorem(implies(or(X4,X5),or(X5,X4))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',r3) ).
fof(principia_r2,axiom,
r2,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax',principia_r2) ).
fof(principia_op_implies_or,axiom,
op_implies_or,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax',principia_op_implies_or) ).
fof(op_or,axiom,
( op_or
=> ! [X1,X2] : or(X1,X2) = not(and(not(X1),not(X2))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+1.ax',op_or) ).
fof(hilbert_op_implies_and,axiom,
op_implies_and,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',hilbert_op_implies_and) ).
fof(op_and,axiom,
( op_and
=> ! [X1,X2] : and(X1,X2) = not(or(not(X1),not(X2))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+1.ax',op_and) ).
fof(hilbert_equivalence_2,conjecture,
equivalence_2,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',hilbert_equivalence_2) ).
fof(op_equiv,axiom,
( op_equiv
=> ! [X1,X2] : equiv(X1,X2) = and(implies(X1,X2),implies(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+1.ax',op_equiv) ).
fof(principia_modus_ponens,axiom,
modus_ponens,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax',principia_modus_ponens) ).
fof(principia_r3,axiom,
r3,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax',principia_r3) ).
fof(hilbert_op_or,axiom,
op_or,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',hilbert_op_or) ).
fof(principia_op_and,axiom,
op_and,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax',principia_op_and) ).
fof(equivalence_2,axiom,
( equivalence_2
<=> ! [X1,X2] : is_a_theorem(implies(equiv(X1,X2),implies(X2,X1))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',equivalence_2) ).
fof(and_2,axiom,
( and_2
<=> ! [X1,X2] : is_a_theorem(implies(and(X1,X2),X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',and_2) ).
fof(principia_op_equiv,axiom,
op_equiv,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax',principia_op_equiv) ).
fof(c_0_19,plain,
! [X6,X7] :
( ( ~ r2
| is_a_theorem(implies(X7,or(X6,X7))) )
& ( ~ is_a_theorem(implies(esk47_0,or(esk46_0,esk47_0)))
| r2 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[r2])])])])])]) ).
fof(c_0_20,plain,
! [X3,X4] :
( ~ op_implies_or
| implies(X3,X4) = or(not(X3),X4) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_implies_or])])])])]) ).
fof(c_0_21,plain,
! [X3,X4] :
( ~ op_implies_and
| implies(X3,X4) = not(and(X3,not(X4))) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_implies_and])])])])]) ).
fof(c_0_22,plain,
! [X3,X4] :
( ( ~ modus_ponens
| ~ is_a_theorem(X3)
| ~ is_a_theorem(implies(X3,X4))
| is_a_theorem(X4) )
& ( is_a_theorem(esk1_0)
| modus_ponens )
& ( is_a_theorem(implies(esk1_0,esk2_0))
| modus_ponens )
& ( ~ is_a_theorem(esk2_0)
| modus_ponens ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[modus_ponens])])])])])])]) ).
fof(c_0_23,plain,
! [X6,X7] :
( ( ~ r3
| is_a_theorem(implies(or(X6,X7),or(X7,X6))) )
& ( ~ is_a_theorem(implies(or(esk48_0,esk49_0),or(esk49_0,esk48_0)))
| r3 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[r3])])])])])]) ).
cnf(c_0_24,plain,
( is_a_theorem(implies(X1,or(X2,X1)))
| ~ r2 ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,plain,
r2,
inference(split_conjunct,[status(thm)],[principia_r2]) ).
cnf(c_0_26,plain,
( implies(X1,X2) = or(not(X1),X2)
| ~ op_implies_or ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,plain,
op_implies_or,
inference(split_conjunct,[status(thm)],[principia_op_implies_or]) ).
fof(c_0_28,plain,
! [X3,X4] :
( ~ op_or
| or(X3,X4) = not(and(not(X3),not(X4))) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_or])])])])]) ).
cnf(c_0_29,plain,
( implies(X1,X2) = not(and(X1,not(X2)))
| ~ op_implies_and ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_30,plain,
op_implies_and,
inference(split_conjunct,[status(thm)],[hilbert_op_implies_and]) ).
fof(c_0_31,plain,
! [X3,X4] :
( ~ op_and
| and(X3,X4) = not(or(not(X3),not(X4))) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_and])])])])]) ).
fof(c_0_32,negated_conjecture,
~ equivalence_2,
inference(assume_negation,[status(cth)],[hilbert_equivalence_2]) ).
fof(c_0_33,plain,
! [X3,X4] :
( ~ op_equiv
| equiv(X3,X4) = and(implies(X3,X4),implies(X4,X3)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_equiv])])])])]) ).
cnf(c_0_34,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(X2)
| ~ modus_ponens ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_35,plain,
modus_ponens,
inference(split_conjunct,[status(thm)],[principia_modus_ponens]) ).
cnf(c_0_36,plain,
( is_a_theorem(implies(or(X1,X2),or(X2,X1)))
| ~ r3 ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_37,plain,
r3,
inference(split_conjunct,[status(thm)],[principia_r3]) ).
cnf(c_0_38,plain,
is_a_theorem(implies(X1,or(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25])]) ).
cnf(c_0_39,plain,
or(not(X1),X2) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27])]) ).
cnf(c_0_40,plain,
( or(X1,X2) = not(and(not(X1),not(X2)))
| ~ op_or ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_41,plain,
not(and(X1,not(X2))) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30])]) ).
cnf(c_0_42,plain,
op_or,
inference(split_conjunct,[status(thm)],[hilbert_op_or]) ).
cnf(c_0_43,plain,
( and(X1,X2) = not(or(not(X1),not(X2)))
| ~ op_and ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_44,plain,
op_and,
inference(split_conjunct,[status(thm)],[principia_op_and]) ).
fof(c_0_45,plain,
! [X3,X4] :
( ( ~ equivalence_2
| is_a_theorem(implies(equiv(X3,X4),implies(X4,X3))) )
& ( ~ is_a_theorem(implies(equiv(esk29_0,esk30_0),implies(esk30_0,esk29_0)))
| equivalence_2 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equivalence_2])])])])])]) ).
fof(c_0_46,negated_conjecture,
~ equivalence_2,
inference(fof_simplification,[status(thm)],[c_0_32]) ).
fof(c_0_47,plain,
! [X3,X4] :
( ( ~ and_2
| is_a_theorem(implies(and(X3,X4),X4)) )
& ( ~ is_a_theorem(implies(and(esk16_0,esk17_0),esk17_0))
| and_2 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[and_2])])])])])]) ).
cnf(c_0_48,plain,
( equiv(X1,X2) = and(implies(X1,X2),implies(X2,X1))
| ~ op_equiv ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_49,plain,
op_equiv,
inference(split_conjunct,[status(thm)],[principia_op_equiv]) ).
cnf(c_0_50,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35])]) ).
cnf(c_0_51,plain,
is_a_theorem(implies(or(X1,X2),or(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37])]) ).
cnf(c_0_52,plain,
is_a_theorem(implies(X1,implies(X2,X1))),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_53,plain,
implies(not(X1),X2) = or(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41]),c_0_42])]) ).
cnf(c_0_54,plain,
not(implies(X1,not(X2))) = and(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_39]),c_0_44])]) ).
cnf(c_0_55,plain,
( equivalence_2
| ~ is_a_theorem(implies(equiv(esk29_0,esk30_0),implies(esk30_0,esk29_0))) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_56,negated_conjecture,
~ equivalence_2,
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_57,plain,
( is_a_theorem(implies(and(X1,X2),X2))
| ~ and_2 ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_58,plain,
and(implies(X1,X2),implies(X2,X1)) = equiv(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49])]) ).
cnf(c_0_59,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_60,plain,
is_a_theorem(or(X1,implies(X2,not(X1)))),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_61,plain,
or(implies(X1,not(X2)),X3) = implies(and(X1,X2),X3),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_62,plain,
~ is_a_theorem(implies(equiv(esk29_0,esk30_0),implies(esk30_0,esk29_0))),
inference(sr,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_63,plain,
( is_a_theorem(implies(equiv(X1,X2),implies(X2,X1)))
| ~ and_2 ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_64,plain,
( and_2
| ~ is_a_theorem(implies(and(esk16_0,esk17_0),esk17_0)) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_65,plain,
is_a_theorem(implies(and(X1,X2),X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61]) ).
cnf(c_0_66,plain,
~ and_2,
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_67,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_65])]),c_0_66]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL494+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n007.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jul 4 07:32:57 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.21/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.21/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.21/1.42 # Preprocessing time : 0.014 s
% 0.21/1.42
% 0.21/1.42 # Failure: Out of unprocessed clauses!
% 0.21/1.42 # OLD status GaveUp
% 0.21/1.42 # Parsed axioms : 45
% 0.21/1.42 # Removed by relevancy pruning/SinE : 43
% 0.21/1.42 # Initial clauses : 3
% 0.21/1.42 # Removed in clause preprocessing : 0
% 0.21/1.42 # Initial clauses in saturation : 3
% 0.21/1.42 # Processed clauses : 3
% 0.21/1.42 # ...of these trivial : 0
% 0.21/1.42 # ...subsumed : 1
% 0.21/1.42 # ...remaining for further processing : 2
% 0.21/1.42 # Other redundant clauses eliminated : 0
% 0.21/1.42 # Clauses deleted for lack of memory : 0
% 0.21/1.42 # Backward-subsumed : 0
% 0.21/1.42 # Backward-rewritten : 0
% 0.21/1.42 # Generated clauses : 0
% 0.21/1.42 # ...of the previous two non-trivial : 0
% 0.21/1.42 # Contextual simplify-reflections : 0
% 0.21/1.42 # Paramodulations : 0
% 0.21/1.42 # Factorizations : 0
% 0.21/1.42 # Equation resolutions : 0
% 0.21/1.42 # Current number of processed clauses : 2
% 0.21/1.42 # Positive orientable unit clauses : 0
% 0.21/1.42 # Positive unorientable unit clauses: 0
% 0.21/1.42 # Negative unit clauses : 2
% 0.21/1.42 # Non-unit-clauses : 0
% 0.21/1.42 # Current number of unprocessed clauses: 0
% 0.21/1.42 # ...number of literals in the above : 0
% 0.21/1.42 # Current number of archived formulas : 0
% 0.21/1.42 # Current number of archived clauses : 0
% 0.21/1.42 # Clause-clause subsumption calls (NU) : 0
% 0.21/1.42 # Rec. Clause-clause subsumption calls : 0
% 0.21/1.42 # Non-unit clause-clause subsumptions : 0
% 0.21/1.42 # Unit Clause-clause subsumption calls : 0
% 0.21/1.42 # Rewrite failures with RHS unbound : 0
% 0.21/1.42 # BW rewrite match attempts : 0
% 0.21/1.42 # BW rewrite match successes : 0
% 0.21/1.42 # Condensation attempts : 0
% 0.21/1.42 # Condensation successes : 0
% 0.21/1.42 # Termbank termtop insertions : 496
% 0.21/1.42
% 0.21/1.42 # -------------------------------------------------
% 0.21/1.42 # User time : 0.013 s
% 0.21/1.42 # System time : 0.002 s
% 0.21/1.42 # Total time : 0.015 s
% 0.21/1.42 # Maximum resident set size: 2736 pages
% 0.21/1.42 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.21/1.42 # Preprocessing time : 0.019 s
% 0.21/1.42
% 0.21/1.42 # Proof found!
% 0.21/1.42 # SZS status Theorem
% 0.21/1.42 # SZS output start CNFRefutation
% See solution above
% 0.21/1.42 # Proof object total steps : 68
% 0.21/1.42 # Proof object clause steps : 37
% 0.21/1.42 # Proof object formula steps : 31
% 0.21/1.42 # Proof object conjectures : 4
% 0.21/1.42 # Proof object clause conjectures : 1
% 0.21/1.42 # Proof object formula conjectures : 3
% 0.21/1.42 # Proof object initial clauses used : 20
% 0.21/1.42 # Proof object initial formulas used : 19
% 0.21/1.42 # Proof object generating inferences : 7
% 0.21/1.42 # Proof object simplifying inferences : 23
% 0.21/1.42 # Training examples: 0 positive, 0 negative
% 0.21/1.42 # Parsed axioms : 45
% 0.21/1.42 # Removed by relevancy pruning/SinE : 0
% 0.21/1.42 # Initial clauses : 74
% 0.21/1.42 # Removed in clause preprocessing : 0
% 0.21/1.42 # Initial clauses in saturation : 74
% 0.21/1.42 # Processed clauses : 1161
% 0.21/1.42 # ...of these trivial : 17
% 0.21/1.42 # ...subsumed : 687
% 0.21/1.42 # ...remaining for further processing : 457
% 0.21/1.42 # Other redundant clauses eliminated : 0
% 0.21/1.42 # Clauses deleted for lack of memory : 0
% 0.21/1.42 # Backward-subsumed : 20
% 0.21/1.42 # Backward-rewritten : 26
% 0.21/1.42 # Generated clauses : 8774
% 0.21/1.42 # ...of the previous two non-trivial : 8117
% 0.21/1.42 # Contextual simplify-reflections : 859
% 0.21/1.42 # Paramodulations : 8774
% 0.21/1.42 # Factorizations : 0
% 0.21/1.42 # Equation resolutions : 0
% 0.21/1.42 # Current number of processed clauses : 411
% 0.21/1.42 # Positive orientable unit clauses : 66
% 0.21/1.42 # Positive unorientable unit clauses: 0
% 0.21/1.42 # Negative unit clauses : 5
% 0.21/1.42 # Non-unit-clauses : 340
% 0.21/1.42 # Current number of unprocessed clauses: 6606
% 0.21/1.42 # ...number of literals in the above : 20916
% 0.21/1.42 # Current number of archived formulas : 0
% 0.21/1.42 # Current number of archived clauses : 46
% 0.21/1.42 # Clause-clause subsumption calls (NU) : 76801
% 0.21/1.42 # Rec. Clause-clause subsumption calls : 56245
% 0.21/1.42 # Non-unit clause-clause subsumptions : 1554
% 0.21/1.42 # Unit Clause-clause subsumption calls : 650
% 0.21/1.42 # Rewrite failures with RHS unbound : 0
% 0.21/1.42 # BW rewrite match attempts : 98
% 0.21/1.42 # BW rewrite match successes : 20
% 0.21/1.42 # Condensation attempts : 0
% 0.21/1.42 # Condensation successes : 0
% 0.21/1.42 # Termbank termtop insertions : 119647
% 0.21/1.42
% 0.21/1.42 # -------------------------------------------------
% 0.21/1.42 # User time : 0.144 s
% 0.21/1.42 # System time : 0.009 s
% 0.21/1.42 # Total time : 0.153 s
% 0.21/1.42 # Maximum resident set size: 9396 pages
%------------------------------------------------------------------------------