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

% Computer : n003.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:49:01 AM UTC 2026

% Result   : Theorem 0.24s 0.36s
% Output   : Refutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   26 (   8 unt;   0 typ;   2 def)
%            Number of atoms       :  128 (  26 equ;   0 cnn)
%            Maximal formula atoms :    6 (   4 avg)
%            Number of connectives :   89 (  21   ~;  12   |;   6   &;  36   @)
%                                         (   2 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   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     :    9 (   6 usr;   5 con; 0-2 aty)
%            Number of variables   :   18 (   0 sgn  18   !;   0   ?;  18   :)

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

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

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

thf(f1,conjecture,
    ( ( ( cP @ a )
     => ! [X0: $i] : ( cQ @ X0 ) )
   => ( ! [X0: $i] : ( cP @ X0 )
     => ( cQ @ a ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cADDHYP1) ).

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

thf(f3,plain,
    ~ ( ( ( cP @ a )
       => ! [X0: $i] : ( cQ @ X0 ) )
     => ( ! [X1: $i] : ( cP @ X1 )
       => ( cQ @ a ) ) ),
    inference(rectify,[],[f2]) ).

thf(f4,plain,
    ~ ( ( ( ( cP @ a )
          = $true )
       => ! [X0: $i] :
            ( ( cQ @ X0 )
            = $true ) )
     => ( ! [X1: $i] :
            ( ( cP @ X1 )
            = $true )
       => ( ( cQ @ a )
          = $true ) ) ),
    inference(fool_elimination,[],[f3]) ).

thf(f5,plain,
    ( ( ( cQ @ a )
     != $true )
    & ! [X1: $i] :
        ( ( cP @ X1 )
        = $true )
    & ( ! [X0: $i] :
          ( ( cQ @ X0 )
          = $true )
      | ( ( cP @ a )
       != $true ) ) ),
    inference(ennf_transformation,[],[f4]) ).

thf(f6,plain,
    ( ( ( cQ @ a )
     != $true )
    & ! [X1: $i] :
        ( ( cP @ X1 )
        = $true )
    & ( ! [X0: $i] :
          ( ( cQ @ X0 )
          = $true )
      | ( ( cP @ a )
       != $true ) ) ),
    inference(flattening,[],[f5]) ).

thf(f7,plain,
    ( ( ( cQ @ a )
     != $true )
    & ! [X0: $i] :
        ( ( cP @ X0 )
        = $true )
    & ( ! [X1: $i] :
          ( $true
          = ( cQ @ X1 ) )
      | ( ( cP @ a )
       != $true ) ) ),
    inference(rectify,[],[f6]) ).

thf(f8,plain,
    ! [X1: $i] :
      ( ( $true
        = ( cQ @ X1 ) )
      | ( ( cP @ a )
       != $true ) ),
    inference(cnf_transformation,[],[f7]) ).

thf(f9,plain,
    ! [X0: $i] :
      ( ( cP @ X0 )
      = $true ),
    inference(cnf_transformation,[],[f7]) ).

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

thf(f14,definition,
    ( spl0_1
  <=> ( ( cP @ a )
      = $true ) ),
    introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).

thf(f16,plain,
    ( ( ( cP @ a )
     != $true )
    | spl0_1 ),
    inference(avatar_component_clause,[],[f14]) ).

thf(f18,definition,
    ( spl0_2
  <=> ! [X1: $i] :
        ( $true
        = ( cQ @ X1 ) ) ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

thf(f19,plain,
    ( ! [X1: $i] :
        ( $true
        = ( cQ @ X1 ) )
    | ~ spl0_2 ),
    inference(avatar_component_clause,[],[f18]) ).

thf(f20,plain,
    ( ~ spl0_1
    | spl0_2 ),
    inference(avatar_split_clause,[],[f8,f18,f14]) ).

thf(f21,plain,
    ( ( $true != $true )
    | spl0_1 ),
    inference(constrained_superposition,[],[f16,f9]) ).

thf(f22,plain,
    ( $false
    | spl0_1 ),
    inference(trivial_inequality_removal,[],[f21]) ).

thf(f23,plain,
    spl0_1,
    inference(avatar_contradiction_clause,[],[f22]) ).

thf(f24,plain,
    ( ( $true != $true )
    | ~ spl0_2 ),
    inference(constrained_superposition,[],[f10,f19]) ).

thf(f25,plain,
    ( $false
    | ~ spl0_2 ),
    inference(trivial_inequality_removal,[],[f24]) ).

thf(f26,plain,
    ~ spl0_2,
    inference(avatar_contradiction_clause,[],[f25]) ).

cnf(s1,plain,
    ( ~ spl0_1
    | spl0_2 ),
    inference(sat_conversion,[],[f20]) ).

cnf(s2,plain,
    spl0_1,
    inference(sat_conversion,[],[f23]) ).

cnf(s3,plain,
    ~ spl0_2,
    inference(sat_conversion,[],[f26]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : SYO134^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.24/0.27  % Computer : n003.cluster.edu
% 0.24/0.27  % Model    : x86_64 x86_64
% 0.24/0.27  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.24/0.27  % Memory   : 8046.5625MB
% 0.24/0.27  % OS       : Linux 6.8.0-71-generic
% 0.24/0.27  % CPULimit : 300
% 0.24/0.27  % WCLimit  : 300
% 0.24/0.27  % DateTime : Tue Sep 29 16:36:44 UTC 2026
% 0.24/0.28  % CPUTime  : 
% 0.24/0.28  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.24/0.31  Running first-order model finding
% 0.24/0.31  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.24/0.36  % (2717175)Will run a generic schedule for satisfiability detection.
% 0.24/0.36  % (2717180)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3157210253_3000 on theBenchmark for (3000ds/0Mi)
% 0.24/0.36  % Exception at run slice level
% 0.24/0.36  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.24/0.36  % (2717181)% WARNING: option uhcvi not known.
% 0.24/0.36  % (2717186)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1519268801:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_3000 on theBenchmark for (3000ds/159Mi)
% 0.24/0.36  % (2717185)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=809482733:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 0.24/0.36  % (2717181)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2633944375:i=135531:add=off:rawr=on_3000 on theBenchmark for (3000ds/135531Mi)
% 0.24/0.36  % (2717182)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2841150196:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 0.24/0.36  % (2717181)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.24/0.36  % (2717183)dis+10_1_sil=32000:sp=arity:random_seed=1830689486:i=103:fgj=on_3000 on theBenchmark for (3000ds/103Mi)
% 0.24/0.36  % (2717184)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2844953087:i=116_3000 on theBenchmark for (3000ds/116Mi)
% 0.24/0.36  % (2717181)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.24/0.36  % (2717184)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.24/0.36  % (2717185) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2717175-2717185"...
% 0.24/0.36  % (2717186) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2717175-2717186"...
% 0.24/0.36  % (2717182) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2717175-2717182"...
% 0.24/0.36  % (2717181) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2717175-2717181"...
% 0.24/0.36  % (2717183) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2717175-2717183"...
% 0.24/0.36  % (2717184) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2717175-2717184"...
% 0.24/0.36  % (2717186)...printing done.
% 0.24/0.36  % (2717182)...printing done.
% 0.24/0.36  % (2717181)...printing done.
% 0.24/0.36  % (2717185)...printing done.
% 0.24/0.36  % (2717183)...printing done.
% 0.24/0.36  % (2717184)...printing done.
% 0.24/0.36  % (2717186)Refutation found. Thanks to Tanya!
% 0.24/0.36  % SZS status Theorem for theBenchmark
% 0.24/0.36  % SZS output start Proof for theBenchmark
% See solution above
% 0.24/0.36  % (2717186)------------------------------
% 0.24/0.36  % (2717186)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.24/0.36  % (2717186)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.24/0.36  % (2717186)CaDiCaL version: 2.1.3
% 0.24/0.36  % (2717186)Termination reason: Refutation
% 0.24/0.36  % (2717186)Time elapsed: 0.003 s
% 0.24/0.36  % (2717186)Peak memory usage: 12 MB
% 0.24/0.36  % (2717186)Instructions burned: 1 (million)
% 0.24/0.36  % (2717175)Success in time 0.04 s
% 0.24/0.36  % Vampire exiting
%------------------------------------------------------------------------------