↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : CSR140^2 : TPTP v9.3.1. Released v4.1.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 07:47:08 AM UTC 2026

% Result   : Theorem 0.22s 0.29s
% Output   : Refutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   21 (   8 unt;   0 typ;   0 def)
%            Number of atoms       :   88 (  19 equ;   0 cnn)
%            Maximal formula atoms :    3 (   4 avg)
%            Number of connectives :   85 (  22   ~;   5   |;   4   &;  54   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Number of types       :    3 (   1 usr)
%            Number of type conns  :   16 (  16   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   25 (  22 usr;   5 con; 0-4 aty)
%            Number of variables   :   26 (   0   ^;  14   !;  12   ?;  26   :)

% Comments : 
%------------------------------------------------------------------------------
thf(type_def_5,type,
    num: $tType ).

thf(type_def_6,type,
    sTfun: ( $tType * $tType ) > $tType ).

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

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

thf(func_def_4,type,
    holdsDuring_THFTYPE_IiooI: $i > $o > $o ).

thf(func_def_5,type,
    instance_THFTYPE_IIiioIioI: ( $i > $i > $o ) > $i > $o ).

thf(func_def_6,type,
    instance_THFTYPE_IIiooIioI: ( $i > $o > $o ) > $i > $o ).

thf(func_def_7,type,
    instance_THFTYPE_IiioI: $i > $i > $o ).

thf(func_def_17,type,
    likes_THFTYPE_IiioI: $i > $i > $o ).

thf(func_def_20,type,
    parent_THFTYPE_IiioI: $i > $i > $o ).

thf(func_def_21,type,
    range_THFTYPE_IiioI: $i > $i > $o ).

thf(func_def_22,type,
    subclass_THFTYPE_IiioI: $i > $i > $o ).

thf(func_def_23,type,
    subrelation_THFTYPE_IIioIIioIoI: ( $i > $o ) > ( $i > $o ) > $o ).

thf(func_def_24,type,
    subrelation_THFTYPE_IiioI: $i > $i > $o ).

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

thf(func_def_29,type,
    sK0: $i > $i ).

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

thf(func_def_31,type,
    db1: 
      !>[X0: $tType] : X0 ).

thf(func_def_32,type,
    vEQ: 
      !>[X0: $tType] : ( X0 > X0 > $o ) ).

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

thf(f14,axiom,
    parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_013) ).

thf(f27,axiom,
    ~ ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_026) ).

thf(f45,conjecture,
    ? [X2: $i,X0: $i > $i > $o,X1: $i] :
      ( ( X0 @ X1 @ lAnna_THFTYPE_i )
      & ~ ( X0 @ X2 @ lAnna_THFTYPE_i ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).

thf(f46,negated_conjecture,
    ~ ? [X2: $i,X0: $i > $i > $o,X1: $i] :
        ( ( X0 @ X1 @ lAnna_THFTYPE_i )
        & ~ ( X0 @ X2 @ lAnna_THFTYPE_i ) ),
    inference(negated_conjecture,[status(cth)],[f45]) ).

thf(f67,plain,
    parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i,
    inference(rectify,[],[f14]) ).

thf(f68,plain,
    ( ( parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i )
    = $true ),
    inference(fool_elimination,[],[f67]) ).

thf(f73,plain,
    ~ ? [X0: $i,X1: $i > $i > $o,X2: $i] :
        ( ( X1 @ X2 @ lAnna_THFTYPE_i )
        & ~ ( X1 @ X0 @ lAnna_THFTYPE_i ) ),
    inference(rectify,[],[f46]) ).

thf(f74,plain,
    ~ ? [X2: $i,X1: $i > $i > $o,X0: $i] :
        ( ( ( X1 @ X2 @ lAnna_THFTYPE_i )
          = $true )
        & ( $true
          = ( ~ ( X1 @ X0 @ lAnna_THFTYPE_i ) ) ) ),
    inference(fool_elimination,[],[f73]) ).

thf(f135,plain,
    ~ ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i ),
    inference(rectify,[],[f27]) ).

thf(f136,plain,
    ( ( ~ ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i ) )
    = $true ),
    inference(fool_elimination,[],[f135]) ).

thf(f155,plain,
    ! [X0: $i,X2: $i,X1: $i > $i > $o] :
      ( ( ( X1 @ X2 @ lAnna_THFTYPE_i )
       != $true )
      | ( $true
       != ( ~ ( X1 @ X0 @ lAnna_THFTYPE_i ) ) ) ),
    inference(ennf_transformation,[],[f74]) ).

thf(f160,plain,
    ! [X0: $i,X1: $i,X2: $i > $i > $o] :
      ( ( $true
       != ( X2 @ X1 @ lAnna_THFTYPE_i ) )
      | ( $true
       != ( ~ ( X2 @ X0 @ lAnna_THFTYPE_i ) ) ) ),
    inference(rectify,[],[f155]) ).

thf(f168,plain,
    ( ( parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i )
    = $true ),
    inference(cnf_transformation,[],[f68]) ).

thf(f182,plain,
    ! [X2: $i > $i > $o,X0: $i,X1: $i] :
      ( ( $true
       != ( ~ ( X2 @ X0 @ lAnna_THFTYPE_i ) ) )
      | ( $true
       != ( X2 @ X1 @ lAnna_THFTYPE_i ) ) ),
    inference(cnf_transformation,[],[f160]) ).

thf(f202,plain,
    ( ( ~ ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i ) )
    = $true ),
    inference(cnf_transformation,[],[f136]) ).

thf(f215,plain,
    ( ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i )
    = $false ),
    inference(not_proxy_clausification,[],[f202]) ).

thf(f218,plain,
    ! [X2: $i > $i > $o,X0: $i,X1: $i] :
      ( ( $true
       != ( X2 @ X1 @ lAnna_THFTYPE_i ) )
      | ( $true
        = ( X2 @ X0 @ lAnna_THFTYPE_i ) ) ),
    inference(not_proxy_clausification,[],[f182]) ).

thf(f264,plain,
    ! [X0: $i] :
      ( ( $true != $true )
      | ( $true
        = ( parent_THFTYPE_IiioI @ X0 @ lAnna_THFTYPE_i ) ) ),
    inference(superposition,[],[f218,f168]) ).

thf(f265,plain,
    ! [X0: $i] :
      ( $true
      = ( parent_THFTYPE_IiioI @ X0 @ lAnna_THFTYPE_i ) ),
    inference(trivial_inequality_removal,[],[f264]) ).

thf(f557,plain,
    $true = $false,
    inference(forward_demodulation,[],[f215,f265]) ).

thf(f558,plain,
    $false,
    inference(trivial_inequality_removal,[],[f557]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : CSR140^2 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.19  % Computer : n013.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 17:55:51 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.22/0.29  % (2444023)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.22/0.29  % (2444037)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=863509022:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.22/0.29  % (2444039)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.22/0.29  % (2444039)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.22/0.29  % (2444037) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2444023-2444037"...
% 0.22/0.29  % (2444037)...printing done.
% 0.22/0.29  % (2444033)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=851382907:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.22/0.29  % (2444034)lrs+10_16_si=on:nwc=1.5:random_seed=3772902884:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.22/0.29  % (2444035)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=357473192:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.22/0.29  % (2444037)Refutation found. Thanks to Tanya!
% 0.22/0.29  % SZS status Theorem for theBenchmark
% 0.22/0.29  % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.29  % (2444037)------------------------------
% 0.22/0.29  % (2444037)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.29  % (2444037)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.29  % (2444037)CaDiCaL version: 2.1.3
% 0.22/0.29  % (2444037)Termination reason: Refutation
% 0.22/0.29  % (2444037)Time elapsed: 0.005 s
% 0.22/0.29  % (2444037)Peak memory usage: 12 MB
% 0.22/0.29  % (2444037)Instructions burned: 18 (million)
% 0.22/0.29  % (2444023)Success in time 0.039 s
% 0.22/0.29  % Vampire exiting
%------------------------------------------------------------------------------