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

% Computer : n012.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:44:53 PM UTC 2026

% Result   : Theorem 0.06s 0.34s
% Output   : Refutation 0.06s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   20 (  10 unt;   0 def)
%            Number of atoms       :   37 (  12 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   30 (  13   ~;  10   |;   0   &)
%                                         (   6 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 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-2 aty)
%            Number of variables   :   37 (  35   !;   2   ?)

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

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

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

fof(f9,conjecture,
    ! [X0,X1] : subset(singleton(X0),unordered_pair(X0,X1)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t12_zfmisc_1) ).

fof(f10,negated_conjecture,
    ~ ! [X0,X1] : subset(singleton(X0),unordered_pair(X0,X1)),
    inference(negated_conjecture,[status(cth)],[f9]) ).

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

fof(f14,plain,
    ? [X0,X1] : ~ subset(singleton(X0),unordered_pair(X0,X1)),
    inference(ennf_transformation,[],[f10]) ).

fof(f18,plain,
    ! [X2,X0,X1] :
      ( X0 = X2
      | ~ in(X2,X1)
      | singleton(X0) != X1 ),
    inference(cnf_transformation,[],[f3]) ).

fof(f26,plain,
    ! [X2,X3,X0,X1] :
      ( X0 != X3
      | in(X3,X2)
      | unordered_pair(X0,X1) != X2 ),
    inference(cnf_transformation,[],[f4]) ).

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

fof(f29,plain,
    ! [X0,X1] :
      ( subset(X0,X1)
      | ~ in(sK2(X0,X1),X1) ),
    inference(cnf_transformation,[],[f13]) ).

fof(f33,plain,
    ~ subset(singleton(sK5),unordered_pair(sK5,sK6)),
    inference(cnf_transformation,[],[f14]) ).

fof(f34,plain,
    ! [X2,X0] :
      ( ~ in(X2,singleton(X0))
      | X0 = X2 ),
    inference(equality_resolution,[],[f18]) ).

fof(f37,plain,
    ! [X2,X3,X1] :
      ( in(X3,X2)
      | unordered_pair(X3,X1) != X2 ),
    inference(equality_resolution,[],[f26]) ).

fof(f38,plain,
    ! [X3,X1] : in(X3,unordered_pair(X3,X1)),
    inference(equality_resolution,[],[f37]) ).

fof(f47,plain,
    in(sK2(singleton(sK5),unordered_pair(sK5,sK6)),singleton(sK5)),
    inference(resolution,[],[f28,f33]) ).

fof(f48,plain,
    ~ in(sK2(singleton(sK5),unordered_pair(sK5,sK6)),unordered_pair(sK5,sK6)),
    inference(resolution,[],[f29,f33]) ).

fof(f49,plain,
    sK5 = sK2(singleton(sK5),unordered_pair(sK5,sK6)),
    inference(resolution,[],[f47,f34]) ).

fof(f67,plain,
    ~ in(sK5,unordered_pair(sK5,sK6)),
    inference(superposition,[],[f48,f49]) ).

fof(f68,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f67,f38]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : SET872+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.03  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.04/0.30  % Computer : n012.cluster.edu
% 0.04/0.30  % Model    : x86_64 x86_64
% 0.04/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.30  % Memory   : 8046.5625MB
% 0.04/0.30  % OS       : Linux 6.8.0-71-generic
% 0.04/0.30  % CPULimit : 300
% 0.04/0.30  % WCLimit  : 300
% 0.04/0.30  % DateTime : Mon Sep 28 03:04:33 UTC 2026
% 0.04/0.30  % CPUTime  : 
% 0.04/0.30  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.04/0.32  Running first-order model finding
% 0.04/0.32  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.06/0.34  % (2977699)Will run a generic schedule for satisfiability detection.
% 0.06/0.34  % (2977705)% WARNING: option uhcvi not known.
% 0.06/0.34  % (2977705)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1299542928:i=135531:add=off:rawr=on_3000 on theBenchmark for (3000ds/135531Mi)
% 0.06/0.34  % (2977706)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2362382393:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 0.06/0.34  % (2977704)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=326752839_3000 on theBenchmark for (3000ds/0Mi)
% 0.06/0.34  % (2977707)dis+10_1_sil=32000:sp=arity:random_seed=1618385869:i=103:fgj=on_3000 on theBenchmark for (3000ds/103Mi)
% 0.06/0.34  % (2977708)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1753896852:i=116_3000 on theBenchmark for (3000ds/116Mi)
% 0.06/0.34  % (2977709)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3110279839:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 0.06/0.34  % (2977710)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1891618370:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_3000 on theBenchmark for (3000ds/159Mi)
% 0.06/0.34  % TRYING [1]
% 0.06/0.34  % TRYING [2]
% 0.06/0.34  % TRYING [3]
% 0.06/0.34  % (2977708) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2977699-2977708"...
% 0.06/0.34  % (2977707) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2977699-2977707"...
% 0.06/0.34  % (2977710) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2977699-2977710"...
% 0.06/0.34  % TRYING [4]
% 0.06/0.34  % (2977709) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2977699-2977709"...
% 0.06/0.34  % (2977706) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2977699-2977706"...
% 0.06/0.34  % (2977708)...printing done.
% 0.06/0.34  % (2977707)...printing done.
% 0.06/0.34  % (2977705) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2977699-2977705"...
% 0.06/0.34  % (2977710)...printing done.
% 0.06/0.34  % (2977708)Refutation found. Thanks to Tanya!
% 0.06/0.34  % SZS status Theorem for theBenchmark
% 0.06/0.34  % SZS output start Proof for theBenchmark
% See solution above
% 0.06/0.34  % (2977708)------------------------------
% 0.06/0.34  % (2977708)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.06/0.34  % (2977708)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.06/0.34  % (2977708)CaDiCaL version: 2.1.3
% 0.06/0.34  % (2977708)Termination reason: Refutation
% 0.06/0.34  % (2977708)Time elapsed: 0.001 s
% 0.06/0.34  % (2977708)Peak memory usage: 12 MB
% 0.06/0.34  % (2977708)Instructions burned: 3 (million)
% 0.06/0.34  % (2977699)Success in time 0.015 s
% 0.06/0.34  % Vampire exiting
%------------------------------------------------------------------------------