↑ 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  : SYO220^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 : n011.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:33 AM UTC 2026

% Result   : Theorem 0.07s 0.26s
% Output   : Refutation 0.07s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   12 (   9 unt;   0 typ;   0 def)
%            Number of atoms       :   44 (  17 equ;   0 cnn)
%            Maximal formula atoms :    3 (   3 avg)
%            Number of connectives :   50 (   8   ~;   0   |;   4   &;  30   @)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   5 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   10 (  10   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    8 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   22 (   0   ^;  19   !;   3   ?;  22   :)

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

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

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

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

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

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

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

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

thf(f6,plain,
    ( ( $true
     != ( sK2 @ sK0 @ sK1 ) )
    & ! [X3: $i] :
        ( $true
        = ( sK2 @ X3 @ X3 ) )
    & ( sK0 = sK1 ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f5]) ).

thf(f7,plain,
    sK0 = sK1,
    inference(cnf_transformation,[],[f6]) ).

thf(f8,plain,
    ! [X3: $i] :
      ( $true
      = ( sK2 @ X3 @ X3 ) ),
    inference(cnf_transformation,[],[f6]) ).

thf(f9,plain,
    ( $true
   != ( sK2 @ sK0 @ sK1 ) ),
    inference(cnf_transformation,[],[f6]) ).

thf(f12,plain,
    ( $true
   != ( sK2 @ sK1 @ sK1 ) ),
    inference(definition_unfolding,[],[f9,f7]) ).

thf(f13,plain,
    $true != $true,
    inference(constrained_superposition,[],[f12,f8]) ).

thf(f14,plain,
    $false,
    inference(trivial_inequality_removal,[],[f13]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYO220^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.07/0.18  % Computer : n011.cluster.edu
% 0.07/0.18  % Model    : x86_64 x86_64
% 0.07/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18  % Memory   : 8046.5625MB
% 0.07/0.18  % OS       : Linux 6.8.0-71-generic
% 0.07/0.18  % CPULimit : 300
% 0.07/0.18  % WCLimit  : 300
% 0.07/0.18  % DateTime : Tue Sep 29 16:40:01 UTC 2026
% 0.07/0.18  % CPUTime  : 
% 0.07/0.18  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.22  Running first-order model finding
% 0.07/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.07/0.26  % (318032)Will run a generic schedule for satisfiability detection.
% 0.07/0.26  % (318039)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3309307330:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.07/0.26  % (318039) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-318032-318039"...
% 0.07/0.26  % (318039)...printing done.
% 0.07/0.26  % (318039)Refutation found. Thanks to Tanya!
% 0.07/0.26  % SZS status Theorem for theBenchmark
% 0.07/0.26  % SZS output start Proof for theBenchmark
% See solution above
% 0.07/0.26  % (318039)------------------------------
% 0.07/0.26  % (318039)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.07/0.26  % (318039)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.07/0.26  % (318039)CaDiCaL version: 2.1.3
% 0.07/0.26  % (318039)Termination reason: Refutation
% 0.07/0.26  % (318039)Time elapsed: 0.001 s
% 0.07/0.26  % (318039)Peak memory usage: 12 MB
% 0.07/0.26  % (318039)Instructions burned: 1 (million)
% 0.07/0.26  % (318032)Success in time 0.026 s
% 0.07/0.26  % Vampire exiting
%------------------------------------------------------------------------------