↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n015.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 03:53:51 PM UTC 2026

% Result   : Theorem 0.49s 0.69s
% Output   : CNFRefutation 0.49s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   44 (  14 unt;   0 def)
%            Number of atoms       :  147 (  21 equ)
%            Maximal formula atoms :   19 (   3 avg)
%            Number of connectives :  162 (  59   ~;  52   |;  25   &)
%                                         (   4 <=>;  22  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   11 (   9 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   2 con; 0-2 aty)
%            Number of variables   :   52 (   1 sgn  35   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t2_tsp_2,conjecture,
    ! [X1] :
      ( ( l1_pre_topc(X1)
        & v2_pre_topc(X1)
        & ~ v3_struct_0(X1) )
     => ! [X2] :
          ( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
         => ( v1_tsp_2(X2,X1)
           => v1_tops_1(X2,X1) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_tsp_2) ).

fof(d5_tsp_2,axiom,
    ! [X1] :
      ( ( l1_pre_topc(X1)
        & v2_pre_topc(X1)
        & ~ v3_struct_0(X1) )
     => ! [X2] :
          ( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
         => ( v1_tsp_2(X2,X1)
          <=> ( k3_tex_4(X1,X2) = u1_struct_0(X1)
              & v1_tsp_1(X2,X1) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_tsp_2) ).

fof(t64_tex_4,axiom,
    ! [X1] :
      ( ( l1_pre_topc(X1)
        & v2_pre_topc(X1)
        & ~ v3_struct_0(X1) )
     => ! [X2] :
          ( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
         => k6_pre_topc(X1,k3_tex_4(X1,X2)) = k6_pre_topc(X1,X2) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t64_tex_4) ).

fof(fc9_tops_1,axiom,
    ! [X1] :
      ( l1_pre_topc(X1)
     => v1_tops_1(k2_pre_topc(X1),X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc9_tops_1) ).

fof(t12_pre_topc,axiom,
    ! [X1] :
      ( l1_struct_0(X1)
     => k2_pre_topc(X1) = u1_struct_0(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t12_pre_topc) ).

fof(dt_l1_pre_topc,axiom,
    ! [X1] :
      ( l1_pre_topc(X1)
     => l1_struct_0(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_l1_pre_topc) ).

fof(t3_subset,axiom,
    ! [X1,X2] :
      ( m1_subset_1(X1,k1_zfmisc_1(X2))
    <=> r1_tarski(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_subset) ).

fof(reflexivity_r1_tarski,axiom,
    ! [X1,X2] : r1_tarski(X1,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).

fof(d2_tops_3,axiom,
    ! [X1] :
      ( l1_pre_topc(X1)
     => ! [X2] :
          ( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
         => ( v1_tops_1(X2,X1)
          <=> k6_pre_topc(X1,X2) = u1_struct_0(X1) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_tops_3) ).

fof(c_0_9,negated_conjecture,
    ~ ! [X1] :
        ( ( l1_pre_topc(X1)
          & v2_pre_topc(X1)
          & ~ v3_struct_0(X1) )
       => ! [X2] :
            ( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
           => ( v1_tsp_2(X2,X1)
             => v1_tops_1(X2,X1) ) ) ),
    inference(assume_negation,[status(cth)],[t2_tsp_2]) ).

fof(c_0_10,plain,
    ! [X1] :
      ( ( l1_pre_topc(X1)
        & v2_pre_topc(X1)
        & ~ v3_struct_0(X1) )
     => ! [X2] :
          ( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
         => ( v1_tsp_2(X2,X1)
          <=> ( k3_tex_4(X1,X2) = u1_struct_0(X1)
              & v1_tsp_1(X2,X1) ) ) ) ),
    inference(fof_simplification,[status(thm)],[d5_tsp_2]) ).

fof(c_0_11,negated_conjecture,
    ~ ! [X1] :
        ( ( l1_pre_topc(X1)
          & v2_pre_topc(X1)
          & ~ v3_struct_0(X1) )
       => ! [X2] :
            ( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
           => ( v1_tsp_2(X2,X1)
             => v1_tops_1(X2,X1) ) ) ),
    inference(fof_simplification,[status(thm)],[c_0_9]) ).

fof(c_0_12,plain,
    ! [X1] :
      ( ( l1_pre_topc(X1)
        & v2_pre_topc(X1)
        & ~ v3_struct_0(X1) )
     => ! [X2] :
          ( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
         => k6_pre_topc(X1,k3_tex_4(X1,X2)) = k6_pre_topc(X1,X2) ) ),
    inference(fof_simplification,[status(thm)],[t64_tex_4]) ).

fof(c_0_13,plain,
    ! [X47,X48] :
      ( ( ~ l1_pre_topc(X47)
        | ~ v2_pre_topc(X47)
        | v3_struct_0(X47)
        | ~ m1_subset_1(X48,k1_zfmisc_1(u1_struct_0(X47)))
        | v1_tsp_2(X48,X47)
        | k3_tex_4(X47,X48) != u1_struct_0(X47)
        | ~ v1_tsp_1(X48,X47) )
      & ( ~ l1_pre_topc(X47)
        | ~ v2_pre_topc(X47)
        | v3_struct_0(X47)
        | ~ m1_subset_1(X48,k1_zfmisc_1(u1_struct_0(X47)))
        | ~ v1_tsp_2(X48,X47)
        | k3_tex_4(X47,X48) = u1_struct_0(X47) )
      & ( ~ l1_pre_topc(X47)
        | ~ v2_pre_topc(X47)
        | v3_struct_0(X47)
        | ~ m1_subset_1(X48,k1_zfmisc_1(u1_struct_0(X47)))
        | ~ v1_tsp_2(X48,X47)
        | v1_tsp_1(X48,X47) ) ),
    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_10])])])])]) ).

fof(c_0_14,negated_conjecture,
    ( ~ v1_tops_1(esk2_0,esk1_0)
    & v1_tsp_2(esk2_0,esk1_0)
    & m1_subset_1(esk2_0,k1_zfmisc_1(u1_struct_0(esk1_0)))
    & l1_pre_topc(esk1_0)
    & v2_pre_topc(esk1_0)
    & ~ v3_struct_0(esk1_0) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])]) ).

fof(c_0_15,plain,
    ! [X66] :
      ( v1_tops_1(k2_pre_topc(X66),X66)
      | ~ l1_pre_topc(X66) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc9_tops_1])])]) ).

fof(c_0_16,plain,
    ! [X90] :
      ( k2_pre_topc(X90) = u1_struct_0(X90)
      | ~ l1_struct_0(X90) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t12_pre_topc])])]) ).

fof(c_0_17,plain,
    ! [X54] :
      ( l1_struct_0(X54)
      | ~ l1_pre_topc(X54) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l1_pre_topc])])]) ).

fof(c_0_18,plain,
    ! [X95,X96] :
      ( ( m1_subset_1(X95,k1_zfmisc_1(X96))
        | ~ r1_tarski(X95,X96) )
      & ( r1_tarski(X95,X96)
        | ~ m1_subset_1(X95,k1_zfmisc_1(X96)) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])])]) ).

fof(c_0_19,plain,
    ! [X89] : r1_tarski(X89,X89),
    inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).

fof(c_0_20,plain,
    ! [X105,X106] :
      ( k6_pre_topc(X105,k3_tex_4(X105,X106)) = k6_pre_topc(X105,X106)
      | ~ m1_subset_1(X106,k1_zfmisc_1(u1_struct_0(X105)))
      | ~ l1_pre_topc(X105)
      | ~ v2_pre_topc(X105)
      | v3_struct_0(X105) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])]) ).

cnf(c_0_21,plain,
    ( ~ l1_pre_topc(X1)
    | ~ v2_pre_topc(X1)
    | ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
    | ~ v1_tsp_2(X2,X1)
    | v3_struct_0(X1)
    | k3_tex_4(X1,X2) = u1_struct_0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_22,negated_conjecture,
    v1_tsp_2(esk2_0,esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_23,negated_conjecture,
    m1_subset_1(esk2_0,k1_zfmisc_1(u1_struct_0(esk1_0))),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_24,negated_conjecture,
    l1_pre_topc(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_25,negated_conjecture,
    v2_pre_topc(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_26,negated_conjecture,
    ~ v3_struct_0(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

fof(c_0_27,plain,
    ! [X45,X46] :
      ( ( ~ l1_pre_topc(X45)
        | ~ m1_subset_1(X46,k1_zfmisc_1(u1_struct_0(X45)))
        | v1_tops_1(X46,X45)
        | k6_pre_topc(X45,X46) != u1_struct_0(X45) )
      & ( ~ l1_pre_topc(X45)
        | ~ m1_subset_1(X46,k1_zfmisc_1(u1_struct_0(X45)))
        | k6_pre_topc(X45,X46) = u1_struct_0(X45)
        | ~ v1_tops_1(X46,X45) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d2_tops_3])])])])]) ).

cnf(c_0_28,plain,
    ( ~ l1_pre_topc(X1)
    | v1_tops_1(k2_pre_topc(X1),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_29,plain,
    ( ~ l1_struct_0(X1)
    | k2_pre_topc(X1) = u1_struct_0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_30,plain,
    ( ~ l1_pre_topc(X1)
    | l1_struct_0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_31,plain,
    ( ~ r1_tarski(X1,X2)
    | m1_subset_1(X1,k1_zfmisc_1(X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_32,plain,
    r1_tarski(X1,X1),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_33,plain,
    ( ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
    | ~ l1_pre_topc(X1)
    | ~ v2_pre_topc(X1)
    | k6_pre_topc(X1,k3_tex_4(X1,X2)) = k6_pre_topc(X1,X2)
    | v3_struct_0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_34,negated_conjecture,
    k3_tex_4(esk1_0,esk2_0) = u1_struct_0(esk1_0),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24]),c_0_25])]),c_0_26]) ).

cnf(c_0_35,plain,
    ( ~ l1_pre_topc(X2)
    | ~ m1_subset_1(X1,k1_zfmisc_1(u1_struct_0(X2)))
    | ~ v1_tops_1(X1,X2)
    | k6_pre_topc(X2,X1) = u1_struct_0(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_27]) ).

cnf(c_0_36,plain,
    ( ~ l1_pre_topc(X1)
    | v1_tops_1(u1_struct_0(X1),X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).

cnf(c_0_37,plain,
    m1_subset_1(X1,k1_zfmisc_1(X1)),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_38,negated_conjecture,
    k6_pre_topc(esk1_0,u1_struct_0(esk1_0)) = k6_pre_topc(esk1_0,esk2_0),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_23]),c_0_34]),c_0_24]),c_0_25])]),c_0_26]) ).

cnf(c_0_39,plain,
    ( ~ l1_pre_topc(X1)
    | k6_pre_topc(X1,u1_struct_0(X1)) = u1_struct_0(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]) ).

cnf(c_0_40,plain,
    ( ~ l1_pre_topc(X1)
    | ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
    | k6_pre_topc(X1,X2) != u1_struct_0(X1)
    | v1_tops_1(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_27]) ).

cnf(c_0_41,negated_conjecture,
    k6_pre_topc(esk1_0,esk2_0) = u1_struct_0(esk1_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_24])]) ).

cnf(c_0_42,negated_conjecture,
    ~ v1_tops_1(esk2_0,esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_43,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_23]),c_0_24])]),c_0_42]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : TOP024+1 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.08  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.46  % Computer : n015.cluster.edu
% 0.19/0.46  % Model    : x86_64 x86_64
% 0.19/0.46  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.46  % Memory   : 8046.5625MB
% 0.19/0.46  % OS       : Linux 6.8.0-71-generic
% 0.19/0.46  % CPULimit : 300
% 0.19/0.46  % WCLimit  : 300
% 0.19/0.46  % DateTime : Mon Sep 21 12:42:38 UTC 2026
% 0.19/0.47  % CPUTime  : 
% 0.19/0.47  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.55  Running first-order theorem proving
% 0.24/0.55  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.49/0.69  % Version: 3.5.1
% 0.49/0.69  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.49/0.69  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.49/0.69  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.49/0.69  % Starting new_bool_3 with 300s (1) cores
% 0.49/0.69  % Starting new_bool_1 with 300s (1) cores
% 0.49/0.69  % Starting sh5l with 300s (1) cores
% 0.49/0.69  % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1469331 completed with status 0
% 0.49/0.69  % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.49/0.69  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.49/0.69  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.49/0.69  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.49/0.69  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.49/0.69  % No SInE strategy applied
% 0.49/0.69  % Search class: FGHSM-FSMM21-SFFFFFNN
% 0.49/0.69  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.49/0.69  % Starting SubtermCWHack with 136s (1) cores
% 0.49/0.69  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.49/0.69  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.49/0.69  % Starting new_bool_3 with 136s (1) cores
% 0.49/0.69  % Starting new_bool_1 with 136s (1) cores
% 0.49/0.69  % new_bool_3 with pid 1469341 completed with status 0
% 0.49/0.69  % Result found by new_bool_3
% 0.49/0.69  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.49/0.69  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.49/0.69  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.49/0.69  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.49/0.69  % No SInE strategy applied
% 0.49/0.69  % Search class: FGHSM-FSMM21-SFFFFFNN
% 0.49/0.69  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.49/0.69  % Starting SubtermCWHack with 136s (1) cores
% 0.49/0.69  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.49/0.69  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.49/0.69  % Starting new_bool_3 with 136s (1) cores
% 0.49/0.69  % Preprocessing time       : 0.002 s
% 0.49/0.69  % Presaturation interreduction done
% 0.49/0.69  
% 0.49/0.69  % Proof found!
% 0.49/0.69  % SZS status Theorem
% 0.49/0.69  % SZS output start CNFRefutation
% See solution above
% 0.49/0.69  % Parsed axioms                        : 69
% 0.49/0.69  % Removed by relevancy pruning/SinE    : 0
% 0.49/0.69  % Initial clauses                      : 155
% 0.49/0.69  % Removed in clause preprocessing      : 8
% 0.49/0.69  % Initial clauses in saturation        : 147
% 0.49/0.69  % Processed clauses                    : 1361
% 0.49/0.69  % ...of these trivial                  : 2
% 0.49/0.69  % ...subsumed                          : 710
% 0.49/0.69  % ...remaining for further processing  : 649
% 0.49/0.69  % Other redundant clauses eliminated   : 16
% 0.49/0.69  % Clauses deleted for lack of memory   : 0
% 0.49/0.69  % Backward-subsumed                    : 4
% 0.49/0.69  % Backward-rewritten                   : 86
% 0.49/0.69  % Generated clauses                    : 2727
% 0.49/0.69  % ...of the previous two non-redundant : 2703
% 0.49/0.69  % ...aggressively subsumed             : 0
% 0.49/0.69  % Contextual simplify-reflections      : 3
% 0.49/0.69  % Paramodulations                      : 2711
% 0.49/0.69  % Factorizations                       : 0
% 0.49/0.69  % NegExts                              : 0
% 0.49/0.69  % Equation resolutions                 : 16
% 0.49/0.69  % Disequality decompositions           : 0
% 0.49/0.69  % Total rewrite steps                  : 280
% 0.49/0.69  % ...of those cached                   : 247
% 0.49/0.69  % Propositional unsat checks           : 0
% 0.49/0.69  %    Propositional check models        : 0
% 0.49/0.69  %    Propositional check unsatisfiable : 0
% 0.49/0.69  %    Propositional clauses             : 0
% 0.49/0.69  %    Propositional clauses after purity: 0
% 0.49/0.69  %    Propositional unsat core size     : 0
% 0.49/0.69  %    Propositional preprocessing time  : 0.000
% 0.49/0.69  %    Propositional encoding time       : 0.000
% 0.49/0.69  %    Propositional solver time         : 0.000
% 0.49/0.69  %    Success case prop preproc time    : 0.000
% 0.49/0.69  %    Success case prop encoding time   : 0.000
% 0.49/0.69  %    Success case prop solver time     : 0.000
% 0.49/0.69  % Current number of processed clauses  : 414
% 0.49/0.69  %    Positive orientable unit clauses  : 36
% 0.49/0.69  %    Positive unorientable unit clauses: 0
% 0.49/0.69  %    Negative unit clauses             : 9
% 0.49/0.69  %    Non-unit-clauses                  : 369
% 0.49/0.69  % Current number of unprocessed clauses: 1507
% 0.49/0.69  % ...number of literals in the above   : 6739
% 0.49/0.69  % Current number of archived formulas  : 0
% 0.49/0.69  % Current number of archived clauses   : 235
% 0.49/0.69  % Clause-clause subsumption calls (NU) : 58323
% 0.49/0.69  % Rec. Clause-clause subsumption calls : 31249
% 0.49/0.69  % Non-unit clause-clause subsumptions  : 445
% 0.49/0.69  % Unit Clause-clause subsumption calls : 562
% 0.49/0.69  % Rewrite failures with RHS unbound    : 0
% 0.49/0.69  % BW rewrite match attempts            : 8
% 0.49/0.69  % BW rewrite match successes           : 5
% 0.49/0.69  % Condensation attempts                : 0
% 0.49/0.69  % Condensation successes               : 0
% 0.49/0.69  % Termbank termtop insertions          : 41977
% 0.49/0.69  % Search garbage collected termcells   : 1587
% 0.49/0.69  
% 0.49/0.69  % -------------------------------------------------
% 0.49/0.69  % User time                : 0.090 s
% 0.49/0.69  % System time              : 0.005 s
% 0.49/0.69  % Total time               : 0.095 s
% 0.49/0.69  % Maximum resident set size: 3956 pages
% 0.49/0.69  
% 0.49/0.69  % -------------------------------------------------
% 0.49/0.69  % User time                : 0.329 s
% 0.49/0.69  % System time              : 0.032 s
% 0.49/0.69  % Total time               : 0.361 s
% 0.49/0.69  % Maximum resident set size: 4864 pages
% 0.49/0.69  % E exiting
%------------------------------------------------------------------------------