%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : REL026-4 : 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 : n012.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:04:00 PM UTC 2026
% Result : Unsatisfiable 4.44s 16.05s
% Output : CNFRefutation 4.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 14
% Syntax : Number of clauses : 71 ( 66 unt; 0 nHn; 11 RR)
% Number of literals : 76 ( 75 equ; 10 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 6 ( 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 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(converse_multiplicativity_10,axiom,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',converse_multiplicativity_10) ).
cnf(converse_idempotence_8,axiom,
converse(converse(X1)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',converse_idempotence_8) ).
cnf(composition_identity_6,axiom,
composition(X1,one) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',composition_identity_6) ).
cnf(converse_cancellativity_11,axiom,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',converse_cancellativity_11) ).
cnf(maddux1_join_commutativity_1,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',maddux1_join_commutativity_1) ).
cnf(def_zero_13,axiom,
zero = meet(X1,complement(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',def_zero_13) ).
cnf(maddux4_definiton_of_meet_4,axiom,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',maddux4_definiton_of_meet_4) ).
cnf(def_top_12,axiom,
top = join(X1,complement(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',def_top_12) ).
cnf(maddux3_a_kind_of_de_Morgan_3,axiom,
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_3) ).
cnf(maddux2_join_associativity_2,axiom,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',maddux2_join_associativity_2) ).
cnf(converse_additivity_9,axiom,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',converse_additivity_9) ).
cnf(composition_distributivity_7,axiom,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',composition_distributivity_7) ).
cnf(goals_17,negated_conjecture,
join(sk1,one) = one,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals_17) ).
cnf(goals_18,negated_conjecture,
( join(meet(composition(sk1,top),sk2),composition(sk1,sk2)) != composition(sk1,sk2)
| join(composition(sk1,sk2),meet(composition(sk1,top),sk2)) != meet(composition(sk1,top),sk2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals_18) ).
cnf(c_0_14,axiom,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
converse_multiplicativity_10 ).
cnf(c_0_15,axiom,
converse(converse(X1)) = X1,
converse_idempotence_8 ).
cnf(c_0_16,plain,
converse(composition(converse(X1),X2)) = composition(converse(X2),X1),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,axiom,
composition(X1,one) = X1,
composition_identity_6 ).
cnf(c_0_18,plain,
composition(converse(one),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_15]) ).
cnf(c_0_19,axiom,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
converse_cancellativity_11 ).
cnf(c_0_20,axiom,
join(X1,X2) = join(X2,X1),
maddux1_join_commutativity_1 ).
cnf(c_0_21,plain,
converse(one) = one,
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,axiom,
zero = meet(X1,complement(X1)),
def_zero_13 ).
cnf(c_0_23,axiom,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
maddux4_definiton_of_meet_4 ).
cnf(c_0_24,plain,
join(complement(X1),composition(converse(X2),complement(composition(X2,X1)))) = complement(X1),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[c_0_18,c_0_21]) ).
cnf(c_0_26,plain,
zero = complement(join(complement(X1),complement(complement(X1)))),
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,axiom,
top = join(X1,complement(X1)),
def_top_12 ).
cnf(c_0_28,plain,
join(complement(X1),complement(X1)) = complement(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_21]),c_0_25]) ).
cnf(c_0_29,plain,
complement(top) = zero,
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,axiom,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
maddux3_a_kind_of_de_Morgan_3 ).
cnf(c_0_31,axiom,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
maddux2_join_associativity_2 ).
cnf(c_0_32,plain,
join(zero,zero) = zero,
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = X1,
inference(rw,[status(thm)],[c_0_30,c_0_20]) ).
cnf(c_0_34,plain,
join(zero,join(zero,X1)) = join(zero,X1),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,plain,
join(zero,complement(complement(X1))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_27]),c_0_28]),c_0_29]),c_0_20]) ).
cnf(c_0_36,plain,
join(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_37,plain,
complement(complement(X1)) = X1,
inference(rw,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_38,plain,
join(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_28,c_0_37]) ).
cnf(c_0_39,axiom,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
converse_additivity_9 ).
cnf(c_0_40,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_31,c_0_38]) ).
cnf(c_0_41,plain,
converse(composition(X1,converse(X2))) = composition(X2,converse(X1)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_42,plain,
converse(join(converse(X1),X2)) = join(X1,converse(X2)),
inference(spm,[status(thm)],[c_0_39,c_0_15]) ).
cnf(c_0_43,plain,
join(X1,complement(join(complement(X1),X2))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_33]),c_0_20]) ).
cnf(c_0_44,plain,
join(X1,join(X2,X1)) = join(X2,X1),
inference(spm,[status(thm)],[c_0_40,c_0_20]) ).
cnf(c_0_45,axiom,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
composition_distributivity_7 ).
cnf(c_0_46,plain,
join(composition(X1,converse(X2)),converse(X3)) = converse(join(composition(X2,converse(X1)),X3)),
inference(spm,[status(thm)],[c_0_39,c_0_41]) ).
cnf(c_0_47,plain,
composition(join(X1,converse(X2)),converse(X3)) = converse(composition(X3,join(converse(X1),X2))),
inference(spm,[status(thm)],[c_0_14,c_0_42]) ).
cnf(c_0_48,plain,
join(X1,complement(join(X2,complement(X1)))) = X1,
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_49,plain,
join(X1,composition(X2,X1)) = composition(join(X2,one),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_25]),c_0_20]) ).
cnf(c_0_50,negated_conjecture,
join(sk1,one) = one,
goals_17 ).
cnf(c_0_51,plain,
converse(join(composition(X1,converse(X2)),composition(X1,X3))) = converse(composition(X1,join(converse(X2),X3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_14]),c_0_46]),c_0_47]) ).
cnf(c_0_52,plain,
join(X1,join(X2,X3)) = join(X2,join(X3,X1)),
inference(spm,[status(thm)],[c_0_31,c_0_20]) ).
cnf(c_0_53,plain,
join(complement(X1),complement(join(X2,X1))) = complement(X1),
inference(spm,[status(thm)],[c_0_48,c_0_37]) ).
cnf(c_0_54,negated_conjecture,
join(X1,composition(sk1,X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_25]) ).
cnf(c_0_55,plain,
join(composition(X1,converse(X2)),composition(X1,X3)) = composition(X1,join(converse(X2),X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_51]),c_0_15]) ).
cnf(c_0_56,plain,
join(complement(X1),complement(join(complement(X1),complement(X2)))) = join(complement(X1),X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_33]),c_0_37]),c_0_52]),c_0_53]) ).
cnf(c_0_57,negated_conjecture,
join(X1,join(composition(sk1,X1),X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_31,c_0_54]) ).
cnf(c_0_58,plain,
join(composition(X1,X2),composition(X1,X3)) = composition(X1,join(X2,X3)),
inference(spm,[status(thm)],[c_0_55,c_0_15]) ).
cnf(c_0_59,negated_conjecture,
( join(meet(composition(sk1,top),sk2),composition(sk1,sk2)) != composition(sk1,sk2)
| join(composition(sk1,sk2),meet(composition(sk1,top),sk2)) != meet(composition(sk1,top),sk2) ),
inference(fof_simplification,[status(thm)],[goals_18]) ).
cnf(c_0_60,plain,
join(X1,complement(join(X1,complement(X2)))) = join(X1,X2),
inference(spm,[status(thm)],[c_0_56,c_0_37]) ).
cnf(c_0_61,negated_conjecture,
join(X1,composition(sk1,join(X1,X2))) = join(X1,composition(sk1,X2)),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_62,negated_conjecture,
( join(meet(composition(sk1,top),sk2),composition(sk1,sk2)) != composition(sk1,sk2)
| join(composition(sk1,sk2),meet(composition(sk1,top),sk2)) != meet(composition(sk1,top),sk2) ),
c_0_59 ).
cnf(c_0_63,plain,
join(X1,complement(join(X1,X2))) = join(X1,complement(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_60]),c_0_40]) ).
cnf(c_0_64,negated_conjecture,
join(X1,composition(sk1,complement(X1))) = join(X1,composition(sk1,top)),
inference(spm,[status(thm)],[c_0_61,c_0_27]) ).
cnf(c_0_65,negated_conjecture,
( join(composition(sk1,sk2),complement(join(complement(composition(sk1,top)),complement(sk2)))) != complement(join(complement(composition(sk1,top)),complement(sk2)))
| join(complement(join(complement(composition(sk1,top)),complement(sk2))),composition(sk1,sk2)) != composition(sk1,sk2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_62,c_0_23]),c_0_23]),c_0_23]) ).
cnf(c_0_66,negated_conjecture,
join(complement(X1),complement(composition(sk1,X1))) = complement(composition(sk1,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_20]) ).
cnf(c_0_67,negated_conjecture,
join(X1,complement(composition(sk1,complement(X1)))) = join(X1,complement(composition(sk1,top))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_63]) ).
cnf(c_0_68,negated_conjecture,
( join(composition(sk1,sk2),complement(join(complement(sk2),complement(composition(sk1,top))))) != composition(sk1,sk2)
| join(composition(sk1,sk2),complement(join(complement(sk2),complement(composition(sk1,top))))) != complement(join(complement(sk2),complement(composition(sk1,top)))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_20]),c_0_20]),c_0_20]),c_0_20]) ).
cnf(c_0_69,negated_conjecture,
join(X1,complement(composition(sk1,top))) = complement(composition(sk1,complement(X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_37]),c_0_67]) ).
cnf(c_0_70,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_68,c_0_69]),c_0_37]),c_0_37]),c_0_38]),c_0_69]),c_0_37]),c_0_37]),c_0_69]),c_0_37]),c_0_37]),c_0_38])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : REL026-4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/15.36 % Computer : n012.cluster.edu
% 0.09/15.36 % Model : x86_64 x86_64
% 0.09/15.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/15.36 % Memory : 8046.5625MB
% 0.09/15.36 % OS : Linux 6.8.0-71-generic
% 0.09/15.36 % CPULimit : 300
% 0.09/15.36 % WCLimit : 300
% 0.09/15.36 % DateTime : Mon Sep 21 04:02:38 UTC 2026
% 0.09/15.36 % CPUTime :
% 0.09/15.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/15.39 Running first-order theorem proving
% 0.09/15.39 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
% 4.44/16.05 % Version: 3.5.1
% 4.44/16.05 % Preprocessing class: FSMSSMSSSSSNFFN.
% 4.44/16.05 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.44/16.05 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.44/16.05 % Starting new_bool_3 with 300s (1) cores
% 4.44/16.05 % Starting new_bool_1 with 300s (1) cores
% 4.44/16.05 % Starting sh5l with 300s (1) cores
% 4.44/16.05 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1524388 completed with status 0
% 4.44/16.05 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 4.44/16.05 % Preprocessing class: FSMSSMSSSSSNFFN.
% 4.44/16.05 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.44/16.05 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.44/16.05 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.44/16.05 % No SInE strategy applied
% 4.44/16.05 % Search class: FUHPM-FFMF21-DFFFFFNN
% 4.44/16.05 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 4.44/16.05 % Starting SubtermCWHack with 136s (1) cores
% 4.44/16.05 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 4.44/16.05 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 4.44/16.05 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S2S with 136s (1) cores
% 4.44/16.05 % Starting new_bool_3 with 136s (1) cores
% 4.44/16.05 % H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S2S with pid 1524398 completed with status 0
% 4.44/16.05 % Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S2S
% 4.44/16.05 % Preprocessing class: FSMSSMSSSSSNFFN.
% 4.44/16.05 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.44/16.05 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.44/16.05 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.44/16.05 % No SInE strategy applied
% 4.44/16.05 % Search class: FUHPM-FFMF21-DFFFFFNN
% 4.44/16.05 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 4.44/16.05 % Starting SubtermCWHack with 136s (1) cores
% 4.44/16.05 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 4.44/16.05 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 4.44/16.05 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S2S with 136s (1) cores
% 4.44/16.05 % Preprocessing time : 0.001 s
% 4.44/16.05 % Presaturation interreduction done
% 4.44/16.05
% 4.44/16.05 % Proof found!
% 4.44/16.05 % SZS status Unsatisfiable
% 4.44/16.05 % SZS output start CNFRefutation
% See solution above
% 4.44/16.05 % Parsed axioms : 18
% 4.44/16.05 % Removed by relevancy pruning/SinE : 0
% 4.44/16.05 % Initial clauses : 18
% 4.44/16.05 % Removed in clause preprocessing : 1
% 4.44/16.05 % Initial clauses in saturation : 17
% 4.44/16.05 % Processed clauses : 3119
% 4.44/16.05 % ...of these trivial : 1901
% 4.44/16.05 % ...subsumed : 521
% 4.44/16.05 % ...remaining for further processing : 697
% 4.44/16.05 % Other redundant clauses eliminated : 0
% 4.44/16.05 % Clauses deleted for lack of memory : 0
% 4.44/16.05 % Backward-subsumed : 1
% 4.44/16.05 % Backward-rewritten : 153
% 4.44/16.05 % Generated clauses : 89051
% 4.44/16.05 % ...of the previous two non-redundant : 45737
% 4.44/16.05 % ...aggressively subsumed : 0
% 4.44/16.05 % Contextual simplify-reflections : 0
% 4.44/16.05 % Paramodulations : 89051
% 4.44/16.05 % Factorizations : 0
% 4.44/16.05 % NegExts : 0
% 4.44/16.05 % Equation resolutions : 0
% 4.44/16.05 % Disequality decompositions : 0
% 4.44/16.05 % Total rewrite steps : 223098
% 4.44/16.05 % ...of those cached : 195136
% 4.44/16.05 % Propositional unsat checks : 0
% 4.44/16.05 % Propositional check models : 0
% 4.44/16.05 % Propositional check unsatisfiable : 0
% 4.44/16.05 % Propositional clauses : 0
% 4.44/16.05 % Propositional clauses after purity: 0
% 4.44/16.05 % Propositional unsat core size : 0
% 4.44/16.05 % Propositional preprocessing time : 0.000
% 4.44/16.05 % Propositional encoding time : 0.000
% 4.44/16.05 % Propositional solver time : 0.000
% 4.44/16.05 % Success case prop preproc time : 0.000
% 4.44/16.05 % Success case prop encoding time : 0.000
% 4.44/16.05 % Success case prop solver time : 0.000
% 4.44/16.05 % Current number of processed clauses : 526
% 4.44/16.05 % Positive orientable unit clauses : 517
% 4.44/16.05 % Positive unorientable unit clauses: 9
% 4.44/16.05 % Negative unit clauses : 0
% 4.44/16.05 % Non-unit-clauses : 0
% 4.44/16.05 % Current number of unprocessed clauses: 42183
% 4.44/16.05 % ...number of literals in the above : 42183
% 4.44/16.05 % Current number of archived formulas : 0
% 4.44/16.05 % Current number of archived clauses : 172
% 4.44/16.05 % Clause-clause subsumption calls (NU) : 0
% 4.44/16.05 % Rec. Clause-clause subsumption calls : 0
% 4.44/16.05 % Non-unit clause-clause subsumptions : 0
% 4.44/16.05 % Unit Clause-clause subsumption calls : 113
% 4.44/16.05 % Rewrite failures with RHS unbound : 0
% 4.44/16.05 % BW rewrite match attempts : 4451
% 4.44/16.05 % BW rewrite match successes : 401
% 4.44/16.05 % Condensation attempts : 0
% 4.44/16.05 % Condensation successes : 0
% 4.44/16.05 % Termbank termtop insertions : 1517193
% 4.44/16.05 % Search garbage collected termcells : 5
% 4.44/16.05
% 4.44/16.05 % -------------------------------------------------
% 4.44/16.05 % User time : 0.584 s
% 4.44/16.05 % System time : 0.041 s
% 4.44/16.05 % Total time : 0.625 s
% 4.44/16.05 % Maximum resident set size: 3648 pages
% 4.44/16.05
% 4.44/16.05 % -------------------------------------------------
% 4.44/16.05 % User time : 2.985 s
% 4.44/16.05 % System time : 0.174 s
% 4.44/16.05 % Total time : 3.159 s
% 4.44/16.05 % Maximum resident set size: 4864 pages
% 4.44/16.05 % E exiting
%------------------------------------------------------------------------------