↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Computer : n018.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:41:39 AM UTC 2026

% Result   : Theorem 0.21s 0.28s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   22 (   7 unt;   0 typ;   0 def)
%            Number of atoms       :  299 (  82 equ;   0 cnn)
%            Maximal formula atoms :   12 (  13 avg)
%            Number of connectives :  252 (  40   ~;  29   |;  44   &; 115   @)
%                                         (   0 <=>;  24  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   13 (  10 usr;   5 con; 0-2 aty)
%            Number of variables   :   62 (   0   ^;  45   !;  17   ?;  62   :)

% Comments : 
%------------------------------------------------------------------------------
thf(type_def_5,type,
    sTfun: ( $tType * $tType ) > $tType ).

thf(func_def_0,type,
    cG: $i > $o ).

thf(func_def_1,type,
    cF: $i > $o ).

thf(func_def_2,type,
    cP: $i > $o ).

thf(func_def_3,type,
    cS: $i > $o ).

thf(func_def_4,type,
    cQ: $i > $o ).

thf(func_def_5,type,
    cR: $i > $o ).

thf(f1,conjecture,
    ( ( ( ? [X0: $i] : ( cS @ X0 )
       => ! [X0: $i] :
            ( ( cF @ X0 )
           => ( cG @ X0 ) ) )
      & ! [X0: $i] :
          ( ( cP @ X0 )
         => ! [X1: $i] : ( cQ @ X1 ) )
      & ( ! [X0: $i] :
            ( ( cR @ X0 )
            | ( cQ @ X0 ) )
       => ? [X0: $i] :
            ( ( cQ @ X0 )
            & ( cS @ X0 ) ) ) )
   => ! [X0: $i] :
        ( ( ( cP @ X0 )
          & ( cF @ X0 ) )
       => ( cG @ X0 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cPELL28) ).

thf(f2,negated_conjecture,
    ~ ( ( ( ? [X0: $i] : ( cS @ X0 )
         => ! [X0: $i] :
              ( ( cF @ X0 )
             => ( cG @ X0 ) ) )
        & ! [X0: $i] :
            ( ( cP @ X0 )
           => ! [X1: $i] : ( cQ @ X1 ) )
        & ( ! [X0: $i] :
              ( ( cR @ X0 )
              | ( cQ @ X0 ) )
         => ? [X0: $i] :
              ( ( cQ @ X0 )
              & ( cS @ X0 ) ) ) )
     => ! [X0: $i] :
          ( ( ( cP @ X0 )
            & ( cF @ X0 ) )
         => ( cG @ X0 ) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

thf(f3,plain,
    ~ ( ( ( ? [X0: $i] : ( cS @ X0 )
         => ! [X1: $i] :
              ( ( cF @ X1 )
             => ( cG @ X1 ) ) )
        & ! [X2: $i] :
            ( ( cP @ X2 )
           => ! [X3: $i] : ( cQ @ X3 ) )
        & ( ! [X4: $i] :
              ( ( cR @ X4 )
              | ( cQ @ X4 ) )
         => ? [X5: $i] :
              ( ( cQ @ X5 )
              & ( cS @ X5 ) ) ) )
     => ! [X6: $i] :
          ( ( ( cP @ X6 )
            & ( cF @ X6 ) )
         => ( cG @ X6 ) ) ),
    inference(rectify,[],[f2]) ).

thf(f4,plain,
    ~ ( ( ! [X2: $i] :
            ( ( ( cP @ X2 )
              = $true )
           => ! [X3: $i] :
                ( ( cQ @ X3 )
                = $true ) )
        & ( ! [X4: $i] :
              ( ( ( cR @ X4 )
                = $true )
              | ( $true
                = ( cQ @ X4 ) ) )
         => ? [X5: $i] :
              ( ( ( cS @ X5 )
                = $true )
              & ( $true
                = ( cQ @ X5 ) ) ) )
        & ( ? [X0: $i] :
              ( ( cS @ X0 )
              = $true )
         => ! [X1: $i] :
              ( ( $true
                = ( cF @ X1 ) )
             => ( $true
                = ( cG @ X1 ) ) ) ) )
     => ! [X6: $i] :
          ( ( ( $true
              = ( cF @ X6 ) )
            & ( $true
              = ( cP @ X6 ) ) )
         => ( ( cG @ X6 )
            = $true ) ) ),
    inference(fool_elimination,[],[f3]) ).

thf(f5,plain,
    ( ? [X6: $i] :
        ( ( ( cG @ X6 )
         != $true )
        & ( $true
          = ( cF @ X6 ) )
        & ( $true
          = ( cP @ X6 ) ) )
    & ! [X2: $i] :
        ( ( ( cP @ X2 )
         != $true )
        | ! [X3: $i] :
            ( ( cQ @ X3 )
            = $true ) )
    & ( ? [X5: $i] :
          ( ( ( cS @ X5 )
            = $true )
          & ( $true
            = ( cQ @ X5 ) ) )
      | ? [X4: $i] :
          ( ( ( cR @ X4 )
           != $true )
          & ( $true
           != ( cQ @ X4 ) ) ) )
    & ( ! [X0: $i] :
          ( ( cS @ X0 )
         != $true )
      | ! [X1: $i] :
          ( ( $true
            = ( cG @ X1 ) )
          | ( $true
           != ( cF @ X1 ) ) ) ) ),
    inference(ennf_transformation,[],[f4]) ).

thf(f6,plain,
    ( ! [X2: $i] :
        ( ( ( cP @ X2 )
         != $true )
        | ! [X3: $i] :
            ( ( cQ @ X3 )
            = $true ) )
    & ( ? [X5: $i] :
          ( ( ( cS @ X5 )
            = $true )
          & ( $true
            = ( cQ @ X5 ) ) )
      | ? [X4: $i] :
          ( ( ( cR @ X4 )
           != $true )
          & ( $true
           != ( cQ @ X4 ) ) ) )
    & ( ! [X0: $i] :
          ( ( cS @ X0 )
         != $true )
      | ! [X1: $i] :
          ( ( $true
            = ( cG @ X1 ) )
          | ( $true
           != ( cF @ X1 ) ) ) )
    & ? [X6: $i] :
        ( ( $true
          = ( cP @ X6 ) )
        & ( ( cG @ X6 )
         != $true )
        & ( $true
          = ( cF @ X6 ) ) ) ),
    inference(flattening,[],[f5]) ).

thf(f7,plain,
    ( ! [X0: $i] :
        ( ( ( cP @ X0 )
         != $true )
        | ! [X1: $i] :
            ( ( cQ @ X1 )
            = $true ) )
    & ( ? [X2: $i] :
          ( ( $true
            = ( cS @ X2 ) )
          & ( $true
            = ( cQ @ X2 ) ) )
      | ? [X3: $i] :
          ( ( $true
           != ( cR @ X3 ) )
          & ( ( cQ @ X3 )
           != $true ) ) )
    & ( ! [X4: $i] :
          ( $true
         != ( cS @ X4 ) )
      | ! [X5: $i] :
          ( ( $true
            = ( cG @ X5 ) )
          | ( $true
           != ( cF @ X5 ) ) ) )
    & ? [X6: $i] :
        ( ( $true
          = ( cP @ X6 ) )
        & ( ( cG @ X6 )
         != $true )
        & ( $true
          = ( cF @ X6 ) ) ) ),
    inference(rectify,[],[f6]) ).

thf(f8,plain,
    ( ! [X0: $i] :
        ( ( ( cP @ X0 )
         != $true )
        | ! [X1: $i] :
            ( ( cQ @ X1 )
            = $true ) )
    & ( ( ( $true
          = ( cS @ sK0 ) )
        & ( $true
          = ( cQ @ sK0 ) ) )
      | ( ( ( cR @ sK1 )
         != $true )
        & ( $true
         != ( cQ @ sK1 ) ) ) )
    & ( ! [X4: $i] :
          ( $true
         != ( cS @ X4 ) )
      | ! [X5: $i] :
          ( ( $true
            = ( cG @ X5 ) )
          | ( $true
           != ( cF @ X5 ) ) ) )
    & ( $true
      = ( cP @ sK2 ) )
    & ( ( cG @ sK2 )
     != $true )
    & ( ( cF @ sK2 )
      = $true ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X2,sK0),skolemize(X3,sK1),skolemize(X6,sK2)],[f7]) ).

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

thf(f10,plain,
    ( ( cG @ sK2 )
   != $true ),
    inference(cnf_transformation,[],[f8]) ).

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

thf(f12,plain,
    ! [X4: $i,X5: $i] :
      ( ( $true
       != ( cF @ X5 ) )
      | ( $true
        = ( cG @ X5 ) )
      | ( $true
       != ( cS @ X4 ) ) ),
    inference(cnf_transformation,[],[f8]) ).

thf(f15,plain,
    ( ( $true
      = ( cS @ sK0 ) )
    | ( $true
     != ( cQ @ sK1 ) ) ),
    inference(cnf_transformation,[],[f8]) ).

thf(f17,plain,
    ! [X0: $i,X1: $i] :
      ( ( ( cP @ X0 )
       != $true )
      | ( ( cQ @ X1 )
        = $true ) ),
    inference(cnf_transformation,[],[f8]) ).

thf(f19,plain,
    ! [X0: $i] :
      ( ( $true != $true )
      | ( ( cQ @ X0 )
        = $true ) ),
    inference(superposition,[],[f17,f11]) ).

thf(f20,plain,
    ! [X0: $i] :
      ( ( cQ @ X0 )
      = $true ),
    inference(trivial_inequality_removal,[],[f19]) ).

thf(f21,plain,
    ! [X0: $i] :
      ( ( $true != $true )
      | ( ( cS @ X0 )
       != $true )
      | ( ( cG @ sK2 )
        = $true ) ),
    inference(superposition,[],[f12,f9]) ).

thf(f22,plain,
    ! [X0: $i] :
      ( ( ( cG @ sK2 )
        = $true )
      | ( ( cS @ X0 )
       != $true ) ),
    inference(trivial_inequality_removal,[],[f21]) ).

thf(f23,plain,
    ! [X0: $i] :
      ( ( cS @ X0 )
     != $true ),
    inference(forward_subsumption_resolution,[],[f22,f10]) ).

thf(f24,plain,
    ( ( $true != $true )
    | ( $true
     != ( cQ @ sK1 ) ) ),
    inference(superposition,[],[f23,f15]) ).

thf(f25,plain,
    ( $true
   != ( cQ @ sK1 ) ),
    inference(trivial_inequality_removal,[],[f24]) ).

thf(f26,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f25,f20]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN058^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.18  % Computer : n018.cluster.edu
% 0.08/0.18  % Model    : x86_64 x86_64
% 0.08/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18  % Memory   : 8046.5625MB
% 0.08/0.18  % OS       : Linux 6.8.0-71-generic
% 0.08/0.18  % CPULimit : 300
% 0.08/0.18  % WCLimit  : 300
% 0.08/0.18  % DateTime : Tue Sep 29 16:16:56 UTC 2026
% 0.08/0.19  % CPUTime  : 
% 0.08/0.19  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.22  Running higher-order theorem proving
% 0.08/0.23  Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.28  % (281431)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.21/0.28  % (281450)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=2211756615:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.21/0.28  % (281450) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-281431-281450"...
% 0.21/0.28  % (281450)...printing done.
% 0.21/0.28  % (281450)Refutation found. Thanks to Tanya!
% 0.21/0.28  % SZS status Theorem for theBenchmark
% 0.21/0.28  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.28  % (281450)------------------------------
% 0.21/0.28  % (281450)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.28  % (281450)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.28  % (281450)CaDiCaL version: 2.1.3
% 0.21/0.28  % (281450)Termination reason: Refutation
% 0.21/0.28  % (281450)Time elapsed: 0.001 s
% 0.21/0.28  % (281450)Peak memory usage: 12 MB
% 0.21/0.28  % (281450)Instructions burned: 3 (million)
% 0.21/0.28  % (281431)Success in time 0.039 s
% 0.21/0.28  % Vampire exiting
%------------------------------------------------------------------------------