↑ 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  : SYO236^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 : n009.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:49:35 AM UTC 2026

% Result   : Theorem 0.08s 0.26s
% Output   : Refutation 0.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   23 (   8 unt;   0 typ;   2 def)
%            Number of atoms       :   55 (  26 equ;   0 cnn)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   81 (  19   ~;  17   |;   1   &;  34   @)
%                                         (   2 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    3 (   2 usr)
%            Number of type conns  :   16 (  16   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   13 (  10 usr;   5 con; 0-4 aty)
%            Number of variables   :   16 (   0 sgn  16   !;   0   ?;  16   :)

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

thf(type_def_6,type,
    a: $tType ).

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

thf(func_def_0,type,
    g: b > a ).

thf(func_def_1,type,
    f: b > a ).

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

thf(func_def_7,type,
    sK1: b ).

thf(func_def_8,type,
    vEQ: 
      !>[X0: $tType] : ( X0 > X0 > $o ) ).

thf(func_def_9,type,
    db0: 
      !>[X0: $tType] : X0 ).

thf(func_def_10,type,
    vLAM: 
      !>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).

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

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

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

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

thf(f5,plain,
    ( ( f != g )
    & ( ! [X0: b] :
          ( ( f @ X0 )
          = ( g @ X0 ) )
      | ! [X1: ( b > a ) > $o] :
          ( ( ( X1 @ g )
            = $true )
          | ( ( X1 @ f )
           != $true ) ) ) ),
    inference(ennf_transformation,[],[f4]) ).

thf(f6,plain,
    ! [X0: b,X1: ( b > a ) > $o] :
      ( ( ( f @ X0 )
        = ( g @ X0 ) )
      | ( ( X1 @ g )
        = $true )
      | ( ( X1 @ f )
       != $true ) ),
    inference(cnf_transformation,[],[f5]) ).

thf(f7,plain,
    f != g,
    inference(cnf_transformation,[],[f5]) ).

thf(f11,definition,
    ( spl0_1
  <=> ! [X1: ( b > a ) > $o] :
        ( ( ( X1 @ g )
          = $true )
        | ( ( X1 @ f )
         != $true ) ) ),
    introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).

thf(f12,plain,
    ( ! [X1: ( b > a ) > $o] :
        ( ( ( X1 @ f )
         != $true )
        | ( ( X1 @ g )
          = $true ) )
    | ~ spl0_1 ),
    inference(avatar_component_clause,[],[f11]) ).

thf(f14,definition,
    ( spl0_2
  <=> ! [X0: b] :
        ( ( f @ X0 )
        = ( g @ X0 ) ) ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

thf(f15,plain,
    ( ! [X0: b] :
        ( ( f @ X0 )
        = ( g @ X0 ) )
    | ~ spl0_2 ),
    inference(avatar_component_clause,[],[f14]) ).

thf(f16,plain,
    ( spl0_1
    | spl0_2 ),
    inference(avatar_split_clause,[],[f6,f14,f11]) ).

thf(f17,plain,
    ( ( f @ sK1 )
   != ( g @ sK1 ) ),
    inference(negative_extensionality,[],[f7]) ).

thf(f18,plain,
    ( $false
    | ~ spl0_2 ),
    inference(forward_subsumption_resolution,[],[f17,f15]) ).

thf(f19,plain,
    ~ spl0_2,
    inference(avatar_contradiction_clause,[],[f18]) ).

thf(f20,plain,
    ( ( f = g )
    | ~ spl0_1 ),
    inference(leibniz_equality_elimination,[],[f12]) ).

thf(f34,plain,
    ( $false
    | ~ spl0_1 ),
    inference(forward_subsumption_resolution,[],[f20,f7]) ).

thf(f35,plain,
    ~ spl0_1,
    inference(avatar_contradiction_clause,[],[f34]) ).

cnf(s1,plain,
    ( spl0_1
    | spl0_2 ),
    inference(sat_conversion,[],[f16]) ).

cnf(s2,plain,
    ~ spl0_2,
    inference(sat_conversion,[],[f19]) ).

cnf(s4,plain,
    ~ spl0_1,
    inference(sat_conversion,[],[f35]) ).

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

thf(f36,plain,
    $false,
    inference(avatar_sat_refutation,[],[s5]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYO236^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.08/0.19  % Computer : n009.cluster.edu
% 0.08/0.19  % Model    : x86_64 x86_64
% 0.08/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19  % Memory   : 8046.5625MB
% 0.08/0.19  % OS       : Linux 6.8.0-71-generic
% 0.08/0.19  % CPULimit : 300
% 0.08/0.19  % WCLimit  : 300
% 0.08/0.19  % DateTime : Tue Sep 29 16:40:30 UTC 2026
% 0.08/0.19  % CPUTime  : 
% 0.08/0.19  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.22  Running first-order model finding
% 0.08/0.22  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.26  % (37797)Will run a generic schedule for satisfiability detection.
% 0.08/0.26  % (37806)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1569860699:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.08/0.26  % (37806)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.08/0.26  % (37806) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-37797-37806"...
% 0.08/0.26  % (37806)...printing done.
% 0.08/0.26  % (37803)% WARNING: option uhcvi not known.
% 0.08/0.26  % (37806)Refutation found. Thanks to Tanya!
% 0.08/0.26  % SZS status Theorem for theBenchmark
% 0.08/0.26  % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.26  % (37806)------------------------------
% 0.08/0.26  % (37806)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.26  % (37806)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.26  % (37806)CaDiCaL version: 2.1.3
% 0.08/0.26  % (37806)Termination reason: Refutation
% 0.08/0.26  % (37806)Time elapsed: 0.001 s
% 0.08/0.26  % (37806)Peak memory usage: 12 MB
% 0.08/0.26  % (37806)Instructions burned: 1 (million)
% 0.08/0.26  % (37797)Success in time 0.027 s
% 0.08/0.26  % Vampire exiting
%------------------------------------------------------------------------------