TSTP Solution File: CSR017+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : CSR017+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n032.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 : Fri Jul 15 03:01:24 EDT 2022
% Result : Theorem 0.18s 1.35s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 13
% Syntax : Number of formulae : 49 ( 20 unt; 0 def)
% Number of atoms : 400 ( 206 equ)
% Maximal formula atoms : 149 ( 8 avg)
% Number of connectives : 484 ( 133 ~; 248 |; 94 &)
% ( 8 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 40 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 79 ( 13 sgn 49 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(terminates_all_defn,axiom,
! [X4,X2,X5] :
( terminates(X4,X2,X5)
<=> ( ( X4 = push
& X2 = backwards
& ~ happens(pull,X5) )
| ( X4 = pull
& X2 = forwards
& ~ happens(push,X5) )
| ( X4 = pull
& X2 = forwards
& happens(push,X5) )
| ( X4 = pull
& X2 = backwards
& happens(push,X5) )
| ( X4 = push
& X2 = spinning
& ~ happens(pull,X5) )
| ( X4 = pull
& X2 = spinning
& ~ happens(push,X5) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+2.ax',terminates_all_defn) ).
fof(happens_terminates_not_holds,axiom,
! [X4,X5,X2] :
( ( happens(X4,X5)
& terminates(X4,X2,X5) )
=> ~ holdsAt(X2,plus(X5,n1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+0.ax',happens_terminates_not_holds) ).
fof(plus0_1,axiom,
plus(n0,n1) = n1,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',plus0_1) ).
fof(not_spinning_1,conjecture,
~ holdsAt(spinning,n1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',not_spinning_1) ).
fof(happens_all_defn,axiom,
! [X4,X5] :
( happens(X4,X5)
<=> ( ( X4 = push
& X5 = n0 )
| ( X4 = pull
& X5 = n1 )
| ( X4 = pull
& X5 = n2 )
| ( X4 = push
& X5 = n2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+2.ax',happens_all_defn) ).
fof(less_or_equal,axiom,
! [X9,X10] :
( less_or_equal(X9,X10)
<=> ( less(X9,X10)
| X9 = X10 ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',less_or_equal) ).
fof(less2,axiom,
! [X9] :
( less(X9,n2)
<=> less_or_equal(X9,n1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',less2) ).
fof(push_not_pull,axiom,
push != pull,
file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+2.ax',push_not_pull) ).
fof(plus1_1,axiom,
plus(n1,n1) = n2,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',plus1_1) ).
fof(plus0_0,axiom,
plus(n0,n0) = n0,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',plus0_0) ).
fof(less0,axiom,
~ ? [X9] : less(X9,n0),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',less0) ).
fof(c_0_11,plain,
! [X2,X4,X5] :
( epred3_3(X5,X4,X2)
<=> ( ( X4 = push
& X2 = backwards
& ~ happens(pull,X5) )
| ( X4 = pull
& X2 = forwards
& ~ happens(push,X5) )
| ( X4 = pull
& X2 = forwards
& happens(push,X5) )
| ( X4 = pull
& X2 = backwards
& happens(push,X5) )
| ( X4 = push
& X2 = spinning
& ~ happens(pull,X5) )
| ( X4 = pull
& X2 = spinning
& ~ happens(push,X5) ) ) ),
introduced(definition) ).
fof(c_0_12,axiom,
! [X4,X2,X5] :
( terminates(X4,X2,X5)
<=> epred3_3(X5,X4,X2) ),
inference(apply_def,[status(thm)],[terminates_all_defn,c_0_11]) ).
fof(c_0_13,plain,
! [X6,X7,X8] :
( ~ happens(X6,X7)
| ~ terminates(X6,X8,X7)
| ~ holdsAt(X8,plus(X7,n1)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[happens_terminates_not_holds])])]) ).
fof(c_0_14,plain,
! [X6,X7,X8,X6,X7,X8] :
( ( ~ terminates(X6,X7,X8)
| epred3_3(X8,X6,X7) )
& ( ~ epred3_3(X8,X6,X7)
| terminates(X6,X7,X8) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])]) ).
fof(c_0_15,plain,
! [X2,X4,X5] :
( epred2_3(X5,X4,X2)
<=> ( ( X4 = push
& X2 = backwards
& ~ happens(pull,X5) )
| ( X4 = pull
& X2 = forwards
& ~ happens(push,X5) )
| ( X4 = pull
& X2 = forwards
& happens(push,X5) ) ) ),
introduced(definition) ).
cnf(c_0_16,plain,
( ~ holdsAt(X1,plus(X2,n1))
| ~ terminates(X3,X1,X2)
| ~ happens(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
( terminates(X1,X2,X3)
| ~ epred3_3(X3,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_18,plain,
! [X2,X4,X5] :
( epred3_3(X5,X4,X2)
<=> ( epred2_3(X5,X4,X2)
| ( X4 = pull
& X2 = backwards
& happens(push,X5) )
| ( X4 = push
& X2 = spinning
& ~ happens(pull,X5) )
| ( X4 = pull
& X2 = spinning
& ~ happens(push,X5) ) ) ),
inference(apply_def,[status(thm)],[c_0_11,c_0_15]) ).
cnf(c_0_19,plain,
( ~ epred3_3(X1,X2,X3)
| ~ holdsAt(X3,plus(X1,n1))
| ~ happens(X2,X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
plus(n0,n1) = n1,
inference(split_conjunct,[status(thm)],[plus0_1]) ).
fof(c_0_21,plain,
! [X6,X7,X8,X6,X7,X8] :
( ( X7 = pull
| X7 = push
| X7 = pull
| epred2_3(X8,X7,X6)
| ~ epred3_3(X8,X7,X6) )
& ( X6 = spinning
| X7 = push
| X7 = pull
| epred2_3(X8,X7,X6)
| ~ epred3_3(X8,X7,X6) )
& ( ~ happens(push,X8)
| X7 = push
| X7 = pull
| epred2_3(X8,X7,X6)
| ~ epred3_3(X8,X7,X6) )
& ( X7 = pull
| X6 = spinning
| X7 = pull
| epred2_3(X8,X7,X6)
| ~ epred3_3(X8,X7,X6) )
& ( X6 = spinning
| X6 = spinning
| X7 = pull
| epred2_3(X8,X7,X6)
| ~ epred3_3(X8,X7,X6) )
& ( ~ happens(push,X8)
| X6 = spinning
| X7 = pull
| epred2_3(X8,X7,X6)
| ~ epred3_3(X8,X7,X6) )
& ( X7 = pull
| ~ happens(pull,X8)
| X7 = pull
| epred2_3(X8,X7,X6)
| ~ epred3_3(X8,X7,X6) )
& ( X6 = spinning
| ~ happens(pull,X8)
| X7 = pull
| epred2_3(X8,X7,X6)
| ~ epred3_3(X8,X7,X6) )
& ( ~ happens(push,X8)
| ~ happens(pull,X8)
| X7 = pull
| epred2_3(X8,X7,X6)
| ~ epred3_3(X8,X7,X6) )
& ( X7 = pull
| X7 = push
| X6 = backwards
| epred2_3(X8,X7,X6)
| ~ epred3_3(X8,X7,X6) )
& ( X6 = spinning
| X7 = push
| X6 = backwards
| epred2_3(X8,X7,X6)
| ~ epred3_3(X8,X7,X6) )
& ( ~ happens(push,X8)
| X7 = push
| X6 = backwards
| epred2_3(X8,X7,X6)
| ~ epred3_3(X8,X7,X6) )
& ( X7 = pull
| X6 = spinning
| X6 = backwards
| epred2_3(X8,X7,X6)
| ~ epred3_3(X8,X7,X6) )
& ( X6 = spinning
| X6 = spinning
| X6 = backwards
| epred2_3(X8,X7,X6)
| ~ epred3_3(X8,X7,X6) )
& ( ~ happens(push,X8)
| X6 = spinning
| X6 = backwards
| epred2_3(X8,X7,X6)
| ~ epred3_3(X8,X7,X6) )
& ( X7 = pull
| ~ happens(pull,X8)
| X6 = backwards
| epred2_3(X8,X7,X6)
| ~ epred3_3(X8,X7,X6) )
& ( X6 = spinning
| ~ happens(pull,X8)
| X6 = backwards
| epred2_3(X8,X7,X6)
| ~ epred3_3(X8,X7,X6) )
& ( ~ happens(push,X8)
| ~ happens(pull,X8)
| X6 = backwards
| epred2_3(X8,X7,X6)
| ~ epred3_3(X8,X7,X6) )
& ( X7 = pull
| X7 = push
| happens(push,X8)
| epred2_3(X8,X7,X6)
| ~ epred3_3(X8,X7,X6) )
& ( X6 = spinning
| X7 = push
| happens(push,X8)
| epred2_3(X8,X7,X6)
| ~ epred3_3(X8,X7,X6) )
& ( ~ happens(push,X8)
| X7 = push
| happens(push,X8)
| epred2_3(X8,X7,X6)
| ~ epred3_3(X8,X7,X6) )
& ( X7 = pull
| X6 = spinning
| happens(push,X8)
| epred2_3(X8,X7,X6)
| ~ epred3_3(X8,X7,X6) )
& ( X6 = spinning
| X6 = spinning
| happens(push,X8)
| epred2_3(X8,X7,X6)
| ~ epred3_3(X8,X7,X6) )
& ( ~ happens(push,X8)
| X6 = spinning
| happens(push,X8)
| epred2_3(X8,X7,X6)
| ~ epred3_3(X8,X7,X6) )
& ( X7 = pull
| ~ happens(pull,X8)
| happens(push,X8)
| epred2_3(X8,X7,X6)
| ~ epred3_3(X8,X7,X6) )
& ( X6 = spinning
| ~ happens(pull,X8)
| happens(push,X8)
| epred2_3(X8,X7,X6)
| ~ epred3_3(X8,X7,X6) )
& ( ~ happens(push,X8)
| ~ happens(pull,X8)
| happens(push,X8)
| epred2_3(X8,X7,X6)
| ~ epred3_3(X8,X7,X6) )
& ( ~ epred2_3(X8,X7,X6)
| epred3_3(X8,X7,X6) )
& ( X7 != pull
| X6 != backwards
| ~ happens(push,X8)
| epred3_3(X8,X7,X6) )
& ( X7 != push
| X6 != spinning
| happens(pull,X8)
| epred3_3(X8,X7,X6) )
& ( X7 != pull
| X6 != spinning
| happens(push,X8)
| epred3_3(X8,X7,X6) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_18])])])])])]) ).
fof(c_0_22,negated_conjecture,
~ ~ holdsAt(spinning,n1),
inference(assume_negation,[status(cth)],[not_spinning_1]) ).
cnf(c_0_23,plain,
( ~ epred3_3(n0,X1,X2)
| ~ holdsAt(X2,n1)
| ~ happens(X1,n0) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
( epred3_3(X1,X2,X3)
| happens(pull,X1)
| X3 != spinning
| X2 != push ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_25,negated_conjecture,
holdsAt(spinning,n1),
inference(fof_simplification,[status(thm)],[c_0_22]) ).
cnf(c_0_26,plain,
( happens(pull,n0)
| X1 != spinning
| X2 != push
| ~ holdsAt(X1,n1)
| ~ happens(X2,n0) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
holdsAt(spinning,n1),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_28,plain,
! [X6,X7,X6,X7] :
( ( X6 = push
| X6 = pull
| X6 = pull
| X6 = push
| ~ happens(X6,X7) )
& ( X7 = n2
| X6 = pull
| X6 = pull
| X6 = push
| ~ happens(X6,X7) )
& ( X6 = push
| X7 = n2
| X6 = pull
| X6 = push
| ~ happens(X6,X7) )
& ( X7 = n2
| X7 = n2
| X6 = pull
| X6 = push
| ~ happens(X6,X7) )
& ( X6 = push
| X6 = pull
| X7 = n1
| X6 = push
| ~ happens(X6,X7) )
& ( X7 = n2
| X6 = pull
| X7 = n1
| X6 = push
| ~ happens(X6,X7) )
& ( X6 = push
| X7 = n2
| X7 = n1
| X6 = push
| ~ happens(X6,X7) )
& ( X7 = n2
| X7 = n2
| X7 = n1
| X6 = push
| ~ happens(X6,X7) )
& ( X6 = push
| X6 = pull
| X6 = pull
| X7 = n0
| ~ happens(X6,X7) )
& ( X7 = n2
| X6 = pull
| X6 = pull
| X7 = n0
| ~ happens(X6,X7) )
& ( X6 = push
| X7 = n2
| X6 = pull
| X7 = n0
| ~ happens(X6,X7) )
& ( X7 = n2
| X7 = n2
| X6 = pull
| X7 = n0
| ~ happens(X6,X7) )
& ( X6 = push
| X6 = pull
| X7 = n1
| X7 = n0
| ~ happens(X6,X7) )
& ( X7 = n2
| X6 = pull
| X7 = n1
| X7 = n0
| ~ happens(X6,X7) )
& ( X6 = push
| X7 = n2
| X7 = n1
| X7 = n0
| ~ happens(X6,X7) )
& ( X7 = n2
| X7 = n2
| X7 = n1
| X7 = n0
| ~ happens(X6,X7) )
& ( X6 != push
| X7 != n0
| happens(X6,X7) )
& ( X6 != pull
| X7 != n1
| happens(X6,X7) )
& ( X6 != pull
| X7 != n2
| happens(X6,X7) )
& ( X6 != push
| X7 != n2
| happens(X6,X7) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[happens_all_defn])])])])]) ).
cnf(c_0_29,negated_conjecture,
( happens(pull,n0)
| X1 != push
| ~ happens(X1,n0) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,plain,
( happens(X1,X2)
| X2 != n0
| X1 != push ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
fof(c_0_31,plain,
! [X11,X12,X11,X12] :
( ( ~ less_or_equal(X11,X12)
| less(X11,X12)
| X11 = X12 )
& ( ~ less(X11,X12)
| less_or_equal(X11,X12) )
& ( X11 != X12
| less_or_equal(X11,X12) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less_or_equal])])])])]) ).
cnf(c_0_32,plain,
( X1 = push
| X2 = n1
| X2 = n2
| X2 = n2
| ~ happens(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_33,negated_conjecture,
( happens(pull,n0)
| X1 != push ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
fof(c_0_34,plain,
! [X10,X10] :
( ( ~ less(X10,n2)
| less_or_equal(X10,n1) )
& ( ~ less_or_equal(X10,n1)
| less(X10,n2) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less2])])])]) ).
cnf(c_0_35,plain,
( less_or_equal(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_36,plain,
( X2 = n1
| X2 = n2
| X1 = push
| ~ happens(X1,X2) ),
inference(cn,[status(thm)],[c_0_32]) ).
cnf(c_0_37,negated_conjecture,
happens(pull,n0),
inference(er,[status(thm)],[c_0_33]) ).
cnf(c_0_38,plain,
push != pull,
inference(split_conjunct,[status(thm)],[push_not_pull]) ).
cnf(c_0_39,plain,
( less(X1,n2)
| ~ less_or_equal(X1,n1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_40,plain,
less_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_35]) ).
cnf(c_0_41,plain,
plus(n1,n1) = n2,
inference(split_conjunct,[status(thm)],[plus1_1]) ).
cnf(c_0_42,negated_conjecture,
( n1 = n0
| n2 = n0 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).
cnf(c_0_43,plain,
plus(n0,n0) = n0,
inference(split_conjunct,[status(thm)],[plus0_0]) ).
fof(c_0_44,plain,
! [X10] : ~ less(X10,n0),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less0])]) ).
cnf(c_0_45,plain,
less(n1,n2),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_46,negated_conjecture,
n2 = n0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43])]) ).
cnf(c_0_47,plain,
~ less(X1,n0),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_48,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46]),c_0_47]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : CSR017+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.02/0.10 % Command : run_ET %s %d
% 0.09/0.29 % Computer : n032.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 600
% 0.09/0.29 % DateTime : Fri Jun 10 05:00:53 EDT 2022
% 0.09/0.29 % CPUTime :
% 0.18/1.35 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.18/1.35 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.18/1.35 # Preprocessing time : 0.014 s
% 0.18/1.35
% 0.18/1.35 # Proof found!
% 0.18/1.35 # SZS status Theorem
% 0.18/1.35 # SZS output start CNFRefutation
% See solution above
% 0.18/1.35 # Proof object total steps : 49
% 0.18/1.35 # Proof object clause steps : 25
% 0.18/1.35 # Proof object formula steps : 24
% 0.18/1.35 # Proof object conjectures : 9
% 0.18/1.35 # Proof object clause conjectures : 6
% 0.18/1.35 # Proof object formula conjectures : 3
% 0.18/1.35 # Proof object initial clauses used : 13
% 0.18/1.35 # Proof object initial formulas used : 11
% 0.18/1.35 # Proof object generating inferences : 9
% 0.18/1.35 # Proof object simplifying inferences : 7
% 0.18/1.35 # Training examples: 0 positive, 0 negative
% 0.18/1.35 # Parsed axioms : 48
% 0.18/1.35 # Removed by relevancy pruning/SinE : 17
% 0.18/1.35 # Initial clauses : 154
% 0.18/1.35 # Removed in clause preprocessing : 9
% 0.18/1.35 # Initial clauses in saturation : 145
% 0.18/1.35 # Processed clauses : 328
% 0.18/1.35 # ...of these trivial : 1
% 0.18/1.35 # ...subsumed : 145
% 0.18/1.35 # ...remaining for further processing : 182
% 0.18/1.35 # Other redundant clauses eliminated : 2
% 0.18/1.35 # Clauses deleted for lack of memory : 0
% 0.18/1.35 # Backward-subsumed : 15
% 0.18/1.35 # Backward-rewritten : 63
% 0.18/1.35 # Generated clauses : 483
% 0.18/1.35 # ...of the previous two non-trivial : 351
% 0.18/1.35 # Contextual simplify-reflections : 94
% 0.18/1.35 # Paramodulations : 468
% 0.18/1.35 # Factorizations : 4
% 0.18/1.35 # Equation resolutions : 11
% 0.18/1.35 # Current number of processed clauses : 102
% 0.18/1.35 # Positive orientable unit clauses : 10
% 0.18/1.35 # Positive unorientable unit clauses: 1
% 0.18/1.35 # Negative unit clauses : 11
% 0.18/1.35 # Non-unit-clauses : 80
% 0.18/1.35 # Current number of unprocessed clauses: 73
% 0.18/1.35 # ...number of literals in the above : 307
% 0.18/1.35 # Current number of archived formulas : 0
% 0.18/1.35 # Current number of archived clauses : 78
% 0.18/1.35 # Clause-clause subsumption calls (NU) : 2821
% 0.18/1.35 # Rec. Clause-clause subsumption calls : 1338
% 0.18/1.35 # Non-unit clause-clause subsumptions : 204
% 0.18/1.35 # Unit Clause-clause subsumption calls : 88
% 0.18/1.35 # Rewrite failures with RHS unbound : 0
% 0.18/1.35 # BW rewrite match attempts : 7
% 0.18/1.35 # BW rewrite match successes : 3
% 0.18/1.35 # Condensation attempts : 0
% 0.18/1.35 # Condensation successes : 0
% 0.18/1.35 # Termbank termtop insertions : 11724
% 0.18/1.35
% 0.18/1.35 # -------------------------------------------------
% 0.18/1.35 # User time : 0.025 s
% 0.18/1.35 # System time : 0.001 s
% 0.18/1.35 # Total time : 0.026 s
% 0.18/1.35 # Maximum resident set size: 3492 pages
%------------------------------------------------------------------------------