↑ 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  : SEV230^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT

% Computer : n013.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:11 AM UTC 2026

% Result   : Theorem 0.11s 0.28s
% Output   : Refutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   19 (   6 unt;   0 typ;   0 def)
%            Number of atoms       :  130 (  51 equ;   0 cnn)
%            Maximal formula atoms :    8 (   6 avg)
%            Number of connectives :  153 (  24   ~;  17   |;  12   &;  72   @)
%                                         (   0 <=>;  28  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   6 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :   38 (  38   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   10 (   7 usr;   3 con; 0-2 aty)
%            Number of variables   :   56 (   0   ^;  46   !;  10   ?;  56   :)

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

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

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

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

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

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

thf(func_def_7,type,
    sK4: a ).

thf(func_def_8,type,
    vNOT: $o > $o ).

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

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

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

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

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

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

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

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

thf(f9,plain,
    ! [X6: a,X5: a > $o] :
      ( ( $true
       != ( sK2 @ X5 ) )
      | ( $true
       != ( X5 @ X6 ) )
      | ( $true
        = ( sK0 @ X6 ) ) ),
    inference(cnf_transformation,[],[f7]) ).

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

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

thf(f12,plain,
    ( $true
   != ( sK1 @ sK4 ) ),
    inference(cnf_transformation,[],[f7]) ).

thf(f15,plain,
    ! [X0: a] :
      ( ( $true != $true )
      | ( $true
       != ( sK3 @ X0 ) )
      | ( $true
        = ( sK0 @ X0 ) ) ),
    inference(constrained_superposition,[],[f9,f10]) ).

thf(f16,plain,
    ! [X0: a] :
      ( ( $true
       != ( sK3 @ X0 ) )
      | ( $true
        = ( sK0 @ X0 ) ) ),
    inference(trivial_inequality_removal,[],[f15]) ).

thf(f33,plain,
    ( ( $true != $true )
    | ( $true
      = ( sK0 @ sK4 ) ) ),
    inference(constrained_superposition,[],[f16,f11]) ).

thf(f36,plain,
    ( $true
    = ( sK0 @ sK4 ) ),
    inference(trivial_inequality_removal,[],[f33]) ).

thf(f37,plain,
    ( ( $true != $true )
    | ( $true
      = ( sK1 @ sK4 ) ) ),
    inference(constrained_superposition,[],[f8,f36]) ).

thf(f38,plain,
    ( $true
    = ( sK1 @ sK4 ) ),
    inference(trivial_inequality_removal,[],[f37]) ).

thf(f39,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f38,f12]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEV230^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.19  % Computer : n013.cluster.edu
% 0.11/0.19  % Model    : x86_64 x86_64
% 0.11/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.19  % Memory   : 8046.5625MB
% 0.11/0.19  % OS       : Linux 6.8.0-71-generic
% 0.11/0.19  % CPULimit : 300
% 0.11/0.19  % WCLimit  : 300
% 0.11/0.19  % DateTime : Tue Sep 29 15:22:36 UTC 2026
% 0.11/0.20  % CPUTime  : 
% 0.11/0.20  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.23  Running first-order model finding
% 0.11/0.23  Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.28  % (2245617)Will run a generic schedule for satisfiability detection.
% 0.11/0.28  % (2245627)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2348833728_2999 on theBenchmark for (2999ds/0Mi)
% 0.11/0.28  % Exception at run slice level
% 0.11/0.28  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.11/0.28  % (2245628)% WARNING: option uhcvi not known.
% 0.11/0.28  % (2245628)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3513238980:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.11/0.28  % (2245629)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2182784534:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.11/0.28  % (2245631)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1890523401:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.11/0.28  % (2245628)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.11/0.28  % (2245631)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.11/0.28  % (2245628)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.11/0.28  % (2245628) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2245617-2245628"...
% 0.11/0.28  % (2245635)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=502076348:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.11/0.28  % Exception at run slice level
% 0.11/0.28  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.11/0.28  % (2245631) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2245617-2245631"...
% 0.11/0.28  % (2245629) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2245617-2245629"...
% 0.11/0.28  % (2245628)...printing done.
% 0.11/0.28  % (2245631)...printing done.
% 0.11/0.28  % (2245628)Refutation found. Thanks to Tanya!
% 0.11/0.28  % SZS status Theorem for theBenchmark
% 0.11/0.28  % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.29  % (2245628)------------------------------
% 0.11/0.29  % (2245628)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.29  % (2245628)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.29  % (2245628)CaDiCaL version: 2.1.3
% 0.11/0.29  % (2245628)Termination reason: Refutation
% 0.11/0.29  % (2245628)Time elapsed: 0.003 s
% 0.11/0.29  % (2245628)Peak memory usage: 12 MB
% 0.11/0.29  % (2245628)Instructions burned: 3 (million)
% 0.11/0.29  % (2245617)Success in time 0.045 s
% 0.11/0.29  % Vampire exiting
%------------------------------------------------------------------------------