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

% Computer : n020.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:51:59 PM UTC 2026

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

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

fof(f15,conjecture,
    ! [X0,X1,X2] :
      ( ( subset(X0,X1)
        & subset(X1,X2) )
     => subset(X0,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_xboole_1) ).

fof(f16,negated_conjecture,
    ~ ! [X0,X1,X2] :
        ( ( subset(X0,X1)
          & subset(X1,X2) )
       => subset(X0,X2) ),
    inference(negated_conjecture,[status(cth)],[f15]) ).

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

fof(f29,plain,
    ? [X0,X1,X2] :
      ( ~ subset(X0,X2)
      & subset(X0,X1)
      & subset(X1,X2) ),
    inference(ennf_transformation,[],[f16]) ).

fof(f30,plain,
    ? [X0,X1,X2] :
      ( ~ subset(X0,X2)
      & subset(X0,X1)
      & subset(X1,X2) ),
    inference(flattening,[],[f29]) ).

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

fof(f41,plain,
    ! [X0,X1] :
      ( subset(X0,X1)
      | in(sK1(X0,X1),X0) ),
    inference(cnf_transformation,[],[f27]) ).

fof(f42,plain,
    ! [X0,X1] :
      ( subset(X0,X1)
      | ~ in(sK1(X0,X1),X1) ),
    inference(cnf_transformation,[],[f27]) ).

fof(f57,plain,
    subset(sK6,sK7),
    inference(cnf_transformation,[],[f30]) ).

fof(f58,plain,
    subset(sK5,sK6),
    inference(cnf_transformation,[],[f30]) ).

fof(f59,plain,
    ~ subset(sK5,sK7),
    inference(cnf_transformation,[],[f30]) ).

fof(f94,plain,
    in(sK1(sK5,sK7),sK5),
    inference(resolution,[],[f41,f59]) ).

fof(f97,plain,
    ~ in(sK1(sK5,sK7),sK7),
    inference(resolution,[],[f42,f59]) ).

fof(f124,plain,
    ! [X0] :
      ( in(X0,sK7)
      | ~ in(X0,sK6) ),
    inference(resolution,[],[f40,f57]) ).

fof(f125,plain,
    ! [X0] :
      ( in(X0,sK6)
      | ~ in(X0,sK5) ),
    inference(resolution,[],[f40,f58]) ).

fof(f131,plain,
    ~ in(sK1(sK5,sK7),sK6),
    inference(resolution,[],[f124,f97]) ).

fof(f146,plain,
    ~ in(sK1(sK5,sK7),sK5),
    inference(resolution,[],[f125,f131]) ).

fof(f147,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f146,f94]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU121+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.37  % Computer : n020.cluster.edu
% 0.09/0.37  % Model    : x86_64 x86_64
% 0.09/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37  % Memory   : 8046.5625MB
% 0.09/0.37  % OS       : Linux 6.8.0-71-generic
% 0.09/0.37  % CPULimit : 300
% 0.09/0.37  % WCLimit  : 300
% 0.09/0.37  % DateTime : Mon Sep 28 03:38:20 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.41  Running first-order model finding
% 0.09/0.41  Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.34/0.46  % (4002771)Will run a generic schedule for satisfiability detection.
% 0.34/0.46  % (4002776)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3215472373_2999 on theBenchmark for (2999ds/0Mi)
% 0.34/0.46  % TRYING [1]
% 0.34/0.46  % TRYING [2]
% 0.34/0.46  % TRYING [3]
% 0.34/0.46  % TRYING [4]
% 0.34/0.46  % (4002777)% WARNING: option uhcvi not known.
% 0.34/0.46  % (4002777)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1817332106:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.34/0.46  % (4002778)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3661077811:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.34/0.46  % (4002779)dis+10_1_sil=32000:sp=arity:random_seed=763235536:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.34/0.46  % (4002780)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4042876819:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.34/0.46  % TRYING [5]
% 0.34/0.46  % (4002782)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3859128910:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.34/0.46  % (4002781)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1284749562:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.34/0.46  % (4002780) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4002771-4002780"...
% 0.34/0.46  % (4002780)...printing done.
% 0.34/0.46  % (4002781) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4002771-4002781"...
% 0.34/0.46  % (4002781)...printing done.
% 0.34/0.46  % (4002780)Refutation found. Thanks to Tanya!
% 0.34/0.46  % SZS status Theorem for theBenchmark
% 0.34/0.46  % SZS output start Proof for theBenchmark
% See solution above
% 0.34/0.46  % (4002780)------------------------------
% 0.34/0.46  % (4002780)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.34/0.46  % (4002780)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.34/0.46  % (4002780)CaDiCaL version: 2.1.3
% 0.34/0.46  % (4002780)Termination reason: Refutation
% 0.34/0.46  % (4002780)Time elapsed: 0.004 s
% 0.34/0.46  % (4002780)Peak memory usage: 12 MB
% 0.34/0.46  % (4002780)Instructions burned: 4 (million)
% 0.34/0.46  % (4002771)Success in time 0.046 s
% 0.34/0.46  % Vampire exiting
%------------------------------------------------------------------------------