↑ 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 : 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 : Wed Sep 30 08:40:21 AM UTC 2026

% Result   : Theorem 0.06s 0.23s
% Output   : Refutation 0.06s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   15 (  11 unt;   0 typ;   0 def)
%            Number of atoms       :   25 (  14 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   15 (  11   ~;   2   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of FOOLs       :    6 (   6 fml;   0 var)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    6 (   3 usr;   5 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   14 (   9   !;   5   ?;  14   :)

% Comments : 
%------------------------------------------------------------------------------
tff(type_def_5,type,
    state: $tType ).

tff(func_def_0,type,
    induct_false: $o ).

tff(func_def_1,type,
    induct_true: $o ).

tff(func_def_2,type,
    hoare_1821564147gleton: $o ).

tff(func_def_5,type,
    sK0: state ).

tff(func_def_6,type,
    sK1: state ).

tff(func_def_7,type,
    sK2: state ).

tff(f1,axiom,
    ( hoare_1821564147gleton
  <=> ? [X0: state,X1: state] : ( X0 != X1 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_state__not__singleton__def) ).

tff(f5,axiom,
    hoare_1821564147gleton,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).

tff(f6,conjecture,
    ! [X0: state] :
      ~ ! [X1: state] : ( X1 = X0 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_1) ).

tff(f7,negated_conjecture,
    ~ ! [X0: state] :
        ~ ! [X1: state] : ( X1 = X0 ),
    inference(negated_conjecture,[status(cth)],[f6]) ).

tff(f8,plain,
    ( hoare_1821564147gleton
  <=> ? [X0: state,X1: state] : ( X0 != X1 ) ),
    inference(rectify,[],[f1]) ).

tff(f12,plain,
    hoare_1821564147gleton,
    inference(rectify,[],[f5]) ).

tff(f14,plain,
    ? [X0: state] :
    ! [X1: state] : ( X1 = X0 ),
    inference(ennf_transformation,[],[f7]) ).

tff(f16,plain,
    ( ( sK0 != sK1 )
    | ( hoare_1821564147gleton != $true ) ),
    inference(cnf_transformation,[],[f8]) ).

tff(f20,plain,
    hoare_1821564147gleton = $true,
    inference(cnf_transformation,[],[f12]) ).

tff(f21,plain,
    ! [X1: state] : ( sK2 = X1 ),
    inference(cnf_transformation,[],[f14]) ).

tff(f24,plain,
    ( ( sK0 != sK1 )
    | ( $true != $true ) ),
    inference(definition_unfolding,[],[f16,f20]) ).

tff(f27,plain,
    sK0 != sK1,
    inference(trivial_inequality_removal,[],[f24]) ).

tff(f28,plain,
    ! [X0: state,X1: state] : ( X0 = X1 ),
    inference(superposition,[],[f21,f21]) ).

tff(f32,plain,
    ! [X0: state] : ( sK0 != X0 ),
    inference(superposition,[],[f27,f28]) ).

tff(f33,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f32,f28]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % 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.06/0.17  % Computer : n003.cluster.edu
% 0.06/0.17  % Model    : x86_64 x86_64
% 0.06/0.17  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.17  % Memory   : 8046.5625MB
% 0.06/0.17  % OS       : Linux 6.8.0-71-generic
% 0.06/0.17  % CPULimit : 300
% 0.06/0.17  % WCLimit  : 300
% 0.06/0.17  % DateTime : Tue Sep 29 16:06:44 UTC 2026
% 0.06/0.17  % CPUTime  : 
% 0.06/0.17  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.06/0.19  Running first-order model finding
% 0.06/0.19  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.06/0.23  % (2678599)Will run a generic schedule for satisfiability detection.
% 0.06/0.23  % (2678608)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4283061740:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.06/0.23  % (2678608) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2678599-2678608"...
% 0.06/0.23  % (2678608)...printing done.
% 0.06/0.23  % (2678608)Refutation found. Thanks to Tanya!
% 0.06/0.23  % SZS status Theorem for theBenchmark
% 0.06/0.23  % SZS output start Proof for theBenchmark
% See solution above
% 0.06/0.23  % (2678608)------------------------------
% 0.06/0.23  % (2678608)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.06/0.23  % (2678608)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.06/0.23  % (2678608)CaDiCaL version: 2.1.3
% 0.06/0.23  % (2678608)Termination reason: Refutation
% 0.06/0.23  % (2678608)Time elapsed: 0.001 s
% 0.06/0.23  % (2678608)Peak memory usage: 12 MB
% 0.06/0.23  % (2678599)Success in time 0.027 s
% 0.06/0.23  % Vampire exiting
%------------------------------------------------------------------------------