↑ Up

Vampire-SAT---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : SET201^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% Computer : n017.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed Sep 30 08:23:37 AM UTC 2026

% Result   : Theorem 0.24s 0.34s
% Output   : Refutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   31 (   9 unt;   0 typ;   2 def)
%            Number of atoms       :  176 (  58 equ;   0 cnn)
%            Maximal formula atoms :    8 (   5 avg)
%            Number of connectives :  184 (  33   ~;  25   |;  28   &;  80   @)
%                                         (   2 <=>;  16  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :   21 (  21   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   11 (   8 usr;   5 con; 0-2 aty)
%            Number of variables   :   46 (   0 sgn  34   !;  12   ?;  46   :)

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

thf(type_def_6,type,
    sTfun: ( $tType * $tType ) > $tType ).

thf(func_def_0,type,
    cV: a > $o ).

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

thf(func_def_5,type,
    sK1: a > $o ).

thf(func_def_6,type,
    sK2: a > $o ).

thf(func_def_7,type,
    sK3: a ).

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

thf(f2,negated_conjecture,
    ~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
        ( ( ! [X3: a] :
              ( ( X2 @ X3 )
             => ( cV @ X3 ) )
          & ! [X3: a] :
              ( ( X0 @ X3 )
             => ( X1 @ X3 ) ) )
       => ! [X3: a] :
            ( ( ( X2 @ X3 )
              & ( X0 @ X3 ) )
           => ( ( cV @ X3 )
              & ( X1 @ X3 ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

thf(f3,plain,
    ~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
        ( ( ! [X3: a] :
              ( ( X2 @ X3 )
             => ( cV @ X3 ) )
          & ! [X4: a] :
              ( ( X0 @ X4 )
             => ( X1 @ X4 ) ) )
       => ! [X5: a] :
            ( ( ( X2 @ X5 )
              & ( X0 @ X5 ) )
           => ( ( cV @ X5 )
              & ( X1 @ X5 ) ) ) ),
    inference(rectify,[],[f2]) ).

thf(f4,plain,
    ~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
        ( ( ! [X3: a] :
              ( ( ( X2 @ X3 )
                = $true )
             => ( ( cV @ X3 )
                = $true ) )
          & ! [X4: a] :
              ( ( ( X0 @ X4 )
                = $true )
             => ( ( X1 @ X4 )
                = $true ) ) )
       => ! [X5: a] :
            ( ( ( ( X2 @ X5 )
                = $true )
              & ( ( X0 @ X5 )
                = $true ) )
           => ( ( ( cV @ X5 )
                = $true )
              & ( ( X1 @ X5 )
                = $true ) ) ) ),
    inference(fool_elimination,[],[f3]) ).

thf(f5,plain,
    ? [X0: a > $o,X1: a > $o,X2: a > $o] :
      ( ? [X5: a] :
          ( ( ( ( cV @ X5 )
             != $true )
            | ( ( X1 @ X5 )
             != $true ) )
          & ( ( X2 @ X5 )
            = $true )
          & ( ( X0 @ X5 )
            = $true ) )
      & ! [X3: a] :
          ( ( ( cV @ X3 )
            = $true )
          | ( ( X2 @ X3 )
           != $true ) )
      & ! [X4: a] :
          ( ( ( X1 @ X4 )
            = $true )
          | ( ( X0 @ X4 )
           != $true ) ) ),
    inference(ennf_transformation,[],[f4]) ).

thf(f6,plain,
    ? [X0: a > $o,X1: a > $o,X2: a > $o] :
      ( ? [X5: a] :
          ( ( ( ( cV @ X5 )
             != $true )
            | ( ( X1 @ X5 )
             != $true ) )
          & ( ( X2 @ X5 )
            = $true )
          & ( ( X0 @ X5 )
            = $true ) )
      & ! [X3: a] :
          ( ( ( cV @ X3 )
            = $true )
          | ( ( X2 @ X3 )
           != $true ) )
      & ! [X4: a] :
          ( ( ( X1 @ X4 )
            = $true )
          | ( ( X0 @ X4 )
           != $true ) ) ),
    inference(flattening,[],[f5]) ).

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

thf(f8,plain,
    ( ( ( $true
       != ( cV @ sK3 ) )
      | ( $true
       != ( sK1 @ sK3 ) ) )
    & ( $true
      = ( sK2 @ sK3 ) )
    & ( $true
      = ( sK0 @ sK3 ) )
    & ! [X4: a] :
        ( ( $true
          = ( cV @ X4 ) )
        | ( $true
         != ( sK2 @ X4 ) ) )
    & ! [X5: a] :
        ( ( $true
          = ( sK1 @ X5 ) )
        | ( $true
         != ( sK0 @ X5 ) ) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f7]) ).

thf(f9,plain,
    ! [X5: a] :
      ( ( $true
        = ( sK1 @ X5 ) )
      | ( $true
       != ( sK0 @ X5 ) ) ),
    inference(cnf_transformation,[],[f8]) ).

thf(f10,plain,
    ! [X4: a] :
      ( ( $true
       != ( sK2 @ X4 ) )
      | ( $true
        = ( cV @ X4 ) ) ),
    inference(cnf_transformation,[],[f8]) ).

thf(f11,plain,
    ( $true
    = ( sK0 @ sK3 ) ),
    inference(cnf_transformation,[],[f8]) ).

thf(f12,plain,
    ( $true
    = ( sK2 @ sK3 ) ),
    inference(cnf_transformation,[],[f8]) ).

thf(f13,plain,
    ( ( $true
     != ( cV @ sK3 ) )
    | ( $true
     != ( sK1 @ sK3 ) ) ),
    inference(cnf_transformation,[],[f8]) ).

thf(f17,definition,
    ( spl4_1
  <=> ( $true
      = ( sK1 @ sK3 ) ) ),
    introduced(definition,[new_symbols(definition,[spl4_1])],[avatar_definition]) ).

thf(f19,plain,
    ( ( $true
     != ( sK1 @ sK3 ) )
    | spl4_1 ),
    inference(avatar_component_clause,[],[f17]) ).

thf(f21,definition,
    ( spl4_2
  <=> ( $true
      = ( cV @ sK3 ) ) ),
    introduced(definition,[new_symbols(definition,[spl4_2])],[avatar_definition]) ).

thf(f23,plain,
    ( ( $true
     != ( cV @ sK3 ) )
    | spl4_2 ),
    inference(avatar_component_clause,[],[f21]) ).

thf(f24,plain,
    ( ~ spl4_1
    | ~ spl4_2 ),
    inference(avatar_split_clause,[],[f13,f21,f17]) ).

thf(f25,plain,
    ( ( $true != $true )
    | ( $true
     != ( sK0 @ sK3 ) )
    | spl4_1 ),
    inference(constrained_superposition,[],[f19,f9]) ).

thf(f26,plain,
    ( ( $true
     != ( sK0 @ sK3 ) )
    | spl4_1 ),
    inference(trivial_inequality_removal,[],[f25]) ).

thf(f27,plain,
    ( $false
    | spl4_1 ),
    inference(forward_subsumption_resolution,[],[f26,f11]) ).

thf(f28,plain,
    spl4_1,
    inference(avatar_contradiction_clause,[],[f27]) ).

thf(f29,plain,
    ( ( $true != $true )
    | ( $true
      = ( cV @ sK3 ) ) ),
    inference(constrained_superposition,[],[f10,f12]) ).

thf(f30,plain,
    ( $true
    = ( cV @ sK3 ) ),
    inference(trivial_inequality_removal,[],[f29]) ).

thf(f31,plain,
    ( $false
    | spl4_2 ),
    inference(forward_subsumption_resolution,[],[f30,f23]) ).

thf(f32,plain,
    spl4_2,
    inference(avatar_contradiction_clause,[],[f31]) ).

cnf(s1,plain,
    ( ~ spl4_1
    | ~ spl4_2 ),
    inference(sat_conversion,[],[f24]) ).

cnf(s2,plain,
    spl4_1,
    inference(sat_conversion,[],[f28]) ).

cnf(s3,plain,
    spl4_2,
    inference(sat_conversion,[],[f32]) ).

cnf(s4,plain,
    $false,
    inference(rat,[],[s1,s3,s2]) ).

thf(f33,plain,
    $false,
    inference(avatar_sat_refutation,[],[s4]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : SET201^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.25  % Computer : n017.cluster.edu
% 0.13/0.25  % Model    : x86_64 x86_64
% 0.13/0.25  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.25  % Memory   : 8046.5625MB
% 0.13/0.25  % OS       : Linux 6.8.0-71-generic
% 0.13/0.25  % CPULimit : 300
% 0.13/0.25  % WCLimit  : 300
% 0.13/0.25  % DateTime : Tue Sep 29 13:33:07 UTC 2026
% 0.13/0.26  % CPUTime  : 
% 0.13/0.26  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.24/0.31  Running first-order model finding
% 0.24/0.31  Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.24/0.34  % (339156)Will run a generic schedule for satisfiability detection.
% 0.24/0.34  % (339165)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3902193415:i=116_3000 on theBenchmark for (3000ds/116Mi)
% 0.24/0.34  % (339165)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.24/0.34  % (339165) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-339156-339165"...
% 0.24/0.34  % (339165)...printing done.
% 0.24/0.34  % (339165)Refutation found. Thanks to Tanya!
% 0.24/0.34  % SZS status Theorem for theBenchmark
% 0.24/0.34  % SZS output start Proof for theBenchmark
% See solution above
% 0.24/0.34  % (339165)------------------------------
% 0.24/0.34  % (339165)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.24/0.34  % (339165)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.24/0.34  % (339165)CaDiCaL version: 2.1.3
% 0.24/0.34  % (339165)Termination reason: Refutation
% 0.24/0.34  % (339165)Time elapsed: 0.003 s
% 0.24/0.34  % (339165)Peak memory usage: 12 MB
% 0.24/0.34  % (339165)Instructions burned: 2 (million)
% 0.24/0.34  % (339156)Success in time 0.025 s
% 0.24/0.34  % Vampire exiting
%------------------------------------------------------------------------------