TSTP Solution File: LCL734^5 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : LCL734^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n020.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 00:22:25 EDT 2024

% Result   : Theorem 0.15s 0.43s
% Output   : Refutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   26 (   5 unt;   8 typ;   0 def)
%            Number of atoms       :  118 (  46 equ;   0 cnn)
%            Maximal formula atoms :    6 (   6 avg)
%            Number of connectives :  235 (  20   ~;  18   |;  13   &; 165   @)
%                                         (   0 <=>;  16  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   6 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :  143 ( 143   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   10 (   6 usr;   3 con; 0-3 aty)
%                                         (   0  !!;   0  ??;   3 @@+;   0 @@-)
%            Number of variables   :   83 (   0   ^  51   !;  30   ?;  83   :)
%                                         (   2  !>;   0  ?*;   0  @-;   0  @+)

% Comments : 
%------------------------------------------------------------------------------
thf(type_def_5,type,
    b: $tType ).

thf(func_def_0,type,
    b: $tType ).

thf(func_def_2,type,
    vEPSILON: 
      !>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).

thf(func_def_5,type,
    sK0: ( ( b > $o ) > b ) > b > $o ).

thf(func_def_6,type,
    sK1: ( ( b > $o ) > b ) > b ).

thf(func_def_7,type,
    sK2: ( ( b > $o ) > b > $o ) > ( ( b > $o ) > b > $o ) > ( b > $o ) > b ).

thf(func_def_8,type,
    sK3: ( ( b > $o ) > b > $o ) > ( ( b > $o ) > b > $o ) > b > $o ).

thf(func_def_10,type,
    ph5: 
      !>[X0: $tType] : X0 ).

thf(f29,plain,
    $false,
    inference(trivial_inequality_removal,[],[f24]) ).

thf(f24,plain,
    $true = $false,
    inference(superposition,[],[f16,f21]) ).

thf(f21,plain,
    ! [X0: b] :
      ( ( sK0 @ @@+ @ b @ X0 )
      = $false ),
    inference(trivial_inequality_removal,[],[f19]) ).

thf(f19,plain,
    ! [X0: b] :
      ( ( ( sK0 @ @@+ @ b @ X0 )
        = $false )
      | ( $true != $true ) ),
    inference(superposition,[],[f15,f17]) ).

thf(f17,plain,
    ! [X0: ( b > $o ) > b,X1: b] :
      ( ( $true
        = ( sK0 @ X0 @ ( @@+ @ b @ ( sK0 @ X0 ) ) ) )
      | ( ( sK0 @ X0 @ X1 )
        = $false ) ),
    introduced(choice_axiom,[]) ).

thf(f15,plain,
    ! [X0: ( b > $o ) > b] :
      ( $true
     != ( sK0 @ X0 @ ( X0 @ ( sK0 @ X0 ) ) ) ),
    inference(cnf_transformation,[],[f12]) ).

thf(f12,plain,
    ( ! [X0: ( b > $o ) > b] :
        ( ( $true
          = ( sK0 @ X0 @ ( sK1 @ X0 ) ) )
        & ( $true
         != ( sK0 @ X0 @ ( X0 @ ( sK0 @ X0 ) ) ) ) )
    & ! [X3: ( b > $o ) > b > $o,X4: ( b > $o ) > b > $o] :
        ( ! [X6: b > $o] :
            ( ( ( X3 @ X6 @ ( sK2 @ X4 @ X3 @ X6 ) )
              = $true )
            | ( $true
              = ( X4 @ X6 @ ( sK2 @ X4 @ X3 @ X6 ) ) ) )
        | ! [X8: b] :
            ( ( $true
             != ( X4 @ ( sK3 @ X4 @ X3 ) @ X8 ) )
            & ( $true
             != ( X3 @ ( sK3 @ X4 @ X3 ) @ X8 ) ) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f7,f11,f10,f9,f8]) ).

thf(f8,plain,
    ! [X0: ( b > $o ) > b] :
      ( ? [X1: b > $o] :
          ( ? [X2: b] :
              ( ( X1 @ X2 )
              = $true )
          & ( $true
           != ( X1 @ ( X0 @ X1 ) ) ) )
     => ( ? [X2: b] :
            ( ( sK0 @ X0 @ X2 )
            = $true )
        & ( $true
         != ( sK0 @ X0 @ ( X0 @ ( sK0 @ X0 ) ) ) ) ) ),
    introduced(choice_axiom,[]) ).

thf(f9,plain,
    ! [X0: ( b > $o ) > b] :
      ( ? [X2: b] :
          ( ( sK0 @ X0 @ X2 )
          = $true )
     => ( $true
        = ( sK0 @ X0 @ ( sK1 @ X0 ) ) ) ),
    introduced(choice_axiom,[]) ).

thf(f10,plain,
    ! [X3: ( b > $o ) > b > $o,X4: ( b > $o ) > b > $o] :
      ( ? [X5: ( b > $o ) > b] :
        ! [X6: b > $o] :
          ( ( $true
            = ( X3 @ X6 @ ( X5 @ X6 ) ) )
          | ( ( X4 @ X6 @ ( X5 @ X6 ) )
            = $true ) )
     => ! [X6: b > $o] :
          ( ( ( X3 @ X6 @ ( sK2 @ X4 @ X3 @ X6 ) )
            = $true )
          | ( $true
            = ( X4 @ X6 @ ( sK2 @ X4 @ X3 @ X6 ) ) ) ) ),
    introduced(choice_axiom,[]) ).

thf(f11,plain,
    ! [X3: ( b > $o ) > b > $o,X4: ( b > $o ) > b > $o] :
      ( ? [X7: b > $o] :
        ! [X8: b] :
          ( ( $true
           != ( X4 @ X7 @ X8 ) )
          & ( $true
           != ( X3 @ X7 @ X8 ) ) )
     => ! [X8: b] :
          ( ( $true
           != ( X4 @ ( sK3 @ X4 @ X3 ) @ X8 ) )
          & ( $true
           != ( X3 @ ( sK3 @ X4 @ X3 ) @ X8 ) ) ) ),
    introduced(choice_axiom,[]) ).

thf(f7,plain,
    ( ! [X0: ( b > $o ) > b] :
      ? [X1: b > $o] :
        ( ? [X2: b] :
            ( ( X1 @ X2 )
            = $true )
        & ( $true
         != ( X1 @ ( X0 @ X1 ) ) ) )
    & ! [X3: ( b > $o ) > b > $o,X4: ( b > $o ) > b > $o] :
        ( ? [X5: ( b > $o ) > b] :
          ! [X6: b > $o] :
            ( ( $true
              = ( X3 @ X6 @ ( X5 @ X6 ) ) )
            | ( ( X4 @ X6 @ ( X5 @ X6 ) )
              = $true ) )
        | ? [X7: b > $o] :
          ! [X8: b] :
            ( ( $true
             != ( X4 @ X7 @ X8 ) )
            & ( $true
             != ( X3 @ X7 @ X8 ) ) ) ) ),
    inference(rectify,[],[f6]) ).

thf(f6,plain,
    ( ! [X6: ( b > $o ) > b] :
      ? [X7: b > $o] :
        ( ? [X8: b] :
            ( $true
            = ( X7 @ X8 ) )
        & ( $true
         != ( X7 @ ( X6 @ X7 ) ) ) )
    & ! [X0: ( b > $o ) > b > $o,X1: ( b > $o ) > b > $o] :
        ( ? [X4: ( b > $o ) > b] :
          ! [X5: b > $o] :
            ( ( ( X0 @ X5 @ ( X4 @ X5 ) )
              = $true )
            | ( $true
              = ( X1 @ X5 @ ( X4 @ X5 ) ) ) )
        | ? [X2: b > $o] :
          ! [X3: b] :
            ( ( ( X1 @ X2 @ X3 )
             != $true )
            & ( ( X0 @ X2 @ X3 )
             != $true ) ) ) ),
    inference(ennf_transformation,[],[f5]) ).

thf(f5,plain,
    ~ ( ! [X0: ( b > $o ) > b > $o,X1: ( b > $o ) > b > $o] :
          ( ! [X2: b > $o] :
            ? [X3: b] :
              ( ( ( X1 @ X2 @ X3 )
                = $true )
              | ( ( X0 @ X2 @ X3 )
                = $true ) )
         => ? [X4: ( b > $o ) > b] :
            ! [X5: b > $o] :
              ( ( ( X0 @ X5 @ ( X4 @ X5 ) )
                = $true )
              | ( $true
                = ( X1 @ X5 @ ( X4 @ X5 ) ) ) ) )
     => ? [X6: ( b > $o ) > b] :
        ! [X7: b > $o] :
          ( ? [X8: b] :
              ( $true
              = ( X7 @ X8 ) )
         => ( $true
            = ( X7 @ ( X6 @ X7 ) ) ) ) ),
    inference(fool_elimination,[],[f4]) ).

thf(f4,plain,
    ~ ( ! [X0: ( b > $o ) > b > $o,X1: ( b > $o ) > b > $o] :
          ( ! [X2: b > $o] :
            ? [X3: b] :
              ( ( X0 @ X2 @ X3 )
              | ( X1 @ X2 @ X3 ) )
         => ? [X4: ( b > $o ) > b] :
            ! [X5: b > $o] :
              ( ( X1 @ X5 @ ( X4 @ X5 ) )
              | ( X0 @ X5 @ ( X4 @ X5 ) ) ) )
     => ? [X6: ( b > $o ) > b] :
        ! [X7: b > $o] :
          ( ? [X8: b] : ( X7 @ X8 )
         => ( X7 @ ( X6 @ X7 ) ) ) ),
    inference(rectify,[],[f2]) ).

thf(f2,negated_conjecture,
    ~ ( ! [X0: ( b > $o ) > b > $o,X1: ( b > $o ) > b > $o] :
          ( ! [X2: b > $o] :
            ? [X3: b] :
              ( ( X0 @ X2 @ X3 )
              | ( X1 @ X2 @ X3 ) )
         => ? [X4: ( b > $o ) > b] :
            ! [X2: b > $o] :
              ( ( X1 @ X2 @ ( X4 @ X2 ) )
              | ( X0 @ X2 @ ( X4 @ X2 ) ) ) )
     => ? [X5: ( b > $o ) > b] :
        ! [X6: b > $o] :
          ( ? [X7: b] : ( X6 @ X7 )
         => ( X6 @ ( X5 @ X6 ) ) ) ),
    inference(negated_conjecture,[],[f1]) ).

thf(f1,conjecture,
    ( ! [X0: ( b > $o ) > b > $o,X1: ( b > $o ) > b > $o] :
        ( ! [X2: b > $o] :
          ? [X3: b] :
            ( ( X0 @ X2 @ X3 )
            | ( X1 @ X2 @ X3 ) )
       => ? [X4: ( b > $o ) > b] :
          ! [X2: b > $o] :
            ( ( X1 @ X2 @ ( X4 @ X2 ) )
            | ( X0 @ X2 @ ( X4 @ X2 ) ) ) )
   => ? [X5: ( b > $o ) > b] :
      ! [X6: b > $o] :
        ( ? [X7: b] : ( X6 @ X7 )
       => ( X6 @ ( X5 @ X6 ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cX5310B) ).

thf(f16,plain,
    ! [X0: ( b > $o ) > b] :
      ( $true
      = ( sK0 @ X0 @ ( sK1 @ X0 ) ) ),
    inference(cnf_transformation,[],[f12]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09  % Problem    : LCL734^5 : TPTP v8.2.0. Released v4.0.0.
% 0.05/0.10  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.10/0.30  % Computer : n020.cluster.edu
% 0.10/0.30  % Model    : x86_64 x86_64
% 0.10/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30  % Memory   : 8042.1875MB
% 0.10/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30  % CPULimit   : 300
% 0.10/0.30  % WCLimit    : 300
% 0.10/0.30  % DateTime   : Mon May 20 01:28:40 EDT 2024
% 0.10/0.30  % CPUTime    : 
% 0.10/0.30  This is a TH0_THM_NEQ_NAR problem
% 0.10/0.30  Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.31  ipcrm: permission denied for id (1666875393)
% 0.15/0.31  ipcrm: permission denied for id (1666940931)
% 0.15/0.31  ipcrm: permission denied for id (1667006469)
% 0.15/0.32  ipcrm: permission denied for id (1667104776)
% 0.15/0.32  ipcrm: permission denied for id (1667137545)
% 0.15/0.32  ipcrm: permission denied for id (1667203083)
% 0.15/0.32  ipcrm: permission denied for id (1667235852)
% 0.15/0.32  ipcrm: permission denied for id (1667268621)
% 0.15/0.33  ipcrm: permission denied for id (1667596311)
% 0.15/0.33  ipcrm: permission denied for id (1667629080)
% 0.15/0.33  ipcrm: permission denied for id (1667661849)
% 0.15/0.33  ipcrm: permission denied for id (1667694618)
% 0.15/0.33  ipcrm: permission denied for id (1667727387)
% 0.15/0.33  ipcrm: permission denied for id (1667891231)
% 0.15/0.34  ipcrm: permission denied for id (1667989538)
% 0.15/0.34  ipcrm: permission denied for id (1668022307)
% 0.15/0.34  ipcrm: permission denied for id (1668055076)
% 0.15/0.34  ipcrm: permission denied for id (1668153383)
% 0.15/0.34  ipcrm: permission denied for id (1668218920)
% 0.15/0.34  ipcrm: permission denied for id (1668284458)
% 0.15/0.35  ipcrm: permission denied for id (1668382765)
% 0.15/0.35  ipcrm: permission denied for id (1668415534)
% 0.15/0.35  ipcrm: permission denied for id (1668481071)
% 0.15/0.35  ipcrm: permission denied for id (1668513840)
% 0.15/0.35  ipcrm: permission denied for id (1668546609)
% 0.15/0.35  ipcrm: permission denied for id (1668775991)
% 0.15/0.36  ipcrm: permission denied for id (1668874297)
% 0.15/0.36  ipcrm: permission denied for id (1668939835)
% 0.15/0.36  ipcrm: permission denied for id (1669103680)
% 0.15/0.36  ipcrm: permission denied for id (1669136449)
% 0.15/0.36  ipcrm: permission denied for id (1669169218)
% 0.15/0.36  ipcrm: permission denied for id (1669201987)
% 0.15/0.37  ipcrm: permission denied for id (1669267525)
% 0.15/0.37  ipcrm: permission denied for id (1669300294)
% 0.15/0.37  ipcrm: permission denied for id (1669496908)
% 0.15/0.37  ipcrm: permission denied for id (1669529677)
% 0.15/0.37  ipcrm: permission denied for id (1669562446)
% 0.15/0.37  ipcrm: permission denied for id (1669595215)
% 0.15/0.37  ipcrm: permission denied for id (1669660753)
% 0.15/0.38  ipcrm: permission denied for id (1669759059)
% 0.15/0.38  ipcrm: permission denied for id (1669857366)
% 0.15/0.39  ipcrm: permission denied for id (1670021214)
% 0.15/0.39  ipcrm: permission denied for id (1670053983)
% 0.15/0.39  ipcrm: permission denied for id (1670086752)
% 0.15/0.39  ipcrm: permission denied for id (1670152290)
% 0.15/0.39  ipcrm: permission denied for id (1670185059)
% 0.15/0.39  ipcrm: permission denied for id (1670217828)
% 0.15/0.39  ipcrm: permission denied for id (1670250597)
% 0.15/0.39  ipcrm: permission denied for id (1670283366)
% 0.15/0.39  ipcrm: permission denied for id (1670348904)
% 0.15/0.39  ipcrm: permission denied for id (1670381673)
% 0.15/0.39  ipcrm: permission denied for id (1670414442)
% 0.15/0.40  ipcrm: permission denied for id (1670447211)
% 0.15/0.40  ipcrm: permission denied for id (1670479980)
% 0.15/0.40  ipcrm: permission denied for id (1670512749)
% 0.15/0.40  ipcrm: permission denied for id (1670545518)
% 0.15/0.40  ipcrm: permission denied for id (1670578287)
% 0.15/0.40  ipcrm: permission denied for id (1670643825)
% 0.15/0.40  ipcrm: permission denied for id (1670676594)
% 0.15/0.40  ipcrm: permission denied for id (1670742132)
% 0.15/0.41  ipcrm: permission denied for id (1670840440)
% 0.15/0.41  ipcrm: permission denied for id (1670905978)
% 0.15/0.41  ipcrm: permission denied for id (1671037053)
% 0.15/0.41  ipcrm: permission denied for id (1671069822)
% 0.15/0.41  ipcrm: permission denied for id (1671102591)
% 0.15/0.43  % (16642)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2998ds/2Mi)
% 0.15/0.43  % (16644)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on theBenchmark for (2998ds/275Mi)
% 0.15/0.43  % (16640)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on theBenchmark for (2998ds/4Mi)
% 0.15/0.43  % (16639)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (2998ds/183Mi)
% 0.15/0.43  % (16645)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2998ds/18Mi)
% 0.15/0.43  % (16641)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on theBenchmark for (2998ds/27Mi)
% 0.15/0.43  % (16643)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on theBenchmark for (2998ds/2Mi)
% 0.15/0.43  % (16646)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2998ds/3Mi)
% 0.15/0.43  % (16642)Instruction limit reached!
% 0.15/0.43  % (16642)------------------------------
% 0.15/0.43  % (16642)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.43  % (16642)Termination reason: Unknown
% 0.15/0.43  % (16642)Termination phase: Property scanning
% 0.15/0.43  % (16643)Instruction limit reached!
% 0.15/0.43  % (16643)------------------------------
% 0.15/0.43  % (16643)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.43  % (16643)Termination reason: Unknown
% 0.15/0.43  % (16643)Termination phase: Saturation
% 0.15/0.43  
% 0.15/0.43  % (16643)Memory used [KB]: 895
% 0.15/0.43  % (16643)Time elapsed: 0.003 s
% 0.15/0.43  % (16643)Instructions burned: 2 (million)
% 0.15/0.43  % (16643)------------------------------
% 0.15/0.43  % (16643)------------------------------
% 0.15/0.43  
% 0.15/0.43  % (16642)Memory used [KB]: 895
% 0.15/0.43  % (16642)Time elapsed: 0.003 s
% 0.15/0.43  % (16642)Instructions burned: 2 (million)
% 0.15/0.43  % (16642)------------------------------
% 0.15/0.43  % (16642)------------------------------
% 0.15/0.43  % (16646)Instruction limit reached!
% 0.15/0.43  % (16646)------------------------------
% 0.15/0.43  % (16646)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.43  % (16646)Termination reason: Unknown
% 0.15/0.43  % (16646)Termination phase: Saturation
% 0.15/0.43  
% 0.15/0.43  % (16646)Memory used [KB]: 5500
% 0.15/0.43  % (16646)Time elapsed: 0.004 s
% 0.15/0.43  % (16646)Instructions burned: 3 (million)
% 0.15/0.43  % (16646)------------------------------
% 0.15/0.43  % (16646)------------------------------
% 0.15/0.43  % (16640)Instruction limit reached!
% 0.15/0.43  % (16640)------------------------------
% 0.15/0.43  % (16640)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.43  % (16640)Termination reason: Unknown
% 0.15/0.43  % (16640)Termination phase: Saturation
% 0.15/0.43  
% 0.15/0.43  % (16640)Memory used [KB]: 5500
% 0.15/0.43  % (16641)First to succeed.
% 0.15/0.43  % (16640)Time elapsed: 0.004 s
% 0.15/0.43  % (16640)Instructions burned: 4 (million)
% 0.15/0.43  % (16640)------------------------------
% 0.15/0.43  % (16640)------------------------------
% 0.15/0.43  % (16641)Refutation found. Thanks to Tanya!
% 0.15/0.43  % SZS status Theorem for theBenchmark
% 0.15/0.43  % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.43  % (16641)------------------------------
% 0.15/0.43  % (16641)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.43  % (16641)Termination reason: Refutation
% 0.15/0.43  
% 0.15/0.43  % (16641)Memory used [KB]: 5500
% 0.15/0.43  % (16641)Time elapsed: 0.005 s
% 0.15/0.43  % (16641)Instructions burned: 3 (million)
% 0.15/0.43  % (16641)------------------------------
% 0.15/0.43  % (16641)------------------------------
% 0.15/0.43  % (16505)Success in time 0.126 s
% 0.15/0.43  % Vampire---4.8 exiting
%------------------------------------------------------------------------------