↑ 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  : NUN016_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 : n017.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:26:55 PM UTC 2026

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

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

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

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

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

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

tff(func_def_2,type,
    bit0: int > int ).

tff(func_def_3,type,
    bit1: int > int ).

tff(func_def_4,type,
    pls: int ).

tff(func_def_5,type,
    number_number_of: 
      !>[X0: $tType] : ( int > X0 ) ).

tff(func_def_6,type,
    power_power: 
      !>[X0: $tType] : ( ( X0 * nat ) > X0 ) ).

tff(func_def_7,type,
    fFalse: bool ).

tff(func_def_8,type,
    fTrue: bool ).

tff(func_def_9,type,
    v: int ).

tff(func_def_10,type,
    w: int ).

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

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

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

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

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

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

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

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

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

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

tff(pred_def_11,type,
    no_zero_divisors: 
      !>[X0: $tType] : $o ).

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

tff(pred_def_13,type,
    ring_11004092258visors: 
      !>[X0: $tType] : $o ).

tff(pred_def_14,type,
    linord219039673up_add: 
      !>[X0: $tType] : $o ).

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

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

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

tff(f13,axiom,
    ! [X0: $tType] :
      ( linordered_idom(X0)
     => ! [X1: X0] : ord_less_eq(X0,zero_zero(X0),power_power(X0,X1,number_number_of(nat,bit0(bit1(pls))))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_12_zero__le__power2) ).

tff(f81,axiom,
    ! [X0: int] : ( bit0(X0) = plus_plus(int,X0,X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_80_Bit0__def) ).

tff(f103,axiom,
    linordered_idom(int),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',arity_Int_Oint___Rings_Olinordered__idom) ).

tff(f125,conjecture,
    ord_less_eq(int,zero_zero(int),power_power(int,w,number_number_of(nat,bit0(bit1(pls))))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).

tff(f126,negated_conjecture,
    ~ ord_less_eq(int,zero_zero(int),power_power(int,w,number_number_of(nat,bit0(bit1(pls))))),
    inference(negated_conjecture,[status(cth)],[f125]) ).

tff(f127,plain,
    ~ ord_less_eq(int,zero_zero(int),power_power(int,w,number_number_of(nat,bit0(bit1(pls))))),
    inference(flattening,[],[f126]) ).

tff(f139,plain,
    ! [X0: $tType] :
      ( ! [X1: X0] : ord_less_eq(X0,zero_zero(X0),power_power(X0,X1,number_number_of(nat,bit0(bit1(pls)))))
      | ~ linordered_idom(X0) ),
    inference(ennf_transformation,[],[f13]) ).

tff(f258,plain,
    ! [X0: $tType,X1: X0] :
      ( ord_less_eq(X0,zero_zero(X0),power_power(X0,X1,number_number_of(nat,bit0(bit1(pls)))))
      | ~ linordered_idom(X0) ),
    inference(cnf_transformation,[],[f139]) ).

tff(f362,plain,
    ! [X0: int] : ( bit0(X0) = plus_plus(int,X0,X0) ),
    inference(cnf_transformation,[],[f81]) ).

tff(f394,plain,
    linordered_idom(int),
    inference(cnf_transformation,[],[f103]) ).

tff(f416,plain,
    ~ ord_less_eq(int,zero_zero(int),power_power(int,w,number_number_of(nat,bit0(bit1(pls))))),
    inference(cnf_transformation,[],[f127]) ).

tff(f426,plain,
    ! [X0: $tType,X1: X0] :
      ( ord_less_eq(X0,zero_zero(X0),power_power(X0,X1,number_number_of(nat,plus_plus(int,bit1(pls),bit1(pls)))))
      | ~ linordered_idom(X0) ),
    inference(definition_unfolding,[],[f258,f362]) ).

tff(f477,plain,
    ~ ord_less_eq(int,zero_zero(int),power_power(int,w,number_number_of(nat,plus_plus(int,bit1(pls),bit1(pls))))),
    inference(definition_unfolding,[],[f416,f362]) ).

tff(f1002,plain,
    ~ linordered_idom(int),
    inference(resolution,[],[f426,f477]) ).

tff(f1011,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f1002,f394]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : NUN016_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.09/0.37  % Computer : n017.cluster.edu
% 0.09/0.37  % Model    : x86_64 x86_64
% 0.09/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37  % Memory   : 8046.5625MB
% 0.09/0.37  % OS       : Linux 6.8.0-71-generic
% 0.09/0.37  % CPULimit : 300
% 0.09/0.37  % WCLimit  : 300
% 0.09/0.37  % DateTime : Sun Sep 27 21:46:20 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.40  Running first-order model finding
% 0.09/0.40  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.09/0.46  % (2970303)Will run a generic schedule for satisfiability detection.
% 0.09/0.46  % (2970314)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2222002601:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.09/0.46  % (2970309)% WARNING: option uhcvi not known.
% 0.09/0.46  % (2970312)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4142235480:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.09/0.46  % (2970310)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=735007111:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.09/0.46  % (2970309)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=273865438:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.09/0.46  % (2970311)dis+10_1_sil=32000:sp=arity:random_seed=1542707008:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.09/0.46  % (2970313)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1061064293:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.09/0.46  % (2970308)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4013080538_2999 on theBenchmark for (2999ds/0Mi)
% 0.09/0.46  % Exception at run slice level
% 0.09/0.46  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.09/0.46  % (2970311) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2970303-2970311"...
% 0.09/0.46  % (2970311)...printing done.
% 0.09/0.46  % (2970311)Refutation found. Thanks to Tanya!
% 0.09/0.46  % SZS status Theorem for theBenchmark
% 0.09/0.46  % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.46  % (2970311)------------------------------
% 0.09/0.46  % (2970311)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.46  % (2970311)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.46  % (2970311)CaDiCaL version: 2.1.3
% 0.09/0.46  % (2970311)Termination reason: Refutation
% 0.09/0.46  % (2970311)Time elapsed: 0.018 s
% 0.09/0.46  % (2970311)Peak memory usage: 12 MB
% 0.09/0.46  % (2970311)Instructions burned: 25 (million)
% 0.09/0.46  % (2970303)Success in time 0.051 s
% 0.09/0.46  % Vampire exiting
%------------------------------------------------------------------------------