↑ 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+1 : 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:58 PM UTC 2026

% Result   : Theorem 0.15s 0.47s
% Output   : Refutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   19 (   5 unt;   0 def)
%            Number of atoms       :   42 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   33 (  10   ~;  12   |;   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   :   32 (  26   !;   6   ?)

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

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

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

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

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

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

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

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

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

fof(f29,plain,
    subset(sK4,sK5),
    inference(cnf_transformation,[],[f17]) ).

fof(f30,plain,
    subset(sK3,sK4),
    inference(cnf_transformation,[],[f17]) ).

fof(f31,plain,
    ~ subset(sK3,sK5),
    inference(cnf_transformation,[],[f17]) ).

fof(f45,plain,
    ! [X2,X0,X1] :
      ( ~ subset(X0,X2)
      | in(sK0(X0,X1),X2)
      | subset(X0,X1) ),
    inference(resolution,[],[f22,f23]) ).

fof(f48,plain,
    ! [X0] :
      ( in(sK0(sK3,X0),sK4)
      | subset(sK3,X0) ),
    inference(resolution,[],[f45,f30]) ).

fof(f65,plain,
    ! [X0,X1] :
      ( ~ subset(sK4,X1)
      | in(sK0(sK3,X0),X1)
      | subset(sK3,X0) ),
    inference(resolution,[],[f48,f22]) ).

fof(f79,plain,
    ! [X0] :
      ( in(sK0(sK3,X0),sK5)
      | subset(sK3,X0) ),
    inference(resolution,[],[f65,f29]) ).

fof(f82,plain,
    ( subset(sK3,sK5)
    | subset(sK3,sK5) ),
    inference(resolution,[],[f79,f24]) ).

fof(f86,plain,
    subset(sK3,sK5),
    inference(duplicate_literal_removal,[],[f82]) ).

fof(f87,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f86,f31]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SEU121+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.39  % Computer : n020.cluster.edu
% 0.10/0.39  % Model    : x86_64 x86_64
% 0.10/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.39  % Memory   : 8046.5625MB
% 0.10/0.39  % OS       : Linux 6.8.0-71-generic
% 0.10/0.39  % CPULimit : 300
% 0.10/0.39  % WCLimit  : 300
% 0.10/0.39  % DateTime : Mon Sep 28 03:37:49 UTC 2026
% 0.10/0.39  % CPUTime  : 
% 0.10/0.39  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.42  Running first-order model finding
% 0.10/0.42  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.15/0.47  % (4001950)Will run a generic schedule for satisfiability detection.
% 0.15/0.47  % (4001955)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1695295800_2999 on theBenchmark for (2999ds/0Mi)
% 0.15/0.47  % TRYING [1]
% 0.15/0.47  % TRYING [2]
% 0.15/0.47  % TRYING [3]
% 0.15/0.47  % TRYING [4]
% 0.15/0.47  % TRYING [5]
% 0.15/0.47  % (4001956)% WARNING: option uhcvi not known.
% 0.15/0.47  % TRYING [6]
% 0.15/0.47  % TRYING [7]
% 0.15/0.47  % (4001956)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3316275961:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.15/0.47  % (4001957)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2447978936:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.15/0.47  % (4001958)dis+10_1_sil=32000:sp=arity:random_seed=4222342424:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.15/0.47  % (4001959)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1304835431:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.15/0.47  % TRYING [8]
% 0.15/0.47  % (4001961)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2540773000:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.15/0.47  % (4001960)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2862794978:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.15/0.47  % (4001956) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4001950-4001956"...
% 0.15/0.47  % (4001959) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4001950-4001959"...
% 0.15/0.47  % (4001958) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4001950-4001958"...
% 0.15/0.47  % (4001961) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4001950-4001961"...
% 0.15/0.47  % (4001960) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4001950-4001960"...
% 0.15/0.47  % (4001956)...printing done.
% 0.15/0.47  % (4001959)...printing done.
% 0.15/0.47  % (4001958)...printing done.
% 0.15/0.47  % (4001961)...printing done.
% 0.15/0.47  % TRYING [9]
% 0.15/0.47  % (4001960)...printing done.
% 0.15/0.47  % (4001956)Refutation found. Thanks to Tanya!
% 0.15/0.47  % SZS status Theorem for theBenchmark
% 0.15/0.47  % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.47  % (4001956)------------------------------
% 0.15/0.47  % (4001956)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.15/0.47  % (4001956)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/0.47  % (4001956)CaDiCaL version: 2.1.3
% 0.15/0.47  % (4001956)Termination reason: Refutation
% 0.15/0.47  % (4001956)Time elapsed: 0.003 s
% 0.15/0.47  % (4001956)Peak memory usage: 11 MB
% 0.15/0.47  % (4001956)Instructions burned: 2 (million)
% 0.15/0.47  % (4001950)Success in time 0.036 s
% 0.15/0.47  % Vampire exiting
%------------------------------------------------------------------------------