↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Result   : Theorem 0.22s 0.29s
% Output   : Refutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   40 (  16 unt;   0 typ;   2 def)
%            Number of atoms       :  148 (  31 equ;   0 cnn)
%            Maximal formula atoms :    4 (   3 avg)
%            Number of connectives :  144 (  26   ~;  21   |;   0   &;  90   @)
%                                         (   4 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    3 (   1 usr)
%            Number of type conns  :   28 (  28   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   12 (   9 usr;   6 con; 0-2 aty)
%            Number of variables   :   40 (   0 sgn  36   !;   4   ?;  40   :)

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

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

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

thf(func_def_3,type,
    wife_THFTYPE_IiioI: $i > $i > $o ).

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

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

thf(f1,axiom,
    inverse_THFTYPE_IIiioIIiioIoI @ husband_THFTYPE_IiioI @ wife_THFTYPE_IiioI,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax) ).

thf(f2,axiom,
    ! [X0: $i > $i > $o,X1: $i > $i > $o] :
      ( ( inverse_THFTYPE_IIiioIIiioIoI @ X1 @ X0 )
     => ! [X3: $i,X2: $i] :
          ( ( X1 @ X2 @ X3 )
        <=> ( X0 @ X3 @ X2 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_001) ).

thf(f3,axiom,
    wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ lChris_THFTYPE_i,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_002) ).

thf(f4,conjecture,
    ? [X0: $i] : ( husband_THFTYPE_IiioI @ X0 @ lCorina_THFTYPE_i ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).

thf(f5,negated_conjecture,
    ~ ? [X0: $i] : ( husband_THFTYPE_IiioI @ X0 @ lCorina_THFTYPE_i ),
    inference(negated_conjecture,[status(cth)],[f4]) ).

thf(f6,plain,
    ! [X0: $i > $i > $o,X1: $i > $i > $o] :
      ( ( inverse_THFTYPE_IIiioIIiioIoI @ X1 @ X0 )
     => ! [X2: $i,X3: $i] :
          ( ( X1 @ X3 @ X2 )
        <=> ( X0 @ X2 @ X3 ) ) ),
    inference(rectify,[],[f2]) ).

thf(f7,plain,
    ! [X1: $i > $i > $o,X0: $i > $i > $o] :
      ( ( ( inverse_THFTYPE_IIiioIIiioIoI @ X1 @ X0 )
        = $true )
     => ! [X3: $i,X2: $i] :
          ( ( X0 @ X2 @ X3 )
          = ( X1 @ X3 @ X2 ) ) ),
    inference(fool_elimination,[],[f6]) ).

thf(f8,plain,
    wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ lChris_THFTYPE_i,
    inference(rectify,[],[f3]) ).

thf(f9,plain,
    ( ( wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ lChris_THFTYPE_i )
    = $true ),
    inference(fool_elimination,[],[f8]) ).

thf(f10,plain,
    inverse_THFTYPE_IIiioIIiioIoI @ husband_THFTYPE_IiioI @ wife_THFTYPE_IiioI,
    inference(rectify,[],[f1]) ).

thf(f11,plain,
    ( ( inverse_THFTYPE_IIiioIIiioIoI @ husband_THFTYPE_IiioI @ wife_THFTYPE_IiioI )
    = $true ),
    inference(fool_elimination,[],[f10]) ).

thf(f12,plain,
    ~ ? [X0: $i] : ( husband_THFTYPE_IiioI @ X0 @ lCorina_THFTYPE_i ),
    inference(rectify,[],[f5]) ).

thf(f13,plain,
    ~ ? [X0: $i] :
        ( ( husband_THFTYPE_IiioI @ X0 @ lCorina_THFTYPE_i )
        = $true ),
    inference(fool_elimination,[],[f12]) ).

thf(f14,plain,
    ! [X0: $i] :
      ( ( husband_THFTYPE_IiioI @ X0 @ lCorina_THFTYPE_i )
     != $true ),
    inference(ennf_transformation,[],[f13]) ).

thf(f15,plain,
    ! [X0: $i > $i > $o,X1: $i > $i > $o] :
      ( ! [X3: $i,X2: $i] :
          ( ( X0 @ X2 @ X3 )
          = ( X1 @ X3 @ X2 ) )
      | ( ( inverse_THFTYPE_IIiioIIiioIoI @ X1 @ X0 )
       != $true ) ),
    inference(ennf_transformation,[],[f7]) ).

thf(f16,plain,
    ! [X0: $i > $i > $o,X1: $i > $i > $o] :
      ( ! [X2: $i,X3: $i] :
          ( ( X1 @ X2 @ X3 )
          = ( X0 @ X3 @ X2 ) )
      | ( ( inverse_THFTYPE_IIiioIIiioIoI @ X1 @ X0 )
       != $true ) ),
    inference(rectify,[],[f15]) ).

thf(f17,plain,
    ( ( wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ lChris_THFTYPE_i )
    = $true ),
    inference(cnf_transformation,[],[f9]) ).

thf(f18,plain,
    ! [X2: $i,X3: $i,X0: $i > $i > $o,X1: $i > $i > $o] :
      ( ( ( inverse_THFTYPE_IIiioIIiioIoI @ X1 @ X0 )
       != $true )
      | ( ( X1 @ X2 @ X3 )
        = ( X0 @ X3 @ X2 ) ) ),
    inference(cnf_transformation,[],[f16]) ).

thf(f19,plain,
    ! [X0: $i] :
      ( ( husband_THFTYPE_IiioI @ X0 @ lCorina_THFTYPE_i )
     != $true ),
    inference(cnf_transformation,[],[f14]) ).

thf(f20,plain,
    ( ( inverse_THFTYPE_IIiioIIiioIoI @ husband_THFTYPE_IiioI @ wife_THFTYPE_IiioI )
    = $true ),
    inference(cnf_transformation,[],[f11]) ).

thf(f22,plain,
    ! [X2: $i,X3: $i,X0: $i > $i > $o,X1: $i > $i > $o] :
      ( ( ( inverse_THFTYPE_IIiioIIiioIoI @ X1 @ X0 )
       != $true )
      | ( ( X0 @ X3 @ X2 )
        = $false )
      | ( ( X1 @ X2 @ X3 )
        = $true ) ),
    inference(iff_proxy_clausification,[],[f18]) ).

thf(f25,definition,
    ( spl0_1
  <=> ( ( wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ lChris_THFTYPE_i )
      = $true ) ),
    introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).

thf(f27,plain,
    ( ( ( wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ lChris_THFTYPE_i )
      = $true )
    | ~ spl0_1 ),
    inference(avatar_component_clause,[],[f25]) ).

thf(f28,plain,
    spl0_1,
    inference(avatar_split_clause,[],[f17,f25]) ).

thf(f30,definition,
    ( spl0_2
  <=> ( ( inverse_THFTYPE_IIiioIIiioIoI @ husband_THFTYPE_IiioI @ wife_THFTYPE_IiioI )
      = $true ) ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

thf(f32,plain,
    ( ( ( inverse_THFTYPE_IIiioIIiioIoI @ husband_THFTYPE_IiioI @ wife_THFTYPE_IiioI )
      = $true )
    | ~ spl0_2 ),
    inference(avatar_component_clause,[],[f30]) ).

thf(f33,plain,
    spl0_2,
    inference(avatar_split_clause,[],[f20,f30]) ).

thf(f34,plain,
    ( ! [X0: $i,X1: $i] :
        ( ( $true
          = ( husband_THFTYPE_IiioI @ X1 @ X0 ) )
        | ( $true != $true )
        | ( ( wife_THFTYPE_IiioI @ X0 @ X1 )
          = $false ) )
    | ~ spl0_2 ),
    inference(superposition,[],[f22,f32]) ).

thf(f35,plain,
    ( ! [X0: $i,X1: $i] :
        ( ( $true
          = ( husband_THFTYPE_IiioI @ X1 @ X0 ) )
        | ( ( wife_THFTYPE_IiioI @ X0 @ X1 )
          = $false ) )
    | ~ spl0_2 ),
    inference(trivial_inequality_removal,[],[f34]) ).

thf(f36,plain,
    ( ! [X0: $i] :
        ( ( $false
          = ( wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ X0 ) )
        | ( $true != $true ) )
    | ~ spl0_2 ),
    inference(superposition,[],[f19,f35]) ).

thf(f37,plain,
    ( ! [X0: $i] :
        ( $false
        = ( wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ X0 ) )
    | ~ spl0_2 ),
    inference(trivial_inequality_removal,[],[f36]) ).

thf(f38,plain,
    ( ( $true = $false )
    | ~ spl0_1
    | ~ spl0_2 ),
    inference(superposition,[],[f37,f27]) ).

thf(f42,plain,
    ( $false
    | ~ spl0_1
    | ~ spl0_2 ),
    inference(trivial_inequality_removal,[],[f38]) ).

thf(f43,plain,
    ( ~ spl0_1
    | ~ spl0_2 ),
    inference(avatar_contradiction_clause,[],[f42]) ).

cnf(s1,plain,
    spl0_1,
    inference(sat_conversion,[],[f28]) ).

cnf(s2,plain,
    spl0_2,
    inference(sat_conversion,[],[f33]) ).

cnf(s4,plain,
    ( ~ spl0_1
    | ~ spl0_2 ),
    inference(sat_conversion,[],[f43]) ).

cnf(s5,plain,
    ~ spl0_1,
    inference(rat,[],[s4,s2]) ).

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

thf(f44,plain,
    $false,
    inference(avatar_sat_refutation,[],[s6]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : CSR142^1 : 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.20  % Computer : n010.cluster.edu
% 0.08/0.20  % Model    : x86_64 x86_64
% 0.08/0.20  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.20  % Memory   : 8046.5625MB
% 0.08/0.20  % OS       : Linux 6.8.0-71-generic
% 0.08/0.20  % CPULimit : 300
% 0.08/0.20  % WCLimit  : 300
% 0.08/0.20  % DateTime : Tue Sep 29 17:56:48 UTC 2026
% 0.08/0.20  % CPUTime  : 
% 0.08/0.20  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.23  Running higher-order theorem proving
% 0.08/0.25  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  % (3210272)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.22/0.29  % (3210280)dis+1002_4:1_sfv=off:to=lpo:plsq=on:fde=none:e2e=on:si=on:spb=non_intro:acc=on:uwa=off:fd=preordered:foolp=on:s2agt=32:slsqc=1:slsq=on:random_seed=2313551091:hsq=on:hsqr=16,1:s2a=on:i=634:add=on:nm=16:nicw=on:rtra=on:gtg=position:ss=included:ixr=off:c=on:inj=on:ntd=on:rawr=on_2999 on theBenchmark for (2999ds/634Mi)
% 0.22/0.29  % (3210280) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3210272-3210280"...
% 0.22/0.29  % (3210280)...printing done.
% 0.22/0.29  % (3210283)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  % (3210283)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  % (3210280)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  % (3210280)------------------------------
% 0.22/0.29  % (3210280)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.29  % (3210280)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.29  % (3210280)CaDiCaL version: 2.1.3
% 0.22/0.29  % (3210280)Termination reason: Refutation
% 0.22/0.29  % (3210280)Time elapsed: 0.002 s
% 0.22/0.29  % (3210280)Peak memory usage: 13 MB
% 0.22/0.29  % (3210280)Instructions burned: 3 (million)
% 0.22/0.29  % (3210272)Success in time 0.029 s
% 0.22/0.29  % Vampire exiting
%------------------------------------------------------------------------------