↑ Up

Vampire---5.0.1.UNS-Ref.s

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

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

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

fof(f2,axiom,
    ! [X0,X1] :
      ( ~ c_in(X0,c_Message_Oanalz(c_Message_Oanalz(X1)),tc_Message_Omsg)
      | c_in(X0,c_Message_Oanalz(X1),tc_Message_Omsg) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Message_Oanalz__analzD__dest_0) ).

fof(f3,axiom,
    ! [X2,X3,X0,X1] :
      ( c_lessequals(c_Message_Oanalz(c_union(X2,X0,tc_Message_Omsg)),c_Message_Oanalz(c_union(X3,X1,tc_Message_Omsg)),tc_set(tc_Message_Omsg))
      | ~ c_lessequals(c_Message_Oanalz(X2),c_Message_Oanalz(X3),tc_set(tc_Message_Omsg))
      | ~ c_lessequals(c_Message_Oanalz(X0),c_Message_Oanalz(X1),tc_set(tc_Message_Omsg)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Message_Oanalz__subset__cong_0) ).

fof(f4,axiom,
    ! [X2,X0,X1] :
      ( c_in(c_Main_OsubsetI__1(X0,X1,X2),X0,X2)
      | c_lessequals(X0,X1,tc_set(X2)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OsubsetI_0) ).

fof(f5,axiom,
    ! [X2,X0,X1] :
      ( ~ c_in(c_Main_OsubsetI__1(X0,X1,X2),X1,X2)
      | c_lessequals(X0,X1,tc_set(X2)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OsubsetI_1) ).

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

fof(f7,plain,
    ! [X0,X1] :
      ( c_in(c_Main_OsubsetI__1(c_Message_Oanalz(c_Message_Oanalz(X0)),X1,tc_Message_Omsg),c_Message_Oanalz(X0),tc_Message_Omsg)
      | c_lessequals(c_Message_Oanalz(c_Message_Oanalz(X0)),X1,tc_set(tc_Message_Omsg)) ),
    inference(resolution,[],[f4,f2]) ).

fof(f10,plain,
    ( ~ c_lessequals(c_Message_Oanalz(c_Message_Oanalz(v_G)),c_Message_Oanalz(v_G),tc_set(tc_Message_Omsg))
    | ~ c_lessequals(c_Message_Oanalz(v_H),c_Message_Oanalz(v_H),tc_set(tc_Message_Omsg)) ),
    inference(resolution,[],[f3,f1]) ).

fof(f11,plain,
    ~ c_lessequals(c_Message_Oanalz(c_Message_Oanalz(v_G)),c_Message_Oanalz(v_G),tc_set(tc_Message_Omsg)),
    inference(forward_subsumption_resolution,[],[f10,f6]) ).

fof(f12,plain,
    ! [X0] :
      ( c_lessequals(c_Message_Oanalz(c_Message_Oanalz(X0)),c_Message_Oanalz(X0),tc_set(tc_Message_Omsg))
      | c_lessequals(c_Message_Oanalz(c_Message_Oanalz(X0)),c_Message_Oanalz(X0),tc_set(tc_Message_Omsg)) ),
    inference(resolution,[],[f7,f5]) ).

fof(f14,plain,
    ! [X0] : c_lessequals(c_Message_Oanalz(c_Message_Oanalz(X0)),c_Message_Oanalz(X0),tc_set(tc_Message_Omsg)),
    inference(duplicate_literal_removal,[],[f12]) ).

fof(f15,plain,
    $false,
    inference(resolution,[],[f14,f11]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWV239-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.07/0.17  % Computer : n014.cluster.edu
% 0.07/0.17  % Model    : x86_64 x86_64
% 0.07/0.17  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.17  % Memory   : 8046.5625MB
% 0.07/0.17  % OS       : Linux 6.8.0-71-generic
% 0.07/0.17  % CPULimit : 300
% 0.07/0.17  % WCLimit  : 300
% 0.07/0.17  % DateTime : Mon Sep 28 10:15:01 UTC 2026
% 0.07/0.17  % CPUTime  : 
% 0.07/0.18  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.21  Running first-order theorem proving
% 0.07/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
% 0.18/1.13  % (1688994)Input is clausal, will run a generic CNF schedule.
% 0.18/1.13  % (1689003)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=3368141886:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 0.18/1.13  % (1689003)First to succeed.
% 0.18/1.13  % (1689003)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1688994"
% 0.18/1.13  % (1689001)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=3483267909:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 0.18/1.13  % (1688999)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=3853965293:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 0.18/1.13  % (1689002)lrs+10_1_sil=8000:sp=occurrence:random_seed=108120888:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 0.18/1.13  % (1689000)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=2060704285:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 0.18/1.13  % (1689002)Also succeeded, but the first one will report.
% 0.18/1.13  % (1689005)dis-21_1_sil=8000:lcm=predicate:random_seed=2243610297: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.18/1.13  % (1689004)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1561089883:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 0.18/1.13  % (1689004)Also succeeded, but the first one will report.
% 0.18/1.13  % (1689005)Also succeeded, but the first one will report.
% 0.18/1.13  % (1689003)Refutation found. Thanks to Tanya!
% 0.18/1.13  % SZS status Unsatisfiable for theBenchmark
% 0.18/1.13  % SZS output start Proof for theBenchmark
% See solution above
% 0.18/1.13  % (1689003)------------------------------
% 0.18/1.13  % (1689003)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.18/1.13  % (1689003)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/1.13  % (1689003)CaDiCaL version: 2.1.3
% 0.18/1.13  % (1689003)Termination reason: Refutation
% 0.18/1.13  % (1689003)Time elapsed: 0.001 s
% 0.18/1.13  % (1689003)Peak memory usage: 87 MB
% 0.18/1.13  % (1689003)Instructions burned: 1 (million)
% 0.18/1.13  % (1689003)------------------------------
% 0.18/1.13  % (1689003)------------------------------
% 0.18/1.13  % (1688994)Success in time 0.289 s
% 0.18/1.14  % Vampire exiting
%------------------------------------------------------------------------------