↑ Up

Vampire-SAT---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : CSR140^2 : TPTP v9.3.1. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% Computer : n014.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:19 AM UTC 2026

% Result   : Theorem 0.06s 0.25s
% Output   : Refutation 0.06s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   37 (  11 unt;   0 typ;   2 def)
%            Number of atoms       :  135 (  33 equ;   0 cnn)
%            Maximal formula atoms :    3 (   3 avg)
%            Number of connectives :  111 (  35   ~;  16   |;   4   &;  54   @)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    3 (   1 usr)
%            Number of type conns  :   14 (  14   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   27 (  24 usr;   7 con; 0-4 aty)
%            Number of variables   :   37 (   0 sgn  21   !;  12   ?;  37   :)

% 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(f5,axiom,
    parent_THFTYPE_IiioI @ lMary_THFTYPE_i @ lAnna_THFTYPE_i,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_004) ).

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

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

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

thf(f55,plain,
    parent_THFTYPE_IiioI @ lMary_THFTYPE_i @ lAnna_THFTYPE_i,
    inference(rectify,[],[f5]) ).

thf(f56,plain,
    ( ( parent_THFTYPE_IiioI @ lMary_THFTYPE_i @ lAnna_THFTYPE_i )
    = $true ),
    inference(fool_elimination,[],[f55]) ).

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

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

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

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

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

thf(f161,plain,
    ( ( parent_THFTYPE_IiioI @ lMary_THFTYPE_i @ lAnna_THFTYPE_i )
    = $true ),
    inference(cnf_transformation,[],[f56]) ).

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

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

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

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

thf(f218,plain,
    ! [X2: $i,X1: $i] :
      ( ( $true
       != ( ^ [Y0: $i,Y1: $i] : ( Y0 = Y1 )
          @ X1
          @ lAnna_THFTYPE_i ) )
      | ( $true
        = ( ^ [Y0: $i,Y1: $i] : ( Y0 = Y1 )
          @ X2
          @ lAnna_THFTYPE_i ) ) ),
    inference(primitive_instantiation,[],[f206]) ).

thf(f235,plain,
    ! [X2: $i,X1: $i] :
      ( ( $true
       != ( X1 = lAnna_THFTYPE_i ) )
      | ( $true
        = ( X2 = lAnna_THFTYPE_i ) ) ),
    inference(beta-eta_normalization,[],[f218]) ).

thf(f236,plain,
    ! [X2: $i,X1: $i] :
      ( ( lAnna_THFTYPE_i != X1 )
      | ( $true
        = ( X2 = lAnna_THFTYPE_i ) ) ),
    inference(equality_proxy_clausification,[],[f235]) ).

thf(f237,plain,
    ! [X2: $i,X1: $i] :
      ( ( lAnna_THFTYPE_i != X1 )
      | ( lAnna_THFTYPE_i = X2 ) ),
    inference(equality_proxy_clausification,[],[f236]) ).

thf(f239,definition,
    ( spl1_1
  <=> ! [X2: $i] : ( lAnna_THFTYPE_i != X2 ) ),
    introduced(definition,[new_symbols(definition,[spl1_1])],[avatar_definition]) ).

thf(f240,plain,
    ( ! [X2: $i] : ( lAnna_THFTYPE_i != X2 )
    | ~ spl1_1 ),
    inference(avatar_component_clause,[],[f239]) ).

thf(f242,definition,
    ( spl1_2
  <=> ! [X1: $i] : ( lAnna_THFTYPE_i = X1 ) ),
    introduced(definition,[new_symbols(definition,[spl1_2])],[avatar_definition]) ).

thf(f243,plain,
    ( ! [X1: $i] : ( lAnna_THFTYPE_i = X1 )
    | ~ spl1_2 ),
    inference(avatar_component_clause,[],[f242]) ).

thf(f245,plain,
    ( spl1_2
    | spl1_1 ),
    inference(avatar_split_clause,[],[f237,f239,f242]) ).

thf(f286,plain,
    ( ( $true
      = ( parent_THFTYPE_IiioI @ lAnna_THFTYPE_i @ lAnna_THFTYPE_i ) )
    | ~ spl1_2 ),
    inference(forward_demodulation,[],[f161,f243]) ).

thf(f387,plain,
    ( ( $false
      = ( parent_THFTYPE_IiioI @ lAnna_THFTYPE_i @ lAnna_THFTYPE_i ) )
    | ~ spl1_2 ),
    inference(forward_demodulation,[],[f207,f243]) ).

thf(f392,plain,
    ( ( $true = $false )
    | ~ spl1_2 ),
    inference(constrained_superposition,[],[f387,f286]) ).

thf(f414,plain,
    ( $false
    | ~ spl1_2 ),
    inference(trivial_inequality_removal,[],[f392]) ).

thf(f415,plain,
    ~ spl1_2,
    inference(avatar_contradiction_clause,[],[f414]) ).

thf(f423,plain,
    ( $false
    | ~ spl1_1 ),
    inference(equality_resolution,[],[f240]) ).

thf(f424,plain,
    ~ spl1_1,
    inference(avatar_contradiction_clause,[],[f423]) ).

cnf(s2,plain,
    ( spl1_1
    | spl1_2 ),
    inference(sat_conversion,[],[f245]) ).

cnf(s8,plain,
    ~ spl1_2,
    inference(sat_conversion,[],[f415]) ).

cnf(s9,plain,
    ~ spl1_1,
    inference(sat_conversion,[],[f424]) ).

cnf(s10,plain,
    $false,
    inference(rat,[],[s2,s8,s9]) ).

thf(f425,plain,
    $false,
    inference(avatar_sat_refutation,[],[s10]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : CSR140^2 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.06/0.18  % Computer : n014.cluster.edu
% 0.06/0.18  % Model    : x86_64 x86_64
% 0.06/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.18  % Memory   : 8046.5625MB
% 0.06/0.18  % OS       : Linux 6.8.0-71-generic
% 0.06/0.18  % CPULimit : 300
% 0.06/0.18  % WCLimit  : 300
% 0.06/0.18  % DateTime : Tue Sep 29 17:56:15 UTC 2026
% 0.06/0.18  % CPUTime  : 
% 0.06/0.18  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.06/0.20  Running first-order model finding
% 0.06/0.20  Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.25  % (2999652)Will run a generic schedule for satisfiability detection.
% 0.06/0.25  % (2999662)% WARNING: option uhcvi not known.
% 0.06/0.25  % (2999662)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2471723869:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.06/0.25  % (2999662)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.06/0.25  % (2999662)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.06/0.25  % (2999662) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2999652-2999662"...
% 0.06/0.25  % (2999662)...printing done.
% 0.06/0.25  % (2999661)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=221464501_2999 on theBenchmark for (2999ds/0Mi)
% 0.06/0.25  % (2999662)Refutation found. Thanks to Tanya!
% 0.06/0.25  % SZS status Theorem for theBenchmark
% 0.06/0.25  % SZS output start Proof for theBenchmark
% See solution above
% 0.06/0.25  % (2999662)------------------------------
% 0.06/0.25  % (2999662)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.06/0.25  % (2999662)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.06/0.25  % (2999662)CaDiCaL version: 2.1.3
% 0.06/0.25  % (2999662)Termination reason: Refutation
% 0.06/0.25  % (2999662)Time elapsed: 0.006 s
% 0.06/0.25  % (2999662)Peak memory usage: 13 MB
% 0.06/0.25  % (2999662)Instructions burned: 18 (million)
% 0.06/0.25  % (2999652)Success in time 0.038 s
% 0.06/0.25  % Vampire exiting
%------------------------------------------------------------------------------