TSTP Solution File: REL019-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : REL019-1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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:11 EDT 2023
% Result : Unsatisfiable 47.27s 6.65s
% Output : CNFRefutation 47.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 15
% Syntax : Number of clauses : 83 ( 83 unt; 0 nHn; 28 RR)
% Number of literals : 83 ( 82 equ; 3 neg)
% Maximal clause size : 1 ( 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 : 83 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(converse_multiplicativity_10,axiom,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
file('/export/starexec/sandbox2/tmp/tmp.95sGnOQaoL/E---3.1_31066.p',converse_multiplicativity_10) ).
cnf(composition_identity_6,axiom,
composition(X1,one) = X1,
file('/export/starexec/sandbox2/tmp/tmp.95sGnOQaoL/E---3.1_31066.p',composition_identity_6) ).
cnf(converse_idempotence_8,axiom,
converse(converse(X1)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.95sGnOQaoL/E---3.1_31066.p',converse_idempotence_8) ).
cnf(def_zero_13,axiom,
zero = meet(X1,complement(X1)),
file('/export/starexec/sandbox2/tmp/tmp.95sGnOQaoL/E---3.1_31066.p',def_zero_13) ).
cnf(maddux4_definiton_of_meet_4,axiom,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
file('/export/starexec/sandbox2/tmp/tmp.95sGnOQaoL/E---3.1_31066.p',maddux4_definiton_of_meet_4) ).
cnf(def_top_12,axiom,
top = join(X1,complement(X1)),
file('/export/starexec/sandbox2/tmp/tmp.95sGnOQaoL/E---3.1_31066.p',def_top_12) ).
cnf(converse_cancellativity_11,axiom,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
file('/export/starexec/sandbox2/tmp/tmp.95sGnOQaoL/E---3.1_31066.p',converse_cancellativity_11) ).
cnf(maddux1_join_commutativity_1,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.95sGnOQaoL/E---3.1_31066.p',maddux1_join_commutativity_1) ).
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/tmp/tmp.95sGnOQaoL/E---3.1_31066.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/sandbox2/tmp/tmp.95sGnOQaoL/E---3.1_31066.p',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/tmp/tmp.95sGnOQaoL/E---3.1_31066.p',composition_distributivity_7) ).
cnf(converse_additivity_9,axiom,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
file('/export/starexec/sandbox2/tmp/tmp.95sGnOQaoL/E---3.1_31066.p',converse_additivity_9) ).
cnf(goals_15,negated_conjecture,
composition(sk2,top) = sk2,
file('/export/starexec/sandbox2/tmp/tmp.95sGnOQaoL/E---3.1_31066.p',goals_15) ).
cnf(goals_14,negated_conjecture,
composition(sk1,top) = sk1,
file('/export/starexec/sandbox2/tmp/tmp.95sGnOQaoL/E---3.1_31066.p',goals_14) ).
cnf(goals_16,negated_conjecture,
composition(meet(sk1,sk2),top) != meet(sk1,sk2),
file('/export/starexec/sandbox2/tmp/tmp.95sGnOQaoL/E---3.1_31066.p',goals_16) ).
cnf(c_0_15,axiom,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
converse_multiplicativity_10 ).
cnf(c_0_16,axiom,
composition(X1,one) = X1,
composition_identity_6 ).
cnf(c_0_17,plain,
composition(converse(one),converse(X1)) = converse(X1),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_18,axiom,
converse(converse(X1)) = X1,
converse_idempotence_8 ).
cnf(c_0_19,axiom,
zero = meet(X1,complement(X1)),
def_zero_13 ).
cnf(c_0_20,axiom,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
maddux4_definiton_of_meet_4 ).
cnf(c_0_21,plain,
composition(converse(one),X1) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
zero = complement(join(complement(X1),complement(complement(X1)))),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,axiom,
top = join(X1,complement(X1)),
def_top_12 ).
cnf(c_0_24,axiom,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
converse_cancellativity_11 ).
cnf(c_0_25,axiom,
join(X1,X2) = join(X2,X1),
maddux1_join_commutativity_1 ).
cnf(c_0_26,plain,
converse(one) = one,
inference(spm,[status(thm)],[c_0_16,c_0_21]) ).
cnf(c_0_27,plain,
complement(top) = zero,
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,axiom,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
maddux3_a_kind_of_de_Morgan_3 ).
cnf(c_0_29,plain,
join(complement(X1),composition(converse(X2),complement(composition(X2,X1)))) = complement(X1),
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[c_0_21,c_0_26]) ).
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(top,zero) = top,
inference(spm,[status(thm)],[c_0_23,c_0_27]) ).
cnf(c_0_33,plain,
join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = X1,
inference(rw,[status(thm)],[c_0_28,c_0_25]) ).
cnf(c_0_34,plain,
join(complement(X1),complement(X1)) = complement(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_26]),c_0_30]) ).
cnf(c_0_35,plain,
join(X1,join(complement(X1),X2)) = join(top,X2),
inference(spm,[status(thm)],[c_0_31,c_0_23]) ).
cnf(c_0_36,axiom,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
composition_distributivity_7 ).
cnf(c_0_37,plain,
join(top,join(zero,X1)) = join(top,X1),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,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_34]),c_0_23]),c_0_27]),c_0_25]) ).
cnf(c_0_39,plain,
join(top,complement(X1)) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_34]),c_0_23]) ).
cnf(c_0_40,plain,
join(X1,composition(X2,X1)) = composition(join(X2,one),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_30]),c_0_25]) ).
cnf(c_0_41,plain,
join(top,X1) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]) ).
cnf(c_0_42,axiom,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
converse_additivity_9 ).
cnf(c_0_43,plain,
composition(join(X1,one),top) = top,
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_44,plain,
join(converse(X1),converse(complement(X1))) = converse(top),
inference(spm,[status(thm)],[c_0_42,c_0_23]) ).
cnf(c_0_45,plain,
composition(join(one,X1),top) = top,
inference(spm,[status(thm)],[c_0_43,c_0_25]) ).
cnf(c_0_46,plain,
join(one,converse(complement(one))) = converse(top),
inference(spm,[status(thm)],[c_0_44,c_0_26]) ).
cnf(c_0_47,plain,
composition(converse(top),top) = top,
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_48,plain,
converse(top) = top,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_47]),c_0_18]),c_0_47]) ).
cnf(c_0_49,plain,
join(zero,zero) = zero,
inference(spm,[status(thm)],[c_0_34,c_0_27]) ).
cnf(c_0_50,plain,
join(converse(X1),converse(complement(X1))) = top,
inference(rw,[status(thm)],[c_0_44,c_0_48]) ).
cnf(c_0_51,plain,
join(zero,join(zero,X1)) = join(zero,X1),
inference(spm,[status(thm)],[c_0_31,c_0_49]) ).
cnf(c_0_52,plain,
join(X1,converse(complement(converse(X1)))) = top,
inference(spm,[status(thm)],[c_0_50,c_0_18]) ).
cnf(c_0_53,plain,
join(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_51,c_0_38]) ).
cnf(c_0_54,plain,
join(X1,join(complement(X1),X2)) = top,
inference(rw,[status(thm)],[c_0_35,c_0_41]) ).
cnf(c_0_55,plain,
converse(complement(converse(zero))) = top,
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_56,plain,
join(complement(X1),join(X2,X1)) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_33]),c_0_31]) ).
cnf(c_0_57,negated_conjecture,
composition(sk2,top) = sk2,
goals_15 ).
cnf(c_0_58,plain,
complement(converse(zero)) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_55]),c_0_48]) ).
cnf(c_0_59,plain,
join(complement(X1),join(X1,X2)) = top,
inference(spm,[status(thm)],[c_0_56,c_0_25]) ).
cnf(c_0_60,negated_conjecture,
composition(converse(sk2),complement(sk2)) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_57]),c_0_27]),c_0_27]),c_0_53]) ).
cnf(c_0_61,plain,
converse(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_33,c_0_58]),c_0_41]),c_0_27]),c_0_41]),c_0_27]),c_0_53]) ).
cnf(c_0_62,plain,
join(complement(zero),X1) = top,
inference(spm,[status(thm)],[c_0_59,c_0_38]) ).
cnf(c_0_63,negated_conjecture,
composition(sk1,top) = sk1,
goals_14 ).
cnf(c_0_64,plain,
join(converse(complement(X1)),composition(converse(complement(composition(X2,X1))),X2)) = converse(complement(X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_29]),c_0_15]),c_0_18]) ).
cnf(c_0_65,negated_conjecture,
composition(converse(complement(sk2)),sk2) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_60]),c_0_61]),c_0_18]) ).
cnf(c_0_66,plain,
complement(zero) = top,
inference(spm,[status(thm)],[c_0_29,c_0_62]) ).
cnf(c_0_67,plain,
join(X1,composition(top,X1)) = composition(top,X1),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_68,negated_conjecture,
composition(converse(sk1),complement(sk1)) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_63]),c_0_27]),c_0_27]),c_0_53]) ).
cnf(c_0_69,negated_conjecture,
composition(top,converse(complement(sk2))) = converse(complement(sk2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66]),c_0_48]),c_0_67]) ).
cnf(c_0_70,negated_conjecture,
composition(converse(complement(sk1)),sk1) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_68]),c_0_61]),c_0_18]) ).
cnf(c_0_71,negated_conjecture,
composition(complement(sk2),top) = complement(sk2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_69]),c_0_18]),c_0_18]),c_0_48]) ).
cnf(c_0_72,negated_conjecture,
composition(top,converse(complement(sk1))) = converse(complement(sk1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_70]),c_0_66]),c_0_48]),c_0_67]) ).
cnf(c_0_73,plain,
composition(converse(complement(composition(X1,top))),X1) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_27]),c_0_61]),c_0_53]),c_0_61]) ).
cnf(c_0_74,negated_conjecture,
join(complement(sk2),composition(X1,top)) = composition(join(complement(sk2),X1),top),
inference(spm,[status(thm)],[c_0_36,c_0_71]) ).
cnf(c_0_75,negated_conjecture,
composition(complement(sk1),top) = complement(sk1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_72]),c_0_18]),c_0_18]),c_0_48]) ).
cnf(c_0_76,plain,
join(converse(X1),composition(converse(X1),top)) = composition(converse(X1),top),
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_67]),c_0_15]),c_0_15]),c_0_48]),c_0_48]) ).
cnf(c_0_77,negated_conjecture,
composition(meet(sk1,sk2),top) != meet(sk1,sk2),
goals_16 ).
cnf(c_0_78,plain,
join(complement(X1),composition(complement(composition(X1,top)),top)) = complement(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_73]),c_0_18]),c_0_66]) ).
cnf(c_0_79,negated_conjecture,
composition(join(complement(sk1),complement(sk2)),top) = join(complement(sk1),complement(sk2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_25]),c_0_25]) ).
cnf(c_0_80,plain,
join(X1,composition(X1,top)) = composition(X1,top),
inference(spm,[status(thm)],[c_0_76,c_0_18]) ).
cnf(c_0_81,negated_conjecture,
composition(complement(join(complement(sk1),complement(sk2))),top) != complement(join(complement(sk1),complement(sk2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_77,c_0_20]),c_0_20]) ).
cnf(c_0_82,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_80]),c_0_81]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : REL019-1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n028.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 15:34:52 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 0.20/0.49 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.95sGnOQaoL/E---3.1_31066.p
% 47.27/6.65 # Version: 3.1pre001
% 47.27/6.65 # Preprocessing class: FSMSSMSSSSSNFFN.
% 47.27/6.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 47.27/6.65 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 47.27/6.65 # Starting new_bool_3 with 300s (1) cores
% 47.27/6.65 # Starting new_bool_1 with 300s (1) cores
% 47.27/6.65 # Starting sh5l with 300s (1) cores
% 47.27/6.65 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 31144 completed with status 0
% 47.27/6.65 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 47.27/6.65 # Preprocessing class: FSMSSMSSSSSNFFN.
% 47.27/6.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 47.27/6.65 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 47.27/6.65 # No SInE strategy applied
% 47.27/6.65 # Search class: FUUPM-FFSF21-MFFFFFNN
% 47.27/6.65 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 47.27/6.65 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 47.27/6.65 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 47.27/6.65 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 47.27/6.65 # Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 47.27/6.65 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 47.27/6.65 # U----_043_B31_F1_PI_AE_CS_SP_S2S with pid 31154 completed with status 0
% 47.27/6.65 # Result found by U----_043_B31_F1_PI_AE_CS_SP_S2S
% 47.27/6.65 # Preprocessing class: FSMSSMSSSSSNFFN.
% 47.27/6.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 47.27/6.65 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 47.27/6.65 # No SInE strategy applied
% 47.27/6.65 # Search class: FUUPM-FFSF21-MFFFFFNN
% 47.27/6.65 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 47.27/6.65 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 47.27/6.65 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 47.27/6.65 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 47.27/6.65 # Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 47.27/6.65 # Preprocessing time : 0.001 s
% 47.27/6.65
% 47.27/6.65 # Proof found!
% 47.27/6.65 # SZS status Unsatisfiable
% 47.27/6.65 # SZS output start CNFRefutation
% See solution above
% 47.27/6.65 # Parsed axioms : 16
% 47.27/6.65 # Removed by relevancy pruning/SinE : 0
% 47.27/6.65 # Initial clauses : 16
% 47.27/6.65 # Removed in clause preprocessing : 1
% 47.27/6.65 # Initial clauses in saturation : 15
% 47.27/6.65 # Processed clauses : 8827
% 47.27/6.65 # ...of these trivial : 5448
% 47.27/6.65 # ...subsumed : 1778
% 47.27/6.65 # ...remaining for further processing : 1601
% 47.27/6.65 # Other redundant clauses eliminated : 0
% 47.27/6.65 # Clauses deleted for lack of memory : 0
% 47.27/6.65 # Backward-subsumed : 0
% 47.27/6.65 # Backward-rewritten : 317
% 47.27/6.65 # Generated clauses : 504747
% 47.27/6.65 # ...of the previous two non-redundant : 272735
% 47.27/6.65 # ...aggressively subsumed : 0
% 47.27/6.65 # Contextual simplify-reflections : 0
% 47.27/6.65 # Paramodulations : 504747
% 47.27/6.65 # Factorizations : 0
% 47.27/6.65 # NegExts : 0
% 47.27/6.65 # Equation resolutions : 0
% 47.27/6.65 # Total rewrite steps : 1126637
% 47.27/6.65 # Propositional unsat checks : 0
% 47.27/6.65 # Propositional check models : 0
% 47.27/6.65 # Propositional check unsatisfiable : 0
% 47.27/6.65 # Propositional clauses : 0
% 47.27/6.65 # Propositional clauses after purity: 0
% 47.27/6.65 # Propositional unsat core size : 0
% 47.27/6.65 # Propositional preprocessing time : 0.000
% 47.27/6.65 # Propositional encoding time : 0.000
% 47.27/6.65 # Propositional solver time : 0.000
% 47.27/6.65 # Success case prop preproc time : 0.000
% 47.27/6.65 # Success case prop encoding time : 0.000
% 47.27/6.65 # Success case prop solver time : 0.000
% 47.27/6.65 # Current number of processed clauses : 1284
% 47.27/6.65 # Positive orientable unit clauses : 1247
% 47.27/6.65 # Positive unorientable unit clauses: 36
% 47.27/6.65 # Negative unit clauses : 1
% 47.27/6.65 # Non-unit-clauses : 0
% 47.27/6.65 # Current number of unprocessed clauses: 262701
% 47.27/6.65 # ...number of literals in the above : 262701
% 47.27/6.65 # Current number of archived formulas : 0
% 47.27/6.65 # Current number of archived clauses : 318
% 47.27/6.65 # Clause-clause subsumption calls (NU) : 0
% 47.27/6.65 # Rec. Clause-clause subsumption calls : 0
% 47.27/6.65 # Non-unit clause-clause subsumptions : 0
% 47.27/6.65 # Unit Clause-clause subsumption calls : 132
% 47.27/6.65 # Rewrite failures with RHS unbound : 80
% 47.27/6.65 # BW rewrite match attempts : 7852
% 47.27/6.65 # BW rewrite match successes : 508
% 47.27/6.65 # Condensation attempts : 0
% 47.27/6.65 # Condensation successes : 0
% 47.27/6.65 # Termbank termtop insertions : 8151837
% 47.27/6.65
% 47.27/6.65 # -------------------------------------------------
% 47.27/6.65 # User time : 5.687 s
% 47.27/6.65 # System time : 0.203 s
% 47.27/6.65 # Total time : 5.890 s
% 47.27/6.65 # Maximum resident set size: 1568 pages
% 47.27/6.65
% 47.27/6.65 # -------------------------------------------------
% 47.27/6.65 # User time : 28.346 s
% 47.27/6.65 # System time : 1.053 s
% 47.27/6.65 # Total time : 29.399 s
% 47.27/6.65 # Maximum resident set size: 1676 pages
% 47.27/6.65 % E---3.1 exiting
%------------------------------------------------------------------------------