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

% Computer : n020.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 : Tue Sep 29 01:40:22 PM UTC 2026

% Result   : Theorem 0.25s 0.35s
% Output   : Refutation 0.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   10 (  10 unt;   0 typ;   0 def)
%            Number of atoms       :   10 (   0 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    4 (   4   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of types       :    3 (   2 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :   12 (  11 usr;   1 prp; 0-6 aty)
%            Number of functors    :   43 (  43 usr;   5 con; 0-5 aty)
%            Number of variables   :    8 (   8   !;   0   ?;   8   :)

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

tff(type_def_6,type,
    bool: $tType ).

tff(type_def_7,type,
    hoare_28830079triple: $tType > $tType ).

tff(type_def_8,type,
    fun: ( $tType * $tType ) > $tType ).

tff(func_def_0,type,
    combb: 
      !>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,X1) * fun(X2,X0) ) > fun(X2,X1) ) ).

tff(func_def_1,type,
    combc: 
      !>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,fun(X1,X2)) * X1 ) > fun(X0,X2) ) ).

tff(func_def_2,type,
    combk: 
      !>[X0: $tType,X1: $tType] : ( X0 > fun(X1,X0) ) ).

tff(func_def_3,type,
    combs: 
      !>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,fun(X1,X2)) * fun(X0,X1) ) > fun(X0,X2) ) ).

tff(func_def_4,type,
    bot_bot: 
      !>[X0: $tType] : X0 ).

tff(func_def_5,type,
    ord_Least: 
      !>[X0: $tType] : ( fun(X0,bool) > X0 ) ).

tff(func_def_6,type,
    ord_less_eq: 
      !>[X0: $tType] : fun(X0,fun(X0,bool)) ).

tff(func_def_7,type,
    powp: 
      !>[X0: $tType] : ( fun(X0,bool) > fun(fun(X0,bool),bool) ) ).

tff(func_def_8,type,
    collect: 
      !>[X0: $tType] : ( fun(X0,bool) > fun(X0,bool) ) ).

tff(func_def_9,type,
    pow: 
      !>[X0: $tType] : ( fun(X0,bool) > fun(fun(X0,bool),bool) ) ).

tff(func_def_10,type,
    insert: 
      !>[X0: $tType] : ( ( X0 * fun(X0,bool) ) > fun(X0,bool) ) ).

tff(func_def_11,type,
    aa: 
      !>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).

tff(func_def_12,type,
    fFalse: bool ).

tff(func_def_13,type,
    fTrue: bool ).

tff(func_def_14,type,
    fconj: fun(bool,fun(bool,bool)) ).

tff(func_def_15,type,
    fequal: 
      !>[X0: $tType] : fun(X0,fun(X0,bool)) ).

tff(func_def_16,type,
    member: 
      !>[X0: $tType] : fun(X0,fun(fun(X0,bool),bool)) ).

tff(func_def_17,type,
    g: fun(hoare_28830079triple(a),bool) ).

tff(func_def_18,type,
    ga: fun(hoare_28830079triple(a),bool) ).

tff(func_def_19,type,
    sK0: 
      !>[X0: $tType] : ( fun(X0,bool) > X0 ) ).

tff(func_def_20,type,
    sK1: 
      !>[X0: $tType] : ( fun(X0,bool) > X0 ) ).

tff(func_def_21,type,
    sK2: 
      !>[X0: $tType] : ( fun(X0,bool) > X0 ) ).

tff(func_def_22,type,
    sK3: 
      !>[X0: $tType] : ( fun(X0,bool) > X0 ) ).

tff(func_def_23,type,
    sK4: 
      !>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).

tff(func_def_24,type,
    sK5: 
      !>[X0: $tType] : ( ( fun(X0,bool) * fun(X0,bool) ) > X0 ) ).

tff(func_def_25,type,
    sK6: 
      !>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).

tff(func_def_26,type,
    sK7: 
      !>[X0: $tType] : ( ( fun(X0,bool) * fun(X0,bool) ) > X0 ) ).

tff(func_def_27,type,
    sK8: 
      !>[X0: $tType] : ( fun(X0,bool) > X0 ) ).

tff(func_def_28,type,
    sK9: 
      !>[X0: $tType,X1: $tType] : ( fun(X1,X0) > X1 ) ).

tff(func_def_29,type,
    sK10: 
      !>[X0: $tType,X1: $tType] : ( fun(X1,X0) > X1 ) ).

tff(func_def_30,type,
    sK11: 
      !>[X0: $tType,X1: $tType] : ( fun(X1,X0) > X1 ) ).

tff(func_def_31,type,
    sK12: 
      !>[X0: $tType,X1: $tType] : ( fun(X1,X0) > X1 ) ).

tff(func_def_32,type,
    sK13: 
      !>[X0: $tType,X1: $tType] : ( fun(X0,X1) > X0 ) ).

tff(func_def_33,type,
    sK14: 
      !>[X0: $tType,X1: $tType] : ( fun(X0,X1) > X0 ) ).

tff(func_def_34,type,
    sK15: 
      !>[X0: $tType] : ( ( fun(X0,bool) * fun(X0,bool) ) > X0 ) ).

tff(func_def_35,type,
    sK16: 
      !>[X0: $tType,X1: $tType] : ( fun(X0,X1) > X0 ) ).

tff(func_def_36,type,
    sK17: 
      !>[X0: $tType,X1: $tType] : ( fun(X0,X1) > X0 ) ).

tff(func_def_37,type,
    sK18: 
      !>[X0: $tType] : ( fun(X0,bool) > X0 ) ).

tff(func_def_38,type,
    sK19: 
      !>[X0: $tType] : ( fun(X0,bool) > X0 ) ).

tff(func_def_39,type,
    sK20: 
      !>[X0: $tType] : ( ( X0 * fun(X0,bool) ) > X0 ) ).

tff(func_def_40,type,
    sK21: 
      !>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).

tff(pred_def_1,type,
    enum: 
      !>[X0: $tType] : $o ).

tff(pred_def_2,type,
    bot: 
      !>[X0: $tType] : $o ).

tff(pred_def_3,type,
    ord: 
      !>[X0: $tType] : $o ).

tff(pred_def_4,type,
    order: 
      !>[X0: $tType] : $o ).

tff(pred_def_5,type,
    linorder: 
      !>[X0: $tType] : $o ).

tff(pred_def_6,type,
    preorder: 
      !>[X0: $tType] : $o ).

tff(pred_def_7,type,
    wellorder: 
      !>[X0: $tType] : $o ).

tff(pred_def_8,type,
    enum_enum_all: 
      !>[X0: $tType] : ( fun(X0,bool) > $o ) ).

tff(pred_def_9,type,
    hoare_992312373derivs: 
      !>[X0: $tType] : ( ( fun(hoare_28830079triple(X0),bool) * fun(hoare_28830079triple(X0),bool) ) > $o ) ).

tff(pred_def_10,type,
    inv_imagep: 
      !>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X0,bool)) * fun(X1,X0) * X1 * X1 ) > $o ) ).

tff(pred_def_11,type,
    pp: bool > $o ).

tff(f1,axiom,
    ! [X1: $tType,X3: fun(hoare_28830079triple(X1),bool)] : hoare_992312373derivs(X1,X3,bot_bot(fun(hoare_28830079triple(X1),bool))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_empty) ).

tff(f126,conjecture,
    hoare_992312373derivs(a,ga,bot_bot(fun(hoare_28830079triple(a),bool))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_1) ).

tff(f127,negated_conjecture,
    ~ hoare_992312373derivs(a,ga,bot_bot(fun(hoare_28830079triple(a),bool))),
    inference(negated_conjecture,[status(cth)],[f126]) ).

tff(f128,plain,
    ! [X0: $tType,X1: fun(hoare_28830079triple(X0),bool)] : hoare_992312373derivs(X0,X1,bot_bot(fun(hoare_28830079triple(X0),bool))),
    inference(rectify,[],[f1]) ).

tff(f129,plain,
    ~ hoare_992312373derivs(a,ga,bot_bot(fun(hoare_28830079triple(a),bool))),
    inference(flattening,[],[f127]) ).

tff(f278,plain,
    ! [X0: $tType,X1: fun(hoare_28830079triple(X0),bool)] : hoare_992312373derivs(X0,X1,bot_bot(fun(hoare_28830079triple(X0),bool))),
    inference(cnf_transformation,[],[f128]) ).

tff(f442,plain,
    ~ hoare_992312373derivs(a,ga,bot_bot(fun(hoare_28830079triple(a),bool))),
    inference(cnf_transformation,[],[f129]) ).

tff(f483,plain,
    ! [X0: $tType,X1: fun(hoare_28830079triple(X0),bool)] : ~ hoare_992312373derivs(X0,X1,bot_bot(fun(hoare_28830079triple(X0),bool))),
    inference(consistent_polarity_flipping,[],[f278]) ).

tff(f620,plain,
    hoare_992312373derivs(a,ga,bot_bot(fun(hoare_28830079triple(a),bool))),
    inference(consistent_polarity_flipping,[],[f442]) ).

tff(f634,plain,
    $false,
    inference(resolution,[],[f483,f620]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : SWW512_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.08  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.25  % Computer : n020.cluster.edu
% 0.11/0.25  % Model    : x86_64 x86_64
% 0.11/0.25  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.25  % Memory   : 8046.5625MB
% 0.11/0.25  % OS       : Linux 6.8.0-71-generic
% 0.11/0.25  % CPULimit : 300
% 0.11/0.25  % WCLimit  : 300
% 0.11/0.25  % DateTime : Mon Sep 28 14:16:34 UTC 2026
% 0.11/0.26  % CPUTime  : 
% 0.11/0.26  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.25/0.29  Running first-order model finding
% 0.25/0.30  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.25/0.35  % (188830)Will run a generic schedule for satisfiability detection.
% 0.25/0.35  % (188836)% WARNING: option uhcvi not known.
% 0.25/0.35  % (188841)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4245081021:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.25/0.35  % (188836)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4213976399:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.25/0.35  % (188841) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-188830-188841"...
% 0.25/0.35  % (188837)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=427601331:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.25/0.35  % (188835)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2293187869_2999 on theBenchmark for (2999ds/0Mi)
% 0.25/0.35  % (188838)dis+10_1_sil=32000:sp=arity:random_seed=196476905:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.25/0.35  % (188839)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3985133489:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.25/0.35  % (188836) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-188830-188836"...
% 0.25/0.35  % (188841)...printing done.
% 0.25/0.35  % (188840)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3305224642:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.25/0.35  % (188836)...printing done.
% 0.25/0.35  % (188841)Refutation found. Thanks to Tanya!
% 0.25/0.35  % SZS status Theorem for theBenchmark
% 0.25/0.35  % SZS output start Proof for theBenchmark
% See solution above
% 0.25/0.35  % (188841)------------------------------
% 0.25/0.35  % (188841)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.25/0.35  % (188841)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.25/0.35  % (188841)CaDiCaL version: 2.1.3
% 0.25/0.35  % (188841)Termination reason: Refutation
% 0.25/0.35  % (188841)Time elapsed: 0.010 s
% 0.25/0.35  % (188841)Peak memory usage: 12 MB
% 0.25/0.35  % (188841)Instructions burned: 19 (million)
% 0.25/0.35  % (188830)Success in time 0.046 s
% 0.25/0.35  % Vampire exiting
%------------------------------------------------------------------------------