TSTP Solution File: LCL889+1 by E-SAT---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1.00
% Problem  : LCL889+1 : TPTP v8.2.0. Released v5.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n020.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 : 300s
% WCLimit  : 300s
% DateTime : Tue May 21 00:04:02 EDT 2024

% Result   : Theorem 62.22s 8.35s
% Output   : CNFRefutation 62.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   76 (  54 unt;   0 def)
%            Number of atoms       :  109 (  34 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   55 (  22   ~;  19   |;   7   &)
%                                         (   1 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   2 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :  130 (  21 sgn  52   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(sos_03,axiom,
    ! [X1] : '+'(X1,'0') = X1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_03) ).

fof(sos_02,axiom,
    ! [X1,X2] : '+'(X1,X2) = '+'(X2,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_02) ).

fof(sos_06,axiom,
    ! [X7,X8] :
      ( ( '>='(X7,X8)
        & '>='(X8,X7) )
     => X7 = X8 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_06) ).

fof(sos_08,axiom,
    ! [X1] : '>='(X1,'0'),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_08) ).

fof(sos_07,axiom,
    ! [X9,X10,X11] :
      ( '>='('+'(X9,X10),X11)
    <=> '>='(X10,'==>'(X9,X11)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_07) ).

fof(sos_10,axiom,
    ! [X15,X16,X17] :
      ( '>='(X15,X16)
     => '>='('==>'(X16,X17),'==>'(X15,X17)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_10) ).

fof(goals_13,conjecture,
    ! [X21,X22,X23] :
      ( ( '>='(X21,'==>'(X21,X22))
        & X23 = '==>'(X23,X22) )
     => '>='(X21,X23) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals_13) ).

fof(sos_12,axiom,
    ! [X1,X2] : '+'(X1,'==>'(X1,X2)) = '+'(X2,'==>'(X2,X1)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_12) ).

fof(sos_09,axiom,
    ! [X12,X13,X14] :
      ( '>='(X12,X13)
     => '>='('+'(X12,X14),'+'(X13,X14)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_09) ).

fof(sos_01,axiom,
    ! [X1,X2,X3] : '+'('+'(X1,X2),X3) = '+'(X1,'+'(X2,X3)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_01) ).

fof(sos_05,axiom,
    ! [X4,X5,X6] :
      ( ( '>='(X4,X5)
        & '>='(X5,X6) )
     => '>='(X4,X6) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_05) ).

fof(c_0_11,plain,
    ! [X29] : '+'(X29,'0') = X29,
    inference(variable_rename,[status(thm)],[sos_03]) ).

fof(c_0_12,plain,
    ! [X27,X28] : '+'(X27,X28) = '+'(X28,X27),
    inference(variable_rename,[status(thm)],[sos_02]) ).

fof(c_0_13,plain,
    ! [X34,X35] :
      ( ~ '>='(X34,X35)
      | ~ '>='(X35,X34)
      | X34 = X35 ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_06])])]) ).

fof(c_0_14,plain,
    ! [X39] : '>='(X39,'0'),
    inference(variable_rename,[status(thm)],[sos_08]) ).

fof(c_0_15,plain,
    ! [X36,X37,X38] :
      ( ( ~ '>='('+'(X36,X37),X38)
        | '>='(X37,'==>'(X36,X38)) )
      & ( ~ '>='(X37,'==>'(X36,X38))
        | '>='('+'(X36,X37),X38) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_07])])]) ).

fof(c_0_16,plain,
    ! [X43,X44,X45] :
      ( ~ '>='(X43,X44)
      | '>='('==>'(X44,X45),'==>'(X43,X45)) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_10])])]) ).

fof(c_0_17,negated_conjecture,
    ~ ! [X21,X22,X23] :
        ( ( '>='(X21,'==>'(X21,X22))
          & X23 = '==>'(X23,X22) )
       => '>='(X21,X23) ),
    inference(assume_negation,[status(cth)],[goals_13]) ).

cnf(c_0_18,plain,
    '+'(X1,'0') = X1,
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_19,plain,
    '+'(X1,X2) = '+'(X2,X1),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

fof(c_0_20,plain,
    ! [X49,X50] : '+'(X49,'==>'(X49,X50)) = '+'(X50,'==>'(X50,X49)),
    inference(variable_rename,[status(thm)],[sos_12]) ).

cnf(c_0_21,plain,
    ( X1 = X2
    | ~ '>='(X1,X2)
    | ~ '>='(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_22,plain,
    '>='(X1,'0'),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_23,plain,
    ( '>='(X2,'==>'(X1,X3))
    | ~ '>='('+'(X1,X2),X3) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_24,plain,
    ( '>='('==>'(X2,X3),'==>'(X1,X3))
    | ~ '>='(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

fof(c_0_25,negated_conjecture,
    ( '>='(esk1_0,'==>'(esk1_0,esk2_0))
    & esk3_0 = '==>'(esk3_0,esk2_0)
    & ~ '>='(esk1_0,esk3_0) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])]) ).

cnf(c_0_26,plain,
    '+'('0',X1) = X1,
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_27,plain,
    '+'(X1,'==>'(X1,X2)) = '+'(X2,'==>'(X2,X1)),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_28,plain,
    ( '0' = X1
    | ~ '>='('0',X1) ),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_29,plain,
    '>='(X1,'==>'(X2,'0')),
    inference(spm,[status(thm)],[c_0_23,c_0_22]) ).

fof(c_0_30,plain,
    ! [X40,X41,X42] :
      ( ~ '>='(X40,X41)
      | '>='('+'(X40,X42),'+'(X41,X42)) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_09])])]) ).

cnf(c_0_31,plain,
    '>='('==>'('0',X1),'==>'(X2,X1)),
    inference(spm,[status(thm)],[c_0_24,c_0_22]) ).

cnf(c_0_32,negated_conjecture,
    esk3_0 = '==>'(esk3_0,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_25]) ).

cnf(c_0_33,plain,
    '+'(X1,'==>'(X1,'0')) = '==>'('0',X1),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_34,plain,
    '==>'(X1,'0') = '0',
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_35,plain,
    ( '>='('+'(X1,X3),'+'(X2,X3))
    | ~ '>='(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_30]) ).

fof(c_0_36,plain,
    ! [X24,X25,X26] : '+'('+'(X24,X25),X26) = '+'(X24,'+'(X25,X26)),
    inference(variable_rename,[status(thm)],[sos_01]) ).

fof(c_0_37,plain,
    ! [X31,X32,X33] :
      ( ~ '>='(X31,X32)
      | ~ '>='(X32,X33)
      | '>='(X31,X33) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_05])])]) ).

cnf(c_0_38,negated_conjecture,
    '>='('==>'('0',esk2_0),esk3_0),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_39,plain,
    '==>'('0',X1) = X1,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34]),c_0_18]) ).

cnf(c_0_40,plain,
    '>='('+'(X1,X2),X2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_22]),c_0_26]) ).

cnf(c_0_41,plain,
    '+'('+'(X1,X2),X3) = '+'(X1,'+'(X2,X3)),
    inference(split_conjunct,[status(thm)],[c_0_36]) ).

cnf(c_0_42,plain,
    ( '>='(X1,X3)
    | ~ '>='(X1,X2)
    | ~ '>='(X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_37]) ).

cnf(c_0_43,negated_conjecture,
    '>='(esk1_0,'==>'(esk1_0,esk2_0)),
    inference(split_conjunct,[status(thm)],[c_0_25]) ).

cnf(c_0_44,negated_conjecture,
    '>='(esk2_0,esk3_0),
    inference(rw,[status(thm)],[c_0_38,c_0_39]) ).

cnf(c_0_45,plain,
    '>='('+'(X1,X2),X1),
    inference(spm,[status(thm)],[c_0_40,c_0_19]) ).

cnf(c_0_46,plain,
    '+'(X1,'+'('==>'(X1,'0'),X2)) = '+'('==>'('0',X1),X2),
    inference(spm,[status(thm)],[c_0_41,c_0_33]) ).

cnf(c_0_47,negated_conjecture,
    ( '>='(X1,'==>'(esk1_0,esk2_0))
    | ~ '>='(X1,esk1_0) ),
    inference(spm,[status(thm)],[c_0_42,c_0_43]) ).

cnf(c_0_48,negated_conjecture,
    ( '>='(X1,esk3_0)
    | ~ '>='(X1,esk2_0) ),
    inference(spm,[status(thm)],[c_0_42,c_0_44]) ).

cnf(c_0_49,plain,
    '>='('+'('==>'('0',X1),X2),X1),
    inference(spm,[status(thm)],[c_0_45,c_0_46]) ).

cnf(c_0_50,plain,
    ( '>='('+'(X2,X1),X3)
    | ~ '>='(X1,'==>'(X2,X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_51,negated_conjecture,
    '>='('+'(X1,esk1_0),'==>'(esk1_0,esk2_0)),
    inference(spm,[status(thm)],[c_0_47,c_0_40]) ).

cnf(c_0_52,negated_conjecture,
    '>='('+'(esk2_0,X1),esk3_0),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_39]) ).

cnf(c_0_53,negated_conjecture,
    '>='('+'(esk1_0,'+'(X1,esk1_0)),esk2_0),
    inference(spm,[status(thm)],[c_0_50,c_0_51]) ).

cnf(c_0_54,plain,
    '+'(X1,'+'('==>'(X1,X2),X3)) = '+'(X2,'+'('==>'(X2,X1),X3)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_27]),c_0_41]) ).

cnf(c_0_55,negated_conjecture,
    '>='(X1,'==>'(esk2_0,esk3_0)),
    inference(spm,[status(thm)],[c_0_23,c_0_52]) ).

cnf(c_0_56,negated_conjecture,
    '>='('+'(X1,'+'(esk1_0,'==>'(X1,esk1_0))),esk2_0),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_19]) ).

cnf(c_0_57,negated_conjecture,
    '==>'(esk2_0,esk3_0) = '0',
    inference(spm,[status(thm)],[c_0_28,c_0_55]) ).

cnf(c_0_58,plain,
    '>='('+'(X1,'+'(X2,X3)),X3),
    inference(spm,[status(thm)],[c_0_40,c_0_41]) ).

cnf(c_0_59,negated_conjecture,
    '>='('+'(esk1_0,'==>'(X1,esk1_0)),'==>'(X1,esk2_0)),
    inference(spm,[status(thm)],[c_0_23,c_0_56]) ).

cnf(c_0_60,negated_conjecture,
    '+'(esk3_0,esk3_0) = esk2_0,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_57]),c_0_18]),c_0_32]) ).

cnf(c_0_61,plain,
    '>='('+'(X1,'+'(X2,X3)),X2),
    inference(spm,[status(thm)],[c_0_58,c_0_19]) ).

cnf(c_0_62,negated_conjecture,
    '>='('+'(esk1_0,'==>'(esk3_0,esk1_0)),esk3_0),
    inference(spm,[status(thm)],[c_0_59,c_0_32]) ).

cnf(c_0_63,negated_conjecture,
    '+'(esk3_0,'+'(esk3_0,X1)) = '+'(esk2_0,X1),
    inference(spm,[status(thm)],[c_0_41,c_0_60]) ).

cnf(c_0_64,plain,
    '>='('+'(X1,X2),'==>'(X3,X1)),
    inference(spm,[status(thm)],[c_0_23,c_0_61]) ).

cnf(c_0_65,negated_conjecture,
    '>='('==>'(esk3_0,esk1_0),'==>'(esk1_0,esk3_0)),
    inference(spm,[status(thm)],[c_0_23,c_0_62]) ).

cnf(c_0_66,negated_conjecture,
    '+'(esk3_0,'+'(X1,esk3_0)) = '+'(esk2_0,X1),
    inference(spm,[status(thm)],[c_0_63,c_0_19]) ).

cnf(c_0_67,plain,
    '>='(X1,'==>'(X2,'==>'(X3,X2))),
    inference(spm,[status(thm)],[c_0_23,c_0_64]) ).

cnf(c_0_68,negated_conjecture,
    '>='('+'('==>'(esk3_0,esk1_0),X1),'+'('==>'(esk1_0,esk3_0),X1)),
    inference(spm,[status(thm)],[c_0_35,c_0_65]) ).

cnf(c_0_69,negated_conjecture,
    '+'(X1,'+'(esk3_0,'==>'(X1,esk3_0))) = '+'(esk2_0,'==>'(esk3_0,X1)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_54]),c_0_19]) ).

cnf(c_0_70,plain,
    '==>'(X1,'==>'(X2,X1)) = '0',
    inference(spm,[status(thm)],[c_0_28,c_0_67]) ).

cnf(c_0_71,plain,
    '+'(X1,'+'(X2,X3)) = '+'(X2,'+'(X3,X1)),
    inference(spm,[status(thm)],[c_0_41,c_0_19]) ).

cnf(c_0_72,plain,
    '+'(X1,'+'('==>'(X1,X2),'==>'('==>'(X2,X1),X3))) = '+'(X2,'+'(X3,'==>'(X3,'==>'(X2,X1)))),
    inference(spm,[status(thm)],[c_0_54,c_0_27]) ).

cnf(c_0_73,negated_conjecture,
    '>='('+'(esk3_0,esk1_0),esk2_0),
    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_68,c_0_69]),c_0_70]),c_0_18]),c_0_71]),c_0_19]),c_0_72]),c_0_70]),c_0_18]),c_0_19]) ).

cnf(c_0_74,negated_conjecture,
    ~ '>='(esk1_0,esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_25]) ).

cnf(c_0_75,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_73]),c_0_32]),c_0_74]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem    : LCL889+1 : TPTP v8.2.0. Released v5.5.0.
% 0.03/0.12  % Command    : run_E %s %d THM
% 0.12/0.33  % Computer : n020.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Mon May 20 00:57:37 EDT 2024
% 0.12/0.33  % CPUTime    : 
% 0.18/0.45  Running first-order model finding
% 0.18/0.45  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/benchmark/theBenchmark.p
% 62.22/8.35  # Version: 3.1.0
% 62.22/8.35  # Preprocessing class: FSMSSMSSSSSNFFN.
% 62.22/8.35  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 62.22/8.35  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 62.22/8.35  # Starting new_bool_3 with 300s (1) cores
% 62.22/8.35  # Starting new_bool_1 with 300s (1) cores
% 62.22/8.35  # Starting sh5l with 300s (1) cores
% 62.22/8.35  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2367 completed with status 0
% 62.22/8.35  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 62.22/8.35  # Preprocessing class: FSMSSMSSSSSNFFN.
% 62.22/8.35  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 62.22/8.35  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 62.22/8.35  # No SInE strategy applied
% 62.22/8.35  # Search class: FHUSM-FFSF22-SFFFFFNN
% 62.22/8.35  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 62.22/8.35  # Starting G----_Y1346__C12_02_nc_F1_AE_CS_SP_S2S with 811s (1) cores
% 62.22/8.35  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 62.22/8.35  # Starting new_bool_3 with 136s (1) cores
% 62.22/8.35  # Starting new_bool_1 with 136s (1) cores
% 62.22/8.35  # Starting sh5l with 136s (1) cores
% 62.22/8.35  # G----_Y1346__C12_02_nc_F1_AE_CS_SP_S2S with pid 2373 completed with status 0
% 62.22/8.35  # Result found by G----_Y1346__C12_02_nc_F1_AE_CS_SP_S2S
% 62.22/8.35  # Preprocessing class: FSMSSMSSSSSNFFN.
% 62.22/8.35  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 62.22/8.35  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 62.22/8.35  # No SInE strategy applied
% 62.22/8.35  # Search class: FHUSM-FFSF22-SFFFFFNN
% 62.22/8.35  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 62.22/8.35  # Starting G----_Y1346__C12_02_nc_F1_AE_CS_SP_S2S with 811s (1) cores
% 62.22/8.35  # Preprocessing time       : 0.001 s
% 62.22/8.35  # Presaturation interreduction done
% 62.22/8.35  
% 62.22/8.35  # Proof found!
% 62.22/8.35  # SZS status Theorem
% 62.22/8.35  # SZS output start CNFRefutation
% See solution above
% 62.22/8.35  # Parsed axioms                        : 13
% 62.22/8.35  # Removed by relevancy pruning/SinE    : 0
% 62.22/8.35  # Initial clauses                      : 16
% 62.22/8.35  # Removed in clause preprocessing      : 0
% 62.22/8.35  # Initial clauses in saturation        : 16
% 62.22/8.35  # Processed clauses                    : 17852
% 62.22/8.35  # ...of these trivial                  : 9286
% 62.22/8.35  # ...subsumed                          : 4198
% 62.22/8.35  # ...remaining for further processing  : 4368
% 62.22/8.35  # Other redundant clauses eliminated   : 0
% 62.22/8.35  # Clauses deleted for lack of memory   : 0
% 62.22/8.35  # Backward-subsumed                    : 4
% 62.22/8.35  # Backward-rewritten                   : 859
% 62.22/8.35  # Generated clauses                    : 778815
% 62.22/8.35  # ...of the previous two non-redundant : 437601
% 62.22/8.35  # ...aggressively subsumed             : 0
% 62.22/8.35  # Contextual simplify-reflections      : 0
% 62.22/8.35  # Paramodulations                      : 778815
% 62.22/8.35  # Factorizations                       : 0
% 62.22/8.35  # NegExts                              : 0
% 62.22/8.35  # Equation resolutions                 : 0
% 62.22/8.35  # Disequality decompositions           : 0
% 62.22/8.35  # Total rewrite steps                  : 1054687
% 62.22/8.35  # ...of those cached                   : 925399
% 62.22/8.35  # Propositional unsat checks           : 0
% 62.22/8.35  #    Propositional check models        : 0
% 62.22/8.35  #    Propositional check unsatisfiable : 0
% 62.22/8.35  #    Propositional clauses             : 0
% 62.22/8.35  #    Propositional clauses after purity: 0
% 62.22/8.35  #    Propositional unsat core size     : 0
% 62.22/8.35  #    Propositional preprocessing time  : 0.000
% 62.22/8.35  #    Propositional encoding time       : 0.000
% 62.22/8.35  #    Propositional solver time         : 0.000
% 62.22/8.35  #    Success case prop preproc time    : 0.000
% 62.22/8.35  #    Success case prop encoding time   : 0.000
% 62.22/8.35  #    Success case prop solver time     : 0.000
% 62.22/8.35  # Current number of processed clauses  : 3489
% 62.22/8.35  #    Positive orientable unit clauses  : 3262
% 62.22/8.35  #    Positive unorientable unit clauses: 37
% 62.22/8.35  #    Negative unit clauses             : 1
% 62.22/8.35  #    Non-unit-clauses                  : 189
% 62.22/8.35  # Current number of unprocessed clauses: 417795
% 62.22/8.35  # ...number of literals in the above   : 451198
% 62.22/8.35  # Current number of archived formulas  : 0
% 62.22/8.35  # Current number of archived clauses   : 879
% 62.22/8.35  # Clause-clause subsumption calls (NU) : 9356
% 62.22/8.35  # Rec. Clause-clause subsumption calls : 9356
% 62.22/8.35  # Non-unit clause-clause subsumptions  : 3656
% 62.22/8.35  # Unit Clause-clause subsumption calls : 344
% 62.22/8.35  # Rewrite failures with RHS unbound    : 0
% 62.22/8.35  # BW rewrite match attempts            : 73102
% 62.22/8.35  # BW rewrite match successes           : 1228
% 62.22/8.35  # Condensation attempts                : 0
% 62.22/8.35  # Condensation successes               : 0
% 62.22/8.35  # Termbank termtop insertions          : 11045582
% 62.22/8.35  # Search garbage collected termcells   : 144
% 62.22/8.35  
% 62.22/8.35  # -------------------------------------------------
% 62.22/8.35  # User time                : 7.433 s
% 62.22/8.35  # System time              : 0.319 s
% 62.22/8.35  # Total time               : 7.752 s
% 62.22/8.35  # Maximum resident set size: 1740 pages
% 62.22/8.35  
% 62.22/8.35  # -------------------------------------------------
% 62.22/8.35  # User time                : 38.071 s
% 62.22/8.35  # System time              : 0.648 s
% 62.22/8.35  # Total time               : 38.719 s
% 62.22/8.35  # Maximum resident set size: 1720 pages
% 62.22/8.35  % E---3.1 exiting
%------------------------------------------------------------------------------