↑ 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  : SWW592_2 : TPTP v9.3.1. Released v6.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/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:29 PM UTC 2026

% Result   : Theorem 0.20s 0.27s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   12 (   7 unt;   0 typ;   0 def)
%            Number of atoms       :   22 (  16 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   20 (  10   ~;   0   |;   4   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number arithmetic     :  111 (   5 atm;   7 fun;  94 num;   5 var)
%            Number of types       :    7 (   5 usr;   1 ari;   0 dat;   0 cdt)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   24 (  21 usr;  12 con; 0-4 aty)
%            Number of variables   :    7 (   5   !;   2   ?;   7   :)

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

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

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

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

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

tff(func_def_0,type,
    witness1: ty > uni ).

tff(func_def_1,type,
    int: ty ).

tff(func_def_2,type,
    real: ty ).

tff(func_def_3,type,
    bool: ty ).

tff(func_def_4,type,
    true1: bool1 ).

tff(func_def_5,type,
    false1: bool1 ).

tff(func_def_6,type,
    match_bool1: ( ty * bool1 * uni * uni ) > uni ).

tff(func_def_7,type,
    tuple0: ty ).

tff(func_def_8,type,
    tuple03: tuple02 ).

tff(func_def_9,type,
    qtmark: ty ).

tff(func_def_12,type,
    fib1: $int > $int ).

tff(func_def_17,type,
    abs1: $int > $int ).

tff(func_def_21,type,
    t: ty ).

tff(func_def_22,type,
    mk_t1: ( $int * $int * $int * $int ) > t1 ).

tff(func_def_23,type,
    a111: t1 > $int ).

tff(func_def_24,type,
    a121: t1 > $int ).

tff(func_def_25,type,
    a211: t1 > $int ).

tff(func_def_26,type,
    a221: t1 > $int ).

tff(func_def_27,type,
    mult1: ( t1 * t1 ) > t1 ).

tff(func_def_28,type,
    power1: ( t1 * $int ) > t1 ).

tff(func_def_30,type,
    sK0: $int ).

tff(pred_def_1,type,
    sort1: ( ty * uni ) > $o ).

tff(f27,axiom,
    ! [X0: t1] : ( power1(X0,0) = mk_t1(1,0,0,1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',power_0) ).

tff(f34,conjecture,
    ! [X0: $int] :
      ( $lesseq(0,X0)
     => ( ( X0 = 0 )
       => ( power1(mk_t1(1,1,1,0),X0) = mk_t1($sum(1,0),0,0,1) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',wP_parameter_logfib) ).

tff(f35,negated_conjecture,
    ~ ! [X0: $int] :
        ( $lesseq(0,X0)
       => ( ( X0 = 0 )
         => ( power1(mk_t1(1,1,1,0),X0) = mk_t1($sum(1,0),0,0,1) ) ) ),
    inference(negated_conjecture,[status(cth)],[f34]) ).

tff(f46,plain,
    ~ ! [X0: $int] :
        ( ~ $less(X0,0)
       => ( ( X0 = 0 )
         => ( power1(mk_t1(1,1,1,0),X0) = mk_t1($sum(1,0),0,0,1) ) ) ),
    inference(theory_normalization,[],[f35]) ).

tff(f85,plain,
    ? [X0: $int] :
      ( ( power1(mk_t1(1,1,1,0),X0) != mk_t1($sum(1,0),0,0,1) )
      & ( X0 = 0 )
      & ~ $less(X0,0) ),
    inference(ennf_transformation,[],[f46]) ).

tff(f86,plain,
    ? [X0: $int] :
      ( ( power1(mk_t1(1,1,1,0),X0) != mk_t1($sum(1,0),0,0,1) )
      & ( X0 = 0 )
      & ~ $less(X0,0) ),
    inference(flattening,[],[f85]) ).

tff(f116,plain,
    ! [X0: t1] : ( mk_t1(1,0,0,1) = power1(X0,0) ),
    inference(cnf_transformation,[],[f27]) ).

tff(f124,plain,
    0 = sK0,
    inference(cnf_transformation,[],[f86]) ).

tff(f125,plain,
    mk_t1($sum(1,0),0,0,1) != power1(mk_t1(1,1,1,0),sK0),
    inference(cnf_transformation,[],[f86]) ).

tff(f134,plain,
    mk_t1($sum(1,0),0,0,1) != power1(mk_t1(1,1,1,0),0),
    inference(definition_unfolding,[],[f125,f124]) ).

tff(f137,plain,
    mk_t1(1,0,0,1) != power1(mk_t1(1,1,1,0),0),
    inference(evaluation,[],[f134]) ).

tff(f234,plain,
    $false,
    inference(backward_subsumption_resolution,[],[f137,f116]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWW592_2 : TPTP v9.3.1. Released v6.1.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.18  % Computer : n011.cluster.edu
% 0.09/0.18  % Model    : x86_64 x86_64
% 0.09/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18  % Memory   : 8046.5625MB
% 0.09/0.18  % OS       : Linux 6.8.0-71-generic
% 0.09/0.18  % CPULimit : 300
% 0.09/0.18  % WCLimit  : 300
% 0.09/0.18  % DateTime : Mon Sep 28 14:20:15 UTC 2026
% 0.09/0.18  % CPUTime  : 
% 0.09/0.19  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22  Running first-order model finding
% 0.09/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.27  % (3413252)Will run a generic schedule for satisfiability detection.
% 0.20/0.27  % (3413259)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3899106331:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.27  % (3413258)% WARNING: option uhcvi not known.
% 0.20/0.27  % (3413257)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=34395878_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.27  % (3413258)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1216518431:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.27  % (3413260)dis+10_1_sil=32000:sp=arity:random_seed=3170040284:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.27  % (3413262)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=439221214:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.27  % (3413261)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=783152620:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.27  % (3413263)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=662708293:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.27  % (3413257)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.20/0.27  % (3413257)Terminated due to inappropriate strategy.
% 0.20/0.27  % (3413257)------------------------------
% 0.20/0.27  % (3413257)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.27  % (3413257)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.27  % (3413257)CaDiCaL version: 2.1.3
% 0.20/0.27  % (3413257)Termination reason: Inappropriate
% 0.20/0.27  % (3413257)Time elapsed: 0.002 s
% 0.20/0.27  % (3413257)Peak memory usage: 11 MB
% 0.20/0.27  % (3413257)Instructions burned: 4 (million)
% 0.20/0.27  % (3413257)------------------------------
% 0.20/0.27  % (3413257)------------------------------
% 0.20/0.27  % (3413258) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3413252-3413258"...
% 0.20/0.27  % (3413260) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3413252-3413260"...
% 0.20/0.27  % (3413258)...printing done.
% 0.20/0.27  % (3413262) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3413252-3413262"...
% 0.20/0.27  % (3413258)Refutation found. Thanks to Tanya!
% 0.20/0.27  % SZS status Theorem for theBenchmark
% 0.20/0.27  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.27  % (3413258)------------------------------
% 0.20/0.27  % (3413258)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.27  % (3413258)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.27  % (3413258)CaDiCaL version: 2.1.3
% 0.20/0.27  % (3413258)Termination reason: Refutation
% 0.20/0.27  % (3413258)Time elapsed: 0.008 s
% 0.20/0.27  % (3413258)Peak memory usage: 12 MB
% 0.20/0.27  % (3413258)Instructions burned: 12 (million)
% 0.20/0.27  % (3413252)Success in time 0.046 s
% 0.20/0.27  % Vampire exiting
%------------------------------------------------------------------------------