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

% Computer : n009.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 01:56:47 PM UTC 2026

% Result   : Theorem 3.13s 0.87s
% Output   : CNFRefutation 3.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   75 (  26 unt;   0 def)
%            Number of atoms       :  152 (  40 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :  138 (  61   ~;  59   |;  10   &)
%                                         (   2 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :  133 (   2 sgn  74   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof('holds(conseq(scope(318)), 525, 0)',conjecture,
    greater(vmul(vd517,vd519),vmul(vd518,vd520)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','holds(conseq(scope(318)), 525, 0)') ).

fof('ass(cond(312, 0), 0)',axiom,
    ! [X1,X2,X3,X4] :
      ( ( greater(X1,X2)
        & greater(X3,X4) )
     => greater(vmul(X1,X3),vmul(X2,X4)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(312, 0), 0)') ).

fof('def(cond(conseq(axiom(3)), 16), 1)',axiom,
    ! [X74,X75] :
      ( geq(X75,X74)
    <=> ( X75 = X74
        | greater(X75,X74) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','def(cond(conseq(axiom(3)), 16), 1)') ).

fof('dis(antec(scope(318)))',axiom,
    ( ( greater(vd517,vd518)
      & geq(vd519,vd520) )
    | ( geq(vd517,vd518)
      & greater(vd519,vd520) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','dis(antec(scope(318)))') ).

fof('ass(cond(goal(88), 0), 1)',axiom,
    ! [X88,X89] :
      ( ~ ? [X91] : X89 = vplus(X88,X91)
      | X88 != X89 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(goal(88), 0), 1)') ).

fof('ass(cond(conjunct1(307), 0), 0)',axiom,
    ! [X11,X12,X13] :
      ( greater(vmul(X11,X12),vmul(X13,X12))
     => greater(X11,X13) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(conjunct1(307), 0), 0)') ).

fof('ass(cond(281, 0), 0)',axiom,
    ! [X24,X25,X26] : vmul(X24,vplus(X25,X26)) = vplus(vmul(X24,X25),vmul(X24,X26)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(281, 0), 0)') ).

fof('def(cond(conseq(axiom(3)), 11), 1)',axiom,
    ! [X85,X86] :
      ( greater(X86,X85)
    <=> ? [X87] : X86 = vplus(X85,X87) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','def(cond(conseq(axiom(3)), 11), 1)') ).

fof('ass(cond(299, 0), 2)',axiom,
    ! [X14,X19,X20] :
      ( greater(X19,X20)
     => greater(vmul(X19,X14),vmul(X20,X14)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(299, 0), 2)') ).

fof('ass(cond(goal(130), 0), 1)',axiom,
    ! [X80,X81] :
      ( ~ less(X80,X81)
      | X80 != X81 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(goal(130), 0), 1)') ).

fof('ass(cond(168, 0), 0)',axiom,
    ! [X65,X66,X67] :
      ( ( less(X65,X66)
        & less(X66,X67) )
     => less(X65,X67) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(168, 0), 0)') ).

fof('ass(cond(140, 0), 0)',axiom,
    ! [X78,X79] :
      ( greater(X78,X79)
     => less(X79,X78) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(140, 0), 0)') ).

fof('ass(cond(270, 0), 0)',axiom,
    ! [X27,X28] : vmul(X27,X28) = vmul(X28,X27),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(270, 0), 0)') ).

fof('ass(cond(conjunct2(conjunct2(307)), 0), 0)',axiom,
    ! [X5,X6,X7] :
      ( less(vmul(X5,X6),vmul(X7,X6))
     => less(X5,X7) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(conjunct2(conjunct2(307)), 0), 0)') ).

fof('ass(cond(goal(130), 0), 0)',axiom,
    ! [X80,X81] :
      ( less(X80,X81)
      | greater(X80,X81)
      | X80 = X81 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(goal(130), 0), 0)') ).

fof(c_0_15,negated_conjecture,
    ~ greater(vmul(vd517,vd519),vmul(vd518,vd520)),
    inference(assume_negation,[status(cth)],['holds(conseq(scope(318)), 525, 0)']) ).

fof(c_0_16,negated_conjecture,
    ~ greater(vmul(vd517,vd519),vmul(vd518,vd520)),
    inference(fof_simplification,[status(thm)],[c_0_15]) ).

fof(c_0_17,negated_conjecture,
    ~ greater(vmul(vd517,vd519),vmul(vd518,vd520)),
    inference(fof_nnf,[status(thm)],[c_0_16]) ).

fof(c_0_18,plain,
    ! [X114,X115,X116,X117] :
      ( greater(vmul(X114,X116),vmul(X115,X117))
      | ~ greater(X114,X115)
      | ~ greater(X116,X117) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(312, 0), 0)'])])]) ).

fof(c_0_19,plain,
    ! [X201,X202] :
      ( ( geq(X202,X201)
        | X202 != X201 )
      & ( geq(X202,X201)
        | ~ greater(X202,X201) )
      & ( X202 = X201
        | greater(X202,X201)
        | ~ geq(X202,X201) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['def(cond(conseq(axiom(3)), 16), 1)'])])])]) ).

fof(c_0_20,plain,
    ( ( geq(vd517,vd518)
      | greater(vd517,vd518) )
    & ( geq(vd517,vd518)
      | geq(vd519,vd520) )
    & ( greater(vd519,vd520)
      | greater(vd517,vd518) )
    & ( greater(vd519,vd520)
      | geq(vd519,vd520) ) ),
    inference(distribute,[status(thm)],['dis(antec(scope(318)))']) ).

cnf(c_0_21,negated_conjecture,
    ~ greater(vmul(vd517,vd519),vmul(vd518,vd520)),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_22,plain,
    ( ~ greater(X3,X4)
    | ~ greater(X1,X2)
    | greater(vmul(X3,X1),vmul(X4,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_23,plain,
    ( ~ geq(X1,X2)
    | X1 = X2
    | greater(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_24,plain,
    ( greater(vd519,vd520)
    | geq(vd519,vd520) ),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

fof(c_0_25,plain,
    ! [X88,X89] :
      ( ~ ? [X91] : X89 = vplus(X88,X91)
      | X88 != X89 ),
    inference(fof_simplification,[status(thm)],['ass(cond(goal(88), 0), 1)']) ).

cnf(c_0_26,negated_conjecture,
    ( ~ greater(vd519,vd520)
    | ~ greater(vd517,vd518) ),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_27,plain,
    ( greater(vd519,vd520)
    | vd520 = vd519 ),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

fof(c_0_28,plain,
    ! [X124,X125,X126] :
      ( greater(X124,X126)
      | ~ greater(vmul(X124,X125),vmul(X126,X125)) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(conjunct1(307), 0), 0)'])])]) ).

fof(c_0_29,plain,
    ! [X231,X232,X233] :
      ( X232 != vplus(X231,X233)
      | X231 != X232 ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])])])]) ).

fof(c_0_30,plain,
    ! [X139,X140,X141] : vmul(X139,vplus(X140,X141)) = vplus(vmul(X139,X140),vmul(X139,X141)),
    inference(variable_rename,[status(thm)],['ass(cond(281, 0), 0)']) ).

fof(c_0_31,plain,
    ! [X221,X222,X224,X225,X226] :
      ( ( greater(X225,X224)
        | X225 != vplus(X224,X226) )
      & ( X222 = vplus(X221,esk2_2(X221,X222))
        | ~ greater(X222,X221) ) ),
    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)],['def(cond(conseq(axiom(3)), 11), 1)'])])])])])]) ).

cnf(c_0_32,negated_conjecture,
    ( ~ greater(vd517,vd518)
    | vd520 = vd519 ),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_33,plain,
    ( ~ greater(vmul(X1,X2),vmul(X3,X2))
    | greater(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_28]) ).

fof(c_0_34,plain,
    ! [X133,X134,X135] :
      ( greater(vmul(X134,X133),vmul(X135,X133))
      | ~ greater(X134,X135) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(299, 0), 2)'])])]) ).

cnf(c_0_35,plain,
    ( X2 != vplus(X1,X3)
    | X1 != X2 ),
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

cnf(c_0_36,plain,
    vmul(X1,vplus(X2,X3)) = vplus(vmul(X1,X2),vmul(X1,X3)),
    inference(split_conjunct,[status(thm)],[c_0_30]) ).

cnf(c_0_37,plain,
    ( ~ greater(X1,X2)
    | X1 = vplus(X2,esk2_2(X2,X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_31]) ).

cnf(c_0_38,negated_conjecture,
    ~ greater(vmul(vd517,vd519),vmul(vd518,vd519)),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_32]),c_0_33]) ).

cnf(c_0_39,plain,
    ( ~ greater(X1,X2)
    | greater(vmul(X1,X3),vmul(X2,X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_34]) ).

fof(c_0_40,plain,
    ! [X80,X81] :
      ( ~ less(X80,X81)
      | X80 != X81 ),
    inference(fof_simplification,[status(thm)],['ass(cond(goal(130), 0), 1)']) ).

fof(c_0_41,plain,
    ! [X192,X193,X194] :
      ( less(X192,X194)
      | ~ less(X192,X193)
      | ~ less(X193,X194) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(168, 0), 0)'])])]) ).

fof(c_0_42,plain,
    ! [X205,X206] :
      ( less(X206,X205)
      | ~ greater(X205,X206) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(140, 0), 0)'])])]) ).

cnf(c_0_43,plain,
    vplus(X1,X2) != X1,
    inference(er,[status(thm)],[c_0_35]) ).

cnf(c_0_44,plain,
    ( ~ greater(X3,X2)
    | vplus(vmul(X1,X2),vmul(X1,esk2_2(X2,X3))) = vmul(X1,X3) ),
    inference(spm,[status(thm)],[c_0_36,c_0_37]) ).

cnf(c_0_45,plain,
    ( greater(vd519,vd520)
    | greater(vd517,vd518) ),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_46,negated_conjecture,
    ~ greater(vd517,vd518),
    inference(spm,[status(thm)],[c_0_38,c_0_39]) ).

fof(c_0_47,plain,
    ! [X209,X210] :
      ( ~ less(X209,X210)
      | X209 != X210 ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_40])]) ).

cnf(c_0_48,plain,
    ( ~ less(X3,X1)
    | ~ less(X1,X2)
    | less(X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_41]) ).

cnf(c_0_49,plain,
    ( ~ greater(X1,X2)
    | less(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_42]) ).

cnf(c_0_50,plain,
    ( ~ greater(X2,X3)
    | vmul(X1,X2) != vmul(X1,X3) ),
    inference(spm,[status(thm)],[c_0_43,c_0_44]) ).

cnf(c_0_51,plain,
    greater(vd519,vd520),
    inference(sr,[status(thm)],[c_0_45,c_0_46]) ).

fof(c_0_52,plain,
    ! [X142,X143] : vmul(X142,X143) = vmul(X143,X142),
    inference(variable_rename,[status(thm)],['ass(cond(270, 0), 0)']) ).

cnf(c_0_53,plain,
    ( ~ less(X1,X2)
    | X1 != X2 ),
    inference(split_conjunct,[status(thm)],[c_0_47]) ).

cnf(c_0_54,plain,
    ( ~ greater(X3,X1)
    | ~ less(X3,X2)
    | less(X1,X2) ),
    inference(spm,[status(thm)],[c_0_48,c_0_49]) ).

fof(c_0_55,plain,
    ! [X118,X119,X120] :
      ( less(X118,X120)
      | ~ less(vmul(X118,X119),vmul(X120,X119)) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(conjunct2(conjunct2(307)), 0), 0)'])])]) ).

fof(c_0_56,plain,
    ! [X207,X208] :
      ( less(X207,X208)
      | greater(X207,X208)
      | X207 = X208 ),
    inference(variable_rename,[status(thm)],['ass(cond(goal(130), 0), 0)']) ).

cnf(c_0_57,plain,
    vmul(X1,vd520) != vmul(X1,vd519),
    inference(spm,[status(thm)],[c_0_50,c_0_51]) ).

cnf(c_0_58,plain,
    vmul(X1,X2) = vmul(X2,X1),
    inference(split_conjunct,[status(thm)],[c_0_52]) ).

cnf(c_0_59,plain,
    ~ less(X1,X1),
    inference(er,[status(thm)],[c_0_53]) ).

cnf(c_0_60,plain,
    ( ~ less(vd519,X1)
    | less(vd520,X1) ),
    inference(spm,[status(thm)],[c_0_54,c_0_51]) ).

cnf(c_0_61,plain,
    ( ~ less(vmul(X1,X2),vmul(X3,X2))
    | less(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_55]) ).

cnf(c_0_62,plain,
    ( less(X1,X2)
    | greater(X1,X2)
    | X1 = X2 ),
    inference(split_conjunct,[status(thm)],[c_0_56]) ).

cnf(c_0_63,plain,
    vmul(vd520,X1) != vmul(X1,vd519),
    inference(spm,[status(thm)],[c_0_57,c_0_58]) ).

cnf(c_0_64,plain,
    ( geq(vd517,vd518)
    | greater(vd517,vd518) ),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_65,plain,
    ~ less(vd519,vd520),
    inference(spm,[status(thm)],[c_0_59,c_0_60]) ).

cnf(c_0_66,plain,
    ( greater(vmul(X1,X2),vmul(X3,X2))
    | less(X1,X3)
    | vmul(X1,X2) = vmul(X3,X2) ),
    inference(spm,[status(thm)],[c_0_61,c_0_62]) ).

cnf(c_0_67,plain,
    vmul(vd520,X1) != vmul(vd519,X1),
    inference(spm,[status(thm)],[c_0_63,c_0_58]) ).

cnf(c_0_68,plain,
    ( greater(vd517,vd518)
    | vd518 = vd517 ),
    inference(spm,[status(thm)],[c_0_23,c_0_64]) ).

cnf(c_0_69,plain,
    greater(vmul(vd519,X1),vmul(vd520,X1)),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67]) ).

cnf(c_0_70,plain,
    vd518 = vd517,
    inference(sr,[status(thm)],[c_0_68,c_0_46]) ).

cnf(c_0_71,plain,
    greater(vmul(vd519,X1),vmul(X1,vd520)),
    inference(spm,[status(thm)],[c_0_69,c_0_58]) ).

cnf(c_0_72,negated_conjecture,
    ~ greater(vmul(vd517,vd519),vmul(vd517,vd520)),
    inference(spm,[status(thm)],[c_0_21,c_0_70]) ).

cnf(c_0_73,plain,
    greater(vmul(X1,vd519),vmul(X1,vd520)),
    inference(spm,[status(thm)],[c_0_71,c_0_58]) ).

cnf(c_0_74,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_73])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM856+2 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36  % Computer : n009.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Mon Sep 21 03:13:43 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.40  Running first-order theorem proving
% 0.10/0.40  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
% 3.13/0.87  % Version: 3.5.1
% 3.13/0.87  % Preprocessing class: FSLSSMSSSSSNFFN.
% 3.13/0.87  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.13/0.87  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 3.13/0.87  % Starting new_bool_3 with 300s (1) cores
% 3.13/0.87  % Starting new_bool_1 with 300s (1) cores
% 3.13/0.87  % Starting sh5l with 300s (1) cores
% 3.13/0.87  % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 713528 completed with status 0
% 3.13/0.87  % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 3.13/0.87  % Preprocessing class: FSLSSMSSSSSNFFN.
% 3.13/0.87  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.13/0.87  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 3.13/0.87  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.13/0.87  % No SInE strategy applied
% 3.13/0.87  % Search class: FGHSM-FFMS21-SFFFFFNN
% 3.13/0.87  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 3.13/0.87  % Starting SubtermCWHack with 136s (1) cores
% 3.13/0.87  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 3.13/0.87  % Starting G-E--_208_B07_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 3.13/0.87  % Starting new_bool_3 with 136s (1) cores
% 3.13/0.87  % Starting new_bool_1 with 136s (1) cores
% 3.13/0.87  % G-E--_208_B07_F1_SE_CS_SP_PS_S0Y with pid 713550 completed with status 0
% 3.13/0.87  % Result found by G-E--_208_B07_F1_SE_CS_SP_PS_S0Y
% 3.13/0.87  % Preprocessing class: FSLSSMSSSSSNFFN.
% 3.13/0.87  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.13/0.87  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 3.13/0.87  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.13/0.87  % No SInE strategy applied
% 3.13/0.87  % Search class: FGHSM-FFMS21-SFFFFFNN
% 3.13/0.87  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 3.13/0.87  % Starting SubtermCWHack with 136s (1) cores
% 3.13/0.87  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 3.13/0.87  % Starting G-E--_208_B07_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 3.13/0.87  % Preprocessing time       : 0.002 s
% 3.13/0.87  % Presaturation interreduction done
% 3.13/0.87  
% 3.13/0.87  % Proof found!
% 3.13/0.87  % SZS status Theorem
% 3.13/0.87  % SZS output start CNFRefutation
% See solution above
% 3.13/0.87  % Parsed axioms                        : 59
% 3.13/0.87  % Removed by relevancy pruning/SinE    : 0
% 3.13/0.87  % Initial clauses                      : 72
% 3.13/0.87  % Removed in clause preprocessing      : 3
% 3.13/0.87  % Initial clauses in saturation        : 69
% 3.13/0.87  % Processed clauses                    : 2867
% 3.13/0.87  % ...of these trivial                  : 107
% 3.13/0.87  % ...subsumed                          : 2071
% 3.13/0.87  % ...remaining for further processing  : 689
% 3.13/0.87  % Other redundant clauses eliminated   : 99
% 3.13/0.87  % Clauses deleted for lack of memory   : 0
% 3.13/0.87  % Backward-subsumed                    : 77
% 3.13/0.87  % Backward-rewritten                   : 10
% 3.13/0.87  % Generated clauses                    : 14377
% 3.13/0.87  % ...of the previous two non-redundant : 13571
% 3.13/0.87  % ...aggressively subsumed             : 0
% 3.13/0.87  % Contextual simplify-reflections      : 4
% 3.13/0.87  % Paramodulations                      : 14264
% 3.13/0.87  % Factorizations                       : 4
% 3.13/0.87  % NegExts                              : 0
% 3.13/0.87  % Equation resolutions                 : 106
% 3.13/0.87  % Disequality decompositions           : 0
% 3.13/0.87  % Total rewrite steps                  : 5805
% 3.13/0.87  % ...of those cached                   : 4613
% 3.13/0.87  % Propositional unsat checks           : 0
% 3.13/0.87  %    Propositional check models        : 0
% 3.13/0.87  %    Propositional check unsatisfiable : 0
% 3.13/0.87  %    Propositional clauses             : 0
% 3.13/0.87  %    Propositional clauses after purity: 0
% 3.13/0.87  %    Propositional unsat core size     : 0
% 3.13/0.87  %    Propositional preprocessing time  : 0.000
% 3.13/0.87  %    Propositional encoding time       : 0.000
% 3.13/0.87  %    Propositional solver time         : 0.000
% 3.13/0.87  %    Success case prop preproc time    : 0.000
% 3.13/0.87  %    Success case prop encoding time   : 0.000
% 3.13/0.87  %    Success case prop solver time     : 0.000
% 3.13/0.87  % Current number of processed clauses  : 532
% 3.13/0.87  %    Positive orientable unit clauses  : 70
% 3.13/0.87  %    Positive unorientable unit clauses: 7
% 3.13/0.87  %    Negative unit clauses             : 145
% 3.13/0.87  %    Non-unit-clauses                  : 310
% 3.13/0.87  % Current number of unprocessed clauses: 10771
% 3.13/0.87  % ...number of literals in the above   : 22069
% 3.13/0.87  % Current number of archived formulas  : 0
% 3.13/0.87  % Current number of archived clauses   : 149
% 3.13/0.87  % Clause-clause subsumption calls (NU) : 11412
% 3.13/0.87  % Rec. Clause-clause subsumption calls : 9663
% 3.13/0.87  % Non-unit clause-clause subsumptions  : 555
% 3.13/0.87  % Unit Clause-clause subsumption calls : 4087
% 3.13/0.87  % Rewrite failures with RHS unbound    : 0
% 3.13/0.87  % BW rewrite match attempts            : 178
% 3.13/0.87  % BW rewrite match successes           : 116
% 3.13/0.87  % Condensation attempts                : 0
% 3.13/0.87  % Condensation successes               : 0
% 3.13/0.87  % Termbank termtop insertions          : 130565
% 3.13/0.87  % Search garbage collected termcells   : 771
% 3.13/0.87  
% 3.13/0.87  % -------------------------------------------------
% 3.13/0.87  % User time                : 0.396 s
% 3.13/0.87  % System time              : 0.028 s
% 3.13/0.87  % Total time               : 0.424 s
% 3.13/0.87  % Maximum resident set size: 3992 pages
% 3.13/0.87  
% 3.13/0.87  % -------------------------------------------------
% 3.13/0.87  % User time                : 1.901 s
% 3.13/0.87  % System time              : 0.102 s
% 3.13/0.87  % Total time               : 2.003 s
% 3.13/0.87  % Maximum resident set size: 4864 pages
% 3.13/0.87  % E exiting
%------------------------------------------------------------------------------