↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n019.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:53:43 PM UTC 2026

% Result   : Theorem 0.17s 0.48s
% Output   : CNFRefutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   42 (  27 unt;   0 def)
%            Number of atoms       :  152 ( 141 equ)
%            Maximal formula atoms :   27 (   3 avg)
%            Number of connectives :  156 (  46   ~;  42   |;  64   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   28 (   4 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   14 (  14 usr;  11 con; 0-3 aty)
%            Number of variables   :   37 (   3 sgn  24   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(quaternion_ds1_inuse_0014,conjecture,
    ( ( a_select2(xinit_defuse,n5) = use
      & a_select2(xinit_defuse,n4) = use
      & a_select2(xinit_defuse,n3) = use
      & a_select3(u_defuse,n2,n0) = use
      & a_select3(u_defuse,n1,n0) = use
      & a_select3(u_defuse,n0,n0) = use
      & a_select2(sigma_defuse,n5) = use
      & a_select2(sigma_defuse,n4) = use
      & a_select2(sigma_defuse,n3) = use
      & a_select2(sigma_defuse,n2) = use
      & a_select2(sigma_defuse,n1) = use
      & a_select2(sigma_defuse,n0) = use )
   => ( a_select2(tptp_update2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n2,use),n2) = use
      & a_select2(tptp_update2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n2,use),n1) = use
      & a_select2(tptp_update2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n2,use),n0) = use
      & a_select2(xinit_defuse,n5) = use
      & a_select2(xinit_defuse,n4) = use
      & a_select2(xinit_defuse,n3) = use
      & a_select3(u_defuse,n2,n0) = use
      & a_select3(u_defuse,n1,n0) = use
      & a_select3(u_defuse,n0,n0) = use
      & a_select2(sigma_defuse,n5) = use
      & a_select2(sigma_defuse,n4) = use
      & a_select2(sigma_defuse,n3) = use
      & a_select2(sigma_defuse,n2) = use
      & a_select2(sigma_defuse,n1) = use
      & a_select2(sigma_defuse,n0) = use ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quaternion_ds1_inuse_0014) ).

fof(sel2_update_2,axiom,
    ! [X5,X7,X1,X17,X25] :
      ( ( a_select2(X1,X7) = X17
        & X5 != X7 )
     => a_select2(tptp_update2(X1,X5,X25),X7) = X17 ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',sel2_update_2) ).

fof(sel2_update_1,axiom,
    ! [X1,X7,X17] : a_select2(tptp_update2(X1,X7,X17),X7) = X17,
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',sel2_update_1) ).

fof(irreflexivity_gt,axiom,
    ! [X1] : ~ gt(X1,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',irreflexivity_gt) ).

fof(gt_2_1,axiom,
    gt(n2,n1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gt_2_1) ).

fof(gt_2_0,axiom,
    gt(n2,n0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gt_2_0) ).

fof(gt_1_0,axiom,
    gt(n1,n0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gt_1_0) ).

fof(c_0_7,negated_conjecture,
    ~ ( ( a_select2(xinit_defuse,n5) = use
        & a_select2(xinit_defuse,n4) = use
        & a_select2(xinit_defuse,n3) = use
        & a_select3(u_defuse,n2,n0) = use
        & a_select3(u_defuse,n1,n0) = use
        & a_select3(u_defuse,n0,n0) = use
        & a_select2(sigma_defuse,n5) = use
        & a_select2(sigma_defuse,n4) = use
        & a_select2(sigma_defuse,n3) = use
        & a_select2(sigma_defuse,n2) = use
        & a_select2(sigma_defuse,n1) = use
        & a_select2(sigma_defuse,n0) = use )
     => ( a_select2(tptp_update2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n2,use),n2) = use
        & a_select2(tptp_update2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n2,use),n1) = use
        & a_select2(tptp_update2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n2,use),n0) = use
        & a_select2(xinit_defuse,n5) = use
        & a_select2(xinit_defuse,n4) = use
        & a_select2(xinit_defuse,n3) = use
        & a_select3(u_defuse,n2,n0) = use
        & a_select3(u_defuse,n1,n0) = use
        & a_select3(u_defuse,n0,n0) = use
        & a_select2(sigma_defuse,n5) = use
        & a_select2(sigma_defuse,n4) = use
        & a_select2(sigma_defuse,n3) = use
        & a_select2(sigma_defuse,n2) = use
        & a_select2(sigma_defuse,n1) = use
        & a_select2(sigma_defuse,n0) = use ) ),
    inference(assume_negation,[status(cth)],[quaternion_ds1_inuse_0014]) ).

fof(c_0_8,negated_conjecture,
    ( ( a_select2(tptp_update2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n2,use),n2) != use
      | a_select2(tptp_update2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n2,use),n1) != use
      | a_select2(tptp_update2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n2,use),n0) != use
      | a_select2(xinit_defuse,n5) != use
      | a_select2(xinit_defuse,n4) != use
      | a_select2(xinit_defuse,n3) != use
      | a_select3(u_defuse,n2,n0) != use
      | a_select3(u_defuse,n1,n0) != use
      | a_select3(u_defuse,n0,n0) != use
      | a_select2(sigma_defuse,n5) != use
      | a_select2(sigma_defuse,n4) != use
      | a_select2(sigma_defuse,n3) != use
      | a_select2(sigma_defuse,n2) != use
      | a_select2(sigma_defuse,n1) != use
      | a_select2(sigma_defuse,n0) != use )
    & a_select2(xinit_defuse,n5) = use
    & a_select2(xinit_defuse,n4) = use
    & a_select2(xinit_defuse,n3) = use
    & a_select3(u_defuse,n2,n0) = use
    & a_select3(u_defuse,n1,n0) = use
    & a_select3(u_defuse,n0,n0) = use
    & a_select2(sigma_defuse,n5) = use
    & a_select2(sigma_defuse,n4) = use
    & a_select2(sigma_defuse,n3) = use
    & a_select2(sigma_defuse,n2) = use
    & a_select2(sigma_defuse,n1) = use
    & a_select2(sigma_defuse,n0) = use ),
    inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])]) ).

fof(c_0_9,plain,
    ! [X5,X7,X1,X17,X25] :
      ( ( a_select2(X1,X7) = X17
        & X5 != X7 )
     => a_select2(tptp_update2(X1,X5,X25),X7) = X17 ),
    inference(fof_simplification,[status(thm)],[sel2_update_2]) ).

cnf(c_0_10,negated_conjecture,
    ( a_select2(tptp_update2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n2,use),n2) != use
    | a_select2(tptp_update2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n2,use),n1) != use
    | a_select2(tptp_update2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n2,use),n0) != use
    | a_select2(xinit_defuse,n5) != use
    | a_select2(xinit_defuse,n4) != use
    | a_select2(xinit_defuse,n3) != use
    | a_select3(u_defuse,n2,n0) != use
    | a_select3(u_defuse,n1,n0) != use
    | a_select3(u_defuse,n0,n0) != use
    | a_select2(sigma_defuse,n5) != use
    | a_select2(sigma_defuse,n4) != use
    | a_select2(sigma_defuse,n3) != use
    | a_select2(sigma_defuse,n2) != use
    | a_select2(sigma_defuse,n1) != use
    | a_select2(sigma_defuse,n0) != use ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_11,negated_conjecture,
    a_select2(sigma_defuse,n0) = use,
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_12,negated_conjecture,
    a_select2(sigma_defuse,n1) = use,
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_13,negated_conjecture,
    a_select2(sigma_defuse,n2) = use,
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_14,negated_conjecture,
    a_select2(sigma_defuse,n3) = use,
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_15,negated_conjecture,
    a_select2(sigma_defuse,n4) = use,
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_16,negated_conjecture,
    a_select2(sigma_defuse,n5) = use,
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_17,negated_conjecture,
    a_select2(xinit_defuse,n3) = use,
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_18,negated_conjecture,
    a_select2(xinit_defuse,n4) = use,
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_19,negated_conjecture,
    a_select2(xinit_defuse,n5) = use,
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_20,negated_conjecture,
    a_select3(u_defuse,n0,n0) = use,
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_21,negated_conjecture,
    a_select3(u_defuse,n1,n0) = use,
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_22,negated_conjecture,
    a_select3(u_defuse,n2,n0) = use,
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

fof(c_0_23,plain,
    ! [X173,X174,X175] : a_select2(tptp_update2(X173,X174,X175),X174) = X175,
    inference(variable_rename,[status(thm)],[sel2_update_1]) ).

fof(c_0_24,plain,
    ! [X176,X177,X178,X179,X180] :
      ( a_select2(tptp_update2(X178,X176,X180),X177) = X179
      | a_select2(X178,X177) != X179
      | X176 = X177 ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).

cnf(c_0_25,negated_conjecture,
    ( a_select2(tptp_update2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n2,use),n2) != use
    | a_select2(tptp_update2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n2,use),n1) != use
    | a_select2(tptp_update2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n2,use),n0) != use ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13]),c_0_14]),c_0_15]),c_0_16]),c_0_17]),c_0_18]),c_0_19]),c_0_20]),c_0_21]),c_0_22])]) ).

cnf(c_0_26,plain,
    a_select2(tptp_update2(X1,X2,X3),X2) = X3,
    inference(split_conjunct,[status(thm)],[c_0_23]) ).

cnf(c_0_27,plain,
    ( a_select2(X3,X2) != X4
    | a_select2(tptp_update2(X3,X1,X5),X2) = X4
    | X1 = X2 ),
    inference(split_conjunct,[status(thm)],[c_0_24]) ).

cnf(c_0_28,negated_conjecture,
    ( a_select2(tptp_update2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n2,use),n1) != use
    | a_select2(tptp_update2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n2,use),n0) != use ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]) ).

cnf(c_0_29,plain,
    ( X2 = X4
    | a_select2(tptp_update2(X1,X2,X3),X4) = a_select2(X1,X4) ),
    inference(er,[status(thm)],[c_0_27]) ).

cnf(c_0_30,negated_conjecture,
    ( a_select2(tptp_update2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n2,use),n0) != use
    | n2 = n1 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_26])]) ).

fof(c_0_31,plain,
    ! [X1] : ~ gt(X1,X1),
    inference(fof_simplification,[status(thm)],[irreflexivity_gt]) ).

cnf(c_0_32,negated_conjecture,
    ( a_select2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n0) != use
    | n2 = n1
    | n2 = n0 ),
    inference(spm,[status(thm)],[c_0_30,c_0_29]) ).

fof(c_0_33,plain,
    ! [X33] : ~ gt(X33,X33),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_31])]) ).

cnf(c_0_34,plain,
    gt(n2,n1),
    inference(split_conjunct,[status(thm)],[gt_2_1]) ).

cnf(c_0_35,negated_conjecture,
    ( n2 = n0
    | n2 = n1
    | n1 = n0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_29]),c_0_26])]) ).

cnf(c_0_36,plain,
    ~ gt(X1,X1),
    inference(split_conjunct,[status(thm)],[c_0_33]) ).

cnf(c_0_37,plain,
    gt(n2,n0),
    inference(split_conjunct,[status(thm)],[gt_2_0]) ).

cnf(c_0_38,negated_conjecture,
    ( n1 = n0
    | n2 = n0 ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).

cnf(c_0_39,plain,
    gt(n1,n0),
    inference(split_conjunct,[status(thm)],[gt_1_0]) ).

cnf(c_0_40,negated_conjecture,
    n1 = n0,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_36]) ).

cnf(c_0_41,plain,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40]),c_0_36]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV102+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37  % Computer : n019.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 08:31:07 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.17/0.48  % Version: 3.5.1
% 0.17/0.48  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.48  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.48  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.48  % Starting new_bool_3 with 300s (1) cores
% 0.17/0.48  % Starting new_bool_1 with 300s (1) cores
% 0.17/0.48  % Starting sh5l with 300s (1) cores
% 0.17/0.48  % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2146123 completed with status 0
% 0.17/0.48  % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.17/0.48  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.48  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.48  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.48  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/0.48  % No SInE strategy applied
% 0.17/0.48  % Search class: FGHSM-FSLM33-DFFFFFNN
% 0.17/0.48  % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.48  % Starting SubtermCWHack with 136s (1) cores
% 0.17/0.48  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.17/0.48  % Starting U----_206b_01_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.17/0.48  % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.17/0.48  % Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 0.17/0.48  % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2146131 completed with status 0
% 0.17/0.48  % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.17/0.48  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.48  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.48  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.48  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/0.48  % No SInE strategy applied
% 0.17/0.48  % Search class: FGHSM-FSLM33-DFFFFFNN
% 0.17/0.48  % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.48  % Starting SubtermCWHack with 136s (1) cores
% 0.17/0.48  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.17/0.48  % Preprocessing time       : 0.005 s
% 0.17/0.48  % Presaturation interreduction done
% 0.17/0.48  
% 0.17/0.48  % Proof found!
% 0.17/0.48  % SZS status Theorem
% 0.17/0.48  % SZS output start CNFRefutation
% See solution above
% 0.17/0.48  % Parsed axioms                        : 85
% 0.17/0.48  % Removed by relevancy pruning/SinE    : 0
% 0.17/0.48  % Initial clauses                      : 205
% 0.17/0.48  % Removed in clause preprocessing      : 2
% 0.17/0.48  % Initial clauses in saturation        : 203
% 0.17/0.48  % Processed clauses                    : 315
% 0.17/0.48  % ...of these trivial                  : 1
% 0.17/0.48  % ...subsumed                          : 0
% 0.17/0.48  % ...remaining for further processing  : 314
% 0.17/0.48  % Other redundant clauses eliminated   : 3
% 0.17/0.48  % Clauses deleted for lack of memory   : 0
% 0.17/0.48  % Backward-subsumed                    : 1
% 0.17/0.48  % Backward-rewritten                   : 38
% 0.17/0.48  % Generated clauses                    : 203
% 0.17/0.48  % ...of the previous two non-redundant : 173
% 0.17/0.48  % ...aggressively subsumed             : 0
% 0.17/0.48  % Contextual simplify-reflections      : 0
% 0.17/0.48  % Paramodulations                      : 198
% 0.17/0.48  % Factorizations                       : 3
% 0.17/0.48  % NegExts                              : 0
% 0.17/0.48  % Equation resolutions                 : 3
% 0.17/0.48  % Disequality decompositions           : 0
% 0.17/0.48  % Total rewrite steps                  : 197
% 0.17/0.48  % ...of those cached                   : 131
% 0.17/0.48  % Propositional unsat checks           : 0
% 0.17/0.48  %    Propositional check models        : 0
% 0.17/0.48  %    Propositional check unsatisfiable : 0
% 0.17/0.48  %    Propositional clauses             : 0
% 0.17/0.48  %    Propositional clauses after purity: 0
% 0.17/0.48  %    Propositional unsat core size     : 0
% 0.17/0.48  %    Propositional preprocessing time  : 0.000
% 0.17/0.48  %    Propositional encoding time       : 0.000
% 0.17/0.48  %    Propositional solver time         : 0.000
% 0.17/0.48  %    Success case prop preproc time    : 0.000
% 0.17/0.48  %    Success case prop encoding time   : 0.000
% 0.17/0.48  %    Success case prop solver time     : 0.000
% 0.17/0.48  % Current number of processed clauses  : 70
% 0.17/0.48  %    Positive orientable unit clauses  : 46
% 0.17/0.48  %    Positive unorientable unit clauses: 0
% 0.17/0.48  %    Negative unit clauses             : 2
% 0.17/0.48  %    Non-unit-clauses                  : 22
% 0.17/0.48  % Current number of unprocessed clauses: 245
% 0.17/0.48  % ...number of literals in the above   : 956
% 0.17/0.48  % Current number of archived formulas  : 0
% 0.17/0.48  % Current number of archived clauses   : 244
% 0.17/0.48  % Clause-clause subsumption calls (NU) : 14879
% 0.17/0.48  % Rec. Clause-clause subsumption calls : 1237
% 0.17/0.48  % Non-unit clause-clause subsumptions  : 1
% 0.17/0.48  % Unit Clause-clause subsumption calls : 177
% 0.17/0.48  % Rewrite failures with RHS unbound    : 0
% 0.17/0.48  % BW rewrite match attempts            : 30
% 0.17/0.49  % BW rewrite match successes           : 24
% 0.17/0.49  % Condensation attempts                : 0
% 0.17/0.49  % Condensation successes               : 0
% 0.17/0.49  % Termbank termtop insertions          : 19659
% 0.17/0.49  % Search garbage collected termcells   : 2247
% 0.17/0.49  
% 0.17/0.49  % -------------------------------------------------
% 0.17/0.49  % User time                : 0.043 s
% 0.17/0.49  % System time              : 0.008 s
% 0.17/0.49  % Total time               : 0.051 s
% 0.17/0.49  % Maximum resident set size: 3996 pages
% 0.17/0.49  
% 0.17/0.49  % -------------------------------------------------
% 0.17/0.49  % User time                : 0.154 s
% 0.17/0.49  % System time              : 0.032 s
% 0.17/0.49  % Total time               : 0.186 s
% 0.17/0.49  % Maximum resident set size: 4608 pages
% 0.17/0.49  % E exiting
%------------------------------------------------------------------------------