↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Computer : n018.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:30 PM UTC 2026

% Result   : Unsatisfiable 4.68s 1.71s
% Output   : Refutation 8.04s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   18
%            Number of leaves      :   25
% Syntax   : Number of formulae    :   77 (  52 unt;   8 def)
%            Number of atoms       :  112 (  48 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   73 (  38   ~;  35   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :   18 (  18 usr;  12 con; 0-3 aty)
%            Number of variables   :  125 ( 125   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
    c_in(v_X,c_Message_Osynth(c_Message_Oanalz(v_G)),tc_Message_Omsg),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).

fof(f2,negated_conjecture,
    ~ c_lessequals(c_Message_Oanalz(c_insert(v_X,v_H,tc_Message_Omsg)),c_union(c_Message_Osynth(c_Message_Oanalz(v_G)),c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg),tc_set(tc_Message_Omsg)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).

fof(f3,axiom,
    ! [X0,X1] : c_Message_Oanalz(c_union(c_Message_Oanalz(X0),X1,tc_Message_Omsg)) = c_Message_Oanalz(c_union(X0,X1,tc_Message_Omsg)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Message_Oanalz__analz__Un_0) ).

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/sandbox/benchmark/theBenchmark.p',cls_Message_Oanalz__mono_0) ).

fof(f5,axiom,
    ! [X0,X1] : c_Message_Oanalz(c_union(c_Message_Osynth(X0),X1,tc_Message_Omsg)) = c_union(c_Message_Oanalz(c_union(X0,X1,tc_Message_Omsg)),c_Message_Osynth(X0),tc_Message_Omsg),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Message_Oanalz__synth__Un_0) ).

fof(f6,axiom,
    ! [X0,X1] :
      ( c_lessequals(X1,X1,X0)
      | ~ class_Orderings_Oorder(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Orderings_Oorder__class_Oaxioms__1_0) ).

fof(f7,axiom,
    ! [X2,X0,X1] : c_union(c_minus(X0,X1,tc_set(X2)),X1,X2) = c_union(X0,X1,X2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OUn__Diff__cancel2_0) ).

fof(f8,axiom,
    ! [X2,X0,X1] : c_union(X0,c_minus(X1,X0,tc_set(X2)),X2) = c_union(X0,X1,X2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OUn__Diff__cancel_0) ).

fof(f9,plain,
    ! [X2,X0,X1] : c_union(X0,X1,X2) = c_union(X0,c_minus(X1,X0,tc_set(X2)),X2),
    inference(reorient_equations,[],[f8]) ).

fof(f10,axiom,
    ! [X2,X3,X0,X1] : c_union(c_insert(X0,X1,X2),X3,X2) = c_insert(X0,c_union(X1,X3,X2),X2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OUn__insert__left_0) ).

fof(f11,axiom,
    ! [X2,X3,X0,X1] : c_union(X0,c_insert(X1,X2,X3),X3) = c_insert(X1,c_union(X0,X2,X3),X3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OUn__insert__right_0) ).

fof(f12,axiom,
    ! [X2,X3,X0,X1] :
      ( ~ c_lessequals(c_union(X0,X1,X2),X3,tc_set(X2))
      | c_lessequals(X0,X3,tc_set(X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OUn__subset__iff_0) ).

fof(f13,axiom,
    ! [X2,X3,X0,X1] :
      ( ~ c_lessequals(c_union(X0,X1,X2),X3,tc_set(X2))
      | c_lessequals(X1,X3,tc_set(X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OUn__subset__iff_1) ).

fof(f14,axiom,
    ! [X2,X3,X0,X1] :
      ( c_lessequals(c_union(X3,X0,X2),X1,tc_set(X2))
      | ~ c_lessequals(X3,X1,tc_set(X2))
      | ~ c_lessequals(X0,X1,tc_set(X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OUn__subset__iff_2) ).

fof(f15,axiom,
    ! [X2,X3,X0,X1] :
      ( ~ c_lessequals(c_insert(X0,X1,X2),X3,tc_set(X2))
      | c_lessequals(X1,X3,tc_set(X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_Oinsert__subset_1) ).

fof(f16,axiom,
    ! [X2,X3,X0,X1] :
      ( c_lessequals(c_insert(X0,X3,X2),X1,tc_set(X2))
      | ~ c_lessequals(X3,X1,tc_set(X2))
      | ~ c_in(X0,X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_Oinsert__subset_2) ).

fof(f17,axiom,
    ! [X2,X0,X1] :
      ( ~ c_lessequals(X0,X1,tc_set(X2))
      | ~ c_lessequals(X1,X0,tc_set(X2))
      | X1 = X0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_Osubset__antisym_0) ).

fof(f18,plain,
    ! [X2,X0,X1] :
      ( ~ c_lessequals(X1,X0,tc_set(X2))
      | ~ c_lessequals(X0,X1,tc_set(X2))
      | X0 = X1 ),
    inference(reorient_equations,[],[f17]) ).

fof(f19,axiom,
    ! [X0] : class_Orderings_Oorder(tc_set(X0)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clsarity_set_2) ).

fof(f20,definition,
    sF0 = c_Message_Oanalz(v_G),
    introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).

fof(f21,plain,
    c_Message_Oanalz(v_G) = sF0,
    inference(reorient_equations,[],[f20]) ).

fof(f22,definition,
    sF1 = c_Message_Osynth(sF0),
    introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).

fof(f23,plain,
    c_Message_Osynth(sF0) = sF1,
    inference(reorient_equations,[],[f22]) ).

fof(f24,plain,
    c_in(v_X,sF1,tc_Message_Omsg),
    inference(definition_folding,[],[f1,f23,f21]) ).

fof(f25,definition,
    sF2 = c_insert(v_X,v_H,tc_Message_Omsg),
    introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).

fof(f26,plain,
    c_insert(v_X,v_H,tc_Message_Omsg) = sF2,
    inference(reorient_equations,[],[f25]) ).

fof(f27,definition,
    sF3 = c_Message_Oanalz(sF2),
    introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).

fof(f28,plain,
    c_Message_Oanalz(sF2) = sF3,
    inference(reorient_equations,[],[f27]) ).

fof(f29,definition,
    sF4 = c_union(v_G,v_H,tc_Message_Omsg),
    introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).

fof(f30,plain,
    c_union(v_G,v_H,tc_Message_Omsg) = sF4,
    inference(reorient_equations,[],[f29]) ).

fof(f31,definition,
    sF5 = c_Message_Oanalz(sF4),
    introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).

fof(f32,plain,
    c_Message_Oanalz(sF4) = sF5,
    inference(reorient_equations,[],[f31]) ).

fof(f33,definition,
    sF6 = c_union(sF1,sF5,tc_Message_Omsg),
    introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).

fof(f34,plain,
    c_union(sF1,sF5,tc_Message_Omsg) = sF6,
    inference(reorient_equations,[],[f33]) ).

fof(f35,definition,
    sF7 = tc_set(tc_Message_Omsg),
    introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).

fof(f36,plain,
    tc_set(tc_Message_Omsg) = sF7,
    inference(reorient_equations,[],[f35]) ).

fof(f37,plain,
    ~ c_lessequals(sF3,sF6,sF7),
    inference(definition_folding,[],[f2,f36,f34,f32,f30,f23,f21,f28,f26]) ).

fof(f38,plain,
    ! [X2,X3,X0,X1] : c_union(c_insert(X0,X1,X2),X3,X2) = c_union(X1,c_insert(X0,X3,X2),X2),
    inference(forward_demodulation,[],[f10,f11]) ).

fof(f42,plain,
    ! [X0,X1] : c_Message_Oanalz(c_union(c_Message_Osynth(c_Message_Oanalz(X0)),X1,tc_Message_Omsg)) = c_union(c_Message_Oanalz(c_union(X0,X1,tc_Message_Omsg)),c_Message_Osynth(c_Message_Oanalz(X0)),tc_Message_Omsg),
    inference(superposition,[],[f5,f3]) ).

fof(f45,plain,
    ! [X0] : c_union(v_H,c_insert(v_X,X0,tc_Message_Omsg),tc_Message_Omsg) = c_union(sF2,X0,tc_Message_Omsg),
    inference(superposition,[],[f38,f26]) ).

fof(f81,plain,
    ! [X0] :
      ( c_lessequals(sF3,c_Message_Oanalz(X0),tc_set(tc_Message_Omsg))
      | ~ c_lessequals(sF2,X0,tc_set(tc_Message_Omsg)) ),
    inference(superposition,[],[f4,f28]) ).

fof(f93,plain,
    ! [X0] :
      ( c_lessequals(sF3,c_Message_Oanalz(X0),sF7)
      | ~ c_lessequals(sF2,X0,tc_set(tc_Message_Omsg)) ),
    inference(forward_demodulation,[],[f81,f36]) ).

fof(f101,plain,
    ! [X0] :
      ( c_lessequals(sF3,c_Message_Oanalz(X0),sF7)
      | ~ c_lessequals(sF2,X0,sF7) ),
    inference(forward_demodulation,[],[f93,f36]) ).

fof(f138,plain,
    ! [X2,X3,X0,X1] :
      ( ~ c_lessequals(c_minus(X0,X1,tc_set(X2)),X3,tc_set(X2))
      | c_lessequals(c_union(X0,X1,X2),X3,tc_set(X2))
      | ~ c_lessequals(X1,X3,tc_set(X2)) ),
    inference(superposition,[],[f14,f7]) ).

fof(f148,plain,
    ! [X2,X3,X0,X1] :
      ( c_lessequals(c_minus(X1,X0,tc_set(X2)),X3,tc_set(X2))
      | ~ c_lessequals(c_union(X0,X1,X2),X3,tc_set(X2)) ),
    inference(superposition,[],[f13,f9]) ).

fof(f189,plain,
    ! [X2,X3,X0,X1] :
      ( ~ c_lessequals(X0,c_insert(X1,X2,X3),tc_set(X3))
      | c_insert(X1,X2,X3) = X0
      | ~ c_lessequals(X2,X0,tc_set(X3))
      | ~ c_in(X1,X0,X3) ),
    inference(resolution,[],[f18,f16]) ).

fof(f283,plain,
    c_Message_Oanalz(c_union(c_Message_Osynth(c_Message_Oanalz(v_G)),v_H,tc_Message_Omsg)) = c_union(c_Message_Oanalz(sF4),c_Message_Osynth(c_Message_Oanalz(v_G)),tc_Message_Omsg),
    inference(superposition,[],[f42,f30]) ).

fof(f312,plain,
    c_Message_Oanalz(c_union(c_Message_Osynth(sF0),v_H,tc_Message_Omsg)) = c_union(c_Message_Oanalz(sF4),c_Message_Osynth(sF0),tc_Message_Omsg),
    inference(forward_demodulation,[],[f283,f21]) ).

fof(f318,plain,
    c_Message_Oanalz(c_union(sF1,v_H,tc_Message_Omsg)) = c_union(c_Message_Oanalz(sF4),sF1,tc_Message_Omsg),
    inference(forward_demodulation,[],[f312,f23]) ).

fof(f320,plain,
    c_Message_Oanalz(c_union(sF1,v_H,tc_Message_Omsg)) = c_union(sF5,sF1,tc_Message_Omsg),
    inference(forward_demodulation,[],[f318,f32]) ).

fof(f365,plain,
    ! [X2,X0,X1] :
      ( ~ class_Orderings_Oorder(tc_set(X0))
      | c_lessequals(X1,c_insert(X2,X1,X0),tc_set(X0)) ),
    inference(resolution,[],[f6,f15]) ).

fof(f366,plain,
    ! [X2,X0,X1] :
      ( ~ class_Orderings_Oorder(tc_set(X0))
      | c_lessequals(X1,c_union(X1,X2,X0),tc_set(X0)) ),
    inference(resolution,[],[f6,f12]) ).

fof(f373,plain,
    ! [X2,X0,X1] : c_lessequals(X1,c_union(X1,X2,X0),tc_set(X0)),
    inference(forward_subsumption_resolution,[],[f366,f19]) ).

fof(f374,plain,
    ! [X2,X0,X1] : c_lessequals(X1,c_insert(X2,X1,X0),tc_set(X0)),
    inference(forward_subsumption_resolution,[],[f365,f19]) ).

fof(f474,plain,
    ! [X0,X1] : c_lessequals(X0,c_union(X0,X1,tc_Message_Omsg),sF7),
    inference(superposition,[],[f373,f36]) ).

fof(f1268,plain,
    ! [X2,X3,X0,X1] :
      ( ~ c_lessequals(c_union(X0,X1,X2),X3,tc_set(X2))
      | c_lessequals(c_union(X1,X0,X2),X3,tc_set(X2))
      | ~ c_lessequals(X0,X3,tc_set(X2)) ),
    inference(resolution,[],[f148,f138]) ).

fof(f1272,plain,
    ! [X2,X3,X0,X1] :
      ( ~ c_lessequals(c_union(X0,X1,X2),X3,tc_set(X2))
      | c_lessequals(c_union(X1,X0,X2),X3,tc_set(X2)) ),
    inference(forward_subsumption_resolution,[],[f1268,f12]) ).

fof(f1277,plain,
    ! [X2,X0,X1] :
      ( c_lessequals(c_union(X0,X1,X2),c_union(X1,X0,X2),tc_set(X2))
      | ~ class_Orderings_Oorder(tc_set(X2)) ),
    inference(resolution,[],[f1272,f6]) ).

fof(f1314,plain,
    ! [X2,X0,X1] : c_lessequals(c_union(X0,X1,X2),c_union(X1,X0,X2),tc_set(X2)),
    inference(forward_subsumption_resolution,[],[f1277,f19]) ).

fof(f1460,plain,
    ! [X2,X0,X1] :
      ( ~ c_lessequals(X1,X1,tc_set(X2))
      | c_insert(X0,X1,X2) = X1
      | ~ c_in(X0,X1,X2) ),
    inference(resolution,[],[f189,f374]) ).

fof(f2255,plain,
    ! [X2,X0,X1] :
      ( ~ c_lessequals(c_union(X0,X1,X2),c_union(X1,X0,X2),tc_set(X2))
      | c_union(X0,X1,X2) = c_union(X1,X0,X2) ),
    inference(resolution,[],[f1314,f18]) ).

fof(f2345,plain,
    ! [X2,X0,X1] : c_union(X0,X1,X2) = c_union(X1,X0,X2),
    inference(forward_subsumption_resolution,[],[f2255,f1314]) ).

fof(f2502,plain,
    ! [X0,X1] : c_Message_Oanalz(c_union(X1,X0,tc_Message_Omsg)) = c_Message_Oanalz(c_union(X0,c_Message_Oanalz(X1),tc_Message_Omsg)),
    inference(superposition,[],[f3,f2345]) ).

fof(f2515,plain,
    sF6 = c_union(sF5,sF1,tc_Message_Omsg),
    inference(superposition,[],[f34,f2345]) ).

fof(f2956,plain,
    ! [X0,X1] : c_Message_Oanalz(c_union(X0,c_Message_Oanalz(X1),tc_Message_Omsg)) = c_Message_Oanalz(c_union(X1,c_Message_Oanalz(X0),tc_Message_Omsg)),
    inference(superposition,[],[f3,f2502]) ).

fof(f2984,plain,
    ! [X0,X1] : c_Message_Oanalz(c_union(X0,X1,tc_Message_Omsg)) = c_Message_Oanalz(c_union(X0,c_Message_Oanalz(X1),tc_Message_Omsg)),
    inference(forward_demodulation,[],[f2956,f2502]) ).

fof(f3010,plain,
    ! [X0,X1] : c_Message_Oanalz(c_union(X0,X1,tc_Message_Omsg)) = c_Message_Oanalz(c_union(X1,X0,tc_Message_Omsg)),
    inference(forward_demodulation,[],[f2984,f2502]) ).

fof(f6437,plain,
    ! [X2,X0,X1] :
      ( c_insert(X0,X1,X2) = X1
      | ~ c_in(X0,X1,X2)
      | ~ class_Orderings_Oorder(tc_set(X2)) ),
    inference(resolution,[],[f1460,f6]) ).

fof(f6439,plain,
    ! [X2,X0,X1] :
      ( ~ c_in(X0,X1,X2)
      | c_insert(X0,X1,X2) = X1 ),
    inference(forward_subsumption_resolution,[],[f6437,f19]) ).

fof(f6446,plain,
    sF1 = c_insert(v_X,sF1,tc_Message_Omsg),
    inference(resolution,[],[f6439,f24]) ).

fof(f6451,plain,
    c_union(v_H,sF1,tc_Message_Omsg) = c_union(sF2,sF1,tc_Message_Omsg),
    inference(superposition,[],[f45,f6446]) ).

fof(f6513,plain,
    c_Message_Oanalz(c_union(sF1,v_H,tc_Message_Omsg)) = c_Message_Oanalz(c_union(sF2,sF1,tc_Message_Omsg)),
    inference(superposition,[],[f3010,f6451]) ).

fof(f6542,plain,
    c_union(sF5,sF1,tc_Message_Omsg) = c_Message_Oanalz(c_union(sF2,sF1,tc_Message_Omsg)),
    inference(forward_demodulation,[],[f6513,f320]) ).

fof(f6555,plain,
    sF6 = c_Message_Oanalz(c_union(sF2,sF1,tc_Message_Omsg)),
    inference(forward_demodulation,[],[f6542,f2515]) ).

fof(f6582,plain,
    ( c_lessequals(sF3,sF6,sF7)
    | ~ c_lessequals(sF2,c_union(sF2,sF1,tc_Message_Omsg),sF7) ),
    inference(superposition,[],[f101,f6555]) ).

fof(f6607,plain,
    ~ c_lessequals(sF2,c_union(sF2,sF1,tc_Message_Omsg),sF7),
    inference(forward_subsumption_resolution,[],[f6582,f37]) ).

fof(f6620,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f6607,f474]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV249-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.17  % Computer : n018.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:20:09 UTC 2026
% 0.07/0.18  % CPUTime  : 
% 0.07/0.18  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.21  Running first-order theorem proving
% 0.07/0.21  Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.68/1.71  % (3284023)Input is clausal, will run a generic CNF schedule.
% 4.68/1.71  % (3284028)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=238585617:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 4.68/1.71  % (3284032)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=430617156:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 4.68/1.71  % (3284030)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=3264413581:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 4.68/1.71  % (3284029)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=1826265407:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 4.68/1.71  % (3284034)dis-21_1_sil=8000:lcm=predicate:random_seed=3333696929: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)
% 4.68/1.71  % (3284033)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3579016868:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 4.68/1.71  % (3284031)lrs+10_1_sil=8000:sp=occurrence:random_seed=323641200:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 4.68/1.71  % (3284034)Instruction limit reached! 
% 4.68/1.71  % (3284034)------------------------------
% 4.68/1.71  % (3284034)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.68/1.71  % (3284034)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.68/1.71  % (3284034)CaDiCaL version: 2.1.3
% 4.68/1.71  % (3284034)Termination reason: Instruction limit
% 4.68/1.71  % (3284034)Termination phase: Saturation
% 4.68/1.71  % (3284034)Time elapsed: 0.062 s
% 4.68/1.71  % (3284034)Peak memory usage: 89 MB
% 4.68/1.71  % (3284034)Instructions burned: 119 (million)
% 4.68/1.71  % (3284031)Instruction limit reached! 
% 4.68/1.71  % (3284031)------------------------------
% 4.68/1.71  % (3284031)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.68/1.71  % (3284031)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.68/1.71  % (3284031)CaDiCaL version: 2.1.3
% 4.68/1.71  % (3284031)Termination reason: Instruction limit
% 4.68/1.71  % (3284031)Termination phase: Saturation
% 4.68/1.71  % (3284031)Time elapsed: 0.067 s
% 4.68/1.71  % (3284031)Peak memory usage: 89 MB
% 4.68/1.71  % (3284031)Instructions burned: 108 (million)
% 4.68/1.71  % (3284032)Instruction limit reached! 
% 4.68/1.71  % (3284032)------------------------------
% 4.68/1.71  % (3284032)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.68/1.71  % (3284032)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.68/1.71  % (3284032)CaDiCaL version: 2.1.3
% 4.68/1.71  % (3284032)Termination reason: Instruction limit
% 4.68/1.71  % (3284032)Termination phase: Saturation
% 4.68/1.71  % (3284032)Time elapsed: 0.070 s
% 4.68/1.71  % (3284032)Peak memory usage: 88 MB
% 4.68/1.71  % (3284032)Instructions burned: 114 (million)
% 4.68/1.71  % (3284033)Instruction limit reached! 
% 4.68/1.71  % (3284033)------------------------------
% 4.68/1.71  % (3284033)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.68/1.71  % (3284033)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.68/1.71  % (3284033)CaDiCaL version: 2.1.3
% 4.68/1.71  % (3284033)Termination reason: Instruction limit
% 4.68/1.71  % (3284033)Termination phase: Saturation
% 4.68/1.71  % (3284033)Time elapsed: 0.112 s
% 4.68/1.71  % (3284033)Peak memory usage: 89 MB
% 4.68/1.71  % (3284033)Instructions burned: 181 (million)
% 4.68/1.71  % (3284042)dis+1010_3_sil=8000:plsq=on:drc=off:fde=none:plsqc=1:bsd=on:plsqr=7,2:sos=on:spb=goal_then_units:random_seed=3694835618:i=143:sd=2:aac=none:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/143Mi)
% 4.68/1.71  % (3284042)Refutation not found, incomplete strategy
% 4.68/1.71  % (3284042)------------------------------
% 4.68/1.71  % (3284042)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.68/1.71  % (3284042)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.68/1.71  % (3284042)CaDiCaL version: 2.1.3
% 4.68/1.71  % (3284042)Termination reason: Refutation not found, incomplete strategy
% 4.68/1.71  % (3284042)Time elapsed: 0.002 s
% 4.68/1.71  % (3284042)Peak memory usage: 88 MB
% 4.68/1.71  % (3284042)Instructions burned: 1 (million)
% 4.68/1.71  % (3284044)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=2477249237:st=4:i=219:sd=3:ss=axioms_2997 on theBenchmark for (2997ds/219Mi)
% 4.68/1.71  % (3284043)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=2871467214:st=3:avsq=on:s2a=on:i=189:s2at=1.2:avsqr=1,16:sd=2:bd=all:nm=64:ss=axioms:sgt=30_2997 on theBenchmark for (2997ds/189Mi)
% 4.68/1.71  % (3284044)Refutation not found, incomplete strategy
% 4.68/1.71  % (3284044)------------------------------
% 4.68/1.71  % (3284044)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.68/1.71  % (3284044)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.68/1.71  % (3284044)CaDiCaL version: 2.1.3
% 4.68/1.71  % (3284044)Termination reason: Refutation not found, incomplete strategy
% 4.68/1.71  % (3284044)Time elapsed: 0.001 s
% 4.68/1.71  % (3284044)Peak memory usage: 87 MB
% 4.68/1.71  % (3284044)Instructions burned: 1 (million)
% 4.68/1.71  % (3284045)lrs+10_64_to=lpo:sil=8000:random_seed=4160361834:i=126:bd=preordered_2997 on theBenchmark for (2997ds/126Mi)
% 4.68/1.71  % (3284043)Instruction limit reached! 
% 4.68/1.71  % (3284043)------------------------------
% 4.68/1.71  % (3284043)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.68/1.71  % (3284043)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.68/1.71  % (3284043)CaDiCaL version: 2.1.3
% 4.68/1.71  % (3284043)Termination reason: Instruction limit
% 4.68/1.71  % (3284043)Termination phase: Saturation
% 4.68/1.71  % (3284043)Time elapsed: 0.104 s
% 4.68/1.71  % (3284043)Peak memory usage: 89 MB
% 4.68/1.71  % (3284043)Instructions burned: 189 (million)
% 4.68/1.71  % (3284045)Instruction limit reached! 
% 4.68/1.71  % (3284045)------------------------------
% 4.68/1.71  % (3284045)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.68/1.71  % (3284045)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.68/1.71  % (3284045)CaDiCaL version: 2.1.3
% 4.68/1.71  % (3284045)Termination reason: Instruction limit
% 4.68/1.71  % (3284045)Termination phase: Saturation
% 4.68/1.71  % (3284045)Time elapsed: 0.079 s
% 4.68/1.71  % (3284045)Peak memory usage: 89 MB
% 4.68/1.71  % (3284045)Instructions burned: 126 (million)
% 4.68/1.71  % (3284042)------------------------------
% 4.68/1.71  % (3284042)------------------------------
% 4.68/1.71  % (3284044)------------------------------
% 4.68/1.71  % (3284044)------------------------------
% 4.68/1.71  % (3284050)lrs+1011_16_to=lpo:sil=8000:drc=off:sp=reverse_frequency:spb=goal_then_units:random_seed=1157047091:avsq=on:i=194:fgj=on:bd=preordered_2994 on theBenchmark for (2994ds/194Mi)
% 4.68/1.71  % (3284051)lrs+10_1_sil=8000:tgt=full:acc=on:random_seed=4138408148:i=157:gtg=all_2994 on theBenchmark for (2994ds/157Mi)
% 4.68/1.71  % (3284050)Instruction limit reached! 
% 4.68/1.71  % (3284050)------------------------------
% 4.68/1.71  % (3284050)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.68/1.71  % (3284050)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.68/1.71  % (3284050)CaDiCaL version: 2.1.3
% 4.68/1.71  % (3284050)Termination reason: Instruction limit
% 4.68/1.71  % (3284050)Termination phase: Saturation
% 4.68/1.71  % (3284050)Time elapsed: 0.101 s
% 4.68/1.71  % (3284050)Peak memory usage: 88 MB
% 4.68/1.71  % (3284050)Instructions burned: 196 (million)
% 4.68/1.71  % (3284052)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:random_seed=464224997:i=3394:sd=4:ss=included:sgt=64_2993 on theBenchmark for (2993ds/3394Mi)
% 4.68/1.71  % (3284051)Instruction limit reached! 
% 4.68/1.71  % (3284051)------------------------------
% 4.68/1.71  % (3284051)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.68/1.71  % (3284051)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.68/1.71  % (3284051)CaDiCaL version: 2.1.3
% 4.68/1.71  % (3284051)Termination reason: Instruction limit
% 4.68/1.71  % (3284051)Termination phase: Saturation
% 4.68/1.71  % (3284051)Time elapsed: 0.106 s
% 4.68/1.71  % (3284051)Peak memory usage: 91 MB
% 4.68/1.71  % (3284051)Instructions burned: 157 (million)
% 4.68/1.71  % (3284053)lrs+1011_5_to=lpo:sil=8000:tgt=full:plsq=on:prc=on:drc=off:plsqr=31,4:sp=occurrence:urr=on:nwc=0.8:s2agt=16:br=off:random_seed=491860665:cts=off:s2a=on:i=106:fsr=off:gsp=on:ss=axioms:sgt=16:rawr=on_2993 on theBenchmark for (2993ds/106Mi)
% 4.68/1.71  % (3284053)Instruction limit reached! 
% 4.68/1.71  % (3284053)------------------------------
% 4.68/1.71  % (3284053)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.68/1.71  % (3284053)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.68/1.71  % (3284053)CaDiCaL version: 2.1.3
% 4.68/1.71  % (3284053)Termination reason: Instruction limit
% 4.68/1.71  % (3284053)Termination phase: Saturation
% 4.68/1.71  % (3284053)Time elapsed: 0.056 s
% 4.68/1.71  % (3284053)Peak memory usage: 88 MB
% 4.68/1.71  % (3284053)Instructions burned: 106 (million)
% 4.68/1.71  % (3284028)First to succeed.
% 4.68/1.71  % (3284028)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3284023"
% 4.68/1.71  % (3284056)lrs+2_4096_sil=8000:plsq=on:plsqr=12672147,131072:sos=on:spb=goal:lcm=predicate:random_seed=2852457624:i=107_2992 on theBenchmark for (2992ds/107Mi)
% 4.68/1.71  % (3284056)Refutation not found, incomplete strategy
% 4.68/1.71  % (3284056)------------------------------
% 4.68/1.71  % (3284056)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.68/1.71  % (3284056)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.68/1.71  % (3284056)CaDiCaL version: 2.1.3
% 4.68/1.71  % (3284056)Termination reason: Refutation not found, incomplete strategy
% 4.68/1.71  % (3284056)Time elapsed: 0.001 s
% 4.68/1.71  % (3284056)Peak memory usage: 87 MB
% 4.68/1.71  % (3284058)lrs+1011_20_sil=64000:tgt=ground:plsq=on:fde=unused:plsqc=1:plsqr=14,1:plsql=on:nwc=0.6:random_seed=1491205918:st=6:i=242:gtgl=5:kws=arity_squared:av=off:gtg=exists_sym:ss=included_2992 on theBenchmark for (2992ds/242Mi)
% 4.68/1.71  % (3284060)lrs+1010_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:tgt=ground:npcc=on:sims=off:random_seed=2696560962:cond=fast:i=5208:av=off_2991 on theBenchmark for (2991ds/5208Mi)
% 4.68/1.71  % (3284028)Refutation found. Thanks to Tanya!
% 4.68/1.71  % SZS status Unsatisfiable for theBenchmark
% 4.68/1.71  % SZS output start Proof for theBenchmark
% See solution above
% 8.04/1.89  % (3284028)------------------------------
% 8.04/1.89  % (3284028)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.04/1.89  % (3284028)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.04/1.89  % (3284028)CaDiCaL version: 2.1.3
% 8.04/1.89  % (3284028)Termination reason: Refutation
% 8.04/1.89  % (3284028)Time elapsed: 0.758 s
% 8.04/1.89  % (3284028)Peak memory usage: 137 MB
% 8.04/1.89  % (3284028)Instructions burned: 2018 (million)
% 8.04/1.89  % (3284028)------------------------------
% 8.04/1.89  % (3284028)------------------------------
% 8.04/1.89  % (3284023)Success in time 1.06 s
% 8.04/1.89  % Vampire exiting
%------------------------------------------------------------------------------