↑ 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  : SEV232^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 : n011.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:39:11 AM UTC 2026

% Result   : Theorem 0.18s 0.26s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    1
% Syntax   : Number of formulae    :    7 (   7 unt;   0 typ;   0 def)
%            Number of atoms       :   43 (   6 equ;   0 cnn)
%            Maximal formula atoms :    1 (   6 avg)
%            Number of connectives :  137 (   5   ~;   0   |;  12   &;  84   @)
%                                         (   0 <=>;  24  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    2 (   2 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :  114 ( 114   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   13 (  10 usr;   2 con; 0-4 aty)
%                                         (  12  !!;   0  ??;   0 @@+;   0 @@-)
%            Number of variables   :   36 (  24   ^;  12   !;   0   ?;  36   :)

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

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

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

thf(func_def_3,type,
    vPI: 
      !>[X0: $tType] : ( ( X0 > $o ) > $o ) ).

thf(func_def_4,type,
    vIMP: $o > $o > $o ).

thf(func_def_5,type,
    vAND: $o > $o > $o ).

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

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

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

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

thf(f1,conjecture,
    ( ( ^ [X0: ( $i > $o ) > $o] :
        ! [X1: ( ( $i > $o ) > $o ) > $o] :
          ( ( ! [X2: ( $i > $o ) > $o] :
                ( ( X1 @ X2 )
               => ( X1 @ ( cS @ X2 ) ) )
            & ( X1 @ c0 ) )
         => ( X1 @ X0 ) ) )
    = ( ^ [X3: ( $i > $o ) > $o] :
        ! [X4: ( ( $i > $o ) > $o ) > $o] :
          ( ( ! [X2: ( $i > $o ) > $o] :
                ( ( X4 @ X2 )
               => ( X4 @ ( cS @ X2 ) ) )
            & ( X4 @ c0 ) )
         => ( X4 @ X3 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cX6007_pme) ).

thf(f2,negated_conjecture,
    ( ( ^ [X0: ( $i > $o ) > $o] :
        ! [X1: ( ( $i > $o ) > $o ) > $o] :
          ( ( ! [X2: ( $i > $o ) > $o] :
                ( ( X1 @ X2 )
               => ( X1 @ ( cS @ X2 ) ) )
            & ( X1 @ c0 ) )
         => ( X1 @ X0 ) ) )
   != ( ^ [X3: ( $i > $o ) > $o] :
        ! [X4: ( ( $i > $o ) > $o ) > $o] :
          ( ( ! [X2: ( $i > $o ) > $o] :
                ( ( X4 @ X2 )
               => ( X4 @ ( cS @ X2 ) ) )
            & ( X4 @ c0 ) )
         => ( X4 @ X3 ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

thf(f3,plain,
    ( ( ^ [X0: ( $i > $o ) > $o] :
        ! [X1: ( ( $i > $o ) > $o ) > $o] :
          ( ( ! [X2: ( $i > $o ) > $o] :
                ( ( X1 @ X2 )
               => ( X1 @ ( cS @ X2 ) ) )
            & ( X1 @ c0 ) )
         => ( X1 @ X0 ) ) )
   != ( ^ [X3: ( $i > $o ) > $o] :
        ! [X4: ( ( $i > $o ) > $o ) > $o] :
          ( ( ! [X5: ( $i > $o ) > $o] :
                ( ( X4 @ X5 )
               => ( X4 @ ( cS @ X5 ) ) )
            & ( X4 @ c0 ) )
         => ( X4 @ X3 ) ) ) ),
    inference(rectify,[],[f2]) ).

thf(f4,plain,
    ( ( ^ [Y0: ( $i > $o ) > $o] :
          ( !! @ ( ( ( $i > $o ) > $o ) > $o )
          @ ^ [Y1: ( ( $i > $o ) > $o ) > $o] :
              ( ( ( Y1 @ c0 )
                & ( !! @ ( ( $i > $o ) > $o )
                  @ ^ [Y2: ( $i > $o ) > $o] :
                      ( ( Y1 @ Y2 )
                     => ( Y1 @ ( cS @ Y2 ) ) ) ) )
             => ( Y1 @ Y0 ) ) ) )
   != ( ^ [Y0: ( $i > $o ) > $o] :
          ( !! @ ( ( ( $i > $o ) > $o ) > $o )
          @ ^ [Y1: ( ( $i > $o ) > $o ) > $o] :
              ( ( ( Y1 @ c0 )
                & ( !! @ ( ( $i > $o ) > $o )
                  @ ^ [Y2: ( $i > $o ) > $o] :
                      ( ( Y1 @ Y2 )
                     => ( Y1 @ ( cS @ Y2 ) ) ) ) )
             => ( Y1 @ Y0 ) ) ) ) ),
    inference(fool_elimination,[],[f3]) ).

thf(f5,plain,
    ( ( ^ [Y0: ( $i > $o ) > $o] :
          ( !! @ ( ( ( $i > $o ) > $o ) > $o )
          @ ^ [Y1: ( ( $i > $o ) > $o ) > $o] :
              ( ( ( Y1 @ c0 )
                & ( !! @ ( ( $i > $o ) > $o )
                  @ ^ [Y2: ( $i > $o ) > $o] :
                      ( ( Y1 @ Y2 )
                     => ( Y1 @ ( cS @ Y2 ) ) ) ) )
             => ( Y1 @ Y0 ) ) ) )
   != ( ^ [Y0: ( $i > $o ) > $o] :
          ( !! @ ( ( ( $i > $o ) > $o ) > $o )
          @ ^ [Y1: ( ( $i > $o ) > $o ) > $o] :
              ( ( ( Y1 @ c0 )
                & ( !! @ ( ( $i > $o ) > $o )
                  @ ^ [Y2: ( $i > $o ) > $o] :
                      ( ( Y1 @ Y2 )
                     => ( Y1 @ ( cS @ Y2 ) ) ) ) )
             => ( Y1 @ Y0 ) ) ) ) ),
    inference(flattening,[],[f4]) ).

thf(f6,plain,
    ( ( ^ [Y0: ( $i > $o ) > $o] :
          ( !! @ ( ( ( $i > $o ) > $o ) > $o )
          @ ^ [Y1: ( ( $i > $o ) > $o ) > $o] :
              ( ( ( Y1 @ c0 )
                & ( !! @ ( ( $i > $o ) > $o )
                  @ ^ [Y2: ( $i > $o ) > $o] :
                      ( ( Y1 @ Y2 )
                     => ( Y1 @ ( cS @ Y2 ) ) ) ) )
             => ( Y1 @ Y0 ) ) ) )
   != ( ^ [Y0: ( $i > $o ) > $o] :
          ( !! @ ( ( ( $i > $o ) > $o ) > $o )
          @ ^ [Y1: ( ( $i > $o ) > $o ) > $o] :
              ( ( ( Y1 @ c0 )
                & ( !! @ ( ( $i > $o ) > $o )
                  @ ^ [Y2: ( $i > $o ) > $o] :
                      ( ( Y1 @ Y2 )
                     => ( Y1 @ ( cS @ Y2 ) ) ) ) )
             => ( Y1 @ Y0 ) ) ) ) ),
    inference(cnf_transformation,[],[f5]) ).

thf(f9,plain,
    $false,
    inference(trivial_inequality_removal,[],[f6]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEV232^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.18  % Computer : n011.cluster.edu
% 0.09/0.18  % Model    : x86_64 x86_64
% 0.09/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18  % Memory   : 8046.5625MB
% 0.09/0.18  % OS       : Linux 6.8.0-71-generic
% 0.09/0.18  % CPULimit : 300
% 0.09/0.18  % WCLimit  : 300
% 0.09/0.18  % DateTime : Tue Sep 29 15:23:31 UTC 2026
% 0.09/0.18  % CPUTime  : 
% 0.09/0.18  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.21  Running first-order model finding
% 0.09/0.21  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.18/0.26  % (215863)Will run a generic schedule for satisfiability detection.
% 0.18/0.26  % (215868)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3326402580_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.26  % Exception at run slice level
% 0.18/0.26  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.18/0.26  % (215869)% WARNING: option uhcvi not known.
% 0.18/0.26  % (215870)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3333518643:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.26  % (215871)dis+10_1_sil=32000:sp=arity:random_seed=1411301537:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.26  % (215869)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=625934461:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.26  % (215872)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2345097746:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.26  % (215869)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.18/0.26  % (215869)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.18/0.26  % (215872)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.18/0.26  % (215871) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-215863-215871"...
% 0.18/0.26  % (215870) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-215863-215870"...
% 0.18/0.26  % (215869) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-215863-215869"...
% 0.18/0.26  % (215872) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-215863-215872"...
% 0.18/0.26  % (215871)...printing done.
% 0.18/0.26  % (215870)...printing done.
% 0.18/0.26  % (215869)...printing done.
% 0.18/0.26  % (215872)...printing done.
% 0.18/0.26  % (215870)Refutation found. Thanks to Tanya!
% 0.18/0.26  % SZS status Theorem for theBenchmark
% 0.18/0.26  % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.26  % (215870)------------------------------
% 0.18/0.26  % (215870)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.26  % (215870)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.26  % (215870)CaDiCaL version: 2.1.3
% 0.18/0.26  % (215870)Termination reason: Refutation
% 0.18/0.26  % (215870)Time elapsed: 0.002 s
% 0.18/0.26  % (215870)Peak memory usage: 11 MB
% 0.18/0.26  % (215870)Instructions burned: 1 (million)
% 0.18/0.26  % (215863)Success in time 0.037 s
% 0.18/0.26  % Vampire exiting
%------------------------------------------------------------------------------