TSTP Solution File: SET721+4 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : SET721+4 : TPTP v8.2.0. Bugfixed v2.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n026.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 02:55:26 EDT 2024

% Result   : Theorem 0.20s 0.54s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   36 (  10 unt;   0 def)
%            Number of atoms       :  199 (  14 equ)
%            Maximal formula atoms :   55 (   5 avg)
%            Number of connectives :  252 (  89   ~; 111   |;  41   &)
%                                         (   3 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   30 (   6 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :   15 (  15 usr;   5 con; 0-7 aty)
%            Number of variables   :  118 (   0 sgn  58   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(thII12,conjecture,
    ! [X6,X10,X1,X2,X11] :
      ( ( maps(X6,X1,X2)
        & maps(X10,X2,X11)
        & injective(compose_function(X10,X6,X1,X2,X11),X1,X11) )
     => injective(X6,X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thII12) ).

fof(maps,axiom,
    ! [X6,X1,X2] :
      ( maps(X6,X1,X2)
    <=> ( ! [X3] :
            ( member(X3,X1)
           => ? [X5] :
                ( member(X5,X2)
                & apply(X6,X3,X5) ) )
        & ! [X3,X7,X8] :
            ( ( member(X3,X1)
              & member(X7,X2)
              & member(X8,X2) )
           => ( ( apply(X6,X3,X7)
                & apply(X6,X3,X8) )
             => X7 = X8 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET006+1.ax',maps) ).

fof(injective,axiom,
    ! [X6,X1,X2] :
      ( injective(X6,X1,X2)
    <=> ! [X13,X14,X5] :
          ( ( member(X13,X1)
            & member(X14,X1)
            & member(X5,X2) )
         => ( ( apply(X6,X13,X5)
              & apply(X6,X14,X5) )
           => X13 = X14 ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET006+1.ax',injective) ).

fof(compose_function,axiom,
    ! [X10,X6,X1,X2,X11,X3,X12] :
      ( ( member(X3,X1)
        & member(X12,X11) )
     => ( apply(compose_function(X10,X6,X1,X2,X11),X3,X12)
      <=> ? [X5] :
            ( member(X5,X2)
            & apply(X6,X3,X5)
            & apply(X10,X5,X12) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET006+1.ax',compose_function) ).

fof(c_0_4,negated_conjecture,
    ~ ! [X6,X10,X1,X2,X11] :
        ( ( maps(X6,X1,X2)
          & maps(X10,X2,X11)
          & injective(compose_function(X10,X6,X1,X2,X11),X1,X11) )
       => injective(X6,X1,X2) ),
    inference(assume_negation,[status(cth)],[thII12]) ).

fof(c_0_5,plain,
    ! [X46,X47,X48,X49,X51,X52,X53,X54,X55,X56,X58] :
      ( ( member(esk10_4(X46,X47,X48,X49),X48)
        | ~ member(X49,X47)
        | ~ maps(X46,X47,X48) )
      & ( apply(X46,X49,esk10_4(X46,X47,X48,X49))
        | ~ member(X49,X47)
        | ~ maps(X46,X47,X48) )
      & ( ~ member(X51,X47)
        | ~ member(X52,X48)
        | ~ member(X53,X48)
        | ~ apply(X46,X51,X52)
        | ~ apply(X46,X51,X53)
        | X52 = X53
        | ~ maps(X46,X47,X48) )
      & ( member(esk12_3(X54,X55,X56),X55)
        | member(esk11_3(X54,X55,X56),X55)
        | maps(X54,X55,X56) )
      & ( member(esk13_3(X54,X55,X56),X56)
        | member(esk11_3(X54,X55,X56),X55)
        | maps(X54,X55,X56) )
      & ( member(esk14_3(X54,X55,X56),X56)
        | member(esk11_3(X54,X55,X56),X55)
        | maps(X54,X55,X56) )
      & ( apply(X54,esk12_3(X54,X55,X56),esk13_3(X54,X55,X56))
        | member(esk11_3(X54,X55,X56),X55)
        | maps(X54,X55,X56) )
      & ( apply(X54,esk12_3(X54,X55,X56),esk14_3(X54,X55,X56))
        | member(esk11_3(X54,X55,X56),X55)
        | maps(X54,X55,X56) )
      & ( esk13_3(X54,X55,X56) != esk14_3(X54,X55,X56)
        | member(esk11_3(X54,X55,X56),X55)
        | maps(X54,X55,X56) )
      & ( member(esk12_3(X54,X55,X56),X55)
        | ~ member(X58,X56)
        | ~ apply(X54,esk11_3(X54,X55,X56),X58)
        | maps(X54,X55,X56) )
      & ( member(esk13_3(X54,X55,X56),X56)
        | ~ member(X58,X56)
        | ~ apply(X54,esk11_3(X54,X55,X56),X58)
        | maps(X54,X55,X56) )
      & ( member(esk14_3(X54,X55,X56),X56)
        | ~ member(X58,X56)
        | ~ apply(X54,esk11_3(X54,X55,X56),X58)
        | maps(X54,X55,X56) )
      & ( apply(X54,esk12_3(X54,X55,X56),esk13_3(X54,X55,X56))
        | ~ member(X58,X56)
        | ~ apply(X54,esk11_3(X54,X55,X56),X58)
        | maps(X54,X55,X56) )
      & ( apply(X54,esk12_3(X54,X55,X56),esk14_3(X54,X55,X56))
        | ~ member(X58,X56)
        | ~ apply(X54,esk11_3(X54,X55,X56),X58)
        | maps(X54,X55,X56) )
      & ( esk13_3(X54,X55,X56) != esk14_3(X54,X55,X56)
        | ~ member(X58,X56)
        | ~ apply(X54,esk11_3(X54,X55,X56),X58)
        | maps(X54,X55,X56) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[maps])])])])])])]) ).

fof(c_0_6,negated_conjecture,
    ( maps(esk1_0,esk3_0,esk4_0)
    & maps(esk2_0,esk4_0,esk5_0)
    & injective(compose_function(esk2_0,esk1_0,esk3_0,esk4_0,esk5_0),esk3_0,esk5_0)
    & ~ injective(esk1_0,esk3_0,esk4_0) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).

fof(c_0_7,plain,
    ! [X22,X23,X24,X25,X26,X27,X28,X29,X30] :
      ( ( ~ injective(X22,X23,X24)
        | ~ member(X25,X23)
        | ~ member(X26,X23)
        | ~ member(X27,X24)
        | ~ apply(X22,X25,X27)
        | ~ apply(X22,X26,X27)
        | X25 = X26 )
      & ( member(esk6_3(X28,X29,X30),X29)
        | injective(X28,X29,X30) )
      & ( member(esk7_3(X28,X29,X30),X29)
        | injective(X28,X29,X30) )
      & ( member(esk8_3(X28,X29,X30),X30)
        | injective(X28,X29,X30) )
      & ( apply(X28,esk6_3(X28,X29,X30),esk8_3(X28,X29,X30))
        | injective(X28,X29,X30) )
      & ( apply(X28,esk7_3(X28,X29,X30),esk8_3(X28,X29,X30))
        | injective(X28,X29,X30) )
      & ( esk6_3(X28,X29,X30) != esk7_3(X28,X29,X30)
        | injective(X28,X29,X30) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[injective])])])])])])]) ).

fof(c_0_8,plain,
    ! [X37,X38,X39,X40,X41,X42,X43,X45] :
      ( ( member(esk9_7(X37,X38,X39,X40,X41,X42,X43),X40)
        | ~ apply(compose_function(X37,X38,X39,X40,X41),X42,X43)
        | ~ member(X42,X39)
        | ~ member(X43,X41) )
      & ( apply(X38,X42,esk9_7(X37,X38,X39,X40,X41,X42,X43))
        | ~ apply(compose_function(X37,X38,X39,X40,X41),X42,X43)
        | ~ member(X42,X39)
        | ~ member(X43,X41) )
      & ( apply(X37,esk9_7(X37,X38,X39,X40,X41,X42,X43),X43)
        | ~ apply(compose_function(X37,X38,X39,X40,X41),X42,X43)
        | ~ member(X42,X39)
        | ~ member(X43,X41) )
      & ( ~ member(X45,X40)
        | ~ apply(X38,X42,X45)
        | ~ apply(X37,X45,X43)
        | apply(compose_function(X37,X38,X39,X40,X41),X42,X43)
        | ~ member(X42,X39)
        | ~ member(X43,X41) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[compose_function])])])])])]) ).

cnf(c_0_9,plain,
    ( apply(X1,X2,esk10_4(X1,X3,X4,X2))
    | ~ member(X2,X3)
    | ~ maps(X1,X3,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_10,negated_conjecture,
    maps(esk2_0,esk4_0,esk5_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_11,plain,
    ( X4 = X5
    | ~ injective(X1,X2,X3)
    | ~ member(X4,X2)
    | ~ member(X5,X2)
    | ~ member(X6,X3)
    | ~ apply(X1,X4,X6)
    | ~ apply(X1,X5,X6) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_12,negated_conjecture,
    injective(compose_function(esk2_0,esk1_0,esk3_0,esk4_0,esk5_0),esk3_0,esk5_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_13,plain,
    ( apply(compose_function(X5,X3,X7,X2,X8),X4,X6)
    | ~ member(X1,X2)
    | ~ apply(X3,X4,X1)
    | ~ apply(X5,X1,X6)
    | ~ member(X4,X7)
    | ~ member(X6,X8) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_14,negated_conjecture,
    ( apply(esk2_0,X1,esk10_4(esk2_0,esk4_0,esk5_0,X1))
    | ~ member(X1,esk4_0) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_15,plain,
    ( member(esk10_4(X1,X2,X3,X4),X3)
    | ~ member(X4,X2)
    | ~ maps(X1,X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_16,negated_conjecture,
    ( X1 = X2
    | ~ apply(compose_function(esk2_0,esk1_0,esk3_0,esk4_0,esk5_0),X2,X3)
    | ~ apply(compose_function(esk2_0,esk1_0,esk3_0,esk4_0,esk5_0),X1,X3)
    | ~ member(X3,esk5_0)
    | ~ member(X2,esk3_0)
    | ~ member(X1,esk3_0) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_17,negated_conjecture,
    ( apply(compose_function(esk2_0,X1,X2,X3,X4),X5,esk10_4(esk2_0,esk4_0,esk5_0,X6))
    | ~ apply(X1,X5,X6)
    | ~ member(esk10_4(esk2_0,esk4_0,esk5_0,X6),X4)
    | ~ member(X6,esk4_0)
    | ~ member(X5,X2)
    | ~ member(X6,X3) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_18,negated_conjecture,
    ( member(esk10_4(esk2_0,esk4_0,esk5_0,X1),esk5_0)
    | ~ member(X1,esk4_0) ),
    inference(spm,[status(thm)],[c_0_15,c_0_10]) ).

cnf(c_0_19,negated_conjecture,
    ( X1 = X2
    | ~ apply(compose_function(esk2_0,esk1_0,esk3_0,esk4_0,esk5_0),X1,esk10_4(esk2_0,esk4_0,esk5_0,X3))
    | ~ apply(esk1_0,X2,X3)
    | ~ member(X2,esk3_0)
    | ~ member(X1,esk3_0)
    | ~ member(X3,esk4_0) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).

cnf(c_0_20,negated_conjecture,
    ~ injective(esk1_0,esk3_0,esk4_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_21,plain,
    ( apply(X1,esk7_3(X1,X2,X3),esk8_3(X1,X2,X3))
    | injective(X1,X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_22,plain,
    ( member(esk7_3(X1,X2,X3),X2)
    | injective(X1,X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_23,plain,
    ( member(esk8_3(X1,X2,X3),X3)
    | injective(X1,X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_24,negated_conjecture,
    ( X1 = X2
    | ~ apply(esk1_0,X2,X3)
    | ~ apply(esk1_0,X1,X3)
    | ~ member(X2,esk3_0)
    | ~ member(X1,esk3_0)
    | ~ member(X3,esk4_0) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_17]),c_0_18]) ).

cnf(c_0_25,negated_conjecture,
    apply(esk1_0,esk7_3(esk1_0,esk3_0,esk4_0),esk8_3(esk1_0,esk3_0,esk4_0)),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_26,negated_conjecture,
    member(esk7_3(esk1_0,esk3_0,esk4_0),esk3_0),
    inference(spm,[status(thm)],[c_0_20,c_0_22]) ).

cnf(c_0_27,negated_conjecture,
    member(esk8_3(esk1_0,esk3_0,esk4_0),esk4_0),
    inference(spm,[status(thm)],[c_0_20,c_0_23]) ).

cnf(c_0_28,plain,
    ( apply(X1,esk6_3(X1,X2,X3),esk8_3(X1,X2,X3))
    | injective(X1,X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_29,plain,
    ( member(esk6_3(X1,X2,X3),X2)
    | injective(X1,X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_30,plain,
    ( injective(X1,X2,X3)
    | esk6_3(X1,X2,X3) != esk7_3(X1,X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_31,negated_conjecture,
    ( X1 = esk7_3(esk1_0,esk3_0,esk4_0)
    | ~ apply(esk1_0,X1,esk8_3(esk1_0,esk3_0,esk4_0))
    | ~ member(X1,esk3_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_27])]) ).

cnf(c_0_32,negated_conjecture,
    apply(esk1_0,esk6_3(esk1_0,esk3_0,esk4_0),esk8_3(esk1_0,esk3_0,esk4_0)),
    inference(spm,[status(thm)],[c_0_20,c_0_28]) ).

cnf(c_0_33,negated_conjecture,
    member(esk6_3(esk1_0,esk3_0,esk4_0),esk3_0),
    inference(spm,[status(thm)],[c_0_20,c_0_29]) ).

cnf(c_0_34,negated_conjecture,
    esk7_3(esk1_0,esk3_0,esk4_0) != esk6_3(esk1_0,esk3_0,esk4_0),
    inference(spm,[status(thm)],[c_0_20,c_0_30]) ).

cnf(c_0_35,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]),c_0_34]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : SET721+4 : TPTP v8.2.0. Bugfixed v2.2.1.
% 0.11/0.13  % Command    : run_E %s %d THM
% 0.14/0.34  % Computer : n026.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Mon May 20 11:38:38 EDT 2024
% 0.14/0.34  % CPUTime    : 
% 0.20/0.46  Running first-order theorem proving
% 0.20/0.47  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.54  # Version: 3.1.0
% 0.20/0.54  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.54  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.54  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.54  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.54  # Starting sh5l with 300s (1) cores
% 0.20/0.54  # new_bool_3 with pid 5040 completed with status 0
% 0.20/0.54  # Result found by new_bool_3
% 0.20/0.54  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.54  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.54  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.54  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.54  # Search class: FGUSF-FFMS33-SFFFFFNN
% 0.20/0.54  # partial match(1): FGUSS-FFMS33-SFFFFFNN
% 0.20/0.54  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.54  # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 150s (1) cores
% 0.20/0.54  # G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with pid 5043 completed with status 0
% 0.20/0.54  # Result found by G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI
% 0.20/0.54  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.54  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.54  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.54  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.54  # Search class: FGUSF-FFMS33-SFFFFFNN
% 0.20/0.54  # partial match(1): FGUSS-FFMS33-SFFFFFNN
% 0.20/0.54  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.54  # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 150s (1) cores
% 0.20/0.54  # Preprocessing time       : 0.002 s
% 0.20/0.54  # Presaturation interreduction done
% 0.20/0.54  
% 0.20/0.54  # Proof found!
% 0.20/0.54  # SZS status Theorem
% 0.20/0.54  # SZS output start CNFRefutation
% See solution above
% 0.20/0.54  # Parsed axioms                        : 29
% 0.20/0.54  # Removed by relevancy pruning/SinE    : 23
% 0.20/0.54  # Initial clauses                      : 37
% 0.20/0.54  # Removed in clause preprocessing      : 0
% 0.20/0.54  # Initial clauses in saturation        : 37
% 0.20/0.54  # Processed clauses                    : 350
% 0.20/0.54  # ...of these trivial                  : 0
% 0.20/0.54  # ...subsumed                          : 102
% 0.20/0.54  # ...remaining for further processing  : 248
% 0.20/0.54  # Other redundant clauses eliminated   : 0
% 0.20/0.54  # Clauses deleted for lack of memory   : 0
% 0.20/0.54  # Backward-subsumed                    : 0
% 0.20/0.54  # Backward-rewritten                   : 2
% 0.20/0.54  # Generated clauses                    : 1192
% 0.20/0.54  # ...of the previous two non-redundant : 1119
% 0.20/0.54  # ...aggressively subsumed             : 0
% 0.20/0.54  # Contextual simplify-reflections      : 4
% 0.20/0.54  # Paramodulations                      : 1192
% 0.20/0.54  # Factorizations                       : 0
% 0.20/0.54  # NegExts                              : 0
% 0.20/0.54  # Equation resolutions                 : 0
% 0.20/0.54  # Disequality decompositions           : 0
% 0.20/0.54  # Total rewrite steps                  : 211
% 0.20/0.54  # ...of those cached                   : 204
% 0.20/0.54  # Propositional unsat checks           : 0
% 0.20/0.54  #    Propositional check models        : 0
% 0.20/0.54  #    Propositional check unsatisfiable : 0
% 0.20/0.54  #    Propositional clauses             : 0
% 0.20/0.54  #    Propositional clauses after purity: 0
% 0.20/0.54  #    Propositional unsat core size     : 0
% 0.20/0.54  #    Propositional preprocessing time  : 0.000
% 0.20/0.54  #    Propositional encoding time       : 0.000
% 0.20/0.54  #    Propositional solver time         : 0.000
% 0.20/0.54  #    Success case prop preproc time    : 0.000
% 0.20/0.54  #    Success case prop encoding time   : 0.000
% 0.20/0.54  #    Success case prop solver time     : 0.000
% 0.20/0.54  # Current number of processed clauses  : 209
% 0.20/0.54  #    Positive orientable unit clauses  : 10
% 0.20/0.54  #    Positive unorientable unit clauses: 0
% 0.20/0.54  #    Negative unit clauses             : 3
% 0.20/0.54  #    Non-unit-clauses                  : 196
% 0.20/0.54  # Current number of unprocessed clauses: 840
% 0.20/0.54  # ...number of literals in the above   : 7178
% 0.20/0.54  # Current number of archived formulas  : 0
% 0.20/0.54  # Current number of archived clauses   : 39
% 0.20/0.54  # Clause-clause subsumption calls (NU) : 14378
% 0.20/0.54  # Rec. Clause-clause subsumption calls : 1686
% 0.20/0.54  # Non-unit clause-clause subsumptions  : 104
% 0.20/0.54  # Unit Clause-clause subsumption calls : 4
% 0.20/0.54  # Rewrite failures with RHS unbound    : 0
% 0.20/0.54  # BW rewrite match attempts            : 5
% 0.20/0.54  # BW rewrite match successes           : 2
% 0.20/0.54  # Condensation attempts                : 0
% 0.20/0.54  # Condensation successes               : 0
% 0.20/0.54  # Termbank termtop insertions          : 44740
% 0.20/0.54  # Search garbage collected termcells   : 1046
% 0.20/0.54  
% 0.20/0.54  # -------------------------------------------------
% 0.20/0.54  # User time                : 0.058 s
% 0.20/0.54  # System time              : 0.004 s
% 0.20/0.54  # Total time               : 0.062 s
% 0.20/0.54  # Maximum resident set size: 1912 pages
% 0.20/0.54  
% 0.20/0.54  # -------------------------------------------------
% 0.20/0.54  # User time                : 0.061 s
% 0.20/0.54  # System time              : 0.005 s
% 0.20/0.54  # Total time               : 0.067 s
% 0.20/0.54  # Maximum resident set size: 1768 pages
% 0.20/0.54  % E---3.1 exiting
% 0.20/0.54  % E exiting
%------------------------------------------------------------------------------