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

% Computer : n014.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:25:24 PM UTC 2026

% Result   : Theorem 0.11s 0.45s
% Output   : Refutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   12 (  12 unt;   0 typ;   0 def)
%            Number of atoms       :   12 (   2 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    5 (   5   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :    8 (   8   !;   0   ?;   8   :)

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

tff(func_def_0,type,
    x: nat ).

tff(func_def_1,type,
    suc: nat > nat ).

tff(func_def_2,type,
    n_1: nat ).

tff(func_def_3,type,
    pl: ( nat * nat ) > nat ).

tff(func_def_6,type,
    sK0: nat > nat ).

tff(pred_def_1,type,
    more: ( nat * nat ) > $o ).

tff(f4,axiom,
    ! [X0: nat,X1: nat] : more(pl(X0,X1),X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz18) ).

tff(f5,axiom,
    ! [X0: nat] : ( suc(X0) = pl(n_1,X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz4g) ).

tff(f6,conjecture,
    more(suc(x),n_1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz24b) ).

tff(f7,negated_conjecture,
    ~ more(suc(x),n_1),
    inference(negated_conjecture,[status(cth)],[f6]) ).

tff(f11,plain,
    ~ more(suc(x),n_1),
    inference(flattening,[],[f7]) ).

tff(f18,plain,
    ! [X0: nat,X1: nat] : more(pl(X0,X1),X0),
    inference(cnf_transformation,[],[f4]) ).

tff(f19,plain,
    ! [X0: nat] : ( suc(X0) = pl(n_1,X0) ),
    inference(cnf_transformation,[],[f5]) ).

tff(f20,plain,
    ~ more(suc(x),n_1),
    inference(cnf_transformation,[],[f11]) ).

tff(f25,plain,
    ~ more(pl(n_1,x),n_1),
    inference(definition_unfolding,[],[f20,f19]) ).

tff(f27,plain,
    ! [X0: nat,X1: nat] : ~ more(pl(X0,X1),X0),
    inference(consistent_polarity_flipping,[],[f18]) ).

tff(f28,plain,
    more(pl(n_1,x),n_1),
    inference(consistent_polarity_flipping,[],[f25]) ).

tff(f29,plain,
    $false,
    inference(resolution,[],[f27,f28]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM695_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38  % Computer : n014.cluster.edu
% 0.11/0.38  % Model    : x86_64 x86_64
% 0.11/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38  % Memory   : 8046.5625MB
% 0.11/0.38  % OS       : Linux 6.8.0-71-generic
% 0.11/0.38  % CPULimit : 300
% 0.11/0.38  % WCLimit  : 300
% 0.11/0.38  % DateTime : Sun Sep 27 21:07:01 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.42  Running first-order model finding
% 0.11/0.42  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.11/0.45  % (1166970)Will run a generic schedule for satisfiability detection.
% 0.11/0.45  % (1166981)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3932292405:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.11/0.45  % (1166981) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1166970-1166981"...
% 0.11/0.45  % (1166981)...printing done.
% 0.11/0.45  % (1166981)Refutation found. Thanks to Tanya!
% 0.11/0.45  % SZS status Theorem for theBenchmark
% 0.11/0.45  % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.45  % (1166981)------------------------------
% 0.11/0.45  % (1166981)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.45  % (1166981)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.45  % (1166981)CaDiCaL version: 2.1.3
% 0.11/0.45  % (1166981)Termination reason: Refutation
% 0.11/0.45  % (1166981)Time elapsed: 0.001 s
% 0.11/0.45  % (1166981)Peak memory usage: 12 MB
% 0.11/0.45  % (1166970)Success in time 0.028 s
% 0.11/0.45  % Vampire exiting
%------------------------------------------------------------------------------