↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SWV242-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 : n026.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:29 PM UTC 2026

% Result   : Unsatisfiable 0.21s 1.30s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   27 (  10 unt;   2 def)
%            Number of atoms       :   49 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   43 (  21   ~;  20   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   3 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   5 con; 0-3 aty)
%            Number of variables   :   16 (   0 sgn  16   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
    c_lessequals(v_G,c_Message_Oanalz(v_G_H),tc_set(tc_Message_Omsg)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).

fof(f2,negated_conjecture,
    c_lessequals(v_H,c_Message_Oanalz(v_H_H),tc_set(tc_Message_Omsg)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).

fof(f3,negated_conjecture,
    ( ~ c_lessequals(v_H,c_Message_Oanalz(c_union(v_G_H,v_H_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg))
    | ~ c_lessequals(v_G,c_Message_Oanalz(c_union(v_G_H,v_H_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).

fof(f4,axiom,
    ! [X0,X1] :
      ( c_lessequals(c_Message_Oanalz(X0),c_Message_Oanalz(X1),tc_set(tc_Message_Omsg))
      | ~ c_lessequals(X0,X1,tc_set(tc_Message_Omsg)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Message_Oanalz__mono_0) ).

fof(f5,axiom,
    ! [X2,X0,X1] : c_lessequals(X0,c_union(X0,X1,X2),tc_set(X2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OUn__upper1_0) ).

fof(f6,axiom,
    ! [X2,X0,X1] : c_lessequals(X0,c_union(X1,X0,X2),tc_set(X2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OUn__upper2_0) ).

fof(f7,axiom,
    ! [X2,X3,X0,X1] :
      ( c_lessequals(X3,X1,tc_set(X2))
      | ~ c_lessequals(X3,X0,tc_set(X2))
      | ~ c_lessequals(X0,X1,tc_set(X2)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_Osubset__trans_0) ).

fof(f9,definition,
    ( spl0_1
  <=> c_lessequals(v_G,c_Message_Oanalz(c_union(v_G_H,v_H_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)) ),
    introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).

fof(f10,plain,
    ( ~ c_lessequals(v_G,c_Message_Oanalz(c_union(v_G_H,v_H_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg))
    | spl0_1 ),
    inference(avatar_component_clause,[],[f9]) ).

fof(f12,definition,
    ( spl0_2
  <=> c_lessequals(v_H,c_Message_Oanalz(c_union(v_G_H,v_H_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)) ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

fof(f13,plain,
    ( ~ c_lessequals(v_H,c_Message_Oanalz(c_union(v_G_H,v_H_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg))
    | spl0_2 ),
    inference(avatar_component_clause,[],[f12]) ).

fof(f14,plain,
    ( ~ spl0_1
    | ~ spl0_2 ),
    inference(avatar_split_clause,[],[f3,f12,f9]) ).

fof(f15,plain,
    ( ! [X0] :
        ( ~ c_lessequals(X0,c_Message_Oanalz(c_union(v_G_H,v_H_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg))
        | ~ c_lessequals(v_G,X0,tc_set(tc_Message_Omsg)) )
    | spl0_1 ),
    inference(resolution,[],[f7,f10]) ).

fof(f16,plain,
    ( ! [X0] :
        ( ~ c_lessequals(X0,c_union(v_G_H,v_H_H,tc_Message_Omsg),tc_set(tc_Message_Omsg))
        | ~ c_lessequals(v_G,c_Message_Oanalz(X0),tc_set(tc_Message_Omsg)) )
    | spl0_1 ),
    inference(resolution,[],[f15,f4]) ).

fof(f18,plain,
    ( ~ c_lessequals(v_G,c_Message_Oanalz(v_G_H),tc_set(tc_Message_Omsg))
    | spl0_1 ),
    inference(resolution,[],[f16,f5]) ).

fof(f21,plain,
    ( $false
    | spl0_1 ),
    inference(forward_subsumption_resolution,[],[f18,f1]) ).

fof(f22,plain,
    spl0_1,
    inference(avatar_contradiction_clause,[],[f21]) ).

fof(f23,plain,
    ( ! [X0] :
        ( ~ c_lessequals(X0,c_Message_Oanalz(c_union(v_G_H,v_H_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg))
        | ~ c_lessequals(v_H,X0,tc_set(tc_Message_Omsg)) )
    | spl0_2 ),
    inference(resolution,[],[f13,f7]) ).

fof(f24,plain,
    ( ! [X0] :
        ( ~ c_lessequals(X0,c_union(v_G_H,v_H_H,tc_Message_Omsg),tc_set(tc_Message_Omsg))
        | ~ c_lessequals(v_H,c_Message_Oanalz(X0),tc_set(tc_Message_Omsg)) )
    | spl0_2 ),
    inference(resolution,[],[f23,f4]) ).

fof(f27,plain,
    ( ~ c_lessequals(v_H,c_Message_Oanalz(v_H_H),tc_set(tc_Message_Omsg))
    | spl0_2 ),
    inference(resolution,[],[f24,f6]) ).

fof(f29,plain,
    ( $false
    | spl0_2 ),
    inference(forward_subsumption_resolution,[],[f27,f2]) ).

fof(f30,plain,
    spl0_2,
    inference(avatar_contradiction_clause,[],[f29]) ).

cnf(s1,plain,
    ( ~ spl0_1
    | ~ spl0_2 ),
    inference(sat_conversion,[],[f14]) ).

cnf(s2,plain,
    spl0_1,
    inference(sat_conversion,[],[f22]) ).

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

cnf(s4,plain,
    $false,
    inference(rat,[],[s1,s3,s2]) ).

fof(f31,plain,
    $false,
    inference(avatar_sat_refutation,[],[s4]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV242-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.23  % Computer : n026.cluster.edu
% 0.09/0.23  % Model    : x86_64 x86_64
% 0.09/0.23  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.23  % Memory   : 8046.5625MB
% 0.09/0.23  % OS       : Linux 6.8.0-71-generic
% 0.09/0.23  % CPULimit : 300
% 0.09/0.23  % WCLimit  : 300
% 0.09/0.23  % DateTime : Mon Sep 28 10:20:01 UTC 2026
% 0.09/0.23  % CPUTime  : 
% 0.09/0.23  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.27  Running first-order theorem proving
% 0.09/0.27  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
% 0.21/1.30  % (3752039)Input is clausal, will run a generic CNF schedule.
% 0.21/1.30  % (3752046)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=1286496145:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 0.21/1.30  % (3752048)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=2669202654:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 0.21/1.30  % (3752048)First to succeed.
% 0.21/1.30  % (3752048)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3752039"
% 0.21/1.30  % (3752049)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3674058576:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 0.21/1.30  % (3752047)lrs+10_1_sil=8000:sp=occurrence:random_seed=3024888206:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 0.21/1.30  % (3752045)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=4109212421:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 0.21/1.30  % (3752044)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=4152377068:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 0.21/1.30  % (3752049)Also succeeded, but the first one will report.
% 0.21/1.30  % (3752047)Also succeeded, but the first one will report.
% 0.21/1.30  % (3752050)dis-21_1_sil=8000:lcm=predicate:random_seed=1007939411: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)
% 0.21/1.30  % (3752050)Also succeeded, but the first one will report.
% 0.21/1.30  % (3752048)Refutation found. Thanks to Tanya!
% 0.21/1.30  % SZS status Unsatisfiable for theBenchmark
% 0.21/1.30  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/1.30  % (3752048)------------------------------
% 0.21/1.30  % (3752048)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.21/1.30  % (3752048)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/1.30  % (3752048)CaDiCaL version: 2.1.3
% 0.21/1.30  % (3752048)Termination reason: Refutation
% 0.21/1.30  % (3752048)Time elapsed: 0.002 s
% 0.21/1.30  % (3752048)Peak memory usage: 88 MB
% 0.21/1.30  % (3752048)Instructions burned: 1 (million)
% 0.21/1.30  % (3752048)------------------------------
% 0.21/1.30  % (3752048)------------------------------
% 0.21/1.30  % (3752039)Success in time 0.402 s
% 0.21/1.30  % Vampire exiting
%------------------------------------------------------------------------------