↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n020.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:01:41 PM UTC 2026

% Result   : Theorem 0.10s 0.43s
% Output   : CNFRefutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   31 (  11 unt;   0 def)
%            Number of atoms       :  211 (   0 equ)
%            Maximal formula atoms :   44 (   6 avg)
%            Number of connectives :  239 (  59   ~;  48   |;  71   &)
%                                         (   1 <=>;  60  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   36 (   6 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   2 prp; 0-5 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-1 aty)
%            Number of variables   :  122 (   8 sgn  91   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(thm100,conjecture,
    ( ( ! [X18] :
          ( p(north,south,north,north,X18)
         => p(south,south,north,south,take_cabbage(X18)) )
      & ! [X17] :
          ( p(south,south,north,south,X17)
         => p(north,south,north,north,take_cabbage(X17)) )
      & ! [X16] :
          ( p(north,north,south,north,X16)
         => p(south,north,south,south,take_cabbage(X16)) )
      & ! [X15] :
          ( p(south,north,south,south,X15)
         => p(north,north,south,north,take_cabbage(X15)) )
      & ! [X12,X13,X14] :
          ( p(north,X12,north,X13,X14)
         => p(south,X12,south,X13,take_goat(X14)) )
      & ! [X9,X10,X11] :
          ( p(south,X9,south,X10,X11)
         => p(north,X9,north,X10,take_goat(X11)) )
      & ! [X8] :
          ( p(north,north,north,south,X8)
         => p(south,south,north,south,take_wolf(X8)) )
      & ! [X7] :
          ( p(south,south,north,south,X7)
         => p(north,north,north,south,take_wolf(X7)) )
      & ! [X6] :
          ( p(north,north,south,north,X6)
         => p(south,south,south,north,take_wolf(X6)) )
      & ! [X5] :
          ( p(south,south,south,north,X5)
         => p(north,north,south,north,take_wolf(X5)) )
      & ! [X4] :
          ( p(north,south,north,south,X4)
         => p(south,south,north,south,go_alone(X4)) )
      & ! [X3] :
          ( p(south,south,north,south,X3)
         => p(north,south,north,south,go_alone(X3)) )
      & ! [X2] :
          ( p(north,north,south,north,X2)
         => p(south,north,south,north,go_alone(X2)) )
      & ! [X1] :
          ( p(south,north,south,north,X1)
         => p(north,north,south,north,go_alone(X1)) )
      & p(south,south,south,south,start) )
   => ? [X19] : p(north,north,north,north,X19) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm100) ).

fof(c_0_1,plain,
    ( epred1_0
  <=> ( ! [X18] :
          ( p(north,south,north,north,X18)
         => p(south,south,north,south,take_cabbage(X18)) )
      & ! [X17] :
          ( p(south,south,north,south,X17)
         => p(north,south,north,north,take_cabbage(X17)) )
      & ! [X16] :
          ( p(north,north,south,north,X16)
         => p(south,north,south,south,take_cabbage(X16)) )
      & ! [X15] :
          ( p(south,north,south,south,X15)
         => p(north,north,south,north,take_cabbage(X15)) )
      & ! [X12,X13,X14] :
          ( p(north,X12,north,X13,X14)
         => p(south,X12,south,X13,take_goat(X14)) )
      & ! [X9,X10,X11] :
          ( p(south,X9,south,X10,X11)
         => p(north,X9,north,X10,take_goat(X11)) )
      & ! [X8] :
          ( p(north,north,north,south,X8)
         => p(south,south,north,south,take_wolf(X8)) )
      & ! [X7] :
          ( p(south,south,north,south,X7)
         => p(north,north,north,south,take_wolf(X7)) )
      & ! [X6] :
          ( p(north,north,south,north,X6)
         => p(south,south,south,north,take_wolf(X6)) )
      & ! [X5] :
          ( p(south,south,south,north,X5)
         => p(north,north,south,north,take_wolf(X5)) )
      & ! [X4] :
          ( p(north,south,north,south,X4)
         => p(south,south,north,south,go_alone(X4)) )
      & ! [X3] :
          ( p(south,south,north,south,X3)
         => p(north,south,north,south,go_alone(X3)) )
      & ! [X2] :
          ( p(north,north,south,north,X2)
         => p(south,north,south,north,go_alone(X2)) )
      & ! [X1] :
          ( p(south,north,south,north,X1)
         => p(north,north,south,north,go_alone(X1)) )
      & p(south,south,south,south,start) ) ),
    introduced(definition) ).

fof(c_0_2,negated_conjecture,
    ~ ( ( ! [X18] :
            ( p(north,south,north,north,X18)
           => p(south,south,north,south,take_cabbage(X18)) )
        & ! [X17] :
            ( p(south,south,north,south,X17)
           => p(north,south,north,north,take_cabbage(X17)) )
        & ! [X16] :
            ( p(north,north,south,north,X16)
           => p(south,north,south,south,take_cabbage(X16)) )
        & ! [X15] :
            ( p(south,north,south,south,X15)
           => p(north,north,south,north,take_cabbage(X15)) )
        & ! [X12,X13,X14] :
            ( p(north,X12,north,X13,X14)
           => p(south,X12,south,X13,take_goat(X14)) )
        & ! [X9,X10,X11] :
            ( p(south,X9,south,X10,X11)
           => p(north,X9,north,X10,take_goat(X11)) )
        & ! [X8] :
            ( p(north,north,north,south,X8)
           => p(south,south,north,south,take_wolf(X8)) )
        & ! [X7] :
            ( p(south,south,north,south,X7)
           => p(north,north,north,south,take_wolf(X7)) )
        & ! [X6] :
            ( p(north,north,south,north,X6)
           => p(south,south,south,north,take_wolf(X6)) )
        & ! [X5] :
            ( p(south,south,south,north,X5)
           => p(north,north,south,north,take_wolf(X5)) )
        & ! [X4] :
            ( p(north,south,north,south,X4)
           => p(south,south,north,south,go_alone(X4)) )
        & ! [X3] :
            ( p(south,south,north,south,X3)
           => p(north,south,north,south,go_alone(X3)) )
        & ! [X2] :
            ( p(north,north,south,north,X2)
           => p(south,north,south,north,go_alone(X2)) )
        & ! [X1] :
            ( p(south,north,south,north,X1)
           => p(north,north,south,north,go_alone(X1)) )
        & p(south,south,south,south,start) )
     => ? [X19] : p(north,north,north,north,X19) ),
    inference(assume_negation,[status(cth)],[thm100]) ).

fof(c_0_3,plain,
    ( epred1_0
   => ( ! [X18] :
          ( p(north,south,north,north,X18)
         => p(south,south,north,south,take_cabbage(X18)) )
      & ! [X17] :
          ( p(south,south,north,south,X17)
         => p(north,south,north,north,take_cabbage(X17)) )
      & ! [X16] :
          ( p(north,north,south,north,X16)
         => p(south,north,south,south,take_cabbage(X16)) )
      & ! [X15] :
          ( p(south,north,south,south,X15)
         => p(north,north,south,north,take_cabbage(X15)) )
      & ! [X12,X13,X14] :
          ( p(north,X12,north,X13,X14)
         => p(south,X12,south,X13,take_goat(X14)) )
      & ! [X9,X10,X11] :
          ( p(south,X9,south,X10,X11)
         => p(north,X9,north,X10,take_goat(X11)) )
      & ! [X8] :
          ( p(north,north,north,south,X8)
         => p(south,south,north,south,take_wolf(X8)) )
      & ! [X7] :
          ( p(south,south,north,south,X7)
         => p(north,north,north,south,take_wolf(X7)) )
      & ! [X6] :
          ( p(north,north,south,north,X6)
         => p(south,south,south,north,take_wolf(X6)) )
      & ! [X5] :
          ( p(south,south,south,north,X5)
         => p(north,north,south,north,take_wolf(X5)) )
      & ! [X4] :
          ( p(north,south,north,south,X4)
         => p(south,south,north,south,go_alone(X4)) )
      & ! [X3] :
          ( p(south,south,north,south,X3)
         => p(north,south,north,south,go_alone(X3)) )
      & ! [X2] :
          ( p(north,north,south,north,X2)
         => p(south,north,south,north,go_alone(X2)) )
      & ! [X1] :
          ( p(south,north,south,north,X1)
         => p(north,north,south,north,go_alone(X1)) )
      & p(south,south,south,south,start) ) ),
    inference(split_equiv,[status(thm)],[c_0_1]) ).

fof(c_0_4,negated_conjecture,
    ~ ( epred1_0
     => ? [X19] : p(north,north,north,north,X19) ),
    inference(apply_def,[status(thm)],[c_0_2,c_0_1]) ).

fof(c_0_5,plain,
    ! [X21,X22,X23,X24,X25,X26,X27,X28,X29,X30,X31,X32,X33,X34,X35,X36,X37,X38] :
      ( ( ~ epred1_0
        | p(south,south,north,south,take_cabbage(X38))
        | ~ p(north,south,north,north,X38) )
      & ( ~ epred1_0
        | p(north,south,north,north,take_cabbage(X37))
        | ~ p(south,south,north,south,X37) )
      & ( ~ epred1_0
        | p(south,north,south,south,take_cabbage(X36))
        | ~ p(north,north,south,north,X36) )
      & ( ~ epred1_0
        | p(north,north,south,north,take_cabbage(X35))
        | ~ p(south,north,south,south,X35) )
      & ( ~ epred1_0
        | p(south,X32,south,X33,take_goat(X34))
        | ~ p(north,X32,north,X33,X34) )
      & ( ~ epred1_0
        | p(north,X29,north,X30,take_goat(X31))
        | ~ p(south,X29,south,X30,X31) )
      & ( ~ epred1_0
        | p(south,south,north,south,take_wolf(X28))
        | ~ p(north,north,north,south,X28) )
      & ( ~ epred1_0
        | p(north,north,north,south,take_wolf(X27))
        | ~ p(south,south,north,south,X27) )
      & ( ~ epred1_0
        | p(south,south,south,north,take_wolf(X26))
        | ~ p(north,north,south,north,X26) )
      & ( ~ epred1_0
        | p(north,north,south,north,take_wolf(X25))
        | ~ p(south,south,south,north,X25) )
      & ( ~ epred1_0
        | p(south,south,north,south,go_alone(X24))
        | ~ p(north,south,north,south,X24) )
      & ( ~ epred1_0
        | p(north,south,north,south,go_alone(X23))
        | ~ p(south,south,north,south,X23) )
      & ( ~ epred1_0
        | p(south,north,south,north,go_alone(X22))
        | ~ p(north,north,south,north,X22) )
      & ( ~ epred1_0
        | p(north,north,south,north,go_alone(X21))
        | ~ p(south,north,south,north,X21) )
      & ( ~ epred1_0
        | p(south,south,south,south,start) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])]) ).

fof(c_0_6,negated_conjecture,
    ! [X20] :
      ( ~ p(north,north,north,north,X20)
      & epred1_0 ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).

cnf(c_0_7,plain,
    ( ~ epred1_0
    | ~ p(south,X1,south,X2,X3)
    | p(north,X1,north,X2,take_goat(X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_8,negated_conjecture,
    epred1_0,
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_9,negated_conjecture,
    ~ p(north,north,north,north,X1),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,plain,
    ( ~ p(south,X1,south,X2,X3)
    | p(north,X1,north,X2,take_goat(X3)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8])]) ).

cnf(c_0_11,plain,
    ( ~ epred1_0
    | ~ p(north,north,south,north,X1)
    | p(south,north,south,north,go_alone(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_12,negated_conjecture,
    ~ p(south,north,south,north,X1),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_13,plain,
    ( ~ p(north,north,south,north,X1)
    | p(south,north,south,north,go_alone(X1)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_8])]) ).

cnf(c_0_14,plain,
    ( ~ epred1_0
    | ~ p(south,north,south,south,X1)
    | p(north,north,south,north,take_cabbage(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_15,plain,
    ~ p(north,north,south,north,X1),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_16,plain,
    ( ~ p(south,north,south,south,X1)
    | p(north,north,south,north,take_cabbage(X1)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_8])]) ).

cnf(c_0_17,plain,
    ( ~ epred1_0
    | ~ p(north,X1,north,X2,X3)
    | p(south,X1,south,X2,take_goat(X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_18,plain,
    ~ p(south,north,south,south,X1),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_19,plain,
    ( ~ p(north,X1,north,X2,X3)
    | p(south,X1,south,X2,take_goat(X3)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_8])]) ).

cnf(c_0_20,plain,
    ( ~ epred1_0
    | ~ p(south,south,north,south,X1)
    | p(north,north,north,south,take_wolf(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_21,plain,
    ~ p(north,north,north,south,X1),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_22,plain,
    ( ~ p(south,south,north,south,X1)
    | p(north,north,north,south,take_wolf(X1)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_8])]) ).

cnf(c_0_23,plain,
    ( ~ epred1_0
    | ~ p(north,south,north,south,X1)
    | p(south,south,north,south,go_alone(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_24,plain,
    ~ p(south,south,north,south,X1),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_25,plain,
    ( ~ p(north,south,north,south,X1)
    | p(south,south,north,south,go_alone(X1)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_8])]) ).

cnf(c_0_26,plain,
    ( ~ epred1_0
    | p(south,south,south,south,start) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_27,plain,
    ~ p(north,south,north,south,X1),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_28,plain,
    p(south,south,south,south,start),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_8])]) ).

cnf(c_0_29,plain,
    ~ p(south,south,south,south,X1),
    inference(spm,[status(thm)],[c_0_27,c_0_10]) ).

cnf(c_0_30,plain,
    $false,
    inference(sr,[status(thm)],[c_0_28,c_0_29]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : PUZ047+1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37  % Computer : n020.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Mon Sep 21 03:47:48 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41  Running first-order theorem proving
% 0.10/0.41  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.10/0.43  % Version: 3.5.1
% 0.10/0.43  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.43  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.43  % Starting new_bool_3 with 300s (1) cores
% 0.10/0.43  % Starting new_bool_1 with 300s (1) cores
% 0.10/0.43  % Starting sh5l with 300s (1) cores
% 0.10/0.43  % new_bool_3 with pid 1931805 completed with status 0
% 0.10/0.43  % Result found by new_bool_3
% 0.10/0.43  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.43  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.43  % Starting new_bool_3 with 300s (1) cores
% 0.10/0.43  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.43  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.43  % Search class: FHUNF-FFMF11-SFFFFFNN
% 0.10/0.43  % partial match(1): FHUNF-FFSF11-SFFFFFNN
% 0.10/0.43  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.43  % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.43  % SubtermCWHack with pid 1931811 completed with status 0
% 0.10/0.43  % Result found by SubtermCWHack
% 0.10/0.43  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.43  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.43  % Starting new_bool_3 with 300s (1) cores
% 0.10/0.43  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.43  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.43  % Search class: FHUNF-FFMF11-SFFFFFNN
% 0.10/0.43  % partial match(1): FHUNF-FFSF11-SFFFFFNN
% 0.10/0.43  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.43  % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.43  % Preprocessing time       : 0.001 s
% 0.10/0.43  
% 0.10/0.43  % Proof found!
% 0.10/0.43  % SZS status Theorem
% 0.10/0.43  % SZS output start CNFRefutation
% See solution above
% 0.10/0.43  % Parsed axioms                        : 1
% 0.10/0.43  % Removed by relevancy pruning/SinE    : 0
% 0.10/0.43  % Initial clauses                      : 17
% 0.10/0.43  % Removed in clause preprocessing      : 0
% 0.10/0.43  % Initial clauses in saturation        : 17
% 0.10/0.43  % Processed clauses                    : 29
% 0.10/0.43  % ...of these trivial                  : 0
% 0.10/0.43  % ...subsumed                          : 3
% 0.10/0.43  % ...remaining for further processing  : 26
% 0.10/0.43  % Other redundant clauses eliminated   : 0
% 0.10/0.43  % Clauses deleted for lack of memory   : 0
% 0.10/0.43  % Backward-subsumed                    : 12
% 0.10/0.43  % Backward-rewritten                   : 0
% 0.10/0.43  % Generated clauses                    : 15
% 0.10/0.43  % ...of the previous two non-redundant : 13
% 0.10/0.43  % ...aggressively subsumed             : 0
% 0.10/0.43  % Contextual simplify-reflections      : 0
% 0.10/0.43  % Paramodulations                      : 14
% 0.10/0.43  % Factorizations                       : 0
% 0.10/0.43  % NegExts                              : 0
% 0.10/0.43  % Equation resolutions                 : 0
% 0.10/0.43  % Disequality decompositions           : 0
% 0.10/0.43  % Total rewrite steps                  : 15
% 0.10/0.43  % ...of those cached                   : 14
% 0.10/0.43  % Propositional unsat checks           : 0
% 0.10/0.43  %    Propositional check models        : 0
% 0.10/0.43  %    Propositional check unsatisfiable : 0
% 0.10/0.43  %    Propositional clauses             : 0
% 0.10/0.43  %    Propositional clauses after purity: 0
% 0.10/0.43  %    Propositional unsat core size     : 0
% 0.10/0.43  %    Propositional preprocessing time  : 0.000
% 0.10/0.43  %    Propositional encoding time       : 0.000
% 0.10/0.43  %    Propositional solver time         : 0.000
% 0.10/0.43  %    Success case prop preproc time    : 0.000
% 0.10/0.43  %    Success case prop encoding time   : 0.000
% 0.10/0.43  %    Success case prop solver time     : 0.000
% 0.10/0.43  % Current number of processed clauses  : 13
% 0.10/0.43  %    Positive orientable unit clauses  : 1
% 0.10/0.43  %    Positive unorientable unit clauses: 0
% 0.10/0.43  %    Negative unit clauses             : 10
% 0.10/0.43  %    Non-unit-clauses                  : 2
% 0.10/0.43  % Current number of unprocessed clauses: 0
% 0.10/0.43  % ...number of literals in the above   : 0
% 0.10/0.43  % Current number of archived formulas  : 0
% 0.10/0.43  % Current number of archived clauses   : 13
% 0.10/0.43  % Clause-clause subsumption calls (NU) : 8
% 0.10/0.43  % Rec. Clause-clause subsumption calls : 8
% 0.10/0.43  % Non-unit clause-clause subsumptions  : 0
% 0.10/0.43  % Unit Clause-clause subsumption calls : 30
% 0.10/0.43  % Rewrite failures with RHS unbound    : 0
% 0.10/0.43  % BW rewrite match attempts            : 0
% 0.10/0.43  % BW rewrite match successes           : 0
% 0.10/0.43  % Condensation attempts                : 0
% 0.10/0.43  % Condensation successes               : 0
% 0.10/0.43  % Termbank termtop insertions          : 1997
% 0.10/0.43  % Search garbage collected termcells   : 275
% 0.10/0.43  
% 0.10/0.43  % -------------------------------------------------
% 0.10/0.43  % User time                : 0.002 s
% 0.10/0.43  % System time              : 0.002 s
% 0.10/0.43  % Total time               : 0.005 s
% 0.10/0.43  % Maximum resident set size: 3648 pages
% 0.10/0.43  
% 0.10/0.43  % -------------------------------------------------
% 0.10/0.43  % User time                : 0.005 s
% 0.10/0.43  % System time              : 0.006 s
% 0.10/0.43  % Total time               : 0.010 s
% 0.10/0.43  % Maximum resident set size: 4608 pages
% 0.10/0.43  % E exiting
%------------------------------------------------------------------------------