↑ 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  : SEU153+2 : 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 : n002.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:52:08 PM UTC 2026

% Result   : Theorem 0.18s 0.47s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   25 (  10 unt;   0 def)
%            Number of atoms       :   46 (  13 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   39 (  18   ~;  11   |;   4   &)
%                                         (   5 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   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   :   43 (  41   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f10,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(f14,axiom,
    ! [X0,X1,X2] :
      ( X2 = set_difference(X0,X1)
    <=> ! [X3] :
          ( in(X3,X2)
        <=> ( in(X3,X0)
            & ~ in(X3,X1) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_xboole_0) ).

fof(f32,conjecture,
    ! [X0,X1] :
      ~ ( disjoint(singleton(X0),X1)
        & in(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l25_zfmisc_1) ).

fof(f33,negated_conjecture,
    ~ ! [X0,X1] :
        ~ ( disjoint(singleton(X0),X1)
          & in(X0,X1) ),
    inference(negated_conjecture,[status(cth)],[f32]) ).

fof(f41,axiom,
    ! [X0,X1] :
      ( disjoint(X0,X1)
     => disjoint(X1,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_r1_xboole_0) ).

fof(f68,axiom,
    ! [X0] : unordered_pair(X0,X0) = singleton(X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t69_enumset1) ).

fof(f73,axiom,
    ! [X0,X1] :
      ( disjoint(X0,X1)
    <=> set_difference(X0,X1) = X0 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t83_xboole_1) ).

fof(f93,plain,
    ? [X0,X1] :
      ( disjoint(singleton(X0),X1)
      & in(X0,X1) ),
    inference(ennf_transformation,[],[f33]) ).

fof(f96,plain,
    ! [X0,X1] :
      ( disjoint(X1,X0)
      | ~ disjoint(X0,X1) ),
    inference(ennf_transformation,[],[f41]) ).

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

fof(f164,plain,
    ! [X2,X3,X0,X1] :
      ( ~ in(X3,X1)
      | ~ in(X3,X2)
      | set_difference(X0,X1) != X2 ),
    inference(cnf_transformation,[],[f14]) ).

fof(f178,plain,
    in(sK8,sK9),
    inference(cnf_transformation,[],[f93]) ).

fof(f179,plain,
    disjoint(singleton(sK8),sK9),
    inference(cnf_transformation,[],[f93]) ).

fof(f191,plain,
    ! [X0,X1] :
      ( ~ disjoint(X0,X1)
      | disjoint(X1,X0) ),
    inference(cnf_transformation,[],[f96]) ).

fof(f223,plain,
    ! [X0] : singleton(X0) = unordered_pair(X0,X0),
    inference(cnf_transformation,[],[f68]) ).

fof(f229,plain,
    ! [X0,X1] :
      ( ~ disjoint(X0,X1)
      | set_difference(X0,X1) = X0 ),
    inference(cnf_transformation,[],[f73]) ).

fof(f250,plain,
    disjoint(unordered_pair(sK8,sK8),sK9),
    inference(definition_unfolding,[],[f179,f223]) ).

fof(f278,plain,
    ! [X2,X3,X0] :
      ( in(X3,X2)
      | unordered_pair(X0,X3) != X2 ),
    inference(equality_resolution,[],[f144]) ).

fof(f279,plain,
    ! [X3,X0] : in(X3,unordered_pair(X0,X3)),
    inference(equality_resolution,[],[f278]) ).

fof(f289,plain,
    ! [X3,X0,X1] :
      ( ~ in(X3,set_difference(X0,X1))
      | ~ in(X3,X1) ),
    inference(equality_resolution,[],[f164]) ).

fof(f314,plain,
    disjoint(sK9,unordered_pair(sK8,sK8)),
    inference(resolution,[],[f191,f250]) ).

fof(f409,plain,
    sK9 = set_difference(sK9,unordered_pair(sK8,sK8)),
    inference(resolution,[],[f229,f314]) ).

fof(f512,plain,
    ! [X0] :
      ( ~ in(X0,unordered_pair(sK8,sK8))
      | ~ in(X0,sK9) ),
    inference(superposition,[],[f289,f409]) ).

fof(f514,plain,
    ~ in(sK8,sK9),
    inference(resolution,[],[f512,f279]) ).

fof(f517,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f514,f178]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SEU153+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.39  % Computer : n002.cluster.edu
% 0.12/0.39  % Model    : x86_64 x86_64
% 0.12/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39  % Memory   : 8046.5625MB
% 0.12/0.39  % OS       : Linux 6.8.0-71-generic
% 0.12/0.39  % CPULimit : 300
% 0.12/0.39  % WCLimit  : 300
% 0.12/0.39  % DateTime : Mon Sep 28 03:49:07 UTC 2026
% 0.12/0.39  % CPUTime  : 
% 0.12/0.39  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.43  Running first-order model finding
% 0.12/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  % (4130297)Will run a generic schedule for satisfiability detection.
% 0.18/0.47  % (4130306)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4237250700:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.47  % (4130303)% WARNING: option uhcvi not known.
% 0.18/0.47  % (4130306) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4130297-4130306"...
% 0.18/0.47  % (4130306)...printing done.
% 0.18/0.47  % (4130302)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2752301805_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.47  % (4130303)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3994568902:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.47  % (4130306)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  % (4130306)------------------------------
% 0.18/0.47  % (4130306)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.47  % (4130306)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.47  % (4130306)CaDiCaL version: 2.1.3
% 0.18/0.47  % (4130306)Termination reason: Refutation
% 0.18/0.47  % (4130306)Time elapsed: 0.006 s
% 0.18/0.47  % (4130306)Peak memory usage: 12 MB
% 0.18/0.47  % (4130306)Instructions burned: 15 (million)
% 0.18/0.47  % (4130297)Success in time 0.031 s
% 0.18/0.47  % Vampire exiting
%------------------------------------------------------------------------------