↑ Up

Vampire-SAT---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : SWV255-2 : TPTP v9.3.1. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/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 01:20:36 PM UTC 2026

% Result   : Unsatisfiable 0.19s 0.27s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   12 (   5 unt;   0 def)
%            Number of atoms       :   19 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   17 (  10   ~;   7   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :   12 (  12 usr;   7 con; 0-3 aty)
%            Number of variables   :   17 (  17   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
    ! [X0] : c_lessequals(X0,v_xb(X0),tc_nat),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).

fof(f2,negated_conjecture,
    ! [X0] :
      ( ~ c_in(c_Message_Omsg_ONonce(X0),c_Message_Oparts(c_insert(v_msg1,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg)
      | ~ c_lessequals(v_x,X0,tc_nat) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).

fof(f3,negated_conjecture,
    ! [X0] :
      ( ~ c_in(c_Message_Omsg_ONonce(X0),c_Message_Oparts(c_insert(v_msg2,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg)
      | ~ c_lessequals(v_xa,X0,tc_nat) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).

fof(f4,negated_conjecture,
    ! [X0] :
      ( c_in(c_Message_Omsg_ONonce(v_xb(X0)),c_Message_Oparts(c_insert(v_msg2,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg)
      | c_in(c_Message_Omsg_ONonce(v_xb(X0)),c_Message_Oparts(c_insert(v_msg1,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_3) ).

fof(f5,axiom,
    ! [X2,X0,X1] :
      ( ~ c_lessequals(c_plus(X0,X1,tc_nat),X2,tc_nat)
      | c_lessequals(X1,X2,tc_nat) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Nat_Oadd__leE_0) ).

fof(f6,axiom,
    ! [X2,X0,X1] :
      ( ~ c_lessequals(c_plus(X0,X1,tc_nat),X2,tc_nat)
      | c_lessequals(X0,X2,tc_nat) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Nat_Oadd__leE_1) ).

fof(f7,plain,
    ! [X0] :
      ( c_in(c_Message_Omsg_ONonce(v_xb(X0)),c_Message_Oparts(c_insert(v_msg1,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg)
      | ~ c_lessequals(v_xa,v_xb(X0),tc_nat) ),
    inference(resolution,[],[f4,f3]) ).

fof(f8,plain,
    ! [X0] :
      ( ~ c_lessequals(v_xa,v_xb(X0),tc_nat)
      | ~ c_lessequals(v_x,v_xb(X0),tc_nat) ),
    inference(resolution,[],[f7,f2]) ).

fof(f9,plain,
    ! [X0,X1] : c_lessequals(X0,v_xb(c_plus(X1,X0,tc_nat)),tc_nat),
    inference(resolution,[],[f5,f1]) ).

fof(f11,plain,
    ! [X0,X1] : c_lessequals(X0,v_xb(c_plus(X0,X1,tc_nat)),tc_nat),
    inference(resolution,[],[f6,f1]) ).

fof(f16,plain,
    ! [X0] : ~ c_lessequals(v_x,v_xb(c_plus(X0,v_xa,tc_nat)),tc_nat),
    inference(resolution,[],[f8,f9]) ).

fof(f21,plain,
    $false,
    inference(resolution,[],[f16,f11]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV255-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.20  % Computer : n017.cluster.edu
% 0.08/0.20  % Model    : x86_64 x86_64
% 0.08/0.20  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.20  % Memory   : 8046.5625MB
% 0.08/0.20  % OS       : Linux 6.8.0-71-generic
% 0.08/0.20  % CPULimit : 300
% 0.08/0.20  % WCLimit  : 300
% 0.08/0.20  % DateTime : Mon Sep 28 10:14:51 UTC 2026
% 0.08/0.20  % CPUTime  : 
% 0.08/0.20  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.23  Running first-order model finding
% 0.08/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.19/0.27  % (3455632)Will run a generic schedule for satisfiability detection.
% 0.19/0.27  % (3455640)dis+10_1_sil=32000:sp=arity:random_seed=1504186884:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.27  % (3455640) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3455632-3455640"...
% 0.19/0.27  % (3455640)...printing done.
% 0.19/0.27  % (3455640)Refutation found. Thanks to Tanya!
% 0.19/0.27  % SZS status Unsatisfiable for theBenchmark
% 0.19/0.27  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.27  % (3455640)------------------------------
% 0.19/0.27  % (3455640)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.27  % (3455640)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.27  % (3455640)CaDiCaL version: 2.1.3
% 0.19/0.27  % (3455640)Termination reason: Refutation
% 0.19/0.27  % (3455640)Time elapsed: 0.001 s
% 0.19/0.27  % (3455640)Peak memory usage: 11 MB
% 0.19/0.27  % (3455640)Instructions burned: 1 (million)
% 0.19/0.27  % (3455632)Success in time 0.023 s
% 0.19/0.27  % Vampire exiting
%------------------------------------------------------------------------------