%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : REL006+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n006.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:03:49 PM UTC 2026
% Result : Theorem 0.21s 5.60s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 12
% Syntax : Number of formulae : 80 ( 77 unt; 0 def)
% Number of atoms : 83 ( 82 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 6 ( 3 ~; 0 |; 1 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 108 ( 9 sgn 42 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(converse_multiplicativity,axiom,
! [X1,X2] : converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',converse_multiplicativity) ).
fof(converse_idempotence,axiom,
! [X1] : converse(converse(X1)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',converse_idempotence) ).
fof(composition_identity,axiom,
! [X1] : composition(X1,one) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',composition_identity) ).
fof(converse_cancellativity,axiom,
! [X1,X2] : join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',converse_cancellativity) ).
fof(maddux1_join_commutativity,axiom,
! [X1,X2] : join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',maddux1_join_commutativity) ).
fof(maddux4_definiton_of_meet,axiom,
! [X1,X2] : meet(X1,X2) = complement(join(complement(X1),complement(X2))),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',maddux4_definiton_of_meet) ).
fof(def_top,axiom,
! [X1] : top = join(X1,complement(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',def_top) ).
fof(def_zero,axiom,
! [X1] : zero = meet(X1,complement(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',def_zero) ).
fof(maddux3_a_kind_of_de_Morgan,axiom,
! [X1,X2] : X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',maddux3_a_kind_of_de_Morgan) ).
fof(maddux2_join_associativity,axiom,
! [X1,X2,X3] : join(X1,join(X2,X3)) = join(join(X1,X2),X3),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',maddux2_join_associativity) ).
fof(goals,conjecture,
! [X1,X2] :
( meet(converse(X1),X2) = zero
=> meet(X1,converse(X2)) = zero ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(converse_additivity,axiom,
! [X1,X2] : converse(join(X1,X2)) = join(converse(X1),converse(X2)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',converse_additivity) ).
fof(c_0_12,plain,
! [X12,X13] : converse(composition(X12,X13)) = composition(converse(X13),converse(X12)),
inference(variable_rename,[status(thm)],[converse_multiplicativity]) ).
fof(c_0_13,plain,
! [X9] : converse(converse(X9)) = X9,
inference(variable_rename,[status(thm)],[converse_idempotence]) ).
cnf(c_0_14,plain,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,plain,
converse(converse(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_16,plain,
! [X30] : composition(X30,one) = X30,
inference(variable_rename,[status(thm)],[composition_identity]) ).
cnf(c_0_17,plain,
converse(composition(converse(X1),X2)) = composition(converse(X2),X1),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
composition(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_19,plain,
! [X14,X15] : join(composition(converse(X14),complement(composition(X14,X15))),complement(X15)) = complement(X15),
inference(variable_rename,[status(thm)],[converse_cancellativity]) ).
fof(c_0_20,plain,
! [X19,X20] : join(X19,X20) = join(X20,X19),
inference(variable_rename,[status(thm)],[maddux1_join_commutativity]) ).
cnf(c_0_21,plain,
composition(converse(one),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_15]) ).
cnf(c_0_22,plain,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_23,plain,
join(X1,X2) = join(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_24,plain,
converse(one) = one,
inference(spm,[status(thm)],[c_0_18,c_0_21]) ).
fof(c_0_25,plain,
! [X7,X8] : meet(X7,X8) = complement(join(complement(X7),complement(X8))),
inference(variable_rename,[status(thm)],[maddux4_definiton_of_meet]) ).
fof(c_0_26,plain,
! [X18] : top = join(X18,complement(X18)),
inference(variable_rename,[status(thm)],[def_top]) ).
fof(c_0_27,plain,
! [X6] : zero = meet(X6,complement(X6)),
inference(variable_rename,[status(thm)],[def_zero]) ).
cnf(c_0_28,plain,
join(complement(X1),composition(converse(X2),complement(composition(X2,X1)))) = complement(X1),
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[c_0_21,c_0_24]) ).
cnf(c_0_30,plain,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_31,plain,
top = join(X1,complement(X1)),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_32,plain,
zero = meet(X1,complement(X1)),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
fof(c_0_33,plain,
! [X16,X17] : X16 = join(complement(join(complement(X16),complement(X17))),complement(join(complement(X16),X17))),
inference(variable_rename,[status(thm)],[maddux3_a_kind_of_de_Morgan]) ).
fof(c_0_34,plain,
! [X21,X22,X23] : join(X21,join(X22,X23)) = join(join(X21,X22),X23),
inference(variable_rename,[status(thm)],[maddux2_join_associativity]) ).
cnf(c_0_35,plain,
join(complement(X1),complement(X1)) = complement(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_24]),c_0_29]) ).
cnf(c_0_36,plain,
complement(top) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
cnf(c_0_37,plain,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
fof(c_0_38,negated_conjecture,
~ ! [X1,X2] :
( meet(converse(X1),X2) = zero
=> meet(X1,converse(X2)) = zero ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_39,plain,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_40,plain,
join(zero,zero) = zero,
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,plain,
join(complement(join(complement(X1),X2)),meet(X1,X2)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_30]),c_0_23]) ).
fof(c_0_42,negated_conjecture,
( meet(esk1_0,converse(esk2_0)) != zero
& meet(converse(esk1_0),esk2_0) = zero ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_38])])])]) ).
cnf(c_0_43,plain,
join(zero,join(zero,X1)) = join(zero,X1),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_44,plain,
join(zero,complement(complement(X1))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_32]),c_0_35]),c_0_23]) ).
fof(c_0_45,plain,
! [X10,X11] : converse(join(X10,X11)) = join(converse(X10),converse(X11)),
inference(variable_rename,[status(thm)],[converse_additivity]) ).
cnf(c_0_46,plain,
join(X1,join(X2,complement(join(X1,X2)))) = top,
inference(spm,[status(thm)],[c_0_31,c_0_39]) ).
cnf(c_0_47,negated_conjecture,
meet(converse(esk1_0),esk2_0) = zero,
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_48,plain,
meet(X1,X2) = meet(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_23]),c_0_30]) ).
cnf(c_0_49,plain,
join(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_50,plain,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_51,plain,
join(top,complement(X1)) = top,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_35]),c_0_31]),c_0_23]) ).
cnf(c_0_52,negated_conjecture,
meet(esk2_0,converse(esk1_0)) = zero,
inference(rw,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_53,plain,
join(X1,zero) = X1,
inference(spm,[status(thm)],[c_0_23,c_0_49]) ).
cnf(c_0_54,plain,
complement(complement(X1)) = X1,
inference(rw,[status(thm)],[c_0_44,c_0_49]) ).
cnf(c_0_55,plain,
join(converse(X1),join(converse(X2),X3)) = join(converse(join(X1,X2)),X3),
inference(spm,[status(thm)],[c_0_39,c_0_50]) ).
cnf(c_0_56,plain,
join(X1,top) = top,
inference(spm,[status(thm)],[c_0_46,c_0_51]) ).
cnf(c_0_57,negated_conjecture,
complement(join(complement(esk2_0),converse(esk1_0))) = esk2_0,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_52]),c_0_53]) ).
cnf(c_0_58,plain,
converse(join(converse(X1),X2)) = join(X1,converse(X2)),
inference(spm,[status(thm)],[c_0_50,c_0_15]) ).
cnf(c_0_59,plain,
join(X1,join(X2,X3)) = join(X3,join(X1,X2)),
inference(spm,[status(thm)],[c_0_23,c_0_39]) ).
cnf(c_0_60,plain,
join(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_35,c_0_54]) ).
cnf(c_0_61,plain,
join(complement(converse(X1)),converse(join(X2,X1))) = top,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_31]),c_0_56]),c_0_23]) ).
cnf(c_0_62,negated_conjecture,
join(complement(esk2_0),converse(esk1_0)) = complement(esk2_0),
inference(spm,[status(thm)],[c_0_54,c_0_57]) ).
cnf(c_0_63,plain,
join(X1,converse(complement(converse(X1)))) = converse(top),
inference(spm,[status(thm)],[c_0_58,c_0_31]) ).
cnf(c_0_64,plain,
join(top,X1) = top,
inference(spm,[status(thm)],[c_0_23,c_0_56]) ).
cnf(c_0_65,plain,
join(X1,join(X2,X1)) = join(X2,X1),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_66,plain,
converse(join(X1,converse(X2))) = join(converse(X1),X2),
inference(spm,[status(thm)],[c_0_50,c_0_15]) ).
cnf(c_0_67,negated_conjecture,
join(complement(esk1_0),converse(complement(esk2_0))) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_15]) ).
cnf(c_0_68,plain,
converse(top) = top,
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_69,plain,
join(X1,join(complement(X1),X2)) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_31]),c_0_56]) ).
cnf(c_0_70,plain,
join(X1,meet(X1,X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_41]),c_0_23]) ).
cnf(c_0_71,negated_conjecture,
join(complement(esk2_0),converse(complement(esk1_0))) = top,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_68]),c_0_23]) ).
cnf(c_0_72,plain,
join(X1,join(X2,complement(X1))) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_54]),c_0_59]) ).
cnf(c_0_73,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_70,c_0_48]) ).
cnf(c_0_74,negated_conjecture,
meet(esk2_0,converse(complement(esk1_0))) = esk2_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_71]),c_0_36]),c_0_49]) ).
cnf(c_0_75,plain,
join(complement(converse(X1)),converse(join(X1,X2))) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_55]),c_0_23]) ).
cnf(c_0_76,negated_conjecture,
join(esk2_0,converse(complement(esk1_0))) = converse(complement(esk1_0)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_23]) ).
cnf(c_0_77,negated_conjecture,
join(complement(esk1_0),complement(converse(esk2_0))) = top,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_15]),c_0_23]) ).
cnf(c_0_78,negated_conjecture,
meet(esk1_0,converse(esk2_0)) != zero,
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_79,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_77]),c_0_36]),c_0_78]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : REL006+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/5.43 % Computer : n006.cluster.edu
% 0.16/5.43 % Model : x86_64 x86_64
% 0.16/5.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/5.43 % Memory : 8046.5625MB
% 0.16/5.43 % OS : Linux 6.8.0-71-generic
% 0.16/5.43 % CPULimit : 300
% 0.16/5.43 % WCLimit : 300
% 0.16/5.43 % DateTime : Mon Sep 21 03:57:47 UTC 2026
% 0.16/5.44 % CPUTime :
% 0.16/5.44 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.21/5.50 Running first-order theorem proving
% 0.21/5.50 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.21/5.60 % Version: 3.5.1
% 0.21/5.60 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/5.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/5.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/5.60 % Starting new_bool_3 with 300s (1) cores
% 0.21/5.60 % Starting new_bool_1 with 300s (1) cores
% 0.21/5.60 % Starting sh5l with 300s (1) cores
% 0.21/5.60 % sh5l with pid 1964427 completed with status 0
% 0.21/5.60 % Result found by sh5l
% 0.21/5.60 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/5.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/5.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/5.60 % Starting new_bool_3 with 300s (1) cores
% 0.21/5.60 % Starting new_bool_1 with 300s (1) cores
% 0.21/5.60 % Starting sh5l with 300s (1) cores
% 0.21/5.60 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.21/5.60 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/5.60 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.21/5.60 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.21/5.60 % Starting SubtermCWHack with 28s (1) cores
% 0.21/5.60 % SubtermCWHack with pid 1964435 completed with status 0
% 0.21/5.60 % Result found by SubtermCWHack
% 0.21/5.60 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/5.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/5.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/5.60 % Starting new_bool_3 with 300s (1) cores
% 0.21/5.60 % Starting new_bool_1 with 300s (1) cores
% 0.21/5.60 % Starting sh5l with 300s (1) cores
% 0.21/5.60 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.21/5.60 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/5.60 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.21/5.60 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.21/5.60 % Starting SubtermCWHack with 28s (1) cores
% 0.21/5.60 % Preprocessing time : 0.002 s
% 0.21/5.60
% 0.21/5.60 % Proof found!
% 0.21/5.60 % SZS status Theorem
% 0.21/5.60 % SZS output start CNFRefutation
% See solution above
% 0.21/5.60 % Parsed axioms : 14
% 0.21/5.60 % Removed by relevancy pruning/SinE : 0
% 0.21/5.60 % Initial clauses : 15
% 0.21/5.60 % Removed in clause preprocessing : 0
% 0.21/5.60 % Initial clauses in saturation : 15
% 0.21/5.60 % Processed clauses : 336
% 0.21/5.60 % ...of these trivial : 166
% 0.21/5.60 % ...subsumed : 26
% 0.21/5.60 % ...remaining for further processing : 144
% 0.21/5.60 % Other redundant clauses eliminated : 0
% 0.21/5.60 % Clauses deleted for lack of memory : 0
% 0.21/5.60 % Backward-subsumed : 0
% 0.21/5.60 % Backward-rewritten : 28
% 0.21/5.60 % Generated clauses : 3733
% 0.21/5.60 % ...of the previous two non-redundant : 1793
% 0.21/5.60 % ...aggressively subsumed : 0
% 0.21/5.60 % Contextual simplify-reflections : 0
% 0.21/5.60 % Paramodulations : 3733
% 0.21/5.60 % Factorizations : 0
% 0.21/5.60 % NegExts : 0
% 0.21/5.60 % Equation resolutions : 0
% 0.21/5.60 % Disequality decompositions : 0
% 0.21/5.60 % Total rewrite steps : 5423
% 0.21/5.60 % ...of those cached : 4114
% 0.21/5.60 % Propositional unsat checks : 0
% 0.21/5.60 % Propositional check models : 0
% 0.21/5.60 % Propositional check unsatisfiable : 0
% 0.21/5.60 % Propositional clauses : 0
% 0.21/5.60 % Propositional clauses after purity: 0
% 0.21/5.60 % Propositional unsat core size : 0
% 0.21/5.60 % Propositional preprocessing time : 0.000
% 0.21/5.60 % Propositional encoding time : 0.000
% 0.21/5.60 % Propositional solver time : 0.000
% 0.21/5.60 % Success case prop preproc time : 0.000
% 0.21/5.60 % Success case prop encoding time : 0.000
% 0.21/5.60 % Success case prop solver time : 0.000
% 0.21/5.60 % Current number of processed clauses : 116
% 0.21/5.60 % Positive orientable unit clauses : 111
% 0.21/5.60 % Positive unorientable unit clauses: 4
% 0.21/5.60 % Negative unit clauses : 1
% 0.21/5.60 % Non-unit-clauses : 0
% 0.21/5.60 % Current number of unprocessed clauses: 1443
% 0.21/5.60 % ...number of literals in the above : 1443
% 0.21/5.60 % Current number of archived formulas : 0
% 0.21/5.60 % Current number of archived clauses : 28
% 0.21/5.60 % Clause-clause subsumption calls (NU) : 0
% 0.21/5.60 % Rec. Clause-clause subsumption calls : 0
% 0.21/5.60 % Non-unit clause-clause subsumptions : 0
% 0.21/5.60 % Unit Clause-clause subsumption calls : 4
% 0.21/5.60 % Rewrite failures with RHS unbound : 0
% 0.21/5.60 % BW rewrite match attempts : 163
% 0.21/5.60 % BW rewrite match successes : 63
% 0.21/5.60 % Condensation attempts : 0
% 0.21/5.60 % Condensation successes : 0
% 0.21/5.60 % Termbank termtop insertions : 32453
% 0.21/5.60 % Search garbage collected termcells : 28
% 0.21/5.60
% 0.21/5.60 % -------------------------------------------------
% 0.21/5.60 % User time : 0.057 s
% 0.21/5.60 % System time : 0.004 s
% 0.21/5.60 % Total time : 0.061 s
% 0.21/5.60 % Maximum resident set size: 3648 pages
% 0.21/5.60
% 0.21/5.60 % -------------------------------------------------
% 0.21/5.60 % User time : 0.059 s
% 0.21/5.60 % System time : 0.011 s
% 0.21/5.60 % Total time : 0.070 s
% 0.21/5.60 % Maximum resident set size: 4608 pages
% 0.21/5.60 % E exiting
%------------------------------------------------------------------------------