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

% Computer : n002.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 07:46:06 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
thf(type_def_5,type,
    'type/realax/real': $tType ).

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

thf(func_def_0,type,
    'const/trivia/I': 
      !>[X0: $tType] : ( X0 > X0 ) ).

thf(func_def_1,type,
    'const/iterate/polynomial_function': ( 'type/realax/real' > 'type/realax/real' ) > $o ).

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

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

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

thf(f1,axiom,
    ( 'const/iterate/polynomial_function'
    @ ^ [X0: 'type/realax/real'] : X0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/iterate/POLYNOMIAL_FUNCTION_ID_') ).

thf(f2,axiom,
    ! [X0: $tType] :
      ( 'const/trivia/I'
      @ ( X0
        = ( ^ [X1: X0] : X1 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/trivia/I_DEF_') ).

thf(f3,conjecture,
    'const/iterate/polynomial_function' @ 'const/trivia/I' @ 'type/realax/real',
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/iterate/POLYNOMIAL_FUNCTION_I_') ).

thf(f4,negated_conjecture,
    ~ ( 'const/iterate/polynomial_function' @ 'const/trivia/I' @ 'type/realax/real' ),
    inference(negated_conjecture,[status(cth)],[f3]) ).

thf(f5,plain,
    ( 'const/iterate/polynomial_function'
    @ ^ [X0: 'type/realax/real'] : X0 ),
    inference(rectify,[],[f1]) ).

thf(f6,plain,
    ( ( 'const/iterate/polynomial_function'
      @ ^ [Y0: 'type/realax/real'] : Y0 )
    = $true ),
    inference(fool_elimination,[],[f5]) ).

thf(f7,plain,
    ! [X0: $tType] :
      ( 'const/trivia/I'
      @ ( X0
        = ( ^ [Y0: X0] : Y0 ) ) ),
    inference(fool_elimination,[],[f2]) ).

thf(f8,plain,
    ~ ( 'const/iterate/polynomial_function' @ 'const/trivia/I' @ 'type/realax/real' ),
    inference(rectify,[],[f4]) ).

thf(f9,plain,
    ( ( 'const/iterate/polynomial_function' @ 'const/trivia/I' @ 'type/realax/real' )
   != $true ),
    inference(fool_elimination,[],[f8]) ).

thf(f10,plain,
    ( ( 'const/iterate/polynomial_function' @ 'const/trivia/I' @ 'type/realax/real' )
   != $true ),
    inference(flattening,[],[f9]) ).

thf(f11,plain,
    ( ( 'const/iterate/polynomial_function'
      @ ^ [Y0: 'type/realax/real'] : Y0 )
    = $true ),
    inference(cnf_transformation,[],[f6]) ).

thf(f12,plain,
    ! [X0: $tType] :
      ( 'const/trivia/I'
      @ ( X0
        = ( ^ [Y0: X0] : Y0 ) ) ),
    inference(cnf_transformation,[],[f7]) ).

thf(f13,plain,
    ( ( 'const/iterate/polynomial_function' @ 'const/trivia/I' @ 'type/realax/real' )
   != $true ),
    inference(cnf_transformation,[],[f10]) ).

thf(f16,plain,
    ( ( 'const/iterate/polynomial_function'
      @ ^ [Y0: 'type/realax/real'] : Y0 )
   != $true ),
    inference(definition_unfolding,[],[f13,f12]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : ANA123^1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.19  % Computer : n002.cluster.edu
% 0.10/0.19  % Model    : x86_64 x86_64
% 0.10/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.19  % Memory   : 8046.5625MB
% 0.10/0.19  % OS       : Linux 6.8.0-71-generic
% 0.10/0.19  % CPULimit : 300
% 0.10/0.19  % WCLimit  : 300
% 0.10/0.19  % DateTime : Tue Sep 29 17:47:38 UTC 2026
% 0.10/0.19  % CPUTime  : 
% 0.10/0.19  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.22  Running first-order model finding
% 0.10/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.20/0.26  % (1630757)Will run a generic schedule for satisfiability detection.
% 0.20/0.26  % (1630762)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2538915607_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.26  % Exception at run slice level
% 0.20/0.26  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.26  % (1630763)% WARNING: option uhcvi not known.
% 0.20/0.26  % (1630763)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=764680416:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.26  % (1630764)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1790437992:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.26  % (1630765)dis+10_1_sil=32000:sp=arity:random_seed=3260320551:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.26  % (1630766)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2627353519:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.26  % (1630763)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.26  % (1630763)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.20/0.26  % (1630768)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=18896693:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.26  % (1630766)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.26  % (1630767)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=914749539:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.26  % (1630764) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1630757-1630764"...
% 0.20/0.26  % (1630766) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1630757-1630766"...
% 0.20/0.26  % (1630763) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1630757-1630763"...
% 0.20/0.26  % (1630765) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1630757-1630765"...
% 0.20/0.26  % (1630767) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1630757-1630767"...
% 0.20/0.26  % (1630768) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1630757-1630768"...
% 0.20/0.26  % (1630764)...printing done.
% 0.20/0.26  % (1630770)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2500224722:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.20/0.26  % (1630766)...printing done.
% 0.20/0.26  % (1630763)...printing done.
% 0.20/0.26  % (1630765)...printing done.
% 0.20/0.26  % Exception at run slice level
% 0.20/0.26  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.26  % (1630767)...printing done.
% 0.20/0.26  % (1630768)...printing done.
% 0.20/0.26  % (1630764)Refutation found. Thanks to Tanya!
% 0.20/0.26  % SZS status Theorem for theBenchmark
% 0.20/0.26  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.26  % (1630764)------------------------------
% 0.20/0.26  % (1630764)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.26  % (1630764)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.26  % (1630764)CaDiCaL version: 2.1.3
% 0.20/0.26  % (1630764)Termination reason: Refutation
% 0.20/0.26  % (1630764)Time elapsed: 0.001 s
% 0.20/0.26  % (1630764)Peak memory usage: 11 MB
% 0.20/0.26  % (1630757)Success in time 0.032 s
% 0.20/0.26  % Vampire exiting
%------------------------------------------------------------------------------