↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SYO142^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 : n002.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:46:42 AM UTC 2026

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

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

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

thf(func_def_2,type,
    p: $i > $o ).

thf(f1,conjecture,
    ? [X1: $i,X0: $i] :
      ( ( ( p @ X0 )
       => ( p @ ( f @ ( f @ X1 ) ) ) )
      & ( ( p @ X1 )
       => ( p @ ( f @ ( f @ a ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTEST4) ).

thf(f2,negated_conjecture,
    ~ ? [X1: $i,X0: $i] :
        ( ( ( p @ X0 )
         => ( p @ ( f @ ( f @ X1 ) ) ) )
        & ( ( p @ X1 )
         => ( p @ ( f @ ( f @ a ) ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

thf(f3,plain,
    ~ ? [X0: $i,X1: $i] :
        ( ( ( p @ X1 )
         => ( p @ ( f @ ( f @ X0 ) ) ) )
        & ( ( p @ X0 )
         => ( p @ ( f @ ( f @ a ) ) ) ) ),
    inference(rectify,[],[f2]) ).

thf(f4,plain,
    ~ ? [X1: $i,X0: $i] :
        ( ( ( ( p @ X1 )
            = $true )
         => ( $true
            = ( p @ ( f @ ( f @ X0 ) ) ) ) )
        & ( ( ( p @ X0 )
            = $true )
         => ( ( p @ ( f @ ( f @ a ) ) )
            = $true ) ) ),
    inference(fool_elimination,[],[f3]) ).

thf(f5,plain,
    ! [X0: $i,X1: $i] :
      ( ( ( ( p @ X1 )
          = $true )
        & ( $true
         != ( p @ ( f @ ( f @ X0 ) ) ) ) )
      | ( ( ( p @ ( f @ ( f @ a ) ) )
         != $true )
        & ( ( p @ X0 )
          = $true ) ) ),
    inference(ennf_transformation,[],[f4]) ).

thf(f6,plain,
    ! [X0: $i] :
      ( ( ( p @ X0 )
        = $true )
      | ( $true
       != ( p @ ( f @ ( f @ X0 ) ) ) ) ),
    inference(cnf_transformation,[],[f5]) ).

thf(f7,plain,
    ! [X0: $i] :
      ( ( $true
       != ( p @ ( f @ ( f @ X0 ) ) ) )
      | ( ( p @ ( f @ ( f @ a ) ) )
       != $true ) ),
    inference(cnf_transformation,[],[f5]) ).

thf(f8,plain,
    ! [X0: $i,X1: $i] :
      ( ( ( p @ X1 )
        = $true )
      | ( ( p @ X0 )
        = $true ) ),
    inference(cnf_transformation,[],[f5]) ).

thf(f15,plain,
    ! [X0: $i] :
      ( ( p @ X0 )
      = $true ),
    inference(forward_subsumption_resolution,[],[f6,f8]) ).

thf(f16,plain,
    ! [X0: $i] :
      ( $true
     != ( p @ ( f @ ( f @ X0 ) ) ) ),
    inference(forward_subsumption_resolution,[],[f7,f15]) ).

thf(f17,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f16,f15]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYO142^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.10/0.19  % Computer : n002.cluster.edu
% 0.10/0.19  % Model    : x86_64 x86_64
% 0.10/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.19  % Memory   : 8046.5625MB
% 0.10/0.19  % OS       : Linux 6.8.0-71-generic
% 0.10/0.19  % CPULimit : 300
% 0.10/0.19  % WCLimit  : 300
% 0.10/0.19  % DateTime : Tue Sep 29 16:37:52 UTC 2026
% 0.10/0.19  % CPUTime  : 
% 0.10/0.19  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.23  Running higher-order theorem proving
% 0.10/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.23/0.29  % (1513152)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.23/0.29  % (1513161)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=923725430:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.23/0.29  % (1513161) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1513152-1513161"...
% 0.23/0.29  % (1513161)...printing done.
% 0.23/0.29  % (1513161)Refutation found. Thanks to Tanya!
% 0.23/0.29  % SZS status Theorem for theBenchmark
% 0.23/0.29  % SZS output start Proof for theBenchmark
% See solution above
% 0.23/0.29  % (1513161)------------------------------
% 0.23/0.29  % (1513161)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.23/0.29  % (1513161)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.23/0.29  % (1513161)CaDiCaL version: 2.1.3
% 0.23/0.29  % (1513161)Termination reason: Refutation
% 0.23/0.29  % (1513161)Time elapsed: 0.001 s
% 0.23/0.29  % (1513161)Peak memory usage: 12 MB
% 0.23/0.29  % (1513161)Instructions burned: 1 (million)
% 0.23/0.29  % (1513152)Success in time 0.039 s
% 0.23/0.29  % Vampire exiting
%------------------------------------------------------------------------------