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

% Computer : n017.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:34:00 AM UTC 2026

% Result   : Theorem 0.19s 0.26s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    1
% Syntax   : Number of formulae    :    6 (   2 unt;   0 typ;   0 def)
%            Number of atoms       :   22 (  21 equ)
%            Maximal formula atoms :    5 (   3 avg)
%            Number of connectives :   20 (   4   ~;   0   |;  14   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   9 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number arithmetic     :   46 (   0 atm;  16 fun;   0 num;  30 var)
%            Number of types       :    1 (   0 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    :    1 (   0 usr;   0 con; 2-2 aty)
%            Number of variables   :   30 (  16   !;  14   ?;  30   :)

% Comments : 
%------------------------------------------------------------------------------
tff(f1,conjecture,
    ? [X0: $int,X1: $int,X2: $int,X3: $int,X4: $int,X5: $int,X6: $int] :
      ( ( ( $sum(X0,X1) = X3 )
        & ( $sum(X3,X2) = X4 )
        & ( $sum(X1,X2) = X5 )
        & ( $sum(X0,X5) = X6 ) )
     => ( X4 = X6 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',associative_sum_exists) ).

tff(f2,negated_conjecture,
    ~ ? [X0: $int,X1: $int,X2: $int,X3: $int,X4: $int,X5: $int,X6: $int] :
        ( ( ( $sum(X0,X1) = X3 )
          & ( $sum(X3,X2) = X4 )
          & ( $sum(X1,X2) = X5 )
          & ( $sum(X0,X5) = X6 ) )
       => ( X4 = X6 ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

tff(f15,plain,
    ! [X0: $int,X1: $int,X2: $int,X3: $int,X4: $int,X5: $int,X6: $int] :
      ( ( X4 != X6 )
      & ( $sum(X0,X1) = X3 )
      & ( $sum(X3,X2) = X4 )
      & ( $sum(X1,X2) = X5 )
      & ( $sum(X0,X5) = X6 ) ),
    inference(ennf_transformation,[],[f2]) ).

tff(f16,plain,
    ! [X0: $int,X1: $int,X2: $int,X3: $int,X4: $int,X5: $int,X6: $int] :
      ( ( X4 != X6 )
      & ( $sum(X0,X1) = X3 )
      & ( $sum(X3,X2) = X4 )
      & ( $sum(X1,X2) = X5 )
      & ( $sum(X0,X5) = X6 ) ),
    inference(flattening,[],[f15]) ).

tff(f21,plain,
    ! [X6: $int,X4: $int] : ( X4 != X6 ),
    inference(cnf_transformation,[],[f16]) ).

tff(f22,plain,
    $false,
    inference(equality_resolution,[],[f21]) ).

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