↑ 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  : LCL773_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 : n005.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 12:00:32 PM UTC 2026

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

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

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

tff(type_def_7,type,
    dB: $tType ).

tff(type_def_8,type,
    list: $tType > $tType ).

tff(type_def_9,type,
    nat: $tType ).

tff(type_def_10,type,
    char: $tType ).

tff(type_def_11,type,
    literal: $tType ).

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

tff(func_def_0,type,
    sgn_sgn: 
      !>[X0: $tType] : ( X0 > X0 ) ).

tff(func_def_1,type,
    zero_zero: 
      !>[X0: $tType] : X0 ).

tff(func_def_2,type,
    bool_size: bool > nat ).

tff(func_def_3,type,
    if: 
      !>[X0: $tType] : ( ( bool * X0 * X0 ) > X0 ) ).

tff(func_def_4,type,
    it: fun(dB,bool) ).

tff(func_def_5,type,
    abs: dB > dB ).

tff(func_def_6,type,
    app: fun(dB,fun(dB,dB)) ).

tff(func_def_7,type,
    var: nat > dB ).

tff(func_def_8,type,
    dB_case: 
      !>[X0: $tType] : ( ( fun(nat,X0) * fun(dB,fun(dB,X0)) * fun(dB,X0) * dB ) > X0 ) ).

tff(func_def_9,type,
    dB_rec: 
      !>[X0: $tType] : ( ( fun(nat,X0) * fun(dB,fun(dB,fun(X0,fun(X0,X0)))) * fun(dB,fun(X0,X0)) * dB ) > X0 ) ).

tff(func_def_10,type,
    dB_size: dB > nat ).

tff(func_def_11,type,
    lift: ( dB * nat ) > dB ).

tff(func_def_12,type,
    liftn: ( nat * dB * nat ) > dB ).

tff(func_def_13,type,
    subst: ( dB * dB * nat ) > dB ).

tff(func_def_14,type,
    substn: ( dB * dB * nat ) > dB ).

tff(func_def_15,type,
    foldl: 
      !>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X0)) * X0 * list(X1) ) > X0 ) ).

tff(func_def_16,type,
    nat_size: nat > nat ).

tff(func_def_17,type,
    semiring_1_of_nat: 
      !>[X0: $tType] : ( nat > X0 ) ).

tff(func_def_18,type,
    size_size: 
      !>[X0: $tType] : ( X0 > nat ) ).

tff(func_def_19,type,
    char_size: char > nat ).

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

tff(func_def_21,type,
    fFalse: bool ).

tff(func_def_22,type,
    fTrue: bool ).

tff(func_def_23,type,
    i: nat ).

tff(func_def_24,type,
    r: dB ).

tff(func_def_25,type,
    sK0: ( dB * dB ) > dB ).

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

tff(func_def_27,type,
    sK2: ( dB * dB * dB ) > dB ).

tff(func_def_28,type,
    sK3: ( dB * dB * dB ) > dB ).

tff(func_def_29,type,
    sK4: ( dB * dB * dB ) > dB ).

tff(func_def_30,type,
    sK5: dB > dB ).

tff(func_def_31,type,
    sK6: dB > dB ).

tff(func_def_32,type,
    sK7: dB > list(dB) ).

tff(func_def_33,type,
    sK8: dB > dB ).

tff(func_def_34,type,
    sK9: dB > list(dB) ).

tff(func_def_35,type,
    sK10: dB > nat ).

tff(func_def_36,type,
    sK11: int > nat ).

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

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

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

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

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

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

tff(pred_def_7,type,
    beta: ( dB * dB ) > $o ).

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

tff(pred_def_9,type,
    ord_less: 
      !>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).

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

tff(f2,axiom,
    ! [X0: nat,X1: nat,X2: dB] :
      ( pp(aa(dB,bool,it,X2))
     => pp(aa(dB,bool,it,subst(X2,var(X1),X0))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1_subst__Var__IT) ).

tff(f119,axiom,
    pp(aa(dB,bool,it,r)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).

tff(f121,conjecture,
    pp(aa(dB,bool,it,subst(r,var(i),zero_zero(nat)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_2) ).

tff(f122,negated_conjecture,
    ~ pp(aa(dB,bool,it,subst(r,var(i),zero_zero(nat)))),
    inference(negated_conjecture,[status(cth)],[f121]) ).

tff(f126,plain,
    ~ pp(aa(dB,bool,it,subst(r,var(i),zero_zero(nat)))),
    inference(flattening,[],[f122]) ).

tff(f127,plain,
    ! [X0: nat,X1: nat,X2: dB] :
      ( pp(aa(dB,bool,it,subst(X2,var(X1),X0)))
      | ~ pp(aa(dB,bool,it,X2)) ),
    inference(ennf_transformation,[],[f2]) ).

tff(f170,plain,
    ! [X2: dB,X0: nat,X1: nat] :
      ( pp(aa(dB,bool,it,subst(X2,var(X1),X0)))
      | ~ pp(aa(dB,bool,it,X2)) ),
    inference(cnf_transformation,[],[f127]) ).

tff(f334,plain,
    pp(aa(dB,bool,it,r)),
    inference(cnf_transformation,[],[f119]) ).

tff(f336,plain,
    ~ pp(aa(dB,bool,it,subst(r,var(i),zero_zero(nat)))),
    inference(cnf_transformation,[],[f126]) ).

tff(f736,plain,
    ~ pp(aa(dB,bool,it,r)),
    inference(resolution,[],[f170,f336]) ).

tff(f751,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f736,f334]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL773_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.38  % Computer : n005.cluster.edu
% 0.12/0.38  % Model    : x86_64 x86_64
% 0.12/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38  % Memory   : 8046.5625MB
% 0.12/0.38  % OS       : Linux 6.8.0-71-generic
% 0.12/0.38  % CPULimit : 300
% 0.12/0.38  % WCLimit  : 300
% 0.12/0.38  % DateTime : Sun Sep 27 16:47:32 UTC 2026
% 0.12/0.38  % CPUTime  : 
% 0.12/0.38  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.41  Running first-order model finding
% 0.12/0.41  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.12/0.48  % (8765)Will run a generic schedule for satisfiability detection.
% 0.12/0.48  % (8774)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=335825307:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.12/0.48  % (8771)% WARNING: option uhcvi not known.
% 0.12/0.48  % (8771)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2751710732:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.12/0.48  % (8770)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=587327166_2999 on theBenchmark for (2999ds/0Mi)
% 0.12/0.48  % (8772)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3775508629:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.12/0.48  % (8773)dis+10_1_sil=32000:sp=arity:random_seed=3213364083:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.12/0.48  % (8776)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2336552792:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.12/0.48  % (8775)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2200774269:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.12/0.48  % (8774) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-8765-8774"...
% 0.12/0.48  % Exception at run slice level% (8774)...printing done.
% 0.12/0.48  
% 0.12/0.48  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.12/0.48  % (8774)Refutation found. Thanks to Tanya!
% 0.12/0.48  % SZS status Theorem for theBenchmark
% 0.12/0.48  % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.48  % (8774)------------------------------
% 0.12/0.48  % (8774)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.12/0.48  % (8774)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.12/0.48  % (8774)CaDiCaL version: 2.1.3
% 0.12/0.48  % (8774)Termination reason: Refutation
% 0.12/0.48  % (8774)Time elapsed: 0.012 s
% 0.12/0.48  % (8774)Peak memory usage: 12 MB
% 0.12/0.48  % (8774)Instructions burned: 34 (million)
% 0.12/0.48  % (8765)Success in time 0.053 s
% 0.12/0.48  % Vampire exiting
%------------------------------------------------------------------------------