%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : LAT021-1 : TPTP v9.3.1. Released v2.2.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 01:05:22 PM UTC 2026
% Result : Unsatisfiable 1.06s 0.58s
% Output : CNFRefutation 1.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 10
% Syntax : Number of clauses : 70 ( 70 unt; 0 nHn; 4 RR)
% Number of literals : 70 ( 69 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 172 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(quasi_lattice1,axiom,
join(meet(X1,join(X2,X3)),meet(X1,X2)) = meet(X1,join(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/LAT004-0.ax',quasi_lattice1) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/LAT004-0.ax',commutativity_of_join) ).
cnf(associativity_of_join,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/LAT004-0.ax',associativity_of_join) ).
cnf(idempotence_of_meet,axiom,
meet(X1,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/LAT004-0.ax',idempotence_of_meet) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/LAT004-0.ax',commutativity_of_meet) ).
cnf(quasi_lattice2,axiom,
meet(join(X1,meet(X2,X3)),join(X1,X2)) = join(X1,meet(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/LAT004-0.ax',quasi_lattice2) ).
cnf(associativity_of_meet,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/LAT004-0.ax',associativity_of_meet) ).
cnf(idempotence_of_join,axiom,
join(X1,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/LAT004-0.ax',idempotence_of_join) ).
cnf(bowden,hypothesis,
join(join(X1,meet(X2,X3)),meet(join(X1,X2),X3)) = join(X1,meet(X2,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',bowden) ).
cnf(prove_distributivity,negated_conjecture,
meet(a,join(b,c)) != join(meet(a,b),meet(a,c)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_distributivity) ).
cnf(c_0_10,axiom,
join(meet(X1,join(X2,X3)),meet(X1,X2)) = meet(X1,join(X2,X3)),
quasi_lattice1 ).
cnf(c_0_11,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_12,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_13,plain,
join(meet(X1,X2),meet(X1,join(X2,X3))) = meet(X1,join(X2,X3)),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,axiom,
meet(X1,X1) = X1,
idempotence_of_meet ).
cnf(c_0_15,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_16,axiom,
meet(join(X1,meet(X2,X3)),join(X1,X2)) = join(X1,meet(X2,X3)),
quasi_lattice2 ).
cnf(c_0_17,plain,
join(X1,join(X2,X3)) = join(X2,join(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_11]),c_0_12]) ).
cnf(c_0_18,plain,
join(X1,join(X2,meet(X1,join(X1,X2)))) = join(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_11]),c_0_12]) ).
cnf(c_0_19,plain,
join(X1,meet(X1,join(X1,X2))) = meet(X1,join(X1,X2)),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_21,plain,
meet(join(X1,X2),join(X1,meet(X2,X3))) = join(X1,meet(X2,X3)),
inference(rw,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_22,plain,
join(X1,meet(X2,join(X2,X1))) = join(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_23,plain,
meet(X1,meet(X2,X3)) = meet(X3,meet(X1,X2)),
inference(spm,[status(thm)],[c_0_15,c_0_20]) ).
cnf(c_0_24,plain,
meet(join(X1,X2),join(X2,X1)) = join(X2,X1),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,axiom,
join(X1,X1) = X1,
idempotence_of_join ).
cnf(c_0_26,plain,
meet(X1,meet(X2,X3)) = meet(X3,meet(X2,X1)),
inference(spm,[status(thm)],[c_0_23,c_0_15]) ).
cnf(c_0_27,plain,
meet(join(X1,X2),meet(join(X2,X1),X3)) = meet(join(X2,X1),X3),
inference(spm,[status(thm)],[c_0_20,c_0_24]) ).
cnf(c_0_28,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_12,c_0_25]) ).
cnf(c_0_29,plain,
meet(X1,meet(X2,join(X1,meet(X1,X2)))) = meet(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_25]),c_0_11]),c_0_15]),c_0_20]) ).
cnf(c_0_30,plain,
meet(X1,meet(X2,X3)) = meet(X2,meet(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_15]),c_0_20]) ).
cnf(c_0_31,plain,
meet(X1,join(X1,meet(X1,X2))) = join(X1,meet(X1,X2)),
inference(spm,[status(thm)],[c_0_21,c_0_25]) ).
cnf(c_0_32,hypothesis,
join(join(X1,meet(X2,X3)),meet(join(X1,X2),X3)) = join(X1,meet(X2,X3)),
bowden ).
cnf(c_0_33,plain,
join(meet(X1,X2),meet(X2,join(X1,X3))) = meet(X2,join(X1,X3)),
inference(spm,[status(thm)],[c_0_13,c_0_15]) ).
cnf(c_0_34,plain,
meet(join(X1,X2),X3) = meet(X3,join(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_24]) ).
cnf(c_0_35,plain,
join(X1,join(X2,X1)) = join(X2,X1),
inference(spm,[status(thm)],[c_0_28,c_0_11]) ).
cnf(c_0_36,plain,
meet(X1,join(X2,meet(X2,X1))) = meet(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]) ).
cnf(c_0_37,hypothesis,
join(X1,join(meet(X2,X3),meet(join(X1,X2),X3))) = join(X1,meet(X2,X3)),
inference(rw,[status(thm)],[c_0_32,c_0_12]) ).
cnf(c_0_38,plain,
join(meet(X1,X2),meet(join(X3,X1),X2)) = meet(join(X3,X1),X2),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,plain,
join(meet(X1,X2),meet(X1,join(X3,X2))) = meet(X1,join(X3,X2)),
inference(spm,[status(thm)],[c_0_13,c_0_35]) ).
cnf(c_0_40,plain,
join(X1,join(X2,X3)) = join(X3,join(X1,X2)),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_41,plain,
meet(X1,meet(X1,X2)) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_20,c_0_14]) ).
cnf(c_0_42,plain,
meet(join(X1,meet(X1,X2)),join(X2,meet(X1,X2))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_36,c_0_36]) ).
cnf(c_0_43,hypothesis,
join(X1,meet(join(X1,X2),X3)) = join(X1,meet(X2,X3)),
inference(rw,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_44,plain,
join(X1,join(meet(X1,join(X1,X2)),X3)) = join(meet(X1,join(X1,X2)),X3),
inference(spm,[status(thm)],[c_0_12,c_0_19]) ).
cnf(c_0_45,plain,
join(meet(X1,X2),meet(X2,join(X3,X1))) = meet(X2,join(X3,X1)),
inference(spm,[status(thm)],[c_0_39,c_0_15]) ).
cnf(c_0_46,plain,
join(X1,join(X2,X3)) = join(X3,join(X2,X1)),
inference(spm,[status(thm)],[c_0_40,c_0_11]) ).
cnf(c_0_47,plain,
meet(X1,meet(X2,X1)) = meet(X2,X1),
inference(spm,[status(thm)],[c_0_41,c_0_15]) ).
cnf(c_0_48,hypothesis,
meet(X1,join(X1,X2)) = join(X1,meet(X2,X1)),
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(spm,[status(thm)],[c_0_42,c_0_43]),c_0_15]),c_0_12]),c_0_22]),c_0_28]),c_0_21]),c_0_15]) ).
cnf(c_0_49,plain,
join(X1,meet(join(X1,X2),join(X3,X1))) = meet(join(X1,X2),join(X3,X1)),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_50,hypothesis,
join(X1,meet(X2,join(X3,X1))) = join(X1,meet(X3,X2)),
inference(spm,[status(thm)],[c_0_43,c_0_34]) ).
cnf(c_0_51,plain,
join(meet(X1,X2),meet(join(X2,X3),X1)) = meet(join(X2,X3),X1),
inference(spm,[status(thm)],[c_0_13,c_0_15]) ).
cnf(c_0_52,hypothesis,
join(X1,meet(join(X2,join(X3,X1)),X4)) = join(X1,meet(join(X3,X2),X4)),
inference(spm,[status(thm)],[c_0_43,c_0_46]) ).
cnf(c_0_53,plain,
join(meet(X1,X2),meet(join(X3,X2),X1)) = meet(join(X3,X2),X1),
inference(spm,[status(thm)],[c_0_39,c_0_15]) ).
cnf(c_0_54,plain,
meet(X1,join(X1,meet(X2,X1))) = join(X1,meet(X2,X1)),
inference(spm,[status(thm)],[c_0_31,c_0_47]) ).
cnf(c_0_55,hypothesis,
meet(join(X1,meet(X2,X1)),X3) = meet(X1,meet(join(X1,X2),X3)),
inference(spm,[status(thm)],[c_0_20,c_0_48]) ).
cnf(c_0_56,plain,
meet(join(X1,X2),join(X3,X1)) = join(X1,meet(X3,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_43]),c_0_50]) ).
cnf(c_0_57,hypothesis,
meet(X1,join(X2,join(X3,meet(X1,X2)))) = meet(join(X3,X2),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53]),c_0_15]) ).
cnf(c_0_58,plain,
meet(X1,join(X2,meet(X1,X2))) = meet(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_47]),c_0_20]),c_0_54]) ).
cnf(c_0_59,hypothesis,
meet(join(X1,meet(X1,X2)),X3) = meet(X1,meet(join(X1,X2),X3)),
inference(spm,[status(thm)],[c_0_55,c_0_15]) ).
cnf(c_0_60,plain,
meet(join(X1,X2),join(X2,X3)) = join(X2,meet(X1,X3)),
inference(spm,[status(thm)],[c_0_15,c_0_56]) ).
cnf(c_0_61,plain,
meet(X1,meet(join(X1,meet(X1,X2)),X3)) = meet(join(X1,meet(X1,X2)),X3),
inference(spm,[status(thm)],[c_0_20,c_0_31]) ).
cnf(c_0_62,plain,
meet(join(X1,X2),join(X2,meet(X1,X3))) = join(X2,meet(X1,X3)),
inference(spm,[status(thm)],[c_0_21,c_0_11]) ).
cnf(c_0_63,hypothesis,
meet(X1,join(X2,meet(X1,X3))) = meet(join(X2,X3),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_51]),c_0_58]),c_0_11]),c_0_59]),c_0_60]) ).
cnf(c_0_64,negated_conjecture,
meet(a,join(b,c)) != join(meet(a,b),meet(a,c)),
inference(fof_simplification,[status(thm)],[prove_distributivity]) ).
cnf(c_0_65,plain,
meet(X1,join(meet(X1,X2),meet(X1,X3))) = join(meet(X1,X2),meet(X1,X3)),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_66,hypothesis,
meet(X1,join(meet(X1,X2),X3)) = meet(join(X3,X2),X1),
inference(spm,[status(thm)],[c_0_63,c_0_11]) ).
cnf(c_0_67,negated_conjecture,
meet(a,join(b,c)) != join(meet(a,b),meet(a,c)),
c_0_64 ).
cnf(c_0_68,plain,
join(meet(X1,X2),meet(X1,X3)) = meet(join(X3,X2),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_63]),c_0_15]),c_0_66]) ).
cnf(c_0_69,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_67,c_0_68]),c_0_11]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : LAT021-1 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.05/0.30 % Computer : n012.cluster.edu
% 0.05/0.30 % Model : x86_64 x86_64
% 0.05/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.05/0.30 % Memory : 8046.5625MB
% 0.05/0.30 % OS : Linux 6.8.0-71-generic
% 0.05/0.30 % CPULimit : 300
% 0.05/0.30 % WCLimit : 300
% 0.05/0.30 % DateTime : Sun Sep 20 23:06:36 UTC 2026
% 0.05/0.30 % CPUTime :
% 0.05/0.30 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.32 Running first-order theorem proving
% 0.07/0.32 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
% 1.06/0.58 % Version: 3.5.1
% 1.06/0.58 % Preprocessing class: FSSSSMSSSSSNFFN.
% 1.06/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.06/0.58 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.06/0.58 % Starting new_bool_3 with 300s (1) cores
% 1.06/0.58 % Starting new_bool_1 with 300s (1) cores
% 1.06/0.58 % Starting sh5l with 300s (1) cores
% 1.06/0.58 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1048875 completed with status 0
% 1.06/0.58 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 1.06/0.58 % Preprocessing class: FSSSSMSSSSSNFFN.
% 1.06/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.06/0.58 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.06/0.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.06/0.58 % No SInE strategy applied
% 1.06/0.58 % Search class: FUUPM-FFSF22-MFFFFFNN
% 1.06/0.58 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 1.06/0.58 % Starting SubtermCWHack with 136s (1) cores
% 1.06/0.58 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.06/0.58 % Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 1.06/0.58 % Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.06/0.58 % Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.06/0.58 % U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 1048886 completed with status 0
% 1.06/0.58 % Result found by U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 1.06/0.58 % Preprocessing class: FSSSSMSSSSSNFFN.
% 1.06/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.06/0.58 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.06/0.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.06/0.58 % No SInE strategy applied
% 1.06/0.58 % Search class: FUUPM-FFSF22-MFFFFFNN
% 1.06/0.58 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 1.06/0.58 % Starting SubtermCWHack with 136s (1) cores
% 1.06/0.58 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.06/0.58 % Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 1.06/0.58 % Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.06/0.58 % Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.06/0.58 % Preprocessing time : 0.001 s
% 1.06/0.58 % Presaturation interreduction done
% 1.06/0.58
% 1.06/0.58 % Proof found!
% 1.06/0.58 % SZS status Unsatisfiable
% 1.06/0.58 % SZS output start CNFRefutation
% See solution above
% 1.06/0.58 % Parsed axioms : 10
% 1.06/0.58 % Removed by relevancy pruning/SinE : 0
% 1.06/0.58 % Initial clauses : 10
% 1.06/0.58 % Removed in clause preprocessing : 0
% 1.06/0.58 % Initial clauses in saturation : 10
% 1.06/0.58 % Processed clauses : 1961
% 1.06/0.58 % ...of these trivial : 701
% 1.06/0.58 % ...subsumed : 1083
% 1.06/0.58 % ...remaining for further processing : 177
% 1.06/0.58 % Other redundant clauses eliminated : 0
% 1.06/0.58 % Clauses deleted for lack of memory : 0
% 1.06/0.58 % Backward-subsumed : 0
% 1.06/0.58 % Backward-rewritten : 65
% 1.06/0.58 % Generated clauses : 24127
% 1.06/0.58 % ...of the previous two non-redundant : 18703
% 1.06/0.58 % ...aggressively subsumed : 0
% 1.06/0.58 % Contextual simplify-reflections : 0
% 1.06/0.58 % Paramodulations : 24127
% 1.06/0.58 % Factorizations : 0
% 1.06/0.58 % NegExts : 0
% 1.06/0.58 % Equation resolutions : 0
% 1.06/0.58 % Disequality decompositions : 0
% 1.06/0.58 % Total rewrite steps : 42953
% 1.06/0.58 % ...of those cached : 32072
% 1.06/0.58 % Propositional unsat checks : 0
% 1.06/0.58 % Propositional check models : 0
% 1.06/0.58 % Propositional check unsatisfiable : 0
% 1.06/0.58 % Propositional clauses : 0
% 1.06/0.58 % Propositional clauses after purity: 0
% 1.06/0.58 % Propositional unsat core size : 0
% 1.06/0.58 % Propositional preprocessing time : 0.000
% 1.06/0.58 % Propositional encoding time : 0.000
% 1.06/0.58 % Propositional solver time : 0.000
% 1.06/0.58 % Success case prop preproc time : 0.000
% 1.06/0.58 % Success case prop encoding time : 0.000
% 1.06/0.58 % Success case prop solver time : 0.000
% 1.06/0.58 % Current number of processed clauses : 102
% 1.06/0.58 % Positive orientable unit clauses : 90
% 1.06/0.58 % Positive unorientable unit clauses: 12
% 1.06/0.58 % Negative unit clauses : 0
% 1.06/0.58 % Non-unit-clauses : 0
% 1.06/0.58 % Current number of unprocessed clauses: 16702
% 1.06/0.58 % ...number of literals in the above : 16702
% 1.06/0.58 % Current number of archived formulas : 0
% 1.06/0.58 % Current number of archived clauses : 75
% 1.06/0.58 % Clause-clause subsumption calls (NU) : 0
% 1.06/0.58 % Rec. Clause-clause subsumption calls : 0
% 1.06/0.58 % Non-unit clause-clause subsumptions : 0
% 1.06/0.58 % Unit Clause-clause subsumption calls : 89
% 1.06/0.58 % Rewrite failures with RHS unbound : 0
% 1.06/0.58 % BW rewrite match attempts : 1018
% 1.06/0.58 % BW rewrite match successes : 257
% 1.06/0.58 % Condensation attempts : 0
% 1.06/0.58 % Condensation successes : 0
% 1.06/0.58 % Termbank termtop insertions : 273082
% 1.06/0.58 % Search garbage collected termcells : 2
% 1.06/0.58
% 1.06/0.58 % -------------------------------------------------
% 1.06/0.58 % User time : 0.220 s
% 1.06/0.58 % System time : 0.011 s
% 1.06/0.58 % Total time : 0.231 s
% 1.06/0.58 % Maximum resident set size: 3636 pages
% 1.06/0.58
% 1.06/0.58 % -------------------------------------------------
% 1.06/0.58 % User time : 1.067 s
% 1.06/0.58 % System time : 0.074 s
% 1.06/0.58 % Total time : 1.140 s
% 1.06/0.58 % Maximum resident set size: 4608 pages
% 1.06/0.58 % E exiting
%------------------------------------------------------------------------------