↑ 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  : NUN084+2 : TPTP v9.3.1. Released v7.3.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 01:57:57 PM UTC 2026

% Result   : Theorem 0.23s 0.59s
% Output   : CNFRefutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   82 (  48 unt;   0 def)
%            Number of atoms       :  189 (  73 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :  166 (  59   ~;  45   |;  62   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :   17 (  17 usr;   1 con; 0-2 aty)
%            Number of variables   :  173 (  18 sgn  45   !;  33   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(axiom_1,axiom,
    ? [X1] :
    ! [X2] :
      ( ( X2 = X1
        & r1(X2) )
      | ( X2 != X1
        & ~ r1(X2) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_1) ).

fof(axiom_5a,axiom,
    ! [X33] :
    ? [X34] :
      ( ? [X36] :
          ( X34 = X36
          & r1(X36) )
      & ? [X35] :
          ( r4(X33,X35,X34)
          & r1(X35) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_5a) ).

fof(axiom_4,axiom,
    ! [X10,X11] :
    ? [X12] :
    ! [X13] :
      ( ( X13 = X12
        & r4(X10,X11,X13) )
      | ( X13 != X12
        & ~ r4(X10,X11,X13) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_4) ).

fof(axiom_3,axiom,
    ! [X6,X7] :
    ? [X8] :
    ! [X9] :
      ( ( X9 = X8
        & r3(X6,X7,X9) )
      | ( X9 != X8
        & ~ r3(X6,X7,X9) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_3) ).

fof(axiom_2a,axiom,
    ! [X20,X21] :
    ? [X22] :
      ( ? [X25] :
          ( r4(X20,X21,X25)
          & r3(X25,X20,X22) )
      & ? [X23] :
          ( X23 = X22
          & ? [X24] :
              ( r4(X20,X24,X23)
              & r2(X21,X24) ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_2a) ).

fof(axiom_2,axiom,
    ! [X3] :
    ? [X4] :
    ! [X5] :
      ( ( X5 = X4
        & r2(X3,X5) )
      | ( X5 != X4
        & ~ r2(X3,X5) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_2) ).

fof(axiom_1a,axiom,
    ! [X14,X15] :
    ? [X16] :
      ( ? [X19] :
          ( r3(X14,X15,X19)
          & r2(X19,X16) )
      & ? [X17] :
          ( X17 = X16
          & ? [X18] :
              ( r3(X14,X18,X17)
              & r2(X15,X18) ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_1a) ).

fof(axiom_4a,axiom,
    ! [X30] :
    ? [X31] :
      ( X31 = X30
      & ? [X32] :
          ( r3(X30,X32,X31)
          & r1(X32) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_4a) ).

fof(xtimesyeqtwo,conjecture,
    ? [X39,X22,X23] :
      ( ? [X16] :
          ( ? [X17] :
              ( ? [X25] :
                  ( r2(X25,X17)
                  & r1(X25) )
              & r2(X17,X16) )
          & X23 = X16 )
      & r4(X39,X22,X23) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',xtimesyeqtwo) ).

fof(c_0_9,plain,
    ? [X1] :
    ! [X2] :
      ( ( X2 = X1
        & r1(X2) )
      | ( X2 != X1
        & ~ r1(X2) ) ),
    inference(fof_simplification,[status(thm)],[axiom_1]) ).

fof(c_0_10,plain,
    ! [X77] :
      ( ( X77 != esk13_0
        | X77 = esk13_0 )
      & ( X77 != esk13_0
        | r1(X77) )
      & ( ~ r1(X77)
        | X77 = esk13_0 )
      & ( ~ r1(X77)
        | r1(X77) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_9])])])]) ).

fof(c_0_11,plain,
    ! [X81] :
      ( esk16_1(X81) = esk18_1(X81)
      & r1(esk18_1(X81))
      & r4(X81,esk17_1(X81),esk16_1(X81))
      & r1(esk17_1(X81)) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[axiom_5a])]) ).

cnf(c_0_12,plain,
    ( ~ r1(X1)
    | X1 = esk13_0 ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_13,plain,
    r1(esk18_1(X1)),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

fof(c_0_14,plain,
    ! [X10,X11] :
    ? [X12] :
    ! [X13] :
      ( ( X13 = X12
        & r4(X10,X11,X13) )
      | ( X13 != X12
        & ~ r4(X10,X11,X13) ) ),
    inference(fof_simplification,[status(thm)],[axiom_4]) ).

cnf(c_0_15,plain,
    r1(esk17_1(X1)),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_16,plain,
    esk16_1(X1) = esk18_1(X1),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_17,plain,
    esk18_1(X1) = esk13_0,
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

fof(c_0_18,plain,
    ! [X6,X7] :
    ? [X8] :
    ! [X9] :
      ( ( X9 = X8
        & r3(X6,X7,X9) )
      | ( X9 != X8
        & ~ r3(X6,X7,X9) ) ),
    inference(fof_simplification,[status(thm)],[axiom_3]) ).

fof(c_0_19,plain,
    ! [X85,X86,X88] :
      ( ( X88 != esk19_2(X85,X86)
        | X88 = esk19_2(X85,X86) )
      & ( X88 != esk19_2(X85,X86)
        | r4(X85,X86,X88) )
      & ( ~ r4(X85,X86,X88)
        | X88 = esk19_2(X85,X86) )
      & ( ~ r4(X85,X86,X88)
        | r4(X85,X86,X88) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_14])])])]) ).

cnf(c_0_20,plain,
    r4(X1,esk17_1(X1),esk16_1(X1)),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_21,plain,
    esk17_1(X1) = esk13_0,
    inference(spm,[status(thm)],[c_0_12,c_0_15]) ).

cnf(c_0_22,plain,
    esk16_1(X1) = esk13_0,
    inference(rw,[status(thm)],[c_0_16,c_0_17]) ).

fof(c_0_23,plain,
    ! [X59,X60] :
      ( r4(X59,X60,esk9_2(X59,X60))
      & r3(esk9_2(X59,X60),X59,esk6_2(X59,X60))
      & esk7_2(X59,X60) = esk6_2(X59,X60)
      & r4(X59,esk8_2(X59,X60),esk7_2(X59,X60))
      & r2(X60,esk8_2(X59,X60)) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[axiom_2a])]) ).

fof(c_0_24,plain,
    ! [X3] :
    ? [X4] :
    ! [X5] :
      ( ( X5 = X4
        & r2(X3,X5) )
      | ( X5 != X4
        & ~ r2(X3,X5) ) ),
    inference(fof_simplification,[status(thm)],[axiom_2]) ).

fof(c_0_25,plain,
    ! [X89,X90,X92] :
      ( ( X92 != esk20_2(X89,X90)
        | X92 = esk20_2(X89,X90) )
      & ( X92 != esk20_2(X89,X90)
        | r3(X89,X90,X92) )
      & ( ~ r3(X89,X90,X92)
        | X92 = esk20_2(X89,X90) )
      & ( ~ r3(X89,X90,X92)
        | r3(X89,X90,X92) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_18])])])]) ).

fof(c_0_26,plain,
    ! [X53,X54] :
      ( r3(X53,X54,esk5_2(X53,X54))
      & r2(esk5_2(X53,X54),esk2_2(X53,X54))
      & esk3_2(X53,X54) = esk2_2(X53,X54)
      & r3(X53,esk4_2(X53,X54),esk3_2(X53,X54))
      & r2(X54,esk4_2(X53,X54)) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[axiom_1a])]) ).

cnf(c_0_27,plain,
    ( ~ r4(X2,X3,X1)
    | X1 = esk19_2(X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_28,plain,
    r4(X1,esk13_0,esk13_0),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).

cnf(c_0_29,plain,
    r4(X1,X2,esk9_2(X1,X2)),
    inference(split_conjunct,[status(thm)],[c_0_23]) ).

fof(c_0_30,plain,
    ! [X50,X52] :
      ( ( X52 != esk1_1(X50)
        | X52 = esk1_1(X50) )
      & ( X52 != esk1_1(X50)
        | r2(X50,X52) )
      & ( ~ r2(X50,X52)
        | X52 = esk1_1(X50) )
      & ( ~ r2(X50,X52)
        | r2(X50,X52) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_24])])])]) ).

cnf(c_0_31,plain,
    ( ~ r3(X2,X3,X1)
    | X1 = esk20_2(X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_25]) ).

cnf(c_0_32,plain,
    r3(X1,X2,esk5_2(X1,X2)),
    inference(split_conjunct,[status(thm)],[c_0_26]) ).

cnf(c_0_33,plain,
    r3(esk9_2(X1,X2),X1,esk6_2(X1,X2)),
    inference(split_conjunct,[status(thm)],[c_0_23]) ).

cnf(c_0_34,plain,
    esk7_2(X1,X2) = esk6_2(X1,X2),
    inference(split_conjunct,[status(thm)],[c_0_23]) ).

cnf(c_0_35,plain,
    esk19_2(X1,esk13_0) = esk13_0,
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_36,plain,
    esk19_2(X1,X2) = esk9_2(X1,X2),
    inference(spm,[status(thm)],[c_0_27,c_0_29]) ).

cnf(c_0_37,plain,
    ( ~ r2(X2,X1)
    | X1 = esk1_1(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_30]) ).

cnf(c_0_38,plain,
    r2(X1,esk4_2(X2,X1)),
    inference(split_conjunct,[status(thm)],[c_0_26]) ).

fof(c_0_39,plain,
    ! [X78] :
      ( esk14_1(X78) = X78
      & r3(X78,esk15_1(X78),esk14_1(X78))
      & r1(esk15_1(X78)) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[axiom_4a])]) ).

cnf(c_0_40,plain,
    esk20_2(X1,X2) = esk5_2(X1,X2),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_41,plain,
    r3(esk9_2(X1,X2),X1,esk7_2(X1,X2)),
    inference(rw,[status(thm)],[c_0_33,c_0_34]) ).

cnf(c_0_42,plain,
    esk9_2(X1,esk13_0) = esk13_0,
    inference(rw,[status(thm)],[c_0_35,c_0_36]) ).

cnf(c_0_43,plain,
    r3(X1,esk4_2(X1,X2),esk3_2(X1,X2)),
    inference(split_conjunct,[status(thm)],[c_0_26]) ).

cnf(c_0_44,plain,
    esk4_2(X1,X2) = esk1_1(X2),
    inference(spm,[status(thm)],[c_0_37,c_0_38]) ).

cnf(c_0_45,plain,
    r1(esk15_1(X1)),
    inference(split_conjunct,[status(thm)],[c_0_39]) ).

cnf(c_0_46,plain,
    r2(X1,esk8_2(X2,X1)),
    inference(split_conjunct,[status(thm)],[c_0_23]) ).

cnf(c_0_47,plain,
    ( ~ r3(X2,X3,X1)
    | X1 = esk5_2(X2,X3) ),
    inference(rw,[status(thm)],[c_0_31,c_0_40]) ).

cnf(c_0_48,plain,
    r3(esk13_0,X1,esk7_2(X1,esk13_0)),
    inference(spm,[status(thm)],[c_0_41,c_0_42]) ).

cnf(c_0_49,plain,
    r3(X1,esk1_1(X2),esk3_2(X1,X2)),
    inference(rw,[status(thm)],[c_0_43,c_0_44]) ).

cnf(c_0_50,plain,
    r2(esk5_2(X1,X2),esk2_2(X1,X2)),
    inference(split_conjunct,[status(thm)],[c_0_26]) ).

cnf(c_0_51,plain,
    esk3_2(X1,X2) = esk2_2(X1,X2),
    inference(split_conjunct,[status(thm)],[c_0_26]) ).

cnf(c_0_52,plain,
    r3(X1,esk15_1(X1),esk14_1(X1)),
    inference(split_conjunct,[status(thm)],[c_0_39]) ).

cnf(c_0_53,plain,
    esk15_1(X1) = esk13_0,
    inference(spm,[status(thm)],[c_0_12,c_0_45]) ).

cnf(c_0_54,plain,
    esk14_1(X1) = X1,
    inference(split_conjunct,[status(thm)],[c_0_39]) ).

cnf(c_0_55,plain,
    r4(X1,esk8_2(X1,X2),esk7_2(X1,X2)),
    inference(split_conjunct,[status(thm)],[c_0_23]) ).

cnf(c_0_56,plain,
    esk8_2(X1,X2) = esk1_1(X2),
    inference(spm,[status(thm)],[c_0_37,c_0_46]) ).

cnf(c_0_57,plain,
    esk5_2(esk13_0,X1) = esk7_2(X1,esk13_0),
    inference(spm,[status(thm)],[c_0_47,c_0_48]) ).

cnf(c_0_58,plain,
    esk5_2(X1,esk1_1(X2)) = esk3_2(X1,X2),
    inference(spm,[status(thm)],[c_0_47,c_0_49]) ).

cnf(c_0_59,plain,
    r2(esk5_2(X1,X2),esk3_2(X1,X2)),
    inference(rw,[status(thm)],[c_0_50,c_0_51]) ).

cnf(c_0_60,plain,
    r3(X1,esk13_0,X1),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_53]),c_0_54]) ).

fof(c_0_61,negated_conjecture,
    ~ ? [X39,X22,X23] :
        ( ? [X16] :
            ( ? [X17] :
                ( ? [X25] :
                    ( r2(X25,X17)
                    & r1(X25) )
                & r2(X17,X16) )
            & X23 = X16 )
        & r4(X39,X22,X23) ),
    inference(assume_negation,[status(cth)],[xtimesyeqtwo]) ).

cnf(c_0_62,plain,
    r4(X1,esk1_1(X2),esk7_2(X1,X2)),
    inference(rw,[status(thm)],[c_0_55,c_0_56]) ).

cnf(c_0_63,plain,
    esk7_2(esk1_1(X1),esk13_0) = esk3_2(esk13_0,X1),
    inference(spm,[status(thm)],[c_0_57,c_0_58]) ).

cnf(c_0_64,plain,
    esk1_1(esk5_2(X1,X2)) = esk3_2(X1,X2),
    inference(spm,[status(thm)],[c_0_37,c_0_59]) ).

cnf(c_0_65,plain,
    esk20_2(X1,esk13_0) = X1,
    inference(spm,[status(thm)],[c_0_31,c_0_60]) ).

fof(c_0_66,negated_conjecture,
    ! [X44,X45,X46,X47,X48,X49] :
      ( ~ r2(X49,X48)
      | ~ r1(X49)
      | ~ r2(X48,X47)
      | X46 != X47
      | ~ r4(X44,X45,X46) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_61])])])]) ).

cnf(c_0_67,plain,
    r4(esk1_1(X1),esk1_1(esk13_0),esk3_2(esk13_0,X1)),
    inference(spm,[status(thm)],[c_0_62,c_0_63]) ).

cnf(c_0_68,plain,
    esk3_2(X1,esk1_1(X2)) = esk1_1(esk3_2(X1,X2)),
    inference(spm,[status(thm)],[c_0_64,c_0_58]) ).

cnf(c_0_69,plain,
    esk5_2(X1,esk13_0) = X1,
    inference(rw,[status(thm)],[c_0_65,c_0_40]) ).

cnf(c_0_70,negated_conjecture,
    ( ~ r2(X6,X5)
    | ~ r1(X6)
    | ~ r2(X5,X4)
    | X3 != X4
    | ~ r4(X1,X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_66]) ).

cnf(c_0_71,plain,
    r4(esk1_1(esk1_1(X1)),esk1_1(esk13_0),esk1_1(esk3_2(esk13_0,X1))),
    inference(spm,[status(thm)],[c_0_67,c_0_68]) ).

cnf(c_0_72,plain,
    esk3_2(X1,esk13_0) = esk1_1(X1),
    inference(spm,[status(thm)],[c_0_64,c_0_69]) ).

cnf(c_0_73,negated_conjecture,
    ( ~ r1(X4)
    | ~ r2(X5,X3)
    | ~ r2(X4,X5)
    | ~ r4(X1,X2,X3) ),
    inference(er,[status(thm)],[c_0_70]) ).

cnf(c_0_74,plain,
    r4(esk1_1(esk1_1(esk13_0)),esk1_1(esk13_0),esk1_1(esk1_1(esk13_0))),
    inference(spm,[status(thm)],[c_0_71,c_0_72]) ).

cnf(c_0_75,plain,
    ( X2 != esk1_1(X1)
    | r2(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_30]) ).

cnf(c_0_76,negated_conjecture,
    ( ~ r1(X2)
    | ~ r2(X2,X1)
    | ~ r2(X1,esk1_1(esk1_1(esk13_0))) ),
    inference(spm,[status(thm)],[c_0_73,c_0_74]) ).

cnf(c_0_77,plain,
    r2(X1,esk1_1(X1)),
    inference(er,[status(thm)],[c_0_75]) ).

cnf(c_0_78,plain,
    ( X1 != esk13_0
    | r1(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_79,negated_conjecture,
    ( ~ r1(X1)
    | ~ r2(X1,esk1_1(esk13_0)) ),
    inference(spm,[status(thm)],[c_0_76,c_0_77]) ).

cnf(c_0_80,plain,
    r1(esk13_0),
    inference(er,[status(thm)],[c_0_78]) ).

cnf(c_0_81,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_77]),c_0_80])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : NUN084+2 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.08  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.47  % Computer : n014.cluster.edu
% 0.19/0.47  % Model    : x86_64 x86_64
% 0.19/0.47  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.47  % Memory   : 8046.5625MB
% 0.19/0.47  % OS       : Linux 6.8.0-71-generic
% 0.19/0.47  % CPULimit : 300
% 0.19/0.47  % WCLimit  : 300
% 0.19/0.47  % DateTime : Mon Sep 21 03:25:34 UTC 2026
% 0.19/0.48  % CPUTime  : 
% 0.19/0.48  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/0.54  Running first-order theorem proving
% 0.23/0.54  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
% 0.23/0.59  % Version: 3.5.1
% 0.23/0.59  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.59  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.59  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.59  % Starting new_bool_3 with 300s (1) cores
% 0.23/0.59  % Starting new_bool_1 with 300s (1) cores
% 0.23/0.59  % Starting sh5l with 300s (1) cores
% 0.23/0.59  % sh5l with pid 3034444 completed with status 0
% 0.23/0.59  % Result found by sh5l
% 0.23/0.59  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.59  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.59  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.59  % Starting new_bool_3 with 300s (1) cores
% 0.23/0.59  % Starting new_bool_1 with 300s (1) cores
% 0.23/0.59  % Starting sh5l with 300s (1) cores
% 0.23/0.59  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.23/0.59  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.23/0.59  % Search class: FGHSM-FFMF21-SFFFFFNN
% 0.23/0.59  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.59  % Starting SubtermCWHack with 28s (1) cores
% 0.23/0.59  % SubtermCWHack with pid 3034452 completed with status 0
% 0.23/0.59  % Result found by SubtermCWHack
% 0.23/0.59  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.59  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.59  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.59  % Starting new_bool_3 with 300s (1) cores
% 0.23/0.59  % Starting new_bool_1 with 300s (1) cores
% 0.23/0.59  % Starting sh5l with 300s (1) cores
% 0.23/0.59  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.23/0.59  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.23/0.59  % Search class: FGHSM-FFMF21-SFFFFFNN
% 0.23/0.59  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.59  % Starting SubtermCWHack with 28s (1) cores
% 0.23/0.59  % Preprocessing time       : 0.001 s
% 0.23/0.59  
% 0.23/0.59  % Proof found!
% 0.23/0.59  % SZS status Theorem
% 0.23/0.59  % SZS output start CNFRefutation
% See solution above
% 0.23/0.59  % Parsed axioms                        : 12
% 0.23/0.59  % Removed by relevancy pruning/SinE    : 0
% 0.23/0.59  % Initial clauses                      : 40
% 0.23/0.59  % Removed in clause preprocessing      : 8
% 0.23/0.59  % Initial clauses in saturation        : 32
% 0.23/0.59  % Processed clauses                    : 190
% 0.23/0.59  % ...of these trivial                  : 9
% 0.23/0.59  % ...subsumed                          : 45
% 0.23/0.59  % ...remaining for further processing  : 136
% 0.23/0.59  % Other redundant clauses eliminated   : 7
% 0.23/0.59  % Clauses deleted for lack of memory   : 0
% 0.23/0.59  % Backward-subsumed                    : 0
% 0.23/0.59  % Backward-rewritten                   : 23
% 0.23/0.59  % Generated clauses                    : 495
% 0.23/0.59  % ...of the previous two non-redundant : 373
% 0.23/0.59  % ...aggressively subsumed             : 0
% 0.23/0.59  % Contextual simplify-reflections      : 2
% 0.23/0.59  % Paramodulations                      : 488
% 0.23/0.59  % Factorizations                       : 0
% 0.23/0.59  % NegExts                              : 0
% 0.23/0.59  % Equation resolutions                 : 7
% 0.23/0.59  % Disequality decompositions           : 0
% 0.23/0.59  % Total rewrite steps                  : 306
% 0.23/0.59  % ...of those cached                   : 171
% 0.23/0.59  % Propositional unsat checks           : 0
% 0.23/0.59  %    Propositional check models        : 0
% 0.23/0.59  %    Propositional check unsatisfiable : 0
% 0.23/0.59  %    Propositional clauses             : 0
% 0.23/0.59  %    Propositional clauses after purity: 0
% 0.23/0.59  %    Propositional unsat core size     : 0
% 0.23/0.59  %    Propositional preprocessing time  : 0.000
% 0.23/0.59  %    Propositional encoding time       : 0.000
% 0.23/0.59  %    Propositional solver time         : 0.000
% 0.23/0.59  %    Success case prop preproc time    : 0.000
% 0.23/0.59  %    Success case prop encoding time   : 0.000
% 0.23/0.59  %    Success case prop solver time     : 0.000
% 0.23/0.59  % Current number of processed clauses  : 106
% 0.23/0.59  %    Positive orientable unit clauses  : 63
% 0.23/0.59  %    Positive unorientable unit clauses: 0
% 0.23/0.59  %    Negative unit clauses             : 3
% 0.23/0.59  %    Non-unit-clauses                  : 40
% 0.23/0.59  % Current number of unprocessed clauses: 197
% 0.23/0.59  % ...number of literals in the above   : 386
% 0.23/0.59  % Current number of archived formulas  : 0
% 0.23/0.59  % Current number of archived clauses   : 23
% 0.23/0.59  % Clause-clause subsumption calls (NU) : 435
% 0.23/0.59  % Rec. Clause-clause subsumption calls : 330
% 0.23/0.59  % Non-unit clause-clause subsumptions  : 34
% 0.23/0.59  % Unit Clause-clause subsumption calls : 109
% 0.23/0.59  % Rewrite failures with RHS unbound    : 0
% 0.23/0.59  % BW rewrite match attempts            : 52
% 0.23/0.59  % BW rewrite match successes           : 22
% 0.23/0.59  % Condensation attempts                : 0
% 0.23/0.59  % Condensation successes               : 0
% 0.23/0.59  % Termbank termtop insertions          : 6113
% 0.23/0.59  % Search garbage collected termcells   : 316
% 0.23/0.59  
% 0.23/0.59  % -------------------------------------------------
% 0.23/0.59  % User time                : 0.008 s
% 0.23/0.59  % System time              : 0.007 s
% 0.23/0.59  % Total time               : 0.015 s
% 0.23/0.59  % Maximum resident set size: 3616 pages
% 0.23/0.59  
% 0.23/0.59  % -------------------------------------------------
% 0.23/0.59  % User time                : 0.010 s
% 0.23/0.59  % System time              : 0.011 s
% 0.23/0.59  % Total time               : 0.021 s
% 0.23/0.59  % Maximum resident set size: 4864 pages
% 0.23/0.59  % E exiting
%------------------------------------------------------------------------------