↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : NUM531+2 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n008.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:15:37 PM UTC 2026

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

% 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) )
     => ~ ( ~ ? [X1] : aElementOf0(X1,X0)
          & X0 = slcrc0 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).

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

fof(f14,plain,
    ? [X0] :
      ( ! [X1] : ~ aElementOf0(X1,X0)
      & X0 = slcrc0
      & aSet0(X0)
      & isCountable0(X0) ),
    inference(ennf_transformation,[],[f10]) ).

fof(f15,plain,
    ? [X0] :
      ( ! [X1] : ~ aElementOf0(X1,X0)
      & X0 = slcrc0
      & aSet0(X0)
      & isCountable0(X0) ),
    inference(flattening,[],[f14]) ).

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

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

fof(f19,plain,
    ( ! [X1] : ~ aElementOf0(X1,sK0)
    & slcrc0 = sK0
    & aSet0(sK0)
    & isCountable0(sK0) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f15]) ).

fof(f24,plain,
    isCountable0(sK0),
    inference(cnf_transformation,[],[f19]) ).

fof(f25,plain,
    aSet0(sK0),
    inference(cnf_transformation,[],[f19]) ).

fof(f26,plain,
    slcrc0 = sK0,
    inference(cnf_transformation,[],[f19]) ).

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

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

fof(f36,plain,
    isFinite0(sK0),
    inference(definition_unfolding,[],[f31,f26]) ).

fof(f40,plain,
    ( ~ aSet0(sK0)
    | ~ isFinite0(sK0) ),
    inference(resolution,[],[f32,f24]) ).

fof(f41,plain,
    ~ isFinite0(sK0),
    inference(forward_subsumption_resolution,[],[f40,f25]) ).

fof(f42,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f41,f36]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM531+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.38  % Computer : n008.cluster.edu
% 0.11/0.38  % Model    : x86_64 x86_64
% 0.11/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38  % Memory   : 8046.5625MB
% 0.11/0.38  % OS       : Linux 6.8.0-71-generic
% 0.11/0.38  % CPULimit : 300
% 0.11/0.38  % WCLimit  : 300
% 0.11/0.38  % DateTime : Sun Sep 27 20:22:25 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.42  Running first-order theorem proving
% 0.11/0.42  Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.55/1.48  % (1574957)Detected formulas, will run a generic FOF schedule.
% 3.55/1.48  % (1574962)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=2520254230:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.55/1.48  % (1574968)dis-21_1_sil=8000:lcm=predicate:random_seed=3327365901:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 3.55/1.48  % (1574965)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3398798564:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.55/1.48  % (1574967)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=639977913:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.55/1.48  % (1574966)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=556815085:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.55/1.48  % (1574964)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=3684118343:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.55/1.48  % (1574963)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=2128232879:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.55/1.48  % (1574965)Also succeeded, but the first one will report.
% 3.55/1.48  % (1574966)First to succeed.
% 3.55/1.48  % (1574967)Also succeeded, but the first one will report.
% 3.55/1.48  % (1574968)Also succeeded, but the first one will report.
% 3.55/1.48  % (1574966)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1574957"
% 3.55/1.48  % (1574966)Refutation found. Thanks to Tanya!
% 3.55/1.48  % SZS status Theorem for theBenchmark
% 3.55/1.48  % SZS output start Proof for theBenchmark
% See solution above
% 3.55/1.48  % (1574966)------------------------------
% 3.55/1.48  % (1574966)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.55/1.48  % (1574966)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.55/1.48  % (1574966)CaDiCaL version: 2.1.3
% 3.55/1.48  % (1574966)Termination reason: Refutation
% 3.55/1.48  % (1574966)Time elapsed: 0.002 s
% 3.55/1.48  % (1574966)Peak memory usage: 88 MB
% 3.55/1.48  % (1574966)------------------------------
% 3.55/1.48  % (1574966)------------------------------
% 3.55/1.48  % (1574957)Success in time 0.423 s
% 3.55/1.48  % Vampire exiting
%------------------------------------------------------------------------------