%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC397-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n008.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 02:44:15 PM UTC 2026
% Result : Unsatisfiable 0.24s 0.62s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 20
% Syntax : Number of clauses : 74 ( 24 unt; 8 nHn; 74 RR)
% Number of literals : 190 ( 36 equ; 117 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 64 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_8,negated_conjecture,
memberP(sk1,sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_10,negated_conjecture,
( nil != sk4
| nil = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(clause71,axiom,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause71) ).
cnf(co1_11,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(clause100,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(co1_7,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_12,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk7) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_13,negated_conjecture,
( ~ neq(sk4,nil)
| app(cons(sk6,nil),sk7) = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
cnf(clause120,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(co1_4,negated_conjecture,
ssList(sk4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_4) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause140,axiom,
( ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ memberP(X1,X2)
| memberP(app(X1,X3),X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause140) ).
cnf(co1_14,negated_conjecture,
( ~ neq(sk4,nil)
| app(sk7,cons(sk6,nil)) = sk4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
cnf(clause161,axiom,
( ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ memberP(cons(X1,X2),X3)
| X3 = X1
| memberP(X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause161) ).
cnf(clause141,axiom,
( ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ memberP(X1,X2)
| memberP(app(X3,X1),X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause141) ).
cnf(clause138,axiom,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| X1 != X2
| memberP(cons(X2,X3),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause138) ).
cnf(co1_9,negated_conjecture,
~ memberP(sk2,sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(c_0_20,negated_conjecture,
memberP(sk1,sk5),
co1_8 ).
cnf(c_0_21,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_22,negated_conjecture,
( nil != sk4
| nil = sk3 ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_23,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
inference(fof_simplification,[status(thm)],[clause71]) ).
cnf(c_0_24,negated_conjecture,
memberP(sk3,sk5),
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,negated_conjecture,
( nil != sk4
| nil = sk3 ),
c_0_22 ).
cnf(c_0_26,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk6) ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_27,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_28,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
c_0_23 ).
cnf(c_0_29,negated_conjecture,
( sk4 != nil
| memberP(nil,sk5) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,negated_conjecture,
ssItem(sk5),
co1_7 ).
cnf(c_0_31,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk7) ),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_32,negated_conjecture,
( ~ neq(sk4,nil)
| app(cons(sk6,nil),sk7) = sk3 ),
inference(fof_simplification,[status(thm)],[co1_13]) ).
cnf(c_0_33,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_34,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk6) ),
c_0_26 ).
cnf(c_0_35,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_27 ).
cnf(c_0_36,negated_conjecture,
ssList(sk4),
co1_4 ).
cnf(c_0_37,axiom,
ssList(nil),
clause8 ).
cnf(c_0_38,negated_conjecture,
sk4 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).
cnf(c_0_39,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk7) ),
c_0_31 ).
cnf(c_0_40,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ memberP(X1,X2)
| memberP(app(X1,X3),X2) ),
inference(fof_simplification,[status(thm)],[clause140]) ).
cnf(c_0_41,negated_conjecture,
( ~ neq(sk4,nil)
| app(sk7,cons(sk6,nil)) = sk4 ),
inference(fof_simplification,[status(thm)],[co1_14]) ).
cnf(c_0_42,negated_conjecture,
( ~ neq(sk4,nil)
| app(cons(sk6,nil),sk7) = sk3 ),
c_0_32 ).
cnf(c_0_43,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_33 ).
cnf(c_0_44,negated_conjecture,
ssItem(sk6),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]),c_0_37])]),c_0_38]) ).
cnf(c_0_45,negated_conjecture,
ssList(sk7),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_35]),c_0_36]),c_0_37])]),c_0_38]) ).
cnf(c_0_46,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ memberP(X1,X2)
| memberP(app(X1,X3),X2) ),
c_0_40 ).
cnf(c_0_47,negated_conjecture,
( ~ neq(sk4,nil)
| app(sk7,cons(sk6,nil)) = sk4 ),
c_0_41 ).
cnf(c_0_48,plain,
( ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ memberP(cons(X1,X2),X3)
| X3 = X1
| memberP(X2,X3) ),
inference(fof_simplification,[status(thm)],[clause161]) ).
cnf(c_0_49,negated_conjecture,
( ~ neq(sk4,nil)
| cons(sk6,sk7) = sk3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]),c_0_45])]) ).
cnf(c_0_50,plain,
( ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ memberP(X1,X2)
| memberP(app(X3,X1),X2) ),
inference(fof_simplification,[status(thm)],[clause141]) ).
cnf(c_0_51,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| X1 != X2
| memberP(cons(X2,X3),X1) ),
inference(fof_simplification,[status(thm)],[clause138]) ).
cnf(c_0_52,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| ~ ssItem(X1)
| ~ memberP(sk7,X1)
| ~ neq(sk4,nil)
| memberP(sk4,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_45])]) ).
cnf(c_0_53,plain,
( ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ memberP(cons(X1,X2),X3)
| X3 = X1
| memberP(X2,X3) ),
c_0_48 ).
cnf(c_0_54,negated_conjecture,
cons(sk6,sk7) = sk3,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_35]),c_0_36]),c_0_37])]),c_0_38]) ).
cnf(c_0_55,negated_conjecture,
~ memberP(sk2,sk5),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_56,plain,
( ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ memberP(X1,X2)
| memberP(app(X3,X1),X2) ),
c_0_50 ).
cnf(c_0_57,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| X1 != X2
| memberP(cons(X2,X3),X1) ),
c_0_51 ).
cnf(c_0_58,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| ~ ssItem(X1)
| ~ memberP(sk7,X1)
| memberP(sk4,X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_35]),c_0_36]),c_0_37])]),c_0_38]) ).
cnf(c_0_59,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(sk3,X1)
| memberP(sk7,X1)
| sk6 = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_44]),c_0_45])]) ).
cnf(c_0_60,negated_conjecture,
~ memberP(sk2,sk5),
c_0_55 ).
cnf(c_0_61,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_62,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| ~ ssItem(X1)
| ~ memberP(cons(sk6,nil),X1)
| ~ neq(sk4,nil)
| memberP(sk4,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_47]),c_0_45])]) ).
cnf(c_0_63,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| memberP(cons(X1,X2),X1) ),
inference(er,[status(thm)],[c_0_57]) ).
cnf(c_0_64,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| ~ ssItem(X1)
| ~ memberP(sk3,X1)
| memberP(sk4,X1)
| sk6 = X1 ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_65,negated_conjecture,
~ memberP(sk4,sk5),
inference(rw,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_66,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_67,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| ~ neq(sk4,nil)
| memberP(sk4,sk6) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_44]),c_0_37])]) ).
cnf(c_0_68,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| sk6 = sk5 ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_24]),c_0_30])]),c_0_65]) ).
cnf(c_0_69,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_66 ).
cnf(c_0_70,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| memberP(sk4,sk6) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_35]),c_0_36]),c_0_37])]),c_0_38]) ).
cnf(c_0_71,negated_conjecture,
sk6 = sk5,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_44]),c_0_37])]) ).
cnf(c_0_72,negated_conjecture,
~ ssList(cons(sk5,nil)),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_70,c_0_71]),c_0_71]),c_0_65]) ).
cnf(c_0_73,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_69]),c_0_30]),c_0_37])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC397-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.43 % Computer : n008.cluster.edu
% 0.17/0.43 % Model : x86_64 x86_64
% 0.17/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43 % Memory : 8046.5625MB
% 0.17/0.43 % OS : Linux 6.8.0-71-generic
% 0.17/0.43 % CPULimit : 300
% 0.17/0.43 % WCLimit : 300
% 0.17/0.43 % DateTime : Mon Sep 21 08:22:12 UTC 2026
% 0.17/0.44 % CPUTime :
% 0.17/0.44 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.52 Running first-order theorem proving
% 0.17/0.52 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.24/0.62 % Version: 3.5.1
% 0.24/0.62 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.62 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.62 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.62 % Starting sh5l with 300s (1) cores
% 0.24/0.62 % new_bool_3 with pid 569312 completed with status 0
% 0.24/0.62 % Result found by new_bool_3
% 0.24/0.62 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.62 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.62 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/0.62 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.62 % Search class: FGHSF-FFMM22-SFFFFFNN
% 0.24/0.62 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.62 % Starting SubtermCWHack with 31s (1) cores
% 0.24/0.62 % SubtermCWHack with pid 569315 completed with status 0
% 0.24/0.62 % Result found by SubtermCWHack
% 0.24/0.62 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.62 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.62 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/0.62 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.62 % Search class: FGHSF-FFMM22-SFFFFFNN
% 0.24/0.62 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.62 % Starting SubtermCWHack with 31s (1) cores
% 0.24/0.62 % Preprocessing time : 0.003 s
% 0.24/0.62
% 0.24/0.62 % Proof found!
% 0.24/0.62 % SZS status Unsatisfiable
% 0.24/0.62 % SZS output start CNFRefutation
% See solution above
% 0.24/0.62 % Parsed axioms : 199
% 0.24/0.62 % Removed by relevancy pruning/SinE : 156
% 0.24/0.62 % Initial clauses : 43
% 0.24/0.62 % Removed in clause preprocessing : 0
% 0.24/0.62 % Initial clauses in saturation : 43
% 0.24/0.62 % Processed clauses : 175
% 0.24/0.62 % ...of these trivial : 1
% 0.24/0.62 % ...subsumed : 51
% 0.24/0.62 % ...remaining for further processing : 123
% 0.24/0.62 % Other redundant clauses eliminated : 10
% 0.24/0.62 % Clauses deleted for lack of memory : 0
% 0.24/0.62 % Backward-subsumed : 18
% 0.24/0.62 % Backward-rewritten : 16
% 0.24/0.62 % Generated clauses : 473
% 0.24/0.62 % ...of the previous two non-redundant : 346
% 0.24/0.62 % ...aggressively subsumed : 0
% 0.24/0.62 % Contextual simplify-reflections : 0
% 0.24/0.62 % Paramodulations : 460
% 0.24/0.62 % Factorizations : 0
% 0.24/0.62 % NegExts : 0
% 0.24/0.62 % Equation resolutions : 14
% 0.24/0.62 % Disequality decompositions : 0
% 0.24/0.62 % Total rewrite steps : 475
% 0.24/0.62 % ...of those cached : 460
% 0.24/0.62 % Propositional unsat checks : 0
% 0.24/0.62 % Propositional check models : 0
% 0.24/0.62 % Propositional check unsatisfiable : 0
% 0.24/0.62 % Propositional clauses : 0
% 0.24/0.62 % Propositional clauses after purity: 0
% 0.24/0.62 % Propositional unsat core size : 0
% 0.24/0.62 % Propositional preprocessing time : 0.000
% 0.24/0.62 % Propositional encoding time : 0.000
% 0.24/0.62 % Propositional solver time : 0.000
% 0.24/0.62 % Success case prop preproc time : 0.000
% 0.24/0.62 % Success case prop encoding time : 0.000
% 0.24/0.62 % Success case prop solver time : 0.000
% 0.24/0.62 % Current number of processed clauses : 84
% 0.24/0.62 % Positive orientable unit clauses : 13
% 0.24/0.62 % Positive unorientable unit clauses: 0
% 0.24/0.62 % Negative unit clauses : 8
% 0.24/0.62 % Non-unit-clauses : 63
% 0.24/0.62 % Current number of unprocessed clauses: 200
% 0.24/0.62 % ...number of literals in the above : 972
% 0.24/0.62 % Current number of archived formulas : 0
% 0.24/0.62 % Current number of archived clauses : 34
% 0.24/0.62 % Clause-clause subsumption calls (NU) : 805
% 0.24/0.62 % Rec. Clause-clause subsumption calls : 362
% 0.24/0.62 % Non-unit clause-clause subsumptions : 51
% 0.24/0.62 % Unit Clause-clause subsumption calls : 112
% 0.24/0.62 % Rewrite failures with RHS unbound : 0
% 0.24/0.62 % BW rewrite match attempts : 7
% 0.24/0.62 % BW rewrite match successes : 7
% 0.24/0.62 % Condensation attempts : 0
% 0.24/0.62 % Condensation successes : 0
% 0.24/0.62 % Termbank termtop insertions : 10814
% 0.24/0.62 % Search garbage collected termcells : 907
% 0.24/0.62
% 0.24/0.62 % -------------------------------------------------
% 0.24/0.62 % User time : 0.024 s
% 0.24/0.62 % System time : 0.006 s
% 0.24/0.62 % Total time : 0.030 s
% 0.24/0.62 % Maximum resident set size: 3812 pages
% 0.24/0.62
% 0.24/0.62 % -------------------------------------------------
% 0.24/0.62 % User time : 0.032 s
% 0.24/0.62 % System time : 0.012 s
% 0.24/0.62 % Total time : 0.044 s
% 0.24/0.62 % Maximum resident set size: 5120 pages
% 0.24/0.62 % E exiting
%------------------------------------------------------------------------------