TSTP Solution File: REL041-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : REL041-1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:14:31 EDT 2023
% Result : Unsatisfiable 1628.71s 224.78s
% Output : CNFRefutation 1628.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 15
% Syntax : Number of clauses : 78 ( 78 unt; 0 nHn; 10 RR)
% Number of literals : 78 ( 77 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 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 : 123 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(converse_multiplicativity_10,axiom,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
file('/export/starexec/sandbox/tmp/tmp.NyFikLIy35/E---3.1_24763.p',converse_multiplicativity_10) ).
cnf(converse_idempotence_8,axiom,
converse(converse(X1)) = X1,
file('/export/starexec/sandbox/tmp/tmp.NyFikLIy35/E---3.1_24763.p',converse_idempotence_8) ).
cnf(composition_identity_6,axiom,
composition(X1,one) = X1,
file('/export/starexec/sandbox/tmp/tmp.NyFikLIy35/E---3.1_24763.p',composition_identity_6) ).
cnf(converse_cancellativity_11,axiom,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
file('/export/starexec/sandbox/tmp/tmp.NyFikLIy35/E---3.1_24763.p',converse_cancellativity_11) ).
cnf(maddux1_join_commutativity_1,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.NyFikLIy35/E---3.1_24763.p',maddux1_join_commutativity_1) ).
cnf(def_zero_13,axiom,
zero = meet(X1,complement(X1)),
file('/export/starexec/sandbox/tmp/tmp.NyFikLIy35/E---3.1_24763.p',def_zero_13) ).
cnf(maddux4_definiton_of_meet_4,axiom,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
file('/export/starexec/sandbox/tmp/tmp.NyFikLIy35/E---3.1_24763.p',maddux4_definiton_of_meet_4) ).
cnf(def_top_12,axiom,
top = join(X1,complement(X1)),
file('/export/starexec/sandbox/tmp/tmp.NyFikLIy35/E---3.1_24763.p',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/tmp/tmp.NyFikLIy35/E---3.1_24763.p',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/tmp/tmp.NyFikLIy35/E---3.1_24763.p',maddux2_join_associativity_2) ).
cnf(converse_additivity_9,axiom,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
file('/export/starexec/sandbox/tmp/tmp.NyFikLIy35/E---3.1_24763.p',converse_additivity_9) ).
cnf(composition_distributivity_7,axiom,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.NyFikLIy35/E---3.1_24763.p',composition_distributivity_7) ).
cnf(goals_14,negated_conjecture,
join(composition(converse(sk1),sk1),one) = one,
file('/export/starexec/sandbox/tmp/tmp.NyFikLIy35/E---3.1_24763.p',goals_14) ).
cnf(composition_associativity_5,axiom,
composition(X1,composition(X2,X3)) = composition(composition(X1,X2),X3),
file('/export/starexec/sandbox/tmp/tmp.NyFikLIy35/E---3.1_24763.p',composition_associativity_5) ).
cnf(goals_15,negated_conjecture,
meet(composition(sk1,sk2),composition(sk1,complement(sk2))) != zero,
file('/export/starexec/sandbox/tmp/tmp.NyFikLIy35/E---3.1_24763.p',goals_15) ).
cnf(c_0_15,axiom,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
converse_multiplicativity_10 ).
cnf(c_0_16,axiom,
converse(converse(X1)) = X1,
converse_idempotence_8 ).
cnf(c_0_17,plain,
converse(composition(converse(X1),X2)) = composition(converse(X2),X1),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_18,axiom,
composition(X1,one) = X1,
composition_identity_6 ).
cnf(c_0_19,plain,
composition(converse(one),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_16]) ).
cnf(c_0_20,axiom,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
converse_cancellativity_11 ).
cnf(c_0_21,axiom,
join(X1,X2) = join(X2,X1),
maddux1_join_commutativity_1 ).
cnf(c_0_22,plain,
converse(one) = one,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,axiom,
zero = meet(X1,complement(X1)),
def_zero_13 ).
cnf(c_0_24,axiom,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
maddux4_definiton_of_meet_4 ).
cnf(c_0_25,plain,
join(complement(X1),composition(converse(X2),complement(composition(X2,X1)))) = complement(X1),
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[c_0_19,c_0_22]) ).
cnf(c_0_27,plain,
zero = complement(join(complement(X1),complement(complement(X1)))),
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,axiom,
top = join(X1,complement(X1)),
def_top_12 ).
cnf(c_0_29,plain,
join(complement(X1),complement(X1)) = complement(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_22]),c_0_26]) ).
cnf(c_0_30,plain,
complement(top) = zero,
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,axiom,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
maddux3_a_kind_of_de_Morgan_3 ).
cnf(c_0_32,axiom,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
maddux2_join_associativity_2 ).
cnf(c_0_33,plain,
join(zero,zero) = zero,
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,plain,
join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = X1,
inference(rw,[status(thm)],[c_0_31,c_0_21]) ).
cnf(c_0_35,plain,
join(zero,join(zero,X1)) = join(zero,X1),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,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_34,c_0_28]),c_0_29]),c_0_30]),c_0_21]) ).
cnf(c_0_37,plain,
join(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_38,plain,
complement(complement(X1)) = X1,
inference(rw,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_39,plain,
join(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_29,c_0_38]) ).
cnf(c_0_40,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_32,c_0_39]) ).
cnf(c_0_41,plain,
join(X1,complement(join(complement(X1),X2))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_34]),c_0_21]) ).
cnf(c_0_42,plain,
join(X1,join(X2,X1)) = join(X2,X1),
inference(spm,[status(thm)],[c_0_40,c_0_21]) ).
cnf(c_0_43,plain,
join(X1,complement(join(X2,complement(X1)))) = X1,
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_44,plain,
join(X1,join(complement(join(X2,complement(X1))),X3)) = join(X1,X3),
inference(spm,[status(thm)],[c_0_32,c_0_43]) ).
cnf(c_0_45,plain,
join(X1,complement(join(complement(X2),X1))) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_34]),c_0_38]) ).
cnf(c_0_46,plain,
join(X1,join(X2,complement(join(X1,X2)))) = top,
inference(spm,[status(thm)],[c_0_28,c_0_32]) ).
cnf(c_0_47,axiom,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
converse_additivity_9 ).
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,complement(join(X2,X1))) = join(X1,complement(X2)),
inference(spm,[status(thm)],[c_0_45,c_0_38]) ).
cnf(c_0_50,plain,
join(X1,join(X2,complement(join(X2,X1)))) = top,
inference(spm,[status(thm)],[c_0_46,c_0_21]) ).
cnf(c_0_51,plain,
join(X1,zero) = X1,
inference(spm,[status(thm)],[c_0_21,c_0_37]) ).
cnf(c_0_52,plain,
join(complement(X1),complement(join(X2,X1))) = complement(X1),
inference(spm,[status(thm)],[c_0_43,c_0_38]) ).
cnf(c_0_53,plain,
converse(join(composition(converse(X1),X2),X3)) = join(composition(converse(X2),X1),converse(X3)),
inference(spm,[status(thm)],[c_0_47,c_0_17]) ).
cnf(c_0_54,plain,
join(composition(X1,converse(X2)),converse(composition(X2,X3))) = composition(join(X1,converse(X3)),converse(X2)),
inference(spm,[status(thm)],[c_0_48,c_0_15]) ).
cnf(c_0_55,negated_conjecture,
join(composition(converse(sk1),sk1),one) = one,
goals_14 ).
cnf(c_0_56,plain,
join(X1,complement(join(X1,X2))) = join(X1,complement(X2)),
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_49,c_0_50]),c_0_30]),c_0_51]),c_0_32]),c_0_21]),c_0_52]) ).
cnf(c_0_57,plain,
join(composition(X1,X2),composition(X1,X3)) = composition(X1,join(X2,X3)),
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_53,c_0_54]),c_0_47]),c_0_15]),c_0_16]),c_0_16]),c_0_16]) ).
cnf(c_0_58,plain,
join(X1,composition(X2,X1)) = composition(join(one,X2),X1),
inference(spm,[status(thm)],[c_0_48,c_0_26]) ).
cnf(c_0_59,negated_conjecture,
join(one,composition(converse(sk1),sk1)) = one,
inference(rw,[status(thm)],[c_0_55,c_0_21]) ).
cnf(c_0_60,axiom,
composition(X1,composition(X2,X3)) = composition(composition(X1,X2),X3),
composition_associativity_5 ).
cnf(c_0_61,plain,
join(composition(X1,X2),complement(composition(X1,join(X2,X3)))) = join(composition(X1,X2),complement(composition(X1,X3))),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_62,plain,
composition(converse(X1),complement(composition(X1,top))) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_30]),c_0_37]) ).
cnf(c_0_63,negated_conjecture,
join(X1,composition(converse(sk1),composition(sk1,X1))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60]),c_0_26]) ).
cnf(c_0_64,plain,
join(complement(X1),join(composition(converse(X2),complement(composition(X2,X1))),X3)) = join(complement(X1),X3),
inference(spm,[status(thm)],[c_0_32,c_0_25]) ).
cnf(c_0_65,plain,
join(composition(X1,X2),complement(composition(X1,complement(X2)))) = join(composition(X1,X2),complement(composition(X1,top))),
inference(spm,[status(thm)],[c_0_61,c_0_28]) ).
cnf(c_0_66,plain,
composition(X1,complement(composition(converse(X1),top))) = zero,
inference(spm,[status(thm)],[c_0_62,c_0_16]) ).
cnf(c_0_67,negated_conjecture,
join(complement(X1),complement(composition(converse(sk1),composition(sk1,X1)))) = complement(composition(converse(sk1),composition(sk1,X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_63]),c_0_21]) ).
cnf(c_0_68,plain,
join(complement(X1),complement(composition(converse(X2),composition(X2,X1)))) = join(complement(X1),complement(composition(converse(X2),top))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_64]),c_0_38]) ).
cnf(c_0_69,plain,
join(complement(X1),composition(X2,complement(composition(converse(X2),X1)))) = complement(X1),
inference(spm,[status(thm)],[c_0_25,c_0_16]) ).
cnf(c_0_70,plain,
composition(X1,join(X2,complement(composition(converse(X1),top)))) = composition(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_66]),c_0_51]) ).
cnf(c_0_71,negated_conjecture,
join(complement(X1),complement(composition(converse(sk1),top))) = complement(composition(converse(sk1),composition(sk1,X1))),
inference(rw,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_72,negated_conjecture,
meet(composition(sk1,sk2),composition(sk1,complement(sk2))) != zero,
goals_15 ).
cnf(c_0_73,plain,
join(complement(X1),complement(composition(X2,complement(composition(converse(X2),X1))))) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_69]),c_0_28]) ).
cnf(c_0_74,negated_conjecture,
composition(sk1,complement(composition(converse(sk1),composition(sk1,X1)))) = composition(sk1,complement(X1)),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_75,negated_conjecture,
complement(join(complement(composition(sk1,sk2)),complement(composition(sk1,complement(sk2))))) != zero,
inference(rw,[status(thm)],[c_0_72,c_0_24]) ).
cnf(c_0_76,negated_conjecture,
join(complement(composition(sk1,X1)),complement(composition(sk1,complement(X1)))) = top,
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_77,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_75,c_0_76]),c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : REL041-1 : TPTP v8.1.2. Released v4.0.0.
% 0.05/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n008.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Mon Oct 2 15:21:43 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.15/0.40 Running first-order model finding
% 0.15/0.40 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.NyFikLIy35/E---3.1_24763.p
% 1628.71/224.78 # Version: 3.1pre001
% 1628.71/224.78 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1628.71/224.78 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1628.71/224.78 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1628.71/224.78 # Starting new_bool_3 with 300s (1) cores
% 1628.71/224.78 # Starting new_bool_1 with 300s (1) cores
% 1628.71/224.78 # Starting sh5l with 300s (1) cores
% 1628.71/224.78 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 24840 completed with status 0
% 1628.71/224.78 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1628.71/224.78 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1628.71/224.78 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1628.71/224.78 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1628.71/224.78 # No SInE strategy applied
% 1628.71/224.78 # Search class: FUUPM-FFSF21-MFFFFFNN
% 1628.71/224.78 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1628.71/224.78 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 1628.71/224.78 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1628.71/224.78 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 1628.71/224.78 # Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 1628.71/224.78 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 1628.71/224.78 # G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with pid 24848 completed with status 7
% 1628.71/224.78 # Starting G-E--_208_C18_F2_SE_CS_SP_PS_S5PRR_RG_S04A with 136s (1) cores
% 1628.71/224.78 # H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with pid 24851 completed with status 7
% 1628.71/224.78 # Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 130s (1) cores
% 1628.71/224.78 # U----_043_B31_F1_PI_AE_CS_SP_S2S with pid 24850 completed with status 7
% 1628.71/224.78 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 24847 completed with status 7
% 1628.71/224.78 # H----_047_C09_12_F1_AE_ND_CS_SP_S2S with pid 24844 completed with status 0
% 1628.71/224.78 # Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S2S
% 1628.71/224.78 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1628.71/224.78 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1628.71/224.78 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1628.71/224.78 # No SInE strategy applied
% 1628.71/224.78 # Search class: FUUPM-FFSF21-MFFFFFNN
% 1628.71/224.78 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1628.71/224.78 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 1628.71/224.78 # Preprocessing time : 0.001 s
% 1628.71/224.78 # Presaturation interreduction done
% 1628.71/224.78
% 1628.71/224.78 # Proof found!
% 1628.71/224.78 # SZS status Unsatisfiable
% 1628.71/224.78 # SZS output start CNFRefutation
% See solution above
% 1628.71/224.78 # Parsed axioms : 15
% 1628.71/224.78 # Removed by relevancy pruning/SinE : 0
% 1628.71/224.78 # Initial clauses : 15
% 1628.71/224.78 # Removed in clause preprocessing : 1
% 1628.71/224.78 # Initial clauses in saturation : 14
% 1628.71/224.78 # Processed clauses : 86012
% 1628.71/224.78 # ...of these trivial : 60464
% 1628.71/224.78 # ...subsumed : 20295
% 1628.71/224.78 # ...remaining for further processing : 5253
% 1628.71/224.78 # Other redundant clauses eliminated : 0
% 1628.71/224.78 # Clauses deleted for lack of memory : 198783
% 1628.71/224.78 # Backward-subsumed : 3
% 1628.71/224.78 # Backward-rewritten : 489
% 1628.71/224.78 # Generated clauses : 9421825
% 1628.71/224.78 # ...of the previous two non-redundant : 5361717
% 1628.71/224.78 # ...aggressively subsumed : 0
% 1628.71/224.78 # Contextual simplify-reflections : 0
% 1628.71/224.78 # Paramodulations : 9421825
% 1628.71/224.78 # Factorizations : 0
% 1628.71/224.78 # NegExts : 0
% 1628.71/224.78 # Equation resolutions : 0
% 1628.71/224.78 # Total rewrite steps : 29724885
% 1628.71/224.78 # Propositional unsat checks : 0
% 1628.71/224.78 # Propositional check models : 0
% 1628.71/224.78 # Propositional check unsatisfiable : 0
% 1628.71/224.78 # Propositional clauses : 0
% 1628.71/224.78 # Propositional clauses after purity: 0
% 1628.71/224.78 # Propositional unsat core size : 0
% 1628.71/224.78 # Propositional preprocessing time : 0.000
% 1628.71/224.78 # Propositional encoding time : 0.000
% 1628.71/224.78 # Propositional solver time : 0.000
% 1628.71/224.78 # Success case prop preproc time : 0.000
% 1628.71/224.78 # Success case prop encoding time : 0.000
% 1628.71/224.78 # Success case prop solver time : 0.000
% 1628.71/224.78 # Current number of processed clauses : 4747
% 1628.71/224.78 # Positive orientable unit clauses : 4697
% 1628.71/224.78 # Positive unorientable unit clauses: 50
% 1628.71/224.78 # Negative unit clauses : 0
% 1628.71/224.78 # Non-unit-clauses : 0
% 1628.71/224.78 # Current number of unprocessed clauses: 1063760
% 1628.71/224.78 # ...number of literals in the above : 1063760
% 1628.71/224.78 # Current number of archived formulas : 0
% 1628.71/224.78 # Current number of archived clauses : 507
% 1628.71/224.78 # Clause-clause subsumption calls (NU) : 0
% 1628.71/224.78 # Rec. Clause-clause subsumption calls : 0
% 1628.71/224.78 # Non-unit clause-clause subsumptions : 0
% 1628.71/224.78 # Unit Clause-clause subsumption calls : 5034
% 1628.71/224.78 # Rewrite failures with RHS unbound : 0
% 1628.71/224.78 # BW rewrite match attempts : 164503
% 1628.71/224.78 # BW rewrite match successes : 1303
% 1628.71/224.78 # Condensation attempts : 0
% 1628.71/224.78 # Condensation successes : 0
% 1628.71/224.78 # Termbank termtop insertions : 195336452
% 1628.71/224.78
% 1628.71/224.78 # -------------------------------------------------
% 1628.71/224.78 # User time : 772.064 s
% 1628.71/224.78 # System time : 11.262 s
% 1628.71/224.78 # Total time : 783.326 s
% 1628.71/224.78 # Maximum resident set size: 1592 pages
% 1628.71/224.78
% 1628.71/224.78 # -------------------------------------------------
% 1628.71/224.78 # User time : 944.117 s
% 1628.71/224.78 # System time : 14.646 s
% 1628.71/224.78 # Total time : 958.763 s
% 1628.71/224.78 # Maximum resident set size: 1688 pages
% 1628.71/224.78 % E---3.1 exiting
%------------------------------------------------------------------------------