↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SET721+4 : TPTP v9.3.1. Bugfixed v2.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n012.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 02:15:04 PM UTC 2026

% Result   : Theorem 0.12s 0.45s
% Output   : CNFRefutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   33 (   5 unt;   0 def)
%            Number of atoms       :  221 (  15 equ)
%            Maximal formula atoms :   55 (   6 avg)
%            Number of connectives :  301 ( 113   ~; 136   |;  41   &)
%                                         (   3 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   30 (   7 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   :  135 (   0 sgn  58   !;   2   ?)

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

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

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

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

fof(c_0_5,plain,
    ! [X22,X23,X24,X25,X26,X27,X28,X29,X30] :
      ( ( injective(X28,X29,X30)
        | esk6_3(X28,X29,X30) != esk7_3(X28,X29,X30) )
      & ( injective(X28,X29,X30)
        | apply(X28,esk7_3(X28,X29,X30),esk8_3(X28,X29,X30)) )
      & ( injective(X28,X29,X30)
        | apply(X28,esk6_3(X28,X29,X30),esk8_3(X28,X29,X30)) )
      & ( injective(X28,X29,X30)
        | member(esk8_3(X28,X29,X30),X30) )
      & ( injective(X28,X29,X30)
        | member(esk7_3(X28,X29,X30),X29) )
      & ( injective(X28,X29,X30)
        | member(esk6_3(X28,X29,X30),X29) )
      & ( X25 = X26
        | ~ apply(X22,X26,X27)
        | ~ apply(X22,X25,X27)
        | ~ member(X27,X24)
        | ~ member(X26,X23)
        | ~ member(X25,X23)
        | ~ injective(X22,X23,X24) ) ),
    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_6,negated_conjecture,
    ( ~ injective(esk1_0,esk3_0,esk4_0)
    & injective(compose_function(esk2_0,esk1_0,esk3_0,esk4_0,esk5_0),esk3_0,esk5_0)
    & maps(esk2_0,esk4_0,esk5_0)
    & maps(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,
    ! [X37,X38,X39,X40,X41,X42,X43,X45] :
      ( ( ~ member(X43,X41)
        | ~ member(X42,X39)
        | apply(compose_function(X37,X38,X39,X40,X41),X42,X43)
        | ~ apply(X37,X45,X43)
        | ~ apply(X38,X42,X45)
        | ~ member(X45,X40) )
      & ( ~ member(X43,X41)
        | ~ member(X42,X39)
        | ~ apply(compose_function(X37,X38,X39,X40,X41),X42,X43)
        | apply(X37,esk9_7(X37,X38,X39,X40,X41,X42,X43),X43) )
      & ( ~ member(X43,X41)
        | ~ member(X42,X39)
        | ~ apply(compose_function(X37,X38,X39,X40,X41),X42,X43)
        | apply(X38,X42,esk9_7(X37,X38,X39,X40,X41,X42,X43)) )
      & ( ~ member(X43,X41)
        | ~ member(X42,X39)
        | ~ apply(compose_function(X37,X38,X39,X40,X41),X42,X43)
        | member(esk9_7(X37,X38,X39,X40,X41,X42,X43),X40) ) ),
    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])])])])])]) ).

fof(c_0_8,plain,
    ! [X46,X47,X48,X49,X51,X52,X53,X54,X55,X56,X58] :
      ( ( maps(X54,X55,X56)
        | ~ apply(X54,esk11_3(X54,X55,X56),X58)
        | ~ member(X58,X56)
        | esk13_3(X54,X55,X56) != esk14_3(X54,X55,X56) )
      & ( maps(X54,X55,X56)
        | ~ apply(X54,esk11_3(X54,X55,X56),X58)
        | ~ member(X58,X56)
        | apply(X54,esk12_3(X54,X55,X56),esk14_3(X54,X55,X56)) )
      & ( maps(X54,X55,X56)
        | ~ apply(X54,esk11_3(X54,X55,X56),X58)
        | ~ member(X58,X56)
        | apply(X54,esk12_3(X54,X55,X56),esk13_3(X54,X55,X56)) )
      & ( maps(X54,X55,X56)
        | ~ apply(X54,esk11_3(X54,X55,X56),X58)
        | ~ member(X58,X56)
        | member(esk14_3(X54,X55,X56),X56) )
      & ( maps(X54,X55,X56)
        | ~ apply(X54,esk11_3(X54,X55,X56),X58)
        | ~ member(X58,X56)
        | member(esk13_3(X54,X55,X56),X56) )
      & ( maps(X54,X55,X56)
        | ~ apply(X54,esk11_3(X54,X55,X56),X58)
        | ~ member(X58,X56)
        | member(esk12_3(X54,X55,X56),X55) )
      & ( maps(X54,X55,X56)
        | member(esk11_3(X54,X55,X56),X55)
        | esk13_3(X54,X55,X56) != esk14_3(X54,X55,X56) )
      & ( maps(X54,X55,X56)
        | member(esk11_3(X54,X55,X56),X55)
        | apply(X54,esk12_3(X54,X55,X56),esk14_3(X54,X55,X56)) )
      & ( maps(X54,X55,X56)
        | member(esk11_3(X54,X55,X56),X55)
        | apply(X54,esk12_3(X54,X55,X56),esk13_3(X54,X55,X56)) )
      & ( maps(X54,X55,X56)
        | member(esk11_3(X54,X55,X56),X55)
        | member(esk14_3(X54,X55,X56),X56) )
      & ( maps(X54,X55,X56)
        | member(esk11_3(X54,X55,X56),X55)
        | member(esk13_3(X54,X55,X56),X56) )
      & ( maps(X54,X55,X56)
        | member(esk11_3(X54,X55,X56),X55)
        | member(esk12_3(X54,X55,X56),X55) )
      & ( ~ maps(X46,X47,X48)
        | X52 = X53
        | ~ apply(X46,X51,X53)
        | ~ apply(X46,X51,X52)
        | ~ member(X53,X48)
        | ~ member(X52,X48)
        | ~ member(X51,X47) )
      & ( ~ maps(X46,X47,X48)
        | ~ member(X49,X47)
        | apply(X46,X49,esk10_4(X46,X47,X48,X49)) )
      & ( ~ maps(X46,X47,X48)
        | ~ member(X49,X47)
        | member(esk10_4(X46,X47,X48,X49),X48) ) ),
    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])])])])])])]) ).

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

cnf(c_0_10,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_11,plain,
    ( ~ member(X6,X8)
    | ~ member(X4,X7)
    | ~ apply(X5,X1,X6)
    | ~ apply(X3,X4,X1)
    | ~ member(X1,X2)
    | apply(compose_function(X5,X3,X7,X2,X8),X4,X6) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

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

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

cnf(c_0_14,plain,
    ( ~ member(X9,X7)
    | ~ member(X9,X4)
    | ~ member(X6,X3)
    | ~ member(esk10_4(X1,X7,X8,X9),X5)
    | ~ maps(X1,X7,X8)
    | ~ apply(X2,X6,X9)
    | apply(compose_function(X1,X2,X3,X4,X5),X6,esk10_4(X1,X7,X8,X9)) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

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

cnf(c_0_16,negated_conjecture,
    ( ~ member(X3,X4)
    | ~ member(X3,esk4_0)
    | ~ member(X1,esk3_0)
    | ~ member(X2,esk3_0)
    | ~ member(esk10_4(esk2_0,X4,X5,X3),esk5_0)
    | ~ maps(esk2_0,X4,X5)
    | ~ apply(esk1_0,X1,X3)
    | ~ apply(esk1_0,X2,X3)
    | X1 = X2 ),
    inference(spm,[status(thm)],[c_0_15,c_0_14]) ).

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

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

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

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

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

cnf(c_0_22,negated_conjecture,
    ( ~ member(X1,esk3_0)
    | ~ member(esk8_3(esk1_0,X2,X3),esk4_0)
    | ~ member(esk7_3(esk1_0,X2,X3),esk3_0)
    | ~ apply(esk1_0,X1,esk8_3(esk1_0,X2,X3))
    | injective(esk1_0,X2,X3)
    | X1 = esk7_3(esk1_0,X2,X3) ),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

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

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

cnf(c_0_25,negated_conjecture,
    ( ~ member(esk6_3(esk1_0,X1,X2),esk3_0)
    | ~ member(esk8_3(esk1_0,X1,X2),esk4_0)
    | ~ member(esk7_3(esk1_0,X1,X2),esk3_0)
    | injective(esk1_0,X1,X2) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).

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

cnf(c_0_27,negated_conjecture,
    ( ~ member(esk6_3(esk1_0,X1,esk4_0),esk3_0)
    | ~ member(esk7_3(esk1_0,X1,esk4_0),esk3_0)
    | injective(esk1_0,X1,esk4_0) ),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

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

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

cnf(c_0_30,negated_conjecture,
    ~ member(esk6_3(esk1_0,esk3_0,esk4_0),esk3_0),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).

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

cnf(c_0_32,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_29]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SET721+4 : TPTP v9.3.1. Bugfixed v2.2.1.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.35  % Computer : n012.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Mon Sep 21 05:33:38 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.40  Running first-order theorem proving
% 0.12/0.40  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.12/0.45  % Version: 3.5.1
% 0.12/0.45  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.12/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.12/0.45  % Starting new_bool_3 with 300s (1) cores
% 0.12/0.45  % Starting new_bool_1 with 300s (1) cores
% 0.12/0.45  % Starting sh5l with 300s (1) cores
% 0.12/0.45  % new_bool_1 with pid 1652414 completed with status 0
% 0.12/0.45  % Result found by new_bool_1
% 0.12/0.45  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.12/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.12/0.45  % Starting new_bool_3 with 300s (1) cores
% 0.12/0.45  % Starting new_bool_1 with 300s (1) cores
% 0.12/0.45  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.45  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.45  % Search class: FGUSF-FFMS33-SFFFFFNN
% 0.12/0.45  % partial match(1): FGUSS-FFMS33-SFFFFFNN
% 0.12/0.45  % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.45  % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.45  % SubtermCWHack with pid 1652421 completed with status 0
% 0.12/0.45  % Result found by SubtermCWHack
% 0.12/0.45  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.12/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.12/0.45  % Starting new_bool_3 with 300s (1) cores
% 0.12/0.45  % Starting new_bool_1 with 300s (1) cores
% 0.12/0.45  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.45  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.45  % Search class: FGUSF-FFMS33-SFFFFFNN
% 0.12/0.45  % partial match(1): FGUSS-FFMS33-SFFFFFNN
% 0.12/0.45  % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.45  % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.45  % Preprocessing time       : 0.001 s
% 0.12/0.45  
% 0.12/0.45  % Proof found!
% 0.12/0.45  % SZS status Theorem
% 0.12/0.45  % SZS output start CNFRefutation
% See solution above
% 0.12/0.45  % Parsed axioms                        : 29
% 0.12/0.45  % Removed by relevancy pruning/SinE    : 23
% 0.12/0.45  % Initial clauses                      : 37
% 0.12/0.45  % Removed in clause preprocessing      : 0
% 0.12/0.45  % Initial clauses in saturation        : 37
% 0.12/0.45  % Processed clauses                    : 119
% 0.12/0.45  % ...of these trivial                  : 0
% 0.12/0.45  % ...subsumed                          : 23
% 0.12/0.45  % ...remaining for further processing  : 96
% 0.12/0.45  % Other redundant clauses eliminated   : 0
% 0.12/0.45  % Clauses deleted for lack of memory   : 0
% 0.12/0.45  % Backward-subsumed                    : 2
% 0.12/0.45  % Backward-rewritten                   : 0
% 0.12/0.45  % Generated clauses                    : 281
% 0.12/0.45  % ...of the previous two non-redundant : 261
% 0.12/0.45  % ...aggressively subsumed             : 0
% 0.12/0.45  % Contextual simplify-reflections      : 3
% 0.12/0.45  % Paramodulations                      : 281
% 0.12/0.45  % Factorizations                       : 0
% 0.12/0.45  % NegExts                              : 0
% 0.12/0.45  % Equation resolutions                 : 0
% 0.12/0.45  % Disequality decompositions           : 0
% 0.12/0.45  % Total rewrite steps                  : 0
% 0.12/0.45  % ...of those cached                   : 0
% 0.12/0.45  % Propositional unsat checks           : 0
% 0.12/0.45  %    Propositional check models        : 0
% 0.12/0.45  %    Propositional check unsatisfiable : 0
% 0.12/0.45  %    Propositional clauses             : 0
% 0.12/0.45  %    Propositional clauses after purity: 0
% 0.12/0.45  %    Propositional unsat core size     : 0
% 0.12/0.45  %    Propositional preprocessing time  : 0.000
% 0.12/0.45  %    Propositional encoding time       : 0.000
% 0.12/0.45  %    Propositional solver time         : 0.000
% 0.12/0.45  %    Success case prop preproc time    : 0.000
% 0.12/0.45  %    Success case prop encoding time   : 0.000
% 0.12/0.45  %    Success case prop solver time     : 0.000
% 0.12/0.45  % Current number of processed clauses  : 94
% 0.12/0.45  %    Positive orientable unit clauses  : 3
% 0.12/0.45  %    Positive unorientable unit clauses: 0
% 0.12/0.45  %    Negative unit clauses             : 2
% 0.12/0.45  %    Non-unit-clauses                  : 89
% 0.12/0.45  % Current number of unprocessed clauses: 179
% 0.12/0.45  % ...number of literals in the above   : 1631
% 0.12/0.45  % Current number of archived formulas  : 0
% 0.12/0.45  % Current number of archived clauses   : 2
% 0.12/0.45  % Clause-clause subsumption calls (NU) : 2502
% 0.12/0.45  % Rec. Clause-clause subsumption calls : 274
% 0.12/0.45  % Non-unit clause-clause subsumptions  : 28
% 0.12/0.45  % Unit Clause-clause subsumption calls : 35
% 0.12/0.45  % Rewrite failures with RHS unbound    : 0
% 0.12/0.45  % BW rewrite match attempts            : 0
% 0.12/0.45  % BW rewrite match successes           : 0
% 0.12/0.45  % Condensation attempts                : 0
% 0.12/0.45  % Condensation successes               : 0
% 0.12/0.45  % Termbank termtop insertions          : 11777
% 0.12/0.45  % Search garbage collected termcells   : 1046
% 0.12/0.45  
% 0.12/0.45  % -------------------------------------------------
% 0.12/0.45  % User time                : 0.020 s
% 0.12/0.45  % System time              : 0.002 s
% 0.12/0.45  % Total time               : 0.022 s
% 0.12/0.45  % Maximum resident set size: 3692 pages
% 0.12/0.45  
% 0.12/0.45  % -------------------------------------------------
% 0.12/0.45  % User time                : 0.021 s
% 0.12/0.45  % System time              : 0.007 s
% 0.12/0.45  % Total time               : 0.028 s
% 0.12/0.45  % Maximum resident set size: 4608 pages
% 0.12/0.45  % E exiting
%------------------------------------------------------------------------------