↑ 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  : SET027+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% Computer : n019.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:42:42 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] :
      ( subclass(X0,X1)
    <=> ! [X2] :
          ( member(X2,X0)
         => member(X2,X1) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',subclass_defn) ).

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

fof(f45,negated_conjecture,
    ~ ! [X0,X1,X2] :
        ( ( subclass(X0,X1)
          & subclass(X1,X2) )
       => subclass(X0,X2) ),
    inference(negated_conjecture,[status(cth)],[f44]) ).

fof(f47,plain,
    ! [X0,X1] :
      ( subclass(X0,X1)
    <=> ! [X2] :
          ( member(X2,X1)
          | ~ member(X2,X0) ) ),
    inference(ennf_transformation,[],[f1]) ).

fof(f60,plain,
    ? [X0,X1,X2] :
      ( ~ subclass(X0,X2)
      & subclass(X0,X1)
      & subclass(X1,X2) ),
    inference(ennf_transformation,[],[f45]) ).

fof(f61,plain,
    ? [X0,X1,X2] :
      ( ~ subclass(X0,X2)
      & subclass(X0,X1)
      & subclass(X1,X2) ),
    inference(flattening,[],[f60]) ).

fof(f62,plain,
    ! [X2,X0,X1] :
      ( ~ subclass(X0,X1)
      | member(X2,X1)
      | ~ member(X2,X0) ),
    inference(cnf_transformation,[],[f47]) ).

fof(f63,plain,
    ! [X0,X1] :
      ( member(sK0(X0,X1),X0)
      | subclass(X0,X1) ),
    inference(cnf_transformation,[],[f47]) ).

fof(f64,plain,
    ! [X0,X1] :
      ( ~ member(sK0(X0,X1),X1)
      | subclass(X0,X1) ),
    inference(cnf_transformation,[],[f47]) ).

fof(f149,plain,
    subclass(sK7,sK8),
    inference(cnf_transformation,[],[f61]) ).

fof(f150,plain,
    subclass(sK6,sK7),
    inference(cnf_transformation,[],[f61]) ).

fof(f151,plain,
    ~ subclass(sK6,sK8),
    inference(cnf_transformation,[],[f61]) ).

fof(f259,plain,
    ! [X0] :
      ( member(X0,sK7)
      | ~ member(X0,sK6) ),
    inference(resolution,[],[f62,f150]) ).

fof(f260,plain,
    ! [X0] :
      ( member(X0,sK8)
      | ~ member(X0,sK7) ),
    inference(resolution,[],[f62,f149]) ).

fof(f357,plain,
    ! [X0] :
      ( ~ member(sK0(X0,sK8),sK7)
      | subclass(X0,sK8) ),
    inference(resolution,[],[f260,f64]) ).

fof(f363,plain,
    ! [X0] :
      ( ~ member(sK0(X0,sK8),sK6)
      | subclass(X0,sK8) ),
    inference(resolution,[],[f357,f259]) ).

fof(f366,plain,
    ( subclass(sK6,sK8)
    | subclass(sK6,sK8) ),
    inference(resolution,[],[f363,f63]) ).

fof(f367,plain,
    subclass(sK6,sK8),
    inference(duplicate_literal_removal,[],[f366]) ).

fof(f368,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f367,f151]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SET027+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37  % Computer : n019.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Mon Sep 28 00:13:49 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41  Running first-order model finding
% 0.11/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.11/0.45  % (3544043)Will run a generic schedule for satisfiability detection.
% 0.11/0.45  % (3544049)% WARNING: option uhcvi not known.
% 0.11/0.45  % (3544049)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1240792385:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.11/0.45  % (3544049) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3544043-3544049"...
% 0.11/0.45  % (3544052)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2397657976:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.11/0.45  % (3544048)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1190426753_2999 on theBenchmark for (2999ds/0Mi)
% 0.11/0.45  % (3544050)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2962153831:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.11/0.45  % (3544051)dis+10_1_sil=32000:sp=arity:random_seed=1565778405:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.11/0.45  % (3544049)...printing done.
% 0.11/0.45  % (3544053)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4174290583:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.11/0.45  % (3544054)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=110333360:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.11/0.45  % (3544049)Refutation found. Thanks to Tanya!
% 0.11/0.45  % SZS status Theorem for theBenchmark
% 0.11/0.45  % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.45  % (3544049)------------------------------
% 0.11/0.45  % (3544049)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.45  % (3544049)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.45  % (3544049)CaDiCaL version: 2.1.3
% 0.11/0.45  % (3544049)Termination reason: Refutation
% 0.11/0.45  % (3544049)Time elapsed: 0.005 s
% 0.11/0.45  % (3544049)Peak memory usage: 12 MB
% 0.11/0.45  % (3544049)Instructions burned: 11 (million)
% 0.11/0.45  % (3544043)Success in time 0.034 s
% 0.11/0.45  % Vampire exiting
%------------------------------------------------------------------------------