%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : REL041-2 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n020.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:07 PM UTC 2026
% Result : Unsatisfiable 14.00s 2.61s
% Output : CNFRefutation 14.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 16
% Syntax : Number of clauses : 83 ( 83 unt; 0 nHn; 15 RR)
% Number of literals : 83 ( 82 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 11 ( 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 : 124 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(converse_multiplicativity_10,axiom,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',converse_multiplicativity_10) ).
cnf(composition_identity_6,axiom,
composition(X1,one) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',composition_identity_6) ).
cnf(converse_idempotence_8,axiom,
converse(converse(X1)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',converse_idempotence_8) ).
cnf(converse_cancellativity_11,axiom,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',converse_cancellativity_11) ).
cnf(maddux1_join_commutativity_1,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',maddux1_join_commutativity_1) ).
cnf(def_zero_13,axiom,
zero = meet(X1,complement(X1)),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/REL001-0.ax',maddux4_definiton_of_meet_4) ).
cnf(def_top_12,axiom,
top = join(X1,complement(X1)),
file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/benchmark/Axioms/REL001-0.ax',maddux2_join_associativity_2) ).
cnf(composition_distributivity_7,axiom,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',composition_distributivity_7) ).
cnf(converse_additivity_9,axiom,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',converse_additivity_9) ).
cnf(modular_law_1_15,axiom,
join(meet(composition(X1,X2),X3),meet(composition(X1,meet(X2,composition(converse(X1),X3))),X3)) = meet(composition(X1,meet(X2,composition(converse(X1),X3))),X3),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-1.ax',modular_law_1_15) ).
cnf(goals_17,negated_conjecture,
join(composition(converse(sk1),sk1),one) = one,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals_17) ).
cnf(composition_associativity_5,axiom,
composition(X1,composition(X2,X3)) = composition(composition(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',composition_associativity_5) ).
cnf(goals_18,negated_conjecture,
meet(composition(sk1,sk2),composition(sk1,complement(sk2))) != zero,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals_18) ).
cnf(c_0_16,axiom,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
converse_multiplicativity_10 ).
cnf(c_0_17,axiom,
composition(X1,one) = X1,
composition_identity_6 ).
cnf(c_0_18,plain,
composition(converse(one),converse(X1)) = converse(X1),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,axiom,
converse(converse(X1)) = X1,
converse_idempotence_8 ).
cnf(c_0_20,plain,
composition(converse(one),X1) = X1,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,axiom,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
converse_cancellativity_11 ).
cnf(c_0_22,axiom,
join(X1,X2) = join(X2,X1),
maddux1_join_commutativity_1 ).
cnf(c_0_23,plain,
converse(one) = one,
inference(spm,[status(thm)],[c_0_17,c_0_20]) ).
cnf(c_0_24,axiom,
zero = meet(X1,complement(X1)),
def_zero_13 ).
cnf(c_0_25,axiom,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
maddux4_definiton_of_meet_4 ).
cnf(c_0_26,plain,
join(complement(X1),composition(converse(X2),complement(composition(X2,X1)))) = complement(X1),
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[c_0_20,c_0_23]) ).
cnf(c_0_28,plain,
zero = complement(join(complement(X1),complement(complement(X1)))),
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,axiom,
top = join(X1,complement(X1)),
def_top_12 ).
cnf(c_0_30,plain,
join(complement(X1),complement(X1)) = complement(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_23]),c_0_27]) ).
cnf(c_0_31,plain,
complement(top) = zero,
inference(rw,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,axiom,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
maddux3_a_kind_of_de_Morgan_3 ).
cnf(c_0_33,axiom,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
maddux2_join_associativity_2 ).
cnf(c_0_34,plain,
join(zero,zero) = zero,
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,plain,
join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = X1,
inference(rw,[status(thm)],[c_0_32,c_0_22]) ).
cnf(c_0_36,plain,
join(zero,join(zero,X1)) = join(zero,X1),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,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_35,c_0_30]),c_0_29]),c_0_31]),c_0_22]) ).
cnf(c_0_38,plain,
join(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_39,plain,
complement(complement(X1)) = X1,
inference(rw,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_40,plain,
join(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_30,c_0_39]) ).
cnf(c_0_41,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_33,c_0_40]) ).
cnf(c_0_42,plain,
join(X1,complement(join(complement(X1),X2))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_35]),c_0_22]) ).
cnf(c_0_43,plain,
join(X1,join(X2,X1)) = join(X2,X1),
inference(spm,[status(thm)],[c_0_41,c_0_22]) ).
cnf(c_0_44,plain,
join(X1,complement(join(X2,complement(X1)))) = X1,
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_45,plain,
join(X1,join(X2,X3)) = join(X2,join(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_22]),c_0_33]) ).
cnf(c_0_46,plain,
join(complement(X1),complement(join(X2,X1))) = complement(X1),
inference(spm,[status(thm)],[c_0_44,c_0_39]) ).
cnf(c_0_47,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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_35]),c_0_39]),c_0_45]),c_0_22]),c_0_46]) ).
cnf(c_0_48,axiom,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
composition_distributivity_7 ).
cnf(c_0_49,plain,
join(X1,top) = top,
inference(spm,[status(thm)],[c_0_41,c_0_29]) ).
cnf(c_0_50,axiom,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
converse_additivity_9 ).
cnf(c_0_51,plain,
join(X1,complement(join(X1,complement(X2)))) = join(X1,X2),
inference(spm,[status(thm)],[c_0_47,c_0_39]) ).
cnf(c_0_52,plain,
join(composition(X1,X2),composition(top,X2)) = composition(top,X2),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_53,plain,
join(converse(X1),converse(top)) = converse(top),
inference(spm,[status(thm)],[c_0_50,c_0_49]) ).
cnf(c_0_54,axiom,
join(meet(composition(X1,X2),X3),meet(composition(X1,meet(X2,composition(converse(X1),X3))),X3)) = meet(composition(X1,meet(X2,composition(converse(X1),X3))),X3),
modular_law_1_15 ).
cnf(c_0_55,plain,
join(X1,complement(join(X1,X2))) = join(X1,complement(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_51]),c_0_41]) ).
cnf(c_0_56,negated_conjecture,
join(composition(converse(sk1),sk1),one) = one,
goals_17 ).
cnf(c_0_57,plain,
join(top,X1) = top,
inference(spm,[status(thm)],[c_0_22,c_0_49]) ).
cnf(c_0_58,plain,
join(X1,composition(top,X1)) = composition(top,X1),
inference(spm,[status(thm)],[c_0_52,c_0_27]) ).
cnf(c_0_59,plain,
join(X1,converse(top)) = converse(top),
inference(spm,[status(thm)],[c_0_53,c_0_19]) ).
cnf(c_0_60,plain,
join(complement(join(complement(composition(X1,X2)),complement(X3))),complement(join(complement(composition(X1,complement(join(complement(X2),complement(composition(converse(X1),X3)))))),complement(X3)))) = complement(join(complement(composition(X1,complement(join(complement(X2),complement(composition(converse(X1),X3)))))),complement(X3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_25]),c_0_25]),c_0_25]),c_0_25]),c_0_25]) ).
cnf(c_0_61,plain,
join(X1,complement(join(X2,X1))) = join(X1,complement(X2)),
inference(spm,[status(thm)],[c_0_55,c_0_22]) ).
cnf(c_0_62,plain,
join(X1,join(X2,X3)) = join(X3,join(X1,X2)),
inference(spm,[status(thm)],[c_0_22,c_0_33]) ).
cnf(c_0_63,negated_conjecture,
join(one,composition(converse(sk1),sk1)) = one,
inference(rw,[status(thm)],[c_0_56,c_0_22]) ).
cnf(c_0_64,axiom,
composition(X1,composition(X2,X3)) = composition(composition(X1,X2),X3),
composition_associativity_5 ).
cnf(c_0_65,plain,
composition(top,top) = top,
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_66,plain,
converse(top) = top,
inference(spm,[status(thm)],[c_0_57,c_0_59]) ).
cnf(c_0_67,negated_conjecture,
meet(composition(sk1,sk2),composition(sk1,complement(sk2))) != zero,
inference(fof_simplification,[status(thm)],[goals_18]) ).
cnf(c_0_68,plain,
join(complement(join(complement(composition(X1,X2)),complement(X3))),complement(join(complement(X3),complement(composition(X1,complement(join(complement(X2),complement(composition(converse(X1),X3))))))))) = complement(join(complement(X3),complement(composition(X1,complement(join(complement(X2),complement(composition(converse(X1),X3)))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_22]),c_0_22]) ).
cnf(c_0_69,plain,
join(X1,join(complement(join(X2,X1)),X3)) = join(X1,join(complement(X2),X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_61]),c_0_33]) ).
cnf(c_0_70,plain,
join(X1,complement(join(X2,join(X3,X1)))) = join(X1,complement(join(X2,X3))),
inference(spm,[status(thm)],[c_0_55,c_0_62]) ).
cnf(c_0_71,plain,
join(X1,join(complement(join(X1,X2)),X3)) = join(X1,join(complement(X2),X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_55]),c_0_33]) ).
cnf(c_0_72,negated_conjecture,
join(X1,composition(converse(sk1),composition(sk1,X1))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_63]),c_0_64]),c_0_27]),c_0_27]) ).
cnf(c_0_73,plain,
composition(top,zero) = zero,
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_26,c_0_65]),c_0_31]),c_0_66]),c_0_31]),c_0_38]),c_0_31]) ).
cnf(c_0_74,plain,
join(X1,zero) = X1,
inference(spm,[status(thm)],[c_0_22,c_0_38]) ).
cnf(c_0_75,negated_conjecture,
meet(composition(sk1,sk2),composition(sk1,complement(sk2))) != zero,
c_0_67 ).
cnf(c_0_76,plain,
join(complement(X1),join(complement(composition(X2,X3)),complement(composition(X2,complement(join(complement(X3),complement(composition(converse(X2),X1)))))))) = join(complement(composition(X2,X3)),complement(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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_68]),c_0_39]),c_0_39]),c_0_45]),c_0_69]),c_0_39]),c_0_33]),c_0_70]),c_0_22]),c_0_71]) ).
cnf(c_0_77,negated_conjecture,
join(X1,complement(composition(converse(sk1),composition(sk1,X1)))) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_72]),c_0_29]) ).
cnf(c_0_78,plain,
composition(X1,zero) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_73]),c_0_74]) ).
cnf(c_0_79,plain,
complement(zero) = top,
inference(spm,[status(thm)],[c_0_29,c_0_38]) ).
cnf(c_0_80,negated_conjecture,
complement(join(complement(composition(sk1,sk2)),complement(composition(sk1,complement(sk2))))) != zero,
inference(rw,[status(thm)],[c_0_75,c_0_25]) ).
cnf(c_0_81,negated_conjecture,
join(complement(composition(sk1,X1)),complement(composition(sk1,complement(X1)))) = top,
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_76,c_0_77]),c_0_31]),c_0_78]),c_0_79]),c_0_49]),c_0_49]) ).
cnf(c_0_82,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_80,c_0_81]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : REL041-2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n020.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 04:08:48 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.43 Running first-order theorem proving
% 0.14/0.43 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
% 14.00/2.61 % Version: 3.5.1
% 14.00/2.61 % Preprocessing class: FSMSSMSSSSSNFFN.
% 14.00/2.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 14.00/2.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 14.00/2.61 % Starting new_bool_3 with 300s (1) cores
% 14.00/2.61 % Starting new_bool_1 with 300s (1) cores
% 14.00/2.61 % Starting sh5l with 300s (1) cores
% 14.00/2.61 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1966937 completed with status 0
% 14.00/2.61 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 14.00/2.61 % Preprocessing class: FSMSSMSSSSSNFFN.
% 14.00/2.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 14.00/2.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 14.00/2.61 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 14.00/2.61 % No SInE strategy applied
% 14.00/2.61 % Search class: FUUPM-FFMF21-DFFFFFNN
% 14.00/2.61 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 14.00/2.61 % Starting SubtermCWHack with 136s (1) cores
% 14.00/2.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 14.00/2.61 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 14.00/2.61 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 136s (1) cores
% 14.00/2.61 % Starting new_bool_3 with 136s (1) cores
% 14.00/2.61 % H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with pid 1966943 completed with status 0
% 14.00/2.61 % Result found by H----_047_B31_F1_PI_AE_R4_CS_SP_S2S
% 14.00/2.61 % Preprocessing class: FSMSSMSSSSSNFFN.
% 14.00/2.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 14.00/2.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 14.00/2.61 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 14.00/2.61 % No SInE strategy applied
% 14.00/2.61 % Search class: FUUPM-FFMF21-DFFFFFNN
% 14.00/2.61 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 14.00/2.61 % Starting SubtermCWHack with 136s (1) cores
% 14.00/2.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 14.00/2.61 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 14.00/2.61 % Preprocessing time : 0.002 s
% 14.00/2.61
% 14.00/2.61 % Proof found!
% 14.00/2.61 % SZS status Unsatisfiable
% 14.00/2.61 % SZS output start CNFRefutation
% See solution above
% 14.00/2.62 % Parsed axioms : 18
% 14.00/2.62 % Removed by relevancy pruning/SinE : 0
% 14.00/2.62 % Initial clauses : 18
% 14.00/2.62 % Removed in clause preprocessing : 1
% 14.00/2.62 % Initial clauses in saturation : 17
% 14.00/2.62 % Processed clauses : 3331
% 14.00/2.62 % ...of these trivial : 2199
% 14.00/2.62 % ...subsumed : 588
% 14.00/2.62 % ...remaining for further processing : 544
% 14.00/2.62 % Other redundant clauses eliminated : 0
% 14.00/2.62 % Clauses deleted for lack of memory : 0
% 14.00/2.62 % Backward-subsumed : 0
% 14.00/2.62 % Backward-rewritten : 102
% 14.00/2.62 % Generated clauses : 79967
% 14.00/2.62 % ...of the previous two non-redundant : 40689
% 14.00/2.62 % ...aggressively subsumed : 0
% 14.00/2.62 % Contextual simplify-reflections : 0
% 14.00/2.62 % Paramodulations : 79967
% 14.00/2.62 % Factorizations : 0
% 14.00/2.62 % NegExts : 0
% 14.00/2.62 % Equation resolutions : 0
% 14.00/2.62 % Disequality decompositions : 0
% 14.00/2.62 % Total rewrite steps : 293308
% 14.00/2.62 % ...of those cached : 264302
% 14.00/2.62 % Propositional unsat checks : 0
% 14.00/2.62 % Propositional check models : 0
% 14.00/2.62 % Propositional check unsatisfiable : 0
% 14.00/2.62 % Propositional clauses : 0
% 14.00/2.62 % Propositional clauses after purity: 0
% 14.00/2.62 % Propositional unsat core size : 0
% 14.00/2.62 % Propositional preprocessing time : 0.000
% 14.00/2.62 % Propositional encoding time : 0.000
% 14.00/2.62 % Propositional solver time : 0.000
% 14.00/2.62 % Success case prop preproc time : 0.000
% 14.00/2.62 % Success case prop encoding time : 0.000
% 14.00/2.62 % Success case prop solver time : 0.000
% 14.00/2.62 % Current number of processed clauses : 442
% 14.00/2.62 % Positive orientable unit clauses : 438
% 14.00/2.62 % Positive unorientable unit clauses: 4
% 14.00/2.62 % Negative unit clauses : 0
% 14.00/2.62 % Non-unit-clauses : 0
% 14.00/2.62 % Current number of unprocessed clauses: 36731
% 14.00/2.62 % ...number of literals in the above : 36731
% 14.00/2.62 % Current number of archived formulas : 0
% 14.00/2.62 % Current number of archived clauses : 103
% 14.00/2.62 % Clause-clause subsumption calls (NU) : 0
% 14.00/2.62 % Rec. Clause-clause subsumption calls : 0
% 14.00/2.62 % Non-unit clause-clause subsumptions : 0
% 14.00/2.62 % Unit Clause-clause subsumption calls : 35
% 14.00/2.62 % Rewrite failures with RHS unbound : 305
% 14.00/2.62 % BW rewrite match attempts : 3171
% 14.00/2.62 % BW rewrite match successes : 474
% 14.00/2.62 % Condensation attempts : 0
% 14.00/2.62 % Condensation successes : 0
% 14.00/2.62 % Termbank termtop insertions : 1870954
% 14.00/2.62 % Search garbage collected termcells : 2
% 14.00/2.62
% 14.00/2.62 % -------------------------------------------------
% 14.00/2.62 % User time : 1.980 s
% 14.00/2.62 % System time : 0.086 s
% 14.00/2.62 % Total time : 2.066 s
% 14.00/2.62 % Maximum resident set size: 3648 pages
% 14.00/2.62
% 14.00/2.62 % -------------------------------------------------
% 14.00/2.62 % User time : 9.435 s
% 14.00/2.62 % System time : 0.433 s
% 14.00/2.62 % Total time : 9.868 s
% 14.00/2.62 % Maximum resident set size: 4864 pages
% 14.00/2.62 % E exiting
%------------------------------------------------------------------------------