%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : CSR021+1 : TPTP v9.3.1. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n007.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 12:17:56 PM UTC 2026
% Result : Theorem 0.09s 0.43s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 33 ( 12 unt; 0 def)
% Number of atoms : 362 ( 187 equ)
% Maximal formula atoms : 149 ( 10 avg)
% Number of connectives : 449 ( 120 ~; 229 |; 92 &)
% ( 6 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 37 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 61 ( 0 sgn 38 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(happens_terminates_not_holds,axiom,
! [X4,X5,X2] :
( ( terminates(X4,X2,X5)
& happens(X4,X5) )
=> ~ holdsAt(X2,plus(X5,n1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+0.ax',happens_terminates_not_holds) ).
fof(symmetry_of_plus,axiom,
! [X9,X10] : plus(X9,X10) = plus(X10,X9),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_of_plus) ).
fof(terminates_all_defn,axiom,
! [X4,X2,X5] :
( terminates(X4,X2,X5)
<=> ( ( ~ happens(push,X5)
& X2 = spinning
& X4 = pull )
| ( ~ happens(pull,X5)
& X2 = spinning
& X4 = push )
| ( happens(push,X5)
& X2 = backwards
& X4 = pull )
| ( happens(push,X5)
& X2 = forwards
& X4 = pull )
| ( ~ happens(push,X5)
& X2 = forwards
& X4 = pull )
| ( ~ happens(pull,X5)
& X2 = backwards
& X4 = push ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+2.ax',terminates_all_defn) ).
fof(plus1_2,axiom,
plus(n1,n2) = n3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus1_2) ).
fof(not_backwards_3,conjecture,
~ holdsAt(backwards,n3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_backwards_3) ).
fof(happens_all_defn,axiom,
! [X4,X5] :
( happens(X4,X5)
<=> ( ( X5 = n2
& X4 = push )
| ( X5 = n2
& X4 = pull )
| ( X5 = n1
& X4 = pull )
| ( X5 = n0
& X4 = push ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+2.ax',happens_all_defn) ).
fof(c_0_6,plain,
! [X4,X5,X2] :
( ( terminates(X4,X2,X5)
& happens(X4,X5) )
=> ~ holdsAt(X2,plus(X5,n1)) ),
inference(fof_simplification,[status(thm)],[happens_terminates_not_holds]) ).
fof(c_0_7,plain,
! [X22,X23,X24] :
( ~ holdsAt(X24,plus(X23,n1))
| ~ terminates(X22,X24,X23)
| ~ happens(X22,X23) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_8,plain,
! [X40,X41] : plus(X40,X41) = plus(X41,X40),
inference(variable_rename,[status(thm)],[symmetry_of_plus]) ).
fof(c_0_9,plain,
! [X2,X4,X5] :
( epred3_3(X5,X4,X2)
<=> ( ( ~ happens(push,X5)
& X2 = spinning
& X4 = pull )
| ( ~ happens(pull,X5)
& X2 = spinning
& X4 = push )
| ( happens(push,X5)
& X2 = backwards
& X4 = pull )
| ( happens(push,X5)
& X2 = forwards
& X4 = pull )
| ( ~ happens(push,X5)
& X2 = forwards
& X4 = pull )
| ( ~ happens(pull,X5)
& X2 = backwards
& X4 = push ) ) ),
introduced(definition) ).
fof(c_0_10,plain,
! [X2,X4,X5] :
( epred2_3(X5,X4,X2)
<=> ( ( happens(push,X5)
& X2 = forwards
& X4 = pull )
| ( ~ happens(push,X5)
& X2 = forwards
& X4 = pull )
| ( ~ happens(pull,X5)
& X2 = backwards
& X4 = push ) ) ),
introduced(definition) ).
cnf(c_0_11,plain,
( ~ holdsAt(X3,plus(X2,n1))
| ~ terminates(X1,X3,X2)
| ~ happens(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
plus(X1,X2) = plus(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_13,plain,
! [X4,X2,X5] :
( terminates(X4,X2,X5)
<=> epred3_3(X5,X4,X2) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[terminates_all_defn]),c_0_9]) ).
fof(c_0_14,plain,
! [X2,X4,X5] :
( epred3_3(X5,X4,X2)
<=> ( ( ~ happens(push,X5)
& X2 = spinning
& X4 = pull )
| ( ~ happens(pull,X5)
& X2 = spinning
& X4 = push )
| ( happens(push,X5)
& X2 = backwards
& X4 = pull )
| epred2_3(X5,X4,X2) ) ),
inference(apply_def,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,plain,
( ~ happens(X3,X2)
| ~ terminates(X3,X1,X2)
| ~ holdsAt(X1,plus(n1,X2)) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
plus(n1,n2) = n3,
inference(split_conjunct,[status(thm)],[plus1_2]) ).
fof(c_0_17,plain,
! [X30,X31,X32] :
( ( terminates(X30,X31,X32)
| ~ epred3_3(X32,X30,X31) )
& ( epred3_3(X32,X30,X31)
| ~ terminates(X30,X31,X32) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).
fof(c_0_18,plain,
! [X55,X56,X57] :
( ( epred3_3(X57,X56,X55)
| happens(push,X57)
| X55 != spinning
| X56 != pull )
& ( epred3_3(X57,X56,X55)
| happens(pull,X57)
| X55 != spinning
| X56 != push )
& ( epred3_3(X57,X56,X55)
| ~ happens(push,X57)
| X55 != backwards
| X56 != pull )
& ( epred3_3(X57,X56,X55)
| ~ epred2_3(X57,X56,X55) )
& ( ~ epred3_3(X57,X56,X55)
| epred2_3(X57,X56,X55)
| happens(push,X57)
| ~ happens(pull,X57)
| ~ happens(push,X57) )
& ( ~ epred3_3(X57,X56,X55)
| epred2_3(X57,X56,X55)
| happens(push,X57)
| ~ happens(pull,X57)
| X55 = spinning )
& ( ~ epred3_3(X57,X56,X55)
| epred2_3(X57,X56,X55)
| happens(push,X57)
| ~ happens(pull,X57)
| X56 = pull )
& ( ~ epred3_3(X57,X56,X55)
| epred2_3(X57,X56,X55)
| happens(push,X57)
| X55 = spinning
| ~ happens(push,X57) )
& ( ~ epred3_3(X57,X56,X55)
| epred2_3(X57,X56,X55)
| happens(push,X57)
| X55 = spinning
| X55 = spinning )
& ( ~ epred3_3(X57,X56,X55)
| epred2_3(X57,X56,X55)
| happens(push,X57)
| X55 = spinning
| X56 = pull )
& ( ~ epred3_3(X57,X56,X55)
| epred2_3(X57,X56,X55)
| happens(push,X57)
| X56 = push
| ~ happens(push,X57) )
& ( ~ epred3_3(X57,X56,X55)
| epred2_3(X57,X56,X55)
| happens(push,X57)
| X56 = push
| X55 = spinning )
& ( ~ epred3_3(X57,X56,X55)
| epred2_3(X57,X56,X55)
| happens(push,X57)
| X56 = push
| X56 = pull )
& ( ~ epred3_3(X57,X56,X55)
| epred2_3(X57,X56,X55)
| X55 = backwards
| ~ happens(pull,X57)
| ~ happens(push,X57) )
& ( ~ epred3_3(X57,X56,X55)
| epred2_3(X57,X56,X55)
| X55 = backwards
| ~ happens(pull,X57)
| X55 = spinning )
& ( ~ epred3_3(X57,X56,X55)
| epred2_3(X57,X56,X55)
| X55 = backwards
| ~ happens(pull,X57)
| X56 = pull )
& ( ~ epred3_3(X57,X56,X55)
| epred2_3(X57,X56,X55)
| X55 = backwards
| X55 = spinning
| ~ happens(push,X57) )
& ( ~ epred3_3(X57,X56,X55)
| epred2_3(X57,X56,X55)
| X55 = backwards
| X55 = spinning
| X55 = spinning )
& ( ~ epred3_3(X57,X56,X55)
| epred2_3(X57,X56,X55)
| X55 = backwards
| X55 = spinning
| X56 = pull )
& ( ~ epred3_3(X57,X56,X55)
| epred2_3(X57,X56,X55)
| X55 = backwards
| X56 = push
| ~ happens(push,X57) )
& ( ~ epred3_3(X57,X56,X55)
| epred2_3(X57,X56,X55)
| X55 = backwards
| X56 = push
| X55 = spinning )
& ( ~ epred3_3(X57,X56,X55)
| epred2_3(X57,X56,X55)
| X55 = backwards
| X56 = push
| X56 = pull )
& ( ~ epred3_3(X57,X56,X55)
| epred2_3(X57,X56,X55)
| X56 = pull
| ~ happens(pull,X57)
| ~ happens(push,X57) )
& ( ~ epred3_3(X57,X56,X55)
| epred2_3(X57,X56,X55)
| X56 = pull
| ~ happens(pull,X57)
| X55 = spinning )
& ( ~ epred3_3(X57,X56,X55)
| epred2_3(X57,X56,X55)
| X56 = pull
| ~ happens(pull,X57)
| X56 = pull )
& ( ~ epred3_3(X57,X56,X55)
| epred2_3(X57,X56,X55)
| X56 = pull
| X55 = spinning
| ~ happens(push,X57) )
& ( ~ epred3_3(X57,X56,X55)
| epred2_3(X57,X56,X55)
| X56 = pull
| X55 = spinning
| X55 = spinning )
& ( ~ epred3_3(X57,X56,X55)
| epred2_3(X57,X56,X55)
| X56 = pull
| X55 = spinning
| X56 = pull )
& ( ~ epred3_3(X57,X56,X55)
| epred2_3(X57,X56,X55)
| X56 = pull
| X56 = push
| ~ happens(push,X57) )
& ( ~ epred3_3(X57,X56,X55)
| epred2_3(X57,X56,X55)
| X56 = pull
| X56 = push
| X55 = spinning )
& ( ~ epred3_3(X57,X56,X55)
| epred2_3(X57,X56,X55)
| X56 = pull
| X56 = push
| X56 = pull ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])]) ).
fof(c_0_19,negated_conjecture,
~ ~ holdsAt(backwards,n3),
inference(assume_negation,[status(cth)],[not_backwards_3]) ).
fof(c_0_20,plain,
! [X47,X48] :
( ( happens(X47,X48)
| X48 != n2
| X47 != push )
& ( happens(X47,X48)
| X48 != n2
| X47 != pull )
& ( happens(X47,X48)
| X48 != n1
| X47 != pull )
& ( happens(X47,X48)
| X48 != n0
| X47 != push )
& ( ~ happens(X47,X48)
| X48 = n0
| X48 = n1
| X48 = n2
| X48 = n2 )
& ( ~ happens(X47,X48)
| X48 = n0
| X48 = n1
| X48 = n2
| X47 = push )
& ( ~ happens(X47,X48)
| X48 = n0
| X48 = n1
| X47 = pull
| X48 = n2 )
& ( ~ happens(X47,X48)
| X48 = n0
| X48 = n1
| X47 = pull
| X47 = push )
& ( ~ happens(X47,X48)
| X48 = n0
| X47 = pull
| X48 = n2
| X48 = n2 )
& ( ~ happens(X47,X48)
| X48 = n0
| X47 = pull
| X48 = n2
| X47 = push )
& ( ~ happens(X47,X48)
| X48 = n0
| X47 = pull
| X47 = pull
| X48 = n2 )
& ( ~ happens(X47,X48)
| X48 = n0
| X47 = pull
| X47 = pull
| X47 = push )
& ( ~ happens(X47,X48)
| X47 = push
| X48 = n1
| X48 = n2
| X48 = n2 )
& ( ~ happens(X47,X48)
| X47 = push
| X48 = n1
| X48 = n2
| X47 = push )
& ( ~ happens(X47,X48)
| X47 = push
| X48 = n1
| X47 = pull
| X48 = n2 )
& ( ~ happens(X47,X48)
| X47 = push
| X48 = n1
| X47 = pull
| X47 = push )
& ( ~ happens(X47,X48)
| X47 = push
| X47 = pull
| X48 = n2
| X48 = n2 )
& ( ~ happens(X47,X48)
| X47 = push
| X47 = pull
| X48 = n2
| X47 = push )
& ( ~ happens(X47,X48)
| X47 = push
| X47 = pull
| X47 = pull
| X48 = n2 )
& ( ~ happens(X47,X48)
| X47 = push
| X47 = pull
| X47 = pull
| X47 = push ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[happens_all_defn])])])]) ).
cnf(c_0_21,plain,
( ~ happens(X2,n2)
| ~ terminates(X2,X1,n2)
| ~ holdsAt(X1,n3) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,plain,
( ~ epred3_3(X1,X2,X3)
| terminates(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
( ~ happens(push,X3)
| X2 != backwards
| X1 != pull
| epred3_3(X3,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_24,negated_conjecture,
holdsAt(backwards,n3),
inference(fof_simplification,[status(thm)],[c_0_19]) ).
cnf(c_0_25,plain,
( X2 != n2
| X1 != pull
| happens(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_26,plain,
( X2 != n2
| X1 != push
| happens(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,plain,
( ~ happens(X1,n2)
| ~ holdsAt(X2,n3)
| ~ epred3_3(n2,X1,X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,plain,
( ~ happens(push,X1)
| epred3_3(X1,pull,backwards) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_23])]) ).
cnf(c_0_29,negated_conjecture,
holdsAt(backwards,n3),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,plain,
happens(pull,n2),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_25])]) ).
cnf(c_0_31,plain,
happens(push,n2),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_26])]) ).
cnf(c_0_32,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_30]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR021+1 : TPTP v9.3.1. Bugfixed v3.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n007.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 14:22:21 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.40 Running first-order theorem proving
% 0.09/0.40 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.09/0.43 % Version: 3.5.1
% 0.09/0.43 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.09/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.43 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.09/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.09/0.43 % Starting sh5l with 300s (1) cores
% 0.09/0.43 % new_bool_1 with pid 1323992 completed with status 0
% 0.09/0.43 % Result found by new_bool_1
% 0.09/0.43 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.09/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.43 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.09/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.09/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.09/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.09/0.43 % Search class: FGHSF-FSLM22-SFFFFFNN
% 0.09/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.09/0.43 % SubtermCWHack with pid 1323995 completed with status 0
% 0.09/0.43 % Result found by SubtermCWHack
% 0.09/0.43 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.09/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.43 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.09/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.09/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.09/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.09/0.43 % Search class: FGHSF-FSLM22-SFFFFFNN
% 0.09/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.09/0.43 % Preprocessing time : 0.001 s
% 0.09/0.43
% 0.09/0.43 % Proof found!
% 0.09/0.43 % SZS status Theorem
% 0.09/0.43 % SZS output start CNFRefutation
% See solution above
% 0.09/0.43 % Parsed axioms : 48
% 0.09/0.43 % Removed by relevancy pruning/SinE : 17
% 0.09/0.43 % Initial clauses : 154
% 0.09/0.43 % Removed in clause preprocessing : 9
% 0.09/0.43 % Initial clauses in saturation : 145
% 0.09/0.43 % Processed clauses : 210
% 0.09/0.43 % ...of these trivial : 0
% 0.09/0.43 % ...subsumed : 72
% 0.09/0.43 % ...remaining for further processing : 138
% 0.09/0.43 % Other redundant clauses eliminated : 28
% 0.09/0.43 % Clauses deleted for lack of memory : 0
% 0.09/0.43 % Backward-subsumed : 2
% 0.09/0.43 % Backward-rewritten : 2
% 0.09/0.43 % Generated clauses : 202
% 0.09/0.43 % ...of the previous two non-redundant : 147
% 0.09/0.43 % ...aggressively subsumed : 0
% 0.09/0.43 % Contextual simplify-reflections : 1
% 0.09/0.43 % Paramodulations : 185
% 0.09/0.43 % Factorizations : 2
% 0.09/0.43 % NegExts : 0
% 0.09/0.43 % Equation resolutions : 28
% 0.09/0.43 % Disequality decompositions : 0
% 0.09/0.43 % Total rewrite steps : 65
% 0.09/0.43 % ...of those cached : 50
% 0.09/0.43 % Propositional unsat checks : 0
% 0.09/0.43 % Propositional check models : 0
% 0.09/0.43 % Propositional check unsatisfiable : 0
% 0.09/0.43 % Propositional clauses : 0
% 0.09/0.43 % Propositional clauses after purity: 0
% 0.09/0.43 % Propositional unsat core size : 0
% 0.09/0.43 % Propositional preprocessing time : 0.000
% 0.09/0.43 % Propositional encoding time : 0.000
% 0.09/0.43 % Propositional solver time : 0.000
% 0.09/0.43 % Success case prop preproc time : 0.000
% 0.09/0.43 % Success case prop encoding time : 0.000
% 0.09/0.43 % Success case prop solver time : 0.000
% 0.09/0.43 % Current number of processed clauses : 119
% 0.09/0.43 % Positive orientable unit clauses : 17
% 0.09/0.43 % Positive unorientable unit clauses: 1
% 0.09/0.43 % Negative unit clauses : 15
% 0.09/0.43 % Non-unit-clauses : 86
% 0.09/0.43 % Current number of unprocessed clauses: 82
% 0.09/0.43 % ...number of literals in the above : 344
% 0.09/0.43 % Current number of archived formulas : 0
% 0.09/0.43 % Current number of archived clauses : 4
% 0.09/0.43 % Clause-clause subsumption calls (NU) : 893
% 0.09/0.43 % Rec. Clause-clause subsumption calls : 631
% 0.09/0.43 % Non-unit clause-clause subsumptions : 52
% 0.09/0.43 % Unit Clause-clause subsumption calls : 125
% 0.09/0.43 % Rewrite failures with RHS unbound : 0
% 0.09/0.43 % BW rewrite match attempts : 13
% 0.09/0.43 % BW rewrite match successes : 13
% 0.09/0.43 % Condensation attempts : 0
% 0.09/0.43 % Condensation successes : 0
% 0.09/0.43 % Termbank termtop insertions : 8808
% 0.09/0.43 % Search garbage collected termcells : 1355
% 0.09/0.43
% 0.09/0.43 % -------------------------------------------------
% 0.09/0.43 % User time : 0.014 s
% 0.09/0.43 % System time : 0.000 s
% 0.09/0.43 % Total time : 0.014 s
% 0.09/0.43 % Maximum resident set size: 3888 pages
% 0.09/0.43
% 0.09/0.43 % -------------------------------------------------
% 0.09/0.43 % User time : 0.015 s
% 0.09/0.43 % System time : 0.006 s
% 0.09/0.43 % Total time : 0.021 s
% 0.09/0.43 % Maximum resident set size: 4608 pages
% 0.09/0.43 % E exiting
%------------------------------------------------------------------------------