↑ 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  : SEU155+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT

% Computer : n006.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:52:08 PM UTC 2026

% Result   : Theorem 0.17s 0.48s
% Output   : Refutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   24 (   4 unt;   0 def)
%            Number of atoms       :   99 (   8 equ)
%            Maximal formula atoms :   14 (   4 avg)
%            Number of connectives :  118 (  43   ~;  44   |;  24   &)
%                                         (   4 <=>;   3  =>;   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    :    7 (   7 usr;   2 con; 0-2 aty)
%            Number of variables   :   61 (  50   !;  11   ?)

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

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

fof(f40,conjecture,
    ! [X0,X1] :
      ( in(X0,X1)
     => subset(X0,union(X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l50_zfmisc_1) ).

fof(f41,negated_conjecture,
    ~ ! [X0,X1] :
        ( in(X0,X1)
       => subset(X0,union(X1)) ),
    inference(negated_conjecture,[status(cth)],[f40]) ).

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

fof(f101,plain,
    ? [X0,X1] :
      ( ~ subset(X0,union(X1))
      & in(X0,X1) ),
    inference(ennf_transformation,[],[f41]) ).

fof(f147,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,[],[f91]) ).

fof(f148,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,[],[f147]) ).

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

fof(f154,plain,
    ! [X0,X1] :
      ( ( X1 = union(X0)
        | ? [X2] :
            ( ( ! [X3] :
                  ( ~ in(X2,X3)
                  | ~ in(X3,X0) )
              | ~ in(X2,X1) )
            & ( ? [X3] :
                  ( in(X2,X3)
                  & in(X3,X0) )
              | in(X2,X1) ) ) )
      & ( ! [X2] :
            ( ( in(X2,X1)
              | ! [X3] :
                  ( ~ in(X2,X3)
                  | ~ in(X3,X0) ) )
            & ( ? [X3] :
                  ( in(X2,X3)
                  & in(X3,X0) )
              | ~ in(X2,X1) ) )
        | union(X0) != X1 ) ),
    inference(nnf_transformation,[],[f14]) ).

fof(f155,plain,
    ! [X0,X1] :
      ( ( X1 = union(X0)
        | ? [X2] :
            ( ( ! [X3] :
                  ( ~ in(X2,X3)
                  | ~ in(X3,X0) )
              | ~ in(X2,X1) )
            & ( ? [X4] :
                  ( in(X2,X4)
                  & in(X4,X0) )
              | in(X2,X1) ) ) )
      & ( ! [X5] :
            ( ( in(X5,X1)
              | ! [X6] :
                  ( ~ in(X5,X6)
                  | ~ in(X6,X0) ) )
            & ( ? [X7] :
                  ( in(X5,X7)
                  & in(X7,X0) )
              | ~ in(X5,X1) ) )
        | union(X0) != X1 ) ),
    inference(rectify,[],[f154]) ).

fof(f156,plain,
    ! [X0,X1] :
      ( ( X1 = union(X0)
        | ( ( ! [X3] :
                ( ~ in(sK7(X0,X1),X3)
                | ~ in(X3,X0) )
            | ~ in(sK7(X0,X1),X1) )
          & ( ( in(sK7(X0,X1),sK8(X0,X1))
              & in(sK8(X0,X1),X0) )
            | in(sK7(X0,X1),X1) ) ) )
      & ( ! [X5] :
            ( ( in(X5,X1)
              | ! [X6] :
                  ( ~ in(X5,X6)
                  | ~ in(X6,X0) ) )
            & ( ( in(X5,sK9(X0,X5))
                & in(sK9(X0,X5),X0) )
              | ~ in(X5,X1) ) )
        | union(X0) != X1 ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK7,sK8,sK9]),skolemize(X2,sK7(X0,X1)),skolemize(X4,sK8(X0,X1)),skolemize(X7,sK9(X0,X5))],[f155]) ).

fof(f166,plain,
    ( ~ subset(sK11,union(sK12))
    & in(sK11,sK12) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK11,sK12]),skolemize(X0,sK11),skolemize(X1,sK12)],[f101]) ).

fof(f206,plain,
    ! [X0,X1] :
      ( in(sK5(X0,X1),X0)
      | subset(X0,X1) ),
    inference(cnf_transformation,[],[f149]) ).

fof(f207,plain,
    ! [X0,X1] :
      ( ~ in(sK5(X0,X1),X1)
      | subset(X0,X1) ),
    inference(cnf_transformation,[],[f149]) ).

fof(f216,plain,
    ! [X0,X1,X6,X5] :
      ( in(X5,X1)
      | ~ in(X5,X6)
      | ~ in(X6,X0)
      | union(X0) != X1 ),
    inference(cnf_transformation,[],[f156]) ).

fof(f247,plain,
    in(sK11,sK12),
    inference(cnf_transformation,[],[f166]) ).

fof(f248,plain,
    ~ subset(sK11,union(sK12)),
    inference(cnf_transformation,[],[f166]) ).

fof(f349,plain,
    ! [X0,X6,X5] :
      ( ~ in(X6,X0)
      | ~ in(X5,X6)
      | in(X5,union(X0)) ),
    inference(equality_resolution,[],[f216]) ).

fof(f899,plain,
    ! [X0] :
      ( in(X0,union(sK12))
      | ~ in(X0,sK11) ),
    inference(resolution,[],[f349,f247]) ).

fof(f910,plain,
    ! [X0] :
      ( ~ in(sK5(X0,union(sK12)),sK11)
      | subset(X0,union(sK12)) ),
    inference(resolution,[],[f899,f207]) ).

fof(f2153,plain,
    ( subset(sK11,union(sK12))
    | subset(sK11,union(sK12)) ),
    inference(resolution,[],[f910,f206]) ).

fof(f2154,plain,
    subset(sK11,union(sK12)),
    inference(duplicate_literal_removal,[],[f2153]) ).

fof(f2155,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f2154,f248]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SEU155+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.38  % Computer : n006.cluster.edu
% 0.09/0.38  % Model    : x86_64 x86_64
% 0.09/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.38  % Memory   : 8046.5625MB
% 0.09/0.38  % OS       : Linux 6.8.0-71-generic
% 0.09/0.38  % CPULimit : 300
% 0.09/0.38  % WCLimit  : 300
% 0.09/0.38  % DateTime : Mon Sep 28 03:46:25 UTC 2026
% 0.09/0.38  % CPUTime  : 
% 0.09/0.38  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.41  Running first-order model finding
% 0.09/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.17/0.48  % (3558218)Will run a generic schedule for satisfiability detection.
% 0.17/0.48  % (3558226)dis+10_1_sil=32000:sp=arity:random_seed=2541384147:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.48  % (3558224)% WARNING: option uhcvi not known.
% 0.17/0.48  % (3558223)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=463149705_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.48  % (3558224)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1789219655:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.48  % (3558225)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=988996815:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.48  % (3558227)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2021895385:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.48  % (3558228)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1477416067:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.48  % (3558229)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3116687204:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.48  % TRYING [1]
% 0.17/0.48  % TRYING [2]
% 0.17/0.48  % TRYING [3]
% 0.17/0.48  % TRYING [4]
% 0.17/0.48  % (3558226) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3558218-3558226"...
% 0.17/0.48  % (3558226)...printing done.
% 0.17/0.48  % (3558226)Refutation found. Thanks to Tanya!
% 0.17/0.48  % SZS status Theorem for theBenchmark
% 0.17/0.48  % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.48  % (3558226)------------------------------
% 0.17/0.48  % (3558226)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.48  % (3558226)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.48  % (3558226)CaDiCaL version: 2.1.3
% 0.17/0.48  % (3558226)Termination reason: Refutation
% 0.17/0.48  % (3558226)Time elapsed: 0.027 s
% 0.17/0.48  % (3558226)Peak memory usage: 12 MB
% 0.17/0.48  % (3558226)Instructions burned: 74 (million)
% 0.17/0.48  % (3558218)Success in time 0.055 s
% 0.17/0.48  % Vampire exiting
%------------------------------------------------------------------------------