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

% Computer : n008.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:50:24 AM UTC 2026

% Result   : Theorem 0.20s 0.28s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   15 (  10 unt;   0 typ;   0 def)
%            Number of atoms       :   61 (   9 equ;   0 cnn)
%            Maximal formula atoms :    3 (   4 avg)
%            Number of connectives :   67 (  27   ~;   0   |;   0   &;  40   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   10 (   7 usr;   2 con; 0-4 aty)
%            Number of variables   :   12 (  12   ^;   0   !;   0   ?;  12   :)

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

thf(func_def_0,type,
    p: ( $o > $o ) > ( $o > $o ) > $o ).

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

thf(func_def_2,type,
    g: $o > $o ).

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

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

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

thf(f1,axiom,
    ( p
    @ ^ [X0: $o] :
        ( f
        @ ~ ~ X0 )
    @ g ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pfg) ).

thf(f2,conjecture,
    ( p @ f
    @ ^ [X0: $o] :
        ( g
        @ ~ ~ X0 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pfgc) ).

thf(f3,negated_conjecture,
    ~ ( p @ f
      @ ^ [X0: $o] :
          ( g
          @ ~ ~ X0 ) ),
    inference(negated_conjecture,[status(cth)],[f2]) ).

thf(f4,plain,
    ( p
    @ ^ [X0: $o] :
        ( f
        @ ~ ~ X0 )
    @ g ),
    inference(rectify,[],[f1]) ).

thf(f5,plain,
    ( ( p
      @ ^ [Y0: $o] :
          ( f
          @ ~ ~ Y0 )
      @ g )
    = $true ),
    inference(fool_elimination,[],[f4]) ).

thf(f6,plain,
    ~ ( p @ f
      @ ^ [X0: $o] :
          ( g
          @ ~ ~ X0 ) ),
    inference(rectify,[],[f3]) ).

thf(f7,plain,
    ( $true
   != ( p @ f
      @ ^ [Y0: $o] :
          ( g
          @ ~ ~ Y0 ) ) ),
    inference(fool_elimination,[],[f6]) ).

thf(f8,plain,
    ( $true
   != ( p @ f
      @ ^ [Y0: $o] :
          ( g
          @ ~ ~ Y0 ) ) ),
    inference(flattening,[],[f7]) ).

thf(f9,plain,
    ( ( p
      @ ^ [Y0: $o] :
          ( f
          @ ~ ~ Y0 )
      @ g )
    = $true ),
    inference(cnf_transformation,[],[f5]) ).

thf(f10,plain,
    ( $true
   != ( p @ f
      @ ^ [Y0: $o] :
          ( g
          @ ~ ~ Y0 ) ) ),
    inference(cnf_transformation,[],[f8]) ).

thf(f13,plain,
    ( $true
   != ( p @ f
      @ ^ [Y0: $o] : ( g @ Y0 ) ) ),
    inference(boolean_simplification,[],[f10]) ).

thf(f14,plain,
    ( $true
   != ( p @ f @ g ) ),
    inference(beta-eta_normalization,[],[f13]) ).

thf(f15,plain,
    ( $true
    = ( p
      @ ^ [Y0: $o] : ( f @ Y0 )
      @ g ) ),
    inference(boolean_simplification,[],[f9]) ).

thf(f16,plain,
    ( $true
    = ( p @ f @ g ) ),
    inference(beta-eta_normalization,[],[f15]) ).

thf(f17,plain,
    $false,
    inference(global_subsumption,[],[f16,f14]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYO549^1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.19  % Computer : n008.cluster.edu
% 0.08/0.19  % Model    : x86_64 x86_64
% 0.08/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19  % Memory   : 8046.5625MB
% 0.08/0.19  % OS       : Linux 6.8.0-71-generic
% 0.08/0.19  % CPULimit : 300
% 0.08/0.19  % WCLimit  : 300
% 0.08/0.19  % DateTime : Tue Sep 29 17:15:09 UTC 2026
% 0.08/0.20  % CPUTime  : 
% 0.08/0.20  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.23  Running first-order model finding
% 0.08/0.23  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.20/0.28  % (3453135)Will run a generic schedule for satisfiability detection.
% 0.20/0.28  % (3453140)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1697414927_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.28  % Exception at run slice level
% 0.20/0.28  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.28  % (3453141)% WARNING: option uhcvi not known.
% 0.20/0.28  % (3453141)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2373200363:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.28  % (3453142)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1144673951:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.28  % (3453143)dis+10_1_sil=32000:sp=arity:random_seed=1616003330:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.28  % (3453144)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3903227020:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.28  % (3453141)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.28  % (3453141)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.20/0.28  % (3453144)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.28  % (3453142) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3453135-3453142"...
% 0.20/0.28  % (3453144) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3453135-3453144"...
% 0.20/0.28  % (3453143) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3453135-3453143"...
% 0.20/0.28  % (3453141) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3453135-3453141"...
% 0.20/0.28  % (3453142)...printing done.
% 0.20/0.28  % (3453144)...printing done.
% 0.20/0.28  % (3453143)...printing done.
% 0.20/0.28  % (3453141)...printing done.
% 0.20/0.28  % (3453148)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1859846587:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.20/0.28  % (3453145)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=60295630:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.28  % (3453142)Refutation found. Thanks to Tanya!
% 0.20/0.28  % SZS status Theorem for theBenchmark
% 0.20/0.28  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.28  % (3453142)------------------------------
% 0.20/0.28  % (3453142)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.28  % (3453142)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.28  % (3453142)CaDiCaL version: 2.1.3
% 0.20/0.28  % (3453142)Termination reason: Refutation
% 0.20/0.28  % (3453142)Time elapsed: 0.001 s
% 0.20/0.28  % (3453142)Peak memory usage: 11 MB
% 0.20/0.28  % (3453142)Instructions burned: 1 (million)
% 0.20/0.28  % (3453135)Success in time 0.043 s
% 0.20/0.28  % Vampire exiting
%------------------------------------------------------------------------------