TSTP Solution File: RNG077+2 by E-SAT---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1.00
% Problem  : RNG077+2 : TPTP v8.2.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n011.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue May 21 02:37:00 EDT 2024

% Result   : Theorem 0.24s 0.55s
% Output   : CNFRefutation 0.56s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   56 (  30 unt;   0 def)
%            Number of atoms       :  140 (  67 equ)
%            Maximal formula atoms :   16 (   2 avg)
%            Number of connectives :  136 (  52   ~;  42   |;  32   &)
%                                         (   0 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   3 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   17 (  17 usr;  10 con; 0-2 aty)
%            Number of variables   :   39 (   1 sgn  24   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(mDefSPN,axiom,
    ! [X1,X2] :
      ( ( aVector0(X1)
        & aVector0(X2) )
     => ( ( aDimensionOf0(X1) = aDimensionOf0(X2)
          & aDimensionOf0(X2) != sz00 )
       => sdtasasdt0(X1,X2) = sdtpldt0(sdtasasdt0(sziznziztdt0(X1),sziznziztdt0(X2)),sdtasdt0(sdtlbdtrb0(X1,aDimensionOf0(X1)),sdtlbdtrb0(X2,aDimensionOf0(X2)))) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefSPN) ).

fof(m__1692,hypothesis,
    aDimensionOf0(xs) != sz00,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1692) ).

fof(m__1726,hypothesis,
    ( aVector0(xq)
    & szszuzczcdt0(aDimensionOf0(xq)) = aDimensionOf0(xt)
    & ! [X1] :
        ( aNaturalNumber0(X1)
       => sdtlbdtrb0(xq,X1) = sdtlbdtrb0(xt,X1) )
    & xq = sziznziztdt0(xt) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1726) ).

fof(m__1766,hypothesis,
    ( aScalar0(xB)
    & xB = sdtlbdtrb0(xt,aDimensionOf0(xt)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1766) ).

fof(m__1678_01,hypothesis,
    aDimensionOf0(xs) = aDimensionOf0(xt),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1678_01) ).

fof(m__1678,hypothesis,
    ( aVector0(xs)
    & aVector0(xt) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1678) ).

fof(m__1709,hypothesis,
    ( aVector0(xp)
    & szszuzczcdt0(aDimensionOf0(xp)) = aDimensionOf0(xs)
    & ! [X1] :
        ( aNaturalNumber0(X1)
       => sdtlbdtrb0(xp,X1) = sdtlbdtrb0(xs,X1) )
    & xp = sziznziztdt0(xs) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1709) ).

fof(mScPr,axiom,
    ! [X1,X2] :
      ( ( aVector0(X1)
        & aVector0(X2) )
     => ( aDimensionOf0(X1) = aDimensionOf0(X2)
       => aScalar0(sdtasasdt0(X1,X2)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mScPr) ).

fof(m__1746,hypothesis,
    ( aScalar0(xA)
    & xA = sdtlbdtrb0(xs,aDimensionOf0(xs)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1746) ).

fof(m__1820,hypothesis,
    ( aScalar0(xE)
    & xE = sdtasasdt0(xp,xq) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1820) ).

fof(m__1873,hypothesis,
    ( aScalar0(xH)
    & xH = sdtasdt0(xA,xB) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1873) ).

fof(m__,conjecture,
    sdtpldt0(sdtpldt0(xP,xP),sdtasdt0(xH,xH)) = sdtpldt0(sdtasdt0(xE,xH),sdtpldt0(sdtasdt0(xH,xE),sdtasdt0(xH,xH))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

fof(mArith,axiom,
    ! [X1,X2,X3] :
      ( ( aScalar0(X1)
        & aScalar0(X2)
        & aScalar0(X3) )
     => ( sdtpldt0(sdtpldt0(X1,X2),X3) = sdtpldt0(X1,sdtpldt0(X2,X3))
        & sdtpldt0(X1,X2) = sdtpldt0(X2,X1)
        & sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3))
        & sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mArith) ).

fof(m__1911,hypothesis,
    ( aScalar0(xP)
    & xP = sdtasdt0(xE,xH) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1911) ).

fof(mMulSc,axiom,
    ! [X1,X2] :
      ( ( aScalar0(X1)
        & aScalar0(X2) )
     => aScalar0(sdtasdt0(X1,X2)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMulSc) ).

fof(c_0_15,plain,
    ! [X1,X2] :
      ( ( aVector0(X1)
        & aVector0(X2) )
     => ( ( aDimensionOf0(X1) = aDimensionOf0(X2)
          & aDimensionOf0(X2) != sz00 )
       => sdtasasdt0(X1,X2) = sdtpldt0(sdtasasdt0(sziznziztdt0(X1),sziznziztdt0(X2)),sdtasdt0(sdtlbdtrb0(X1,aDimensionOf0(X1)),sdtlbdtrb0(X2,aDimensionOf0(X2)))) ) ),
    inference(fof_simplification,[status(thm)],[mDefSPN]) ).

fof(c_0_16,hypothesis,
    aDimensionOf0(xs) != sz00,
    inference(fof_simplification,[status(thm)],[m__1692]) ).

fof(c_0_17,plain,
    ! [X73,X74] :
      ( ~ aVector0(X73)
      | ~ aVector0(X74)
      | aDimensionOf0(X73) != aDimensionOf0(X74)
      | aDimensionOf0(X74) = sz00
      | sdtasasdt0(X73,X74) = sdtpldt0(sdtasasdt0(sziznziztdt0(X73),sziznziztdt0(X74)),sdtasdt0(sdtlbdtrb0(X73,aDimensionOf0(X73)),sdtlbdtrb0(X74,aDimensionOf0(X74)))) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])]) ).

fof(c_0_18,hypothesis,
    ! [X79] :
      ( aVector0(xq)
      & szszuzczcdt0(aDimensionOf0(xq)) = aDimensionOf0(xt)
      & ( ~ aNaturalNumber0(X79)
        | sdtlbdtrb0(xq,X79) = sdtlbdtrb0(xt,X79) )
      & xq = sziznziztdt0(xt) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__1726])])])]) ).

cnf(c_0_19,hypothesis,
    xB = sdtlbdtrb0(xt,aDimensionOf0(xt)),
    inference(split_conjunct,[status(thm)],[m__1766]) ).

cnf(c_0_20,hypothesis,
    aDimensionOf0(xs) = aDimensionOf0(xt),
    inference(split_conjunct,[status(thm)],[m__1678_01]) ).

fof(c_0_21,hypothesis,
    aDimensionOf0(xs) != sz00,
    inference(fof_nnf,[status(thm)],[c_0_16]) ).

cnf(c_0_22,plain,
    ( aDimensionOf0(X2) = sz00
    | sdtasasdt0(X1,X2) = sdtpldt0(sdtasasdt0(sziznziztdt0(X1),sziznziztdt0(X2)),sdtasdt0(sdtlbdtrb0(X1,aDimensionOf0(X1)),sdtlbdtrb0(X2,aDimensionOf0(X2))))
    | ~ aVector0(X1)
    | ~ aVector0(X2)
    | aDimensionOf0(X1) != aDimensionOf0(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_23,hypothesis,
    xq = sziznziztdt0(xt),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_24,hypothesis,
    sdtlbdtrb0(xt,aDimensionOf0(xs)) = xB,
    inference(rw,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_25,hypothesis,
    aVector0(xt),
    inference(split_conjunct,[status(thm)],[m__1678]) ).

cnf(c_0_26,hypothesis,
    aDimensionOf0(xs) != sz00,
    inference(split_conjunct,[status(thm)],[c_0_21]) ).

fof(c_0_27,hypothesis,
    ! [X78] :
      ( aVector0(xp)
      & szszuzczcdt0(aDimensionOf0(xp)) = aDimensionOf0(xs)
      & ( ~ aNaturalNumber0(X78)
        | sdtlbdtrb0(xp,X78) = sdtlbdtrb0(xs,X78) )
      & xp = sziznziztdt0(xs) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__1709])])])]) ).

fof(c_0_28,plain,
    ! [X69,X70] :
      ( ~ aVector0(X69)
      | ~ aVector0(X70)
      | aDimensionOf0(X69) != aDimensionOf0(X70)
      | aScalar0(sdtasasdt0(X69,X70)) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mScPr])])]) ).

cnf(c_0_29,hypothesis,
    ( sdtpldt0(sdtasasdt0(sziznziztdt0(X1),xq),sdtasdt0(sdtlbdtrb0(X1,aDimensionOf0(X1)),xB)) = sdtasasdt0(X1,xt)
    | aDimensionOf0(X1) != aDimensionOf0(xs)
    | ~ aVector0(X1) ),
    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_22,c_0_20]),c_0_23]),c_0_24]),c_0_25])]),c_0_26]) ).

cnf(c_0_30,hypothesis,
    xA = sdtlbdtrb0(xs,aDimensionOf0(xs)),
    inference(split_conjunct,[status(thm)],[m__1746]) ).

cnf(c_0_31,hypothesis,
    xp = sziznziztdt0(xs),
    inference(split_conjunct,[status(thm)],[c_0_27]) ).

cnf(c_0_32,hypothesis,
    xE = sdtasasdt0(xp,xq),
    inference(split_conjunct,[status(thm)],[m__1820]) ).

cnf(c_0_33,hypothesis,
    xH = sdtasdt0(xA,xB),
    inference(split_conjunct,[status(thm)],[m__1873]) ).

cnf(c_0_34,hypothesis,
    aVector0(xs),
    inference(split_conjunct,[status(thm)],[m__1678]) ).

fof(c_0_35,negated_conjecture,
    sdtpldt0(sdtpldt0(xP,xP),sdtasdt0(xH,xH)) != sdtpldt0(sdtasdt0(xE,xH),sdtpldt0(sdtasdt0(xH,xE),sdtasdt0(xH,xH))),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).

fof(c_0_36,plain,
    ! [X21,X22,X23] :
      ( ( sdtpldt0(sdtpldt0(X21,X22),X23) = sdtpldt0(X21,sdtpldt0(X22,X23))
        | ~ aScalar0(X21)
        | ~ aScalar0(X22)
        | ~ aScalar0(X23) )
      & ( sdtpldt0(X21,X22) = sdtpldt0(X22,X21)
        | ~ aScalar0(X21)
        | ~ aScalar0(X22)
        | ~ aScalar0(X23) )
      & ( sdtasdt0(sdtasdt0(X21,X22),X23) = sdtasdt0(X21,sdtasdt0(X22,X23))
        | ~ aScalar0(X21)
        | ~ aScalar0(X22)
        | ~ aScalar0(X23) )
      & ( sdtasdt0(X21,X22) = sdtasdt0(X22,X21)
        | ~ aScalar0(X21)
        | ~ aScalar0(X22)
        | ~ aScalar0(X23) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mArith])])])]) ).

cnf(c_0_37,plain,
    ( aScalar0(sdtasasdt0(X1,X2))
    | ~ aVector0(X1)
    | ~ aVector0(X2)
    | aDimensionOf0(X1) != aDimensionOf0(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_28]) ).

cnf(c_0_38,hypothesis,
    sdtasasdt0(xs,xt) = sdtpldt0(xE,xH),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_32]),c_0_33]),c_0_34])]) ).

fof(c_0_39,negated_conjecture,
    sdtpldt0(sdtpldt0(xP,xP),sdtasdt0(xH,xH)) != sdtpldt0(sdtasdt0(xE,xH),sdtpldt0(sdtasdt0(xH,xE),sdtasdt0(xH,xH))),
    inference(fof_nnf,[status(thm)],[c_0_35]) ).

cnf(c_0_40,plain,
    ( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
    | ~ aScalar0(X1)
    | ~ aScalar0(X2)
    | ~ aScalar0(X3) ),
    inference(split_conjunct,[status(thm)],[c_0_36]) ).

cnf(c_0_41,hypothesis,
    aScalar0(sdtpldt0(xE,xH)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_20]),c_0_25]),c_0_34])]) ).

cnf(c_0_42,negated_conjecture,
    sdtpldt0(sdtpldt0(xP,xP),sdtasdt0(xH,xH)) != sdtpldt0(sdtasdt0(xE,xH),sdtpldt0(sdtasdt0(xH,xE),sdtasdt0(xH,xH))),
    inference(split_conjunct,[status(thm)],[c_0_39]) ).

cnf(c_0_43,hypothesis,
    xP = sdtasdt0(xE,xH),
    inference(split_conjunct,[status(thm)],[m__1911]) ).

cnf(c_0_44,hypothesis,
    ( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
    | ~ aScalar0(X2)
    | ~ aScalar0(X1) ),
    inference(spm,[status(thm)],[c_0_40,c_0_41]) ).

cnf(c_0_45,hypothesis,
    aScalar0(xE),
    inference(split_conjunct,[status(thm)],[m__1820]) ).

cnf(c_0_46,hypothesis,
    aScalar0(xH),
    inference(split_conjunct,[status(thm)],[m__1873]) ).

cnf(c_0_47,negated_conjecture,
    sdtpldt0(xP,sdtpldt0(sdtasdt0(xH,xE),sdtasdt0(xH,xH))) != sdtpldt0(sdtpldt0(xP,xP),sdtasdt0(xH,xH)),
    inference(rw,[status(thm)],[c_0_42,c_0_43]) ).

cnf(c_0_48,hypothesis,
    sdtasdt0(xH,xE) = xP,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]),c_0_46])]) ).

cnf(c_0_49,negated_conjecture,
    sdtpldt0(sdtpldt0(xP,xP),sdtasdt0(xH,xH)) != sdtpldt0(xP,sdtpldt0(xP,sdtasdt0(xH,xH))),
    inference(spm,[status(thm)],[c_0_47,c_0_48]) ).

cnf(c_0_50,plain,
    ( sdtpldt0(sdtpldt0(X1,X2),X3) = sdtpldt0(X1,sdtpldt0(X2,X3))
    | ~ aScalar0(X1)
    | ~ aScalar0(X2)
    | ~ aScalar0(X3) ),
    inference(split_conjunct,[status(thm)],[c_0_36]) ).

cnf(c_0_51,hypothesis,
    aScalar0(xP),
    inference(split_conjunct,[status(thm)],[m__1911]) ).

fof(c_0_52,plain,
    ! [X17,X18] :
      ( ~ aScalar0(X17)
      | ~ aScalar0(X18)
      | aScalar0(sdtasdt0(X17,X18)) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulSc])])]) ).

cnf(c_0_53,negated_conjecture,
    ~ aScalar0(sdtasdt0(xH,xH)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51])]) ).

cnf(c_0_54,plain,
    ( aScalar0(sdtasdt0(X1,X2))
    | ~ aScalar0(X1)
    | ~ aScalar0(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_52]) ).

cnf(c_0_55,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_46])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem    : RNG077+2 : TPTP v8.2.0. Released v4.0.0.
% 0.14/0.14  % Command    : run_E %s %d THM
% 0.15/0.37  % Computer : n011.cluster.edu
% 0.15/0.37  % Model    : x86_64 x86_64
% 0.15/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37  % Memory   : 8042.1875MB
% 0.15/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37  % CPULimit   : 300
% 0.15/0.37  % WCLimit    : 300
% 0.15/0.37  % DateTime   : Sat May 18 12:12:23 EDT 2024
% 0.15/0.37  % CPUTime    : 
% 0.24/0.50  Running first-order model finding
% 0.24/0.50  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.24/0.55  # Version: 3.1.0
% 0.24/0.55  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/0.55  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.55  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/0.55  # Starting new_bool_3 with 300s (1) cores
% 0.24/0.55  # Starting new_bool_1 with 300s (1) cores
% 0.24/0.55  # Starting sh5l with 300s (1) cores
% 0.24/0.55  # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1913 completed with status 0
% 0.24/0.55  # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.24/0.55  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/0.55  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.55  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/0.55  # No SInE strategy applied
% 0.24/0.55  # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.24/0.55  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.55  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.24/0.55  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.24/0.55  # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 136s (1) cores
% 0.24/0.55  # Starting new_bool_3 with 136s (1) cores
% 0.24/0.55  # Starting new_bool_1 with 136s (1) cores
% 0.24/0.55  # G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with pid 1922 completed with status 0
% 0.24/0.55  # Result found by G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N
% 0.24/0.55  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/0.55  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.55  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/0.55  # No SInE strategy applied
% 0.24/0.55  # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.24/0.55  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.55  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.24/0.55  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.24/0.55  # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 136s (1) cores
% 0.24/0.55  # Preprocessing time       : 0.002 s
% 0.24/0.55  # Presaturation interreduction done
% 0.24/0.55  
% 0.24/0.55  # Proof found!
% 0.24/0.55  # SZS status Theorem
% 0.24/0.55  # SZS output start CNFRefutation
% See solution above
% 0.56/0.55  # Parsed axioms                        : 59
% 0.56/0.55  # Removed by relevancy pruning/SinE    : 0
% 0.56/0.55  # Initial clauses                      : 97
% 0.56/0.55  # Removed in clause preprocessing      : 5
% 0.56/0.55  # Initial clauses in saturation        : 92
% 0.56/0.55  # Processed clauses                    : 294
% 0.56/0.55  # ...of these trivial                  : 13
% 0.56/0.55  # ...subsumed                          : 31
% 0.56/0.55  # ...remaining for further processing  : 250
% 0.56/0.55  # Other redundant clauses eliminated   : 6
% 0.56/0.55  # Clauses deleted for lack of memory   : 0
% 0.56/0.55  # Backward-subsumed                    : 4
% 0.56/0.55  # Backward-rewritten                   : 5
% 0.56/0.55  # Generated clauses                    : 1014
% 0.56/0.55  # ...of the previous two non-redundant : 923
% 0.56/0.55  # ...aggressively subsumed             : 0
% 0.56/0.55  # Contextual simplify-reflections      : 1
% 0.56/0.55  # Paramodulations                      : 1005
% 0.56/0.55  # Factorizations                       : 0
% 0.56/0.55  # NegExts                              : 0
% 0.56/0.55  # Equation resolutions                 : 9
% 0.56/0.55  # Disequality decompositions           : 0
% 0.56/0.55  # Total rewrite steps                  : 1119
% 0.56/0.55  # ...of those cached                   : 1060
% 0.56/0.55  # Propositional unsat checks           : 0
% 0.56/0.55  #    Propositional check models        : 0
% 0.56/0.55  #    Propositional check unsatisfiable : 0
% 0.56/0.55  #    Propositional clauses             : 0
% 0.56/0.55  #    Propositional clauses after purity: 0
% 0.56/0.55  #    Propositional unsat core size     : 0
% 0.56/0.55  #    Propositional preprocessing time  : 0.000
% 0.56/0.55  #    Propositional encoding time       : 0.000
% 0.56/0.55  #    Propositional solver time         : 0.000
% 0.56/0.55  #    Success case prop preproc time    : 0.000
% 0.56/0.55  #    Success case prop encoding time   : 0.000
% 0.56/0.55  #    Success case prop solver time     : 0.000
% 0.56/0.55  # Current number of processed clauses  : 146
% 0.56/0.55  #    Positive orientable unit clauses  : 73
% 0.56/0.55  #    Positive unorientable unit clauses: 0
% 0.56/0.55  #    Negative unit clauses             : 5
% 0.56/0.55  #    Non-unit-clauses                  : 68
% 0.56/0.55  # Current number of unprocessed clauses: 789
% 0.56/0.55  # ...number of literals in the above   : 3205
% 0.56/0.55  # Current number of archived formulas  : 0
% 0.56/0.55  # Current number of archived clauses   : 101
% 0.56/0.55  # Clause-clause subsumption calls (NU) : 3293
% 0.56/0.55  # Rec. Clause-clause subsumption calls : 1151
% 0.56/0.55  # Non-unit clause-clause subsumptions  : 24
% 0.56/0.55  # Unit Clause-clause subsumption calls : 61
% 0.56/0.55  # Rewrite failures with RHS unbound    : 0
% 0.56/0.55  # BW rewrite match attempts            : 5
% 0.56/0.55  # BW rewrite match successes           : 5
% 0.56/0.55  # Condensation attempts                : 0
% 0.56/0.55  # Condensation successes               : 0
% 0.56/0.55  # Termbank termtop insertions          : 25359
% 0.56/0.55  # Search garbage collected termcells   : 915
% 0.56/0.55  
% 0.56/0.55  # -------------------------------------------------
% 0.56/0.55  # User time                : 0.034 s
% 0.56/0.55  # System time              : 0.002 s
% 0.56/0.55  # Total time               : 0.036 s
% 0.56/0.55  # Maximum resident set size: 1944 pages
% 0.56/0.55  
% 0.56/0.55  # -------------------------------------------------
% 0.56/0.55  # User time                : 0.139 s
% 0.56/0.55  # System time              : 0.011 s
% 0.56/0.55  # Total time               : 0.150 s
% 0.56/0.55  # Maximum resident set size: 1760 pages
% 0.56/0.55  % E---3.1 exiting
%------------------------------------------------------------------------------