↑ 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  : NUM550+1 : 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 : n014.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:46 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(f42,axiom,
    ! [X0] :
      ( aSet0(X0)
     => ( sbrdtbr0(X0) = sz00
      <=> X0 = slcrc0 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mCardEmpty) ).

fof(f62,axiom,
    ( aSet0(xS)
    & aSet0(xT)
    & xk != sz00 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2202_02) ).

fof(f66,axiom,
    ( aSet0(xQ)
    & isFinite0(xQ)
    & sbrdtbr0(xQ) = xk ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2291) ).

fof(f67,conjecture,
    xQ != slcrc0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).

fof(f68,negated_conjecture,
    ~ ( xQ != slcrc0 ),
    inference(negated_conjecture,[status(cth)],[f67]) ).

fof(f75,plain,
    slcrc0 = xQ,
    inference(flattening,[],[f68]) ).

fof(f126,plain,
    ! [X0] :
      ( ( sbrdtbr0(X0) = sz00
      <=> X0 = slcrc0 )
      | ~ aSet0(X0) ),
    inference(ennf_transformation,[],[f42]) ).

fof(f187,plain,
    ! [X0] :
      ( ( ( sbrdtbr0(X0) = sz00
          | slcrc0 != X0 )
        & ( X0 = slcrc0
          | sz00 != sbrdtbr0(X0) ) )
      | ~ aSet0(X0) ),
    inference(nnf_transformation,[],[f126]) ).

fof(f276,plain,
    ! [X0] :
      ( sz00 = sbrdtbr0(X0)
      | slcrc0 != X0
      | ~ aSet0(X0) ),
    inference(cnf_transformation,[],[f187]) ).

fof(f319,plain,
    sz00 != xk,
    inference(cnf_transformation,[],[f62]) ).

fof(f326,plain,
    xk = sbrdtbr0(xQ),
    inference(cnf_transformation,[],[f66]) ).

fof(f328,plain,
    aSet0(xQ),
    inference(cnf_transformation,[],[f66]) ).

fof(f329,plain,
    slcrc0 = xQ,
    inference(cnf_transformation,[],[f75]) ).

fof(f335,plain,
    ! [X0] :
      ( sz00 = sbrdtbr0(X0)
      | xQ != X0
      | ~ aSet0(X0) ),
    inference(definition_unfolding,[],[f276,f329]) ).

fof(f356,plain,
    ( sz00 = sbrdtbr0(xQ)
    | ~ aSet0(xQ) ),
    inference(equality_resolution,[],[f335]) ).

fof(f372,plain,
    sz00 = sbrdtbr0(xQ),
    inference(global_subsumption,[],[f356,f328]) ).

fof(f490,plain,
    sz00 = xk,
    inference(forward_demodulation,[],[f326,f372]) ).

fof(f491,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f490,f319]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : NUM550+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.37  % Computer : n014.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Sun Sep 27 20:27:16 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.40  Running first-order model finding
% 0.10/0.40  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.10/0.45  % (1137054)Will run a generic schedule for satisfiability detection.
% 0.10/0.45  % (1137061)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3287978043:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.10/0.45  % (1137061) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1137054-1137061"...
% 0.10/0.45  % (1137061)...printing done.
% 0.10/0.45  % (1137061)Refutation found. Thanks to Tanya!
% 0.10/0.45  % SZS status Theorem for theBenchmark
% 0.10/0.45  % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.45  % (1137061)------------------------------
% 0.10/0.45  % (1137061)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.45  % (1137061)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.45  % (1137061)CaDiCaL version: 2.1.3
% 0.10/0.45  % (1137061)Termination reason: Refutation
% 0.10/0.45  % (1137061)Time elapsed: 0.004 s
% 0.10/0.45  % (1137061)Peak memory usage: 12 MB
% 0.10/0.45  % (1137061)Instructions burned: 10 (million)
% 0.10/0.45  % (1137054)Success in time 0.032 s
% 0.10/0.45  % Vampire exiting
%------------------------------------------------------------------------------