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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SYO091^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 : n005.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:54 EDT 2024

% Result   : Theorem 0.15s 0.37s
% Output   : Refutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   62 (   1 unt;   1 typ;   0 def)
%            Number of atoms       :  454 ( 150 equ)
%            Maximal formula atoms :   32 (   7 avg)
%            Number of connectives :  310 ( 113   ~; 144   |;  25   &)
%                                         (  26 <=>;   1  =>;   0  <=;   1 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of FOOLs       :  318 ( 214 fml; 104 var)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :   13 (  10 usr;  11 prp; 0-2 aty)
%            Number of functors    :    1 (   1 usr;   0 con; 1-1 aty)
%            Number of variables   :   26 (  13   !;  12   ?;  26   :)
%                                         (   1  !>;   0  ?*;   0  @-;   0  @+)

% Comments : 
%------------------------------------------------------------------------------
tff(func_def_0,type,
    vEPSILON: 
      !>[X0: $tType] : sTfun(sTfun(X0,$o),X0) ).

tff(f122,plain,
    $false,
    inference(avatar_sat_refutation,[],[f36,f37,f38,f39,f40,f41,f42,f43,f75,f78,f91,f93,f97,f99,f101,f110,f121]) ).

tff(f121,plain,
    ( ~ spl3_6
    | ~ spl3_1
    | spl3_3 ),
    inference(avatar_split_clause,[],[f116,f29,f21,f52]) ).

tff(f52,plain,
    ( spl3_6
  <=> ( sK0 = $true ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl3_6])]) ).

tff(f21,plain,
    ( spl3_1
  <=> ( sK2 = sK0 ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).

tff(f29,plain,
    ( spl3_3
  <=> ( sK2 = $true ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl3_3])]) ).

tff(f116,plain,
    ( ( sK0 != $true )
    | ~ spl3_1
    | spl3_3 ),
    inference(superposition,[],[f30,f22]) ).

tff(f22,plain,
    ( ( sK2 = sK0 )
    | ~ spl3_1 ),
    inference(avatar_component_clause,[],[f21]) ).

tff(f30,plain,
    ( ( sK2 != $true )
    | spl3_3 ),
    inference(avatar_component_clause,[],[f29]) ).

tff(f110,plain,
    ( ~ spl3_6
    | ~ spl3_2
    | spl3_4 ),
    inference(avatar_split_clause,[],[f106,f33,f25,f52]) ).

tff(f25,plain,
    ( spl3_2
  <=> ( sK1 = sK0 ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).

tff(f33,plain,
    ( spl3_4
  <=> ( sK1 = $true ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl3_4])]) ).

tff(f106,plain,
    ( ( sK0 != $true )
    | ~ spl3_2
    | spl3_4 ),
    inference(superposition,[],[f34,f26]) ).

tff(f26,plain,
    ( ( sK1 = sK0 )
    | ~ spl3_2 ),
    inference(avatar_component_clause,[],[f25]) ).

tff(f34,plain,
    ( ( sK1 != $true )
    | spl3_4 ),
    inference(avatar_component_clause,[],[f33]) ).

tff(f101,plain,
    ( ~ spl3_6
    | spl3_2
    | ~ spl3_4 ),
    inference(avatar_split_clause,[],[f100,f33,f25,f52]) ).

tff(f100,plain,
    ( ( sK0 != $true )
    | spl3_2
    | ~ spl3_4 ),
    inference(forward_demodulation,[],[f27,f35]) ).

tff(f35,plain,
    ( ( sK1 = $true )
    | ~ spl3_4 ),
    inference(avatar_component_clause,[],[f33]) ).

tff(f27,plain,
    ( ( sK1 != sK0 )
    | spl3_2 ),
    inference(avatar_component_clause,[],[f25]) ).

tff(f99,plain,
    ( spl3_6
    | ~ spl3_1
    | ~ spl3_3 ),
    inference(avatar_split_clause,[],[f98,f29,f21,f52]) ).

tff(f98,plain,
    ( ( sK0 = $true )
    | ~ spl3_1
    | ~ spl3_3 ),
    inference(forward_demodulation,[],[f22,f31]) ).

tff(f31,plain,
    ( ( sK2 = $true )
    | ~ spl3_3 ),
    inference(avatar_component_clause,[],[f29]) ).

tff(f97,plain,
    ( ~ spl3_6
    | spl3_1
    | ~ spl3_3 ),
    inference(avatar_split_clause,[],[f94,f29,f21,f52]) ).

tff(f94,plain,
    ( ( sK0 != $true )
    | spl3_1
    | ~ spl3_3 ),
    inference(backward_demodulation,[],[f23,f31]) ).

tff(f23,plain,
    ( ( sK2 != sK0 )
    | spl3_1 ),
    inference(avatar_component_clause,[],[f21]) ).

tff(f93,plain,
    ( spl3_6
    | ~ spl3_2
    | ~ spl3_4 ),
    inference(avatar_split_clause,[],[f92,f33,f25,f52]) ).

tff(f92,plain,
    ( ( sK0 = $true )
    | ~ spl3_2
    | ~ spl3_4 ),
    inference(forward_demodulation,[],[f26,f35]) ).

tff(f91,plain,
    ( spl3_6
    | spl3_5 ),
    inference(avatar_split_clause,[],[f90,f47,f52]) ).

tff(f47,plain,
    ( spl3_5
  <=> ( $false = sK0 ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl3_5])]) ).

tff(f90,plain,
    ( ( sK0 = $true )
    | spl3_5 ),
    inference(trivial_inequality_removal,[],[f88]) ).

tff(f88,plain,
    ( ( sK0 = $true )
    | ( $false != $false )
    | spl3_5 ),
    inference(superposition,[],[f49,f4]) ).

tff(f4,plain,
    ! [X0: $o] :
      ( ( $true = (X0) )
      | ( $false = (X0) ) ),
    introduced(fool_axiom,[]) ).

tff(f49,plain,
    ( ( $false != sK0 )
    | spl3_5 ),
    inference(avatar_component_clause,[],[f47]) ).

tff(f78,plain,
    ( spl3_4
    | ~ spl3_5
    | spl3_2 ),
    inference(avatar_split_clause,[],[f76,f25,f47,f33]) ).

tff(f76,plain,
    ( ( $false != sK0 )
    | ( sK1 = $true )
    | spl3_2 ),
    inference(superposition,[],[f27,f4]) ).

tff(f75,plain,
    ( spl3_3
    | ~ spl3_5
    | spl3_1 ),
    inference(avatar_split_clause,[],[f72,f21,f47,f29]) ).

tff(f72,plain,
    ( ( sK2 = $true )
    | ( $false != sK0 )
    | spl3_1 ),
    inference(superposition,[],[f23,f4]) ).

tff(f43,plain,
    ( ~ spl3_4
    | spl3_1
    | spl3_3
    | ~ spl3_2 ),
    inference(avatar_split_clause,[],[f15,f25,f29,f21,f33]) ).

tff(f15,plain,
    ( ( sK2 = $true )
    | ( sK1 != $true )
    | ( sK1 != sK0 )
    | ( sK2 = sK0 ) ),
    inference(cnf_transformation,[],[f11]) ).

tff(f11,plain,
    ( ( ( ( ( sK1 != sK0 )
          | ( sK2 != $true ) )
        & ( ( sK1 = sK0 )
          | ( sK2 = $true ) ) )
      | ( ( ( sK1 != $true )
          | ( sK2 != sK0 ) )
        & ( ( sK1 = $true )
          | ( sK2 = sK0 ) ) ) )
    & ( ( ( ( sK2 = $true )
          | ( sK1 != sK0 ) )
        & ( ( sK1 = sK0 )
          | ( sK2 != $true ) ) )
      | ( ( ( sK2 = sK0 )
          | ( sK1 != $true ) )
        & ( ( sK1 = $true )
          | ( sK2 != sK0 ) ) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f9,f10]) ).

tff(f10,plain,
    ( ? [X0: $o,X1: $o,X2: $o] :
        ( ( ( ( ( (X0) != (X1) )
              | ( $true != (X2) ) )
            & ( ( (X0) = (X1) )
              | ( $true = (X2) ) ) )
          | ( ( ( $true != (X1) )
              | ( (X0) != (X2) ) )
            & ( ( $true = (X1) )
              | ( (X0) = (X2) ) ) ) )
        & ( ( ( ( $true = (X2) )
              | ( (X0) != (X1) ) )
            & ( ( (X0) = (X1) )
              | ( $true != (X2) ) ) )
          | ( ( ( (X0) = (X2) )
              | ( $true != (X1) ) )
            & ( ( $true = (X1) )
              | ( (X0) != (X2) ) ) ) ) )
   => ( ( ( ( ( sK1 != sK0 )
            | ( sK2 != $true ) )
          & ( ( sK1 = sK0 )
            | ( sK2 = $true ) ) )
        | ( ( ( sK1 != $true )
            | ( sK2 != sK0 ) )
          & ( ( sK1 = $true )
            | ( sK2 = sK0 ) ) ) )
      & ( ( ( ( sK2 = $true )
            | ( sK1 != sK0 ) )
          & ( ( sK1 = sK0 )
            | ( sK2 != $true ) ) )
        | ( ( ( sK2 = sK0 )
            | ( sK1 != $true ) )
          & ( ( sK1 = $true )
            | ( sK2 != sK0 ) ) ) ) ) ),
    introduced(choice_axiom,[]) ).

tff(f9,plain,
    ? [X0: $o,X1: $o,X2: $o] :
      ( ( ( ( ( (X0) != (X1) )
            | ( $true != (X2) ) )
          & ( ( (X0) = (X1) )
            | ( $true = (X2) ) ) )
        | ( ( ( $true != (X1) )
            | ( (X0) != (X2) ) )
          & ( ( $true = (X1) )
            | ( (X0) = (X2) ) ) ) )
      & ( ( ( ( $true = (X2) )
            | ( (X0) != (X1) ) )
          & ( ( (X0) = (X1) )
            | ( $true != (X2) ) ) )
        | ( ( ( (X0) = (X2) )
            | ( $true != (X1) ) )
          & ( ( $true = (X1) )
            | ( (X0) != (X2) ) ) ) ) ),
    inference(rectify,[],[f8]) ).

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

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

tff(f6,plain,
    ~ ! [X1: $o,X0: $o,X2: $o] :
        ( ( ( (X0) = (X1) )
        <=> ( $true = (X2) ) )
      <=> ( ( $true = (X1) )
        <=> ( (X0) = (X2) ) ) ),
    inference(fool_elimination,[],[f5]) ).

tff(f5,plain,
    ~ ! [X0: $o,X1: $o,X2: $o] :
        ( ( ( (X0)
          <=> (X1) )
        <=> (X2) )
      <=> ( (X1)
        <=> ( (X2)
          <=> (X0) ) ) ),
    inference(rectify,[],[f2]) ).

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

tff(f1,conjecture,
    ! [X1: $o,X0: $o,X2: $o] :
      ( ( ( (X1)
        <=> (X0) )
      <=> (X2) )
    <=> ( (X0)
      <=> ( (X2)
        <=> (X1) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM50Q) ).

tff(f42,plain,
    ( spl3_1
    | ~ spl3_2
    | ~ spl3_3
    | spl3_4 ),
    inference(avatar_split_clause,[],[f18,f33,f29,f25,f21]) ).

tff(f18,plain,
    ( ( sK1 != sK0 )
    | ( sK1 = $true )
    | ( sK2 != $true )
    | ( sK2 = sK0 ) ),
    inference(cnf_transformation,[],[f11]) ).

tff(f41,plain,
    ( spl3_2
    | spl3_3
    | ~ spl3_4
    | ~ spl3_1 ),
    inference(avatar_split_clause,[],[f17,f21,f33,f29,f25]) ).

tff(f17,plain,
    ( ( sK2 != sK0 )
    | ( sK1 = sK0 )
    | ( sK1 != $true )
    | ( sK2 = $true ) ),
    inference(cnf_transformation,[],[f11]) ).

tff(f40,plain,
    ( ~ spl3_4
    | ~ spl3_3
    | spl3_2
    | spl3_1 ),
    inference(avatar_split_clause,[],[f13,f21,f25,f29,f33]) ).

tff(f13,plain,
    ( ( sK2 != $true )
    | ( sK2 = sK0 )
    | ( sK1 != $true )
    | ( sK1 = sK0 ) ),
    inference(cnf_transformation,[],[f11]) ).

tff(f39,plain,
    ( ~ spl3_2
    | ~ spl3_4
    | ~ spl3_1
    | ~ spl3_3 ),
    inference(avatar_split_clause,[],[f19,f29,f21,f33,f25]) ).

tff(f19,plain,
    ( ( sK1 != $true )
    | ( sK2 != $true )
    | ( sK1 != sK0 )
    | ( sK2 != sK0 ) ),
    inference(cnf_transformation,[],[f11]) ).

tff(f38,plain,
    ( spl3_4
    | spl3_2
    | spl3_1
    | spl3_3 ),
    inference(avatar_split_clause,[],[f16,f29,f21,f25,f33]) ).

tff(f16,plain,
    ( ( sK1 = sK0 )
    | ( sK1 = $true )
    | ( sK2 = sK0 )
    | ( sK2 = $true ) ),
    inference(cnf_transformation,[],[f11]) ).

tff(f37,plain,
    ( ~ spl3_3
    | spl3_2
    | ~ spl3_1
    | spl3_4 ),
    inference(avatar_split_clause,[],[f12,f33,f21,f25,f29]) ).

tff(f12,plain,
    ( ( sK2 != sK0 )
    | ( sK2 != $true )
    | ( sK1 = sK0 )
    | ( sK1 = $true ) ),
    inference(cnf_transformation,[],[f11]) ).

tff(f36,plain,
    ( ~ spl3_1
    | ~ spl3_2
    | spl3_3
    | spl3_4 ),
    inference(avatar_split_clause,[],[f14,f33,f29,f25,f21]) ).

tff(f14,plain,
    ( ( sK1 != sK0 )
    | ( sK2 = $true )
    | ( sK1 = $true )
    | ( sK2 != sK0 ) ),
    inference(cnf_transformation,[],[f11]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem    : SYO091^5 : TPTP v8.2.0. Released v4.0.0.
% 0.06/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.15/0.35  % Computer : n005.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit   : 300
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Mon May 20 10:52:23 EDT 2024
% 0.15/0.35  % CPUTime    : 
% 0.15/0.35  This is a TH0_THM_NEQ_NAR problem
% 0.15/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.15/0.37  % (26936)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.15/0.37  % (26938)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.15/0.37  % (26939)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.15/0.37  % (26940)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.15/0.37  % (26941)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.15/0.37  % (26942)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.15/0.37  % (26941)Refutation not found, incomplete strategy
% 0.15/0.37  % (26941)------------------------------
% 0.15/0.37  % (26941)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.37  % (26941)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.37  
% 0.15/0.37  
% 0.15/0.37  % (26941)Memory used [KB]: 5500
% 0.15/0.37  % (26941)Time elapsed: 0.003 s
% 0.15/0.37  % (26941)Instructions burned: 2 (million)
% 0.15/0.37  % (26941)------------------------------
% 0.15/0.37  % (26941)------------------------------
% 0.15/0.37  % (26939)Instruction limit reached!
% 0.15/0.37  % (26939)------------------------------
% 0.15/0.37  % (26939)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.37  % (26939)Termination reason: Unknown
% 0.15/0.37  % (26939)Termination phase: Saturation
% 0.15/0.37  % (26940)Instruction limit reached!
% 0.15/0.37  % (26940)------------------------------
% 0.15/0.37  % (26940)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.37  % (26940)Termination reason: Unknown
% 0.15/0.37  % (26940)Termination phase: Saturation
% 0.15/0.37  
% 0.15/0.37  % (26940)Memory used [KB]: 5500
% 0.15/0.37  % (26940)Time elapsed: 0.004 s
% 0.15/0.37  % (26940)Instructions burned: 3 (million)
% 0.15/0.37  % (26940)------------------------------
% 0.15/0.37  % (26940)------------------------------
% 0.15/0.37  
% 0.15/0.37  % (26939)Memory used [KB]: 5500
% 0.15/0.37  % (26939)Time elapsed: 0.004 s
% 0.15/0.37  % (26939)Instructions burned: 3 (million)
% 0.15/0.37  % (26939)------------------------------
% 0.15/0.37  % (26939)------------------------------
% 0.15/0.37  % (26938)First to succeed.
% 0.15/0.37  % (26942)Also succeeded, but the first one will report.
% 0.15/0.37  % (26938)Refutation found. Thanks to Tanya!
% 0.15/0.37  % SZS status Theorem for theBenchmark
% 0.15/0.37  % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.38  % (26938)------------------------------
% 0.15/0.38  % (26938)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38  % (26938)Termination reason: Refutation
% 0.15/0.38  
% 0.15/0.38  % (26938)Memory used [KB]: 5500
% 0.15/0.38  % (26938)Time elapsed: 0.006 s
% 0.15/0.38  % (26938)Instructions burned: 3 (million)
% 0.15/0.38  % (26938)------------------------------
% 0.15/0.38  % (26938)------------------------------
% 0.15/0.38  % (26935)Success in time 0.007 s
% 0.15/0.38  % Vampire---4.8 exiting
%------------------------------------------------------------------------------