↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : ALG281^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/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 07:45:20 AM UTC 2026

% Result   : Theorem 0.35s 0.41s
% Output   : Refutation 0.35s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   17 (  10 unt;   0 typ;   0 def)
%            Number of atoms       :   70 (  37 equ;   0 cnn)
%            Maximal formula atoms :    4 (   4 avg)
%            Number of connectives :  178 (   8   ~;   0   |;  18   &; 149   @)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    7 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   53 (   0   ^;  50   !;   3   ?;  53   :)

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

thf(func_def_1,type,
    cJ: $i > $i ).

thf(func_def_2,type,
    cP: $i > $i > $i ).

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

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

thf(f3,plain,
    ~ ( ( ! [X0: $i] :
            ( ( cP @ cE @ X0 )
            = X0 )
        & ! [X2: $i,X3: $i,X4: $i] :
            ( ( cP @ X4 @ ( cP @ X2 @ X3 ) )
            = ( cP @ ( cP @ X4 @ X2 ) @ X3 ) )
        & ! [X1: $i] :
            ( ( cP @ ( cJ @ X1 ) @ X1 )
            = cE ) )
     => ! [X5: $i] :
          ( cE
          = ( cP @ X5 @ ( cJ @ X5 ) ) ) ),
    inference(rectify,[],[f2]) ).

thf(f4,plain,
    ( ? [X5: $i] :
        ( cE
       != ( cP @ X5 @ ( cJ @ X5 ) ) )
    & ! [X0: $i] :
        ( ( cP @ cE @ X0 )
        = X0 )
    & ! [X2: $i,X3: $i,X4: $i] :
        ( ( cP @ X4 @ ( cP @ X2 @ X3 ) )
        = ( cP @ ( cP @ X4 @ X2 ) @ X3 ) )
    & ! [X1: $i] :
        ( ( cP @ ( cJ @ X1 ) @ X1 )
        = cE ) ),
    inference(ennf_transformation,[],[f3]) ).

thf(f5,plain,
    ( ! [X1: $i] :
        ( ( cP @ ( cJ @ X1 ) @ X1 )
        = cE )
    & ! [X0: $i] :
        ( ( cP @ cE @ X0 )
        = X0 )
    & ? [X5: $i] :
        ( cE
       != ( cP @ X5 @ ( cJ @ X5 ) ) )
    & ! [X2: $i,X3: $i,X4: $i] :
        ( ( cP @ X4 @ ( cP @ X2 @ X3 ) )
        = ( cP @ ( cP @ X4 @ X2 ) @ X3 ) ) ),
    inference(flattening,[],[f4]) ).

thf(f6,plain,
    ( ! [X0: $i] :
        ( cE
        = ( cP @ ( cJ @ X0 ) @ X0 ) )
    & ! [X1: $i] :
        ( ( cP @ cE @ X1 )
        = X1 )
    & ? [X2: $i] :
        ( cE
       != ( cP @ X2 @ ( cJ @ X2 ) ) )
    & ! [X3: $i,X4: $i,X5: $i] :
        ( ( cP @ X5 @ ( cP @ X3 @ X4 ) )
        = ( cP @ ( cP @ X5 @ X3 ) @ X4 ) ) ),
    inference(rectify,[],[f5]) ).

thf(f7,plain,
    ( ! [X0: $i] :
        ( cE
        = ( cP @ ( cJ @ X0 ) @ X0 ) )
    & ! [X1: $i] :
        ( ( cP @ cE @ X1 )
        = X1 )
    & ( cE
     != ( cP @ sK0 @ ( cJ @ sK0 ) ) )
    & ! [X3: $i,X4: $i,X5: $i] :
        ( ( cP @ X5 @ ( cP @ X3 @ X4 ) )
        = ( cP @ ( cP @ X5 @ X3 ) @ X4 ) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0)],[f6]) ).

thf(f8,plain,
    ! [X3: $i,X4: $i,X5: $i] :
      ( ( cP @ X5 @ ( cP @ X3 @ X4 ) )
      = ( cP @ ( cP @ X5 @ X3 ) @ X4 ) ),
    inference(cnf_transformation,[],[f7]) ).

thf(f9,plain,
    ( cE
   != ( cP @ sK0 @ ( cJ @ sK0 ) ) ),
    inference(cnf_transformation,[],[f7]) ).

thf(f10,plain,
    ! [X1: $i] :
      ( ( cP @ cE @ X1 )
      = X1 ),
    inference(cnf_transformation,[],[f7]) ).

thf(f11,plain,
    ! [X0: $i] :
      ( cE
      = ( cP @ ( cJ @ X0 ) @ X0 ) ),
    inference(cnf_transformation,[],[f7]) ).

thf(f13,plain,
    ! [X0: $i,X1: $i] :
      ( ( cP @ ( cJ @ X0 ) @ ( cP @ X0 @ X1 ) )
      = ( cP @ cE @ X1 ) ),
    inference(constrained_superposition,[],[f8,f11]) ).

thf(f15,plain,
    ! [X0: $i,X1: $i] :
      ( ( cP @ ( cJ @ X0 ) @ ( cP @ X0 @ X1 ) )
      = X1 ),
    inference(forward_demodulation,[],[f13,f10]) ).

thf(f21,plain,
    ! [X0: $i,X1: $i] :
      ( ( cP @ ( cJ @ ( cJ @ X1 ) ) @ X0 )
      = ( cP @ X1 @ X0 ) ),
    inference(constrained_superposition,[],[f15,f15]) ).

thf(f33,plain,
    ! [X0: $i] :
      ( cE
      = ( cP @ X0 @ ( cJ @ X0 ) ) ),
    inference(constrained_superposition,[],[f21,f11]) ).

thf(f81,plain,
    cE != cE,
    inference(constrained_superposition,[],[f9,f33]) ).

thf(f82,plain,
    $false,
    inference(trivial_inequality_removal,[],[f81]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : ALG281^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.09  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.29  % Computer : n001.cluster.edu
% 0.11/0.29  % Model    : x86_64 x86_64
% 0.11/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.29  % Memory   : 8046.5625MB
% 0.11/0.29  % OS       : Linux 6.8.0-71-generic
% 0.11/0.29  % CPULimit : 300
% 0.11/0.29  % WCLimit  : 300
% 0.11/0.29  % DateTime : Tue Sep 29 17:42:21 UTC 2026
% 0.11/0.30  % CPUTime  : 
% 0.11/0.30  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.31/0.34  Running higher-order theorem proving
% 0.31/0.36  Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.35/0.41  % (1578365)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.35/0.41  % (1578371)lrs+10_16_si=on:nwc=1.5:random_seed=670116279:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.35/0.41  % (1578371) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1578365-1578371"...
% 0.35/0.41  % (1578371)...printing done.
% 0.35/0.41  % (1578371)Refutation found. Thanks to Tanya!
% 0.35/0.41  % SZS status Theorem for theBenchmark
% 0.35/0.41  % SZS output start Proof for theBenchmark
% See solution above
% 0.35/0.41  % (1578371)------------------------------
% 0.35/0.41  % (1578371)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.35/0.41  % (1578371)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.35/0.41  % (1578371)CaDiCaL version: 2.1.3
% 0.35/0.41  % (1578371)Termination reason: Refutation
% 0.35/0.41  % (1578371)Time elapsed: 0.005 s
% 0.35/0.41  % (1578371)Peak memory usage: 12 MB
% 0.35/0.41  % (1578371)Instructions burned: 7 (million)
% 0.35/0.41  % (1578365)Success in time 0.036 s
% 0.35/0.41  % Vampire exiting
%------------------------------------------------------------------------------