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

View Problem - Process Solution

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

% Computer : n029.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 : Sat May  4 08:34:43 EDT 2024

% Result   : Theorem 0.16s 0.50s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   80 (  61 unt;   0 def)
%            Number of atoms       :  107 (  42 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   50 (  23   ~;  19   |;   3   &)
%                                         (   1 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :  142 (  18 sgn  54   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(sos_03,axiom,
    ! [X1] : '+'(X1,'0') = X1,
    file('/export/starexec/sandbox2/tmp/tmp.EJmx4rPJ4Y/E---3.1_17275.p',sos_03) ).

fof(sos_02,axiom,
    ! [X1,X2] : '+'(X1,X2) = '+'(X2,X1),
    file('/export/starexec/sandbox2/tmp/tmp.EJmx4rPJ4Y/E---3.1_17275.p',sos_02) ).

fof(sos_07,axiom,
    ! [X9,X10,X11] :
      ( '>='('+'(X9,X10),X11)
    <=> '>='(X10,'==>'(X9,X11)) ),
    file('/export/starexec/sandbox2/tmp/tmp.EJmx4rPJ4Y/E---3.1_17275.p',sos_07) ).

fof(sos_09,axiom,
    ! [X12,X13,X14] :
      ( '>='(X12,X13)
     => '>='('+'(X12,X14),'+'(X13,X14)) ),
    file('/export/starexec/sandbox2/tmp/tmp.EJmx4rPJ4Y/E---3.1_17275.p',sos_09) ).

fof(sos_08,axiom,
    ! [X1] : '>='(X1,'0'),
    file('/export/starexec/sandbox2/tmp/tmp.EJmx4rPJ4Y/E---3.1_17275.p',sos_08) ).

fof(sos_04,axiom,
    ! [X1] : '>='(X1,X1),
    file('/export/starexec/sandbox2/tmp/tmp.EJmx4rPJ4Y/E---3.1_17275.p',sos_04) ).

fof(sos_06,axiom,
    ! [X7,X8] :
      ( ( '>='(X7,X8)
        & '>='(X8,X7) )
     => X7 = X8 ),
    file('/export/starexec/sandbox2/tmp/tmp.EJmx4rPJ4Y/E---3.1_17275.p',sos_06) ).

fof(sos_05,axiom,
    ! [X4,X5,X6] :
      ( ( '>='(X4,X5)
        & '>='(X5,X6) )
     => '>='(X4,X6) ),
    file('/export/starexec/sandbox2/tmp/tmp.EJmx4rPJ4Y/E---3.1_17275.p',sos_05) ).

fof(sos_13,axiom,
    ! [X1,X2] : '==>'('==>'(X1,X2),X2) = '==>'('==>'(X2,X1),X1),
    file('/export/starexec/sandbox2/tmp/tmp.EJmx4rPJ4Y/E---3.1_17275.p',sos_13) ).

fof(sos_14,axiom,
    ! [X1] : '+'(X1,X1) = X1,
    file('/export/starexec/sandbox2/tmp/tmp.EJmx4rPJ4Y/E---3.1_17275.p',sos_14) ).

fof(sos_12,axiom,
    ! [X1] : '+'(X1,'1') = '1',
    file('/export/starexec/sandbox2/tmp/tmp.EJmx4rPJ4Y/E---3.1_17275.p',sos_12) ).

fof(sos_01,axiom,
    ! [X1,X2,X3] : '+'('+'(X1,X2),X3) = '+'(X1,'+'(X2,X3)),
    file('/export/starexec/sandbox2/tmp/tmp.EJmx4rPJ4Y/E---3.1_17275.p',sos_01) ).

fof(sos_11,axiom,
    ! [X18,X19,X20] :
      ( '>='(X18,X19)
     => '>='('==>'(X20,X18),'==>'(X20,X19)) ),
    file('/export/starexec/sandbox2/tmp/tmp.EJmx4rPJ4Y/E---3.1_17275.p',sos_11) ).

fof(goals_15,conjecture,
    ! [X21] : '==>'('==>'('==>'(X21,'1'),X21),X21) = '0',
    file('/export/starexec/sandbox2/tmp/tmp.EJmx4rPJ4Y/E---3.1_17275.p',goals_15) ).

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

fof(c_0_15,plain,
    ! [X40,X41] : '+'(X40,X41) = '+'(X41,X40),
    inference(variable_rename,[status(thm)],[sos_02]) ).

fof(c_0_16,plain,
    ! [X25,X26,X27] :
      ( ( ~ '>='('+'(X25,X26),X27)
        | '>='(X26,'==>'(X25,X27)) )
      & ( ~ '>='(X26,'==>'(X25,X27))
        | '>='('+'(X25,X26),X27) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_07])])]) ).

fof(c_0_17,plain,
    ! [X42,X43,X44] :
      ( ~ '>='(X42,X43)
      | '>='('+'(X42,X44),'+'(X43,X44)) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_09])])]) ).

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

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

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

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

fof(c_0_22,plain,
    ! [X46] : '>='(X46,X46),
    inference(variable_rename,[status(thm)],[sos_04]) ).

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

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

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

fof(c_0_26,plain,
    ! [X50,X51] :
      ( ~ '>='(X50,X51)
      | ~ '>='(X51,X50)
      | X50 = X51 ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_06])])]) ).

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

fof(c_0_28,plain,
    ! [X47,X48,X49] :
      ( ~ '>='(X47,X48)
      | ~ '>='(X48,X49)
      | '>='(X47,X49) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_05])])]) ).

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

cnf(c_0_30,plain,
    '>='('+'(X1,X2),X2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).

fof(c_0_31,plain,
    ! [X34,X35] : '==>'('==>'(X34,X35),X35) = '==>'('==>'(X35,X34),X34),
    inference(variable_rename,[status(thm)],[sos_13]) ).

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

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

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

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

cnf(c_0_36,plain,
    '>='(X1,'==>'(X2,X1)),
    inference(spm,[status(thm)],[c_0_21,c_0_30]) ).

fof(c_0_37,plain,
    ! [X45] : '+'(X45,X45) = X45,
    inference(variable_rename,[status(thm)],[sos_14]) ).

cnf(c_0_38,plain,
    '==>'('==>'(X1,X2),X2) = '==>'('==>'(X2,X1),X1),
    inference(split_conjunct,[status(thm)],[c_0_31]) ).

cnf(c_0_39,plain,
    '==>'(X1,'0') = '0',
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_24])]) ).

cnf(c_0_40,plain,
    ( '0' = X1
    | ~ '>='('0',X1) ),
    inference(spm,[status(thm)],[c_0_32,c_0_24]) ).

cnf(c_0_41,plain,
    '>='(X1,'==>'(X2,X2)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_24])]) ).

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

cnf(c_0_43,plain,
    '+'(X1,X1) = X1,
    inference(split_conjunct,[status(thm)],[c_0_37]) ).

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

cnf(c_0_45,plain,
    '==>'('==>'('0',X1),X1) = '0',
    inference(spm,[status(thm)],[c_0_38,c_0_39]) ).

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

fof(c_0_47,plain,
    ! [X36] : '+'(X36,'1') = '1',
    inference(variable_rename,[status(thm)],[sos_12]) ).

cnf(c_0_48,plain,
    '>='(X1,'+'(X1,'==>'(X2,X1))),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_20]) ).

cnf(c_0_49,plain,
    '>='('+'(X1,X2),X1),
    inference(spm,[status(thm)],[c_0_30,c_0_20]) ).

cnf(c_0_50,plain,
    '>='('+'(X1,'==>'(X1,X2)),X2),
    inference(spm,[status(thm)],[c_0_44,c_0_29]) ).

cnf(c_0_51,plain,
    '>='('+'('==>'('0',X1),X2),X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_24])]) ).

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

cnf(c_0_53,plain,
    '+'(X1,'1') = '1',
    inference(split_conjunct,[status(thm)],[c_0_47]) ).

cnf(c_0_54,plain,
    '+'(X1,'==>'(X2,X1)) = X1,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_48]),c_0_49])]) ).

cnf(c_0_55,plain,
    '>='('0','==>'('+'(X1,'==>'(X1,X2)),X2)),
    inference(spm,[status(thm)],[c_0_27,c_0_50]) ).

cnf(c_0_56,plain,
    '>='('==>'('0',X1),X1),
    inference(spm,[status(thm)],[c_0_51,c_0_52]) ).

fof(c_0_57,plain,
    ! [X37,X38,X39] : '+'('+'(X37,X38),X39) = '+'(X37,'+'(X38,X39)),
    inference(variable_rename,[status(thm)],[sos_01]) ).

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

cnf(c_0_59,plain,
    '+'('1',X1) = '1',
    inference(spm,[status(thm)],[c_0_53,c_0_20]) ).

fof(c_0_60,negated_conjecture,
    ~ ! [X21] : '==>'('==>'('==>'(X21,'1'),X21),X21) = '0',
    inference(assume_negation,[status(cth)],[goals_15]) ).

cnf(c_0_61,plain,
    '>='(X1,'==>'(X2,'+'(X2,X1))),
    inference(spm,[status(thm)],[c_0_21,c_0_29]) ).

cnf(c_0_62,plain,
    '+'(X1,'==>'('==>'(X1,X2),X2)) = X1,
    inference(spm,[status(thm)],[c_0_54,c_0_38]) ).

cnf(c_0_63,plain,
    '==>'('+'(X1,'==>'(X1,X2)),X2) = '0',
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_55]),c_0_24])]) ).

cnf(c_0_64,plain,
    '==>'('0',X1) = X1,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_56]),c_0_36])]) ).

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

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

cnf(c_0_67,plain,
    '>='('1',X1),
    inference(spm,[status(thm)],[c_0_30,c_0_59]) ).

fof(c_0_68,negated_conjecture,
    '==>'('==>'('==>'(esk1_0,'1'),esk1_0),esk1_0) != '0',
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_60])])])]) ).

cnf(c_0_69,plain,
    ( '==>'(X1,'+'(X1,X2)) = X2
    | ~ '>='('==>'(X1,'+'(X1,X2)),X2) ),
    inference(spm,[status(thm)],[c_0_32,c_0_61]) ).

cnf(c_0_70,plain,
    '+'(X1,'==>'(X1,X2)) = '+'(X1,X2),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64]),c_0_65]),c_0_20]),c_0_54]) ).

cnf(c_0_71,plain,
    '>='('==>'(X1,'+'(X2,X3)),'==>'(X1,X3)),
    inference(spm,[status(thm)],[c_0_66,c_0_30]) ).

cnf(c_0_72,plain,
    '>='('==>'(X1,'1'),'==>'(X1,X2)),
    inference(spm,[status(thm)],[c_0_66,c_0_67]) ).

cnf(c_0_73,negated_conjecture,
    '==>'('==>'('==>'(esk1_0,'1'),esk1_0),esk1_0) != '0',
    inference(split_conjunct,[status(thm)],[c_0_68]) ).

cnf(c_0_74,plain,
    '==>'(X1,'+'(X1,X2)) = '==>'(X1,X2),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_71])]) ).

cnf(c_0_75,plain,
    '>='('0','==>'('==>'(X1,'1'),'==>'(X1,X2))),
    inference(spm,[status(thm)],[c_0_27,c_0_72]) ).

cnf(c_0_76,negated_conjecture,
    '==>'('==>'(esk1_0,'==>'(esk1_0,'1')),'==>'(esk1_0,'1')) != '0',
    inference(rw,[status(thm)],[c_0_73,c_0_38]) ).

cnf(c_0_77,plain,
    '==>'(X1,'==>'(X1,X2)) = '==>'(X1,X2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_70]),c_0_74]) ).

cnf(c_0_78,plain,
    '==>'('==>'(X1,'1'),'==>'(X1,X2)) = '0',
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_75]),c_0_24])]) ).

cnf(c_0_79,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_76,c_0_77]),c_0_78])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.10  % Problem    : LCL901+1 : TPTP v8.1.2. Released v5.5.0.
% 0.10/0.11  % Command    : run_E %s %d THM
% 0.10/0.31  % Computer : n029.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   : 300
% 0.10/0.31  % WCLimit    : 300
% 0.10/0.31  % DateTime   : Fri May  3 09:20:22 EDT 2024
% 0.10/0.31  % CPUTime    : 
% 0.16/0.42  Running first-order model finding
% 0.16/0.42  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.EJmx4rPJ4Y/E---3.1_17275.p
% 0.16/0.50  # Version: 3.1.0
% 0.16/0.50  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.50  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.16/0.50  # Starting new_bool_1 with 300s (1) cores
% 0.16/0.50  # Starting sh5l with 300s (1) cores
% 0.16/0.50  # new_bool_3 with pid 17354 completed with status 0
% 0.16/0.50  # Result found by new_bool_3
% 0.16/0.50  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.50  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.16/0.50  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.50  # Search class: FHUSM-FFSF22-MFFFFFNN
% 0.16/0.50  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.50  # Starting H----_042_B03_F1_AE_Q4_SP_S2S with 181s (1) cores
% 0.16/0.50  # H----_042_B03_F1_AE_Q4_SP_S2S with pid 17357 completed with status 0
% 0.16/0.50  # Result found by H----_042_B03_F1_AE_Q4_SP_S2S
% 0.16/0.50  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.50  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.16/0.50  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.50  # Search class: FHUSM-FFSF22-MFFFFFNN
% 0.16/0.50  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.50  # Starting H----_042_B03_F1_AE_Q4_SP_S2S with 181s (1) cores
% 0.16/0.50  # Preprocessing time       : 0.001 s
% 0.16/0.50  
% 0.16/0.50  # Proof found!
% 0.16/0.50  # SZS status Theorem
% 0.16/0.50  # SZS output start CNFRefutation
% See solution above
% 0.16/0.51  # Parsed axioms                        : 15
% 0.16/0.51  # Removed by relevancy pruning/SinE    : 0
% 0.16/0.51  # Initial clauses                      : 16
% 0.16/0.51  # Removed in clause preprocessing      : 0
% 0.16/0.51  # Initial clauses in saturation        : 16
% 0.16/0.51  # Processed clauses                    : 1478
% 0.16/0.51  # ...of these trivial                  : 237
% 0.16/0.51  # ...subsumed                          : 1012
% 0.16/0.51  # ...remaining for further processing  : 229
% 0.16/0.51  # Other redundant clauses eliminated   : 0
% 0.16/0.51  # Clauses deleted for lack of memory   : 0
% 0.16/0.51  # Backward-subsumed                    : 4
% 0.16/0.51  # Backward-rewritten                   : 79
% 0.16/0.51  # Generated clauses                    : 11060
% 0.16/0.51  # ...of the previous two non-redundant : 5509
% 0.16/0.51  # ...aggressively subsumed             : 0
% 0.16/0.51  # Contextual simplify-reflections      : 0
% 0.16/0.51  # Paramodulations                      : 11060
% 0.16/0.51  # Factorizations                       : 0
% 0.16/0.51  # NegExts                              : 0
% 0.16/0.51  # Equation resolutions                 : 0
% 0.16/0.51  # Disequality decompositions           : 0
% 0.16/0.51  # Total rewrite steps                  : 11811
% 0.16/0.51  # ...of those cached                   : 10191
% 0.16/0.51  # Propositional unsat checks           : 0
% 0.16/0.51  #    Propositional check models        : 0
% 0.16/0.51  #    Propositional check unsatisfiable : 0
% 0.16/0.51  #    Propositional clauses             : 0
% 0.16/0.51  #    Propositional clauses after purity: 0
% 0.16/0.51  #    Propositional unsat core size     : 0
% 0.16/0.51  #    Propositional preprocessing time  : 0.000
% 0.16/0.51  #    Propositional encoding time       : 0.000
% 0.16/0.51  #    Propositional solver time         : 0.000
% 0.16/0.51  #    Success case prop preproc time    : 0.000
% 0.16/0.51  #    Success case prop encoding time   : 0.000
% 0.16/0.51  #    Success case prop solver time     : 0.000
% 0.16/0.51  # Current number of processed clauses  : 146
% 0.16/0.51  #    Positive orientable unit clauses  : 91
% 0.16/0.51  #    Positive unorientable unit clauses: 7
% 0.16/0.51  #    Negative unit clauses             : 0
% 0.16/0.51  #    Non-unit-clauses                  : 48
% 0.16/0.51  # Current number of unprocessed clauses: 3800
% 0.16/0.51  # ...number of literals in the above   : 4674
% 0.16/0.51  # Current number of archived formulas  : 0
% 0.16/0.51  # Current number of archived clauses   : 83
% 0.16/0.51  # Clause-clause subsumption calls (NU) : 1652
% 0.16/0.51  # Rec. Clause-clause subsumption calls : 1652
% 0.16/0.51  # Non-unit clause-clause subsumptions  : 530
% 0.16/0.51  # Unit Clause-clause subsumption calls : 107
% 0.16/0.51  # Rewrite failures with RHS unbound    : 69
% 0.16/0.51  # BW rewrite match attempts            : 428
% 0.16/0.51  # BW rewrite match successes           : 114
% 0.16/0.51  # Condensation attempts                : 0
% 0.16/0.51  # Condensation successes               : 0
% 0.16/0.51  # Termbank termtop insertions          : 79352
% 0.16/0.51  # Search garbage collected termcells   : 113
% 0.16/0.51  
% 0.16/0.51  # -------------------------------------------------
% 0.16/0.51  # User time                : 0.070 s
% 0.16/0.51  # System time              : 0.006 s
% 0.16/0.51  # Total time               : 0.076 s
% 0.16/0.51  # Maximum resident set size: 1728 pages
% 0.16/0.51  
% 0.16/0.51  # -------------------------------------------------
% 0.16/0.51  # User time                : 0.072 s
% 0.16/0.51  # System time              : 0.007 s
% 0.16/0.51  # Total time               : 0.079 s
% 0.16/0.51  # Maximum resident set size: 1716 pages
% 0.16/0.51  % E---3.1 exiting
%------------------------------------------------------------------------------