%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SCT058-1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n015.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:08:15 PM UTC 2026
% Result : Unsatisfiable 0.23s 5.89s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 22 ( 8 unt; 2 nHn; 18 RR)
% Number of literals : 36 ( 4 equ; 16 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 9 con; 0-5 aty)
% Number of variables : 39 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_converse__iff_1,axiom,
( ~ hBOOL(c_in(c_Pair(X2,X1,X4,X3),X5,tc_prod(X4,X3)))
| hBOOL(c_in(c_Pair(X1,X2,X3,X4),hAPP(c_Relation_Oconverse(X4,X3),X5),tc_prod(X3,X4))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_converse__iff_1) ).
cnf(cls_iff_1,axiom,
( ~ hBOOL(c_in(c_Pair(v_b____,v_c____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P_H____,X1),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)))
| hBOOL(c_in(c_Pair(v_a____,v_b____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P____,X1),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_iff_1) ).
cnf(cls_iff_0,axiom,
( ~ hBOOL(c_in(c_Pair(v_a____,v_b____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P____,X1),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)))
| hBOOL(c_in(c_Pair(v_b____,v_c____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P_H____,X1),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_iff_0) ).
cnf(cls_conjecture_0,negated_conjecture,
( hBOOL(c_in(c_Pair(v_b____,v_a____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(c_Fun_Ocomp(c_Relation_Oconverse(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_P____,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool),tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool),tc_Arrow__Order__Mirabelle_Oindi),v_x),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)))
| hBOOL(c_in(c_Pair(v_b____,v_c____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P_H____,v_x),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_o__eq__dest__lhs_0,axiom,
hAPP(X1,hAPP(X2,X3)) = hAPP(c_Fun_Ocomp(X1,X2,X4,X5,X6),X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_o__eq__dest__lhs_0) ).
cnf(cls_converse__converse_0,axiom,
hAPP(c_Relation_Oconverse(X1,X2),hAPP(c_Relation_Oconverse(X2,X1),X3)) = X3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_converse__converse_0) ).
cnf(cls_conjecture_1,negated_conjecture,
( ~ hBOOL(c_in(c_Pair(v_b____,v_a____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(c_Fun_Ocomp(c_Relation_Oconverse(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_P____,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool),tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool),tc_Arrow__Order__Mirabelle_Oindi),v_x),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)))
| ~ hBOOL(c_in(c_Pair(v_b____,v_c____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P_H____,v_x),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(c_0_7,plain,
( ~ hBOOL(c_in(c_Pair(X2,X1,X4,X3),X5,tc_prod(X4,X3)))
| hBOOL(c_in(c_Pair(X1,X2,X3,X4),hAPP(c_Relation_Oconverse(X4,X3),X5),tc_prod(X3,X4))) ),
inference(fof_simplification,[status(thm)],[cls_converse__iff_1]) ).
cnf(c_0_8,plain,
( ~ hBOOL(c_in(c_Pair(v_b____,v_c____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P_H____,X1),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)))
| hBOOL(c_in(c_Pair(v_a____,v_b____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P____,X1),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))) ),
inference(fof_simplification,[status(thm)],[cls_iff_1]) ).
cnf(c_0_9,plain,
( ~ hBOOL(c_in(c_Pair(v_a____,v_b____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P____,X1),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)))
| hBOOL(c_in(c_Pair(v_b____,v_c____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P_H____,X1),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))) ),
inference(fof_simplification,[status(thm)],[cls_iff_0]) ).
cnf(c_0_10,plain,
( ~ hBOOL(c_in(c_Pair(X2,X1,X4,X3),X5,tc_prod(X4,X3)))
| hBOOL(c_in(c_Pair(X1,X2,X3,X4),hAPP(c_Relation_Oconverse(X4,X3),X5),tc_prod(X3,X4))) ),
c_0_7 ).
cnf(c_0_11,negated_conjecture,
( hBOOL(c_in(c_Pair(v_b____,v_a____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(c_Fun_Ocomp(c_Relation_Oconverse(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_P____,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool),tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool),tc_Arrow__Order__Mirabelle_Oindi),v_x),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)))
| hBOOL(c_in(c_Pair(v_b____,v_c____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P_H____,v_x),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))) ),
cls_conjecture_0 ).
cnf(c_0_12,axiom,
hAPP(X1,hAPP(X2,X3)) = hAPP(c_Fun_Ocomp(X1,X2,X4,X5,X6),X3),
cls_o__eq__dest__lhs_0 ).
cnf(c_0_13,axiom,
hAPP(c_Relation_Oconverse(X1,X2),hAPP(c_Relation_Oconverse(X2,X1),X3)) = X3,
cls_converse__converse_0 ).
cnf(c_0_14,plain,
( ~ hBOOL(c_in(c_Pair(v_b____,v_c____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P_H____,X1),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)))
| hBOOL(c_in(c_Pair(v_a____,v_b____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P____,X1),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))) ),
c_0_8 ).
cnf(c_0_15,negated_conjecture,
( ~ hBOOL(c_in(c_Pair(v_b____,v_a____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(c_Fun_Ocomp(c_Relation_Oconverse(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_P____,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool),tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool),tc_Arrow__Order__Mirabelle_Oindi),v_x),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)))
| ~ hBOOL(c_in(c_Pair(v_b____,v_c____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P_H____,v_x),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_1]) ).
cnf(c_0_16,plain,
( ~ hBOOL(c_in(c_Pair(v_a____,v_b____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P____,X1),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)))
| hBOOL(c_in(c_Pair(v_b____,v_c____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P_H____,X1),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))) ),
c_0_9 ).
cnf(c_0_17,negated_conjecture,
hBOOL(c_in(c_Pair(v_a____,v_b____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P____,v_x),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13]),c_0_14]) ).
cnf(c_0_18,negated_conjecture,
( ~ hBOOL(c_in(c_Pair(v_b____,v_a____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(c_Fun_Ocomp(c_Relation_Oconverse(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_P____,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool),tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool),tc_Arrow__Order__Mirabelle_Oindi),v_x),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)))
| ~ hBOOL(c_in(c_Pair(v_b____,v_c____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P_H____,v_x),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))) ),
c_0_15 ).
cnf(c_0_19,negated_conjecture,
hBOOL(c_in(c_Pair(v_b____,v_c____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P_H____,v_x),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
~ hBOOL(c_in(c_Pair(v_b____,v_a____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(c_Relation_Oconverse(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P____,v_x)),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_12]),c_0_19])]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_17]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SCT058-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/5.44 % Computer : n015.cluster.edu
% 0.16/5.44 % Model : x86_64 x86_64
% 0.16/5.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/5.44 % Memory : 8046.5625MB
% 0.16/5.44 % OS : Linux 6.8.0-71-generic
% 0.16/5.44 % CPULimit : 300
% 0.16/5.44 % WCLimit : 300
% 0.16/5.44 % DateTime : Mon Sep 21 04:32:11 UTC 2026
% 0.16/5.44 % CPUTime :
% 0.16/5.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/5.52 Running first-order theorem proving
% 0.23/5.52 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.23/5.88 % Version: 3.5.1
% 0.23/5.88 % Preprocessing class: FSLMSMSMSSSNFFN.
% 0.23/5.88 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/5.88 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.23/5.88 % Starting new_bool_3 with 600s (2) cores
% 0.23/5.88 % Starting new_bool_1 with 300s (1) cores
% 0.23/5.88 % Starting sh5l with 300s (1) cores
% 0.23/5.88 % G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with pid 558143 completed with status 0
% 0.23/5.88 % Result found by G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S
% 0.23/5.88 % Preprocessing class: FSLMSMSMSSSNFFN.
% 0.23/5.88 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/5.88 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.23/5.88 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/5.88 % No SInE strategy applied
% 0.23/5.88 % Search class: FGHSM-FSLM33-DFFFFFNN
% 0.23/5.88 % Scheduled 11 strats onto 4 cores with 1200 seconds (1200 total)
% 0.23/5.88 % Starting SubtermCWHack with 109s (1) cores
% 0.23/5.88 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 121s (1) cores
% 0.23/5.88 % Starting U----_206b_01_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 109s (1) cores
% 0.23/5.88 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 109s (1) cores
% 0.23/5.89 % G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with pid 558148 completed with status 0
% 0.23/5.89 % Result found by G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S
% 0.23/5.89 % Preprocessing class: FSLMSMSMSSSNFFN.
% 0.23/5.89 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/5.89 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.23/5.89 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/5.89 % No SInE strategy applied
% 0.23/5.89 % Search class: FGHSM-FSLM33-DFFFFFNN
% 0.23/5.89 % Scheduled 11 strats onto 4 cores with 1200 seconds (1200 total)
% 0.23/5.89 % Starting SubtermCWHack with 109s (1) cores
% 0.23/5.89 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 121s (1) cores
% 0.23/5.89 % Preprocessing time : 0.010 s
% 0.23/5.89 % Presaturation interreduction done
% 0.23/5.89
% 0.23/5.89 % Proof found!
% 0.23/5.89 % SZS status Unsatisfiable
% 0.23/5.89 % SZS output start CNFRefutation
% See solution above
% 0.23/5.89 % Parsed axioms : 641
% 0.23/5.89 % Removed by relevancy pruning/SinE : 0
% 0.23/5.89 % Initial clauses : 641
% 0.23/5.89 % Removed in clause preprocessing : 6
% 0.23/5.89 % Initial clauses in saturation : 635
% 0.23/5.89 % Processed clauses : 1202
% 0.23/5.89 % ...of these trivial : 28
% 0.23/5.89 % ...subsumed : 82
% 0.23/5.89 % ...remaining for further processing : 1091
% 0.23/5.89 % Other redundant clauses eliminated : 0
% 0.23/5.89 % Clauses deleted for lack of memory : 0
% 0.23/5.89 % Backward-subsumed : 0
% 0.23/5.89 % Backward-rewritten : 6
% 0.23/5.89 % Generated clauses : 9429
% 0.23/5.89 % ...of the previous two non-redundant : 7973
% 0.23/5.89 % ...aggressively subsumed : 0
% 0.23/5.89 % Contextual simplify-reflections : 3
% 0.23/5.89 % Paramodulations : 9417
% 0.23/5.89 % Factorizations : 2
% 0.23/5.89 % NegExts : 0
% 0.23/5.89 % Equation resolutions : 10
% 0.23/5.89 % Disequality decompositions : 0
% 0.23/5.89 % Total rewrite steps : 4081
% 0.23/5.89 % ...of those cached : 2983
% 0.23/5.89 % Propositional unsat checks : 0
% 0.23/5.89 % Propositional check models : 0
% 0.23/5.89 % Propositional check unsatisfiable : 0
% 0.23/5.89 % Propositional clauses : 0
% 0.23/5.89 % Propositional clauses after purity: 0
% 0.23/5.89 % Propositional unsat core size : 0
% 0.23/5.89 % Propositional preprocessing time : 0.000
% 0.23/5.89 % Propositional encoding time : 0.000
% 0.23/5.89 % Propositional solver time : 0.000
% 0.23/5.89 % Success case prop preproc time : 0.000
% 0.23/5.89 % Success case prop encoding time : 0.000
% 0.23/5.89 % Success case prop solver time : 0.000
% 0.23/5.89 % Current number of processed clauses : 552
% 0.23/5.89 % Positive orientable unit clauses : 131
% 0.23/5.89 % Positive unorientable unit clauses: 10
% 0.23/5.89 % Negative unit clauses : 15
% 0.23/5.89 % Non-unit-clauses : 396
% 0.23/5.89 % Current number of unprocessed clauses: 7939
% 0.23/5.89 % ...number of literals in the above : 17799
% 0.23/5.89 % Current number of archived formulas : 0
% 0.23/5.89 % Current number of archived clauses : 542
% 0.23/5.89 % Clause-clause subsumption calls (NU) : 47227
% 0.23/5.89 % Rec. Clause-clause subsumption calls : 32131
% 0.23/5.89 % Non-unit clause-clause subsumptions : 63
% 0.23/5.89 % Unit Clause-clause subsumption calls : 2399
% 0.23/5.89 % Rewrite failures with RHS unbound : 0
% 0.23/5.89 % BW rewrite match attempts : 342
% 0.23/5.89 % BW rewrite match successes : 79
% 0.23/5.89 % Condensation attempts : 0
% 0.23/5.89 % Condensation successes : 0
% 0.23/5.89 % Termbank termtop insertions : 207103
% 0.23/5.89 % Search garbage collected termcells : 1182
% 0.23/5.89
% 0.23/5.89 % -------------------------------------------------
% 0.23/5.89 % User time : 0.253 s
% 0.23/5.89 % System time : 0.026 s
% 0.23/5.89 % Total time : 0.279 s
% 0.23/5.89 % Maximum resident set size: 4896 pages
% 0.23/5.89
% 0.23/5.89 % -------------------------------------------------
% 0.23/5.89 % User time : 0.735 s
% 0.23/5.89 % System time : 0.070 s
% 0.23/5.89 % Total time : 0.805 s
% 0.23/5.89 % Maximum resident set size: 5120 pages
% 0.23/5.89 % E exiting
%------------------------------------------------------------------------------