↑ 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  : SET634^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 : n012.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:46 AM UTC 2026

% Result   : Theorem 0.08s 0.15s
% Output   : Refutation 0.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    1
% Syntax   : Number of formulae    :    8 (   8 unt;   0 typ;   0 def)
%            Number of atoms       :   20 (   7 equ;   0 cnn)
%            Maximal formula atoms :    1 (   2 avg)
%            Number of connectives :   90 (  20   ~;   0   |;  28   &;  42   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   4 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :   15 (  15   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   10 (   8 usr;   1 con; 0-4 aty)
%            Number of variables   :   29 (  14   ^;  12   !;   3   ?;  29   :)

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

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

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

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

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

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

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

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

thf(func_def_7,type,
    sK2: a > $o ).

thf(f1,conjecture,
    ! [X0: a > $o,X1: a > $o,X2: a > $o] :
      ( ( ^ [X3: a] :
            ( ~ ( X2 @ X3 )
            & ( X1 @ X3 )
            & ( X0 @ X3 ) ) )
      = ( ^ [X3: a] :
            ( ~ ( X2 @ X3 )
            & ( X1 @ X3 )
            & ( X0 @ X3 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cBOOL_PROP_116_pme) ).

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

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

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

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

thf(f6,plain,
    ( ( ^ [Y0: a] :
          ( ( sK0 @ Y0 )
          & ( sK1 @ Y0 )
          & ~ ( sK2 @ Y0 ) ) )
   != ( ^ [Y0: a] :
          ( ( sK0 @ Y0 )
          & ( sK1 @ Y0 )
          & ~ ( sK2 @ Y0 ) ) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f5]) ).

thf(f7,plain,
    ( ( ^ [Y0: a] :
          ( ( sK0 @ Y0 )
          & ( sK1 @ Y0 )
          & ~ ( sK2 @ Y0 ) ) )
   != ( ^ [Y0: a] :
          ( ( sK0 @ Y0 )
          & ( sK1 @ Y0 )
          & ~ ( sK2 @ Y0 ) ) ) ),
    inference(cnf_transformation,[],[f6]) ).

thf(f10,plain,
    $false,
    inference(trivial_inequality_removal,[],[f7]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : SET634^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.02  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.00/0.10  % Computer : n012.cluster.edu
% 0.00/0.10  % Model    : x86_64 x86_64
% 0.00/0.10  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.10  % Memory   : 8046.5625MB
% 0.00/0.10  % OS       : Linux 6.8.0-71-generic
% 0.00/0.10  % CPULimit : 300
% 0.00/0.10  % WCLimit  : 300
% 0.00/0.10  % DateTime : Tue Sep 29 13:39:49 UTC 2026
% 0.00/0.10  % CPUTime  : 
% 0.00/0.10  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.12  Running first-order model finding
% 0.08/0.12  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.08/0.15  % (114584)Will run a generic schedule for satisfiability detection.
% 0.08/0.15  % (114590)% WARNING: option uhcvi not known.
% 0.08/0.15  % (114591)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2812268828:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.08/0.15  % (114592)dis+10_1_sil=32000:sp=arity:random_seed=1356084380:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.08/0.15  % (114589)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=995700055_2999 on theBenchmark for (2999ds/0Mi)
% 0.08/0.15  % (114590)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=294325683:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.08/0.15  % (114593)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1063389228:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.08/0.15  % (114594)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1784765800:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.08/0.15  % (114590)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.08/0.15  % Exception at run slice level
% 0.08/0.15  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.08/0.15  % (114590)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.08/0.15  % (114595)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=750199095:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.08/0.15  % (114593)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.08/0.15  % (114591) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-114584-114591"...
% 0.08/0.15  % (114592) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-114584-114592"...
% 0.08/0.15  % (114590) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-114584-114590"...
% 0.08/0.15  % (114593) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-114584-114593"...
% 0.08/0.15  % (114594) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-114584-114594"...
% 0.08/0.15  % (114595) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-114584-114595"...
% 0.08/0.15  % (114592)...printing done.
% 0.08/0.15  % (114591)...printing done.
% 0.08/0.15  % (114590)...printing done.
% 0.08/0.15  % (114593)...printing done.
% 0.08/0.15  % (114594)...printing done.
% 0.08/0.15  % (114595)...printing done.
% 0.08/0.15  % (114592)Refutation found. Thanks to Tanya!
% 0.08/0.15  % SZS status Theorem for theBenchmark
% 0.08/0.15  % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.15  % (114592)------------------------------
% 0.08/0.15  % (114592)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.15  % (114592)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.15  % (114592)CaDiCaL version: 2.1.3
% 0.08/0.15  % (114592)Termination reason: Refutation
% 0.08/0.15  % (114592)Time elapsed: 0.0000 s
% 0.08/0.15  % (114592)Peak memory usage: 11 MB
% 0.08/0.15  % (114592)Instructions burned: 1 (million)
% 0.08/0.15  % (114584)Success in time 0.03 s
% 0.08/0.16  % Vampire exiting
%------------------------------------------------------------------------------