↑ 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  : SET584^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 : n019.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:38 AM UTC 2026

% Result   : Theorem 0.08s 0.25s
% Output   : Refutation 0.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   26 (   8 unt;   0 typ;   2 def)
%            Number of atoms       :  119 (  42 equ;   0 cnn)
%            Maximal formula atoms :    6 (   4 avg)
%            Number of connectives :  137 (  27   ~;  25   |;  12   &;  59   @)
%                                         (   2 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   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     :   10 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :   37 (   0 sgn  25   !;  12   ?;  37   :)

% 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 ).

thf(func_def_6,type,
    sK3: a ).

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

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

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

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

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

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

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

thf(f8,plain,
    ( ( $true
     != ( sK2 @ sK3 ) )
    & ( $true
     != ( sK1 @ sK3 ) )
    & ( ( $true
        = ( sK2 @ sK3 ) )
      | ( $true
        = ( sK0 @ sK3 ) ) )
    & ! [X4: a] :
        ( ( $true
          = ( sK1 @ X4 ) )
        | ( $true
         != ( sK0 @ X4 ) ) ) ),
    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,
    ! [X4: a] :
      ( ( $true
       != ( sK0 @ X4 ) )
      | ( $true
        = ( sK1 @ X4 ) ) ),
    inference(cnf_transformation,[],[f8]) ).

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

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

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

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

thf(f18,plain,
    ( ( $true
      = ( sK0 @ sK3 ) )
    | ~ spl4_1 ),
    inference(avatar_component_clause,[],[f16]) ).

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

thf(f23,plain,
    ( spl4_1
    | spl4_2 ),
    inference(avatar_split_clause,[],[f10,f20,f16]) ).

thf(f24,plain,
    ~ spl4_2,
    inference(avatar_split_clause,[],[f12,f20]) ).

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

thf(f26,plain,
    ( ( $true
      = ( sK1 @ 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]) ).

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

cnf(s2,plain,
    ~ spl4_2,
    inference(sat_conversion,[],[f24]) ).

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET584^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.17  % Computer : n019.cluster.edu
% 0.08/0.17  % Model    : x86_64 x86_64
% 0.08/0.17  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17  % Memory   : 8046.5625MB
% 0.08/0.17  % 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 13:38:18 UTC 2026
% 0.08/0.18  % CPUTime  : 
% 0.08/0.18  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.21  Running first-order model finding
% 0.08/0.21  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.08/0.25  % (774139)Will run a generic schedule for satisfiability detection.
% 0.08/0.25  % (774147)dis+10_1_sil=32000:sp=arity:random_seed=3163789302:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.08/0.25  % (774147) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-774139-774147"...
% 0.08/0.25  % (774147)...printing done.
% 0.08/0.25  % (774147)Refutation found. Thanks to Tanya!
% 0.08/0.25  % SZS status Theorem for theBenchmark
% 0.08/0.25  % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.25  % (774147)------------------------------
% 0.08/0.25  % (774147)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.25  % (774147)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.25  % (774147)CaDiCaL version: 2.1.3
% 0.08/0.25  % (774147)Termination reason: Refutation
% 0.08/0.25  % (774147)Time elapsed: 0.001 s
% 0.08/0.25  % (774147)Peak memory usage: 12 MB
% 0.08/0.25  % (774147)Instructions burned: 1 (million)
% 0.08/0.25  % (774139)Success in time 0.031 s
% 0.08/0.25  % Vampire exiting
%------------------------------------------------------------------------------