↑ 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  : COM043_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 : 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 09:40:13 AM UTC 2026

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

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

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

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

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

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

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

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

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

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

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

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

tff(func_def_5,type,
    iprod: 
      !>[X0: $tType] : ( ( list(X0) * list(X0) ) > X0 ) ).

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

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

tff(func_def_8,type,
    nDvd: ( int * int * list(int) ) > atom ).

tff(func_def_9,type,
    atom_size: atom > nat ).

tff(func_def_10,type,
    divisor: atom > int ).

tff(func_def_11,type,
    hd_coeff: atom > int ).

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

tff(func_def_13,type,
    fFalse: bool ).

tff(func_def_14,type,
    fTrue: bool ).

tff(func_def_15,type,
    a: atom ).

tff(func_def_16,type,
    d: int ).

tff(func_def_17,type,
    e: list(int) ).

tff(func_def_18,type,
    i: int ).

tff(func_def_19,type,
    j: int ).

tff(func_def_20,type,
    ks1: list(int) ).

tff(func_def_21,type,
    ks: list(int) ).

tff(func_def_22,type,
    l: int ).

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

tff(func_def_24,type,
    sK1: list(int) ).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(pred_def_19,type,
    nat_is_nat: int > $o ).

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

tff(f1,axiom,
    a = nDvd(d,l,ks),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_NDvd) ).

tff(f2,axiom,
    div_mod(int,i,divisor(a)) = div_mod(int,j,divisor(a)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1_assms_I3_J) ).

tff(f64,axiom,
    ! [X0: list(int),X1: int,X2: int] : ( divisor(nDvd(X2,X1,X0)) = X2 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_63_divisor_Osimps_I3_J) ).

tff(f135,conjecture,
    div_mod(int,i,d) = div_mod(int,j,d),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).

tff(f136,negated_conjecture,
    ( ( ~ div_mod(int,i,d) ) = div_mod(int,j,d) ),
    inference(negated_conjecture,[status(cth)],[f135]) ).

tff(f137,plain,
    div_mod(int,i,d) != div_mod(int,j,d),
    inference(flattening,[],[f136]) ).

tff(f221,plain,
    a = nDvd(d,l,ks),
    inference(cnf_transformation,[],[f1]) ).

tff(f222,plain,
    div_mod(int,i,divisor(a)) = div_mod(int,j,divisor(a)),
    inference(cnf_transformation,[],[f2]) ).

tff(f300,plain,
    ! [X2: int,X0: list(int),X1: int] : ( divisor(nDvd(X2,X1,X0)) = X2 ),
    inference(cnf_transformation,[],[f64]) ).

tff(f375,plain,
    div_mod(int,i,d) != div_mod(int,j,d),
    inference(cnf_transformation,[],[f137]) ).

tff(f400,plain,
    d = divisor(a),
    inference(superposition,[],[f300,f221]) ).

tff(f458,plain,
    div_mod(int,i,d) = div_mod(int,j,d),
    inference(superposition,[],[f222,f400]) ).

tff(f461,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f458,f375]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : COM043_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.08/0.19  % Computer : n011.cluster.edu
% 0.08/0.19  % Model    : x86_64 x86_64
% 0.08/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19  % Memory   : 8046.5625MB
% 0.08/0.19  % OS       : Linux 6.8.0-71-generic
% 0.08/0.19  % CPULimit : 300
% 0.08/0.19  % WCLimit  : 300
% 0.08/0.19  % DateTime : Mon Sep 28 21:51:01 UTC 2026
% 0.08/0.19  % CPUTime  : 
% 0.08/0.19  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.22  Running first-order model finding
% 0.08/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.21/0.29  % (3816012)Will run a generic schedule for satisfiability detection.
% 0.21/0.29  % (3816021)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=670752129:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.21/0.29  % (3816018)% WARNING: option uhcvi not known.
% 0.21/0.29  % (3816021) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3816012-3816021"...
% 0.21/0.29  % (3816021)...printing done.
% 0.21/0.29  % (3816017)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4075979373_2999 on theBenchmark for (2999ds/0Mi)
% 0.21/0.29  % (3816018)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=488209485:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.21/0.29  % (3816019)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=332987467:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.21/0.29  % (3816020)dis+10_1_sil=32000:sp=arity:random_seed=3806843619:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.21/0.29  % (3816022)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3259381262:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.21/0.29  % (3816023)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2980400148:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.21/0.29  % (3816021)Refutation found. Thanks to Tanya!
% 0.21/0.29  % SZS status Theorem for theBenchmark
% 0.21/0.29  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.29  % (3816021)------------------------------
% 0.21/0.29  % (3816021)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.29  % (3816021)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.29  % (3816021)CaDiCaL version: 2.1.3
% 0.21/0.29  % (3816021)Termination reason: Refutation
% 0.21/0.29  % (3816021)Time elapsed: 0.005 s
% 0.21/0.29  % (3816021)Peak memory usage: 12 MB
% 0.21/0.29  % (3816021)Instructions burned: 13 (million)
% 0.21/0.29  % (3816012)Success in time 0.052 s
% 0.21/0.29  % Vampire exiting
%------------------------------------------------------------------------------