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

% Computer : n011.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:20 PM UTC 2026

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

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

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

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

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

tff(type_def_9,type,
    poly: $tType > $tType ).

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

tff(func_def_0,type,
    fundam1563812824_csqrt: complex > complex ).

tff(func_def_1,type,
    fundam1280195782_psize: 
      !>[X0: $tType] : ( poly(X0) > nat ) ).

tff(func_def_2,type,
    times_times: 
      !>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).

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

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

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

tff(func_def_6,type,
    pls: int ).

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

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

tff(func_def_9,type,
    fFalse: bool ).

tff(func_def_10,type,
    fTrue: bool ).

tff(func_def_11,type,
    n: nat ).

tff(func_def_12,type,
    na: nat ).

tff(func_def_13,type,
    sK0: nat > nat ).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(pred_def_17,type,
    comm_monoid_mult: 
      !>[X0: $tType] : $o ).

tff(pred_def_18,type,
    ab_semigroup_mult: 
      !>[X0: $tType] : $o ).

tff(pred_def_19,type,
    ring_n68954251visors: 
      !>[X0: $tType] : $o ).

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

tff(pred_def_21,type,
    ab_sem1668676832m_mult: 
      !>[X0: $tType] : $o ).

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

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

tff(pred_def_24,type,
    even_odd_even: 
      !>[X0: $tType] : ( X0 > $o ) ).

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

tff(f1,axiom,
    even_odd_even(nat,na),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_e) ).

tff(f26,axiom,
    ! [X0: nat] :
      ( even_odd_even(nat,X0)
    <=> ? [X1: nat] : ( X0 = times_times(nat,number_number_of(nat,bit0(bit1(pls))),X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_25_even__mult__two__ex) ).

tff(f192,conjecture,
    ? [X0: nat] : ( na = times_times(nat,number_number_of(nat,bit0(bit1(pls))),X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).

tff(f193,negated_conjecture,
    ~ ? [X0: nat] : ( na = times_times(nat,number_number_of(nat,bit0(bit1(pls))),X0) ),
    inference(negated_conjecture,[status(cth)],[f192]) ).

tff(f269,plain,
    ! [X0: nat] : ( na != times_times(nat,number_number_of(nat,bit0(bit1(pls))),X0) ),
    inference(ennf_transformation,[],[f193]) ).

tff(f270,plain,
    even_odd_even(nat,na),
    inference(cnf_transformation,[],[f1]) ).

tff(f300,plain,
    ! [X0: nat] :
      ( ~ even_odd_even(nat,X0)
      | ( times_times(nat,number_number_of(nat,bit0(bit1(pls))),sK0(X0)) = X0 ) ),
    inference(cnf_transformation,[],[f26]) ).

tff(f490,plain,
    ! [X0: nat] : ( na != times_times(nat,number_number_of(nat,bit0(bit1(pls))),X0) ),
    inference(cnf_transformation,[],[f269]) ).

tff(f810,plain,
    na = times_times(nat,number_number_of(nat,bit0(bit1(pls))),sK0(na)),
    inference(resolution,[],[f300,f270]) ).

tff(f811,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f810,f490]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWW499_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.20  % Computer : n011.cluster.edu
% 0.09/0.20  % Model    : x86_64 x86_64
% 0.09/0.20  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20  % Memory   : 8046.5625MB
% 0.09/0.20  % OS       : Linux 6.8.0-71-generic
% 0.09/0.20  % CPULimit : 300
% 0.09/0.20  % WCLimit  : 300
% 0.09/0.20  % DateTime : Mon Sep 28 14:15:16 UTC 2026
% 0.09/0.20  % CPUTime  : 
% 0.09/0.20  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.23  Running first-order model finding
% 0.09/0.23  Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.29  % (3405028)Will run a generic schedule for satisfiability detection.
% 0.20/0.29  % (3405037)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2215890065:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.29  % (3405034)% WARNING: option uhcvi not known.
% 0.20/0.29  % (3405033)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2063339177_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.29  % (3405034)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=979526137:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.29  % (3405039)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1240160933:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.29  % (3405035)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1066312876:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.29  % (3405036)dis+10_1_sil=32000:sp=arity:random_seed=2849090959:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.29  % (3405038)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1216553173:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.29  % (3405037) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3405028-3405037"...
% 0.20/0.29  % (3405037)...printing done.
% 0.20/0.29  % (3405037)Refutation found. Thanks to Tanya!
% 0.20/0.29  % SZS status Theorem for theBenchmark
% 0.20/0.29  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.29  % (3405037)------------------------------
% 0.20/0.29  % (3405037)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.29  % (3405037)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.29  % (3405037)CaDiCaL version: 2.1.3
% 0.20/0.29  % (3405037)Termination reason: Refutation
% 0.20/0.29  % (3405037)Time elapsed: 0.008 s
% 0.20/0.29  % (3405037)Peak memory usage: 12 MB
% 0.20/0.29  % (3405037)Instructions burned: 23 (million)
% 0.20/0.29  % (3405028)Success in time 0.045 s
% 0.20/0.29  % Vampire exiting
%------------------------------------------------------------------------------