↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : NLP147+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n005.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 01:35:17 PM UTC 2026

% Result   : Theorem 0.11s 0.46s
% Output   : CNFRefutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   55 (   3 unt;   0 def)
%            Number of atoms       :  219 (  18 equ)
%            Maximal formula atoms :   31 (   3 avg)
%            Number of connectives :  233 (  69   ~;  61   |;  84   &)
%                                         (   2 <=>;  17  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   34 (   6 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :   35 (  33 usr;   1 prp; 0-4 aty)
%            Number of functors    :   11 (  11 usr;   6 con; 0-4 aty)
%            Number of variables   :  126 (   3 sgn  65   !;  20   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(co1,conjecture,
    ~ ? [X1] :
        ( ? [X2,X3,X4,X5,X6] :
            ( ! [X10] :
                ( member(X1,X10,X6)
               => ( young(X1,X10)
                  & fellow(X1,X10) ) )
            & group(X1,X6)
            & two(X1,X6)
            & ! [X7] :
                ( member(X1,X7,X6)
               => ? [X8,X9] :
                    ( in(X1,X9,X9)
                    & be(X1,X8,X7,X9)
                    & state(X1,X8)
                    & frontseat(X1,X9) ) )
            & in(X1,X5,X4)
            & down(X1,X5,X2)
            & barrel(X1,X5)
            & present(X1,X5)
            & agent(X1,X5,X4)
            & event(X1,X5)
            & old(X1,X4)
            & dirty(X1,X4)
            & white(X1,X4)
            & chevy(X1,X4)
            & placename(X1,X3)
            & hollywood_placename(X1,X3)
            & city(X1,X4)
            & of(X1,X3,X4)
            & lonely(X1,X2)
            & street(X1,X2) )
        & actual_world(X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

fof(ax56,axiom,
    ! [X1,X2] :
      ( unisex(X1,X2)
     => ~ male(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax56) ).

fof(ax3,axiom,
    ! [X1,X2] :
      ( frontseat(X1,X2)
     => seat(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax3) ).

fof(ax37,axiom,
    ! [X1,X2] :
      ( man(X1,X2)
     => male(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax37) ).

fof(ax49,axiom,
    ! [X1,X2] :
      ( fellow(X1,X2)
     => man(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax49) ).

fof(ax21,axiom,
    ! [X1,X2] :
      ( instrumentality(X1,X2)
     => artifact(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax21) ).

fof(ax1,axiom,
    ! [X1,X2] :
      ( furniture(X1,X2)
     => instrumentality(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax1) ).

fof(ax2,axiom,
    ! [X1,X2] :
      ( seat(X1,X2)
     => furniture(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax2) ).

fof(ax16,axiom,
    ! [X1,X2] :
      ( object(X1,X2)
     => unisex(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax16) ).

fof(ax20,axiom,
    ! [X1,X2] :
      ( artifact(X1,X2)
     => object(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax20) ).

fof(ax59,axiom,
    ! [X1,X2,X3,X4] :
      ( be(X1,X2,X3,X4)
     => X3 = X4 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax59) ).

fof(ax60,axiom,
    ! [X1,X2] :
      ( two(X1,X2)
    <=> ? [X3] :
          ( ? [X4] :
              ( ! [X5] :
                  ( member(X1,X5,X2)
                 => ( X5 = X3
                    | X5 = X4 ) )
              & X4 != X3
              & member(X1,X4,X2) )
          & member(X1,X3,X2) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax60) ).

fof(c_0_12,negated_conjecture,
    ~ ~ ? [X1] :
          ( ? [X2,X3,X4,X5,X6] :
              ( ! [X10] :
                  ( member(X1,X10,X6)
                 => ( young(X1,X10)
                    & fellow(X1,X10) ) )
              & group(X1,X6)
              & two(X1,X6)
              & ! [X7] :
                  ( member(X1,X7,X6)
                 => ? [X8,X9] :
                      ( in(X1,X9,X9)
                      & be(X1,X8,X7,X9)
                      & state(X1,X8)
                      & frontseat(X1,X9) ) )
              & in(X1,X5,X4)
              & down(X1,X5,X2)
              & barrel(X1,X5)
              & present(X1,X5)
              & agent(X1,X5,X4)
              & event(X1,X5)
              & old(X1,X4)
              & dirty(X1,X4)
              & white(X1,X4)
              & chevy(X1,X4)
              & placename(X1,X3)
              & hollywood_placename(X1,X3)
              & city(X1,X4)
              & of(X1,X3,X4)
              & lonely(X1,X2)
              & street(X1,X2) )
          & actual_world(X1) ),
    inference(assume_negation,[status(cth)],[co1]) ).

fof(c_0_13,plain,
    ! [X1,X2] :
      ( unisex(X1,X2)
     => ~ male(X1,X2) ),
    inference(fof_simplification,[status(thm)],[ax56]) ).

fof(c_0_14,plain,
    ! [X49,X50] :
      ( seat(X49,X50)
      | ~ frontseat(X49,X50) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3])])]) ).

fof(c_0_15,negated_conjecture,
    ! [X17,X20] :
      ( ( ~ member(esk1_0,X20,esk6_0)
        | young(esk1_0,X20) )
      & ( ~ member(esk1_0,X20,esk6_0)
        | fellow(esk1_0,X20) )
      & group(esk1_0,esk6_0)
      & two(esk1_0,esk6_0)
      & ( ~ member(esk1_0,X17,esk6_0)
        | in(esk1_0,esk8_1(X17),esk8_1(X17)) )
      & ( ~ member(esk1_0,X17,esk6_0)
        | be(esk1_0,esk7_1(X17),X17,esk8_1(X17)) )
      & ( ~ member(esk1_0,X17,esk6_0)
        | state(esk1_0,esk7_1(X17)) )
      & ( ~ member(esk1_0,X17,esk6_0)
        | frontseat(esk1_0,esk8_1(X17)) )
      & in(esk1_0,esk5_0,esk4_0)
      & down(esk1_0,esk5_0,esk2_0)
      & barrel(esk1_0,esk5_0)
      & present(esk1_0,esk5_0)
      & agent(esk1_0,esk5_0,esk4_0)
      & event(esk1_0,esk5_0)
      & old(esk1_0,esk4_0)
      & dirty(esk1_0,esk4_0)
      & white(esk1_0,esk4_0)
      & chevy(esk1_0,esk4_0)
      & placename(esk1_0,esk3_0)
      & hollywood_placename(esk1_0,esk3_0)
      & city(esk1_0,esk4_0)
      & of(esk1_0,esk3_0,esk4_0)
      & lonely(esk1_0,esk2_0)
      & street(esk1_0,esk2_0)
      & actual_world(esk1_0) ),
    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)],[c_0_12])])])])])]) ).

fof(c_0_16,plain,
    ! [X91,X92] :
      ( ~ male(X91,X92)
      | ~ unisex(X91,X92) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).

fof(c_0_17,plain,
    ! [X67,X68] :
      ( male(X67,X68)
      | ~ man(X67,X68) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax37])])]) ).

fof(c_0_18,plain,
    ! [X23,X24] :
      ( man(X23,X24)
      | ~ fellow(X23,X24) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax49])])]) ).

fof(c_0_19,plain,
    ! [X109,X110] :
      ( artifact(X109,X110)
      | ~ instrumentality(X109,X110) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax21])])]) ).

fof(c_0_20,plain,
    ! [X103,X104] :
      ( instrumentality(X103,X104)
      | ~ furniture(X103,X104) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1])])]) ).

fof(c_0_21,plain,
    ! [X77,X78] :
      ( furniture(X77,X78)
      | ~ seat(X77,X78) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2])])]) ).

cnf(c_0_22,plain,
    ( ~ frontseat(X1,X2)
    | seat(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_23,negated_conjecture,
    ( ~ member(esk1_0,X1,esk6_0)
    | frontseat(esk1_0,esk8_1(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_24,plain,
    ( ~ male(X1,X2)
    | ~ unisex(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_25,plain,
    ( ~ man(X1,X2)
    | male(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_26,plain,
    ( ~ fellow(X1,X2)
    | man(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_27,negated_conjecture,
    ( ~ member(esk1_0,X1,esk6_0)
    | fellow(esk1_0,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_28,plain,
    ( ~ instrumentality(X1,X2)
    | artifact(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_29,plain,
    ( ~ furniture(X1,X2)
    | instrumentality(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_30,plain,
    ( ~ seat(X1,X2)
    | furniture(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_21]) ).

cnf(c_0_31,negated_conjecture,
    ( ~ member(esk1_0,X1,esk6_0)
    | seat(esk1_0,esk8_1(X1)) ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_32,plain,
    ( ~ unisex(X1,X2)
    | ~ man(X1,X2) ),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_33,negated_conjecture,
    ( ~ member(esk1_0,X1,esk6_0)
    | man(esk1_0,X1) ),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

fof(c_0_34,plain,
    ! [X99,X100] :
      ( unisex(X99,X100)
      | ~ object(X99,X100) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])]) ).

fof(c_0_35,plain,
    ! [X107,X108] :
      ( object(X107,X108)
      | ~ artifact(X107,X108) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax20])])]) ).

cnf(c_0_36,plain,
    ( ~ furniture(X1,X2)
    | artifact(X1,X2) ),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_37,negated_conjecture,
    ( ~ member(esk1_0,X1,esk6_0)
    | furniture(esk1_0,esk8_1(X1)) ),
    inference(spm,[status(thm)],[c_0_30,c_0_31]) ).

cnf(c_0_38,negated_conjecture,
    ( ~ unisex(esk1_0,X1)
    | ~ member(esk1_0,X1,esk6_0) ),
    inference(spm,[status(thm)],[c_0_32,c_0_33]) ).

cnf(c_0_39,plain,
    ( ~ object(X1,X2)
    | unisex(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_34]) ).

cnf(c_0_40,plain,
    ( ~ artifact(X1,X2)
    | object(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_35]) ).

cnf(c_0_41,negated_conjecture,
    ( ~ member(esk1_0,X1,esk6_0)
    | artifact(esk1_0,esk8_1(X1)) ),
    inference(spm,[status(thm)],[c_0_36,c_0_37]) ).

fof(c_0_42,plain,
    ! [X41,X42,X43,X44] :
      ( X43 = X44
      | ~ be(X41,X42,X43,X44) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax59])])]) ).

cnf(c_0_43,negated_conjecture,
    ( ~ object(esk1_0,X1)
    | ~ member(esk1_0,X1,esk6_0) ),
    inference(spm,[status(thm)],[c_0_38,c_0_39]) ).

cnf(c_0_44,negated_conjecture,
    ( ~ member(esk1_0,X1,esk6_0)
    | object(esk1_0,esk8_1(X1)) ),
    inference(spm,[status(thm)],[c_0_40,c_0_41]) ).

cnf(c_0_45,plain,
    ( ~ be(X1,X2,X3,X4)
    | X3 = X4 ),
    inference(split_conjunct,[status(thm)],[c_0_42]) ).

cnf(c_0_46,negated_conjecture,
    ( ~ member(esk1_0,X1,esk6_0)
    | be(esk1_0,esk7_1(X1),X1,esk8_1(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

fof(c_0_47,plain,
    ! [X1,X2] :
      ( two(X1,X2)
    <=> ? [X3] :
          ( ? [X4] :
              ( ! [X5] :
                  ( member(X1,X5,X2)
                 => ( X5 = X3
                    | X5 = X4 ) )
              & X4 != X3
              & member(X1,X4,X2) )
          & member(X1,X3,X2) ) ),
    inference(fof_simplification,[status(thm)],[ax60]) ).

cnf(c_0_48,negated_conjecture,
    ( ~ member(esk1_0,X1,esk6_0)
    | ~ member(esk1_0,esk8_1(X1),esk6_0) ),
    inference(spm,[status(thm)],[c_0_43,c_0_44]) ).

cnf(c_0_49,negated_conjecture,
    ( ~ member(esk1_0,X1,esk6_0)
    | esk8_1(X1) = X1 ),
    inference(spm,[status(thm)],[c_0_45,c_0_46]) ).

fof(c_0_50,plain,
    ! [X25,X26,X29,X30,X31,X32,X33] :
      ( ( two(X30,X31)
        | ~ member(X30,X32,X31)
        | X33 = X32
        | ~ member(X30,X33,X31)
        | esk11_4(X30,X31,X32,X33) != X32 )
      & ( two(X30,X31)
        | ~ member(X30,X32,X31)
        | X33 = X32
        | ~ member(X30,X33,X31)
        | esk11_4(X30,X31,X32,X33) != X33 )
      & ( two(X30,X31)
        | ~ member(X30,X32,X31)
        | X33 = X32
        | ~ member(X30,X33,X31)
        | member(X30,esk11_4(X30,X31,X32,X33),X31) )
      & ( ~ two(X25,X26)
        | X29 = esk9_2(X25,X26)
        | X29 = esk10_2(X25,X26)
        | ~ member(X25,X29,X26) )
      & ( ~ two(X25,X26)
        | esk10_2(X25,X26) != esk9_2(X25,X26) )
      & ( ~ two(X25,X26)
        | member(X25,esk10_2(X25,X26),X26) )
      & ( ~ two(X25,X26)
        | member(X25,esk9_2(X25,X26),X26) ) ),
    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)],[c_0_47])])])])])])]) ).

cnf(c_0_51,negated_conjecture,
    ~ member(esk1_0,X1,esk6_0),
    inference(spm,[status(thm)],[c_0_48,c_0_49]) ).

cnf(c_0_52,plain,
    ( ~ two(X1,X2)
    | member(X1,esk10_2(X1,X2),X2) ),
    inference(split_conjunct,[status(thm)],[c_0_50]) ).

cnf(c_0_53,negated_conjecture,
    two(esk1_0,esk6_0),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_54,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NLP147+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37  % Computer : n005.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Mon Sep 21 01:43:32 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.42  Running first-order theorem proving
% 0.11/0.42  Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.11/0.46  % Version: 3.5.1
% 0.11/0.46  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/0.46  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.46  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/0.46  % Starting new_bool_3 with 300s (1) cores
% 0.11/0.46  % Starting new_bool_1 with 300s (1) cores
% 0.11/0.46  % Starting sh5l with 300s (1) cores
% 0.11/0.46  % new_bool_3 with pid 2283787 completed with status 0
% 0.11/0.46  % Result found by new_bool_3
% 0.11/0.46  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/0.46  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.46  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/0.46  % Starting new_bool_3 with 300s (1) cores
% 0.11/0.46  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.46  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.46  % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.11/0.46  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.46  % Starting SubtermCWHack with 28s (1) cores
% 0.11/0.46  % SubtermCWHack with pid 2283803 completed with status 0
% 0.11/0.46  % Result found by SubtermCWHack
% 0.11/0.46  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/0.46  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.46  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/0.46  % Starting new_bool_3 with 300s (1) cores
% 0.11/0.46  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.46  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.46  % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.11/0.46  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.46  % Starting SubtermCWHack with 28s (1) cores
% 0.11/0.46  % Preprocessing time       : 0.002 s
% 0.11/0.46  
% 0.11/0.46  % Proof found!
% 0.11/0.46  % SZS status Theorem
% 0.11/0.46  % SZS output start CNFRefutation
% See solution above
% 0.11/0.46  % Parsed axioms                        : 62
% 0.11/0.46  % Removed by relevancy pruning/SinE    : 22
% 0.11/0.46  % Initial clauses                      : 70
% 0.11/0.46  % Removed in clause preprocessing      : 0
% 0.11/0.46  % Initial clauses in saturation        : 70
% 0.11/0.46  % Processed clauses                    : 98
% 0.11/0.46  % ...of these trivial                  : 0
% 0.11/0.46  % ...subsumed                          : 2
% 0.11/0.46  % ...remaining for further processing  : 96
% 0.11/0.46  % Other redundant clauses eliminated   : 0
% 0.11/0.46  % Clauses deleted for lack of memory   : 0
% 0.11/0.46  % Backward-subsumed                    : 25
% 0.11/0.46  % Backward-rewritten                   : 0
% 0.11/0.46  % Generated clauses                    : 44
% 0.11/0.46  % ...of the previous two non-redundant : 40
% 0.11/0.46  % ...aggressively subsumed             : 0
% 0.11/0.46  % Contextual simplify-reflections      : 0
% 0.11/0.46  % Paramodulations                      : 44
% 0.11/0.46  % Factorizations                       : 0
% 0.11/0.46  % NegExts                              : 0
% 0.11/0.46  % Equation resolutions                 : 0
% 0.11/0.46  % Disequality decompositions           : 0
% 0.11/0.46  % Total rewrite steps                  : 3
% 0.11/0.46  % ...of those cached                   : 0
% 0.11/0.46  % Propositional unsat checks           : 0
% 0.11/0.46  %    Propositional check models        : 0
% 0.11/0.46  %    Propositional check unsatisfiable : 0
% 0.11/0.46  %    Propositional clauses             : 0
% 0.11/0.46  %    Propositional clauses after purity: 0
% 0.11/0.46  %    Propositional unsat core size     : 0
% 0.11/0.46  %    Propositional preprocessing time  : 0.000
% 0.11/0.46  %    Propositional encoding time       : 0.000
% 0.11/0.46  %    Propositional solver time         : 0.000
% 0.11/0.46  %    Success case prop preproc time    : 0.000
% 0.11/0.46  %    Success case prop encoding time   : 0.000
% 0.11/0.46  %    Success case prop solver time     : 0.000
% 0.11/0.46  % Current number of processed clauses  : 71
% 0.11/0.46  %    Positive orientable unit clauses  : 22
% 0.11/0.46  %    Positive unorientable unit clauses: 0
% 0.11/0.46  %    Negative unit clauses             : 2
% 0.11/0.46  %    Non-unit-clauses                  : 47
% 0.11/0.46  % Current number of unprocessed clauses: 12
% 0.11/0.46  % ...number of literals in the above   : 39
% 0.11/0.46  % Current number of archived formulas  : 0
% 0.11/0.46  % Current number of archived clauses   : 25
% 0.11/0.46  % Clause-clause subsumption calls (NU) : 1589
% 0.11/0.46  % Rec. Clause-clause subsumption calls : 1585
% 0.11/0.46  % Non-unit clause-clause subsumptions  : 1
% 0.11/0.46  % Unit Clause-clause subsumption calls : 43
% 0.11/0.46  % Rewrite failures with RHS unbound    : 0
% 0.11/0.46  % BW rewrite match attempts            : 0
% 0.11/0.46  % BW rewrite match successes           : 0
% 0.11/0.46  % Condensation attempts                : 0
% 0.11/0.46  % Condensation successes               : 0
% 0.11/0.46  % Termbank termtop insertions          : 4564
% 0.11/0.46  % Search garbage collected termcells   : 899
% 0.11/0.46  
% 0.11/0.46  % -------------------------------------------------
% 0.11/0.46  % User time                : 0.008 s
% 0.11/0.46  % System time              : 0.005 s
% 0.11/0.46  % Total time               : 0.013 s
% 0.11/0.46  % Maximum resident set size: 3908 pages
% 0.11/0.46  
% 0.11/0.46  % -------------------------------------------------
% 0.11/0.46  % User time                : 0.011 s
% 0.11/0.46  % System time              : 0.010 s
% 0.11/0.46  % Total time               : 0.021 s
% 0.11/0.46  % Maximum resident set size: 4608 pages
% 0.11/0.46  % E exiting
%------------------------------------------------------------------------------