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

% Computer : n016.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 01:40:04 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    is_state(undefined_state(state)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gsy_c_HOL_Oundefined_000tc__Com__Ostate) ).

fof(f2,axiom,
    ( hoare_165779456gleton
  <=> ? [X0,X1] :
        ( is_state(X0)
        & is_state(X1)
        & X0 != X1 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_state__not__singleton__def) ).

fof(f6,axiom,
    hoare_165779456gleton,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).

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

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

fof(f9,plain,
    ( hoare_165779456gleton
   => ? [X0,X1] :
        ( is_state(X0)
        & is_state(X1)
        & X0 != X1 ) ),
    inference(unused_predicate_definition_removal,[],[f2]) ).

fof(f13,plain,
    ( ? [X0,X1] :
        ( is_state(X0)
        & is_state(X1)
        & X0 != X1 )
    | ~ hoare_165779456gleton ),
    inference(ennf_transformation,[],[f9]) ).

fof(f14,plain,
    ? [X0] :
      ( ! [X1] :
          ( X1 = X0
          | ~ is_state(X1) )
      & is_state(X0) ),
    inference(ennf_transformation,[],[f8]) ).

fof(f15,plain,
    ( ( is_state(sK0)
      & is_state(sK1)
      & sK0 != sK1 )
    | ~ hoare_165779456gleton ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f13]) ).

fof(f16,plain,
    ( ! [X1] :
        ( sK2 = X1
        | ~ is_state(X1) )
    & is_state(sK2) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X0,sK2)],[f14]) ).

fof(f17,plain,
    is_state(undefined_state(state)),
    inference(cnf_transformation,[],[f1]) ).

fof(f18,plain,
    ( sK0 != sK1
    | ~ hoare_165779456gleton ),
    inference(cnf_transformation,[],[f15]) ).

fof(f19,plain,
    ( is_state(sK1)
    | ~ hoare_165779456gleton ),
    inference(cnf_transformation,[],[f15]) ).

fof(f20,plain,
    ( is_state(sK0)
    | ~ hoare_165779456gleton ),
    inference(cnf_transformation,[],[f15]) ).

fof(f21,plain,
    hoare_165779456gleton,
    inference(cnf_transformation,[],[f6]) ).

fof(f23,plain,
    ! [X0] :
      ( sK2 = X0
      | ~ is_state(X0) ),
    inference(cnf_transformation,[],[f16]) ).

fof(f24,plain,
    ( is_state(sK0)
    | hoare_165779456gleton ),
    inference(consistent_polarity_flipping,[],[f20]) ).

fof(f25,plain,
    ( is_state(sK1)
    | hoare_165779456gleton ),
    inference(consistent_polarity_flipping,[],[f19]) ).

fof(f26,plain,
    ( sK0 != sK1
    | hoare_165779456gleton ),
    inference(consistent_polarity_flipping,[],[f18]) ).

fof(f27,plain,
    ~ hoare_165779456gleton,
    inference(consistent_polarity_flipping,[],[f21]) ).

fof(f37,plain,
    $false,
    inference(finite_model_not_found_(exhaustively_excluded_all_possible_domain_size_assignments),[],[f17,f24,f25,f26,f27,f23]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWW469+1 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.18  % Computer : n016.cluster.edu
% 0.09/0.18  % Model    : x86_64 x86_64
% 0.09/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18  % Memory   : 8046.5625MB
% 0.09/0.18  % OS       : Linux 6.8.0-71-generic
% 0.09/0.18  % CPULimit : 300
% 0.09/0.18  % WCLimit  : 300
% 0.09/0.18  % DateTime : Mon Sep 28 14:05:48 UTC 2026
% 0.09/0.18  % CPUTime  : 
% 0.09/0.18  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.21  Running first-order model finding
% 0.09/0.21  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.09/0.24  % (3642323)Will run a generic schedule for satisfiability detection.
% 0.09/0.24  % (3642328)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1478432855_2999 on theBenchmark for (2999ds/0Mi)
% 0.09/0.24  % TRYING [1]
% 0.09/0.24  % TRYING [2]
% 0.09/0.24  % (3642328) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3642323-3642328"...
% 0.09/0.24  % (3642328)...printing done.
% 0.09/0.24  % (3642328)Refutation found. Thanks to Tanya!
% 0.09/0.24  % SZS status Theorem for theBenchmark
% 0.09/0.24  % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.24  % (3642328)------------------------------
% 0.09/0.24  % (3642328)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.24  % (3642328)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.24  % (3642328)CaDiCaL version: 2.1.3
% 0.09/0.24  % (3642328)Termination reason: Refutation
% 0.09/0.24  % (3642328)Time elapsed: 0.001 s
% 0.09/0.24  % (3642328)Peak memory usage: 11 MB
% 0.09/0.24  % (3642328)Instructions burned: 1 (million)
% 0.09/0.24  % (3642323)Success in time 0.024 s
% 0.09/0.24  % Vampire exiting
%------------------------------------------------------------------------------