↑ Up

E-SAT---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E-SAT---3.5.1
% Problem  : ITP020_5 : TPTP v9.3.1. Bugfixed v7.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n004.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 12:56:00 PM UTC 2026

% Result   : Theorem 0.17s 46.51s
% Output   : CNFRefutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   24 (  12 unt;   0 typ;   0 def)
%            Number of atoms       :   64 (   3 equ)
%            Maximal formula atoms :   13 (   2 avg)
%            Number of connectives :   73 (  33   ~;  28   |;   6   &)
%                                         (   2 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   5 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of types       :    3 (   1 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   2 con; 0-4 aty)
%            Number of variables   :   44 (   0 sgn  41   !;   3   ?;  23   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_sort1,type,
    del: $tType ).

tff(decl_23,type,
    bool: del ).

tff(decl_25,type,
    arr: ( del * del ) > del ).

tff(decl_26,type,
    mem: ( del * $i ) > $o ).

tff(decl_27,type,
    ap: ( $i * $i ) > $i ).

tff(decl_30,type,
    p: $i > $o ).

tff(decl_188,type,
    ty_2Enum_2Enum: del ).

tff(decl_322,type,
    ty_2Epair_2Eprod: ( del * del ) > del ).

tff(decl_692,type,
    c_2Epred__set_2EBIJ: ( del * del ) > $i ).

tff(decl_696,type,
    c_2Epred__set_2ECROSS: ( del * del ) > $i ).

tff(decl_728,type,
    c_2Epred__set_2EUNIV: del > $i ).

tff(decl_3034,type,
    c_2Ecardinal_2Ecardeq: ( del * del ) > $i ).

tff(decl_6465,type,
    esk95_4: ( $i * ( $i * ( del * del ) ) ) > $i ).

tff(conj_thm_2Eutil__prob_2ENUM__2D__BIJ__INV,conjecture,
    ? [X22] :
      ( p(ap(ap(ap(c_2Epred__set_2EBIJ(ty_2Enum_2Enum,ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum)),X22),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),ap(ap(c_2Epred__set_2ECROSS(ty_2Enum_2Enum,ty_2Enum_2Enum),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),c_2Epred__set_2EUNIV(ty_2Enum_2Enum))))
      & mem(X22,arr(ty_2Enum_2Enum,ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_thm_2Eutil__prob_2ENUM__2D__BIJ__INV) ).

tff(conj_thm_2Epred__set_2ECROSS__UNIV,axiom,
    ! [X11: del,X14: del] : ( c_2Epred__set_2EUNIV(ty_2Epair_2Eprod(X11,X14)) = ap(ap(c_2Epred__set_2ECROSS(X11,X14),c_2Epred__set_2EUNIV(X11)),c_2Epred__set_2EUNIV(X14)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/ITP001/ITP027_5.ax',conj_thm_2Epred__set_2ECROSS__UNIV) ).

tff(conj_thm_2Ecardinal_2Ecardeq__SYM,axiom,
    ! [X11: del,X14: del,X324] :
      ( mem(X324,arr(X11,bool))
     => ! [X55] :
          ( mem(X55,arr(X14,bool))
         => ( p(ap(ap(c_2Ecardinal_2Ecardeq(X11,X14),X324),X55))
          <=> p(ap(ap(c_2Ecardinal_2Ecardeq(X14,X11),X55),X324)) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/ITP001/ITP063_5.ax',conj_thm_2Ecardinal_2Ecardeq__SYM) ).

tff(conj_thm_2Ecardinal_2ECARD__SQUARE__NUM,axiom,
    p(ap(ap(c_2Ecardinal_2Ecardeq(ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum),ty_2Enum_2Enum),ap(ap(c_2Epred__set_2ECROSS(ty_2Enum_2Enum,ty_2Enum_2Enum),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),c_2Epred__set_2EUNIV(ty_2Enum_2Enum))),c_2Epred__set_2EUNIV(ty_2Enum_2Enum))),
    file('/export/starexec/sandbox2/benchmark/Axioms/ITP001/ITP063_5.ax',conj_thm_2Ecardinal_2ECARD__SQUARE__NUM) ).

tff(mem_c_2Epred__set_2EUNIV,axiom,
    ! [X11: del] : mem(c_2Epred__set_2EUNIV(X11),arr(X11,bool)),
    file('/export/starexec/sandbox2/benchmark/Axioms/ITP001/ITP027_5.ax',mem_c_2Epred__set_2EUNIV) ).

tff(ax_thm_2Ecardinal_2Ecardeq__def,axiom,
    ! [X11: del,X14: del,X2003] :
      ( mem(X2003,arr(X11,bool))
     => ! [X2004] :
          ( mem(X2004,arr(X14,bool))
         => ( p(ap(ap(c_2Ecardinal_2Ecardeq(X11,X14),X2003),X2004))
          <=> ? [X121] :
                ( p(ap(ap(ap(c_2Epred__set_2EBIJ(X11,X14),X121),X2003),X2004))
                & mem(X121,arr(X11,X14)) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/ITP001/ITP063_5.ax',ax_thm_2Ecardinal_2Ecardeq__def) ).

tff(c_0_6,negated_conjecture,
    ~ ? [X22] :
        ( p(ap(ap(ap(c_2Epred__set_2EBIJ(ty_2Enum_2Enum,ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum)),X22),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),ap(ap(c_2Epred__set_2ECROSS(ty_2Enum_2Enum,ty_2Enum_2Enum),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),c_2Epred__set_2EUNIV(ty_2Enum_2Enum))))
        & mem(X22,arr(ty_2Enum_2Enum,ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum))) ),
    inference(assume_negation,[status(cth)],[conj_thm_2Eutil__prob_2ENUM__2D__BIJ__INV]) ).

tff(c_0_7,plain,
    ! [X32985: del,X32986: del] : ( c_2Epred__set_2EUNIV(ty_2Epair_2Eprod(X32985,X32986)) = ap(ap(c_2Epred__set_2ECROSS(X32985,X32986),c_2Epred__set_2EUNIV(X32985)),c_2Epred__set_2EUNIV(X32986)) ),
    inference(variable_rename,[status(thm)],[conj_thm_2Epred__set_2ECROSS__UNIV]) ).

tff(c_0_8,negated_conjecture,
    ! [X32665] :
      ( ~ p(ap(ap(ap(c_2Epred__set_2EBIJ(ty_2Enum_2Enum,ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum)),X32665),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),ap(ap(c_2Epred__set_2ECROSS(ty_2Enum_2Enum,ty_2Enum_2Enum),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),c_2Epred__set_2EUNIV(ty_2Enum_2Enum))))
      | ~ mem(X32665,arr(ty_2Enum_2Enum,ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum))) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).

tff(c_0_9,plain,
    ! [X34972: del,X34973: del,X34974,X34975] :
      ( ( ~ mem(X34974,arr(X34972,bool))
        | ~ mem(X34975,arr(X34973,bool))
        | p(ap(ap(c_2Ecardinal_2Ecardeq(X34972,X34973),X34974),X34975))
        | ~ p(ap(ap(c_2Ecardinal_2Ecardeq(X34973,X34972),X34975),X34974)) )
      & ( ~ mem(X34974,arr(X34972,bool))
        | ~ mem(X34975,arr(X34973,bool))
        | p(ap(ap(c_2Ecardinal_2Ecardeq(X34973,X34972),X34975),X34974))
        | ~ p(ap(ap(c_2Ecardinal_2Ecardeq(X34972,X34973),X34974),X34975)) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[conj_thm_2Ecardinal_2Ecardeq__SYM])])])])]) ).

tcf(c_0_10,plain,
    p(ap(ap(c_2Ecardinal_2Ecardeq(ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum),ty_2Enum_2Enum),ap(ap(c_2Epred__set_2ECROSS(ty_2Enum_2Enum,ty_2Enum_2Enum),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),c_2Epred__set_2EUNIV(ty_2Enum_2Enum))),c_2Epred__set_2EUNIV(ty_2Enum_2Enum))),
    inference(split_conjunct,[status(thm)],[conj_thm_2Ecardinal_2ECARD__SQUARE__NUM]) ).

tcf(c_0_11,plain,
    ! [X1: del,X2: del] : c_2Epred__set_2EUNIV(ty_2Epair_2Eprod(X1,X2)) = ap(ap(c_2Epred__set_2ECROSS(X1,X2),c_2Epred__set_2EUNIV(X1)),c_2Epred__set_2EUNIV(X2)),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

tff(c_0_12,plain,
    ! [X32872: del] : mem(c_2Epred__set_2EUNIV(X32872),arr(X32872,bool)),
    inference(variable_rename,[status(thm)],[mem_c_2Epred__set_2EUNIV]) ).

tcf(c_0_13,negated_conjecture,
    ! [X3] :
      ( ~ p(ap(ap(ap(c_2Epred__set_2EBIJ(ty_2Enum_2Enum,ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum)),X3),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),ap(ap(c_2Epred__set_2ECROSS(ty_2Enum_2Enum,ty_2Enum_2Enum),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),c_2Epred__set_2EUNIV(ty_2Enum_2Enum))))
      | ~ mem(X3,arr(ty_2Enum_2Enum,ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum))) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

tff(c_0_14,plain,
    ! [X33257: del,X33258: del,X33259,X33260,X33262] :
      ( ( ~ mem(X33259,arr(X33257,bool))
        | ~ mem(X33260,arr(X33258,bool))
        | p(ap(ap(c_2Ecardinal_2Ecardeq(X33257,X33258),X33259),X33260))
        | ~ p(ap(ap(ap(c_2Epred__set_2EBIJ(X33257,X33258),X33262),X33259),X33260))
        | ~ mem(X33262,arr(X33257,X33258)) )
      & ( ~ mem(X33259,arr(X33257,bool))
        | ~ mem(X33260,arr(X33258,bool))
        | ~ p(ap(ap(c_2Ecardinal_2Ecardeq(X33257,X33258),X33259),X33260))
        | p(ap(ap(ap(c_2Epred__set_2EBIJ(X33257,X33258),esk95_4(X33257,X33258,X33259,X33260)),X33259),X33260)) )
      & ( ~ mem(X33259,arr(X33257,bool))
        | ~ mem(X33260,arr(X33258,bool))
        | ~ p(ap(ap(c_2Ecardinal_2Ecardeq(X33257,X33258),X33259),X33260))
        | mem(esk95_4(X33257,X33258,X33259,X33260),arr(X33257,X33258)) ) ),
    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)],[ax_thm_2Ecardinal_2Ecardeq__def])])])])])]) ).

tcf(c_0_15,plain,
    ! [X1: del,X3,X4,X2: del] :
      ( ~ mem(X4,arr(X2,bool))
      | ~ mem(X3,arr(X1,bool))
      | ~ p(ap(ap(c_2Ecardinal_2Ecardeq(X1,X2),X3),X4))
      | p(ap(ap(c_2Ecardinal_2Ecardeq(X2,X1),X4),X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

tcf(c_0_16,plain,
    p(ap(ap(c_2Ecardinal_2Ecardeq(ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum),ty_2Enum_2Enum),c_2Epred__set_2EUNIV(ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum))),c_2Epred__set_2EUNIV(ty_2Enum_2Enum))),
    inference(rw,[status(thm)],[c_0_10,c_0_11]) ).

tcf(c_0_17,plain,
    ! [X1: del] : mem(c_2Epred__set_2EUNIV(X1),arr(X1,bool)),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

tcf(c_0_18,negated_conjecture,
    ! [X3] :
      ( ~ mem(X3,arr(ty_2Enum_2Enum,ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum)))
      | ~ p(ap(ap(ap(c_2Epred__set_2EBIJ(ty_2Enum_2Enum,ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum)),X3),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),c_2Epred__set_2EUNIV(ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum)))) ),
    inference(rw,[status(thm)],[c_0_13,c_0_11]) ).

tcf(c_0_19,plain,
    ! [X4,X3,X2: del,X1: del] :
      ( ~ mem(X3,arr(X1,bool))
      | ~ mem(X4,arr(X2,bool))
      | ~ p(ap(ap(c_2Ecardinal_2Ecardeq(X1,X2),X3),X4))
      | p(ap(ap(ap(c_2Epred__set_2EBIJ(X1,X2),esk95_4(X1,X2,X3,X4)),X3),X4)) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

tcf(c_0_20,plain,
    p(ap(ap(c_2Ecardinal_2Ecardeq(ty_2Enum_2Enum,ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum)),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),c_2Epred__set_2EUNIV(ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum)))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_17])]) ).

tcf(c_0_21,negated_conjecture,
    ~ mem(esk95_4(ty_2Enum_2Enum,ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum),c_2Epred__set_2EUNIV(ty_2Enum_2Enum),c_2Epred__set_2EUNIV(ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum))),arr(ty_2Enum_2Enum,ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_17]),c_0_17])]),c_0_20])]) ).

tcf(c_0_22,plain,
    ! [X4,X3,X2: del,X1: del] :
      ( ~ mem(X3,arr(X1,bool))
      | ~ mem(X4,arr(X2,bool))
      | ~ p(ap(ap(c_2Ecardinal_2Ecardeq(X1,X2),X3),X4))
      | mem(esk95_4(X1,X2,X3,X4),arr(X1,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_23,negated_conjecture,
    $false,
    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_20]),c_0_17]),c_0_17])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : ITP020_5 : TPTP v9.3.1. Bugfixed v7.5.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/1.21  % Computer : n004.cluster.edu
% 0.10/1.21  % Model    : x86_64 x86_64
% 0.10/1.21  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/1.21  % Memory   : 8046.5625MB
% 0.10/1.21  % OS       : Linux 6.8.0-71-generic
% 0.10/1.21  % CPULimit : 300
% 0.10/1.21  % WCLimit  : 300
% 0.10/1.21  % DateTime : Sun Sep 20 21:52:45 UTC 2026
% 0.10/1.22  % CPUTime  : 
% 0.10/1.22  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/1.26  Running first-order theorem proving
% 0.10/1.26  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/46.51  % Version: 3.5.1
% 0.17/46.51  % Preprocessing class: FMLLSMLLSSSNFFN.
% 0.17/46.51  % Scheduled 4 strats onto 8 cores with 295 seconds (2360 total)
% 0.17/46.51  % Starting new_bool_3 with 885s (3) cores
% 0.17/46.51  % Starting new_bool_1 with 885s (3) cores
% 0.17/46.51  % Starting sh5l with 295s (1) cores
% 0.17/46.51  % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 295s (1) cores
% 0.17/46.51  % new_bool_3 with pid 1544408 completed with status 0
% 0.17/46.51  % Result found by new_bool_3
% 0.17/46.51  % Preprocessing class: FMLLSMLLSSSNFFN.
% 0.17/46.51  % Scheduled 4 strats onto 8 cores with 295 seconds (2360 total)
% 0.17/46.51  % Starting new_bool_3 with 885s (3) cores
% 0.17/46.51  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.17/46.51  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/46.51  % Search class: FGHSM-SMLM33-DFFFFFNN
% 0.17/46.51  % Scheduled 7 strats onto 3 cores with 883 seconds (883 total)
% 0.17/46.51  % Starting SubtermCWHack with 80s (1) cores
% 0.17/46.51  % Starting new_bool_3 with 89s (1) cores
% 0.17/46.51  % Starting U----_206e_00_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 80s (1) cores
% 0.17/46.51  % U----_206e_00_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 1545165 completed with status 0
% 0.17/46.51  % Result found by U----_206e_00_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.17/46.51  % Preprocessing class: FMLLSMLLSSSNFFN.
% 0.17/46.51  % Scheduled 4 strats onto 8 cores with 295 seconds (2360 total)
% 0.17/46.51  % Starting new_bool_3 with 885s (3) cores
% 0.17/46.51  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.17/46.51  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/46.51  % Search class: FGHSM-SMLM33-DFFFFFNN
% 0.17/46.51  % Scheduled 7 strats onto 3 cores with 883 seconds (883 total)
% 0.17/46.51  % Starting SubtermCWHack with 80s (1) cores
% 0.17/46.51  % Starting new_bool_3 with 89s (1) cores
% 0.17/46.51  % Starting U----_206e_00_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 80s (1) cores
% 0.17/46.51  % Preprocessing time       : 0.249 s
% 0.17/46.51  % Presaturation interreduction done
% 0.17/46.51  
% 0.17/46.51  % Proof found!
% 0.17/46.51  % SZS status Theorem
% 0.17/46.51  % SZS output start CNFRefutation
% See solution above
% 0.17/46.51  % Parsed axioms                        : 25383
% 0.17/46.51  % Removed by relevancy pruning/SinE    : 23163
% 0.17/46.51  % Initial clauses                      : 7851
% 0.17/46.51  % Removed in clause preprocessing      : 1567
% 0.17/46.51  % Initial clauses in saturation        : 6284
% 0.17/46.51  % Processed clauses                    : 16103
% 0.17/46.51  % ...of these trivial                  : 442
% 0.17/46.51  % ...subsumed                          : 1522
% 0.17/46.51  % ...remaining for further processing  : 14139
% 0.17/46.51  % Other redundant clauses eliminated   : 1743
% 0.17/46.51  % Clauses deleted for lack of memory   : 0
% 0.17/46.51  % Backward-subsumed                    : 56
% 0.17/46.51  % Backward-rewritten                   : 168
% 0.17/46.51  % Generated clauses                    : 461463
% 0.17/46.51  % ...of the previous two non-redundant : 453860
% 0.17/46.51  % ...aggressively subsumed             : 0
% 0.17/46.51  % Contextual simplify-reflections      : 35
% 0.17/46.51  % Paramodulations                      : 459620
% 0.17/46.51  % Factorizations                       : 8
% 0.17/46.51  % NegExts                              : 0
% 0.17/46.51  % Equation resolutions                 : 1896
% 0.17/46.51  % Disequality decompositions           : 0
% 0.17/46.51  % Total rewrite steps                  : 42017
% 0.17/46.51  % ...of those cached                   : 40305
% 0.17/46.51  % Propositional unsat checks           : 0
% 0.17/46.51  %    Propositional check models        : 0
% 0.17/46.51  %    Propositional check unsatisfiable : 0
% 0.17/46.51  %    Propositional clauses             : 0
% 0.17/46.51  %    Propositional clauses after purity: 0
% 0.17/46.51  %    Propositional unsat core size     : 0
% 0.17/46.51  %    Propositional preprocessing time  : 0.000
% 0.17/46.51  %    Propositional encoding time       : 0.000
% 0.17/46.51  %    Propositional solver time         : 0.000
% 0.17/46.51  %    Success case prop preproc time    : 0.000
% 0.17/46.51  %    Success case prop encoding time   : 0.000
% 0.17/46.51  %    Success case prop solver time     : 0.000
% 0.17/46.51  % Current number of processed clauses  : 8065
% 0.17/46.51  %    Positive orientable unit clauses  : 1326
% 0.17/46.51  %    Positive unorientable unit clauses: 34
% 0.17/46.51  %    Negative unit clauses             : 176
% 0.17/46.51  %    Non-unit-clauses                  : 6529
% 0.17/46.51  % Current number of unprocessed clauses: 447179
% 0.17/46.51  % ...number of literals in the above   : 2799563
% 0.17/46.51  % Current number of archived formulas  : 0
% 0.17/46.51  % Current number of archived clauses   : 5709
% 0.17/46.51  % Clause-clause subsumption calls (NU) : 19846318
% 0.17/46.51  % Rec. Clause-clause subsumption calls : 591329
% 0.17/46.51  % Non-unit clause-clause subsumptions  : 1180
% 0.17/46.51  % Unit Clause-clause subsumption calls : 807307
% 0.17/46.51  % Rewrite failures with RHS unbound    : 0
% 0.17/46.51  % BW rewrite match attempts            : 51804
% 0.17/46.51  % BW rewrite match successes           : 361
% 0.17/46.51  % Condensation attempts                : 0
% 0.17/46.51  % Condensation successes               : 0
% 0.17/46.51  % Termbank termtop insertions          : 26731512
% 0.17/46.51  % Search garbage collected termcells   : 498485
% 0.17/46.51  
% 0.17/46.51  % -------------------------------------------------
% 0.17/46.51  % User time                : 37.027 s
% 0.17/46.51  % System time              : 0.635 s
% 0.17/46.51  % Total time               : 37.662 s
% 0.17/46.51  % Maximum resident set size: 94784 pages
% 0.17/46.51  
% 0.17/46.51  % -------------------------------------------------
% 0.17/46.51  % User time                : 111.897 s
% 0.17/46.51  % System time              : 2.637 s
% 0.17/46.51  % Total time               : 114.534 s
% 0.17/46.51  % Maximum resident set size: 75784 pages
% 0.17/46.51  % E exiting
%------------------------------------------------------------------------------