TSTP Solution File: SEU633_8 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SEU633_8 : TPTP v8.2.0. Released v8.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 : n029.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 03:50:09 EDT 2024

% Result   : Theorem 0.70s 0.89s
% Output   : Refutation 0.70s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   43 (   9 unt;   1 typ;   0 def)
%            Number of atoms       :  222 (  28 equ)
%            Maximal formula atoms :    6 (   5 avg)
%            Number of connectives :  156 (  55   ~;  51   |;  19   &)
%                                         (   6 <=>;  25  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of FOOLs       :  123 (  83 fml;  40 var)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    3 (   1   >;   2   *;   0   +;   0  <<)
%            Number of predicates  :   13 (  10 usr;  10 prp; 0-2 aty)
%            Number of functors    :    1 (   1 usr;   0 con; 3-3 aty)
%            Number of variables   :   74 (  64   !;  10   ?;  30   :)

% Comments : 
%------------------------------------------------------------------------------
tff(func_def_3,type,
    sK0: ( $i * $i * $o ) > $i ).

tff(f87,plain,
    $false,
    inference(avatar_sat_refutation,[],[f31,f35,f36,f61,f84,f86]) ).

tff(f86,plain,
    spl3_4,
    inference(avatar_contradiction_clause,[],[f85]) ).

tff(f85,plain,
    ( $false
    | spl3_4 ),
    inference(resolution,[],[f57,f21]) ).

tff(f21,plain,
    in(sK2,setunion(sK1)),
    inference(cnf_transformation,[],[f16]) ).

tff(f16,plain,
    ( ! [X2] :
        ( ~ in(sK2,X2)
        | ~ in(X2,sK1) )
    & in(sK2,setunion(sK1))
    & setunionE ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f12,f15]) ).

tff(f15,plain,
    ( ? [X0,X1] :
        ( ! [X2] :
            ( ~ in(X1,X2)
            | ~ in(X2,X0) )
        & in(X1,setunion(X0)) )
   => ( ! [X2] :
          ( ~ in(sK2,X2)
          | ~ in(X2,sK1) )
      & in(sK2,setunion(sK1)) ) ),
    introduced(choice_axiom,[]) ).

tff(f12,plain,
    ( ? [X0,X1] :
        ( ! [X2] :
            ( ~ in(X1,X2)
            | ~ in(X2,X0) )
        & in(X1,setunion(X0)) )
    & setunionE ),
    inference(ennf_transformation,[],[f8]) ).

tff(f8,plain,
    ~ ( setunionE
     => ! [X0,X1] :
          ( in(X1,setunion(X0))
         => ? [X2] :
              ( in(X1,X2)
              & in(X2,X0) ) ) ),
    inference(rectify,[],[f3]) ).

tff(f3,negated_conjecture,
    ~ ( setunionE
     => ! [X0,X1] :
          ( in(X1,setunion(X0))
         => ? [X4] :
              ( in(X1,X4)
              & in(X4,X0) ) ) ),
    inference(negated_conjecture,[],[f2]) ).

tff(f2,conjecture,
    ( setunionE
   => ! [X0,X1] :
        ( in(X1,setunion(X0))
       => ? [X4] :
            ( in(X1,X4)
            & in(X4,X0) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setunionE2) ).

tff(f57,plain,
    ( ~ in(sK2,setunion(sK1))
    | spl3_4 ),
    inference(avatar_component_clause,[],[f55]) ).

tff(f55,plain,
    ( spl3_4
  <=> in(sK2,setunion(sK1)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl3_4])]) ).

tff(f84,plain,
    ~ spl3_5,
    inference(avatar_contradiction_clause,[],[f83]) ).

tff(f83,plain,
    ( $false
    | ~ spl3_5 ),
    inference(equality_resolution,[],[f66]) ).

tff(f66,plain,
    ( ! [X0: $o] : ( $false != (X0) )
    | ~ spl3_5 ),
    inference(superposition,[],[f4,f60]) ).

tff(f60,plain,
    ( ! [X0: $o] : ( $true = (X0) )
    | ~ spl3_5 ),
    inference(avatar_component_clause,[],[f59]) ).

tff(f59,plain,
    ( spl3_5
  <=> ! [X0: $o] : ( $true = (X0) ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl3_5])]) ).

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

tff(f61,plain,
    ( ~ spl3_4
    | spl3_5
    | ~ spl3_2
    | ~ spl3_3 ),
    inference(avatar_split_clause,[],[f53,f33,f29,f59,f55]) ).

tff(f29,plain,
    ( spl3_2
  <=> ! [X2: $o,X0,X1] :
        ( ( $true = (X2) )
        | ~ in(X1,setunion(X0))
        | in(sK0(X0,X1,(X2)),X0) ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).

tff(f33,plain,
    ( spl3_3
  <=> ! [X2: $o,X0,X1] :
        ( ( $true = (X2) )
        | ~ in(X1,setunion(X0))
        | in(X1,sK0(X0,X1,(X2))) ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl3_3])]) ).

tff(f53,plain,
    ( ! [X0: $o] :
        ( ( $true = (X0) )
        | ~ in(sK2,setunion(sK1)) )
    | ~ spl3_2
    | ~ spl3_3 ),
    inference(duplicate_literal_removal,[],[f52]) ).

tff(f52,plain,
    ( ! [X0: $o] :
        ( ( $true = (X0) )
        | ~ in(sK2,setunion(sK1))
        | ~ in(sK2,setunion(sK1))
        | ( $true = (X0) ) )
    | ~ spl3_2
    | ~ spl3_3 ),
    inference(resolution,[],[f51,f30]) ).

tff(f30,plain,
    ( ! [X2: $o,X0: $i,X1: $i] :
        ( in(sK0(X0,X1,(X2)),X0)
        | ~ in(X1,setunion(X0))
        | ( $true = (X2) ) )
    | ~ spl3_2 ),
    inference(avatar_component_clause,[],[f29]) ).

tff(f51,plain,
    ( ! [X0: $i,X1: $o] :
        ( ~ in(sK0(X0,sK2,(X1)),sK1)
        | ( $true = (X1) )
        | ~ in(sK2,setunion(X0)) )
    | ~ spl3_3 ),
    inference(resolution,[],[f34,f22]) ).

tff(f22,plain,
    ! [X2: $i] :
      ( ~ in(sK2,X2)
      | ~ in(X2,sK1) ),
    inference(cnf_transformation,[],[f16]) ).

tff(f34,plain,
    ( ! [X2: $o,X0: $i,X1: $i] :
        ( in(X1,sK0(X0,X1,(X2)))
        | ~ in(X1,setunion(X0))
        | ( $true = (X2) ) )
    | ~ spl3_3 ),
    inference(avatar_component_clause,[],[f33]) ).

tff(f36,plain,
    spl3_1,
    inference(avatar_split_clause,[],[f20,f25]) ).

tff(f25,plain,
    ( spl3_1
  <=> setunionE ),
    introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).

tff(f20,plain,
    setunionE,
    inference(cnf_transformation,[],[f16]) ).

tff(f35,plain,
    ( ~ spl3_1
    | spl3_3 ),
    inference(avatar_split_clause,[],[f17,f33,f25]) ).

tff(f17,plain,
    ! [X2: $o,X0: $i,X1: $i] :
      ( ( $true = (X2) )
      | in(X1,sK0(X0,X1,(X2)))
      | ~ in(X1,setunion(X0))
      | ~ setunionE ),
    inference(cnf_transformation,[],[f14]) ).

tff(f14,plain,
    ( ! [X0,X1] :
        ( ! [X2: $o] :
            ( ( $true = (X2) )
            | ( ( $true != (X2) )
              & in(sK0(X0,X1,(X2)),X0)
              & in(X1,sK0(X0,X1,(X2))) ) )
        | ~ in(X1,setunion(X0)) )
    | ~ setunionE ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f11,f13]) ).

tff(f13,plain,
    ! [X0,X1,X2: $o] :
      ( ? [X3] :
          ( ( $true != (X2) )
          & in(X3,X0)
          & in(X1,X3) )
     => ( ( $true != (X2) )
        & in(sK0(X0,X1,(X2)),X0)
        & in(X1,sK0(X0,X1,(X2))) ) ),
    introduced(choice_axiom,[]) ).

tff(f11,plain,
    ( ! [X0,X1] :
        ( ! [X2: $o] :
            ( ( $true = (X2) )
            | ? [X3] :
                ( ( $true != (X2) )
                & in(X3,X0)
                & in(X1,X3) ) )
        | ~ in(X1,setunion(X0)) )
    | ~ setunionE ),
    inference(flattening,[],[f10]) ).

tff(f10,plain,
    ( ! [X0,X1] :
        ( ! [X2: $o] :
            ( ( $true = (X2) )
            | ? [X3] :
                ( ( $true != (X2) )
                & in(X3,X0)
                & in(X1,X3) ) )
        | ~ in(X1,setunion(X0)) )
    | ~ setunionE ),
    inference(ennf_transformation,[],[f9]) ).

tff(f9,plain,
    ( setunionE
   => ! [X0,X1] :
        ( in(X1,setunion(X0))
       => ! [X2: $o] :
            ( ! [X3] :
                ( in(X1,X3)
               => ( in(X3,X0)
                 => ( $true = (X2) ) ) )
           => ( $true = (X2) ) ) ) ),
    inference(unused_predicate_definition_removal,[],[f7]) ).

tff(f7,plain,
    ( setunionE
  <=> ! [X0,X1] :
        ( in(X1,setunion(X0))
       => ! [X2: $o] :
            ( ! [X3] :
                ( in(X1,X3)
               => ( in(X3,X0)
                 => ( $true = (X2) ) ) )
           => ( $true = (X2) ) ) ) ),
    inference(fool_elimination,[],[f6]) ).

tff(f6,plain,
    ( setunionE
    = ( ! [X0,X1] :
          ( in(X1,setunion(X0))
         => ! [X2: $o] :
              ( ! [X3] :
                  ( in(X1,X3)
                 => ( in(X3,X0)
                   => (X2) ) )
             => (X2) ) ) ) ),
    inference(rectify,[],[f1]) ).

tff(f1,axiom,
    ( setunionE
    = ( ! [X0,X1] :
          ( in(X1,setunion(X0))
         => ! [X2: $o] :
              ( ! [X3] :
                  ( in(X1,X3)
                 => ( in(X3,X0)
                   => (X2) ) )
             => (X2) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setunionE) ).

tff(f31,plain,
    ( ~ spl3_1
    | spl3_2 ),
    inference(avatar_split_clause,[],[f18,f29,f25]) ).

tff(f18,plain,
    ! [X2: $o,X0: $i,X1: $i] :
      ( ( $true = (X2) )
      | in(sK0(X0,X1,(X2)),X0)
      | ~ in(X1,setunion(X0))
      | ~ setunionE ),
    inference(cnf_transformation,[],[f14]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SEU633_8 : TPTP v8.2.0. Released v8.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.14/0.35  % Computer : n029.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   : Sun May 19 18:20:53 EDT 2024
% 0.14/0.36  % CPUTime    : 
% 0.14/0.36  This is a TX0_THM_EQU_NAR problem
% 0.14/0.36  Running 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 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.70/0.89  % (1074)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2994ds/78Mi)
% 0.70/0.89  % (1072)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2994ds/34Mi)
% 0.70/0.89  % (1075)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2994ds/33Mi)
% 0.70/0.89  % (1073)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on theBenchmark for (2994ds/51Mi)
% 0.70/0.89  % (1076)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on theBenchmark for (2994ds/34Mi)
% 0.70/0.89  % (1077)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2994ds/45Mi)
% 0.70/0.89  % (1078)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on theBenchmark for (2994ds/83Mi)
% 0.70/0.89  % (1079)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2994ds/56Mi)
% 0.70/0.89  % (1078)Refutation not found, incomplete strategy% (1078)------------------------------
% 0.70/0.89  % (1078)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.70/0.89  % (1076)Refutation not found, incomplete strategy% (1076)------------------------------
% 0.70/0.89  % (1076)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.70/0.89  % (1076)Termination reason: Refutation not found, incomplete strategy
% 0.70/0.89  
% 0.70/0.89  % (1076)Memory used [KB]: 956
% 0.70/0.89  % (1076)Time elapsed: 0.002 s
% 0.70/0.89  % (1075)Refutation not found, incomplete strategy% (1075)------------------------------
% 0.70/0.89  % (1075)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.70/0.89  % (1076)Instructions burned: 2 (million)
% 0.70/0.89  % (1075)Termination reason: Refutation not found, incomplete strategy
% 0.70/0.89  
% 0.70/0.89  % (1075)Memory used [KB]: 953
% 0.70/0.89  % (1075)Time elapsed: 0.003 s
% 0.70/0.89  % (1075)Instructions burned: 2 (million)
% 0.70/0.89  % (1078)Termination reason: Refutation not found, incomplete strategy
% 0.70/0.89  
% 0.70/0.89  % (1078)Memory used [KB]: 948
% 0.70/0.89  % (1078)Time elapsed: 0.002 s
% 0.70/0.89  % (1078)Instructions burned: 2 (million)
% 0.70/0.89  % (1072)Refutation not found, incomplete strategy% (1072)------------------------------
% 0.70/0.89  % (1072)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.70/0.89  % (1077)Refutation not found, incomplete strategy% (1077)------------------------------
% 0.70/0.89  % (1077)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.70/0.89  % (1077)Termination reason: Refutation not found, incomplete strategy
% 0.70/0.89  
% 0.70/0.89  % (1077)Memory used [KB]: 968
% 0.70/0.89  % (1077)Time elapsed: 0.003 s
% 0.70/0.89  % (1077)Instructions burned: 2 (million)
% 0.70/0.89  % (1072)Termination reason: Refutation not found, incomplete strategy
% 0.70/0.89  % (1075)------------------------------
% 0.70/0.89  % (1075)------------------------------
% 0.70/0.89  % (1076)------------------------------
% 0.70/0.89  % (1076)------------------------------
% 0.70/0.89  
% 0.70/0.89  % (1072)Memory used [KB]: 972
% 0.70/0.89  % (1072)Time elapsed: 0.003 s
% 0.70/0.89  % (1072)Instructions burned: 3 (million)
% 0.70/0.89  % (1078)------------------------------
% 0.70/0.89  % (1078)------------------------------
% 0.70/0.89  % (1077)------------------------------
% 0.70/0.89  % (1077)------------------------------
% 0.70/0.89  % (1072)------------------------------
% 0.70/0.89  % (1072)------------------------------
% 0.70/0.89  % (1079)Refutation not found, incomplete strategy% (1079)------------------------------
% 0.70/0.89  % (1079)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.70/0.89  % (1079)Termination reason: Refutation not found, incomplete strategy
% 0.70/0.89  
% 0.70/0.89  % (1079)Memory used [KB]: 953
% 0.70/0.89  % (1079)Time elapsed: 0.002 s
% 0.70/0.89  % (1079)Instructions burned: 2 (million)
% 0.70/0.89  % (1074)Also succeeded, but the first one will report.
% 0.70/0.89  % (1073)First to succeed.
% 0.70/0.89  % (1079)------------------------------
% 0.70/0.89  % (1079)------------------------------
% 0.70/0.89  % (1073)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1003"
% 0.70/0.89  % (1073)Refutation found. Thanks to Tanya!
% 0.70/0.89  % SZS status Theorem for theBenchmark
% 0.70/0.89  % SZS output start Proof for theBenchmark
% See solution above
% 0.70/0.89  % (1073)------------------------------
% 0.70/0.89  % (1073)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.70/0.89  % (1073)Termination reason: Refutation
% 0.70/0.89  
% 0.70/0.89  % (1073)Memory used [KB]: 998
% 0.70/0.89  % (1073)Time elapsed: 0.005 s
% 0.70/0.89  % (1073)Instructions burned: 4 (million)
% 0.70/0.89  % (1003)Success in time 0.528 s
% 0.70/0.89  % Vampire---4.8 exiting
%------------------------------------------------------------------------------