TSTP Solution File: REL016-2 by E-SAT---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1
% Problem  : REL016-2 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n013.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:08 EDT 2023

% Result   : Unsatisfiable 27.31s 3.98s
% Output   : CNFRefutation 27.31s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   26
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   66 (  62 unt;   0 nHn;   9 RR)
%            Number of literals    :   70 (  69 equ;   8 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :   10 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   4 con; 0-2 aty)
%            Number of variables   :  105 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
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.Kp7OeFCBtA/E---3.1_14377.p',maddux3_a_kind_of_de_Morgan_3) ).

cnf(maddux1_join_commutativity_1,axiom,
    join(X1,X2) = join(X2,X1),
    file('/export/starexec/sandbox2/tmp/tmp.Kp7OeFCBtA/E---3.1_14377.p',maddux1_join_commutativity_1) ).

cnf(def_zero_13,axiom,
    zero = meet(X1,complement(X1)),
    file('/export/starexec/sandbox2/tmp/tmp.Kp7OeFCBtA/E---3.1_14377.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.Kp7OeFCBtA/E---3.1_14377.p',maddux4_definiton_of_meet_4) ).

cnf(maddux2_join_associativity_2,axiom,
    join(X1,join(X2,X3)) = join(join(X1,X2),X3),
    file('/export/starexec/sandbox2/tmp/tmp.Kp7OeFCBtA/E---3.1_14377.p',maddux2_join_associativity_2) ).

cnf(converse_additivity_9,axiom,
    converse(join(X1,X2)) = join(converse(X1),converse(X2)),
    file('/export/starexec/sandbox2/tmp/tmp.Kp7OeFCBtA/E---3.1_14377.p',converse_additivity_9) ).

cnf(composition_distributivity_7,axiom,
    composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
    file('/export/starexec/sandbox2/tmp/tmp.Kp7OeFCBtA/E---3.1_14377.p',composition_distributivity_7) ).

cnf(converse_multiplicativity_10,axiom,
    converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
    file('/export/starexec/sandbox2/tmp/tmp.Kp7OeFCBtA/E---3.1_14377.p',converse_multiplicativity_10) ).

cnf(converse_idempotence_8,axiom,
    converse(converse(X1)) = X1,
    file('/export/starexec/sandbox2/tmp/tmp.Kp7OeFCBtA/E---3.1_14377.p',converse_idempotence_8) ).

cnf(goals_14,negated_conjecture,
    ( join(meet(composition(sk1,sk2),complement(composition(sk1,sk3))),meet(composition(sk1,meet(sk2,complement(sk3))),complement(composition(sk1,sk3)))) != meet(composition(sk1,meet(sk2,complement(sk3))),complement(composition(sk1,sk3)))
    | join(meet(composition(sk1,meet(sk2,complement(sk3))),complement(composition(sk1,sk3))),meet(composition(sk1,sk2),complement(composition(sk1,sk3)))) != meet(composition(sk1,sk2),complement(composition(sk1,sk3))) ),
    file('/export/starexec/sandbox2/tmp/tmp.Kp7OeFCBtA/E---3.1_14377.p',goals_14) ).

cnf(c_0_10,axiom,
    X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
    maddux3_a_kind_of_de_Morgan_3 ).

cnf(c_0_11,axiom,
    join(X1,X2) = join(X2,X1),
    maddux1_join_commutativity_1 ).

cnf(c_0_12,axiom,
    zero = meet(X1,complement(X1)),
    def_zero_13 ).

cnf(c_0_13,axiom,
    meet(X1,X2) = complement(join(complement(X1),complement(X2))),
    maddux4_definiton_of_meet_4 ).

cnf(c_0_14,plain,
    join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = X1,
    inference(rw,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_15,plain,
    complement(join(complement(X1),complement(complement(X1)))) = zero,
    inference(rw,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_16,axiom,
    join(X1,join(X2,X3)) = join(join(X1,X2),X3),
    maddux2_join_associativity_2 ).

cnf(c_0_17,plain,
    join(zero,complement(join(complement(X1),complement(X1)))) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_11]) ).

cnf(c_0_18,plain,
    complement(join(zero,complement(zero))) = zero,
    inference(spm,[status(thm)],[c_0_15,c_0_15]) ).

cnf(c_0_19,plain,
    join(X1,join(X2,X3)) = join(X2,join(X1,X3)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_11]),c_0_16]) ).

cnf(c_0_20,plain,
    join(zero,complement(join(zero,zero))) = join(zero,complement(zero)),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_21,plain,
    join(zero,join(X1,complement(join(complement(X2),complement(X2))))) = join(X1,X2),
    inference(spm,[status(thm)],[c_0_19,c_0_17]) ).

cnf(c_0_22,plain,
    join(zero,join(complement(join(zero,zero)),X1)) = join(zero,join(complement(zero),X1)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_20]),c_0_16]) ).

cnf(c_0_23,plain,
    join(complement(join(zero,zero)),X1) = join(complement(zero),X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_21]) ).

cnf(c_0_24,plain,
    join(zero,zero) = zero,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_23]),c_0_23]),c_0_14]) ).

cnf(c_0_25,plain,
    join(zero,join(zero,X1)) = join(zero,X1),
    inference(spm,[status(thm)],[c_0_16,c_0_24]) ).

cnf(c_0_26,plain,
    join(zero,X1) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_25]),c_0_17]) ).

cnf(c_0_27,plain,
    complement(join(complement(X1),complement(X1))) = X1,
    inference(rw,[status(thm)],[c_0_17,c_0_26]) ).

cnf(c_0_28,plain,
    join(complement(X1),complement(complement(X1))) = join(zero,complement(zero)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_15]),c_0_20]) ).

cnf(c_0_29,plain,
    join(complement(X1),complement(X1)) = complement(join(X1,X1)),
    inference(spm,[status(thm)],[c_0_27,c_0_27]) ).

cnf(c_0_30,plain,
    join(complement(X1),complement(complement(X1))) = complement(zero),
    inference(rw,[status(thm)],[c_0_28,c_0_26]) ).

cnf(c_0_31,plain,
    complement(complement(join(X1,X1))) = X1,
    inference(rw,[status(thm)],[c_0_27,c_0_29]) ).

cnf(c_0_32,plain,
    join(X1,complement(X1)) = complement(zero),
    inference(spm,[status(thm)],[c_0_30,c_0_31]) ).

cnf(c_0_33,plain,
    join(X1,complement(join(X1,X1))) = complement(zero),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_31]),c_0_11]) ).

cnf(c_0_34,plain,
    complement(complement(zero)) = zero,
    inference(rw,[status(thm)],[c_0_18,c_0_26]) ).

cnf(c_0_35,plain,
    join(X1,zero) = X1,
    inference(spm,[status(thm)],[c_0_11,c_0_26]) ).

cnf(c_0_36,plain,
    complement(join(complement(X1),complement(join(X1,X1)))) = X1,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_33]),c_0_29]),c_0_34]),c_0_35]) ).

cnf(c_0_37,plain,
    join(complement(X1),complement(zero)) = complement(zero),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_36]),c_0_16]),c_0_11]),c_0_33]) ).

cnf(c_0_38,plain,
    complement(complement(X1)) = X1,
    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_14,c_0_37]),c_0_34]),c_0_34]),c_0_11]),c_0_26]),c_0_26]) ).

cnf(c_0_39,plain,
    join(X1,X1) = X1,
    inference(rw,[status(thm)],[c_0_31,c_0_38]) ).

cnf(c_0_40,plain,
    join(X1,join(X1,X2)) = join(X1,X2),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_39]),c_0_16]),c_0_39]) ).

cnf(c_0_41,plain,
    join(X1,join(X2,X3)) = join(X3,join(X1,X2)),
    inference(spm,[status(thm)],[c_0_11,c_0_16]) ).

cnf(c_0_42,plain,
    join(complement(join(complement(X1),X2)),join(complement(join(complement(X1),complement(X2))),X3)) = join(X1,X3),
    inference(spm,[status(thm)],[c_0_16,c_0_14]) ).

cnf(c_0_43,plain,
    join(complement(join(X1,complement(X2))),complement(join(complement(X2),complement(X1)))) = X2,
    inference(spm,[status(thm)],[c_0_14,c_0_11]) ).

cnf(c_0_44,axiom,
    converse(join(X1,X2)) = join(converse(X1),converse(X2)),
    converse_additivity_9 ).

cnf(c_0_45,axiom,
    composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
    composition_distributivity_7 ).

cnf(c_0_46,axiom,
    converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
    converse_multiplicativity_10 ).

cnf(c_0_47,plain,
    join(X1,complement(join(complement(X1),X2))) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_14]),c_0_11]) ).

cnf(c_0_48,plain,
    join(X1,join(X2,X1)) = join(X2,X1),
    inference(spm,[status(thm)],[c_0_41,c_0_39]) ).

cnf(c_0_49,plain,
    join(X1,complement(join(complement(X2),X1))) = join(X2,complement(join(complement(X1),X2))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_38]),c_0_11]) ).

cnf(c_0_50,plain,
    join(composition(converse(X1),converse(X2)),composition(converse(X1),converse(X3))) = composition(converse(X1),join(converse(X2),converse(X3))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]),c_0_44]),c_0_46]),c_0_46]) ).

cnf(c_0_51,axiom,
    converse(converse(X1)) = X1,
    converse_idempotence_8 ).

cnf(c_0_52,plain,
    join(X1,complement(join(X2,complement(X1)))) = X1,
    inference(spm,[status(thm)],[c_0_47,c_0_48]) ).

cnf(c_0_53,plain,
    join(X1,complement(join(complement(X2),X1))) = join(X2,complement(join(X2,complement(X1)))),
    inference(spm,[status(thm)],[c_0_49,c_0_11]) ).

cnf(c_0_54,plain,
    join(composition(X1,converse(X2)),composition(X1,converse(X3))) = composition(X1,join(converse(X2),converse(X3))),
    inference(spm,[status(thm)],[c_0_50,c_0_51]) ).

cnf(c_0_55,plain,
    join(complement(X1),complement(join(X2,X1))) = complement(X1),
    inference(spm,[status(thm)],[c_0_52,c_0_38]) ).

cnf(c_0_56,plain,
    join(X1,complement(join(X2,complement(join(X2,X1))))) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_53]),c_0_38]) ).

cnf(c_0_57,plain,
    join(composition(X1,converse(X2)),composition(X1,X3)) = composition(X1,join(converse(X2),X3)),
    inference(spm,[status(thm)],[c_0_54,c_0_51]) ).

cnf(c_0_58,negated_conjecture,
    ( join(meet(composition(sk1,sk2),complement(composition(sk1,sk3))),meet(composition(sk1,meet(sk2,complement(sk3))),complement(composition(sk1,sk3)))) != meet(composition(sk1,meet(sk2,complement(sk3))),complement(composition(sk1,sk3)))
    | join(meet(composition(sk1,meet(sk2,complement(sk3))),complement(composition(sk1,sk3))),meet(composition(sk1,sk2),complement(composition(sk1,sk3)))) != meet(composition(sk1,sk2),complement(composition(sk1,sk3))) ),
    goals_14 ).

cnf(c_0_59,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_55,c_0_56]),c_0_38]),c_0_16]),c_0_11]),c_0_55]),c_0_38]) ).

cnf(c_0_60,plain,
    join(composition(X1,X2),composition(X1,X3)) = composition(X1,join(X2,X3)),
    inference(spm,[status(thm)],[c_0_57,c_0_51]) ).

cnf(c_0_61,negated_conjecture,
    ( join(complement(join(complement(composition(sk1,sk2)),complement(complement(composition(sk1,sk3))))),complement(join(complement(complement(composition(sk1,sk3))),complement(composition(sk1,complement(join(complement(sk2),complement(complement(sk3))))))))) != complement(join(complement(complement(composition(sk1,sk3))),complement(composition(sk1,complement(join(complement(sk2),complement(complement(sk3))))))))
    | join(complement(join(complement(composition(sk1,sk2)),complement(complement(composition(sk1,sk3))))),complement(join(complement(complement(composition(sk1,sk3))),complement(composition(sk1,complement(join(complement(sk2),complement(complement(sk3))))))))) != complement(join(complement(composition(sk1,sk2)),complement(complement(composition(sk1,sk3))))) ),
    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)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_11]),c_0_13]),c_0_13]),c_0_13]),c_0_11]),c_0_13]),c_0_13]),c_0_11]),c_0_13]),c_0_13]),c_0_13]),c_0_11]),c_0_13]) ).

cnf(c_0_62,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_59,c_0_60]) ).

cnf(c_0_63,negated_conjecture,
    ( join(complement(join(composition(sk1,sk3),complement(composition(sk1,sk2)))),complement(join(composition(sk1,sk3),complement(composition(sk1,complement(join(sk3,complement(sk2)))))))) != complement(join(composition(sk1,sk3),complement(composition(sk1,complement(join(sk3,complement(sk2)))))))
    | join(complement(join(composition(sk1,sk3),complement(composition(sk1,sk2)))),complement(join(composition(sk1,sk3),complement(composition(sk1,complement(join(sk3,complement(sk2)))))))) != complement(join(composition(sk1,sk3),complement(composition(sk1,sk2)))) ),
    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)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_38]),c_0_38]),c_0_38]),c_0_38]),c_0_38]),c_0_38]),c_0_38]),c_0_11]),c_0_11]),c_0_11]),c_0_11]),c_0_11]),c_0_11]) ).

cnf(c_0_64,plain,
    join(composition(X1,X2),complement(composition(X1,complement(join(X2,X3))))) = join(composition(X1,X2),complement(composition(X1,complement(X3)))),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_59]),c_0_62]) ).

cnf(c_0_65,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)],[c_0_63,c_0_64]),c_0_38]),c_0_39]),c_0_64]),c_0_38]),c_0_64]),c_0_38]),c_0_39])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : REL016-2 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.14  % Command    : run_E %s %d THM
% 0.13/0.35  % Computer : n013.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 2400
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Mon Oct  2 15:05:59 EDT 2023
% 0.13/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.Kp7OeFCBtA/E---3.1_14377.p
% 27.31/3.98  # Version: 3.1pre001
% 27.31/3.98  # Preprocessing class: FSMSSMSSSSSNFFN.
% 27.31/3.98  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 27.31/3.98  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 27.31/3.98  # Starting new_bool_3 with 300s (1) cores
% 27.31/3.98  # Starting new_bool_1 with 300s (1) cores
% 27.31/3.98  # Starting sh5l with 300s (1) cores
% 27.31/3.98  # sh5l with pid 14457 completed with status 0
% 27.31/3.98  # Result found by sh5l
% 27.31/3.98  # Preprocessing class: FSMSSMSSSSSNFFN.
% 27.31/3.98  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 27.31/3.98  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 27.31/3.98  # Starting new_bool_3 with 300s (1) cores
% 27.31/3.98  # Starting new_bool_1 with 300s (1) cores
% 27.31/3.98  # Starting sh5l with 300s (1) cores
% 27.31/3.98  # SinE strategy is gf500_gu_R04_F100_L20000
% 27.31/3.98  # Search class: FUHPM-FFSF21-MFFFFFNN
% 27.31/3.98  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 27.31/3.98  # Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 163s (1) cores
% 27.31/3.98  # H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with pid 14463 completed with status 0
% 27.31/3.98  # Result found by H----_047_B31_F1_PI_AE_R4_CS_SP_S2S
% 27.31/3.98  # Preprocessing class: FSMSSMSSSSSNFFN.
% 27.31/3.98  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 27.31/3.98  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 27.31/3.98  # Starting new_bool_3 with 300s (1) cores
% 27.31/3.98  # Starting new_bool_1 with 300s (1) cores
% 27.31/3.98  # Starting sh5l with 300s (1) cores
% 27.31/3.98  # SinE strategy is gf500_gu_R04_F100_L20000
% 27.31/3.98  # Search class: FUHPM-FFSF21-MFFFFFNN
% 27.31/3.98  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 27.31/3.98  # Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 163s (1) cores
% 27.31/3.98  # Preprocessing time       : 0.001 s
% 27.31/3.98  
% 27.31/3.98  # Proof found!
% 27.31/3.98  # SZS status Unsatisfiable
% 27.31/3.98  # SZS output start CNFRefutation
% See solution above
% 27.31/3.98  # Parsed axioms                        : 14
% 27.31/3.98  # Removed by relevancy pruning/SinE    : 2
% 27.31/3.98  # Initial clauses                      : 12
% 27.31/3.98  # Removed in clause preprocessing      : 0
% 27.31/3.98  # Initial clauses in saturation        : 12
% 27.31/3.98  # Processed clauses                    : 9670
% 27.31/3.98  # ...of these trivial                  : 5257
% 27.31/3.98  # ...subsumed                          : 3711
% 27.31/3.98  # ...remaining for further processing  : 702
% 27.31/3.98  # Other redundant clauses eliminated   : 0
% 27.31/3.98  # Clauses deleted for lack of memory   : 0
% 27.31/3.98  # Backward-subsumed                    : 0
% 27.31/3.98  # Backward-rewritten                   : 99
% 27.31/3.98  # Generated clauses                    : 299353
% 27.31/3.98  # ...of the previous two non-redundant : 196918
% 27.31/3.98  # ...aggressively subsumed             : 0
% 27.31/3.98  # Contextual simplify-reflections      : 0
% 27.31/3.98  # Paramodulations                      : 299353
% 27.31/3.98  # Factorizations                       : 0
% 27.31/3.98  # NegExts                              : 0
% 27.31/3.98  # Equation resolutions                 : 0
% 27.31/3.98  # Total rewrite steps                  : 718428
% 27.31/3.98  # Propositional unsat checks           : 0
% 27.31/3.98  #    Propositional check models        : 0
% 27.31/3.98  #    Propositional check unsatisfiable : 0
% 27.31/3.98  #    Propositional clauses             : 0
% 27.31/3.98  #    Propositional clauses after purity: 0
% 27.31/3.98  #    Propositional unsat core size     : 0
% 27.31/3.98  #    Propositional preprocessing time  : 0.000
% 27.31/3.98  #    Propositional encoding time       : 0.000
% 27.31/3.98  #    Propositional solver time         : 0.000
% 27.31/3.98  #    Success case prop preproc time    : 0.000
% 27.31/3.98  #    Success case prop encoding time   : 0.000
% 27.31/3.98  #    Success case prop solver time     : 0.000
% 27.31/3.98  # Current number of processed clauses  : 603
% 27.31/3.98  #    Positive orientable unit clauses  : 567
% 27.31/3.98  #    Positive unorientable unit clauses: 35
% 27.31/3.98  #    Negative unit clauses             : 0
% 27.31/3.98  #    Non-unit-clauses                  : 1
% 27.31/3.98  # Current number of unprocessed clauses: 185660
% 27.31/3.98  # ...number of literals in the above   : 185660
% 27.31/3.98  # Current number of archived formulas  : 0
% 27.31/3.98  # Current number of archived clauses   : 99
% 27.31/3.98  # Clause-clause subsumption calls (NU) : 2
% 27.31/3.98  # Rec. Clause-clause subsumption calls : 2
% 27.31/3.98  # Non-unit clause-clause subsumptions  : 1
% 27.31/3.98  # Unit Clause-clause subsumption calls : 266
% 27.31/3.98  # Rewrite failures with RHS unbound    : 1281
% 27.31/3.98  # BW rewrite match attempts            : 6874
% 27.31/3.98  # BW rewrite match successes           : 858
% 27.31/3.98  # Condensation attempts                : 0
% 27.31/3.98  # Condensation successes               : 0
% 27.31/3.98  # Termbank termtop insertions          : 5786783
% 27.31/3.98  
% 27.31/3.98  # -------------------------------------------------
% 27.31/3.98  # User time                : 3.140 s
% 27.31/3.98  # System time              : 0.186 s
% 27.31/3.98  # Total time               : 3.325 s
% 27.31/3.98  # Maximum resident set size: 1616 pages
% 27.31/3.98  
% 27.31/3.98  # -------------------------------------------------
% 27.31/3.98  # User time                : 3.140 s
% 27.31/3.98  # System time              : 0.189 s
% 27.31/3.98  # Total time               : 3.329 s
% 27.31/3.98  # Maximum resident set size: 1676 pages
% 27.31/3.98  % E---3.1 exiting
%------------------------------------------------------------------------------