↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---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 THM

% Computer : n001.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:31:47 AM UTC 2026

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

% 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,
    ! [X1: a > $o,X0: a > $o,X2: a > $o] :
      ( ( ( X0 = X1 )
        & ( X1 = X2 ) )
     => ( X0 = X2 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cGAZING_THM7) ).

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

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

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

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

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

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

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

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

thf(f12,plain,
    sK0 != sK0,
    inference(definition_unfolding,[],[f9,f8,f7]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % 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 THM
% 0.07/0.19  % Computer : n001.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:45:36 UTC 2026
% 0.07/0.20  % CPUTime  : 
% 0.07/0.20  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.23  Running higher-order theorem proving
% 0.07/0.24  Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.29  % (1339144)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.20/0.29  % (1339157)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=893151453:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.20/0.29  % (1339157) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1339144-1339157"...
% 0.20/0.29  % (1339157)...printing done.
% 0.20/0.29  % (1339157)Refutation found. Thanks to Tanya!
% 0.20/0.29  % SZS status Theorem for theBenchmark
% 0.20/0.29  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.29  % (1339157)------------------------------
% 0.20/0.29  % (1339157)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.29  % (1339157)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.29  % (1339157)CaDiCaL version: 2.1.3
% 0.20/0.29  % (1339157)Termination reason: Refutation
% 0.20/0.29  % (1339157)Time elapsed: 0.0000 s
% 0.20/0.29  % (1339157)Peak memory usage: 12 MB
% 0.20/0.29  % (1339144)Success in time 0.034 s
% 0.20/0.29  % Vampire exiting
%------------------------------------------------------------------------------