↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SET786+1 : TPTP v9.3.1. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n017.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:41:55 PM UTC 2026

% Result   : Theorem 2.67s 1.35s
% Output   : Refutation 2.67s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   17 (   3 unt;   0 def)
%            Number of atoms       :   49 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   58 (  26   ~;  19   |;   9   &)
%                                         (   4 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   1 con; 0-1 aty)
%            Number of variables   :   28 (  17   !;  11   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ~ ? [X0] :
      ! [X1] :
        ( element(X1,X0)
      <=> ~ ? [X2] :
              ( element(X1,X2)
              & element(X2,X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm25) ).

fof(f2,negated_conjecture,
    ~ ~ ? [X0] :
        ! [X1] :
          ( element(X1,X0)
        <=> ~ ? [X2] :
                ( element(X1,X2)
                & element(X2,X1) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

fof(f3,plain,
    ? [X0] :
    ! [X1] :
      ( element(X1,X0)
    <=> ~ ? [X2] :
            ( element(X1,X2)
            & element(X2,X1) ) ),
    inference(flattening,[],[f2]) ).

fof(f4,plain,
    ? [X0] :
    ! [X1] :
      ( element(X1,X0)
    <=> ! [X2] :
          ( ~ element(X1,X2)
          | ~ element(X2,X1) ) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f5,plain,
    ? [X0] :
    ! [X1] :
      ( ( element(X1,X0)
        | ? [X2] :
            ( element(X1,X2)
            & element(X2,X1) ) )
      & ( ! [X2] :
            ( ~ element(X1,X2)
            | ~ element(X2,X1) )
        | ~ element(X1,X0) ) ),
    inference(nnf_transformation,[],[f4]) ).

fof(f6,plain,
    ? [X0] :
    ! [X1] :
      ( ( element(X1,X0)
        | ? [X2] :
            ( element(X1,X2)
            & element(X2,X1) ) )
      & ( ! [X3] :
            ( ~ element(X1,X3)
            | ~ element(X3,X1) )
        | ~ element(X1,X0) ) ),
    inference(rectify,[],[f5]) ).

fof(f7,plain,
    ! [X1] :
      ( ( element(X1,sK0)
        | ( element(X1,sK1(X1))
          & element(sK1(X1),X1) ) )
      & ( ! [X3] :
            ( ~ element(X1,X3)
            | ~ element(X3,X1) )
        | ~ element(X1,sK0) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X2,sK1(X1))],[f6]) ).

fof(f8,plain,
    ! [X3,X1] :
      ( ~ element(X3,X1)
      | ~ element(X1,X3)
      | ~ element(X1,sK0) ),
    inference(cnf_transformation,[],[f7]) ).

fof(f9,plain,
    ! [X1] :
      ( element(sK1(X1),X1)
      | element(X1,sK0) ),
    inference(cnf_transformation,[],[f7]) ).

fof(f10,plain,
    ! [X1] :
      ( element(X1,sK1(X1))
      | element(X1,sK0) ),
    inference(cnf_transformation,[],[f7]) ).

fof(f12,plain,
    ! [X0] :
      ( ~ element(sK1(X0),X0)
      | ~ element(sK1(X0),sK0)
      | element(X0,sK0) ),
    inference(resolution,[],[f8,f10]) ).

fof(f14,plain,
    ( ~ element(sK0,sK0)
    | ~ element(sK0,sK0) ),
    inference(factoring,[],[f8]) ).

fof(f15,plain,
    ~ element(sK0,sK0),
    inference(duplicate_literal_removal,[],[f14]) ).

fof(f16,plain,
    ! [X0] :
      ( ~ element(sK1(X0),sK0)
      | element(X0,sK0) ),
    inference(forward_subsumption_resolution,[],[f12,f9]) ).

fof(f20,plain,
    ( element(sK0,sK0)
    | element(sK0,sK0) ),
    inference(resolution,[],[f16,f9]) ).

fof(f21,plain,
    element(sK0,sK0),
    inference(duplicate_literal_removal,[],[f20]) ).

fof(f22,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f21,f15]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SET786+1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.39  % Computer : n017.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 : Mon Sep 28 02:43:21 UTC 2026
% 0.11/0.39  % CPUTime  : 
% 0.11/0.39  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42  Running first-order theorem proving
% 0.11/0.42  Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.67/1.35  % (3164992)Detected formulas, will run a generic FOF schedule.
% 2.67/1.35  % (3165034)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3553748168:i=119:av=off:ss=axioms_3000 on theBenchmark for (3000ds/119Mi)
% 2.67/1.35  % (3165034)First to succeed.
% 2.67/1.35  % (3165034)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3164992"
% 2.67/1.35  % (3165035)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1502058949:s2a=on:i=139:gtg=position_3000 on theBenchmark for (3000ds/139Mi)
% 2.67/1.35  % (3165032)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3790435023:i=109:sd=1:ins=1:gsp=on:ss=axioms_3000 on theBenchmark for (3000ds/109Mi)
% 2.67/1.35  % (3165029)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=359325847:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_3000 on theBenchmark for (3000ds/134677Mi)
% 2.67/1.35  % (3165028)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=1377125908:i=141193_3000 on theBenchmark for (3000ds/141193Mi)
% 2.67/1.35  % (3165030)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=2910601510:i=141695:sd=1:nm=32:gsp=on:ss=included_3000 on theBenchmark for (3000ds/141695Mi)
% 2.67/1.35  % (3165036)dis-21_1_sil=8000:lcm=predicate:random_seed=3630011069:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_3000 on theBenchmark for (3000ds/129Mi)
% 2.67/1.35  % (3165032)Also succeeded, but the first one will report.
% 2.67/1.35  % (3165035)Also succeeded, but the first one will report.
% 2.67/1.35  % (3165036)Also succeeded, but the first one will report.
% 2.67/1.35  % (3165034)Refutation found. Thanks to Tanya!
% 2.67/1.35  % SZS status Theorem for theBenchmark
% 2.67/1.35  % SZS output start Proof for theBenchmark
% See solution above
% 2.67/1.35  % (3165034)------------------------------
% 2.67/1.35  % (3165034)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.67/1.35  % (3165034)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.67/1.35  % (3165034)CaDiCaL version: 2.1.3
% 2.67/1.35  % (3165034)Termination reason: Refutation
% 2.67/1.35  % (3165034)Time elapsed: 0.001 s
% 2.67/1.35  % (3165034)Peak memory usage: 88 MB
% 2.67/1.35  % (3165034)------------------------------
% 2.67/1.35  % (3165034)------------------------------
% 2.67/1.35  % (3164992)Success in time 0.283 s
% 2.67/1.35  % Vampire exiting
%------------------------------------------------------------------------------