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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SEV164^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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n006.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 04:12:13 EDT 2024

% Result   : Theorem 0.13s 0.38s
% Output   : Refutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   26 (   4 unt;   7 typ;   0 def)
%            Number of atoms       :   96 (  39 equ;   0 cnn)
%            Maximal formula atoms :    8 (   5 avg)
%            Number of connectives :  175 (  20   ~;  13   |;   5   &; 128   @)
%                                         (   5 <=>;   3  =>;   0  <=;   1 <~>)
%            Maximal formula depth :   10 (   5 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :   83 (  83   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    8 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :  152 (  88   ^  26   !;  37   ?; 152   :)
%                                         (   1  !>;   0  ?*;   0  @-;   0  @+)

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

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

thf(func_def_7,type,
    sK0: a > a > $o ).

thf(func_def_8,type,
    sK1: a ).

thf(func_def_9,type,
    sK2: a ).

thf(func_def_10,type,
    sK3: ( a > a > a ) > a ).

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

thf(f24,plain,
    $false,
    inference(equality_resolution,[],[f21]) ).

thf(f21,plain,
    ! [X3: ( a > a > a ) > a] :
      ( sK2
     != ( X3
        @ ^ [Y0: a,Y1: a] : Y0 ) ),
    inference(trivial_inequality_removal,[],[f19]) ).

thf(f19,plain,
    ! [X3: ( a > a > a ) > a] :
      ( ( $true != $true )
      | ( sK2
       != ( X3
          @ ^ [Y0: a,Y1: a] : Y0 ) ) ),
    inference(constrained_superposition,[],[f16,f17]) ).

thf(f17,plain,
    ( ( sK0 @ sK2 @ sK1 )
    = $true ),
    inference(subsumption_resolution,[],[f14,f16]) ).

thf(f14,plain,
    ( ( ( sK0 @ sK2 @ sK1 )
      = $true )
    | ( ( sK0
        @ ( sK3
          @ ^ [Y0: a,Y1: a] : Y0 )
        @ ( sK3
          @ ^ [Y0: a,Y1: a] : Y1 ) )
      = $true ) ),
    inference(cnf_transformation,[],[f13]) ).

thf(f13,plain,
    ( ( ! [X1: a,X2: a] :
          ( $true
         != ( sK0 @ X2 @ X1 ) )
      | ! [X3: ( a > a > a ) > a] :
          ( ( sK0
            @ ( X3
              @ ^ [Y0: a,Y1: a] : Y0 )
            @ ( X3
              @ ^ [Y0: a,Y1: a] : Y1 ) )
         != $true ) )
    & ( ( ( sK0 @ sK2 @ sK1 )
        = $true )
      | ( ( sK0
          @ ( sK3
            @ ^ [Y0: a,Y1: a] : Y0 )
          @ ( sK3
            @ ^ [Y0: a,Y1: a] : Y1 ) )
        = $true ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f9,f12,f11,f10]) ).

thf(f10,plain,
    ( ? [X0: a > a > $o] :
        ( ( ! [X1: a,X2: a] :
              ( ( X0 @ X2 @ X1 )
             != $true )
          | ! [X3: ( a > a > a ) > a] :
              ( ( X0
                @ ( X3
                  @ ^ [Y0: a,Y1: a] : Y0 )
                @ ( X3
                  @ ^ [Y0: a,Y1: a] : Y1 ) )
             != $true ) )
        & ( ? [X4: a,X5: a] :
              ( ( X0 @ X5 @ X4 )
              = $true )
          | ? [X6: ( a > a > a ) > a] :
              ( ( X0
                @ ( X6
                  @ ^ [Y0: a,Y1: a] : Y0 )
                @ ( X6
                  @ ^ [Y0: a,Y1: a] : Y1 ) )
              = $true ) ) )
   => ( ( ! [X2: a,X1: a] :
            ( $true
           != ( sK0 @ X2 @ X1 ) )
        | ! [X3: ( a > a > a ) > a] :
            ( ( sK0
              @ ( X3
                @ ^ [Y0: a,Y1: a] : Y0 )
              @ ( X3
                @ ^ [Y0: a,Y1: a] : Y1 ) )
           != $true ) )
      & ( ? [X5: a,X4: a] :
            ( ( sK0 @ X5 @ X4 )
            = $true )
        | ? [X6: ( a > a > a ) > a] :
            ( ( sK0
              @ ( X6
                @ ^ [Y0: a,Y1: a] : Y0 )
              @ ( X6
                @ ^ [Y0: a,Y1: a] : Y1 ) )
            = $true ) ) ) ),
    introduced(choice_axiom,[]) ).

thf(f11,plain,
    ( ? [X5: a,X4: a] :
        ( ( sK0 @ X5 @ X4 )
        = $true )
   => ( ( sK0 @ sK2 @ sK1 )
      = $true ) ),
    introduced(choice_axiom,[]) ).

thf(f12,plain,
    ( ? [X6: ( a > a > a ) > a] :
        ( ( sK0
          @ ( X6
            @ ^ [Y0: a,Y1: a] : Y0 )
          @ ( X6
            @ ^ [Y0: a,Y1: a] : Y1 ) )
        = $true )
   => ( ( sK0
        @ ( sK3
          @ ^ [Y0: a,Y1: a] : Y0 )
        @ ( sK3
          @ ^ [Y0: a,Y1: a] : Y1 ) )
      = $true ) ),
    introduced(choice_axiom,[]) ).

thf(f9,plain,
    ? [X0: a > a > $o] :
      ( ( ! [X1: a,X2: a] :
            ( ( X0 @ X2 @ X1 )
           != $true )
        | ! [X3: ( a > a > a ) > a] :
            ( ( X0
              @ ( X3
                @ ^ [Y0: a,Y1: a] : Y0 )
              @ ( X3
                @ ^ [Y0: a,Y1: a] : Y1 ) )
           != $true ) )
      & ( ? [X4: a,X5: a] :
            ( ( X0 @ X5 @ X4 )
            = $true )
        | ? [X6: ( a > a > a ) > a] :
            ( ( X0
              @ ( X6
                @ ^ [Y0: a,Y1: a] : Y0 )
              @ ( X6
                @ ^ [Y0: a,Y1: a] : Y1 ) )
            = $true ) ) ),
    inference(rectify,[],[f8]) ).

thf(f8,plain,
    ? [X0: a > a > $o] :
      ( ( ! [X2: a,X3: a] :
            ( ( X0 @ X3 @ X2 )
           != $true )
        | ! [X1: ( a > a > a ) > a] :
            ( ( X0
              @ ( X1
                @ ^ [Y0: a,Y1: a] : Y0 )
              @ ( X1
                @ ^ [Y0: a,Y1: a] : Y1 ) )
           != $true ) )
      & ( ? [X2: a,X3: a] :
            ( ( X0 @ X3 @ X2 )
            = $true )
        | ? [X1: ( a > a > a ) > a] :
            ( ( X0
              @ ( X1
                @ ^ [Y0: a,Y1: a] : Y0 )
              @ ( X1
                @ ^ [Y0: a,Y1: a] : Y1 ) )
            = $true ) ) ),
    inference(nnf_transformation,[],[f7]) ).

thf(f7,plain,
    ? [X0: a > a > $o] :
      ( ? [X1: ( a > a > a ) > a] :
          ( ( X0
            @ ( X1
              @ ^ [Y0: a,Y1: a] : Y0 )
            @ ( X1
              @ ^ [Y0: a,Y1: a] : Y1 ) )
          = $true )
    <~> ? [X2: a,X3: a] :
          ( ( X0 @ X3 @ X2 )
          = $true ) ),
    inference(ennf_transformation,[],[f6]) ).

thf(f6,plain,
    ~ ! [X0: a > a > $o] :
        ( ? [X2: a,X3: a] :
            ( ( X0 @ X3 @ X2 )
            = $true )
      <=> ? [X1: ( a > a > a ) > a] :
            ( ( X0
              @ ( X1
                @ ^ [Y0: a,Y1: a] : Y0 )
              @ ( X1
                @ ^ [Y0: a,Y1: a] : Y1 ) )
            = $true ) ),
    inference(rectify,[],[f5]) ).

thf(f5,plain,
    ~ ! [X0: a > a > $o] :
        ( ? [X1: ( a > a > a ) > a] :
            ( ( X0
              @ ( X1
                @ ^ [Y0: a,Y1: a] : Y0 )
              @ ( X1
                @ ^ [Y0: a,Y1: a] : Y1 ) )
            = $true )
      <=> ? [X6: a,X7: a] :
            ( ( X0 @ X7 @ X6 )
            = $true ) ),
    inference(fool_elimination,[],[f4]) ).

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

thf(f2,negated_conjecture,
    ~ ! [X0: a > a > $o] :
        ( ? [X3: ( a > a > a ) > a] :
            ( X0
            @ ( X3
              @ ^ [X1: a,X2: a] : X1 )
            @ ( X3
              @ ^ [X1: a,X2: a] : X2 ) )
      <=> ? [X2: a,X1: a] : ( X0 @ X1 @ X2 ) ),
    inference(negated_conjecture,[],[f1]) ).

thf(f1,conjecture,
    ! [X0: a > a > $o] :
      ( ? [X3: ( a > a > a ) > a] :
          ( X0
          @ ( X3
            @ ^ [X1: a,X2: a] : X1 )
          @ ( X3
            @ ^ [X1: a,X2: a] : X2 ) )
    <=> ? [X2: a,X1: a] : ( X0 @ X1 @ X2 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM185_pme) ).

thf(f16,plain,
    ! [X0: ( a > a > a ) > a] :
      ( $true
     != ( sK0
        @ ( X0
          @ ^ [Y0: a,Y1: a] : Y0 )
        @ ( X0
          @ ^ [Y0: a,Y1: a] : Y1 ) ) ),
    inference(condensation,[],[f15]) ).

thf(f15,plain,
    ! [X2: a,X3: ( a > a > a ) > a,X1: a] :
      ( ( $true
       != ( sK0 @ X2 @ X1 ) )
      | ( ( sK0
          @ ( X3
            @ ^ [Y0: a,Y1: a] : Y0 )
          @ ( X3
            @ ^ [Y0: a,Y1: a] : Y1 ) )
       != $true ) ),
    inference(cnf_transformation,[],[f13]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SEV164^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.14  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.13/0.35  % Computer : n006.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Sun May 19 19:19:38 EDT 2024
% 0.13/0.36  % CPUTime    : 
% 0.13/0.36  This is a TH0_THM_NEQ_NAR problem
% 0.13/0.36  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/sandbox2/benchmark/theBenchmark.p
% 0.13/0.38  % (16526)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 (3000ds/27Mi)
% 0.13/0.38  % (16525)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 (3000ds/4Mi)
% 0.13/0.38  % (16528)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 (3000ds/2Mi)
% 0.13/0.38  % (16527)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.13/0.38  % (16524)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (3000ds/183Mi)
% 0.13/0.38  % (16530)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.13/0.38  % (16527)Instruction limit reached!
% 0.13/0.38  % (16527)------------------------------
% 0.13/0.38  % (16527)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.38  % (16527)Termination reason: Unknown
% 0.13/0.38  % (16527)Termination phase: Saturation
% 0.13/0.38  % (16528)Instruction limit reached!
% 0.13/0.38  % (16528)------------------------------
% 0.13/0.38  % (16528)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.38  % (16528)Termination reason: Unknown
% 0.13/0.38  % (16528)Termination phase: Saturation
% 0.13/0.38  
% 0.13/0.38  % (16528)Memory used [KB]: 5500
% 0.13/0.38  % (16528)Time elapsed: 0.004 s
% 0.13/0.38  % (16528)Instructions burned: 2 (million)
% 0.13/0.38  % (16528)------------------------------
% 0.13/0.38  % (16528)------------------------------
% 0.13/0.38  
% 0.13/0.38  % (16527)Memory used [KB]: 5500
% 0.13/0.38  % (16527)Time elapsed: 0.003 s
% 0.13/0.38  % (16527)Instructions burned: 2 (million)
% 0.13/0.38  % (16527)------------------------------
% 0.13/0.38  % (16527)------------------------------
% 0.13/0.38  % (16529)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 (3000ds/275Mi)
% 0.13/0.38  % (16526)Refutation not found, incomplete strategy
% 0.13/0.38  % (16526)------------------------------
% 0.13/0.38  % (16526)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.38  % (16526)Termination reason: Refutation not found, incomplete strategy
% 0.13/0.38  
% 0.13/0.38  
% 0.13/0.38  % (16526)Memory used [KB]: 5500
% 0.13/0.38  % (16526)Time elapsed: 0.004 s
% 0.13/0.38  % (16526)Instructions burned: 2 (million)
% 0.13/0.38  % (16526)------------------------------
% 0.13/0.38  % (16526)------------------------------
% 0.13/0.38  % (16525)Instruction limit reached!
% 0.13/0.38  % (16525)------------------------------
% 0.13/0.38  % (16525)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.38  % (16525)Termination reason: Unknown
% 0.13/0.38  % (16525)Termination phase: Saturation
% 0.13/0.38  % (16529)Refutation not found, incomplete strategy
% 0.13/0.38  % (16529)------------------------------
% 0.13/0.38  % (16529)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.38  % (16529)Termination reason: Refutation not found, incomplete strategy
% 0.13/0.38  
% 0.13/0.38  
% 0.13/0.38  % (16529)Memory used [KB]: 5500
% 0.13/0.38  % (16529)Time elapsed: 0.003 s
% 0.13/0.38  % (16529)Instructions burned: 2 (million)
% 0.13/0.38  % (16529)------------------------------
% 0.13/0.38  % (16529)------------------------------
% 0.13/0.38  
% 0.13/0.38  % (16525)Memory used [KB]: 5500
% 0.13/0.38  % (16525)Time elapsed: 0.006 s
% 0.13/0.38  % (16525)Instructions burned: 4 (million)
% 0.13/0.38  % (16525)------------------------------
% 0.13/0.38  % (16525)------------------------------
% 0.13/0.38  % (16530)First to succeed.
% 0.13/0.38  % (16524)Refutation not found, incomplete strategy
% 0.13/0.38  % (16524)------------------------------
% 0.13/0.38  % (16524)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.38  % (16524)Termination reason: Refutation not found, incomplete strategy
% 0.13/0.38  
% 0.13/0.38  
% 0.13/0.38  % (16524)Memory used [KB]: 5500
% 0.13/0.38  % (16524)Time elapsed: 0.006 s
% 0.13/0.38  % (16524)Instructions burned: 4 (million)
% 0.13/0.38  % (16524)------------------------------
% 0.13/0.38  % (16524)------------------------------
% 0.13/0.38  % (16531)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (3000ds/3Mi)
% 0.13/0.38  % (16530)Refutation found. Thanks to Tanya!
% 0.13/0.38  % SZS status Theorem for theBenchmark
% 0.13/0.38  % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.38  % (16530)------------------------------
% 0.13/0.38  % (16530)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.38  % (16530)Termination reason: Refutation
% 0.13/0.38  
% 0.13/0.38  % (16530)Memory used [KB]: 5500
% 0.13/0.38  % (16530)Time elapsed: 0.006 s
% 0.13/0.38  % (16530)Instructions burned: 2 (million)
% 0.13/0.38  % (16530)------------------------------
% 0.13/0.38  % (16530)------------------------------
% 0.13/0.38  % (16523)Success in time 0.007 s
% 0.13/0.38  % Vampire---4.8 exiting
%------------------------------------------------------------------------------