↑ 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  : NUM432+3 : TPTP v9.3.1. Released v4.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:24:17 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(f5,axiom,
    ! [X0,X1] :
      ( ( aInteger0(X0)
        & aInteger0(X1) )
     => aInteger0(sdtpldt0(X0,X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mIntPlus) ).

fof(f24,axiom,
    ( aInteger0(xn)
    & sdtasdt0(xq,xn) = sdtpldt0(xa,smndt0(xb)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__876) ).

fof(f25,axiom,
    ( aInteger0(xm)
    & sdtasdt0(xq,xm) = sdtpldt0(xb,smndt0(xc)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__899) ).

fof(f26,axiom,
    sdtasdt0(xq,sdtpldt0(xn,xm)) = sdtpldt0(xa,smndt0(xc)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__924) ).

fof(f27,conjecture,
    ( ? [X0] :
        ( aInteger0(X0)
        & sdtasdt0(xq,X0) = sdtpldt0(xa,smndt0(xc)) )
    | aDivisorOf0(xq,sdtpldt0(xa,smndt0(xc)))
    | sdteqdtlpzmzozddtrp0(xa,xc,xq) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).

fof(f28,negated_conjecture,
    ~ ( ? [X0] :
          ( aInteger0(X0)
          & sdtasdt0(xq,X0) = sdtpldt0(xa,smndt0(xc)) )
      | aDivisorOf0(xq,sdtpldt0(xa,smndt0(xc)))
      | sdteqdtlpzmzozddtrp0(xa,xc,xq) ),
    inference(negated_conjecture,[status(cth)],[f27]) ).

fof(f32,plain,
    ! [X0,X1] :
      ( aInteger0(sdtpldt0(X0,X1))
      | ~ aInteger0(X0)
      | ~ aInteger0(X1) ),
    inference(ennf_transformation,[],[f5]) ).

fof(f33,plain,
    ! [X0,X1] :
      ( aInteger0(sdtpldt0(X0,X1))
      | ~ aInteger0(X0)
      | ~ aInteger0(X1) ),
    inference(flattening,[],[f32]) ).

fof(f60,plain,
    ( ! [X0] :
        ( ~ aInteger0(X0)
        | sdtasdt0(xq,X0) != sdtpldt0(xa,smndt0(xc)) )
    & ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xc)))
    & ~ sdteqdtlpzmzozddtrp0(xa,xc,xq) ),
    inference(ennf_transformation,[],[f28]) ).

fof(f70,plain,
    ! [X0,X1] :
      ( aInteger0(sdtpldt0(X0,X1))
      | ~ aInteger0(X0)
      | ~ aInteger0(X1) ),
    inference(cnf_transformation,[],[f33]) ).

fof(f112,plain,
    aInteger0(xn),
    inference(cnf_transformation,[],[f24]) ).

fof(f114,plain,
    aInteger0(xm),
    inference(cnf_transformation,[],[f25]) ).

fof(f115,plain,
    sdtasdt0(xq,sdtpldt0(xn,xm)) = sdtpldt0(xa,smndt0(xc)),
    inference(cnf_transformation,[],[f26]) ).

fof(f118,plain,
    ! [X0] :
      ( sdtasdt0(xq,X0) != sdtpldt0(xa,smndt0(xc))
      | ~ aInteger0(X0) ),
    inference(cnf_transformation,[],[f60]) ).

fof(f222,plain,
    ( sdtpldt0(xa,smndt0(xc)) != sdtpldt0(xa,smndt0(xc))
    | ~ aInteger0(sdtpldt0(xn,xm)) ),
    inference(superposition,[],[f118,f115]) ).

fof(f223,plain,
    ~ aInteger0(sdtpldt0(xn,xm)),
    inference(trivial_inequality_removal,[],[f222]) ).

fof(f274,plain,
    ( ~ aInteger0(xn)
    | ~ aInteger0(xm) ),
    inference(resolution,[],[f70,f223]) ).

fof(f291,plain,
    ~ aInteger0(xm),
    inference(forward_subsumption_resolution,[],[f274,f112]) ).

fof(f296,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f291,f114]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM432+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.39  % Computer : n005.cluster.edu
% 0.11/0.39  % Model    : x86_64 x86_64
% 0.11/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39  % Memory   : 8046.5625MB
% 0.11/0.39  % OS       : Linux 6.8.0-71-generic
% 0.11/0.39  % CPULimit : 300
% 0.11/0.39  % WCLimit  : 300
% 0.11/0.39  % DateTime : Sun Sep 27 19:53:17 UTC 2026
% 0.11/0.39  % CPUTime  : 
% 0.11/0.39  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.43  Running first-order model finding
% 0.11/0.43  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.18/0.48  % (128464)Will run a generic schedule for satisfiability detection.
% 0.18/0.48  % (128473)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=296933707:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.48  % (128470)% WARNING: option uhcvi not known.
% 0.18/0.48  % (128469)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1626171500_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.48  % (128474)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1783367775:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.48  % (128471)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4165015093:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.48  % (128470)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4250510190:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.48  % (128472)dis+10_1_sil=32000:sp=arity:random_seed=3933005010:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.48  % (128475)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=485463856:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.48  % TRYING [1]
% 0.18/0.48  % TRYING [2]
% 0.18/0.48  % TRYING [3]
% 0.18/0.48  % (128471) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-128464-128471"...
% 0.18/0.48  % (128472) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-128464-128472"...
% 0.18/0.48  % (128471)...printing done.
% 0.18/0.48  % (128471)Refutation found. Thanks to Tanya!
% 0.18/0.48  % SZS status Theorem for theBenchmark
% 0.18/0.48  % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.48  % (128471)------------------------------
% 0.18/0.48  % (128471)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.48  % (128471)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.48  % (128471)CaDiCaL version: 2.1.3
% 0.18/0.48  % (128471)Termination reason: Refutation
% 0.18/0.48  % (128471)Time elapsed: 0.007 s
% 0.18/0.48  % (128471)Peak memory usage: 12 MB
% 0.18/0.48  % (128471)Instructions burned: 8 (million)
% 0.18/0.48  % (128464)Success in time 0.045 s
% 0.18/0.48  % Vampire exiting
%------------------------------------------------------------------------------