TSTP Solution File: SYO029^1 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SYO029^1 : TPTP v8.2.0. Released v3.7.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 : n003.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 09:02:17 EDT 2024

% Result   : Theorem 0.14s 0.37s
% Output   : Refutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   18
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   23 (   4 unt;   2 typ;   0 def)
%            Number of atoms       :  113 (  41 equ;   3 cnn)
%            Maximal formula atoms :    8 (   5 avg)
%            Number of connectives :  117 (  38   ~;  16   |;   4   &;  52   @)
%                                         (   5 <=>;   1  =>;   0  <=;   1 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :   16 (  16   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    6 (   2 usr;   3 con; 0-2 aty)
%            Number of variables   :   35 (  12   ^  14   !;   8   ?;  35   :)
%                                         (   1  !>;   0  ?*;   0  @-;   0  @+)

% Comments : 
%------------------------------------------------------------------------------
thf(func_def_3,type,
    sK0: ( $o > $o ) > $o ).

thf(func_def_6,type,
    ph2: 
      !>[X0: $tType] : X0 ).

thf(f47,plain,
    $false,
    inference(trivial_inequality_removal,[],[f46]) ).

thf(f46,plain,
    $true = $false,
    inference(boolean_simplification,[],[f45]) ).

thf(f45,plain,
    ( ~ $true = $true ),
    inference(trivial_inequality_removal,[],[f44]) ).

thf(f44,plain,
    ( ( $true != $true )
    | ( ~ $true = $true ) ),
    inference(superposition,[],[f11,f42]) ).

thf(f42,plain,
    ( $true
    = ( sK0 @ (~) ) ),
    inference(duplicate_literal_removal,[],[f41]) ).

thf(f41,plain,
    ( ( $true
      = ( sK0 @ (~) ) )
    | ( $true
      = ( sK0 @ (~) ) ) ),
    inference(beta_eta_normalization,[],[f27]) ).

thf(f27,plain,
    ( ( $true
      = ( sK0
        @ ^ [Y0: $o] :
            ~ ( ^ [Y1: $o] : Y1
              @ Y0 ) ) )
    | ( $true
      = ( ^ [Y0: $o] : Y0
        @ ( sK0
          @ ^ [Y0: $o] :
              ~ ( ^ [Y1: $o] : Y1
                @ Y0 ) ) ) ) ),
    inference(primitive_instantiation,[],[f22]) ).

thf(f22,plain,
    ! [X3: $o > $o] :
      ( ( ( X3
          @ ( sK0
            @ ^ [Y0: $o] :
                ~ ( X3 @ Y0 ) ) )
        = $true )
      | ( ( sK0
          @ ^ [Y0: $o] :
              ~ ( X3 @ Y0 ) )
        = $true ) ),
    inference(not_proxy_clausification,[],[f21]) ).

thf(f21,plain,
    ! [X3: $o > $o] :
      ( ( ( sK0
          @ ^ [Y0: $o] :
              ~ ( X3 @ Y0 ) )
        = $true )
      | ( $true
       != ( ~ ( X3
              @ ( sK0
                @ ^ [Y0: $o] :
                    ~ ( X3 @ Y0 ) ) ) ) ) ),
    inference(beta_eta_normalization,[],[f16]) ).

thf(f16,plain,
    ! [X3: $o > $o] :
      ( ( ( sK0
          @ ^ [Y0: $o] :
              ~ ( X3 @ Y0 ) )
        = $true )
      | ( $true
       != ( ^ [Y0: $o] :
              ~ ( X3 @ Y0 )
          @ ( sK0
            @ ^ [Y0: $o] :
                ~ ( X3 @ Y0 ) ) ) ) ),
    inference(primitive_instantiation,[],[f12]) ).

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

thf(f10,plain,
    ! [X0: $o > $o] :
      ( ( ( $true
         != ( X0 @ ( sK0 @ X0 ) ) )
        | ( ( sK0 @ X0 )
          = $true ) )
      & ( ( $true
          = ( X0 @ ( sK0 @ X0 ) ) )
        | ( ( sK0 @ X0 )
         != $true ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f8,f9]) ).

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

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

thf(f7,plain,
    ! [X0: $o > $o] :
    ? [X1: $o] :
      ( ( $true != X1 )
    <~> ( ( X0 @ X1 )
        = $true ) ),
    inference(ennf_transformation,[],[f6]) ).

thf(f6,plain,
    ~ ? [X0: $o > $o] :
      ! [X1: $o] :
        ( ( $true != X1 )
      <=> ( ( X0 @ X1 )
          = $true ) ),
    inference(flattening,[],[f5]) ).

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

thf(f4,plain,
    ~ ? [X0: $o > $o] :
      ! [X1: $o] :
        ( ( X0 @ X1 )
      <=> ~ X1 ),
    inference(rectify,[],[f2]) ).

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

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

thf(f11,plain,
    ! [X0: $o > $o] :
      ( ( ( sK0 @ X0 )
       != $true )
      | ( $true
        = ( X0 @ ( sK0 @ X0 ) ) ) ),
    inference(cnf_transformation,[],[f10]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SYO029^1 : TPTP v8.2.0. Released v3.7.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.14/0.35  % Computer : n003.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   : Mon May 20 08:58:08 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.14/0.35  This is a TH0_THM_NEQ_NAR problem
% 0.14/0.35  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.14/0.37  % (6129)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.14/0.37  % (6128)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.14/0.37  % (6129)Refutation not found, incomplete strategy
% 0.14/0.37  % (6129)------------------------------
% 0.14/0.37  % (6129)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37  % (6129)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.37  
% 0.14/0.37  
% 0.14/0.37  % (6129)Memory used [KB]: 5500
% 0.14/0.37  % (6129)Time elapsed: 0.002 s
% 0.14/0.37  % (6129)Instructions burned: 1 (million)
% 0.14/0.37  % (6129)------------------------------
% 0.14/0.37  % (6129)------------------------------
% 0.14/0.37  % (6128)Instruction limit reached!
% 0.14/0.37  % (6128)------------------------------
% 0.14/0.37  % (6128)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37  % (6128)Termination reason: Unknown
% 0.14/0.37  % (6128)Termination phase: Saturation
% 0.14/0.37  
% 0.14/0.37  % (6128)Memory used [KB]: 5500
% 0.14/0.37  % (6128)Time elapsed: 0.003 s
% 0.14/0.37  % (6128)Instructions burned: 5 (million)
% 0.14/0.37  % (6128)------------------------------
% 0.14/0.37  % (6128)------------------------------
% 0.14/0.37  % (6130)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.14/0.37  % (6127)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.14/0.37  % (6134)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.14/0.37  % (6130)First to succeed.
% 0.14/0.37  % (6132)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.14/0.37  % (6130)Refutation found. Thanks to Tanya!
% 0.14/0.37  % SZS status Theorem for theBenchmark
% 0.14/0.37  % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.37  % (6130)------------------------------
% 0.14/0.37  % (6130)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37  % (6130)Termination reason: Refutation
% 0.14/0.37  
% 0.14/0.37  % (6130)Memory used [KB]: 5500
% 0.14/0.37  % (6130)Time elapsed: 0.003 s
% 0.14/0.37  % (6130)Instructions burned: 1 (million)
% 0.14/0.37  % (6130)------------------------------
% 0.14/0.37  % (6130)------------------------------
% 0.14/0.37  % (6126)Success in time 0.011 s
% 0.14/0.37  % Vampire---4.8 exiting
%------------------------------------------------------------------------------