↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SYO370^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 : n010.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:32 AM UTC 2026

% Result   : Theorem 0.21s 0.28s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   47 (  17 unt;   0 typ;   7 def)
%            Number of atoms       :  167 (  31 equ;   0 cnn)
%            Maximal formula atoms :    4 (   3 avg)
%            Number of connectives :  116 (  48   ~;  24   |;   1   &;  34   @)
%                                         (   5 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   16 (  13 usr;   9 con; 0-4 aty)
%            Number of variables   :   10 (   0 sgn   0   !;   0   ?;  10   :)

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

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

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

thf(func_def_5,type,
    vNOT: $o > $o ).

thf(func_def_6,type,
    db0: 
      !>[X0: $tType] : X0 ).

thf(func_def_7,type,
    vLAM: 
      !>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).

thf(func_def_8,type,
    sF0: $o ).

thf(func_def_9,type,
    sF1: $o ).

thf(f1,conjecture,
    ( ( cP @ cA )
   => ( cP
      @ ^ [X0: $i] :
          ~ ~ ( cA @ X0 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTRIVEXT3) ).

thf(f2,negated_conjecture,
    ~ ( ( cP @ cA )
     => ( cP
        @ ^ [X0: $i] :
            ~ ~ ( cA @ X0 ) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

thf(f3,plain,
    ~ ( ( cP @ cA )
     => ( cP
        @ ^ [X0: $i] :
            ~ ~ ( cA @ X0 ) ) ),
    inference(rectify,[],[f2]) ).

thf(f4,plain,
    ~ ( ( ( cP @ cA )
        = $true )
     => ( ( cP
          @ ^ [Y0: $i] :
              ~ ~ ( cA @ Y0 ) )
        = $true ) ),
    inference(fool_elimination,[],[f3]) ).

thf(f5,plain,
    ( ( ( cP @ cA )
      = $true )
    & ( ( cP
        @ ^ [Y0: $i] :
            ~ ~ ( cA @ Y0 ) )
     != $true ) ),
    inference(ennf_transformation,[],[f4]) ).

thf(f6,plain,
    ( ( cP
      @ ^ [Y0: $i] :
          ~ ~ ( cA @ Y0 ) )
   != $true ),
    inference(cnf_transformation,[],[f5]) ).

thf(f7,plain,
    ( ( cP @ cA )
    = $true ),
    inference(cnf_transformation,[],[f5]) ).

thf(f10,definition,
    ( sF0
    = ( cP @ cA ) ),
    introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).

thf(f11,plain,
    ( ( cP @ cA )
    = sF0 ),
    inference(reorient_equations,[],[f10]) ).

thf(f12,plain,
    sF0 = $true,
    inference(definition_folding,[],[f7,f11]) ).

thf(f13,definition,
    ( sF1
    = ( cP
      @ ^ [Y0: $i] :
          ~ ~ ( cA @ Y0 ) ) ),
    introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).

thf(f14,plain,
    ( ( cP
      @ ^ [Y0: $i] :
          ~ ~ ( cA @ Y0 ) )
    = sF1 ),
    inference(reorient_equations,[],[f13]) ).

thf(f15,plain,
    sF1 != $true,
    inference(definition_folding,[],[f6,f14]) ).

thf(f17,plain,
    ( ( sF1 = $true )
    | ( $false
      = ( cP
        @ ^ [Y0: $i] :
            ~ ~ ( cA @ Y0 ) ) ) ),
    inference(iff_proxy_clausification,[],[f14]) ).

thf(f18,plain,
    ( ( sF1 = $true )
    | ( $false
      = ( cP
        @ ^ [Y0: $i] : ( cA @ Y0 ) ) ) ),
    inference(boolean_simplification,[],[f17]) ).

thf(f19,plain,
    ( ( sF1 = $true )
    | ( ( cP @ cA )
      = $false ) ),
    inference(beta-eta_normalization,[],[f18]) ).

thf(f22,plain,
    ( ( $false = sF0 )
    | ( ( cP @ cA )
      = $true ) ),
    inference(iff_proxy_clausification,[],[f11]) ).

thf(f25,definition,
    ( spl2_1
  <=> ( sF1 = $true ) ),
    introduced(definition,[new_symbols(definition,[spl2_1])],[avatar_definition]) ).

thf(f29,definition,
    ( spl2_2
  <=> ( ( cP @ cA )
      = $false ) ),
    introduced(definition,[new_symbols(definition,[spl2_2])],[avatar_definition]) ).

thf(f31,plain,
    ( ( ( cP @ cA )
      = $false )
    | ~ spl2_2 ),
    inference(avatar_component_clause,[],[f29]) ).

thf(f32,plain,
    ( spl2_1
    | spl2_2 ),
    inference(avatar_split_clause,[],[f19,f29,f25]) ).

thf(f34,definition,
    ( spl2_3
  <=> ( ( cP @ cA )
      = $true ) ),
    introduced(definition,[new_symbols(definition,[spl2_3])],[avatar_definition]) ).

thf(f36,plain,
    ( ( ( cP @ cA )
      = $true )
    | ~ spl2_3 ),
    inference(avatar_component_clause,[],[f34]) ).

thf(f43,definition,
    ( spl2_5
  <=> ( sF0 = $true ) ),
    introduced(definition,[new_symbols(definition,[spl2_5])],[avatar_definition]) ).

thf(f45,plain,
    ( ( sF0 = $true )
    | ~ spl2_5 ),
    inference(avatar_component_clause,[],[f43]) ).

thf(f48,definition,
    ( spl2_6
  <=> ( $false = sF0 ) ),
    introduced(definition,[new_symbols(definition,[spl2_6])],[avatar_definition]) ).

thf(f50,plain,
    ( ( $false = sF0 )
    | ~ spl2_6 ),
    inference(avatar_component_clause,[],[f48]) ).

thf(f51,plain,
    ( spl2_3
    | spl2_6 ),
    inference(avatar_split_clause,[],[f22,f48,f34]) ).

thf(f52,plain,
    ~ spl2_1,
    inference(avatar_split_clause,[],[f15,f25]) ).

thf(f53,plain,
    spl2_5,
    inference(avatar_split_clause,[],[f12,f43]) ).

thf(f55,plain,
    ( ( $false = $true )
    | ~ spl2_5
    | ~ spl2_6 ),
    inference(forward_demodulation,[],[f50,f45]) ).

thf(f56,plain,
    ( $false
    | ~ spl2_5
    | ~ spl2_6 ),
    inference(trivial_inequality_removal,[],[f55]) ).

thf(f57,plain,
    ( ~ spl2_5
    | ~ spl2_6 ),
    inference(avatar_contradiction_clause,[],[f56]) ).

thf(f72,plain,
    ( ( $false = $true )
    | ~ spl2_2
    | ~ spl2_3 ),
    inference(forward_demodulation,[],[f36,f31]) ).

thf(f73,plain,
    ( $false
    | ~ spl2_2
    | ~ spl2_3 ),
    inference(trivial_inequality_removal,[],[f72]) ).

thf(f74,plain,
    ( ~ spl2_2
    | ~ spl2_3 ),
    inference(avatar_contradiction_clause,[],[f73]) ).

cnf(s1,plain,
    ( spl2_1
    | spl2_2 ),
    inference(sat_conversion,[],[f32]) ).

cnf(s4,plain,
    ( spl2_3
    | spl2_6 ),
    inference(sat_conversion,[],[f51]) ).

cnf(s5,plain,
    ~ spl2_1,
    inference(sat_conversion,[],[f52]) ).

cnf(s6,plain,
    spl2_5,
    inference(sat_conversion,[],[f53]) ).

cnf(s7,plain,
    ( ~ spl2_5
    | ~ spl2_6 ),
    inference(sat_conversion,[],[f57]) ).

cnf(s8,plain,
    ( ~ spl2_2
    | ~ spl2_3 ),
    inference(sat_conversion,[],[f74]) ).

cnf(s9,plain,
    ~ spl2_6,
    inference(rat,[],[s7,s6]) ).

cnf(s10,plain,
    spl2_3,
    inference(rat,[],[s4,s9]) ).

cnf(s11,plain,
    ~ spl2_2,
    inference(rat,[],[s8,s10]) ).

cnf(s12,plain,
    $false,
    inference(rat,[],[s1,s11,s5]) ).

thf(f75,plain,
    $false,
    inference(avatar_sat_refutation,[],[s12]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYO370^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.19  % Computer : n010.cluster.edu
% 0.08/0.19  % Model    : x86_64 x86_64
% 0.08/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19  % Memory   : 8046.5625MB
% 0.08/0.19  % OS       : Linux 6.8.0-71-generic
% 0.08/0.19  % CPULimit : 300
% 0.08/0.19  % WCLimit  : 300
% 0.08/0.19  % DateTime : Tue Sep 29 16:49:48 UTC 2026
% 0.08/0.19  % CPUTime  : 
% 0.08/0.19  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.22  Running higher-order theorem proving
% 0.08/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.21/0.28  % (3124540)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.21/0.28  % (3124551)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.21/0.28  % (3124551)WARNING Broken Constraint: if sine_to_age_tolerance(5) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 0.21/0.28  % (3124551)dis+1002_8_to=kbo:sil=128000:tgt=full:drc=off:si=on:sp=const_max:lma=off:spb=non_intro:cbe=off:uwa=interpreted_only:random_seed=3417735238:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.21/0.28  % (3124551) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3124540-3124551"...
% 0.21/0.28  % (3124551)...printing done.
% 0.21/0.28  % (3124551)Refutation found. Thanks to Tanya!
% 0.21/0.28  % SZS status Theorem for theBenchmark
% 0.21/0.28  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.28  % (3124551)------------------------------
% 0.21/0.28  % (3124551)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.28  % (3124551)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.28  % (3124551)CaDiCaL version: 2.1.3
% 0.21/0.28  % (3124551)Termination reason: Refutation
% 0.21/0.28  % (3124551)Time elapsed: 0.002 s
% 0.21/0.28  % (3124551)Peak memory usage: 13 MB
% 0.21/0.28  % (3124551)Instructions burned: 2 (million)
% 0.21/0.28  % (3124540)Success in time 0.034 s
% 0.21/0.28  % Vampire exiting
%------------------------------------------------------------------------------