↑ 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  : SEU841^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:34:16 AM UTC 2026

% Result   : Theorem 0.07s 0.25s
% Output   : Refutation 0.07s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   11 (   6 unt;   0 typ;   0 def)
%            Number of atoms       :   37 (  20 equ;   0 cnn)
%            Maximal formula atoms :    3 (   3 avg)
%            Number of connectives :   16 (   6   ~;   0   |;   8   &;   0   @)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :   12 (  12   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    7 (   5 usr;   1 con; 0-2 aty)
%            Number of variables   :   12 (   0   ^;   6   !;   6   ?;  12   :)

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

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

thf(func_def_0,type,
    sK0: a > $o ).

thf(func_def_1,type,
    sK1: a > $o ).

thf(func_def_2,type,
    sK2: a > $o ).

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

thf(f1,conjecture,
    ! [X0: a > $o,X1: a > $o,X2: a > $o] :
      ( ( ( X1 = X2 )
        & ( X0 = X1 ) )
     => ( X0 = X2 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cGAZING_THM7) ).

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

thf(f3,plain,
    ? [X0: a > $o,X1: a > $o,X2: a > $o] :
      ( ( X0 != X2 )
      & ( X1 = X2 )
      & ( X0 = X1 ) ),
    inference(ennf_transformation,[],[f2]) ).

thf(f4,plain,
    ? [X0: a > $o,X1: a > $o,X2: a > $o] :
      ( ( X0 != X2 )
      & ( X1 = X2 )
      & ( X0 = X1 ) ),
    inference(flattening,[],[f3]) ).

thf(f5,plain,
    ( ( sK0 != sK2 )
    & ( sK1 = sK2 )
    & ( sK0 = sK1 ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f4]) ).

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

thf(f7,plain,
    sK1 = sK2,
    inference(cnf_transformation,[],[f5]) ).

thf(f8,plain,
    sK0 != sK2,
    inference(cnf_transformation,[],[f5]) ).

thf(f11,plain,
    sK0 = sK2,
    inference(definition_unfolding,[],[f6,f7]) ).

thf(f12,plain,
    sK2 != sK2,
    inference(definition_unfolding,[],[f8,f11]) ).

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

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