↑ 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  : NUM531+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 : 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:41 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(f6,axiom,
    isFinite0(slcrc0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mEmpFin) ).

fof(f8,axiom,
    ! [X0] :
      ( ( aSet0(X0)
        & isCountable0(X0) )
     => ~ isFinite0(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mCountNFin) ).

fof(f9,conjecture,
    ! [X0] :
      ( ( aSet0(X0)
        & isCountable0(X0) )
     => X0 != slcrc0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).

fof(f10,negated_conjecture,
    ~ ! [X0] :
        ( ( aSet0(X0)
          & isCountable0(X0) )
       => X0 != slcrc0 ),
    inference(negated_conjecture,[status(cth)],[f9]) ).

fof(f19,plain,
    ! [X0] :
      ( ~ isFinite0(X0)
      | ~ aSet0(X0)
      | ~ isCountable0(X0) ),
    inference(ennf_transformation,[],[f8]) ).

fof(f20,plain,
    ! [X0] :
      ( ~ isFinite0(X0)
      | ~ aSet0(X0)
      | ~ isCountable0(X0) ),
    inference(flattening,[],[f19]) ).

fof(f21,plain,
    ? [X0] :
      ( slcrc0 = X0
      & aSet0(X0)
      & isCountable0(X0) ),
    inference(ennf_transformation,[],[f10]) ).

fof(f22,plain,
    ? [X0] :
      ( slcrc0 = X0
      & aSet0(X0)
      & isCountable0(X0) ),
    inference(flattening,[],[f21]) ).

fof(f27,plain,
    isFinite0(slcrc0),
    inference(cnf_transformation,[],[f6]) ).

fof(f28,plain,
    ! [X0] :
      ( ~ isCountable0(X0)
      | ~ aSet0(X0)
      | ~ isFinite0(X0) ),
    inference(cnf_transformation,[],[f20]) ).

fof(f29,plain,
    isCountable0(sK1),
    inference(cnf_transformation,[],[f22]) ).

fof(f30,plain,
    aSet0(sK1),
    inference(cnf_transformation,[],[f22]) ).

fof(f31,plain,
    slcrc0 = sK1,
    inference(cnf_transformation,[],[f22]) ).

fof(f35,plain,
    isFinite0(sK1),
    inference(definition_unfolding,[],[f27,f31]) ).

fof(f38,plain,
    ( ~ aSet0(sK1)
    | ~ isFinite0(sK1) ),
    inference(resolution,[],[f28,f29]) ).

fof(f39,plain,
    ~ isFinite0(sK1),
    inference(forward_subsumption_resolution,[],[f38,f30]) ).

fof(f40,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f39,f35]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM531+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.11/0.37  % Computer : n019.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Sun Sep 27 20:22:04 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41  Running first-order model finding
% 0.11/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.11/0.45  % (3379597)Will run a generic schedule for satisfiability detection.
% 0.11/0.45  % (3379606)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3584647643:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.11/0.45  % (3379606) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3379597-3379606"...
% 0.11/0.45  % (3379606)...printing done.
% 0.11/0.45  % (3379606)Refutation found. Thanks to Tanya!
% 0.11/0.45  % SZS status Theorem for theBenchmark
% 0.11/0.45  % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.45  % (3379606)------------------------------
% 0.11/0.45  % (3379606)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.45  % (3379606)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.45  % (3379606)CaDiCaL version: 2.1.3
% 0.11/0.45  % (3379606)Termination reason: Refutation
% 0.11/0.45  % (3379606)Time elapsed: 0.001 s
% 0.11/0.45  % (3379606)Peak memory usage: 11 MB
% 0.11/0.45  % (3379597)Success in time 0.034 s
% 0.11/0.45  % Vampire exiting
%------------------------------------------------------------------------------