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

% Computer : n003.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:55 PM UTC 2026

% Result   : Theorem 0.11s 0.46s
% Output   : Refutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   20 (   6 unt;   0 def)
%            Number of atoms       :   43 (  16 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   37 (  14   ~;  12   |;   1   &)
%                                         (   5 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   43 (  40   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f3,axiom,
    ! [X0,X1] :
      ( X1 = singleton(X0)
    <=> ! [X2] :
          ( in(X2,X1)
        <=> X2 = X0 ) ),
    file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',d2_tarski) ).

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

fof(f9,conjecture,
    ! [X0,X1,X2] :
      ( subset(unordered_pair(X0,X1),singleton(X2))
     => X0 = X2 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t26_zfmisc_1) ).

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

fof(f12,plain,
    ! [X0,X1] :
      ( subset(X0,X1)
     => ! [X2] :
          ( in(X2,X0)
         => in(X2,X1) ) ),
    inference(unused_predicate_definition_removal,[],[f5]) ).

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

fof(f15,plain,
    ? [X0,X1,X2] :
      ( X0 != X2
      & subset(unordered_pair(X0,X1),singleton(X2)) ),
    inference(ennf_transformation,[],[f10]) ).

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

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

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

fof(f32,plain,
    subset(unordered_pair(sK4,sK5),singleton(sK6)),
    inference(cnf_transformation,[],[f15]) ).

fof(f33,plain,
    sK4 != sK6,
    inference(cnf_transformation,[],[f15]) ).

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

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

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

fof(f52,plain,
    ! [X0] :
      ( ~ in(X0,unordered_pair(sK4,sK5))
      | in(X0,singleton(sK6)) ),
    inference(resolution,[],[f28,f32]) ).

fof(f58,plain,
    in(sK4,singleton(sK6)),
    inference(resolution,[],[f52,f38]) ).

fof(f64,plain,
    sK4 = sK6,
    inference(resolution,[],[f58,f34]) ).

fof(f66,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f64,f33]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET885+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37  % Computer : n003.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 03:08:11 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.37  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.40  Running first-order model finding
% 0.11/0.40  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.46  % (1145264)Will run a generic schedule for satisfiability detection.
% 0.11/0.46  % (1145275)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=560822639_2999 on theBenchmark for (2999ds/0Mi)
% 0.11/0.46  % TRYING [1]
% 0.11/0.46  % TRYING [2]
% 0.11/0.46  % TRYING [3]
% 0.11/0.46  % TRYING [4]
% 0.11/0.46  % (1145276)% WARNING: option uhcvi not known.
% 0.11/0.46  % TRYING [5]
% 0.11/0.46  % (1145276)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1429195005:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.11/0.46  % (1145278)dis+10_1_sil=32000:sp=arity:random_seed=4130432657:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.11/0.46  % TRYING [6]
% 0.11/0.46  % (1145277)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1292780311:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.11/0.46  % (1145279)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3289387242:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.11/0.46  % (1145278) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1145264-1145278"...
% 0.11/0.46  % (1145276) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1145264-1145276"...
% 0.11/0.46  % (1145278)...printing done.
% 0.11/0.46  % (1145276)...printing done.
% 0.11/0.46  % (1145277) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1145264-1145277"...
% 0.11/0.46  % (1145279) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1145264-1145279"...
% 0.11/0.46  % (1145280)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=212545735:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.11/0.46  % (1145276)Refutation found. Thanks to Tanya!
% 0.11/0.46  % SZS status Theorem for theBenchmark
% 0.11/0.46  % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.46  % (1145276)------------------------------
% 0.11/0.46  % (1145276)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.46  % (1145276)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.46  % (1145276)CaDiCaL version: 2.1.3
% 0.11/0.46  % (1145276)Termination reason: Refutation
% 0.11/0.46  % (1145276)Time elapsed: 0.003 s
% 0.11/0.46  % (1145276)Peak memory usage: 12 MB
% 0.11/0.46  % (1145276)Instructions burned: 2 (million)
% 0.11/0.46  % (1145264)Success in time 0.044 s
% 0.11/0.46  % Vampire exiting
%------------------------------------------------------------------------------