↑ 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  : SET942+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 : 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:45:03 PM UTC 2026

% Result   : Theorem 0.18s 0.47s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   26 (   4 unt;   0 def)
%            Number of atoms       :   61 (   4 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   61 (  26   ~;  26   |;   2   &)
%                                         (   4 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 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   :   49 (  46   !;   3   ?)

% 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(f3,axiom,
    ! [X0,X1] :
      ( X1 = union(X0)
    <=> ! [X2] :
          ( in(X2,X1)
        <=> ? [X3] :
              ( in(X2,X3)
              & in(X3,X0) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_tarski) ).

fof(f7,conjecture,
    ! [X0,X1] :
      ( subset(X0,X1)
     => subset(union(X0),union(X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t95_zfmisc_1) ).

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

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

fof(f12,plain,
    ? [X0,X1] :
      ( ~ subset(union(X0),union(X1))
      & subset(X0,X1) ),
    inference(ennf_transformation,[],[f8]) ).

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

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

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

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

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

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

fof(f26,plain,
    subset(sK6,sK7),
    inference(cnf_transformation,[],[f12]) ).

fof(f27,plain,
    ~ subset(union(sK6),union(sK7)),
    inference(cnf_transformation,[],[f12]) ).

fof(f28,plain,
    ! [X2,X3,X0] :
      ( ~ in(X2,X3)
      | ~ in(X3,X0)
      | in(X2,union(X0)) ),
    inference(equality_resolution,[],[f22]) ).

fof(f29,plain,
    ! [X2,X0] :
      ( in(X2,sK2(X0,X2))
      | ~ in(X2,union(X0)) ),
    inference(equality_resolution,[],[f21]) ).

fof(f30,plain,
    ! [X2,X0] :
      ( in(sK2(X0,X2),X0)
      | ~ in(X2,union(X0)) ),
    inference(equality_resolution,[],[f20]) ).

fof(f36,plain,
    ! [X0] :
      ( in(X0,sK7)
      | ~ in(X0,sK6) ),
    inference(resolution,[],[f14,f26]) ).

fof(f41,plain,
    ! [X2,X0,X1] :
      ( ~ in(sK2(X0,X1),X2)
      | in(X1,union(X2))
      | ~ in(X1,union(X0)) ),
    inference(resolution,[],[f28,f29]) ).

fof(f71,plain,
    ! [X0,X1] :
      ( ~ in(sK2(X1,X0),sK6)
      | ~ in(X0,union(X1))
      | in(X0,union(sK7)) ),
    inference(resolution,[],[f41,f36]) ).

fof(f87,plain,
    ! [X0] :
      ( ~ in(X0,union(sK6))
      | in(X0,union(sK7))
      | ~ in(X0,union(sK6)) ),
    inference(resolution,[],[f71,f30]) ).

fof(f88,plain,
    ! [X0] :
      ( ~ in(X0,union(sK6))
      | in(X0,union(sK7)) ),
    inference(duplicate_literal_removal,[],[f87]) ).

fof(f99,plain,
    ! [X0] :
      ( in(sK0(union(sK6),X0),union(sK7))
      | subset(union(sK6),X0) ),
    inference(resolution,[],[f88,f15]) ).

fof(f117,plain,
    ( subset(union(sK6),union(sK7))
    | subset(union(sK6),union(sK7)) ),
    inference(resolution,[],[f99,f16]) ).

fof(f122,plain,
    subset(union(sK6),union(sK7)),
    inference(duplicate_literal_removal,[],[f117]) ).

fof(f123,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f122,f27]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET942+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.13/0.40  % Computer : n019.cluster.edu
% 0.13/0.40  % Model    : x86_64 x86_64
% 0.13/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.40  % Memory   : 8046.5625MB
% 0.13/0.40  % OS       : Linux 6.8.0-71-generic
% 0.13/0.40  % CPULimit : 300
% 0.13/0.40  % WCLimit  : 300
% 0.13/0.40  % DateTime : Mon Sep 28 03:15:49 UTC 2026
% 0.13/0.40  % CPUTime  : 
% 0.13/0.40  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.43  Running first-order model finding
% 0.13/0.43  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.18/0.47  % (3627102)Will run a generic schedule for satisfiability detection.
% 0.18/0.47  % (3627112)% WARNING: option uhcvi not known.
% 0.18/0.47  % (3627112)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1526583892:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.47  % (3627112) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3627102-3627112"...
% 0.18/0.47  % (3627112)...printing done.
% 0.18/0.47  % (3627112)Refutation found. Thanks to Tanya!
% 0.18/0.47  % SZS status Theorem for theBenchmark
% 0.18/0.47  % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.47  % (3627112)------------------------------
% 0.18/0.47  % (3627112)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.47  % (3627112)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.47  % (3627112)CaDiCaL version: 2.1.3
% 0.18/0.47  % (3627112)Termination reason: Refutation
% 0.18/0.47  % (3627112)Time elapsed: 0.003 s
% 0.18/0.47  % (3627112)Peak memory usage: 11 MB
% 0.18/0.47  % (3627112)Instructions burned: 6 (million)
% 0.18/0.47  % (3627102)Success in time 0.027 s
% 0.18/0.47  % Vampire exiting
%------------------------------------------------------------------------------