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

% Computer : n007.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:47:56 AM UTC 2026

% Result   : Theorem 0.24s 0.31s
% Output   : Refutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   20 (   9 unt;   0 typ;   0 def)
%            Number of atoms       :   38 (  37 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   27 (   9   ~;  10   |;   6   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number arithmetic     :  105 (   0 atm;   0 fun;  89 num;  16 var)
%            Number of types       :    2 (   1 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    :   12 (   5 usr;  10 con; 0-3 aty)
%            Number of variables   :   28 (  22   !;   6   ?;  28   :)

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

tff(func_def_0,type,
    read: ( array * $int ) > $int ).

tff(func_def_1,type,
    write: ( array * $int * $int ) > array ).

tff(func_def_9,type,
    sK0: array ).

tff(func_def_10,type,
    sK1: array ).

tff(func_def_11,type,
    sK2: $int ).

tff(f1,axiom,
    ! [X0: array,X1: $int,X2: $int] : ( read(write(X0,X1,X2),X1) = X2 ),
    file('/export/starexec/sandbox2/benchmark/Axioms/DAT001_0.ax',ax1) ).

tff(f2,axiom,
    ! [X0: array,X1: $int,X2: $int,X3: $int] :
      ( ( X1 = X2 )
      | ( read(write(X0,X1,X3),X2) = read(X0,X2) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/DAT001_0.ax',ax2) ).

tff(f3,conjecture,
    ! [X0: array,X1: array,X2: $int] :
      ( ( X0 = write(write(write(write(X1,3,33),4,44),5,55),X2,66) )
     => ( ( read(X0,4) = 44 )
        | ( read(X0,4) = 66 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).

tff(f4,negated_conjecture,
    ~ ! [X0: array,X1: array,X2: $int] :
        ( ( X0 = write(write(write(write(X1,3,33),4,44),5,55),X2,66) )
       => ( ( read(X0,4) = 44 )
          | ( read(X0,4) = 66 ) ) ),
    inference(negated_conjecture,[status(cth)],[f3]) ).

tff(f5,plain,
    ? [X0: array,X1: array,X2: $int] :
      ( ( 44 != read(X0,4) )
      & ( 66 != read(X0,4) )
      & ( X0 = write(write(write(write(X1,3,33),4,44),5,55),X2,66) ) ),
    inference(ennf_transformation,[],[f4]) ).

tff(f6,plain,
    ? [X0: array,X1: array,X2: $int] :
      ( ( 44 != read(X0,4) )
      & ( 66 != read(X0,4) )
      & ( X0 = write(write(write(write(X1,3,33),4,44),5,55),X2,66) ) ),
    inference(flattening,[],[f5]) ).

tff(f7,plain,
    ( ( 44 != read(sK0,4) )
    & ( 66 != read(sK0,4) )
    & ( sK0 = write(write(write(write(sK1,3,33),4,44),5,55),sK2,66) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f6]) ).

tff(f8,plain,
    ! [X2: $int,X0: array,X1: $int] : ( read(write(X0,X1,X2),X1) = X2 ),
    inference(cnf_transformation,[],[f1]) ).

tff(f9,plain,
    ! [X2: $int,X3: $int,X0: array,X1: $int] :
      ( ( read(write(X0,X1,X3),X2) = read(X0,X2) )
      | ( X1 = X2 ) ),
    inference(cnf_transformation,[],[f2]) ).

tff(f10,plain,
    sK0 = write(write(write(write(sK1,3,33),4,44),5,55),sK2,66),
    inference(cnf_transformation,[],[f7]) ).

tff(f11,plain,
    66 != read(sK0,4),
    inference(cnf_transformation,[],[f7]) ).

tff(f12,plain,
    44 != read(sK0,4),
    inference(cnf_transformation,[],[f7]) ).

tff(f13,plain,
    66 = read(sK0,sK2),
    inference(superposition,[],[f8,f10]) ).

tff(f14,plain,
    ! [X0: $int] :
      ( ( read(write(write(write(sK1,3,33),4,44),5,55),X0) = read(sK0,X0) )
      | ( sK2 = X0 ) ),
    inference(superposition,[],[f9,f10]) ).

tff(f16,plain,
    ! [X0: $int] :
      ( ( read(sK0,X0) = read(write(write(sK1,3,33),4,44),X0) )
      | ( sK2 = X0 )
      | ( 5 = X0 ) ),
    inference(superposition,[],[f14,f9]) ).

tff(f31,plain,
    ( ( 44 = read(sK0,4) )
    | ( 4 = sK2 )
    | ( 4 = 5 ) ),
    inference(superposition,[],[f8,f16]) ).

tff(f33,plain,
    ( ( 44 = read(sK0,4) )
    | ( 4 = sK2 ) ),
    inference(evaluation,[],[f31]) ).

tff(f35,plain,
    4 = sK2,
    inference(forward_subsumption_resolution,[],[f33,f12]) ).

tff(f37,plain,
    66 = read(sK0,4),
    inference(superposition,[],[f13,f35]) ).

tff(f39,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f37,f11]) ).

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