↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SYO390^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 : n013.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:47:35 AM UTC 2026

% Result   : Theorem 0.21s 0.26s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   12 (   9 unt;   0 typ;   1 def)
%            Number of atoms       :   27 (  12 equ)
%            Maximal formula atoms :    2 (   2 avg)
%            Number of connectives :   17 (   8   ~;   0   |;   2   &)
%                                         (   3 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of FOOLs       :   32 (  12 fml;  20 var)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    6 (   4 usr;   3 prp; 0-2 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :   10 (   8   !;   2   ?;  10   :)

% Comments : 
%------------------------------------------------------------------------------
tff(func_def_0,type,
    sK0: $o ).

tff(func_def_1,type,
    sK1: $o ).

tff(pred_def_1,type,
    sP2: $o > $o ).

tff(pred_def_2,type,
    sP3: $o > $o ).

tff(f1,conjecture,
    ! [X0: $o,X1: $o] :
      ( ( (X0)
      <=> (X1) )
     => ( (X0) = (X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cEXT_eq_0) ).

tff(f2,negated_conjecture,
    ~ ! [X0: $o,X1: $o] :
        ( ( (X0)
        <=> (X1) )
       => ( (X0) = (X1) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

tff(f3,plain,
    ~ ! [X0: $o,X1: $o] :
        ( ( (X0)
        <=> (X1) )
       => ( (X0) = (X1) ) ),
    inference(rectify,[],[f2]) ).

tff(f4,plain,
    ~ ! [X0: $o,X1: $o] :
        ( ( (X0) = (X1) )
       => ( (X0) = (X1) ) ),
    inference(fool_elimination,[],[f3]) ).

tff(f5,plain,
    ? [X0: $o,X1: $o] :
      ( ( (X0) != (X1) )
      & ( (X0) = (X1) ) ),
    inference(ennf_transformation,[],[f4]) ).

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

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

tff(f8,plain,
    sK0 != sK1,
    inference(cnf_transformation,[],[f6]) ).

tff(f11,plain,
    sK1 != sK1,
    inference(definition_unfolding,[],[f8,f7]) ).

tff(f14,definition,
    ~ sP3(sK1),
    introduced(definition,[new_symbols(definition,[sP3])],[inequality_splitting_name_introduction]) ).

tff(f15,plain,
    sP3(sK1),
    inference(inequality_splitting,[],[f11,f14]) ).

tff(f16,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f15,f14]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYO390^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.18  % Computer : n013.cluster.edu
% 0.08/0.18  % Model    : x86_64 x86_64
% 0.08/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18  % Memory   : 8046.5625MB
% 0.08/0.18  % OS       : Linux 6.8.0-71-generic
% 0.08/0.18  % CPULimit : 300
% 0.08/0.18  % WCLimit  : 300
% 0.08/0.18  % DateTime : Tue Sep 29 16:49:36 UTC 2026
% 0.08/0.18  % CPUTime  : 
% 0.08/0.18  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.21  Running higher-order theorem proving
% 0.08/0.23  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.21/0.26  % (2366564)Detected formulas, will run a generic FOF schedule.
% 0.21/0.26  % (2366570)dis+1010_16_tgt=full:drc=ordering:sp=reverse_frequency:nwc=1:random_seed=687399937:i=261632:kws=inv_arity_squared:ins=1:av=off:fsd=on_2999 on theBenchmark for (2999ds/261632Mi)
% 0.21/0.26  % (2366570) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2366564-2366570"...
% 0.21/0.26  % (2366570)...printing done.
% 0.21/0.26  % (2366570)Refutation found. Thanks to Tanya!
% 0.21/0.26  % SZS status Theorem for theBenchmark
% 0.21/0.26  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.26  % (2366570)------------------------------
% 0.21/0.26  % (2366570)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.26  % (2366570)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.26  % (2366570)CaDiCaL version: 2.1.3
% 0.21/0.26  % (2366570)Termination reason: Refutation
% 0.21/0.26  % (2366570)Time elapsed: 0.001 s
% 0.21/0.26  % (2366570)Peak memory usage: 11 MB
% 0.21/0.26  % (2366564)Success in time 0.029 s
% 0.21/0.26  % Vampire exiting
%------------------------------------------------------------------------------