↑ 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  : SET911+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 : n018.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:58 PM UTC 2026

% Result   : Theorem 0.10s 0.45s
% Output   : Refutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   11 (   4 unt;   0 def)
%            Number of atoms       :   18 (   9 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   13 (   6   ~;   2   |;   2   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    3 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   12 (  10   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f6,conjecture,
    ! [X0,X1] :
      ( in(X0,X1)
     => set_intersection2(X1,singleton(X0)) = singleton(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t52_zfmisc_1) ).

fof(f7,negated_conjecture,
    ~ ! [X0,X1] :
        ( in(X0,X1)
       => set_intersection2(X1,singleton(X0)) = singleton(X0) ),
    inference(negated_conjecture,[status(cth)],[f6]) ).

fof(f8,axiom,
    ! [X0,X1] :
      ( in(X0,X1)
     => set_intersection2(X1,singleton(X0)) = singleton(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l32_zfmisc_1) ).

fof(f11,plain,
    ? [X0,X1] :
      ( singleton(X0) != set_intersection2(X1,singleton(X0))
      & in(X0,X1) ),
    inference(ennf_transformation,[],[f7]) ).

fof(f12,plain,
    ! [X0,X1] :
      ( set_intersection2(X1,singleton(X0)) = singleton(X0)
      | ~ in(X0,X1) ),
    inference(ennf_transformation,[],[f8]) ).

fof(f15,plain,
    ( singleton(sK2) != set_intersection2(sK3,singleton(sK2))
    & in(sK2,sK3) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3]),skolemize(X0,sK2),skolemize(X1,sK3)],[f11]) ).

fof(f21,plain,
    in(sK2,sK3),
    inference(cnf_transformation,[],[f15]) ).

fof(f22,plain,
    singleton(sK2) != set_intersection2(sK3,singleton(sK2)),
    inference(cnf_transformation,[],[f15]) ).

fof(f23,plain,
    ! [X0,X1] :
      ( ~ in(X0,X1)
      | singleton(X0) = set_intersection2(X1,singleton(X0)) ),
    inference(cnf_transformation,[],[f12]) ).

fof(f25,plain,
    singleton(sK2) = set_intersection2(sK3,singleton(sK2)),
    inference(resolution,[],[f23,f21]) ).

fof(f26,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f25,f22]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SET911+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.10/0.37  % Computer : n018.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Mon Sep 28 03:11:55 UTC 2026
% 0.10/0.38  % CPUTime  : 
% 0.10/0.38  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.41  Running first-order model finding
% 0.10/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.10/0.45  % (2958044)Will run a generic schedule for satisfiability detection.
% 0.10/0.45  % (2958052)dis+10_1_sil=32000:sp=arity:random_seed=2233313882:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.10/0.45  % (2958052) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2958044-2958052"...
% 0.10/0.45  % (2958052)...printing done.
% 0.10/0.45  % (2958050)% WARNING: option uhcvi not known.
% 0.10/0.45  % (2958052)Refutation found. Thanks to Tanya!
% 0.10/0.45  % SZS status Theorem for theBenchmark
% 0.10/0.45  % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.45  % (2958052)------------------------------
% 0.10/0.45  % (2958052)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.45  % (2958052)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.45  % (2958052)CaDiCaL version: 2.1.3
% 0.10/0.45  % (2958052)Termination reason: Refutation
% 0.10/0.45  % (2958052)Time elapsed: 0.001 s
% 0.10/0.45  % (2958052)Peak memory usage: 11 MB
% 0.10/0.45  % (2958052)Instructions burned: 1 (million)
% 0.10/0.45  % (2958044)Success in time 0.036 s
% 0.10/0.46  % Vampire exiting
%------------------------------------------------------------------------------