TSTP Solution File: LCL021-1 by E-SAT---3.1

View Problem - Process Solution

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

% Computer : n009.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 18:23:28 EDT 2023

% Result   : Unsatisfiable 2.99s 0.82s
% Output   : CNFRefutation 2.99s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   39
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   69 (  21 unt;   0 nHn;  35 RR)
%            Number of literals    :  143 (   0 equ;  76 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :  188 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
    ( is_a_theorem(X2)
    | ~ is_a_theorem(equivalent(X1,X2))
    | ~ is_a_theorem(X1) ),
    file('/export/starexec/sandbox/tmp/tmp.ivEgCDnvRy/E---3.1_5687.p',condensed_detachment) ).

cnf(xhn,axiom,
    is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(equivalent(X3,X1),X2)))),
    file('/export/starexec/sandbox/tmp/tmp.ivEgCDnvRy/E---3.1_5687.p',xhn) ).

cnf(prove_xhk,negated_conjecture,
    ~ is_a_theorem(equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(a,c),b)))),
    file('/export/starexec/sandbox/tmp/tmp.ivEgCDnvRy/E---3.1_5687.p',prove_xhk) ).

cnf(c_0_3,axiom,
    ( is_a_theorem(X2)
    | ~ is_a_theorem(equivalent(X1,X2))
    | ~ is_a_theorem(X1) ),
    condensed_detachment ).

cnf(c_0_4,axiom,
    is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(equivalent(X3,X1),X2)))),
    xhn ).

cnf(c_0_5,plain,
    ( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X2,X3),X1)))
    | ~ is_a_theorem(X3) ),
    inference(spm,[status(thm)],[c_0_3,c_0_4]) ).

cnf(c_0_6,plain,
    ( is_a_theorem(equivalent(equivalent(X1,X2),X3))
    | ~ is_a_theorem(equivalent(X3,X1))
    | ~ is_a_theorem(X2) ),
    inference(spm,[status(thm)],[c_0_3,c_0_5]) ).

cnf(c_0_7,plain,
    ( is_a_theorem(X1)
    | ~ is_a_theorem(equivalent(X2,X3))
    | ~ is_a_theorem(equivalent(X1,X2))
    | ~ is_a_theorem(X3) ),
    inference(spm,[status(thm)],[c_0_3,c_0_6]) ).

cnf(c_0_8,plain,
    ( is_a_theorem(X1)
    | ~ is_a_theorem(equivalent(equivalent(X2,X3),equivalent(equivalent(X3,X4),X2)))
    | ~ is_a_theorem(equivalent(X1,X4)) ),
    inference(spm,[status(thm)],[c_0_7,c_0_4]) ).

cnf(c_0_9,plain,
    ( is_a_theorem(X1)
    | ~ is_a_theorem(equivalent(X1,X2))
    | ~ is_a_theorem(X2) ),
    inference(spm,[status(thm)],[c_0_8,c_0_5]) ).

cnf(c_0_10,plain,
    ( is_a_theorem(equivalent(X1,X2))
    | ~ is_a_theorem(equivalent(equivalent(X2,X3),X1))
    | ~ is_a_theorem(X3) ),
    inference(spm,[status(thm)],[c_0_9,c_0_5]) ).

cnf(c_0_11,plain,
    ( is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(equivalent(X2,equivalent(X3,X4)),X1)),X3))
    | ~ is_a_theorem(X4) ),
    inference(spm,[status(thm)],[c_0_10,c_0_4]) ).

cnf(c_0_12,plain,
    ( is_a_theorem(equivalent(X1,equivalent(X2,X3)))
    | ~ is_a_theorem(equivalent(equivalent(X3,equivalent(X1,X4)),X2))
    | ~ is_a_theorem(X4) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_13,plain,
    ( is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X2,equivalent(X4,X1))))
    | ~ is_a_theorem(X4)
    | ~ is_a_theorem(X3) ),
    inference(spm,[status(thm)],[c_0_12,c_0_11]) ).

cnf(c_0_14,plain,
    ( is_a_theorem(equivalent(X1,equivalent(equivalent(X1,equivalent(X2,X3)),X3)))
    | ~ is_a_theorem(X4)
    | ~ is_a_theorem(X2) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_15,plain,
    ( is_a_theorem(equivalent(X1,equivalent(equivalent(X1,equivalent(X2,X3)),X3)))
    | ~ is_a_theorem(X2) ),
    inference(spm,[status(thm)],[c_0_14,c_0_4]) ).

cnf(c_0_16,plain,
    ( is_a_theorem(X1)
    | ~ is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),X3))
    | ~ is_a_theorem(X2) ),
    inference(spm,[status(thm)],[c_0_9,c_0_15]) ).

cnf(c_0_17,plain,
    ( is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),X3))
    | ~ is_a_theorem(X1)
    | ~ is_a_theorem(X2) ),
    inference(spm,[status(thm)],[c_0_10,c_0_5]) ).

cnf(c_0_18,plain,
    ( is_a_theorem(equivalent(X1,X2))
    | ~ is_a_theorem(equivalent(X2,equivalent(X1,X3)))
    | ~ is_a_theorem(X3) ),
    inference(spm,[status(thm)],[c_0_16,c_0_11]) ).

cnf(c_0_19,plain,
    ( is_a_theorem(equivalent(equivalent(X1,X2),X3))
    | ~ is_a_theorem(X3)
    | ~ is_a_theorem(X1)
    | ~ is_a_theorem(X2) ),
    inference(spm,[status(thm)],[c_0_9,c_0_17]) ).

cnf(c_0_20,plain,
    ( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,X1)))
    | ~ is_a_theorem(X3)
    | ~ is_a_theorem(X2) ),
    inference(spm,[status(thm)],[c_0_18,c_0_5]) ).

cnf(c_0_21,plain,
    ( is_a_theorem(equivalent(X1,X2))
    | ~ is_a_theorem(X3)
    | ~ is_a_theorem(X1)
    | ~ is_a_theorem(X2) ),
    inference(spm,[status(thm)],[c_0_9,c_0_19]) ).

cnf(c_0_22,plain,
    ( is_a_theorem(equivalent(equivalent(X1,X2),X2))
    | ~ is_a_theorem(X3)
    | ~ is_a_theorem(X1) ),
    inference(spm,[status(thm)],[c_0_10,c_0_20]) ).

cnf(c_0_23,plain,
    ( is_a_theorem(X1)
    | ~ is_a_theorem(equivalent(equivalent(X2,X3),equivalent(equivalent(X3,X1),X2))) ),
    inference(spm,[status(thm)],[c_0_9,c_0_4]) ).

cnf(c_0_24,plain,
    ( is_a_theorem(equivalent(X1,X2))
    | ~ is_a_theorem(X1)
    | ~ is_a_theorem(X2) ),
    inference(spm,[status(thm)],[c_0_21,c_0_4]) ).

cnf(c_0_25,plain,
    ( is_a_theorem(equivalent(equivalent(X1,X2),X3))
    | ~ is_a_theorem(equivalent(equivalent(X2,X3),X1)) ),
    inference(spm,[status(thm)],[c_0_18,c_0_4]) ).

cnf(c_0_26,plain,
    ( is_a_theorem(equivalent(equivalent(X1,X2),X2))
    | ~ is_a_theorem(X1) ),
    inference(spm,[status(thm)],[c_0_22,c_0_4]) ).

cnf(c_0_27,plain,
    ( is_a_theorem(X1)
    | ~ is_a_theorem(equivalent(equivalent(X2,X1),X3))
    | ~ is_a_theorem(equivalent(X3,X2)) ),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_28,plain,
    ( is_a_theorem(equivalent(equivalent(X1,X2),X1))
    | ~ is_a_theorem(X2) ),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_29,plain,
    ( is_a_theorem(X1)
    | ~ is_a_theorem(equivalent(equivalent(equivalent(X2,X3),equivalent(equivalent(X3,equivalent(X4,X1)),X2)),X4)) ),
    inference(spm,[status(thm)],[c_0_27,c_0_4]) ).

cnf(c_0_30,plain,
    ( is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),X3))
    | ~ is_a_theorem(X1)
    | ~ is_a_theorem(X2) ),
    inference(spm,[status(thm)],[c_0_3,c_0_15]) ).

cnf(c_0_31,plain,
    ( is_a_theorem(equivalent(X1,X1))
    | ~ is_a_theorem(X2) ),
    inference(spm,[status(thm)],[c_0_10,c_0_28]) ).

cnf(c_0_32,plain,
    ( is_a_theorem(X1)
    | ~ is_a_theorem(equivalent(X2,equivalent(X3,X1)))
    | ~ is_a_theorem(equivalent(X3,X2)) ),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_33,plain,
    is_a_theorem(equivalent(X1,X1)),
    inference(spm,[status(thm)],[c_0_31,c_0_4]) ).

cnf(c_0_34,plain,
    ( is_a_theorem(equivalent(equivalent(X1,X2),X3))
    | ~ is_a_theorem(equivalent(equivalent(X3,X1),X2)) ),
    inference(spm,[status(thm)],[c_0_32,c_0_4]) ).

cnf(c_0_35,plain,
    ( is_a_theorem(X1)
    | ~ is_a_theorem(equivalent(X2,equivalent(X2,X1))) ),
    inference(spm,[status(thm)],[c_0_32,c_0_33]) ).

cnf(c_0_36,plain,
    ( is_a_theorem(equivalent(equivalent(X1,X1),X2))
    | ~ is_a_theorem(X2) ),
    inference(spm,[status(thm)],[c_0_34,c_0_26]) ).

cnf(c_0_37,plain,
    is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X1),X2)),
    inference(spm,[status(thm)],[c_0_25,c_0_33]) ).

cnf(c_0_38,plain,
    ( is_a_theorem(X1)
    | ~ is_a_theorem(equivalent(equivalent(X2,X2),X1)) ),
    inference(spm,[status(thm)],[c_0_35,c_0_36]) ).

cnf(c_0_39,plain,
    ( is_a_theorem(equivalent(X1,equivalent(X2,X1)))
    | ~ is_a_theorem(X2) ),
    inference(spm,[status(thm)],[c_0_10,c_0_37]) ).

cnf(c_0_40,plain,
    ( is_a_theorem(equivalent(X1,equivalent(X2,X2)))
    | ~ is_a_theorem(X1) ),
    inference(spm,[status(thm)],[c_0_38,c_0_39]) ).

cnf(c_0_41,plain,
    ( is_a_theorem(equivalent(equivalent(equivalent(X1,X1),X2),X3))
    | ~ is_a_theorem(equivalent(X2,X3)) ),
    inference(spm,[status(thm)],[c_0_25,c_0_40]) ).

cnf(c_0_42,plain,
    ( is_a_theorem(X1)
    | ~ is_a_theorem(equivalent(equivalent(equivalent(X2,equivalent(X3,X1)),X2),X3)) ),
    inference(spm,[status(thm)],[c_0_29,c_0_41]) ).

cnf(c_0_43,plain,
    ( is_a_theorem(equivalent(equivalent(X1,X2),X3))
    | ~ is_a_theorem(equivalent(X2,X3))
    | ~ is_a_theorem(X1) ),
    inference(spm,[status(thm)],[c_0_25,c_0_24]) ).

cnf(c_0_44,plain,
    ( is_a_theorem(X1)
    | ~ is_a_theorem(equivalent(X2,equivalent(X3,X1)))
    | ~ is_a_theorem(equivalent(X2,X3)) ),
    inference(spm,[status(thm)],[c_0_42,c_0_43]) ).

cnf(c_0_45,plain,
    ( is_a_theorem(equivalent(equivalent(X1,X2),X3))
    | ~ is_a_theorem(equivalent(X2,equivalent(X3,X1))) ),
    inference(spm,[status(thm)],[c_0_44,c_0_4]) ).

cnf(c_0_46,plain,
    ( is_a_theorem(equivalent(equivalent(X1,X2),X3))
    | ~ is_a_theorem(equivalent(X3,equivalent(X1,X2))) ),
    inference(spm,[status(thm)],[c_0_25,c_0_45]) ).

cnf(c_0_47,plain,
    is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(equivalent(X2,X3),X1)),X3)),
    inference(spm,[status(thm)],[c_0_46,c_0_4]) ).

cnf(c_0_48,plain,
    ( is_a_theorem(equivalent(X1,X2))
    | ~ is_a_theorem(equivalent(X2,X1)) ),
    inference(spm,[status(thm)],[c_0_16,c_0_47]) ).

cnf(c_0_49,plain,
    is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(equivalent(X3,X1),X2))),
    inference(spm,[status(thm)],[c_0_25,c_0_47]) ).

cnf(c_0_50,plain,
    is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(X2,equivalent(X3,X1)))),
    inference(spm,[status(thm)],[c_0_48,c_0_49]) ).

cnf(c_0_51,plain,
    is_a_theorem(equivalent(equivalent(X1,equivalent(X2,equivalent(X1,X3))),equivalent(X3,X2))),
    inference(spm,[status(thm)],[c_0_34,c_0_50]) ).

cnf(c_0_52,plain,
    ( is_a_theorem(equivalent(X1,X2))
    | ~ is_a_theorem(equivalent(equivalent(equivalent(X2,X3),X1),X3)) ),
    inference(spm,[status(thm)],[c_0_27,c_0_49]) ).

cnf(c_0_53,plain,
    is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,equivalent(X2,equivalent(X3,X1))))),
    inference(spm,[status(thm)],[c_0_48,c_0_51]) ).

cnf(c_0_54,plain,
    is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X2,equivalent(X3,X1)),X3)),X2)),
    inference(spm,[status(thm)],[c_0_52,c_0_51]) ).

cnf(c_0_55,plain,
    is_a_theorem(equivalent(equivalent(X1,equivalent(X2,equivalent(X1,equivalent(X2,X3)))),X3)),
    inference(spm,[status(thm)],[c_0_34,c_0_53]) ).

cnf(c_0_56,plain,
    ( is_a_theorem(equivalent(X1,equivalent(X2,X3)))
    | ~ is_a_theorem(equivalent(X2,equivalent(X3,X1))) ),
    inference(spm,[status(thm)],[c_0_32,c_0_53]) ).

cnf(c_0_57,plain,
    is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X1,equivalent(X3,X2)),X3))),
    inference(spm,[status(thm)],[c_0_25,c_0_54]) ).

cnf(c_0_58,plain,
    is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(X1,X3))),X2)),
    inference(spm,[status(thm)],[c_0_52,c_0_55]) ).

cnf(c_0_59,plain,
    is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(X2,equivalent(X1,X3))))),
    inference(spm,[status(thm)],[c_0_56,c_0_57]) ).

cnf(c_0_60,plain,
    ( is_a_theorem(equivalent(X1,equivalent(X2,X3)))
    | ~ is_a_theorem(equivalent(equivalent(X3,X1),X2)) ),
    inference(spm,[status(thm)],[c_0_10,c_0_47]) ).

cnf(c_0_61,plain,
    is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X1),X2)),X3)),
    inference(spm,[status(thm)],[c_0_52,c_0_58]) ).

cnf(c_0_62,plain,
    ( is_a_theorem(equivalent(X1,equivalent(X2,X3)))
    | ~ is_a_theorem(equivalent(equivalent(X1,X3),X2)) ),
    inference(spm,[status(thm)],[c_0_32,c_0_59]) ).

cnf(c_0_63,plain,
    is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X2,X3)),X2),equivalent(X1,X3))),
    inference(spm,[status(thm)],[c_0_60,c_0_54]) ).

cnf(c_0_64,plain,
    ( is_a_theorem(equivalent(X1,equivalent(X2,X3)))
    | ~ is_a_theorem(equivalent(equivalent(X1,X2),X3)) ),
    inference(spm,[status(thm)],[c_0_10,c_0_61]) ).

cnf(c_0_65,plain,
    is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(equivalent(X1,X3),X2))),
    inference(spm,[status(thm)],[c_0_62,c_0_63]) ).

cnf(c_0_66,negated_conjecture,
    ~ is_a_theorem(equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(a,c),b)))),
    prove_xhk ).

cnf(c_0_67,plain,
    is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(equivalent(X1,X3),X2)))),
    inference(spm,[status(thm)],[c_0_64,c_0_65]) ).

cnf(c_0_68,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_67])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.10  % Problem    : LCL021-1 : TPTP v8.1.2. Released v1.0.0.
% 0.01/0.11  % Command    : run_E %s %d THM
% 0.10/0.31  % Computer : n009.cluster.edu
% 0.10/0.31  % Model    : x86_64 x86_64
% 0.10/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31  % Memory   : 8042.1875MB
% 0.10/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31  % CPULimit   : 2400
% 0.10/0.31  % WCLimit    : 300
% 0.10/0.31  % DateTime   : Mon Oct  2 12:35:44 EDT 2023
% 0.10/0.31  % CPUTime    : 
% 0.16/0.40  Running first-order model finding
% 0.16/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.ivEgCDnvRy/E---3.1_5687.p
% 2.99/0.82  # Version: 3.1pre001
% 2.99/0.82  # Preprocessing class: FSSSSMSSSSSNFFN.
% 2.99/0.82  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.99/0.82  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.99/0.82  # Starting new_bool_3 with 300s (1) cores
% 2.99/0.82  # Starting new_bool_1 with 300s (1) cores
% 2.99/0.82  # Starting sh5l with 300s (1) cores
% 2.99/0.82  # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 5764 completed with status 0
% 2.99/0.82  # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 2.99/0.82  # Preprocessing class: FSSSSMSSSSSNFFN.
% 2.99/0.82  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.99/0.82  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.99/0.82  # No SInE strategy applied
% 2.99/0.82  # Search class: FHUNF-FFSF22-MFFFFFNN
% 2.99/0.82  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 2.99/0.82  # Starting G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with 811s (1) cores
% 2.99/0.82  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 2.99/0.82  # Starting new_bool_3 with 136s (1) cores
% 2.99/0.82  # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 2.99/0.82  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S00 with 136s (1) cores
% 2.99/0.82  # G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with pid 5768 completed with status 0
% 2.99/0.82  # Result found by G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y
% 2.99/0.82  # Preprocessing class: FSSSSMSSSSSNFFN.
% 2.99/0.82  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.99/0.82  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.99/0.82  # No SInE strategy applied
% 2.99/0.82  # Search class: FHUNF-FFSF22-MFFFFFNN
% 2.99/0.82  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 2.99/0.82  # Starting G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with 811s (1) cores
% 2.99/0.82  # Preprocessing time       : 0.001 s
% 2.99/0.82  
% 2.99/0.82  # Proof found!
% 2.99/0.82  # SZS status Unsatisfiable
% 2.99/0.82  # SZS output start CNFRefutation
% See solution above
% 2.99/0.82  # Parsed axioms                        : 3
% 2.99/0.82  # Removed by relevancy pruning/SinE    : 0
% 2.99/0.82  # Initial clauses                      : 3
% 2.99/0.82  # Removed in clause preprocessing      : 0
% 2.99/0.82  # Initial clauses in saturation        : 3
% 2.99/0.82  # Processed clauses                    : 6381
% 2.99/0.82  # ...of these trivial                  : 433
% 2.99/0.82  # ...subsumed                          : 5167
% 2.99/0.82  # ...remaining for further processing  : 781
% 2.99/0.82  # Other redundant clauses eliminated   : 0
% 2.99/0.82  # Clauses deleted for lack of memory   : 0
% 2.99/0.82  # Backward-subsumed                    : 4
% 2.99/0.82  # Backward-rewritten                   : 4
% 2.99/0.82  # Generated clauses                    : 52581
% 2.99/0.82  # ...of the previous two non-redundant : 32629
% 2.99/0.82  # ...aggressively subsumed             : 0
% 2.99/0.82  # Contextual simplify-reflections      : 0
% 2.99/0.82  # Paramodulations                      : 52581
% 2.99/0.82  # Factorizations                       : 0
% 2.99/0.82  # NegExts                              : 0
% 2.99/0.82  # Equation resolutions                 : 0
% 2.99/0.82  # Total rewrite steps                  : 21255
% 2.99/0.82  # Propositional unsat checks           : 0
% 2.99/0.82  #    Propositional check models        : 0
% 2.99/0.82  #    Propositional check unsatisfiable : 0
% 2.99/0.82  #    Propositional clauses             : 0
% 2.99/0.82  #    Propositional clauses after purity: 0
% 2.99/0.82  #    Propositional unsat core size     : 0
% 2.99/0.82  #    Propositional preprocessing time  : 0.000
% 2.99/0.82  #    Propositional encoding time       : 0.000
% 2.99/0.82  #    Propositional solver time         : 0.000
% 2.99/0.82  #    Success case prop preproc time    : 0.000
% 2.99/0.82  #    Success case prop encoding time   : 0.000
% 2.99/0.82  #    Success case prop solver time     : 0.000
% 2.99/0.82  # Current number of processed clauses  : 773
% 2.99/0.82  #    Positive orientable unit clauses  : 537
% 2.99/0.82  #    Positive unorientable unit clauses: 0
% 2.99/0.82  #    Negative unit clauses             : 0
% 2.99/0.82  #    Non-unit-clauses                  : 236
% 2.99/0.82  # Current number of unprocessed clauses: 26209
% 2.99/0.82  # ...number of literals in the above   : 56476
% 2.99/0.82  # Current number of archived formulas  : 0
% 2.99/0.82  # Current number of archived clauses   : 8
% 2.99/0.82  # Clause-clause subsumption calls (NU) : 78091
% 2.99/0.82  # Rec. Clause-clause subsumption calls : 77899
% 2.99/0.82  # Non-unit clause-clause subsumptions  : 5171
% 2.99/0.82  # Unit Clause-clause subsumption calls : 3288
% 2.99/0.82  # Rewrite failures with RHS unbound    : 0
% 2.99/0.82  # BW rewrite match attempts            : 115766
% 2.99/0.82  # BW rewrite match successes           : 4
% 2.99/0.82  # Condensation attempts                : 0
% 2.99/0.82  # Condensation successes               : 0
% 2.99/0.82  # Termbank termtop insertions          : 520577
% 2.99/0.82  
% 2.99/0.82  # -------------------------------------------------
% 2.99/0.82  # User time                : 0.389 s
% 2.99/0.82  # System time              : 0.015 s
% 2.99/0.82  # Total time               : 0.403 s
% 2.99/0.82  # Maximum resident set size: 1576 pages
% 2.99/0.82  
% 2.99/0.82  # -------------------------------------------------
% 2.99/0.82  # User time                : 1.956 s
% 2.99/0.82  # System time              : 0.051 s
% 2.99/0.82  # Total time               : 2.007 s
% 2.99/0.82  # Maximum resident set size: 1672 pages
% 2.99/0.82  % E---3.1 exiting
%------------------------------------------------------------------------------