↑ 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  : NUM425+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 : n019.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:16 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(f22,axiom,
    ( ? [X0] :
        ( aInteger0(X0)
        & sdtasdt0(xq,X0) = sdtpldt0(xa,smndt0(xb)) )
    & aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
    & sdteqdtlpzmzozddtrp0(xa,xb,xq) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__724) ).

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

fof(f24,negated_conjecture,
    ~ ? [X0] :
        ( aInteger0(X0)
        & sdtasdt0(xq,X0) = sdtpldt0(xa,smndt0(xb)) ),
    inference(negated_conjecture,[status(cth)],[f23]) ).

fof(f53,plain,
    ! [X0] :
      ( ~ aInteger0(X0)
      | sdtasdt0(xq,X0) != sdtpldt0(xa,smndt0(xb)) ),
    inference(ennf_transformation,[],[f24]) ).

fof(f59,plain,
    ( aInteger0(sK1)
    & sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sK1)
    & aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
    & sdteqdtlpzmzozddtrp0(xa,xb,xq) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X0,sK1)],[f22]) ).

fof(f96,plain,
    sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sK1),
    inference(cnf_transformation,[],[f59]) ).

fof(f97,plain,
    aInteger0(sK1),
    inference(cnf_transformation,[],[f59]) ).

fof(f98,plain,
    ! [X0] :
      ( sdtasdt0(xq,X0) != sdtpldt0(xa,smndt0(xb))
      | ~ aInteger0(X0) ),
    inference(cnf_transformation,[],[f53]) ).

fof(f145,plain,
    ! [X0] :
      ( sdtasdt0(xq,X0) != sdtasdt0(xq,sK1)
      | ~ aInteger0(X0) ),
    inference(superposition,[],[f98,f96]) ).

fof(f146,plain,
    ~ aInteger0(sK1),
    inference(equality_resolution,[],[f145]) ).

fof(f147,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f146,f97]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM425+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.38  % Computer : n019.cluster.edu
% 0.12/0.38  % Model    : x86_64 x86_64
% 0.12/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38  % Memory   : 8046.5625MB
% 0.12/0.38  % OS       : Linux 6.8.0-71-generic
% 0.12/0.38  % CPULimit : 300
% 0.12/0.38  % WCLimit  : 300
% 0.12/0.38  % DateTime : Sun Sep 27 19:51:51 UTC 2026
% 0.12/0.38  % CPUTime  : 
% 0.12/0.38  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.41  Running first-order model finding
% 0.12/0.41  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.16/0.47  % (3368268)Will run a generic schedule for satisfiability detection.
% 0.16/0.47  % (3368276)dis+10_1_sil=32000:sp=arity:random_seed=75213801:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.16/0.47  % (3368276) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3368268-3368276"...
% 0.16/0.47  % (3368276)...printing done.
% 0.16/0.47  % (3368274)% WARNING: option uhcvi not known.
% 0.16/0.47  % (3368276)Refutation found. Thanks to Tanya!
% 0.16/0.47  % SZS status Theorem for theBenchmark
% 0.16/0.47  % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.47  % (3368276)------------------------------
% 0.16/0.47  % (3368276)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.47  % (3368276)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.47  % (3368276)CaDiCaL version: 2.1.3
% 0.16/0.47  % (3368276)Termination reason: Refutation
% 0.16/0.47  % (3368276)Time elapsed: 0.002 s
% 0.16/0.47  % (3368276)Peak memory usage: 12 MB
% 0.16/0.47  % (3368276)Instructions burned: 3 (million)
% 0.16/0.47  % (3368268)Success in time 0.041 s
% 0.16/0.47  % Vampire exiting
%------------------------------------------------------------------------------