↑ 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  : SEU887^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 : n010.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:34:20 AM UTC 2026

% Result   : Theorem 0.28s 0.34s
% Output   : Refutation 0.28s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   14 (   4 unt;   0 typ;   0 def)
%            Number of atoms       :   61 (  40 equ;   0 cnn)
%            Maximal formula atoms :    5 (   4 avg)
%            Number of connectives :  109 (  21   ~;  11   |;  18   &;  55   @)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   7 avg)
%            Number of types       :    4 (   3 usr)
%            Number of type conns  :   18 (  18   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    9 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :   48 (   0   ^;  26   !;  22   ?;  48   :)

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

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

thf(type_def_7,type,
    c: $tType ).

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

thf(func_def_3,type,
    sK0: b > a ).

thf(func_def_4,type,
    sK1: c > b ).

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

thf(func_def_6,type,
    sK3: a ).

thf(func_def_7,type,
    sK4: c ).

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

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

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

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

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

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

thf(f7,plain,
    ( ! [X4: b] :
        ( ( sK3
         != ( sK0 @ X4 ) )
        | ! [X5: c] :
            ( ( ( sK1 @ X5 )
             != X4 )
            | ( $true
             != ( sK2 @ X5 ) ) ) )
    & ( sK3
      = ( sK0 @ ( sK1 @ sK4 ) ) )
    & ( $true
      = ( sK2 @ sK4 ) ) ),
    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(X6,sK4)],[f6]) ).

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

thf(f9,plain,
    ( sK3
    = ( sK0 @ ( sK1 @ sK4 ) ) ),
    inference(cnf_transformation,[],[f7]) ).

thf(f10,plain,
    ! [X4: b,X5: c] :
      ( ( sK3
       != ( sK0 @ X4 ) )
      | ( ( sK1 @ X5 )
       != X4 )
      | ( $true
       != ( sK2 @ X5 ) ) ),
    inference(cnf_transformation,[],[f7]) ).

thf(f13,plain,
    ! [X0: c] :
      ( ( sK3 != sK3 )
      | ( ( sK1 @ sK4 )
       != ( sK1 @ X0 ) )
      | ( $true
       != ( sK2 @ X0 ) ) ),
    inference(constrained_superposition,[],[f10,f9]) ).

thf(f14,plain,
    ! [X0: c] :
      ( ( ( sK1 @ sK4 )
       != ( sK1 @ X0 ) )
      | ( $true
       != ( sK2 @ X0 ) ) ),
    inference(trivial_inequality_removal,[],[f13]) ).

thf(f15,plain,
    ( $true
   != ( sK2 @ sK4 ) ),
    inference(equality_resolution,[],[f14]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU887^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.25  % Computer : n010.cluster.edu
% 0.11/0.25  % Model    : x86_64 x86_64
% 0.11/0.25  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.25  % Memory   : 8046.5625MB
% 0.11/0.25  % OS       : Linux 6.8.0-71-generic
% 0.11/0.25  % CPULimit : 300
% 0.11/0.25  % WCLimit  : 300
% 0.11/0.25  % DateTime : Tue Sep 29 14:43:48 UTC 2026
% 0.11/0.25  % CPUTime  : 
% 0.11/0.25  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.28/0.31  Running first-order model finding
% 0.28/0.31  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.28/0.34  % (2952757)Will run a generic schedule for satisfiability detection.
% 0.28/0.34  % (2952767)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2746812485:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 0.28/0.34  % (2952767) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2952757-2952767"...
% 0.28/0.34  % (2952766)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2555173656:i=116_3000 on theBenchmark for (3000ds/116Mi)
% 0.28/0.34  % (2952766)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.28/0.34  % (2952767)...printing done.
% 0.28/0.34  % (2952767)Refutation found. Thanks to Tanya!
% 0.28/0.34  % SZS status Theorem for theBenchmark
% 0.28/0.34  % SZS output start Proof for theBenchmark
% See solution above
% 0.28/0.34  % (2952767)------------------------------
% 0.28/0.34  % (2952767)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.28/0.34  % (2952767)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.28/0.34  % (2952767)CaDiCaL version: 2.1.3
% 0.28/0.34  % (2952767)Termination reason: Refutation
% 0.28/0.34  % (2952767)Time elapsed: 0.002 s
% 0.28/0.34  % (2952767)Peak memory usage: 12 MB
% 0.28/0.34  % (2952767)Instructions burned: 1 (million)
% 0.28/0.34  % (2952757)Success in time 0.025 s
% 0.28/0.34  % Vampire exiting
%------------------------------------------------------------------------------