↑ 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  : SET185^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT

% Computer : n004.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:23:36 AM UTC 2026

% Result   : Theorem 0.17s 0.27s
% Output   : Refutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   26 (   6 unt;   0 typ;   2 def)
%            Number of atoms       :  103 (  32 equ;   0 cnn)
%            Maximal formula atoms :    5 (   3 avg)
%            Number of connectives :  111 (  22   ~;  23   |;   6   &;  46   @)
%                                         (   2 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :   12 (  12   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    9 (   6 usr;   5 con; 0-2 aty)
%            Number of variables   :   26 (   0 sgn  20   !;   6   ?;  26   :)

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

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

thf(func_def_3,type,
    sK0: a > $o ).

thf(func_def_4,type,
    sK1: a > $o ).

thf(func_def_5,type,
    sK2: a ).

thf(f1,conjecture,
    ! [X0: a > $o,X1: a > $o] :
      ( ! [X2: a] :
          ( ( X0 @ X2 )
         => ( X1 @ X2 ) )
     => ! [X2: a] :
          ( ( ( X1 @ X2 )
            | ( X0 @ X2 ) )
         => ( X1 @ X2 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cBOOL_PROP_35_pme) ).

thf(f2,negated_conjecture,
    ~ ! [X0: a > $o,X1: a > $o] :
        ( ! [X2: a] :
            ( ( X0 @ X2 )
           => ( X1 @ X2 ) )
       => ! [X2: a] :
            ( ( ( X1 @ X2 )
              | ( X0 @ X2 ) )
           => ( X1 @ X2 ) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

thf(f3,plain,
    ~ ! [X0: a > $o,X1: a > $o] :
        ( ! [X2: a] :
            ( ( X0 @ X2 )
           => ( X1 @ X2 ) )
       => ! [X3: a] :
            ( ( ( X1 @ X3 )
              | ( X0 @ X3 ) )
           => ( X1 @ X3 ) ) ),
    inference(rectify,[],[f2]) ).

thf(f4,plain,
    ~ ! [X0: a > $o,X1: a > $o] :
        ( ! [X2: a] :
            ( ( ( X0 @ X2 )
              = $true )
           => ( ( X1 @ X2 )
              = $true ) )
       => ! [X3: a] :
            ( ( ( ( X1 @ X3 )
                = $true )
              | ( ( X0 @ X3 )
                = $true ) )
           => ( ( X1 @ X3 )
              = $true ) ) ),
    inference(fool_elimination,[],[f3]) ).

thf(f5,plain,
    ? [X0: a > $o,X1: a > $o] :
      ( ? [X3: a] :
          ( ( ( X1 @ X3 )
           != $true )
          & ( ( ( X1 @ X3 )
              = $true )
            | ( ( X0 @ X3 )
              = $true ) ) )
      & ! [X2: a] :
          ( ( ( X1 @ X2 )
            = $true )
          | ( ( X0 @ X2 )
           != $true ) ) ),
    inference(ennf_transformation,[],[f4]) ).

thf(f6,plain,
    ? [X0: a > $o,X1: a > $o] :
      ( ? [X2: a] :
          ( ( ( X1 @ X2 )
           != $true )
          & ( ( ( X1 @ X2 )
              = $true )
            | ( ( X0 @ X2 )
              = $true ) ) )
      & ! [X3: a] :
          ( ( ( X1 @ X3 )
            = $true )
          | ( ( X0 @ X3 )
           != $true ) ) ),
    inference(rectify,[],[f5]) ).

thf(f7,plain,
    ( ( $true
     != ( sK1 @ sK2 ) )
    & ( ( $true
        = ( sK1 @ sK2 ) )
      | ( $true
        = ( sK0 @ sK2 ) ) )
    & ! [X3: a] :
        ( ( $true
          = ( sK1 @ X3 ) )
        | ( $true
         != ( sK0 @ X3 ) ) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f6]) ).

thf(f8,plain,
    ! [X3: a] :
      ( ( $true
       != ( sK0 @ X3 ) )
      | ( $true
        = ( sK1 @ X3 ) ) ),
    inference(cnf_transformation,[],[f7]) ).

thf(f9,plain,
    ( ( $true
      = ( sK1 @ sK2 ) )
    | ( $true
      = ( sK0 @ sK2 ) ) ),
    inference(cnf_transformation,[],[f7]) ).

thf(f10,plain,
    ( $true
   != ( sK1 @ sK2 ) ),
    inference(cnf_transformation,[],[f7]) ).

thf(f14,definition,
    ( spl3_1
  <=> ( $true
      = ( sK0 @ sK2 ) ) ),
    introduced(definition,[new_symbols(definition,[spl3_1])],[avatar_definition]) ).

thf(f16,plain,
    ( ( $true
      = ( sK0 @ sK2 ) )
    | ~ spl3_1 ),
    inference(avatar_component_clause,[],[f14]) ).

thf(f18,definition,
    ( spl3_2
  <=> ( $true
      = ( sK1 @ sK2 ) ) ),
    introduced(definition,[new_symbols(definition,[spl3_2])],[avatar_definition]) ).

thf(f19,plain,
    ( ( $true
     != ( sK1 @ sK2 ) )
    | spl3_2 ),
    inference(avatar_component_clause,[],[f18]) ).

thf(f21,plain,
    ( spl3_1
    | spl3_2 ),
    inference(avatar_split_clause,[],[f9,f18,f14]) ).

thf(f22,plain,
    ~ spl3_2,
    inference(avatar_split_clause,[],[f10,f18]) ).

thf(f23,plain,
    ( ( $true != $true )
    | ( $true
      = ( sK1 @ sK2 ) )
    | ~ spl3_1 ),
    inference(constrained_superposition,[],[f8,f16]) ).

thf(f24,plain,
    ( ( $true
      = ( sK1 @ sK2 ) )
    | ~ spl3_1 ),
    inference(trivial_inequality_removal,[],[f23]) ).

thf(f25,plain,
    ( $false
    | ~ spl3_1
    | spl3_2 ),
    inference(forward_subsumption_resolution,[],[f24,f19]) ).

thf(f26,plain,
    ( ~ spl3_1
    | spl3_2 ),
    inference(avatar_contradiction_clause,[],[f25]) ).

cnf(s1,plain,
    ( spl3_1
    | spl3_2 ),
    inference(sat_conversion,[],[f21]) ).

cnf(s2,plain,
    ~ spl3_2,
    inference(sat_conversion,[],[f22]) ).

cnf(s3,plain,
    ( ~ spl3_1
    | spl3_2 ),
    inference(sat_conversion,[],[f26]) ).

cnf(s4,plain,
    ~ spl3_1,
    inference(rat,[],[s3,s2]) ).

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

thf(f27,plain,
    $false,
    inference(avatar_sat_refutation,[],[s5]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET185^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.18  % Computer : n004.cluster.edu
% 0.07/0.18  % Model    : x86_64 x86_64
% 0.07/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18  % Memory   : 8046.5625MB
% 0.07/0.18  % OS       : Linux 6.8.0-71-generic
% 0.07/0.18  % CPULimit : 300
% 0.07/0.18  % WCLimit  : 300
% 0.07/0.18  % DateTime : Tue Sep 29 13:37:07 UTC 2026
% 0.07/0.19  % CPUTime  : 
% 0.07/0.19  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.22  Running first-order model finding
% 0.07/0.22  Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.27  % (1289172)Will run a generic schedule for satisfiability detection.
% 0.17/0.27  % (1289182)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=418745525_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.27  % Exception at run slice level
% 0.17/0.27  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.17/0.27  % (1289183)% WARNING: option uhcvi not known.
% 0.17/0.27  % (1289183)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1187354121:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.27  % (1289184)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1177895162:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.27  % (1289185)dis+10_1_sil=32000:sp=arity:random_seed=3147936325:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.27  % (1289183)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.17/0.27  % (1289183)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.17/0.27  % (1289185) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1289172-1289185"...
% 0.17/0.27  % (1289183) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1289172-1289183"...
% 0.17/0.27  % (1289184) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1289172-1289184"...
% 0.17/0.27  % (1289184)...printing done.
% 0.17/0.27  % (1289183)...printing done.
% 0.17/0.27  % (1289185)...printing done.
% 0.17/0.27  % (1289190)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2452371472:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.17/0.27  % Exception at run slice level
% 0.17/0.27  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.17/0.27  % (1289185)Refutation found. Thanks to Tanya!
% 0.17/0.27  % SZS status Theorem for theBenchmark
% 0.17/0.27  % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.27  % (1289185)------------------------------
% 0.17/0.27  % (1289185)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.27  % (1289185)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.27  % (1289185)CaDiCaL version: 2.1.3
% 0.17/0.27  % (1289185)Termination reason: Refutation
% 0.17/0.27  % (1289185)Time elapsed: 0.002 s
% 0.17/0.27  % (1289185)Peak memory usage: 12 MB
% 0.17/0.27  % (1289185)Instructions burned: 1 (million)
% 0.17/0.27  % (1289172)Success in time 0.038 s
% 0.17/0.27  % Vampire exiting
%------------------------------------------------------------------------------