↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SWV283-2 : TPTP v9.3.1. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n004.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:08:40 PM UTC 2026

% Result   : Unsatisfiable 3.37s 1.15s
% Output   : Refutation 3.37s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   27 (   5 unt;   2 def)
%            Number of atoms       :   58 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   59 (  28   ~;  29   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   3 prp; 0-3 aty)
%            Number of functors    :   13 (  13 usr;   6 con; 0-3 aty)
%            Number of variables   :   25 (   0 sgn  25   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] :
      ( ~ c_in(c_Message_Omsg_ONonce(X0),c_Message_Oparts(c_insert(X1,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg)
      | ~ c_lessequals(v_sko__upX(X1),X0,tc_nat) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Message_Omsg__Nonce__supply_0) ).

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

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

fof(f4,negated_conjecture,
    ! [X0] :
      ( ~ c_in(c_Message_Omsg_ONonce(X0),c_Event_Oused(v_list),tc_Message_Omsg)
      | ~ c_lessequals(v_x,X0,tc_nat) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).

fof(f5,negated_conjecture,
    ! [X0,X1] :
      ( c_lessequals(X0,v_xd(X0),tc_nat)
      | c_lessequals(X1,v_xd(X1),tc_nat) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_4) ).

fof(f6,negated_conjecture,
    ! [X0,X1] :
      ( c_in(c_Message_Omsg_ONonce(v_xd(X0)),c_Event_Oused(v_list),tc_Message_Omsg)
      | c_in(c_Message_Omsg_ONonce(v_xd(X0)),c_Message_Oparts(c_insert(v_xc,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg)
      | c_in(c_Message_Omsg_ONonce(v_xd(X1)),c_Event_Oused(v_list),tc_Message_Omsg)
      | c_in(c_Message_Omsg_ONonce(v_xd(X1)),c_Message_Oparts(c_insert(v_xc,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_9) ).

fof(f8,definition,
    ( spl0_1
  <=> ! [X1] :
        ( c_in(c_Message_Omsg_ONonce(v_xd(X1)),c_Event_Oused(v_list),tc_Message_Omsg)
        | c_in(c_Message_Omsg_ONonce(v_xd(X1)),c_Message_Oparts(c_insert(v_xc,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg) ) ),
    introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).

fof(f9,plain,
    ( ! [X1] :
        ( c_in(c_Message_Omsg_ONonce(v_xd(X1)),c_Message_Oparts(c_insert(v_xc,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg)
        | c_in(c_Message_Omsg_ONonce(v_xd(X1)),c_Event_Oused(v_list),tc_Message_Omsg) )
    | ~ spl0_1 ),
    inference(avatar_component_clause,[],[f8]) ).

fof(f10,plain,
    ( spl0_1
    | spl0_1 ),
    inference(avatar_split_clause,[],[f6,f8,f8]) ).

fof(f12,definition,
    ( spl0_2
  <=> ! [X1] : c_lessequals(X1,v_xd(X1),tc_nat) ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

fof(f13,plain,
    ( ! [X1] : c_lessequals(X1,v_xd(X1),tc_nat)
    | ~ spl0_2 ),
    inference(avatar_component_clause,[],[f12]) ).

fof(f14,plain,
    ( spl0_2
    | spl0_2 ),
    inference(avatar_split_clause,[],[f5,f12,f12]) ).

fof(f15,plain,
    ( ! [X0] :
        ( c_in(c_Message_Omsg_ONonce(v_xd(X0)),c_Event_Oused(v_list),tc_Message_Omsg)
        | ~ c_lessequals(v_sko__upX(v_xc),v_xd(X0),tc_nat) )
    | ~ spl0_1 ),
    inference(resolution,[],[f1,f9]) ).

fof(f16,plain,
    ( ! [X0] :
        ( ~ c_lessequals(v_x,v_xd(X0),tc_nat)
        | ~ c_lessequals(v_sko__upX(v_xc),v_xd(X0),tc_nat) )
    | ~ spl0_1 ),
    inference(resolution,[],[f15,f4]) ).

fof(f18,plain,
    ( ! [X0,X1] :
        ( ~ c_lessequals(v_sko__upX(v_xc),v_xd(X0),tc_nat)
        | ~ c_lessequals(c_plus(v_x,X1,tc_nat),v_xd(X0),tc_nat) )
    | ~ spl0_1 ),
    inference(resolution,[],[f16,f3]) ).

fof(f24,plain,
    ( ! [X2,X0,X1] :
        ( ~ c_lessequals(c_plus(v_x,X0,tc_nat),v_xd(X1),tc_nat)
        | ~ c_lessequals(c_plus(X2,v_sko__upX(v_xc),tc_nat),v_xd(X1),tc_nat) )
    | ~ spl0_1 ),
    inference(resolution,[],[f18,f2]) ).

fof(f44,plain,
    ( ! [X0] : ~ c_lessequals(c_plus(v_x,v_sko__upX(v_xc),tc_nat),v_xd(X0),tc_nat)
    | ~ spl0_1 ),
    inference(factoring,[],[f24]) ).

fof(f45,plain,
    ( $false
    | ~ spl0_1
    | ~ spl0_2 ),
    inference(resolution,[],[f44,f13]) ).

fof(f48,plain,
    ( ~ spl0_1
    | ~ spl0_2 ),
    inference(avatar_contradiction_clause,[],[f45]) ).

cnf(s1,plain,
    ( spl0_1
    | spl0_1 ),
    inference(sat_conversion,[],[f10]) ).

cnf(s2,plain,
    spl0_1,
    inference(rat,[],[s1]) ).

cnf(s3,plain,
    ( spl0_2
    | spl0_2 ),
    inference(sat_conversion,[],[f14]) ).

cnf(s4,plain,
    spl0_2,
    inference(rat,[],[s3]) ).

cnf(s5,plain,
    ( ~ spl0_1
    | ~ spl0_2 ),
    inference(sat_conversion,[],[f48]) ).

cnf(s6,plain,
    ~ spl0_1,
    inference(rat,[],[s5,s4]) ).

cnf(s7,plain,
    $false,
    inference(rat,[],[s2,s6]) ).

fof(f49,plain,
    $false,
    inference(avatar_sat_refutation,[],[s7]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWV283-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.19  % Computer : n004.cluster.edu
% 0.10/0.19  % Model    : x86_64 x86_64
% 0.10/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.19  % Memory   : 8046.5625MB
% 0.10/0.19  % OS       : Linux 6.8.0-71-generic
% 0.10/0.19  % CPULimit : 300
% 0.10/0.19  % WCLimit  : 300
% 0.10/0.19  % DateTime : Mon Sep 28 10:25:22 UTC 2026
% 0.10/0.19  % CPUTime  : 
% 0.10/0.19  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.21  Running first-order theorem proving
% 0.10/0.21  Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.37/1.15  % (268041)Input is clausal, will run a generic CNF schedule.
% 3.37/1.15  % (268047)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=2935145032:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 3.37/1.15  % (268051)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2318760055:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 3.37/1.15  % (268051)First to succeed.
% 3.37/1.15  % (268051)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-268041"
% 3.37/1.15  % (268046)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=2219520845:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 3.37/1.15  % (268050)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=1079360080:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 3.37/1.15  % (268049)lrs+10_1_sil=8000:sp=occurrence:random_seed=1176172139:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 3.37/1.15  % (268048)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=2694481682:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 3.37/1.15  % (268050)Refutation not found, incomplete strategy
% 3.37/1.15  % (268050)------------------------------
% 3.37/1.15  % (268050)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.37/1.15  % (268050)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.37/1.15  % (268050)CaDiCaL version: 2.1.3
% 3.37/1.15  % (268050)Termination reason: Refutation not found, incomplete strategy
% 3.37/1.15  % (268050)Time elapsed: 0.001 s
% 3.37/1.15  % (268050)Peak memory usage: 87 MB
% 3.37/1.15  % (268049)Also succeeded, but the first one will report.
% 3.37/1.15  % (268052)dis-21_1_sil=8000:lcm=predicate:random_seed=106975608:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/117Mi)
% 3.37/1.15  % (268052)Also succeeded, but the first one will report.
% 3.37/1.15  % (268051)Refutation found. Thanks to Tanya!
% 3.37/1.15  % SZS status Unsatisfiable for theBenchmark
% 3.37/1.15  % SZS output start Proof for theBenchmark
% See solution above
% 3.37/1.15  % (268051)------------------------------
% 3.37/1.15  % (268051)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.37/1.15  % (268051)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.37/1.15  % (268051)CaDiCaL version: 2.1.3
% 3.37/1.15  % (268051)Termination reason: Refutation
% 3.37/1.15  % (268051)Time elapsed: 0.003 s
% 3.37/1.15  % (268051)Peak memory usage: 89 MB
% 3.37/1.15  % (268051)Instructions burned: 2 (million)
% 3.37/1.15  % (268051)------------------------------
% 3.37/1.15  % (268051)------------------------------
% 3.37/1.15  % (268041)Success in time 0.398 s
% 3.37/1.15  % Vampire exiting
%------------------------------------------------------------------------------