↑ 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  : SYO099^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 : n014.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:48:57 AM UTC 2026

% Result   : Theorem 0.09s 0.24s
% Output   : Refutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   39 (  10 unt;   0 typ;   4 def)
%            Number of atoms       :  190 (  41 equ;   0 cnn)
%            Maximal formula atoms :    6 (   4 avg)
%            Number of connectives :  177 (  62   ~;  49   |;   6   &;  56   @)
%                                         (   4 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   14 (  11 usr;   9 con; 0-2 aty)
%            Number of variables   :   46 (   0 sgn  33   !;  13   ?;  46   :)

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

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

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

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

thf(f1,conjecture,
    ( ~ ( ~ ! [X5: $i] : ( cG @ X5 )
        | ! [X4: $i] :
            ~ ( cN @ X4 ) )
    | ~ ( ? [X3: $i] : ( cN @ X3 )
        | ! [X2: $i] : ( cM @ X2 ) )
    | ? [X1: $i] :
        ~ ( cG @ X1 )
    | ! [X0: $i] : ( cM @ X0 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM78) ).

thf(f2,negated_conjecture,
    ~ ( ~ ( ~ ! [X5: $i] : ( cG @ X5 )
          | ! [X4: $i] :
              ~ ( cN @ X4 ) )
      | ~ ( ? [X3: $i] : ( cN @ X3 )
          | ! [X2: $i] : ( cM @ X2 ) )
      | ? [X1: $i] :
          ~ ( cG @ X1 )
      | ! [X0: $i] : ( cM @ X0 ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

thf(f3,plain,
    ~ ( ~ ( ~ ! [X0: $i] : ( cG @ X0 )
          | ! [X1: $i] :
              ~ ( cN @ X1 ) )
      | ~ ( ? [X2: $i] : ( cN @ X2 )
          | ! [X3: $i] : ( cM @ X3 ) )
      | ? [X4: $i] :
          ~ ( cG @ X4 )
      | ! [X5: $i] : ( cM @ X5 ) ),
    inference(rectify,[],[f2]) ).

thf(f4,plain,
    ~ ( ~ ( ~ ! [X0: $i] :
                ( ( cG @ X0 )
                = $true )
          | ! [X1: $i] :
              ( ( cN @ X1 )
             != $true ) )
      | ~ ( ? [X2: $i] :
              ( ( cN @ X2 )
              = $true )
          | ! [X3: $i] :
              ( ( cM @ X3 )
              = $true ) )
      | ? [X4: $i] :
          ( ( cG @ X4 )
         != $true )
      | ! [X5: $i] :
          ( ( cM @ X5 )
          = $true ) ),
    inference(fool_elimination,[],[f3]) ).

thf(f5,plain,
    ~ ( ~ ( ~ ! [X0: $i] :
                ( ( cG @ X0 )
                = $true )
          | ! [X1: $i] :
              ( ( cN @ X1 )
             != $true ) )
      | ~ ( ? [X2: $i] :
              ( ( cN @ X2 )
              = $true )
          | ! [X3: $i] :
              ( ( cM @ X3 )
              = $true ) )
      | ? [X4: $i] :
          ( ( cG @ X4 )
         != $true )
      | ! [X5: $i] :
          ( ( cM @ X5 )
          = $true ) ),
    inference(flattening,[],[f4]) ).

thf(f6,plain,
    ( ( ? [X0: $i] :
          ( ( cG @ X0 )
         != $true )
      | ! [X1: $i] :
          ( ( cN @ X1 )
         != $true ) )
    & ( ? [X2: $i] :
          ( ( cN @ X2 )
          = $true )
      | ! [X3: $i] :
          ( ( cM @ X3 )
          = $true ) )
    & ! [X4: $i] :
        ( ( cG @ X4 )
        = $true )
    & ? [X5: $i] :
        ( ( cM @ X5 )
       != $true ) ),
    inference(ennf_transformation,[],[f5]) ).

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

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

thf(f9,plain,
    ! [X4: $i] :
      ( ( cG @ X4 )
      = $true ),
    inference(cnf_transformation,[],[f7]) ).

thf(f10,plain,
    ! [X3: $i] :
      ( ( $true
        = ( cN @ sK1 ) )
      | ( ( cM @ X3 )
        = $true ) ),
    inference(cnf_transformation,[],[f7]) ).

thf(f11,plain,
    ! [X1: $i] :
      ( ( $true
       != ( cG @ sK0 ) )
      | ( ( cN @ X1 )
       != $true ) ),
    inference(cnf_transformation,[],[f7]) ).

thf(f15,definition,
    ( spl3_1
  <=> ! [X3: $i] :
        ( ( cM @ X3 )
        = $true ) ),
    introduced(definition,[new_symbols(definition,[spl3_1])],[avatar_definition]) ).

thf(f16,plain,
    ( ! [X3: $i] :
        ( ( cM @ X3 )
        = $true )
    | ~ spl3_1 ),
    inference(avatar_component_clause,[],[f15]) ).

thf(f18,definition,
    ( spl3_2
  <=> ( $true
      = ( cN @ sK1 ) ) ),
    introduced(definition,[new_symbols(definition,[spl3_2])],[avatar_definition]) ).

thf(f20,plain,
    ( ( $true
      = ( cN @ sK1 ) )
    | ~ spl3_2 ),
    inference(avatar_component_clause,[],[f18]) ).

thf(f21,plain,
    ( spl3_1
    | spl3_2 ),
    inference(avatar_split_clause,[],[f10,f18,f15]) ).

thf(f23,definition,
    ( spl3_3
  <=> ! [X1: $i] :
        ( ( cN @ X1 )
       != $true ) ),
    introduced(definition,[new_symbols(definition,[spl3_3])],[avatar_definition]) ).

thf(f24,plain,
    ( ! [X1: $i] :
        ( ( cN @ X1 )
       != $true )
    | ~ spl3_3 ),
    inference(avatar_component_clause,[],[f23]) ).

thf(f26,definition,
    ( spl3_4
  <=> ( $true
      = ( cG @ sK0 ) ) ),
    introduced(definition,[new_symbols(definition,[spl3_4])],[avatar_definition]) ).

thf(f28,plain,
    ( ( $true
     != ( cG @ sK0 ) )
    | spl3_4 ),
    inference(avatar_component_clause,[],[f26]) ).

thf(f29,plain,
    ( spl3_3
    | ~ spl3_4 ),
    inference(avatar_split_clause,[],[f11,f26,f23]) ).

thf(f30,plain,
    ( ( $true != $true )
    | spl3_4 ),
    inference(constrained_superposition,[],[f28,f9]) ).

thf(f31,plain,
    ( $false
    | spl3_4 ),
    inference(trivial_inequality_removal,[],[f30]) ).

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

thf(f33,plain,
    ( ( $true != $true )
    | ~ spl3_2
    | ~ spl3_3 ),
    inference(constrained_superposition,[],[f24,f20]) ).

thf(f34,plain,
    ( $false
    | ~ spl3_2
    | ~ spl3_3 ),
    inference(trivial_inequality_removal,[],[f33]) ).

thf(f35,plain,
    ( ~ spl3_2
    | ~ spl3_3 ),
    inference(avatar_contradiction_clause,[],[f34]) ).

thf(f36,plain,
    ( ( $true != $true )
    | ~ spl3_1 ),
    inference(constrained_superposition,[],[f8,f16]) ).

thf(f37,plain,
    ( $false
    | ~ spl3_1 ),
    inference(trivial_inequality_removal,[],[f36]) ).

thf(f38,plain,
    ~ spl3_1,
    inference(avatar_contradiction_clause,[],[f37]) ).

cnf(s1,plain,
    ( spl3_1
    | spl3_2 ),
    inference(sat_conversion,[],[f21]) ).

cnf(s2,plain,
    ( spl3_3
    | ~ spl3_4 ),
    inference(sat_conversion,[],[f29]) ).

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

cnf(s4,plain,
    ( ~ spl3_2
    | ~ spl3_3 ),
    inference(sat_conversion,[],[f35]) ).

cnf(s5,plain,
    ~ spl3_1,
    inference(sat_conversion,[],[f38]) ).

cnf(s6,plain,
    spl3_3,
    inference(rat,[],[s2,s3]) ).

cnf(s7,plain,
    ~ spl3_2,
    inference(rat,[],[s4,s6]) ).

cnf(s8,plain,
    $false,
    inference(rat,[],[s1,s7,s5]) ).

thf(f39,plain,
    $false,
    inference(avatar_sat_refutation,[],[s8]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYO099^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.17  % Computer : n014.cluster.edu
% 0.09/0.17  % Model    : x86_64 x86_64
% 0.09/0.17  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.17  % Memory   : 8046.5625MB
% 0.09/0.17  % OS       : Linux 6.8.0-71-generic
% 0.09/0.17  % CPULimit : 300
% 0.09/0.17  % WCLimit  : 300
% 0.09/0.17  % DateTime : Tue Sep 29 16:33:30 UTC 2026
% 0.09/0.17  % CPUTime  : 
% 0.09/0.17  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.20  Running first-order model finding
% 0.09/0.20  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.09/0.24  % (2890064)Will run a generic schedule for satisfiability detection.
% 0.09/0.24  % (2890079)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4184848633:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.09/0.24  % (2890079) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2890064-2890079"...
% 0.09/0.24  % (2890079)...printing done.
% 0.09/0.24  % (2890079)Refutation found. Thanks to Tanya!
% 0.09/0.24  % SZS status Theorem for theBenchmark
% 0.09/0.24  % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.24  % (2890079)------------------------------
% 0.09/0.24  % (2890079)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.24  % (2890079)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.24  % (2890079)CaDiCaL version: 2.1.3
% 0.09/0.24  % (2890079)Termination reason: Refutation
% 0.09/0.24  % (2890079)Time elapsed: 0.001 s
% 0.09/0.24  % (2890079)Peak memory usage: 13 MB
% 0.09/0.24  % (2890079)Instructions burned: 2 (million)
% 0.09/0.24  % (2890064)Success in time 0.031 s
% 0.09/0.24  % Vampire exiting
%------------------------------------------------------------------------------