%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYN738-1 : TPTP v9.3.1. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n002.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 03:26:12 PM UTC 2026
% Result : Satisfiable 0.15s 10.66s
% Output : Saturation 0.15s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_29ERROR: Could not build tree for root c_0_80ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_23,negated_conjecture,
( ~ ssPv2(X1)
| ~ ssPv1(X1)
| ~ ssRr(X1,X3)
| ~ ssPv7(X2)
| ~ ssRr(X1,X2)
| ssPv4(X3) ),
c_0_21,
[final] ).
cnf(c_0_24,negated_conjecture,
ssRr(X1,skf1(X1)),
clause1,
[final] ).
cnf(c_0_30,negated_conjecture,
( ~ ssPv4(X3)
| ~ ssRr(X1,X3)
| ~ ssPv8(X2)
| ~ ssRr(X1,X2)
| ssPv7(X1)
| ssPv5(X1) ),
c_0_22,
[final] ).
cnf(c_0_31,negated_conjecture,
( ~ ssRr(X1,X2)
| ~ ssPv2(X1)
| ~ ssPv1(X1)
| ~ ssPv7(X2)
| ssPv4(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]),
[final] ).
cnf(c_0_32,negated_conjecture,
( ~ ssPv6(X1)
| ~ ssPv1(X1)
| ~ ssRr(X1,X3)
| ~ ssPv3(X2)
| ~ ssRr(X1,X2)
| ssPv7(X3) ),
c_0_25,
[final] ).
cnf(c_0_34,negated_conjecture,
( ~ ssPv4(X1)
| ~ ssRr(X1,X4)
| ~ ssPv3(X3)
| ~ ssRr(X1,X3)
| ~ ssPv6(X2)
| ~ ssRr(X1,X2)
| ssPv5(X4) ),
c_0_26,
[final] ).
cnf(c_0_35,negated_conjecture,
( ~ ssPv5(X1)
| ~ ssRr(X1,X4)
| ~ ssRr(X1,X3)
| ~ ssPv5(X2)
| ~ ssRr(X1,X2)
| ssPv4(X4)
| ssPv6(X3) ),
c_0_27,
[final] ).
cnf(c_0_37,negated_conjecture,
( ~ ssRr(X1,X4)
| ~ ssRr(X1,X3)
| ~ ssPv7(X2)
| ~ ssRr(X1,X2)
| ssPv4(X1)
| ssPv3(X4)
| ssPv8(X3) ),
c_0_28,
[final] ).
cnf(c_0_41,negated_conjecture,
( ~ ssPv7(X1)
| ~ ssRr(X1,X4)
| ~ ssPv1(X3)
| ~ ssRr(X1,X3)
| ~ ssPv3(X2)
| ~ ssRr(X1,X2)
| ssPv7(X4) ),
c_0_29,
[final] ).
cnf(c_0_42,negated_conjecture,
( ~ ssRr(X1,X2)
| ~ ssPv8(X2)
| ~ ssPv4(skf1(X1))
| ssPv5(X1)
| ssPv7(X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_24]),
[final] ).
cnf(c_0_43,negated_conjecture,
( ~ ssPv2(X1)
| ~ ssPv1(X1)
| ~ ssPv7(skf1(X1))
| ssPv4(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_31,c_0_24]),
[final] ).
cnf(c_0_44,negated_conjecture,
( ~ ssRr(X1,X2)
| ~ ssPv3(X2)
| ~ ssPv1(X1)
| ~ ssPv6(X1)
| ssPv7(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_32,c_0_24]),
[final] ).
cnf(c_0_45,negated_conjecture,
( ~ ssPv2(X1)
| ~ ssPv3(X2)
| ~ ssRr(X1,X2)
| ssPv7(X1)
| ssPv1(X1) ),
c_0_33,
[final] ).
cnf(c_0_46,negated_conjecture,
( ~ ssRr(X1,X2)
| ~ ssRr(X1,X3)
| ~ ssPv3(X3)
| ~ ssPv4(X1)
| ~ ssPv6(X2)
| ssPv5(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_34,c_0_24]),
[final] ).
cnf(c_0_47,negated_conjecture,
( ~ ssRr(X2,X3)
| ~ ssRr(X2,X1)
| ~ ssPv5(X2)
| ~ ssPv5(X3)
| ssPv4(skf1(X2))
| ssPv6(X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_24]),
[final] ).
cnf(c_0_48,negated_conjecture,
( ~ ssPv3(X1)
| ~ ssRr(X1,X4)
| ~ ssRr(X1,X3)
| ~ ssPv6(X2)
| ~ ssRr(X1,X2)
| ssPv6(X4)
| ssPv8(X3) ),
c_0_36,
[final] ).
cnf(c_0_49,negated_conjecture,
( ~ ssRr(X1,X3)
| ~ ssRr(X1,X2)
| ~ ssPv7(X3)
| ssPv3(skf1(X1))
| ssPv8(X2)
| ssPv4(X1) ),
inference(spm,[status(thm)],[c_0_37,c_0_24]),
[final] ).
cnf(c_0_55,negated_conjecture,
( ~ ssPv8(X1)
| ~ ssPv3(X1)
| ~ ssRr(X1,X3)
| ~ ssPv7(X2)
| ~ ssRr(X1,X2)
| ssPv8(X3) ),
c_0_38,
[final] ).
cnf(c_0_56,negated_conjecture,
( ~ ssRr(X1,X3)
| ~ ssPv3(X2)
| ~ ssRr(X1,X2)
| ssPv8(X1)
| ssPv6(X1)
| ssPv5(X3) ),
c_0_39,
[final] ).
cnf(c_0_57,negated_conjecture,
( ~ ssPv4(X1)
| ~ ssRr(X1,X3)
| ~ ssRr(X1,X2)
| ssPv5(X1)
| ssPv3(X3)
| ssPv5(X2) ),
c_0_40,
[final] ).
cnf(c_0_61,negated_conjecture,
( ~ ssRr(X1,X3)
| ~ ssRr(X1,X2)
| ~ ssPv3(X3)
| ~ ssPv1(X2)
| ~ ssPv7(X1)
| ssPv7(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_41,c_0_24]),
[final] ).
cnf(c_0_62,negated_conjecture,
( ~ ssRr(X1,X2)
| ~ ssPv8(X2)
| ~ ssPv2(X1)
| ~ ssPv1(X1)
| ~ ssPv7(skf1(X1))
| ssPv5(X1)
| ssPv7(X1) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]),
[final] ).
cnf(c_0_63,negated_conjecture,
( ~ ssPv3(skf1(X1))
| ~ ssPv1(X1)
| ~ ssPv6(X1)
| ssPv7(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_44,c_0_24]),
[final] ).
cnf(c_0_64,negated_conjecture,
( ~ ssPv3(skf1(X1))
| ~ ssPv2(X1)
| ssPv1(X1)
| ssPv7(X1) ),
inference(spm,[status(thm)],[c_0_45,c_0_24]),
[final] ).
cnf(c_0_65,negated_conjecture,
( ~ ssRr(X1,X2)
| ~ ssPv3(skf1(X1))
| ~ ssPv4(X1)
| ~ ssPv6(X2)
| ssPv5(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_46,c_0_24]),
[final] ).
cnf(c_0_66,negated_conjecture,
( ~ ssRr(X1,X2)
| ~ ssPv5(X1)
| ~ ssPv5(X2)
| ssPv4(skf1(X1))
| ssPv6(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_47,c_0_24]),
[final] ).
cnf(c_0_67,negated_conjecture,
( ~ ssRr(X1,X3)
| ~ ssRr(X1,X2)
| ~ ssPv3(X1)
| ~ ssPv6(X3)
| ssPv8(X2)
| ssPv6(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_48,c_0_24]),
[final] ).
cnf(c_0_68,negated_conjecture,
( ~ ssRr(X1,X2)
| ~ ssPv7(X2)
| ssPv3(skf1(X1))
| ssPv8(skf1(X1))
| ssPv4(X1) ),
inference(spm,[status(thm)],[c_0_49,c_0_24]),
[final] ).
cnf(c_0_69,negated_conjecture,
( ~ ssPv8(X1)
| ~ ssPv4(X1)
| ~ ssPv3(X3)
| ~ ssRr(X1,X3)
| ~ ssPv4(X2)
| ~ ssRr(X1,X2) ),
c_0_50,
[final] ).
cnf(c_0_70,negated_conjecture,
( ~ ssPv5(X1)
| ~ ssPv4(X1)
| ~ ssRr(X1,X3)
| ~ ssPv6(X2)
| ~ ssRr(X1,X2)
| ssPv6(X3) ),
c_0_51,
[final] ).
cnf(c_0_71,negated_conjecture,
( ~ ssPv2(X1)
| ~ ssPv2(X3)
| ~ ssRr(X1,X3)
| ~ ssPv5(X2)
| ~ ssRr(X1,X2)
| ssPv7(X1) ),
c_0_52,
[final] ).
cnf(c_0_72,negated_conjecture,
( ~ ssPv8(X1)
| ~ ssPv3(X1)
| ~ ssRr(X1,X3)
| ~ ssPv7(X2)
| ~ ssRr(X1,X2)
| ssPv7(X3) ),
c_0_53,
[final] ).
cnf(c_0_73,negated_conjecture,
( ~ ssPv1(X1)
| ~ ssPv2(X3)
| ~ ssRr(X1,X3)
| ~ ssPv3(X2)
| ~ ssRr(X1,X2)
| ssPv8(X1) ),
c_0_54,
[final] ).
cnf(c_0_74,negated_conjecture,
( ~ ssRr(X1,X2)
| ~ ssPv3(X1)
| ~ ssPv8(X1)
| ~ ssPv7(X2)
| ssPv8(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_55,c_0_24]),
[final] ).
cnf(c_0_75,negated_conjecture,
( ~ ssRr(X1,X2)
| ~ ssPv3(X2)
| ssPv8(X1)
| ssPv5(skf1(X1))
| ssPv6(X1) ),
inference(spm,[status(thm)],[c_0_56,c_0_24]),
[final] ).
cnf(c_0_76,negated_conjecture,
( ~ ssRr(X2,X1)
| ~ ssPv4(X2)
| ssPv3(skf1(X2))
| ssPv5(X2)
| ssPv5(X1) ),
inference(spm,[status(thm)],[c_0_57,c_0_24]),
[final] ).
cnf(c_0_77,negated_conjecture,
( ~ ssPv4(X1)
| ~ ssPv3(X1)
| ~ ssPv7(X2)
| ~ ssRr(X1,X2)
| ssPv6(X1) ),
c_0_58,
[final] ).
cnf(c_0_78,negated_conjecture,
( ~ ssPv8(X1)
| ~ ssPv5(X1)
| ~ ssRr(X1,X2)
| ssPv2(X1)
| ssPv2(X2) ),
c_0_59,
[final] ).
cnf(c_0_79,negated_conjecture,
( ~ ssPv8(X1)
| ~ ssPv3(X2)
| ~ ssRr(X1,X2)
| ssPv5(X1)
| ssPv4(X1) ),
c_0_60,
[final] ).
cnf(c_0_80,negated_conjecture,
( ~ ssRr(X1,X2)
| ~ ssPv3(X2)
| ~ ssPv1(skf1(X1))
| ~ ssPv7(X1)
| ssPv7(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_61,c_0_24]),
[final] ).
cnf(c_0_81,negated_conjecture,
( ~ ssRr(X1,X2)
| ~ ssPv3(skf1(X1))
| ~ ssPv8(X2)
| ~ ssPv2(X1)
| ~ ssPv6(X1)
| ssPv5(X1)
| ssPv7(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64]),
[final] ).
cnf(c_0_82,negated_conjecture,
( ~ ssPv3(skf1(X1))
| ~ ssPv4(X1)
| ~ ssPv6(skf1(X1))
| ssPv5(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_65,c_0_24]),
[final] ).
cnf(c_0_83,negated_conjecture,
( ~ ssPv5(X1)
| ~ ssPv5(skf1(X1))
| ssPv4(skf1(X1))
| ssPv6(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_66,c_0_24]),
[final] ).
cnf(c_0_84,negated_conjecture,
( ~ ssRr(X1,X2)
| ~ ssPv3(X1)
| ~ ssPv6(X2)
| ssPv8(skf1(X1))
| ssPv6(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_67,c_0_24]),
[final] ).
cnf(c_0_85,negated_conjecture,
( ~ ssPv7(skf1(X1))
| ssPv3(skf1(X1))
| ssPv8(skf1(X1))
| ssPv4(X1) ),
inference(spm,[status(thm)],[c_0_68,c_0_24]),
[final] ).
cnf(c_0_86,negated_conjecture,
( ~ ssRr(X2,X1)
| ~ ssPv3(skf1(X2))
| ~ ssPv8(X2)
| ~ ssPv4(X2)
| ~ ssPv4(X1) ),
inference(spm,[status(thm)],[c_0_69,c_0_24]),
[final] ).
cnf(c_0_87,negated_conjecture,
( ~ ssRr(X1,X2)
| ~ ssPv4(X1)
| ~ ssPv5(X1)
| ~ ssPv6(X2)
| ssPv6(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_70,c_0_24]),
[final] ).
cnf(c_0_88,negated_conjecture,
( ~ ssRr(X1,X2)
| ~ ssPv5(X2)
| ~ ssPv2(X1)
| ~ ssPv2(skf1(X1))
| ssPv7(X1) ),
inference(spm,[status(thm)],[c_0_71,c_0_24]),
[final] ).
cnf(c_0_89,negated_conjecture,
( ~ ssRr(X1,X2)
| ~ ssPv3(X1)
| ~ ssPv8(X1)
| ~ ssPv7(X2)
| ssPv7(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_72,c_0_24]),
[final] ).
cnf(c_0_90,negated_conjecture,
( ~ ssRr(X1,X2)
| ~ ssPv3(X2)
| ~ ssPv2(skf1(X1))
| ~ ssPv1(X1)
| ssPv8(X1) ),
inference(spm,[status(thm)],[c_0_73,c_0_24]),
[final] ).
cnf(c_0_91,negated_conjecture,
( ~ ssPv3(X1)
| ~ ssPv8(X1)
| ~ ssPv7(skf1(X1))
| ssPv8(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_74,c_0_24]),
[final] ).
cnf(c_0_92,negated_conjecture,
( ~ ssPv3(skf1(X1))
| ssPv8(X1)
| ssPv5(skf1(X1))
| ssPv6(X1) ),
inference(spm,[status(thm)],[c_0_75,c_0_24]),
[final] ).
cnf(c_0_93,negated_conjecture,
( ~ ssPv4(X1)
| ssPv3(skf1(X1))
| ssPv5(X1)
| ssPv5(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_76,c_0_24]),
[final] ).
cnf(c_0_94,negated_conjecture,
( ~ ssPv3(X1)
| ~ ssPv4(X1)
| ~ ssPv7(skf1(X1))
| ssPv6(X1) ),
inference(spm,[status(thm)],[c_0_77,c_0_24]),
[final] ).
cnf(c_0_95,negated_conjecture,
( ~ ssPv8(X1)
| ~ ssPv5(X1)
| ssPv2(X1)
| ssPv2(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_78,c_0_24]),
[final] ).
cnf(c_0_96,negated_conjecture,
( ~ ssPv3(skf1(X1))
| ~ ssPv8(X1)
| ssPv4(X1)
| ssPv5(X1) ),
inference(spm,[status(thm)],[c_0_79,c_0_24]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN738-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/10.59 % Computer : n002.cluster.edu
% 0.11/10.59 % Model : x86_64 x86_64
% 0.11/10.59 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/10.59 % Memory : 8046.5625MB
% 0.11/10.59 % OS : Linux 6.8.0-71-generic
% 0.11/10.59 % CPULimit : 300
% 0.11/10.59 % WCLimit : 300
% 0.11/10.59 % DateTime : Mon Sep 21 11:16:43 UTC 2026
% 0.11/10.59 % CPUTime :
% 0.11/10.59 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/10.63 Running first-order theorem proving
% 0.15/10.63 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.15/10.66 % Version: 3.5.1
% 0.15/10.66 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/10.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/10.66 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/10.66 % Starting new_bool_3 with 300s (1) cores
% 0.15/10.66 % Starting new_bool_1 with 300s (1) cores
% 0.15/10.66 % Starting sh5l with 300s (1) cores
% 0.15/10.66 % new_bool_3 with pid 3160337 completed with status 1
% 0.15/10.66 % Result found by new_bool_3
% 0.15/10.66 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/10.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/10.66 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/10.66 % Starting new_bool_3 with 300s (1) cores
% 0.15/10.66 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/10.66 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/10.66 % Search class: FGHNF-FFMF11-SFFFFFNN
% 0.15/10.66 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/10.66 % Starting SubtermCWHack with 31s (1) cores
% 0.15/10.66 % SubtermCWHack with pid 3160343 completed with status 1
% 0.15/10.66 % Result found by SubtermCWHack
% 0.15/10.66 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/10.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/10.66 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/10.66 % Starting new_bool_3 with 300s (1) cores
% 0.15/10.66 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/10.66 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/10.66 % Search class: FGHNF-FFMF11-SFFFFFNN
% 0.15/10.66 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/10.66 % Starting SubtermCWHack with 31s (1) cores
% 0.15/10.66 % Preprocessing time : 0.001 s
% 0.15/10.66
% 0.15/10.66 % No proof found!
% 0.15/10.66 % SZS status Satisfiable
% 0.15/10.66 % SZS output start Saturation
% See solution above
% 0.15/10.66 % Parsed axioms : 21
% 0.15/10.66 % Removed by relevancy pruning/SinE : 0
% 0.15/10.66 % Initial clauses : 21
% 0.15/10.66 % Removed in clause preprocessing : 0
% 0.15/10.66 % Initial clauses in saturation : 21
% 0.15/10.66 % Processed clauses : 56
% 0.15/10.66 % ...of these trivial : 0
% 0.15/10.66 % ...subsumed : 0
% 0.15/10.66 % ...remaining for further processing : 56
% 0.15/10.66 % Other redundant clauses eliminated : 0
% 0.15/10.66 % Clauses deleted for lack of memory : 0
% 0.15/10.66 % Backward-subsumed : 0
% 0.15/10.66 % Backward-rewritten : 0
% 0.15/10.66 % Generated clauses : 42
% 0.15/10.66 % ...of the previous two non-redundant : 35
% 0.15/10.66 % ...aggressively subsumed : 0
% 0.15/10.66 % Contextual simplify-reflections : 1
% 0.15/10.66 % Paramodulations : 42
% 0.15/10.66 % Factorizations : 0
% 0.15/10.66 % NegExts : 0
% 0.15/10.66 % Equation resolutions : 0
% 0.15/10.66 % Disequality decompositions : 0
% 0.15/10.66 % Total rewrite steps : 0
% 0.15/10.66 % ...of those cached : 0
% 0.15/10.66 % Propositional unsat checks : 0
% 0.15/10.66 % Propositional check models : 0
% 0.15/10.66 % Propositional check unsatisfiable : 0
% 0.15/10.66 % Propositional clauses : 0
% 0.15/10.66 % Propositional clauses after purity: 0
% 0.15/10.66 % Propositional unsat core size : 0
% 0.15/10.66 % Propositional preprocessing time : 0.000
% 0.15/10.66 % Propositional encoding time : 0.000
% 0.15/10.66 % Propositional solver time : 0.000
% 0.15/10.66 % Success case prop preproc time : 0.000
% 0.15/10.66 % Success case prop encoding time : 0.000
% 0.15/10.66 % Success case prop solver time : 0.000
% 0.15/10.66 % Current number of processed clauses : 56
% 0.15/10.66 % Positive orientable unit clauses : 1
% 0.15/10.66 % Positive unorientable unit clauses: 0
% 0.15/10.66 % Negative unit clauses : 0
% 0.15/10.66 % Non-unit-clauses : 55
% 0.15/10.66 % Current number of unprocessed clauses: 0
% 0.15/10.66 % ...number of literals in the above : 0
% 0.15/10.66 % Current number of archived formulas : 0
% 0.15/10.66 % Current number of archived clauses : 0
% 0.15/10.66 % Clause-clause subsumption calls (NU) : 131
% 0.15/10.66 % Rec. Clause-clause subsumption calls : 1
% 0.15/10.66 % Non-unit clause-clause subsumptions : 1
% 0.15/10.66 % Unit Clause-clause subsumption calls : 0
% 0.15/10.66 % Rewrite failures with RHS unbound : 0
% 0.15/10.66 % BW rewrite match attempts : 0
% 0.15/10.66 % BW rewrite match successes : 0
% 0.15/10.66 % Condensation attempts : 0
% 0.15/10.66 % Condensation successes : 0
% 0.15/10.66 % Termbank termtop insertions : 2904
% 0.15/10.66 % Search garbage collected termcells : 120
% 0.15/10.66
% 0.15/10.66 % -------------------------------------------------
% 0.15/10.66 % User time : 0.004 s
% 0.15/10.66 % System time : 0.002 s
% 0.15/10.66 % Total time : 0.006 s
% 0.15/10.66 % Maximum resident set size: 3652 pages
% 0.15/10.66
% 0.15/10.66 % -------------------------------------------------
% 0.15/10.66 % User time : 0.008 s
% 0.15/10.66 % System time : 0.005 s
% 0.15/10.66 % Total time : 0.012 s
% 0.15/10.66 % Maximum resident set size: 4864 pages
% 0.15/10.66 % E exiting
%------------------------------------------------------------------------------