↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SYN355^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 08:41:39 AM UTC 2026

% Result   : Theorem 0.11s 0.29s
% Output   : Refutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   18 (   5 unt;   0 typ;   0 def)
%            Number of atoms       :  171 (  48 equ;   0 cnn)
%            Maximal formula atoms :    6 (   9 avg)
%            Number of connectives :  139 (  26   ~;  17   |;  17   &;  64   @)
%                                         (   0 <=>;  15  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    8 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   28 (   0   ^;  25   !;   3   ?;  28   :)

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

thf(func_def_0,type,
    cQ: $i > $o ).

thf(func_def_1,type,
    cP: $i > $o ).

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

thf(f1,conjecture,
    ( ( ! [X0: $i] :
          ( ~ ( cQ @ X0 )
         => ( cR @ X0 ) )
      & ! [X0: $i] :
          ( ( cR @ X0 )
         => ( cP @ X0 ) ) )
   => ! [X0: $i] :
        ( ( cP @ X0 )
        | ( cQ @ X0 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cX2106) ).

thf(f2,negated_conjecture,
    ~ ( ( ! [X0: $i] :
            ( ~ ( cQ @ X0 )
           => ( cR @ X0 ) )
        & ! [X0: $i] :
            ( ( cR @ X0 )
           => ( cP @ X0 ) ) )
     => ! [X0: $i] :
          ( ( cP @ X0 )
          | ( cQ @ X0 ) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

thf(f3,plain,
    ~ ( ( ! [X0: $i] :
            ( ~ ( cQ @ X0 )
           => ( cR @ X0 ) )
        & ! [X1: $i] :
            ( ( cR @ X1 )
           => ( cP @ X1 ) ) )
     => ! [X2: $i] :
          ( ( cP @ X2 )
          | ( cQ @ X2 ) ) ),
    inference(rectify,[],[f2]) ).

thf(f4,plain,
    ~ ( ( ! [X0: $i] :
            ( ( ( cQ @ X0 )
             != $true )
           => ( ( cR @ X0 )
              = $true ) )
        & ! [X1: $i] :
            ( ( ( cR @ X1 )
              = $true )
           => ( ( cP @ X1 )
              = $true ) ) )
     => ! [X2: $i] :
          ( ( ( cP @ X2 )
            = $true )
          | ( ( cQ @ X2 )
            = $true ) ) ),
    inference(fool_elimination,[],[f3]) ).

thf(f5,plain,
    ~ ( ( ! [X1: $i] :
            ( ( ( cR @ X1 )
              = $true )
           => ( ( cP @ X1 )
              = $true ) )
        & ! [X0: $i] :
            ( ( ( cQ @ X0 )
             != $true )
           => ( ( cR @ X0 )
              = $true ) ) )
     => ! [X2: $i] :
          ( ( ( cP @ X2 )
            = $true )
          | ( ( cQ @ X2 )
            = $true ) ) ),
    inference(flattening,[],[f4]) ).

thf(f6,plain,
    ( ? [X2: $i] :
        ( ( ( cP @ X2 )
         != $true )
        & ( ( cQ @ X2 )
         != $true ) )
    & ! [X1: $i] :
        ( ( ( cR @ X1 )
         != $true )
        | ( ( cP @ X1 )
          = $true ) )
    & ! [X0: $i] :
        ( ( ( cR @ X0 )
          = $true )
        | ( ( cQ @ X0 )
          = $true ) ) ),
    inference(ennf_transformation,[],[f5]) ).

thf(f7,plain,
    ( ! [X1: $i] :
        ( ( ( cR @ X1 )
         != $true )
        | ( ( cP @ X1 )
          = $true ) )
    & ! [X0: $i] :
        ( ( ( cR @ X0 )
          = $true )
        | ( ( cQ @ X0 )
          = $true ) )
    & ? [X2: $i] :
        ( ( ( cP @ X2 )
         != $true )
        & ( ( cQ @ X2 )
         != $true ) ) ),
    inference(flattening,[],[f6]) ).

thf(f8,plain,
    ( ! [X0: $i] :
        ( ( ( cR @ X0 )
         != $true )
        | ( ( cP @ X0 )
          = $true ) )
    & ! [X1: $i] :
        ( ( ( cR @ X1 )
          = $true )
        | ( $true
          = ( cQ @ X1 ) ) )
    & ? [X2: $i] :
        ( ( ( cP @ X2 )
         != $true )
        & ( ( cQ @ X2 )
         != $true ) ) ),
    inference(rectify,[],[f7]) ).

thf(f9,plain,
    ( ! [X0: $i] :
        ( ( ( cR @ X0 )
         != $true )
        | ( ( cP @ X0 )
          = $true ) )
    & ! [X1: $i] :
        ( ( ( cR @ X1 )
          = $true )
        | ( $true
          = ( cQ @ X1 ) ) )
    & ( $true
     != ( cP @ sK0 ) )
    & ( ( cQ @ sK0 )
     != $true ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0)],[f8]) ).

thf(f10,plain,
    ( ( cQ @ sK0 )
   != $true ),
    inference(cnf_transformation,[],[f9]) ).

thf(f11,plain,
    ( $true
   != ( cP @ sK0 ) ),
    inference(cnf_transformation,[],[f9]) ).

thf(f12,plain,
    ! [X1: $i] :
      ( ( $true
        = ( cQ @ X1 ) )
      | ( ( cR @ X1 )
        = $true ) ),
    inference(cnf_transformation,[],[f9]) ).

thf(f13,plain,
    ! [X0: $i] :
      ( ( ( cR @ X0 )
       != $true )
      | ( ( cP @ X0 )
        = $true ) ),
    inference(cnf_transformation,[],[f9]) ).

thf(f16,plain,
    ( ( $true != $true )
    | ( $true
      = ( cR @ sK0 ) ) ),
    inference(constrained_superposition,[],[f10,f12]) ).

thf(f17,plain,
    ( $true
    = ( cR @ sK0 ) ),
    inference(trivial_inequality_removal,[],[f16]) ).

thf(f18,plain,
    ( ( $true != $true )
    | ( $true
      = ( cP @ sK0 ) ) ),
    inference(constrained_superposition,[],[f13,f17]) ).

thf(f19,plain,
    ( $true
    = ( cP @ sK0 ) ),
    inference(trivial_inequality_removal,[],[f18]) ).

thf(f20,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f19,f11]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN355^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.19  % Computer : n001.cluster.edu
% 0.11/0.19  % Model    : x86_64 x86_64
% 0.11/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.19  % Memory   : 8046.5625MB
% 0.11/0.19  % OS       : Linux 6.8.0-71-generic
% 0.11/0.19  % CPULimit : 300
% 0.11/0.19  % WCLimit  : 300
% 0.11/0.19  % DateTime : Tue Sep 29 16:20:51 UTC 2026
% 0.11/0.19  % CPUTime  : 
% 0.11/0.19  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.23  Running higher-order theorem proving
% 0.11/0.24  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.11/0.29  % (1442572)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.11/0.29  % (1442577)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=3209613734:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.11/0.29  % (1442577) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1442572-1442577"...
% 0.11/0.29  % (1442577)...printing done.
% 0.11/0.29  % (1442577)Refutation found. Thanks to Tanya!
% 0.11/0.29  % SZS status Theorem for theBenchmark
% 0.11/0.29  % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.29  % (1442577)------------------------------
% 0.11/0.29  % (1442577)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.29  % (1442577)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.29  % (1442577)CaDiCaL version: 2.1.3
% 0.11/0.29  % (1442577)Termination reason: Refutation
% 0.11/0.29  % (1442577)Time elapsed: 0.001 s
% 0.11/0.29  % (1442577)Peak memory usage: 12 MB
% 0.11/0.29  % (1442577)Instructions burned: 1 (million)
% 0.11/0.29  % (1442572)Success in time 0.035 s
% 0.11/0.29  % Vampire exiting
%------------------------------------------------------------------------------