↑ 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  : SEV135^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 : n026.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:39:02 AM UTC 2026

% Result   : Theorem 0.10s 0.23s
% Output   : Refutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   13 (   4 unt;   0 typ;   0 def)
%            Number of atoms       :   85 (  35 equ;   0 cnn)
%            Maximal formula atoms :    7 (   6 avg)
%            Number of connectives :  140 (  18   ~;  11   |;  17   &;  78   @)
%                                         (   0 <=>;  16  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   8 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :   18 (  18   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    8 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   46 (   0   ^;  38   !;   8   ?;  46   :)

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

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

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

thf(func_def_4,type,
    sK1: a ).

thf(func_def_5,type,
    sK2: a ).

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

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

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

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

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

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

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

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

thf(f8,plain,
    ( $true
    = ( sK0 @ sK1 @ sK2 ) ),
    inference(cnf_transformation,[],[f7]) ).

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

thf(f11,plain,
    ( $true
   != ( sK3 @ sK2 ) ),
    inference(cnf_transformation,[],[f7]) ).

thf(f14,plain,
    ( ( $true != $true )
    | ( $true
      = ( sK3 @ sK2 ) ) ),
    inference(constrained_superposition,[],[f9,f8]) ).

thf(f15,plain,
    ( $true
    = ( sK3 @ sK2 ) ),
    inference(trivial_inequality_removal,[],[f14]) ).

thf(f16,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f15,f11]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SEV135^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.16  % Computer : n026.cluster.edu
% 0.10/0.16  % Model    : x86_64 x86_64
% 0.10/0.16  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.16  % Memory   : 8046.5625MB
% 0.10/0.16  % OS       : Linux 6.8.0-71-generic
% 0.10/0.16  % CPULimit : 300
% 0.10/0.16  % WCLimit  : 300
% 0.10/0.16  % DateTime : Tue Sep 29 15:18:42 UTC 2026
% 0.10/0.17  % CPUTime  : 
% 0.10/0.17  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.19  Running first-order model finding
% 0.10/0.19  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.10/0.23  % (721974)Will run a generic schedule for satisfiability detection.
% 0.10/0.23  % (721982)dis+10_1_sil=32000:sp=arity:random_seed=3707969357:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.10/0.23  % (721982) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-721974-721982"...
% 0.10/0.23  % (721982)...printing done.
% 0.10/0.23  % (721982)Refutation found. Thanks to Tanya!
% 0.10/0.23  % SZS status Theorem for theBenchmark
% 0.10/0.23  % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.23  % (721982)------------------------------
% 0.10/0.23  % (721982)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.23  % (721982)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.23  % (721982)CaDiCaL version: 2.1.3
% 0.10/0.23  % (721982)Termination reason: Refutation
% 0.10/0.23  % (721982)Time elapsed: 0.001 s
% 0.10/0.23  % (721982)Peak memory usage: 12 MB
% 0.10/0.23  % (721982)Instructions burned: 1 (million)
% 0.10/0.23  % (721974)Success in time 0.025 s
% 0.10/0.23  % Vampire exiting
%------------------------------------------------------------------------------