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

% Computer : n014.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:29 PM UTC 2026

% Result   : Theorem 228.35s 30.10s
% Output   : CNFRefutation 228.35s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   49 (  10 unt;   0 def)
%            Number of atoms       :  165 (  65 equ)
%            Maximal formula atoms :   13 (   3 avg)
%            Number of connectives :  192 (  76   ~;  63   |;  32   &)
%                                         (   0 <=>;  21  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   19 (   6 avg)
%            Maximal term depth    :    8 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :   14 (  14 usr;   8 con; 0-3 aty)
%            Number of variables   :  194 (  13 sgn 123   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof('T-subst-abs-3',conjecture,
    ! [X15,X20,X9,X11,X21,X10,X28] :
      ( ( vtcheck(vbind(X9,X15,X20),vabs(X21,X10,veabs),X28)
        & vtcheck(X20,X11,X15)
        & visFreeVar(X21,X11)
        & X9 != X21 )
     => vtcheck(X20,vsubst(X9,X11,vabs(X21,X10,veabs)),X28) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','T-subst-abs-3') ).

fof('gensym-is-fresh',axiom,
    ! [X14,X11] :
      ( vgensym(X11) = X14
     => ~ visFreeVar(X14,X11) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','gensym-is-fresh') ).

fof('alpha-equiv-typing',axiom,
    ! [X11,X20,X12,X15] :
      ( ( valphaEquivalent(X11,X12)
        & vtcheck(X20,X11,X15) )
     => vtcheck(X20,X12,X15) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','alpha-equiv-typing') ).

fof('alpha-equiv-subst-abs',axiom,
    ! [X10,X9,X21,X11] :
      ( ~ visFreeVar(X21,X11)
     => valphaEquivalent(vabs(X9,X10,X11),vabs(X21,X10,vsubst(X9,vvar(X21),X11))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','alpha-equiv-subst-abs') ).

fof(isFreeVar2,axiom,
    ! [X1,X4,X12,X14,X13] :
      ( ( X4 = vapp(X12,X13)
        & X1 = X14 )
     => ( ( visFreeVar(X1,X4)
         => ( visFreeVar(X14,X13)
            | visFreeVar(X14,X12) ) )
        & ( ( visFreeVar(X14,X13)
            | visFreeVar(X14,X12) )
         => visFreeVar(X1,X4) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',isFreeVar2) ).

fof('T-subst-abs-2-gen',axiom,
    ! [X15,X20,X9,X11,X21,X10,X12,X28] :
      ( ( vtcheck(vbind(X9,X15,X20),vabs(X21,X10,X12),X28)
        & vtcheck(X20,X11,X15)
        & ~ visFreeVar(X21,X11)
        & X9 != X21 )
     => vtcheck(X20,vsubst(X9,X11,vabs(X21,X10,X12)),X28) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','T-subst-abs-2-gen') ).

fof(subst4,axiom,
    ! [X1,X4,X6,X19,X9,X11,X15,X21,X24,X12] :
      ( ( X6 = vabs(X21,X15,X12)
        & X4 = X11
        & X1 = X9 )
     => ( ( X24 = vgensym(vapp(vapp(X11,X12),vvar(X9)))
          & visFreeVar(X21,X11)
          & X9 != X21 )
       => ( X19 = vsubst(X1,X4,X6)
         => X19 = vsubst(X9,X11,vabs(X24,X15,vsubst(X21,vvar(X24),X12))) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',subst4) ).

fof('fresh-unequal-var-3',axiom,
    ! [X11,X12,X9,X24] :
      ( X24 = vgensym(vapp(vapp(X11,X12),vvar(X9)))
     => X9 != X24 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','fresh-unequal-var-3') ).

fof(c_0_8,negated_conjecture,
    ~ ! [X15,X20,X9,X11,X21,X10,X28] :
        ( ( vtcheck(vbind(X9,X15,X20),vabs(X21,X10,veabs),X28)
          & vtcheck(X20,X11,X15)
          & visFreeVar(X21,X11)
          & X9 != X21 )
       => vtcheck(X20,vsubst(X9,X11,vabs(X21,X10,veabs)),X28) ),
    inference(assume_negation,[status(cth)],['T-subst-abs-3']) ).

fof(c_0_9,negated_conjecture,
    ~ ! [X15,X20,X9,X11,X21,X10,X28] :
        ( ( vtcheck(vbind(X9,X15,X20),vabs(X21,X10,veabs),X28)
          & vtcheck(X20,X11,X15)
          & visFreeVar(X21,X11)
          & X9 != X21 )
       => vtcheck(X20,vsubst(X9,X11,vabs(X21,X10,veabs)),X28) ),
    inference(fof_simplification,[status(thm)],[c_0_8]) ).

fof(c_0_10,plain,
    ! [X14,X11] :
      ( vgensym(X11) = X14
     => ~ visFreeVar(X14,X11) ),
    inference(fof_simplification,[status(thm)],['gensym-is-fresh']) ).

fof(c_0_11,plain,
    ! [X90,X91,X92,X93] :
      ( vtcheck(X91,X92,X93)
      | ~ valphaEquivalent(X90,X92)
      | ~ vtcheck(X91,X90,X93) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['alpha-equiv-typing'])])]) ).

fof(c_0_12,negated_conjecture,
    ( ~ vtcheck(esk2_0,vsubst(esk3_0,esk4_0,vabs(esk5_0,esk6_0,veabs)),esk7_0)
    & vtcheck(vbind(esk3_0,esk1_0,esk2_0),vabs(esk5_0,esk6_0,veabs),esk7_0)
    & vtcheck(esk2_0,esk4_0,esk1_0)
    & visFreeVar(esk5_0,esk4_0)
    & esk3_0 != esk5_0 ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).

fof(c_0_13,plain,
    ! [X10,X9,X21,X11] :
      ( ~ visFreeVar(X21,X11)
     => valphaEquivalent(vabs(X9,X10,X11),vabs(X21,X10,vsubst(X9,vvar(X21),X11))) ),
    inference(fof_simplification,[status(thm)],['alpha-equiv-subst-abs']) ).

fof(c_0_14,plain,
    ! [X234,X235] :
      ( ~ visFreeVar(X234,X235)
      | vgensym(X235) != X234 ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).

fof(c_0_15,plain,
    ! [X229,X230,X231,X232,X233] :
      ( ( X230 != vapp(X231,X233)
        | X229 != X232
        | visFreeVar(X232,X233)
        | visFreeVar(X232,X231)
        | ~ visFreeVar(X229,X230) )
      & ( X230 != vapp(X231,X233)
        | X229 != X232
        | visFreeVar(X229,X230)
        | ~ visFreeVar(X232,X233) )
      & ( X230 != vapp(X231,X233)
        | X229 != X232
        | visFreeVar(X229,X230)
        | ~ visFreeVar(X232,X231) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[isFreeVar2])])])]) ).

fof(c_0_16,plain,
    ! [X15,X20,X9,X11,X21,X10,X12,X28] :
      ( ( vtcheck(vbind(X9,X15,X20),vabs(X21,X10,X12),X28)
        & vtcheck(X20,X11,X15)
        & ~ visFreeVar(X21,X11)
        & X9 != X21 )
     => vtcheck(X20,vsubst(X9,X11,vabs(X21,X10,X12)),X28) ),
    inference(fof_simplification,[status(thm)],['T-subst-abs-2-gen']) ).

cnf(c_0_17,plain,
    ( ~ valphaEquivalent(X2,X4)
    | ~ vtcheck(X1,X2,X3)
    | vtcheck(X1,X4,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_18,negated_conjecture,
    vtcheck(vbind(esk3_0,esk1_0,esk2_0),vabs(esk5_0,esk6_0,veabs),esk7_0),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

fof(c_0_19,plain,
    ! [X161,X162,X163,X164] :
      ( valphaEquivalent(vabs(X162,X161,X164),vabs(X163,X161,vsubst(X162,vvar(X163),X164)))
      | visFreeVar(X163,X164) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])]) ).

fof(c_0_20,plain,
    ! [X1,X4,X6,X19,X9,X11,X15,X21,X24,X12] :
      ( ( X6 = vabs(X21,X15,X12)
        & X4 = X11
        & X1 = X9 )
     => ( ( X24 = vgensym(vapp(vapp(X11,X12),vvar(X9)))
          & visFreeVar(X21,X11)
          & X9 != X21 )
       => ( X19 = vsubst(X1,X4,X6)
         => X19 = vsubst(X9,X11,vabs(X24,X15,vsubst(X21,vvar(X24),X12))) ) ) ),
    inference(fof_simplification,[status(thm)],[subst4]) ).

fof(c_0_21,plain,
    ! [X11,X12,X9,X24] :
      ( X24 = vgensym(vapp(vapp(X11,X12),vvar(X9)))
     => X9 != X24 ),
    inference(fof_simplification,[status(thm)],['fresh-unequal-var-3']) ).

cnf(c_0_22,plain,
    ( ~ visFreeVar(X2,X1)
    | vgensym(X1) != X2 ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_23,plain,
    ( X4 != vapp(X2,X5)
    | X3 != X1
    | ~ visFreeVar(X1,X2)
    | visFreeVar(X3,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

fof(c_0_24,plain,
    ! [X94,X95,X96,X97,X98,X99,X100,X101] :
      ( vtcheck(X95,vsubst(X96,X97,vabs(X98,X99,X100)),X101)
      | ~ vtcheck(vbind(X96,X94,X95),vabs(X98,X99,X100),X101)
      | ~ vtcheck(X95,X97,X94)
      | visFreeVar(X98,X97)
      | X96 = X98 ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])]) ).

cnf(c_0_25,negated_conjecture,
    ( ~ valphaEquivalent(vabs(esk5_0,esk6_0,veabs),X1)
    | vtcheck(vbind(esk3_0,esk1_0,esk2_0),X1,esk7_0) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_26,plain,
    ( valphaEquivalent(vabs(X3,X4,X2),vabs(X1,X4,vsubst(X3,vvar(X1),X2)))
    | visFreeVar(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

fof(c_0_27,plain,
    ! [X133,X134,X135,X136,X137,X138,X139,X140,X141,X142] :
      ( X136 = vsubst(X137,X138,vabs(X141,X139,vsubst(X140,vvar(X141),X142)))
      | X136 != vsubst(X133,X134,X135)
      | X141 != vgensym(vapp(vapp(X138,X142),vvar(X137)))
      | ~ visFreeVar(X140,X138)
      | X137 = X140
      | X135 != vabs(X140,X139,X142)
      | X134 != X138
      | X133 != X137 ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])]) ).

fof(c_0_28,plain,
    ! [X250,X251,X252,X253] :
      ( X252 != X253
      | X253 != vgensym(vapp(vapp(X250,X251),vvar(X252))) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])]) ).

cnf(c_0_29,plain,
    ~ visFreeVar(vgensym(X1),X1),
    inference(er,[status(thm)],[c_0_22]) ).

cnf(c_0_30,plain,
    ( ~ visFreeVar(X1,X2)
    | visFreeVar(X1,vapp(X2,X3)) ),
    inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_23])]) ).

cnf(c_0_31,plain,
    ( X4 != vapp(X5,X2)
    | X3 != X1
    | ~ visFreeVar(X1,X2)
    | visFreeVar(X3,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_32,plain,
    ( ~ vtcheck(vbind(X1,X5,X4),vabs(X2,X6,X7),X8)
    | ~ vtcheck(X4,X3,X5)
    | vtcheck(X4,vsubst(X1,X3,vabs(X2,X6,X7)),X8)
    | visFreeVar(X2,X3)
    | X1 = X2 ),
    inference(split_conjunct,[status(thm)],[c_0_24]) ).

cnf(c_0_33,negated_conjecture,
    ( visFreeVar(X1,veabs)
    | vtcheck(vbind(esk3_0,esk1_0,esk2_0),vabs(X1,esk6_0,vsubst(esk5_0,vvar(X1),veabs)),esk7_0) ),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_34,plain,
    ( X10 != vsubst(X1,X3,X5)
    | X9 != vgensym(vapp(vapp(X4,X8),vvar(X2)))
    | ~ visFreeVar(X6,X4)
    | X5 != vabs(X6,X7,X8)
    | X3 != X4
    | X1 != X2
    | X10 = vsubst(X2,X4,vabs(X9,X7,vsubst(X6,vvar(X9),X8)))
    | X2 = X6 ),
    inference(split_conjunct,[status(thm)],[c_0_27]) ).

cnf(c_0_35,plain,
    ( X4 != X1
    | X1 != vgensym(vapp(vapp(X2,X3),vvar(X4))) ),
    inference(split_conjunct,[status(thm)],[c_0_28]) ).

cnf(c_0_36,plain,
    ~ visFreeVar(vgensym(vapp(X1,X2)),X1),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_37,plain,
    ( ~ visFreeVar(X1,X3)
    | visFreeVar(X1,vapp(X2,X3)) ),
    inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_31])]) ).

cnf(c_0_38,negated_conjecture,
    esk3_0 != esk5_0,
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_39,negated_conjecture,
    ( ~ vtcheck(esk2_0,X2,esk1_0)
    | visFreeVar(X1,X2)
    | visFreeVar(X1,veabs)
    | vtcheck(esk2_0,vsubst(esk3_0,X2,vabs(X1,esk6_0,vsubst(esk5_0,vvar(X1),veabs))),esk7_0)
    | esk3_0 = X1 ),
    inference(spm,[status(thm)],[c_0_32,c_0_33]) ).

cnf(c_0_40,plain,
    ( ~ visFreeVar(X5,X2)
    | X1 = X5
    | vsubst(X1,X2,vabs(vgensym(vapp(vapp(X2,X3),vvar(X1))),X4,vsubst(X5,vvar(vgensym(vapp(vapp(X2,X3),vvar(X1)))),X3))) = vsubst(X1,X2,vabs(X5,X4,X3)) ),
    inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_34])])])])]) ).

cnf(c_0_41,plain,
    vgensym(vapp(vapp(X1,X2),vvar(X3))) != X3,
    inference(er,[status(thm)],[c_0_35]) ).

cnf(c_0_42,plain,
    ~ visFreeVar(vgensym(vapp(vapp(X1,X2),X3)),X2),
    inference(spm,[status(thm)],[c_0_36,c_0_37]) ).

cnf(c_0_43,plain,
    ~ visFreeVar(vgensym(vapp(vapp(X1,X2),X3)),X1),
    inference(spm,[status(thm)],[c_0_36,c_0_30]) ).

cnf(c_0_44,negated_conjecture,
    ( ~ vtcheck(esk2_0,X1,esk1_0)
    | visFreeVar(esk5_0,X1)
    | vtcheck(esk2_0,vsubst(esk3_0,X1,vabs(esk5_0,esk6_0,veabs)),esk7_0) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_18]),c_0_38]) ).

cnf(c_0_45,negated_conjecture,
    ~ vtcheck(esk2_0,vsubst(esk3_0,esk4_0,vabs(esk5_0,esk6_0,veabs)),esk7_0),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_46,negated_conjecture,
    ( ~ vtcheck(esk2_0,X1,esk1_0)
    | vtcheck(esk2_0,vsubst(esk3_0,X1,vabs(esk5_0,esk6_0,veabs)),esk7_0) ),
    inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]),c_0_42]),c_0_43]),c_0_38]),c_0_44]) ).

cnf(c_0_47,negated_conjecture,
    vtcheck(esk2_0,esk4_0,esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_48,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : COM132+2 : TPTP v9.3.1. Released v6.4.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.37  % Computer : n014.cluster.edu
% 0.09/0.37  % Model    : x86_64 x86_64
% 0.09/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37  % Memory   : 8046.5625MB
% 0.09/0.37  % OS       : Linux 6.8.0-71-generic
% 0.09/0.37  % CPULimit : 300
% 0.09/0.37  % WCLimit  : 300
% 0.09/0.37  % DateTime : Mon Sep 21 14:17:19 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.41  Running first-order theorem proving
% 0.13/0.41  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
% 199.31/30.10  % Version: 3.5.1
% 199.31/30.10  % Preprocessing class: FSLSSMSSSSSNFFN.
% 199.31/30.10  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 199.31/30.10  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 199.31/30.10  % Starting new_bool_3 with 300s (1) cores
% 199.31/30.10  % Starting new_bool_1 with 300s (1) cores
% 199.31/30.10  % Starting sh5l with 300s (1) cores
% 199.31/30.10  % sh5l with pid 90014 completed with status 0
% 199.31/30.10  % Result found by sh5l
% 199.31/30.10  % Preprocessing class: FSLSSMSSSSSNFFN.
% 199.31/30.10  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 199.31/30.10  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 199.31/30.10  % Starting new_bool_3 with 300s (1) cores
% 199.31/30.10  % Starting new_bool_1 with 300s (1) cores
% 199.31/30.10  % Starting sh5l with 300s (1) cores
% 199.31/30.10  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 199.31/30.10  % SinE strategy is gf500_gu_R04_F100_L20000
% 199.31/30.10  % Search class: FGHSF-FSLS33-MFFFFFNN
% 199.31/30.10  % partial match(1): FGHSF-FSLS33-SFFFFFNN
% 199.31/30.10  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 199.31/30.10  % Starting SubtermCWHack with 28s (1) cores
% 199.31/30.10  % SubtermCWHack with pid 90021 completed with status 8
% 228.35/30.10  % Starting sh5l with 31s (1) cores
% 228.35/30.10  % sh5l with pid 90056 completed with status 0
% 228.35/30.10  % Result found by sh5l
% 228.35/30.10  % Preprocessing class: FSLSSMSSSSSNFFN.
% 228.35/30.10  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 228.35/30.10  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 228.35/30.10  % Starting new_bool_3 with 300s (1) cores
% 228.35/30.10  % Starting new_bool_1 with 300s (1) cores
% 228.35/30.10  % Starting sh5l with 300s (1) cores
% 228.35/30.10  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 228.35/30.10  % SinE strategy is gf500_gu_R04_F100_L20000
% 228.35/30.10  % Search class: FGHSF-FSLS33-MFFFFFNN
% 228.35/30.10  % partial match(1): FGHSF-FSLS33-SFFFFFNN
% 228.35/30.10  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 228.35/30.10  % Starting SubtermCWHack with 28s (1) cores
% 228.35/30.10  % SubtermCWHack with pid 90021 completed with status 8
% 228.35/30.10  % Starting sh5l with 31s (1) cores
% 228.35/30.10  % Preprocessing time       : 0.009 s
% 228.35/30.10  % Presaturation interreduction done
% 228.35/30.10  
% 228.35/30.10  % Proof found!
% 228.35/30.10  % SZS status Theorem
% 228.35/30.10  % SZS output start CNFRefutation
% See solution above
% 228.35/30.10  % Parsed axioms                        : 53
% 228.35/30.10  % Removed by relevancy pruning/SinE    : 1
% 228.35/30.10  % Initial clauses                      : 309
% 228.35/30.10  % Removed in clause preprocessing      : 10
% 228.35/30.10  % Initial clauses in saturation        : 299
% 228.35/30.10  % Processed clauses                    : 2106
% 228.35/30.10  % ...of these trivial                  : 17
% 228.35/30.10  % ...subsumed                          : 1046
% 228.35/30.10  % ...remaining for further processing  : 1043
% 228.35/30.10  % Other redundant clauses eliminated   : 783
% 228.35/30.10  % Clauses deleted for lack of memory   : 0
% 228.35/30.10  % Backward-subsumed                    : 28
% 228.35/30.10  % Backward-rewritten                   : 92
% 228.35/30.10  % Generated clauses                    : 13884
% 228.35/30.10  % ...of the previous two non-redundant : 13111
% 228.35/30.10  % ...aggressively subsumed             : 0
% 228.35/30.10  % Contextual simplify-reflections      : 18
% 228.35/30.10  % Paramodulations                      : 13124
% 228.35/30.10  % Factorizations                       : 0
% 228.35/30.10  % NegExts                              : 0
% 228.35/30.10  % Equation resolutions                 : 798
% 228.35/30.10  % Disequality decompositions           : 0
% 228.35/30.10  % Total rewrite steps                  : 464
% 228.35/30.10  % ...of those cached                   : 404
% 228.35/30.10  % Propositional unsat checks           : 0
% 228.35/30.10  %    Propositional check models        : 0
% 228.35/30.10  %    Propositional check unsatisfiable : 0
% 228.35/30.10  %    Propositional clauses             : 0
% 228.35/30.10  %    Propositional clauses after purity: 0
% 228.35/30.10  %    Propositional unsat core size     : 0
% 228.35/30.10  %    Propositional preprocessing time  : 0.000
% 228.35/30.10  %    Propositional encoding time       : 0.000
% 228.35/30.10  %    Propositional solver time         : 0.000
% 228.35/30.10  %    Success case prop preproc time    : 0.000
% 228.35/30.10  %    Success case prop encoding time   : 0.000
% 228.35/30.10  %    Success case prop solver time     : 0.000
% 228.35/30.10  % Current number of processed clauses  : 544
% 228.35/30.10  %    Positive orientable unit clauses  : 23
% 228.35/30.10  %    Positive unorientable unit clauses: 3
% 228.35/30.10  %    Negative unit clauses             : 201
% 228.35/30.10  %    Non-unit-clauses                  : 317
% 228.35/30.10  % Current number of unprocessed clauses: 11555
% 228.35/30.10  % ...number of literals in the above   : 39423
% 228.35/30.10  % Current number of archived formulas  : 0
% 228.35/30.10  % Current number of archived clauses   : 419
% 228.35/30.10  % Clause-clause subsumption calls (NU) : 56079
% 228.35/30.10  % Rec. Clause-clause subsumption calls : 17468
% 228.35/30.10  % Non-unit clause-clause subsumptions  : 292
% 228.35/30.10  % Unit Clause-clause subsumption calls : 9812
% 228.35/30.10  % Rewrite failures with RHS unbound    : 50
% 228.35/30.10  % BW rewrite match attempts            : 247
% 228.35/30.10  % BW rewrite match successes           : 7
% 228.35/30.10  % Condensation attempts                : 2106
% 228.35/30.10  % Condensation successes               : 1
% 228.35/30.10  % Termbank termtop insertions          : 235192
% 228.35/30.10  % Search garbage collected termcells   : 2991
% 228.35/30.10  
% 228.35/30.10  % -------------------------------------------------
% 228.35/30.10  % User time                : 27.635 s
% 228.35/30.10  % System time              : 1.129 s
% 228.35/30.10  % Total time               : 28.764 s
% 228.35/30.10  % Maximum resident set size: 4448 pages
% 228.35/30.10  
% 228.35/30.10  % -------------------------------------------------
% 228.35/30.10  % User time                : 27.640 s
% 228.35/30.10  % System time              : 1.135 s
% 228.35/30.10  % Total time               : 28.775 s
% 228.35/30.10  % Maximum resident set size: 4608 pages
% 228.35/30.10  % E exiting
%------------------------------------------------------------------------------