↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Computer : n013.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:47:19 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(f3,axiom,
    ! [X0,X1] :
      ( subset(X0,X1)
    <=> ! [X2] :
          ( in(X2,X0)
         => in(X2,X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).

fof(f4,axiom,
    ! [X0,X1,X2] :
      ( X2 = set_intersection2(X0,X1)
    <=> ! [X3] :
          ( in(X3,X2)
        <=> ( in(X3,X0)
            & in(X3,X1) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_xboole_0) ).

fof(f12,conjecture,
    ! [X0,X1] : subset(set_intersection2(X0,X1),X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t17_xboole_1) ).

fof(f13,negated_conjecture,
    ~ ! [X0,X1] : subset(set_intersection2(X0,X1),X0),
    inference(negated_conjecture,[status(cth)],[f12]) ).

fof(f21,plain,
    ! [X0,X1] :
      ( subset(X0,X1)
    <=> ! [X2] :
          ( in(X2,X1)
          | ~ in(X2,X0) ) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f22,plain,
    ? [X0,X1] : ~ subset(set_intersection2(X0,X1),X0),
    inference(ennf_transformation,[],[f13]) ).

fof(f26,plain,
    ! [X0,X1] :
      ( ( subset(X0,X1)
        | ? [X2] :
            ( ~ in(X2,X1)
            & in(X2,X0) ) )
      & ( ! [X2] :
            ( in(X2,X1)
            | ~ in(X2,X0) )
        | ~ subset(X0,X1) ) ),
    inference(nnf_transformation,[],[f21]) ).

fof(f27,plain,
    ! [X0,X1] :
      ( ( subset(X0,X1)
        | ? [X2] :
            ( ~ in(X2,X1)
            & in(X2,X0) ) )
      & ( ! [X3] :
            ( in(X3,X1)
            | ~ in(X3,X0) )
        | ~ subset(X0,X1) ) ),
    inference(rectify,[],[f26]) ).

fof(f28,plain,
    ! [X0,X1] :
      ( ( subset(X0,X1)
        | ( ~ in(sK0(X0,X1),X1)
          & in(sK0(X0,X1),X0) ) )
      & ( ! [X3] :
            ( in(X3,X1)
            | ~ in(X3,X0) )
        | ~ subset(X0,X1) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f27]) ).

fof(f29,plain,
    ! [X0,X1,X2] :
      ( ( X2 = set_intersection2(X0,X1)
        | ? [X3] :
            ( ( ~ in(X3,X0)
              | ~ in(X3,X1)
              | ~ in(X3,X2) )
            & ( ( in(X3,X0)
                & in(X3,X1) )
              | in(X3,X2) ) ) )
      & ( ! [X3] :
            ( ( in(X3,X2)
              | ~ in(X3,X0)
              | ~ in(X3,X1) )
            & ( ( in(X3,X0)
                & in(X3,X1) )
              | ~ in(X3,X2) ) )
        | set_intersection2(X0,X1) != X2 ) ),
    inference(nnf_transformation,[],[f4]) ).

fof(f30,plain,
    ! [X0,X1,X2] :
      ( ( X2 = set_intersection2(X0,X1)
        | ? [X3] :
            ( ( ~ in(X3,X0)
              | ~ in(X3,X1)
              | ~ in(X3,X2) )
            & ( ( in(X3,X0)
                & in(X3,X1) )
              | in(X3,X2) ) ) )
      & ( ! [X3] :
            ( ( in(X3,X2)
              | ~ in(X3,X0)
              | ~ in(X3,X1) )
            & ( ( in(X3,X0)
                & in(X3,X1) )
              | ~ in(X3,X2) ) )
        | set_intersection2(X0,X1) != X2 ) ),
    inference(flattening,[],[f29]) ).

fof(f31,plain,
    ! [X0,X1,X2] :
      ( ( X2 = set_intersection2(X0,X1)
        | ? [X3] :
            ( ( ~ in(X3,X0)
              | ~ in(X3,X1)
              | ~ in(X3,X2) )
            & ( ( in(X3,X0)
                & in(X3,X1) )
              | in(X3,X2) ) ) )
      & ( ! [X4] :
            ( ( in(X4,X2)
              | ~ in(X4,X0)
              | ~ in(X4,X1) )
            & ( ( in(X4,X0)
                & in(X4,X1) )
              | ~ in(X4,X2) ) )
        | set_intersection2(X0,X1) != X2 ) ),
    inference(rectify,[],[f30]) ).

fof(f32,plain,
    ! [X0,X1,X2] :
      ( ( X2 = set_intersection2(X0,X1)
        | ( ( ~ in(sK1(X0,X1,X2),X0)
            | ~ in(sK1(X0,X1,X2),X1)
            | ~ in(sK1(X0,X1,X2),X2) )
          & ( ( in(sK1(X0,X1,X2),X0)
              & in(sK1(X0,X1,X2),X1) )
            | in(sK1(X0,X1,X2),X2) ) ) )
      & ( ! [X4] :
            ( ( in(X4,X2)
              | ~ in(X4,X0)
              | ~ in(X4,X1) )
            & ( ( in(X4,X0)
                & in(X4,X1) )
              | ~ in(X4,X2) ) )
        | set_intersection2(X0,X1) != X2 ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X3,sK1(X0,X1,X2))],[f31]) ).

fof(f35,plain,
    ~ subset(set_intersection2(sK4,sK5),sK4),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5]),skolemize(X0,sK4),skolemize(X1,sK5)],[f22]) ).

fof(f39,plain,
    ! [X0,X1] :
      ( subset(X0,X1)
      | in(sK0(X0,X1),X0) ),
    inference(cnf_transformation,[],[f28]) ).

fof(f40,plain,
    ! [X0,X1] :
      ( subset(X0,X1)
      | ~ in(sK0(X0,X1),X1) ),
    inference(cnf_transformation,[],[f28]) ).

fof(f42,plain,
    ! [X2,X0,X1,X4] :
      ( in(X4,X0)
      | ~ in(X4,X2)
      | set_intersection2(X0,X1) != X2 ),
    inference(cnf_transformation,[],[f32]) ).

fof(f52,plain,
    ~ subset(set_intersection2(sK4,sK5),sK4),
    inference(cnf_transformation,[],[f35]) ).

fof(f58,plain,
    ! [X0,X1,X4] :
      ( ~ in(X4,set_intersection2(X0,X1))
      | in(X4,X0) ),
    inference(equality_resolution,[],[f42]) ).

fof(f74,plain,
    in(sK0(set_intersection2(sK4,sK5),sK4),set_intersection2(sK4,sK5)),
    inference(resolution,[],[f39,f52]) ).

fof(f77,plain,
    ~ in(sK0(set_intersection2(sK4,sK5),sK4),sK4),
    inference(resolution,[],[f40,f52]) ).

fof(f78,plain,
    in(sK0(set_intersection2(sK4,sK5),sK4),sK4),
    inference(resolution,[],[f58,f74]) ).

fof(f79,plain,
    $false,
    inference(resolution,[],[f78,f77]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SEU127+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.36  % Computer : n013.cluster.edu
% 0.12/0.36  % Model    : x86_64 x86_64
% 0.12/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.36  % Memory   : 8046.5625MB
% 0.12/0.36  % OS       : Linux 6.8.0-71-generic
% 0.12/0.36  % CPULimit : 300
% 0.12/0.36  % WCLimit  : 300
% 0.12/0.36  % DateTime : Mon Sep 28 03:38:54 UTC 2026
% 0.12/0.36  % CPUTime  : 
% 0.12/0.36  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.39  Running first-order theorem proving
% 0.12/0.39  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.35/1.33  % (779818)Detected formulas, will run a generic FOF schedule.
% 3.35/1.33  % (779825)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=1873925441:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.35/1.33  % (779828)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3812340132:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.35/1.33  % (779829)dis-21_1_sil=8000:lcm=predicate:random_seed=2058307278: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.35/1.33  % (779827)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1858603437:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.35/1.33  % (779823)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=1948378309:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.35/1.33  % (779826)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3616649334:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.35/1.33  % (779824)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=2807828329:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.35/1.33  % (779826)Refutation not found, incomplete strategy
% 3.35/1.33  % (779826)------------------------------
% 3.35/1.33  % (779826)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.35/1.33  % (779826)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.35/1.33  % (779826)CaDiCaL version: 2.1.3
% 3.35/1.33  % (779826)Termination reason: Refutation not found, incomplete strategy
% 3.35/1.33  % (779826)Time elapsed: 0.001 s
% 3.35/1.33  % (779826)Peak memory usage: 88 MB
% 3.35/1.33  % (779829)First to succeed.
% 3.35/1.33  % (779829)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-779818"
% 3.35/1.33  % (779828)Also succeeded, but the first one will report.
% 3.35/1.33  % (779827)Also succeeded, but the first one will report.
% 3.35/1.33  % (779826)------------------------------
% 3.35/1.33  % (779826)------------------------------
% 3.35/1.33  % (779829)Refutation found. Thanks to Tanya!
% 3.35/1.33  % SZS status Theorem for theBenchmark
% 3.35/1.33  % SZS output start Proof for theBenchmark
% See solution above
% 3.35/1.33  % (779829)------------------------------
% 3.35/1.33  % (779829)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.35/1.33  % (779829)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.35/1.33  % (779829)CaDiCaL version: 2.1.3
% 3.35/1.33  % (779829)Termination reason: Refutation
% 3.35/1.33  % (779829)Time elapsed: 0.002 s
% 3.35/1.33  % (779829)Peak memory usage: 88 MB
% 3.35/1.33  % (779829)Instructions burned: 2 (million)
% 3.35/1.33  % (779829)------------------------------
% 3.35/1.33  % (779829)------------------------------
% 3.35/1.33  % (779818)Success in time 0.406 s
% 3.35/1.33  % Vampire exiting
%------------------------------------------------------------------------------