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

% Computer : n008.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 09:48:03 AM UTC 2026

% Result   : Theorem 0.22s 0.28s
% Output   : Refutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    2
% Syntax   : Number of formulae    :    8 (   8 unt;   0 typ;   0 def)
%            Number of atoms       :    8 (   7 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    4 (   4   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number arithmetic     :    5 (   0 atm;   0 fun;   0 num;   5 var)
%            Number of types       :    3 (   2 usr;   1 ari;   0 dat;   0 cdt)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   6 con; 0-3 aty)
%            Number of variables   :   20 (  16   !;   4   ?;  20   :)

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

tff(type_def_6,type,
    array: $tType ).

tff(func_def_0,type,
    mkarray: array ).

tff(func_def_1,type,
    none: data ).

tff(func_def_2,type,
    put: ( array * $int * data ) > array ).

tff(func_def_3,type,
    get: ( array * $int ) > data ).

tff(func_def_4,type,
    sK0: ( array * array ) > $int ).

tff(func_def_5,type,
    sK1: data ).

tff(func_def_6,type,
    sK2: array ).

tff(func_def_7,type,
    sK3: $int ).

tff(func_def_8,type,
    sK4: data ).

tff(f4,axiom,
    ! [X0: data,X1: array,X2: $int,X3: data] : ( put(put(X1,X2,X0),X2,X3) = put(X1,X2,X3) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/DAT004_0.ax',ax_20) ).

tff(f6,conjecture,
    ! [X0: data,X1: array,X2: $int,X3: data] : ( put(put(X1,X2,X0),X2,X3) = put(X1,X2,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',th_lem_5) ).

tff(f7,negated_conjecture,
    ~ ! [X0: data,X1: array,X2: $int,X3: data] : ( put(put(X1,X2,X0),X2,X3) = put(X1,X2,X3) ),
    inference(negated_conjecture,[status(cth)],[f6]) ).

tff(f9,plain,
    ? [X0: data,X1: array,X2: $int,X3: data] : ( put(put(X1,X2,X0),X2,X3) != put(X1,X2,X3) ),
    inference(ennf_transformation,[],[f7]) ).

tff(f13,plain,
    ! [X2: $int,X3: data,X0: data,X1: array] : ( put(put(X1,X2,X0),X2,X3) = put(X1,X2,X3) ),
    inference(cnf_transformation,[],[f4]) ).

tff(f16,plain,
    put(put(sK2,sK3,sK1),sK3,sK4) != put(sK2,sK3,sK4),
    inference(cnf_transformation,[],[f9]) ).

tff(f19,plain,
    put(sK2,sK3,sK4) != put(sK2,sK3,sK4),
    inference(superposition,[],[f16,f13]) ).

tff(f21,plain,
    $false,
    inference(trivial_inequality_removal,[],[f19]) ).

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