TSTP Solution File: PUZ142^1 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : PUZ142^1 : TPTP v8.2.0. Released v6.2.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:25:20 EDT 2024

% Result   : Theorem 0.79s 0.63s
% Output   : CNFRefutation 0.79s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   39
% Syntax   : Number of formulae    :   97 (  52 unt;  21 typ;   0 def)
%            Number of atoms       :  124 (  63 equ;   0 cnn)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :  446 (  38   ~;  36   |;   4   &; 360   @)
%                                         (   4 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   4 avg)
%            Number of types       :    4 (   3 usr)
%            Number of type conns  :    6 (   6   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   21 (  18 usr;  16 con; 0-2 aty)
%            Number of variables   :   64 (   0   ^  62   !;   2   ?;  64   :)

% Comments : 
%------------------------------------------------------------------------------
thf(decl_sort1,type,
    direction: $tType ).

thf(decl_sort2,type,
    position: $tType ).

thf(decl_sort3,type,
    movelist: $tType ).

thf(decl_22,type,
    left: direction ).

thf(decl_23,type,
    right: direction ).

thf(decl_24,type,
    top: direction ).

thf(decl_25,type,
    bottom: direction ).

thf(decl_26,type,
    next: position > direction > position ).

thf(decl_27,type,
    wall: position > $o ).

thf(decl_28,type,
    nomove: movelist ).

thf(decl_29,type,
    movedir: movelist > direction > movelist ).

thf(decl_30,type,
    playerpos: movelist > position ).

thf(decl_32,type,
    c10: position ).

thf(decl_33,type,
    c20: position ).

thf(decl_34,type,
    c30: position ).

thf(decl_37,type,
    c11: position ).

thf(decl_38,type,
    c21: position ).

thf(decl_39,type,
    c31: position ).

thf(decl_42,type,
    c12: position ).

thf(decl_43,type,
    c22: position ).

thf(decl_44,type,
    c32: position ).

thf(player_move_legal,axiom,
    ! [X4: position,X5: movelist,X6: direction] :
      ( ( ( playerpos @ X5 )
        = X4 )
     => ( ~ ( wall @ ( next @ X4 @ X6 ) )
       => ( ( playerpos @ ( movedir @ X5 @ X6 ) )
          = ( next @ X4 @ X6 ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',player_move_legal) ).

thf(left_right,axiom,
    ! [X3: position] :
      ( ( next @ ( next @ X3 @ left ) @ right )
      = X3 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_right) ).

thf(next_comm,axiom,
    ! [X1: direction,X2: direction,X3: position] :
      ( ( next @ ( next @ X3 @ X1 ) @ X2 )
      = ( next @ ( next @ X3 @ X2 ) @ X1 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',next_comm) ).

thf(exercise,conjecture,
    ? [X5: movelist] :
      ( ( playerpos @ X5 )
      = c31 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',exercise) ).

thf(c31_defin,axiom,
    ( c31
    = ( next @ c30 @ top ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c31_defin) ).

thf(c30_defin,axiom,
    ( c30
    = ( next @ c20 @ right ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c30_defin) ).

thf(c21_defin,axiom,
    ( c21
    = ( next @ c20 @ top ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c21_defin) ).

thf(top_bottom,axiom,
    ! [X3: position] :
      ( ( next @ ( next @ X3 @ top ) @ bottom )
      = X3 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',top_bottom) ).

thf(c20_defin,axiom,
    ( c20
    = ( next @ c10 @ right ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c20_defin) ).

thf(c12_axiom,axiom,
    ( ( wall @ c12 )
  <=> ~ $true ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c12_axiom) ).

thf(c11_defin,axiom,
    ( c11
    = ( next @ c10 @ top ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c11_defin) ).

thf(c12_defin,axiom,
    ( c12
    = ( next @ c11 @ top ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c12_defin) ).

thf(c22_axiom,axiom,
    ( ( wall @ c22 )
  <=> ~ $true ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c22_axiom) ).

thf(start_axiom,axiom,
    ( ( playerpos @ nomove )
    = c11 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',start_axiom) ).

thf(c22_defin,axiom,
    ( c22
    = ( next @ c21 @ top ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c22_defin) ).

thf(c32_axiom,axiom,
    ( ( wall @ c32 )
  <=> ~ $true ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c32_axiom) ).

thf(c31_axiom,axiom,
    ( ( wall @ c31 )
  <=> ~ $true ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c31_axiom) ).

thf(c32_defin,axiom,
    ( c32
    = ( next @ c31 @ top ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c32_defin) ).

thf(c_0_18,plain,
    ! [X4: position,X5: movelist,X6: direction] :
      ( ( ( playerpos @ X5 )
        = X4 )
     => ( ~ ( wall @ ( next @ X4 @ X6 ) )
       => ( ( playerpos @ ( movedir @ X5 @ X6 ) )
          = ( next @ X4 @ X6 ) ) ) ),
    inference(fof_simplification,[status(thm)],[player_move_legal]) ).

thf(c_0_19,plain,
    ! [X22: position] :
      ( ( next @ ( next @ X22 @ left ) @ right )
      = X22 ),
    inference(variable_rename,[status(thm)],[left_right]) ).

thf(c_0_20,plain,
    ! [X19: direction,X20: direction,X21: position] :
      ( ( next @ ( next @ X21 @ X19 ) @ X20 )
      = ( next @ ( next @ X21 @ X20 ) @ X19 ) ),
    inference(variable_rename,[status(thm)],[next_comm]) ).

thf(c_0_21,negated_conjecture,
    ~ ? [X5: movelist] :
        ( ( playerpos @ X5 )
        = c31 ),
    inference(assume_negation,[status(cth)],[exercise]) ).

thf(c_0_22,plain,
    ! [X24: position,X25: movelist,X26: direction] :
      ( ( ( playerpos @ X25 )
       != X24 )
      | ( wall @ ( next @ X24 @ X26 ) )
      | ( ( playerpos @ ( movedir @ X25 @ X26 ) )
        = ( next @ X24 @ X26 ) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])]) ).

thf(c_0_23,plain,
    ! [X3: position] :
      ( ( next @ ( next @ X3 @ left ) @ right )
      = X3 ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

thf(c_0_24,plain,
    ! [X3: position,X2: direction,X1: direction] :
      ( ( next @ ( next @ X3 @ X1 ) @ X2 )
      = ( next @ ( next @ X3 @ X2 ) @ X1 ) ),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

thf(c_0_25,negated_conjecture,
    ! [X30: movelist] :
      ( ( playerpos @ X30 )
     != c31 ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])]) ).

thf(c_0_26,plain,
    ! [X5: movelist,X1: direction,X3: position] :
      ( ( wall @ ( next @ X3 @ X1 ) )
      | ( ( playerpos @ ( movedir @ X5 @ X1 ) )
        = ( next @ X3 @ X1 ) )
      | ( ( playerpos @ X5 )
       != X3 ) ),
    inference(split_conjunct,[status(thm)],[c_0_22]) ).

thf(c_0_27,plain,
    ( c31
    = ( next @ c30 @ top ) ),
    inference(split_conjunct,[status(thm)],[c31_defin]) ).

thf(c_0_28,plain,
    ! [X3: position] :
      ( ( next @ ( next @ X3 @ right ) @ left )
      = X3 ),
    inference(rw,[status(thm)],[c_0_23,c_0_24]) ).

thf(c_0_29,plain,
    ( c30
    = ( next @ c20 @ right ) ),
    inference(split_conjunct,[status(thm)],[c30_defin]) ).

thf(c_0_30,negated_conjecture,
    ! [X5: movelist] :
      ( ( playerpos @ X5 )
     != c31 ),
    inference(split_conjunct,[status(thm)],[c_0_25]) ).

thf(c_0_31,plain,
    ! [X5: movelist,X1: direction] :
      ( ( ( playerpos @ ( movedir @ X5 @ X1 ) )
        = ( next @ ( playerpos @ X5 ) @ X1 ) )
      | ( wall @ ( next @ ( playerpos @ X5 ) @ X1 ) ) ),
    inference(er,[status(thm)],[c_0_26]) ).

thf(c_0_32,plain,
    ! [X1: direction] :
      ( ( next @ ( next @ c30 @ X1 ) @ top )
      = ( next @ c31 @ X1 ) ),
    inference(spm,[status(thm)],[c_0_24,c_0_27]) ).

thf(c_0_33,plain,
    ( ( next @ c30 @ left )
    = c20 ),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

thf(c_0_34,plain,
    ( c21
    = ( next @ c20 @ top ) ),
    inference(split_conjunct,[status(thm)],[c21_defin]) ).

thf(c_0_35,negated_conjecture,
    ! [X5: movelist,X1: direction] :
      ( ( wall @ ( next @ ( playerpos @ X5 ) @ X1 ) )
      | ( ( next @ ( playerpos @ X5 ) @ X1 )
       != c31 ) ),
    inference(spm,[status(thm)],[c_0_30,c_0_31]) ).

thf(c_0_36,plain,
    ! [X23: position] :
      ( ( next @ ( next @ X23 @ top ) @ bottom )
      = X23 ),
    inference(variable_rename,[status(thm)],[top_bottom]) ).

thf(c_0_37,plain,
    ( ( next @ c31 @ left )
    = c21 ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).

thf(c_0_38,negated_conjecture,
    ! [X5: movelist,X1: direction,X2: direction] :
      ( ( wall @ ( next @ ( next @ ( playerpos @ X5 ) @ X1 ) @ X2 ) )
      | ( wall @ ( next @ ( playerpos @ X5 ) @ X1 ) )
      | ( ( next @ ( next @ ( playerpos @ X5 ) @ X1 ) @ X2 )
       != c31 ) ),
    inference(spm,[status(thm)],[c_0_35,c_0_31]) ).

thf(c_0_39,plain,
    ! [X3: position] :
      ( ( next @ ( next @ X3 @ top ) @ bottom )
      = X3 ),
    inference(split_conjunct,[status(thm)],[c_0_36]) ).

thf(c_0_40,plain,
    ! [X1: direction] :
      ( ( next @ ( next @ c31 @ X1 ) @ left )
      = ( next @ c21 @ X1 ) ),
    inference(spm,[status(thm)],[c_0_24,c_0_37]) ).

thf(c_0_41,plain,
    ( c20
    = ( next @ c10 @ right ) ),
    inference(split_conjunct,[status(thm)],[c20_defin]) ).

thf(c_0_42,negated_conjecture,
    ! [X5: movelist,X2: direction,X1: direction,X6: direction] :
      ( ( wall @ ( next @ ( next @ ( next @ ( playerpos @ X5 ) @ X1 ) @ X2 ) @ X6 ) )
      | ( wall @ ( next @ ( next @ ( playerpos @ X5 ) @ X1 ) @ X2 ) )
      | ( wall @ ( next @ ( playerpos @ X5 ) @ X1 ) )
      | ( ( next @ ( next @ ( next @ ( playerpos @ X5 ) @ X1 ) @ X2 ) @ X6 )
       != c31 ) ),
    inference(spm,[status(thm)],[c_0_38,c_0_31]) ).

thf(c_0_43,plain,
    ! [X3: position,X1: direction] :
      ( ( next @ ( next @ ( next @ X3 @ top ) @ X1 ) @ bottom )
      = ( next @ X3 @ X1 ) ),
    inference(spm,[status(thm)],[c_0_39,c_0_24]) ).

thf(c_0_44,plain,
    ( ( ~ ( wall @ c12 )
      | ~ $true )
    & ( $true
      | ( wall @ c12 ) ) ),
    inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c12_axiom])]) ).

thf(c_0_45,plain,
    ( ( next @ c21 @ right )
    = c31 ),
    inference(spm,[status(thm)],[c_0_28,c_0_40]) ).

thf(c_0_46,plain,
    ! [X1: direction] :
      ( ( next @ ( next @ c20 @ X1 ) @ top )
      = ( next @ c21 @ X1 ) ),
    inference(spm,[status(thm)],[c_0_24,c_0_34]) ).

thf(c_0_47,plain,
    ( ( next @ c20 @ left )
    = c10 ),
    inference(spm,[status(thm)],[c_0_28,c_0_41]) ).

thf(c_0_48,plain,
    ( c11
    = ( next @ c10 @ top ) ),
    inference(split_conjunct,[status(thm)],[c11_defin]) ).

thf(c_0_49,negated_conjecture,
    ! [X5: movelist,X6: direction,X2: direction,X1: direction,X7: direction] :
      ( ( wall @ ( next @ ( next @ ( next @ ( next @ ( playerpos @ X5 ) @ X1 ) @ X2 ) @ X6 ) @ X7 ) )
      | ( wall @ ( next @ ( next @ ( next @ ( playerpos @ X5 ) @ X1 ) @ X2 ) @ X6 ) )
      | ( wall @ ( next @ ( next @ ( playerpos @ X5 ) @ X1 ) @ X2 ) )
      | ( wall @ ( next @ ( playerpos @ X5 ) @ X1 ) )
      | ( ( next @ ( next @ ( next @ ( next @ ( playerpos @ X5 ) @ X1 ) @ X2 ) @ X6 ) @ X7 )
       != c31 ) ),
    inference(spm,[status(thm)],[c_0_42,c_0_31]) ).

thf(c_0_50,plain,
    ! [X1: direction,X3: position,X2: direction] :
      ( ( next @ ( next @ ( next @ ( next @ X3 @ top ) @ X1 ) @ X2 ) @ bottom )
      = ( next @ ( next @ X3 @ X1 ) @ X2 ) ),
    inference(spm,[status(thm)],[c_0_24,c_0_43]) ).

thf(c_0_51,plain,
    ( ~ ( wall @ c12 )
    | ~ $true ),
    inference(split_conjunct,[status(thm)],[c_0_44]) ).

thf(c_0_52,plain,
    ( c12
    = ( next @ c11 @ top ) ),
    inference(split_conjunct,[status(thm)],[c12_defin]) ).

thf(c_0_53,plain,
    ! [X1: direction] :
      ( ( next @ ( next @ c21 @ X1 ) @ right )
      = ( next @ c31 @ X1 ) ),
    inference(spm,[status(thm)],[c_0_24,c_0_45]) ).

thf(c_0_54,plain,
    ( ( next @ c21 @ left )
    = c11 ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]) ).

thf(c_0_55,plain,
    ( ( ~ ( wall @ c22 )
      | ~ $true )
    & ( $true
      | ( wall @ c22 ) ) ),
    inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c22_axiom])]) ).

thf(c_0_56,negated_conjecture,
    ! [X5: movelist,X1: direction,X2: direction] :
      ( ( wall @ ( next @ ( next @ ( next @ ( playerpos @ X5 ) @ top ) @ X1 ) @ X2 ) )
      | ( wall @ ( next @ ( next @ ( playerpos @ X5 ) @ top ) @ X1 ) )
      | ( wall @ ( next @ ( next @ ( playerpos @ X5 ) @ X1 ) @ X2 ) )
      | ( wall @ ( next @ ( playerpos @ X5 ) @ top ) )
      | ( ( next @ ( next @ ( playerpos @ X5 ) @ X1 ) @ X2 )
       != c31 ) ),
    inference(spm,[status(thm)],[c_0_49,c_0_50]) ).

thf(c_0_57,plain,
    ( ( playerpos @ nomove )
    = c11 ),
    inference(split_conjunct,[status(thm)],[start_axiom]) ).

thf(c_0_58,plain,
    ~ ( wall @ c12 ),
    inference(cn,[status(thm)],[c_0_51]) ).

thf(c_0_59,plain,
    ! [X1: direction] :
      ( ( next @ ( next @ c11 @ X1 ) @ top )
      = ( next @ c12 @ X1 ) ),
    inference(spm,[status(thm)],[c_0_24,c_0_52]) ).

thf(c_0_60,plain,
    ( ( next @ c11 @ right )
    = c21 ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_37]) ).

thf(c_0_61,plain,
    ( c22
    = ( next @ c21 @ top ) ),
    inference(split_conjunct,[status(thm)],[c22_defin]) ).

thf(c_0_62,plain,
    ( ~ ( wall @ c22 )
    | ~ $true ),
    inference(split_conjunct,[status(thm)],[c_0_55]) ).

thf(c_0_63,plain,
    ( ( ~ ( wall @ c32 )
      | ~ $true )
    & ( $true
      | ( wall @ c32 ) ) ),
    inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c32_axiom])]) ).

thf(c_0_64,plain,
    ( ( ~ ( wall @ c31 )
      | ~ $true )
    & ( $true
      | ( wall @ c31 ) ) ),
    inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c31_axiom])]) ).

thf(c_0_65,negated_conjecture,
    ! [X1: direction,X2: direction] :
      ( ( wall @ ( next @ ( next @ c11 @ X1 ) @ X2 ) )
      | ( wall @ ( next @ ( next @ c12 @ X1 ) @ X2 ) )
      | ( wall @ ( next @ c12 @ X1 ) )
      | ( ( next @ ( next @ c11 @ X1 ) @ X2 )
       != c31 ) ),
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_52]),c_0_52]),c_0_52]),c_0_58]) ).

thf(c_0_66,plain,
    ( ( next @ c12 @ right )
    = c22 ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61]) ).

thf(c_0_67,plain,
    ~ ( wall @ c22 ),
    inference(cn,[status(thm)],[c_0_62]) ).

thf(c_0_68,plain,
    ( c32
    = ( next @ c31 @ top ) ),
    inference(split_conjunct,[status(thm)],[c32_defin]) ).

thf(c_0_69,plain,
    ( ~ ( wall @ c32 )
    | ~ $true ),
    inference(split_conjunct,[status(thm)],[c_0_63]) ).

thf(c_0_70,plain,
    ( ~ ( wall @ c31 )
    | ~ $true ),
    inference(split_conjunct,[status(thm)],[c_0_64]) ).

thf(c_0_71,negated_conjecture,
    ! [X1: direction] :
      ( ( wall @ ( next @ c22 @ X1 ) )
      | ( wall @ ( next @ c21 @ X1 ) )
      | ( ( next @ c21 @ X1 )
       != c31 ) ),
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_60]),c_0_60]),c_0_67]) ).

thf(c_0_72,plain,
    ( ( next @ c22 @ right )
    = c32 ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_61]),c_0_68]) ).

thf(c_0_73,plain,
    ~ ( wall @ c32 ),
    inference(cn,[status(thm)],[c_0_69]) ).

thf(c_0_74,plain,
    ~ ( wall @ c31 ),
    inference(cn,[status(thm)],[c_0_70]) ).

thf(c_0_75,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_45]),c_0_45])]),c_0_73]),c_0_74]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem    : PUZ142^1 : TPTP v8.2.0. Released v6.2.0.
% 0.04/0.14  % Command    : run_E %s %d THM
% 0.14/0.35  % Computer : n011.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Sat May 18 10:57:23 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.20/0.48  Running higher-order theorem proving
% 0.20/0.48  Running: /export/starexec/sandbox/solver/bin/eprover-ho --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.79/0.63  # Version: 3.1.0-ho
% 0.79/0.63  # partial match(2): FSMSSMSMSSSNFFN
% 0.79/0.63  # Preprocessing class: HSMSSMSMMSSNFFN.
% 0.79/0.63  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.79/0.63  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.79/0.63  # Starting new_bool_3 with 300s (1) cores
% 0.79/0.63  # Starting new_bool_1 with 300s (1) cores
% 0.79/0.63  # Starting sh5l with 300s (1) cores
% 0.79/0.63  # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 6688 completed with status 0
% 0.79/0.63  # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.79/0.63  # partial match(2): FSMSSMSMSSSNFFN
% 0.79/0.63  # Preprocessing class: HSMSSMSMMSSNFFN.
% 0.79/0.63  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.79/0.63  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.79/0.63  # No SInE strategy applied
% 0.79/0.63  # Search class: HGUSS-FFMM21-SFFSFFNN
% 0.79/0.63  # partial match(3): FGUSF-FFMM21-SFFFFFNN
% 0.79/0.63  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.79/0.63  # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.79/0.63  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.79/0.63  # Starting new_bool_3 with 136s (1) cores
% 0.79/0.63  # Starting new_bool_1 with 136s (1) cores
% 0.79/0.63  # Starting sh5l with 136s (1) cores
% 0.79/0.63  # SAT001_MinMin_p005000_rr_RG with pid 6695 completed with status 0
% 0.79/0.63  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.79/0.63  # partial match(2): FSMSSMSMSSSNFFN
% 0.79/0.63  # Preprocessing class: HSMSSMSMMSSNFFN.
% 0.79/0.63  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.79/0.63  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.79/0.63  # No SInE strategy applied
% 0.79/0.63  # Search class: HGUSS-FFMM21-SFFSFFNN
% 0.79/0.63  # partial match(3): FGUSF-FFMM21-SFFFFFNN
% 0.79/0.63  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.79/0.63  # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.79/0.63  # Preprocessing time       : 0.001 s
% 0.79/0.63  # Presaturation interreduction done
% 0.79/0.63  
% 0.79/0.63  # Proof found!
% 0.79/0.63  # SZS status Theorem
% 0.79/0.63  # SZS output start CNFRefutation
% See solution above
% 0.79/0.63  # Parsed axioms                        : 84
% 0.79/0.63  # Removed by relevancy pruning/SinE    : 0
% 0.79/0.63  # Initial clauses                      : 104
% 0.79/0.63  # Removed in clause preprocessing      : 57
% 0.79/0.63  # Initial clauses in saturation        : 47
% 0.79/0.63  # Processed clauses                    : 1465
% 0.79/0.63  # ...of these trivial                  : 160
% 0.79/0.63  # ...subsumed                          : 988
% 0.79/0.63  # ...remaining for further processing  : 317
% 0.79/0.63  # Other redundant clauses eliminated   : 2
% 0.79/0.63  # Clauses deleted for lack of memory   : 0
% 0.79/0.63  # Backward-subsumed                    : 0
% 0.79/0.63  # Backward-rewritten                   : 8
% 0.79/0.63  # Generated clauses                    : 11589
% 0.79/0.63  # ...of the previous two non-redundant : 10399
% 0.79/0.63  # ...aggressively subsumed             : 0
% 0.79/0.63  # Contextual simplify-reflections      : 0
% 0.79/0.63  # Paramodulations                      : 11587
% 0.79/0.63  # Factorizations                       : 0
% 0.79/0.63  # NegExts                              : 0
% 0.79/0.63  # Equation resolutions                 : 2
% 0.79/0.63  # Disequality decompositions           : 0
% 0.79/0.63  # Total rewrite steps                  : 6081
% 0.79/0.63  # ...of those cached                   : 5478
% 0.79/0.63  # Propositional unsat checks           : 0
% 0.79/0.63  #    Propositional check models        : 0
% 0.79/0.63  #    Propositional check unsatisfiable : 0
% 0.79/0.63  #    Propositional clauses             : 0
% 0.79/0.63  #    Propositional clauses after purity: 0
% 0.79/0.63  #    Propositional unsat core size     : 0
% 0.79/0.63  #    Propositional preprocessing time  : 0.000
% 0.79/0.63  #    Propositional encoding time       : 0.000
% 0.79/0.63  #    Propositional solver time         : 0.000
% 0.79/0.63  #    Success case prop preproc time    : 0.000
% 0.79/0.63  #    Success case prop encoding time   : 0.000
% 0.79/0.63  #    Success case prop solver time     : 0.000
% 0.79/0.63  # Current number of processed clauses  : 260
% 0.79/0.63  #    Positive orientable unit clauses  : 164
% 0.79/0.63  #    Positive unorientable unit clauses: 13
% 0.79/0.63  #    Negative unit clauses             : 10
% 0.79/0.63  #    Non-unit-clauses                  : 73
% 0.79/0.63  # Current number of unprocessed clauses: 9024
% 0.79/0.63  # ...number of literals in the above   : 9261
% 0.79/0.63  # Current number of archived formulas  : 0
% 0.79/0.63  # Current number of archived clauses   : 55
% 0.79/0.63  # Clause-clause subsumption calls (NU) : 8604
% 0.79/0.63  # Rec. Clause-clause subsumption calls : 3351
% 0.79/0.63  # Non-unit clause-clause subsumptions  : 543
% 0.79/0.63  # Unit Clause-clause subsumption calls : 367
% 0.79/0.63  # Rewrite failures with RHS unbound    : 0
% 0.79/0.63  # BW rewrite match attempts            : 748
% 0.79/0.63  # BW rewrite match successes           : 303
% 0.79/0.63  # Condensation attempts                : 0
% 0.79/0.63  # Condensation successes               : 0
% 0.79/0.63  # Termbank termtop insertions          : 148409
% 0.79/0.63  # Search garbage collected termcells   : 240
% 0.79/0.63  
% 0.79/0.63  # -------------------------------------------------
% 0.79/0.63  # User time                : 0.129 s
% 0.79/0.63  # System time              : 0.007 s
% 0.79/0.63  # Total time               : 0.136 s
% 0.79/0.63  # Maximum resident set size: 1900 pages
% 0.79/0.63  
% 0.79/0.63  # -------------------------------------------------
% 0.79/0.63  # User time                : 0.632 s
% 0.79/0.63  # System time              : 0.033 s
% 0.79/0.63  # Total time               : 0.664 s
% 0.79/0.63  # Maximum resident set size: 1768 pages
% 0.79/0.63  % E---3.1 exiting
% 0.79/0.63  % E exiting
%------------------------------------------------------------------------------