↑ 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  : NUM635^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT

% Computer : n012.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:19:09 AM UTC 2026

% Result   : Theorem 0.06s 0.20s
% Output   : Refutation 0.06s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   12 (   4 unt;   0 typ;   0 def)
%            Number of atoms       :   32 (  19 equ;   0 cnn)
%            Maximal formula atoms :    2 (   2 avg)
%            Number of connectives :   37 (  11   ~;   3   |;   2   &;  18   @)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    8 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   13 (   0   ^;  11   !;   2   ?;  13   :)

% Comments : 
%------------------------------------------------------------------------------
thf(type_def_5,type,
    sTfun: ( $tType * $tType ) > $tType ).

thf(func_def_1,type,
    succ: $i > $i ).

thf(func_def_5,type,
    sK0: ( $i > $o ) > $i ).

thf(func_def_8,type,
    vNOT: $o > $o ).

thf(f2,axiom,
    ! [X0: $i,X1: $i] :
      ( ( ( succ @ X0 )
        = ( succ @ X1 ) )
     => ( X0 = X1 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',succ_injective) ).

thf(f4,conjecture,
    ! [X0: $i,X1: $i] :
      ( ( X0 != X1 )
     => ( ( succ @ X0 )
       != ( succ @ X1 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz1) ).

thf(f5,negated_conjecture,
    ~ ! [X0: $i,X1: $i] :
        ( ( X0 != X1 )
       => ( ( succ @ X0 )
         != ( succ @ X1 ) ) ),
    inference(negated_conjecture,[status(cth)],[f4]) ).

thf(f8,plain,
    ! [X0: $i,X1: $i] :
      ( ( X0 = X1 )
      | ( ( succ @ X0 )
       != ( succ @ X1 ) ) ),
    inference(ennf_transformation,[],[f2]) ).

thf(f11,plain,
    ? [X0: $i,X1: $i] :
      ( ( ( succ @ X0 )
        = ( succ @ X1 ) )
      & ( X0 != X1 ) ),
    inference(ennf_transformation,[],[f5]) ).

thf(f14,plain,
    ( ( ( succ @ sK1 )
      = ( succ @ sK2 ) )
    & ( sK1 != sK2 ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2]),skolemize(X0,sK1),skolemize(X1,sK2)],[f11]) ).

thf(f16,plain,
    ! [X0: $i,X1: $i] :
      ( ( ( succ @ X0 )
       != ( succ @ X1 ) )
      | ( X0 = X1 ) ),
    inference(cnf_transformation,[],[f8]) ).

thf(f19,plain,
    sK1 != sK2,
    inference(cnf_transformation,[],[f14]) ).

thf(f20,plain,
    ( ( succ @ sK1 )
    = ( succ @ sK2 ) ),
    inference(cnf_transformation,[],[f14]) ).

thf(f65,plain,
    ! [X0: $i] :
      ( ( ( succ @ X0 )
       != ( succ @ sK1 ) )
      | ( sK2 = X0 ) ),
    inference(constrained_superposition,[],[f16,f20]) ).

thf(f78,plain,
    sK1 = sK2,
    inference(equality_resolution,[],[f65]) ).

thf(f79,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f78,f19]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : NUM635^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.04  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.06/0.15  % Computer : n012.cluster.edu
% 0.06/0.15  % Model    : x86_64 x86_64
% 0.06/0.15  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.15  % Memory   : 8046.5625MB
% 0.06/0.15  % OS       : Linux 6.8.0-71-generic
% 0.06/0.15  % CPULimit : 300
% 0.06/0.15  % WCLimit  : 300
% 0.06/0.15  % DateTime : Tue Sep 29 11:59:19 UTC 2026
% 0.06/0.15  % CPUTime  : 
% 0.06/0.15  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.06/0.18  Running first-order model finding
% 0.06/0.18  Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.20  % (5811)Will run a generic schedule for satisfiability detection.
% 0.06/0.20  % (5818)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3562609496:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 0.06/0.20  % (5818) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-5811-5818"...
% 0.06/0.20  % (5817)% WARNING: option uhcvi not known.
% 0.06/0.20  % (5818)...printing done.
% 0.06/0.20  % (5818)Refutation found. Thanks to Tanya!
% 0.06/0.20  % SZS status Theorem for theBenchmark
% 0.06/0.20  % SZS output start Proof for theBenchmark
% See solution above
% 0.06/0.20  % (5818)------------------------------
% 0.06/0.20  % (5818)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.06/0.20  % (5818)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.06/0.20  % (5818)CaDiCaL version: 2.1.3
% 0.06/0.20  % (5818)Termination reason: Refutation
% 0.06/0.20  % (5818)Time elapsed: 0.002 s
% 0.06/0.20  % (5818)Peak memory usage: 12 MB
% 0.06/0.20  % (5818)Instructions burned: 2 (million)
% 0.06/0.20  % (5811)Success in time 0.017 s
% 0.06/0.20  % Vampire exiting
%------------------------------------------------------------------------------