↑ 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  : COM299_1 : TPTP v9.3.1. Released v9.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n017.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:12:46 PM UTC 2026

% Result   : Theorem 15.41s 2.88s
% Output   : CNFRefutation 15.41s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   43 (  21 unt;   0 typ;   0 def)
%            Number of atoms       :  102 (  51 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   95 (  36   ~;  22   |;  28   &)
%                                         (   0 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   5 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of types       :    7 (   6 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :   17 (  17 usr;   7 con; 0-3 aty)
%            Number of variables   :   84 (   0 sgn  72   !;  12   ?;  84   :)

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

tff(decl_sort2,type,
    vTable: $tType ).

tff(decl_sort3,type,
    vQuery: $tType ).

tff(decl_sort4,type,
    vOptQuery: $tType ).

tff(decl_sort5,type,
    vTType: $tType ).

tff(decl_sort6,type,
    vTTContext: $tType ).

tff(decl_26,type,
    vtvalue: vTable > vQuery ).

tff(decl_28,type,
    vsomeQuery: vQuery > vOptQuery ).

tff(decl_44,type,
    vnoQuery: vOptQuery ).

tff(decl_52,type,
    vUnion: ( vQuery * vQuery ) > vQuery ).

tff(decl_53,type,
    vq1: vQuery ).

tff(decl_64,type,
    vq2: vQuery ).

tff(decl_83,type,
    visValue: vQuery > $o ).

tff(decl_97,type,
    vreduce: ( vTStore * vQuery ) > vOptQuery ).

tff(decl_109,type,
    visSomeQuery: vOptQuery > $o ).

tff(decl_110,type,
    vstoreContextConsistent: ( vTTContext * vTStore ) > $o ).

tff(decl_112,type,
    vptcheck: ( vTType * ( vQuery * vTTContext ) ) > $o ).

tff(decl_115,type,
    vgetQuery: vOptQuery > vQuery ).

tff(decl_161,type,
    esk25_1: vOptQuery > vQuery ).

tff(decl_326,type,
    esk190_1: vQuery > vTable ).

tff(decl_405,type,
    esk269_3: ( vTStore * ( vQuery * vTable ) ) > vTable ).

tff(decl_406,type,
    esk270_3: ( vTStore * ( vQuery * vTable ) ) > vTable ).

tff(decl_515,type,
    esk379_1: vTStore > vQuery ).

tff(decl_516,type,
    esk380_0: vTStore ).

tff(decl_517,type,
    esk381_0: vTable ).

tff(decl_518,type,
    esk382_0: vTTContext ).

tff(decl_519,type,
    esk383_0: vTType ).

tff('Progress-Union-tvalue-q2-isSomeQuery-True',conjecture,
    ! [X294: vTStore,X53: vTable,X460: vTTContext] :
      ( ( ? [X462: vTType] : vptcheck(X460,vUnion(vq1,vq2),X462)
        & ~ visValue(vUnion(vq1,vq2))
        & vstoreContextConsistent(X294,X460)
        & ( vq1 = vtvalue(X53) )
        & ! [X299: vTable] : ( vq2 != vtvalue(X299) )
        & visSomeQuery(vreduce(vq2,X294)) )
     => ? [X463: vQuery] : ( vreduce(vUnion(vq1,vq2),X294) = vsomeQuery(X463) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','Progress-Union-tvalue-q2-isSomeQuery-True') ).

tff('Progress-Union-IH1',axiom,
    ! [X294: vTStore,X460: vTTContext] :
      ( ( ? [X424: vTType] : vptcheck(X460,vq2,X424)
        & ~ visValue(vq2)
        & vstoreContextConsistent(X294,X460) )
     => ? [X461: vQuery] : ( vreduce(vq2,X294) = vsomeQuery(X461) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','Progress-Union-IH1') ).

tff('TUnion_inv2',axiom,
    ! [X456: vTTContext,X300: vQuery,X297: vQuery,X455: vTType] :
      ( vptcheck(X456,vUnion(X300,X297),X455)
     => vptcheck(X456,X297,X455) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','TUnion_inv2') ).

tff('isValue-true-INV',axiom,
    ! [X9: vQuery] :
      ( visValue(X9)
     => ? [X209: vTable] : ( X9 = vtvalue(X209) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','isValue-true-INV') ).

tff('reduce-5',axiom,
    ! [X53: vTable,X297: vQuery,X294: vTStore] :
      ( ( visSomeQuery(vreduce(X297,X294))
        & ! [X298: vTable,X299: vTable] :
            ( ( X297 != vtvalue(X299) )
            | ( X53 != X298 ) ) )
     => ( vreduce(vUnion(vtvalue(X53),X297),X294) = vsomeQuery(vUnion(vtvalue(X53),vgetQuery(vreduce(X297,X294)))) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','reduce-5') ).

tff('getQuery-0',axiom,
    ! [X55: vQuery] : ( vgetQuery(vsomeQuery(X55)) = X55 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','getQuery-0') ).

tff('isSomeQuery-1',axiom,
    ! [X218: vQuery] : visSomeQuery(vsomeQuery(X218)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','isSomeQuery-1') ).

tff('dom-OptQuery',axiom,
    ! [X36: vOptQuery] :
      ( ? [X9: vQuery] : ( X36 = vsomeQuery(X9) )
      | ( X36 = vnoQuery ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','dom-OptQuery') ).

tff('DIFF-noQuery-someQuery',axiom,
    ! [X9: vQuery] : ( vnoQuery != vsomeQuery(X9) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','DIFF-noQuery-someQuery') ).

tff(c_0_9,negated_conjecture,
    ~ ! [X294: vTStore,X53: vTable,X460: vTTContext] :
        ( ( ? [X462: vTType] : vptcheck(X460,vUnion(vq1,vq2),X462)
          & ~ visValue(vUnion(vq1,vq2))
          & vstoreContextConsistent(X294,X460)
          & ( vq1 = vtvalue(X53) )
          & ! [X299: vTable] : ( vq2 != vtvalue(X299) )
          & visSomeQuery(vreduce(vq2,X294)) )
       => ? [X463: vQuery] : ( vreduce(vUnion(vq1,vq2),X294) = vsomeQuery(X463) ) ),
    inference(assume_negation,[status(cth)],['Progress-Union-tvalue-q2-isSomeQuery-True']) ).

tff(c_0_10,negated_conjecture,
    ~ ! [X294: vTStore,X53: vTable,X460: vTTContext] :
        ( ( ? [X462: vTType] : vptcheck(X460,vUnion(vq1,vq2),X462)
          & ~ visValue(vUnion(vq1,vq2))
          & vstoreContextConsistent(X294,X460)
          & ( vq1 = vtvalue(X53) )
          & ! [X299: vTable] : ( vq2 != vtvalue(X299) )
          & visSomeQuery(vreduce(vq2,X294)) )
       => ? [X463: vQuery] : ( vreduce(vUnion(vq1,vq2),X294) = vsomeQuery(X463) ) ),
    inference(fof_simplification,[status(thm)],[c_0_9]) ).

tff(c_0_11,plain,
    ! [X294: vTStore,X460: vTTContext] :
      ( ( ? [X424: vTType] : vptcheck(X460,vq2,X424)
        & ~ visValue(vq2)
        & vstoreContextConsistent(X294,X460) )
     => ? [X461: vQuery] : ( vreduce(vq2,X294) = vsomeQuery(X461) ) ),
    inference(fof_simplification,[status(thm)],['Progress-Union-IH1']) ).

tff(c_0_12,plain,
    ! [X1552: vTTContext,X1553: vQuery,X1554: vQuery,X1555: vTType] :
      ( vptcheck(X1552,X1554,X1555)
      | ~ vptcheck(X1552,vUnion(X1553,X1554),X1555) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['TUnion_inv2'])])]) ).

tff(c_0_13,negated_conjecture,
    ! [X1583: vTable,X1585: vQuery] :
      ( ( vreduce(vUnion(vq1,vq2),esk380_0) != vsomeQuery(X1585) )
      & vptcheck(esk382_0,vUnion(vq1,vq2),esk383_0)
      & ~ visValue(vUnion(vq1,vq2))
      & vstoreContextConsistent(esk380_0,esk382_0)
      & ( vq1 = vtvalue(esk381_0) )
      & ( vq2 != vtvalue(X1583) )
      & visSomeQuery(vreduce(vq2,esk380_0)) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])])]) ).

tff(c_0_14,plain,
    ! [X1065: vQuery] :
      ( ( X1065 = vtvalue(esk190_1(X1065)) )
      | ~ visValue(X1065) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['isValue-true-INV'])])])]) ).

tff(c_0_15,plain,
    ! [X1576: vTStore,X1577: vTTContext,X1578: vTType] :
      ( ( vreduce(vq2,X1576) = vsomeQuery(esk379_1(X1576)) )
      | ~ vptcheck(X1577,vq2,X1578)
      | visValue(vq2)
      | ~ vstoreContextConsistent(X1576,X1577) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])])])]) ).

tcf(c_0_16,plain,
    ! [X4: vQuery,X9: vQuery,X23: vTTContext,X18: vTType] :
      ( ~ vptcheck(X23,vUnion(X4,X9),X18)
      | vptcheck(X23,X9,X18) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

tcf(c_0_17,negated_conjecture,
    vptcheck(esk382_0,vUnion(vq1,vq2),esk383_0),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

tcf(c_0_18,negated_conjecture,
    ! [X5: vTable] : vq2 != vtvalue(X5),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

tcf(c_0_19,plain,
    ! [X4: vQuery] :
      ( ~ visValue(X4)
      | ( X4 = vtvalue(esk190_1(X4)) ) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

tff(c_0_20,plain,
    ! [X53: vTable,X297: vQuery,X294: vTStore] :
      ( ( visSomeQuery(vreduce(X297,X294))
        & ! [X298: vTable,X299: vTable] :
            ( ( X297 != vtvalue(X299) )
            | ( X53 != X298 ) ) )
     => ( vreduce(vUnion(vtvalue(X53),X297),X294) = vsomeQuery(vUnion(vtvalue(X53),vgetQuery(vreduce(X297,X294)))) ) ),
    inference(fof_simplification,[status(thm)],['reduce-5']) ).

tcf(c_0_21,plain,
    ! [X47: vTStore,X23: vTTContext,X18: vTType] :
      ( ~ vptcheck(X23,vq2,X18)
      | ~ vstoreContextConsistent(X47,X23)
      | ( vreduce(vq2,X47) = vsomeQuery(esk379_1(X47)) )
      | visValue(vq2) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

tcf(c_0_22,negated_conjecture,
    vptcheck(esk382_0,vq2,esk383_0),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

tcf(c_0_23,negated_conjecture,
    ~ visValue(vq2),
    inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19])]) ).

tff(c_0_24,plain,
    ! [X1273: vTable,X1274: vQuery,X1275: vTStore] :
      ( ( ( vreduce(vUnion(vtvalue(X1273),X1274),X1275) = vsomeQuery(vUnion(vtvalue(X1273),vgetQuery(vreduce(X1274,X1275)))) )
        | ~ visSomeQuery(vreduce(X1274,X1275))
        | ( X1274 = vtvalue(esk270_3(X1273,X1274,X1275)) ) )
      & ( ( vreduce(vUnion(vtvalue(X1273),X1274),X1275) = vsomeQuery(vUnion(vtvalue(X1273),vgetQuery(vreduce(X1274,X1275)))) )
        | ~ visSomeQuery(vreduce(X1274,X1275))
        | ( X1273 = esk269_3(X1273,X1274,X1275) ) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])])])])]) ).

tcf(c_0_25,negated_conjecture,
    ! [X47: vTStore] :
      ( ~ vstoreContextConsistent(X47,esk382_0)
      | ( vreduce(vq2,X47) = vsomeQuery(esk379_1(X47)) ) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).

tcf(c_0_26,negated_conjecture,
    vstoreContextConsistent(esk380_0,esk382_0),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

tff(c_0_27,plain,
    ! [X737: vQuery] : ( vgetQuery(vsomeQuery(X737)) = X737 ),
    inference(variable_rename,[status(thm)],['getQuery-0']) ).

tff(c_0_28,plain,
    ! [X1077: vQuery] : visSomeQuery(vsomeQuery(X1077)),
    inference(variable_rename,[status(thm)],['isSomeQuery-1']) ).

tff(c_0_29,plain,
    ! [X602: vOptQuery] :
      ( ( X602 = vsomeQuery(esk25_1(X602)) )
      | ( X602 = vnoQuery ) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['dom-OptQuery'])]) ).

tff(c_0_30,plain,
    ! [X9: vQuery] : ( vnoQuery != vsomeQuery(X9) ),
    inference(fof_simplification,[status(thm)],['DIFF-noQuery-someQuery']) ).

tcf(c_0_31,plain,
    ! [X4: vQuery,X5: vTable,X47: vTStore] :
      ( ~ visSomeQuery(vreduce(X4,X47))
      | ( vreduce(vUnion(vtvalue(X5),X4),X47) = vsomeQuery(vUnion(vtvalue(X5),vgetQuery(vreduce(X4,X47)))) )
      | ( X4 = vtvalue(esk270_3(X5,X4,X47)) ) ),
    inference(split_conjunct,[status(thm)],[c_0_24]) ).

tcf(c_0_32,negated_conjecture,
    vreduce(vq2,esk380_0) = vsomeQuery(esk379_1(esk380_0)),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

tcf(c_0_33,plain,
    ! [X4: vQuery] : vgetQuery(vsomeQuery(X4)) = X4,
    inference(split_conjunct,[status(thm)],[c_0_27]) ).

tcf(c_0_34,plain,
    ! [X4: vQuery] : visSomeQuery(vsomeQuery(X4)),
    inference(split_conjunct,[status(thm)],[c_0_28]) ).

tcf(c_0_35,negated_conjecture,
    ! [X4: vQuery] : vreduce(vUnion(vq1,vq2),esk380_0) != vsomeQuery(X4),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

tcf(c_0_36,plain,
    ! [X36: vOptQuery] :
      ( ( X36 = vsomeQuery(esk25_1(X36)) )
      | ( X36 = vnoQuery ) ),
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

tff(c_0_37,plain,
    ! [X606: vQuery] : ( vnoQuery != vsomeQuery(X606) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_30])]) ).

tcf(c_0_38,negated_conjecture,
    ! [X5: vTable] : vreduce(vUnion(vtvalue(X5),vq2),esk380_0) = vsomeQuery(vUnion(vtvalue(X5),esk379_1(esk380_0))),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_34])]),c_0_18]) ).

tcf(c_0_39,negated_conjecture,
    vq1 = vtvalue(esk381_0),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

tcf(c_0_40,negated_conjecture,
    vreduce(vUnion(vq1,vq2),esk380_0) = vnoQuery,
    inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36])]) ).

tcf(c_0_41,plain,
    ! [X4: vQuery] : vnoQuery != vsomeQuery(X4),
    inference(split_conjunct,[status(thm)],[c_0_37]) ).

cnf(c_0_42,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]),c_0_41]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : COM299_1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.07  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.45  % Computer : n017.cluster.edu
% 0.17/0.45  % Model    : x86_64 x86_64
% 0.17/0.45  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.45  % Memory   : 8046.5625MB
% 0.17/0.45  % OS       : Linux 6.8.0-71-generic
% 0.17/0.45  % CPULimit : 300
% 0.17/0.45  % WCLimit  : 300
% 0.17/0.45  % DateTime : Mon Sep 21 14:18:12 UTC 2026
% 0.17/0.45  % CPUTime  : 
% 0.17/0.45  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.27/0.52  Running first-order theorem proving
% 0.27/0.52  Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 15.41/2.88  % Version: 3.5.1
% 15.41/2.88  % Preprocessing class: FSLSSMSMSSSNFFN.
% 15.41/2.88  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.41/2.88  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 15.41/2.88  % Starting new_bool_3 with 300s (1) cores
% 15.41/2.88  % Starting new_bool_1 with 300s (1) cores
% 15.41/2.88  % Starting sh5l with 300s (1) cores
% 15.41/2.88  % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2541173 completed with status 0
% 15.41/2.88  % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 15.41/2.88  % Preprocessing class: FSLSSMSMSSSNFFN.
% 15.41/2.88  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.41/2.88  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 15.41/2.88  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 15.41/2.88  % No SInE strategy applied
% 15.41/2.88  % Search class: FGHSM-SMLM32-DFFFFFNN
% 15.41/2.88  % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 15.41/2.88  % Starting SubtermCWHack with 136s (1) cores
% 15.41/2.88  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 15.41/2.88  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 113s (1) cores
% 15.41/2.88  % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 113s (1) cores
% 15.41/2.88  % Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 15.41/2.88  % G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with pid 2541183 completed with status 0
% 15.41/2.88  % Result found by G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y
% 15.41/2.88  % Preprocessing class: FSLSSMSMSSSNFFN.
% 15.41/2.88  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.41/2.88  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 15.41/2.88  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 15.41/2.88  % No SInE strategy applied
% 15.41/2.88  % Search class: FGHSM-SMLM32-DFFFFFNN
% 15.41/2.88  % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 15.41/2.88  % Starting SubtermCWHack with 136s (1) cores
% 15.41/2.88  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 15.41/2.88  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 113s (1) cores
% 15.41/2.88  % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 113s (1) cores
% 15.41/2.88  % Preprocessing time       : 0.062 s
% 15.41/2.88  
% 15.41/2.88  % Proof found!
% 15.41/2.88  % SZS status Theorem
% 15.41/2.88  % SZS output start CNFRefutation
% See solution above
% 15.41/2.88  % Parsed axioms                        : 412
% 15.41/2.88  % Removed by relevancy pruning/SinE    : 0
% 15.41/2.88  % Initial clauses                      : 2917
% 15.41/2.88  % Removed in clause preprocessing      : 124
% 15.41/2.88  % Initial clauses in saturation        : 2793
% 15.41/2.88  % Processed clauses                    : 2895
% 15.41/2.88  % ...of these trivial                  : 4
% 15.41/2.88  % ...subsumed                          : 140
% 15.41/2.88  % ...remaining for further processing  : 2751
% 15.41/2.88  % Other redundant clauses eliminated   : 6420
% 15.41/2.88  % Clauses deleted for lack of memory   : 0
% 15.41/2.88  % Backward-subsumed                    : 2
% 15.41/2.88  % Backward-rewritten                   : 7
% 15.41/2.88  % Generated clauses                    : 28540
% 15.41/2.88  % ...of the previous two non-redundant : 21814
% 15.41/2.88  % ...aggressively subsumed             : 0
% 15.41/2.88  % Contextual simplify-reflections      : 8
% 15.41/2.88  % Paramodulations                      : 22082
% 15.41/2.88  % Factorizations                       : 1
% 15.41/2.88  % NegExts                              : 0
% 15.41/2.88  % Equation resolutions                 : 6468
% 15.41/2.88  % Disequality decompositions           : 0
% 15.41/2.88  % Total rewrite steps                  : 896
% 15.41/2.88  % ...of those cached                   : 804
% 15.41/2.88  % Propositional unsat checks           : 0
% 15.41/2.88  %    Propositional check models        : 0
% 15.41/2.88  %    Propositional check unsatisfiable : 0
% 15.41/2.88  %    Propositional clauses             : 0
% 15.41/2.88  %    Propositional clauses after purity: 0
% 15.41/2.88  %    Propositional unsat core size     : 0
% 15.41/2.88  %    Propositional preprocessing time  : 0.000
% 15.41/2.88  %    Propositional encoding time       : 0.000
% 15.41/2.88  %    Propositional solver time         : 0.000
% 15.41/2.88  %    Success case prop preproc time    : 0.000
% 15.41/2.88  %    Success case prop encoding time   : 0.000
% 15.41/2.88  %    Success case prop solver time     : 0.000
% 15.41/2.88  % Current number of processed clauses  : 2592
% 15.41/2.88  %    Positive orientable unit clauses  : 85
% 15.41/2.88  %    Positive unorientable unit clauses: 3
% 15.41/2.88  %    Negative unit clauses             : 77
% 15.41/2.88  %    Non-unit-clauses                  : 2427
% 15.41/2.88  % Current number of unprocessed clauses: 21676
% 15.41/2.88  % ...number of literals in the above   : 97099
% 15.41/2.88  % Current number of archived formulas  : 0
% 15.41/2.88  % Current number of archived clauses   : 16
% 15.41/2.88  % Clause-clause subsumption calls (NU) : 1080607
% 15.41/2.88  % Rec. Clause-clause subsumption calls : 293668
% 15.41/2.88  % Non-unit clause-clause subsumptions  : 127
% 15.41/2.88  % Unit Clause-clause subsumption calls : 34167
% 15.41/2.88  % Rewrite failures with RHS unbound    : 6
% 15.41/2.88  % BW rewrite match attempts            : 10
% 15.41/2.88  % BW rewrite match successes           : 6
% 15.41/2.88  % Condensation attempts                : 0
% 15.41/2.88  % Condensation successes               : 0
% 15.41/2.88  % Termbank termtop insertions          : 533410
% 15.41/2.88  % Search garbage collected termcells   : 19689
% 15.41/2.88  
% 15.41/2.88  % -------------------------------------------------
% 15.41/2.88  % User time                : 2.183 s
% 15.41/2.88  % System time              : 0.069 s
% 15.41/2.88  % Total time               : 2.252 s
% 15.41/2.88  % Maximum resident set size: 9304 pages
% 15.41/2.88  
% 15.41/2.88  % -------------------------------------------------
% 15.41/2.88  % User time                : 10.185 s
% 15.41/2.88  % System time              : 0.309 s
% 15.41/2.88  % Total time               : 10.494 s
% 15.41/2.88  % Maximum resident set size: 5376 pages
% 15.41/2.88  % E exiting
%------------------------------------------------------------------------------