↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Computer : n015.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 11:51:58 AM UTC 2026

% Result   : Unsatisfiable 11.18s 8.01s
% Output   : Refutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   20
%            Number of leaves      :   25
% Syntax   : Number of formulae    :  113 (  71 unt;  14 def)
%            Number of atoms       :  165 (  28 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :  106 (  54   ~;  50   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    6 (   4 usr;   3 prp; 0-2 aty)
%            Number of functors    :   19 (  19 usr;  14 con; 0-2 aty)
%            Number of variables   :  115 (   0 sgn 115   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0] : axiom(implies(or(X0,X0),X0)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_2) ).

fof(f2,axiom,
    ! [X0,X1] : axiom(implies(X0,or(X1,X0))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_3) ).

fof(f3,axiom,
    ! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_4) ).

fof(f4,axiom,
    ! [X2,X0,X1] : axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_5) ).

fof(f5,axiom,
    ! [X2,X0,X1] : axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_6) ).

fof(f6,axiom,
    ! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',implies_definition) ).

fof(f7,axiom,
    ! [X0] :
      ( ~ axiom(X0)
      | theorem(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_1) ).

fof(f8,axiom,
    ! [X0,X1] :
      ( theorem(X0)
      | ~ theorem(implies(X1,X0))
      | ~ theorem(X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_2) ).

fof(f9,axiom,
    ! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',and_defn) ).

fof(f10,axiom,
    ! [X0,X1] : equivalent(X0,X1) = and(implies(X0,X1),implies(X1,X0)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',equivalent_defn) ).

fof(f11,negated_conjecture,
    ~ theorem(implies(and(p,q),equivalent(p,q))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

fof(f12,plain,
    ! [X0,X1] : equivalent(X0,X1) = not(or(not(or(not(X0),X1)),not(or(not(X1),X0)))),
    inference(definition_unfolding,[],[f10,f9,f6,f6]) ).

fof(f13,plain,
    ! [X0] : axiom(or(not(or(X0,X0)),X0)),
    inference(definition_unfolding,[],[f1,f6]) ).

fof(f14,plain,
    ! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
    inference(definition_unfolding,[],[f2,f6]) ).

fof(f15,plain,
    ! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
    inference(definition_unfolding,[],[f3,f6]) ).

fof(f16,plain,
    ! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
    inference(definition_unfolding,[],[f4,f6]) ).

fof(f17,plain,
    ! [X2,X0,X1] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
    inference(definition_unfolding,[],[f5,f6,f6,f6]) ).

fof(f18,plain,
    ! [X0,X1] :
      ( ~ theorem(or(not(X1),X0))
      | theorem(X0)
      | ~ theorem(X1) ),
    inference(definition_unfolding,[],[f8,f6]) ).

fof(f19,plain,
    ~ theorem(or(not(not(or(not(p),not(q)))),not(or(not(or(not(p),q)),not(or(not(q),p)))))),
    inference(definition_unfolding,[],[f11,f6,f9,f12]) ).

fof(f20,definition,
    sF0 = not(p),
    introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).

fof(f21,plain,
    not(p) = sF0,
    inference(reorient_equations,[],[f20]) ).

fof(f22,definition,
    sF1 = not(q),
    introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).

fof(f23,plain,
    not(q) = sF1,
    inference(reorient_equations,[],[f22]) ).

fof(f24,definition,
    sF2 = or(sF0,sF1),
    introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).

fof(f25,plain,
    or(sF0,sF1) = sF2,
    inference(reorient_equations,[],[f24]) ).

fof(f26,definition,
    sF3 = not(sF2),
    introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).

fof(f27,plain,
    not(sF2) = sF3,
    inference(reorient_equations,[],[f26]) ).

fof(f28,definition,
    sF4 = not(sF3),
    introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).

fof(f29,plain,
    not(sF3) = sF4,
    inference(reorient_equations,[],[f28]) ).

fof(f30,definition,
    sF5 = or(sF0,q),
    introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).

fof(f31,plain,
    or(sF0,q) = sF5,
    inference(reorient_equations,[],[f30]) ).

fof(f32,definition,
    sF6 = not(sF5),
    introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).

fof(f33,plain,
    not(sF5) = sF6,
    inference(reorient_equations,[],[f32]) ).

fof(f34,definition,
    sF7 = or(sF1,p),
    introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).

fof(f35,plain,
    or(sF1,p) = sF7,
    inference(reorient_equations,[],[f34]) ).

fof(f36,definition,
    sF8 = not(sF7),
    introduced(definition,[new_symbols(definition,[sF8])],[function_definition]) ).

fof(f37,plain,
    not(sF7) = sF8,
    inference(reorient_equations,[],[f36]) ).

fof(f38,definition,
    sF9 = or(sF6,sF8),
    introduced(definition,[new_symbols(definition,[sF9])],[function_definition]) ).

fof(f39,plain,
    or(sF6,sF8) = sF9,
    inference(reorient_equations,[],[f38]) ).

fof(f40,definition,
    sF10 = not(sF9),
    introduced(definition,[new_symbols(definition,[sF10])],[function_definition]) ).

fof(f41,plain,
    not(sF9) = sF10,
    inference(reorient_equations,[],[f40]) ).

fof(f42,definition,
    sF11 = or(sF4,sF10),
    introduced(definition,[new_symbols(definition,[sF11])],[function_definition]) ).

fof(f43,plain,
    or(sF4,sF10) = sF11,
    inference(reorient_equations,[],[f42]) ).

fof(f44,plain,
    ~ theorem(sF11),
    inference(definition_folding,[],[f19,f43,f41,f39,f37,f35,f23,f33,f31,f21,f29,f27,f25,f23,f21]) ).

fof(f45,plain,
    ! [X2,X0,X1] : theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
    inference(resolution,[],[f17,f7]) ).

fof(f64,plain,
    ! [X2,X0,X1] :
      ( theorem(or(not(or(X0,X1)),or(X0,X2)))
      | ~ theorem(or(not(X1),X2)) ),
    inference(resolution,[],[f18,f45]) ).

fof(f142,plain,
    ! [X2,X0,X1] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
    inference(resolution,[],[f16,f7]) ).

fof(f149,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(X1,or(X0,X2)))
      | theorem(or(X0,or(X1,X2))) ),
    inference(resolution,[],[f142,f18]) ).

fof(f156,plain,
    ! [X2,X0,X1] : theorem(or(not(or(X0,X1)),or(not(or(not(X1),X2)),or(X0,X2)))),
    inference(resolution,[],[f149,f45]) ).

fof(f185,plain,
    ! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
    inference(resolution,[],[f15,f7]) ).

fof(f200,plain,
    ! [X0,X1] :
      ( ~ theorem(or(X1,X0))
      | theorem(or(X0,X1)) ),
    inference(resolution,[],[f185,f18]) ).

fof(f206,plain,
    theorem(or(not(sF9),or(sF8,sF6))),
    inference(superposition,[],[f185,f39]) ).

fof(f212,plain,
    theorem(or(sF10,or(sF8,sF6))),
    inference(forward_demodulation,[],[f206,f41]) ).

fof(f216,plain,
    ! [X0,X1] : theorem(or(not(X0),or(X1,X0))),
    inference(resolution,[],[f14,f7]) ).

fof(f232,plain,
    ! [X0,X1] : theorem(or(X0,or(not(X1),X1))),
    inference(resolution,[],[f216,f149]) ).

fof(f241,plain,
    theorem(or(not(q),sF5)),
    inference(superposition,[],[f216,f31]) ).

fof(f246,plain,
    theorem(or(sF1,sF5)),
    inference(forward_demodulation,[],[f241,f23]) ).

fof(f260,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(not(X0),X1))
      | theorem(or(X2,X1))
      | ~ theorem(or(X2,X0)) ),
    inference(resolution,[],[f64,f18]) ).

fof(f279,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(X0,or(X2,X1)))
      | theorem(or(X0,or(X1,X2))) ),
    inference(resolution,[],[f260,f185]) ).

fof(f280,plain,
    ! [X2,X3,X0,X1] :
      ( ~ theorem(or(X0,or(X1,X3)))
      | theorem(or(X0,or(X1,X2)))
      | ~ theorem(or(not(X3),X2)) ),
    inference(resolution,[],[f260,f64]) ).

fof(f284,plain,
    ! [X2,X0,X1] :
      ( theorem(or(X0,or(X1,X2)))
      | ~ theorem(or(X0,X2)) ),
    inference(resolution,[],[f260,f216]) ).

fof(f287,plain,
    ! [X0,X1] :
      ( ~ theorem(or(sF3,X0))
      | theorem(or(X1,X0))
      | ~ theorem(or(X1,sF2)) ),
    inference(superposition,[],[f260,f27]) ).

fof(f297,plain,
    ! [X0,X1] : theorem(or(not(X0),or(X0,X1))),
    inference(resolution,[],[f279,f216]) ).

fof(f303,plain,
    ! [X2,X0,X1] :
      ( theorem(or(not(or(X0,X1)),or(X1,X2)))
      | ~ theorem(or(not(X0),X2)) ),
    inference(resolution,[],[f280,f185]) ).

fof(f306,plain,
    ! [X2,X3,X0,X1] :
      ( theorem(or(not(or(X0,or(X1,X2))),or(X1,X3)))
      | ~ theorem(or(not(or(X0,X2)),X3)) ),
    inference(resolution,[],[f280,f142]) ).

fof(f316,plain,
    ! [X0] : theorem(or(not(or(X0,X0)),X0)),
    inference(resolution,[],[f13,f7]) ).

fof(f317,plain,
    ! [X0,X1] :
      ( ~ theorem(or(X0,or(X1,X1)))
      | theorem(or(X0,X1)) ),
    inference(resolution,[],[f316,f260]) ).

fof(f318,plain,
    ! [X0] :
      ( ~ theorem(or(X0,X0))
      | theorem(X0) ),
    inference(resolution,[],[f316,f18]) ).

fof(f327,plain,
    ! [X0] : theorem(or(not(X0),X0)),
    inference(resolution,[],[f317,f216]) ).

fof(f332,plain,
    ! [X2,X0,X1] :
      ( theorem(or(X0,or(X1,X2)))
      | ~ theorem(or(X0,X1)) ),
    inference(resolution,[],[f284,f279]) ).

fof(f336,plain,
    ! [X0] :
      ( ~ theorem(or(X0,sF1))
      | theorem(or(X0,sF2)) ),
    inference(superposition,[],[f284,f25]) ).

fof(f342,plain,
    ! [X2,X0,X1] :
      ( theorem(or(not(or(not(X0),X1)),or(X2,X1)))
      | ~ theorem(or(X2,X0)) ),
    inference(resolution,[],[f156,f18]) ).

fof(f371,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(not(X0),X1))
      | theorem(or(X2,X1))
      | ~ theorem(or(X0,X2)) ),
    inference(resolution,[],[f303,f18]) ).

fof(f392,plain,
    ! [X2,X3,X0,X1] :
      ( ~ theorem(or(not(or(X0,X1)),X2))
      | theorem(or(X3,X2))
      | ~ theorem(or(X0,or(X3,X1))) ),
    inference(resolution,[],[f306,f18]) ).

fof(f434,plain,
    ! [X0] :
      ( ~ theorem(or(X0,sF4))
      | theorem(or(X0,sF11)) ),
    inference(superposition,[],[f332,f43]) ).

fof(f451,plain,
    ! [X0] : theorem(or(X0,not(X0))),
    inference(resolution,[],[f327,f200]) ).

fof(f472,plain,
    ! [X0,X1] :
      ( theorem(or(not(or(sF6,X0)),or(X1,X0)))
      | ~ theorem(or(X1,sF5)) ),
    inference(superposition,[],[f342,f33]) ).

fof(f508,plain,
    ! [X0,X1] :
      ( ~ theorem(or(not(sF7),X0))
      | theorem(or(X1,X0))
      | ~ theorem(or(sF1,or(X1,p))) ),
    inference(superposition,[],[f392,f35]) ).

fof(f512,plain,
    ! [X0,X1] :
      ( ~ theorem(or(sF1,or(X1,p)))
      | theorem(or(X1,X0))
      | ~ theorem(or(sF8,X0)) ),
    inference(forward_demodulation,[],[f508,f37]) ).

fof(f592,plain,
    theorem(or(not(sF0),sF2)),
    inference(superposition,[],[f297,f25]) ).

fof(f606,plain,
    theorem(or(sF5,sF1)),
    inference(resolution,[],[f246,f200]) ).

fof(f613,plain,
    theorem(or(sF8,or(sF10,sF6))),
    inference(resolution,[],[f212,f149]) ).

fof(f618,plain,
    ! [X0] :
      ( theorem(or(X0,not(sF3)))
      | ~ theorem(or(X0,sF2)) ),
    inference(resolution,[],[f287,f451]) ).

fof(f619,plain,
    ! [X0] :
      ( ~ theorem(or(X0,sF2))
      | theorem(or(X0,sF4)) ),
    inference(forward_demodulation,[],[f618,f29]) ).

fof(f774,plain,
    theorem(or(sF8,or(sF6,sF10))),
    inference(resolution,[],[f613,f279]) ).

fof(f820,plain,
    ! [X0] :
      ( theorem(or(not(p),X0))
      | ~ theorem(or(sF8,X0)) ),
    inference(resolution,[],[f232,f512]) ).

fof(f835,plain,
    ! [X0] :
      ( ~ theorem(or(sF8,X0))
      | theorem(or(sF0,X0)) ),
    inference(forward_demodulation,[],[f820,f21]) ).

fof(f1123,plain,
    theorem(or(not(sF0),sF4)),
    inference(resolution,[],[f592,f619]) ).

fof(f1129,plain,
    theorem(or(not(sF0),sF11)),
    inference(resolution,[],[f1123,f434]) ).

fof(f1131,plain,
    ! [X0] :
      ( ~ theorem(or(sF0,X0))
      | theorem(or(X0,sF11)) ),
    inference(resolution,[],[f1129,f371]) ).

fof(f1232,plain,
    theorem(or(sF0,or(sF6,sF10))),
    inference(resolution,[],[f835,f774]) ).

fof(f1758,plain,
    ( theorem(or(not(or(sF6,sF10)),sF11))
    | ~ theorem(or(sF4,sF5)) ),
    inference(superposition,[],[f472,f43]) ).

fof(f1761,definition,
    ( spl12_64
  <=> theorem(or(sF4,sF5)) ),
    introduced(definition,[new_symbols(definition,[spl12_64])],[avatar_definition]) ).

fof(f1763,plain,
    ( ~ theorem(or(sF4,sF5))
    | spl12_64 ),
    inference(avatar_component_clause,[],[f1761]) ).

fof(f1765,definition,
    ( spl12_65
  <=> theorem(or(not(or(sF6,sF10)),sF11)) ),
    introduced(definition,[new_symbols(definition,[spl12_65])],[avatar_definition]) ).

fof(f1767,plain,
    ( theorem(or(not(or(sF6,sF10)),sF11))
    | ~ spl12_65 ),
    inference(avatar_component_clause,[],[f1765]) ).

fof(f1768,plain,
    ( ~ spl12_64
    | spl12_65 ),
    inference(avatar_split_clause,[],[f1758,f1765,f1761]) ).

fof(f2578,plain,
    theorem(or(sF5,sF2)),
    inference(resolution,[],[f336,f606]) ).

fof(f2580,plain,
    theorem(or(sF5,sF4)),
    inference(resolution,[],[f2578,f619]) ).

fof(f2583,plain,
    theorem(or(sF4,sF5)),
    inference(resolution,[],[f2580,f200]) ).

fof(f2584,plain,
    ( $false
    | spl12_64 ),
    inference(forward_subsumption_resolution,[],[f2583,f1763]) ).

fof(f2585,plain,
    spl12_64,
    inference(avatar_contradiction_clause,[],[f2584]) ).

fof(f2588,plain,
    ( ! [X0] :
        ( ~ theorem(or(X0,or(sF6,sF10)))
        | theorem(or(X0,sF11)) )
    | ~ spl12_65 ),
    inference(resolution,[],[f1767,f260]) ).

fof(f2615,plain,
    ( theorem(or(sF0,sF11))
    | ~ spl12_65 ),
    inference(resolution,[],[f2588,f1232]) ).

fof(f2660,plain,
    ( theorem(or(sF11,sF11))
    | ~ spl12_65 ),
    inference(resolution,[],[f2615,f1131]) ).

fof(f2664,plain,
    ( theorem(sF11)
    | ~ spl12_65 ),
    inference(resolution,[],[f2660,f318]) ).

fof(f2666,plain,
    ( $false
    | ~ spl12_65 ),
    inference(forward_subsumption_resolution,[],[f2664,f44]) ).

fof(f2667,plain,
    ~ spl12_65,
    inference(avatar_contradiction_clause,[],[f2666]) ).

cnf(s38,plain,
    ( ~ spl12_64
    | spl12_65 ),
    inference(sat_conversion,[],[f1768]) ).

cnf(s79,plain,
    spl12_64,
    inference(sat_conversion,[],[f2585]) ).

cnf(s86,plain,
    ~ spl12_65,
    inference(sat_conversion,[],[f2667]) ).

cnf(s91,plain,
    $false,
    inference(rat,[],[s38,s86,s79]) ).

fof(f2668,plain,
    $false,
    inference(avatar_sat_refutation,[],[s91]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL319-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/5.41  % Computer : n015.cluster.edu
% 0.13/5.41  % Model    : x86_64 x86_64
% 0.13/5.41  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/5.41  % Memory   : 8046.5625MB
% 0.13/5.41  % OS       : Linux 6.8.0-71-generic
% 0.13/5.41  % CPULimit : 300
% 0.13/5.41  % WCLimit  : 300
% 0.13/5.41  % DateTime : Sun Sep 27 15:38:07 UTC 2026
% 0.13/5.42  % CPUTime  : 
% 0.13/5.42  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/5.48  Running first-order theorem proving
% 0.13/5.48  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
% 11.18/8.01  % (1798131)Input is clausal, will run a generic CNF schedule.
% 11.18/8.01  % (1798138)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=3896949185:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 11.18/8.01  % (1798137)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=1966622977:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 11.18/8.01  % (1798136)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=3123883438:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 11.18/8.01  % (1798139)lrs+10_1_sil=8000:sp=occurrence:random_seed=3087712606:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 11.18/8.01  % (1798140)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=3623070133:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 11.18/8.01  % (1798141)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2460794989:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 11.18/8.01  % (1798142)dis-21_1_sil=8000:lcm=predicate:random_seed=575552258: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)
% 11.18/8.01  % (1798142)Instruction limit reached! 
% 11.18/8.01  % (1798142)------------------------------
% 11.18/8.01  % (1798142)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.18/8.01  % (1798142)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.18/8.01  % (1798142)CaDiCaL version: 2.1.3
% 11.18/8.01  % (1798142)Termination reason: Instruction limit
% 11.18/8.01  % (1798142)Termination phase: Saturation
% 11.18/8.01  % (1798142)Time elapsed: 0.095 s
% 11.18/8.01  % (1798142)Peak memory usage: 87 MB
% 11.18/8.01  % (1798142)Instructions burned: 117 (million)
% 11.18/8.01  % (1798139)Instruction limit reached! 
% 11.18/8.01  % (1798139)------------------------------
% 11.18/8.01  % (1798139)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.18/8.01  % (1798139)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.18/8.01  % (1798139)CaDiCaL version: 2.1.3
% 11.18/8.01  % (1798139)Termination reason: Instruction limit
% 11.18/8.01  % (1798139)Termination phase: Saturation
% 11.18/8.01  % (1798139)Time elapsed: 0.105 s
% 11.18/8.01  % (1798139)Peak memory usage: 89 MB
% 11.18/8.01  % (1798139)Instructions burned: 107 (million)
% 11.18/8.01  % (1798140)Instruction limit reached! 
% 11.18/8.01  % (1798140)------------------------------
% 11.18/8.01  % (1798140)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.18/8.01  % (1798140)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.18/8.01  % (1798140)CaDiCaL version: 2.1.3
% 11.18/8.01  % (1798140)Termination reason: Instruction limit
% 11.18/8.01  % (1798140)Termination phase: Saturation
% 11.18/8.01  % (1798140)Time elapsed: 0.111 s
% 11.18/8.01  % (1798140)Peak memory usage: 89 MB
% 11.18/8.01  % (1798140)Instructions burned: 118 (million)
% 11.18/8.01  % (1798141)Instruction limit reached! 
% 11.18/8.01  % (1798141)------------------------------
% 11.18/8.01  % (1798141)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.18/8.01  % (1798141)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.18/8.01  % (1798141)CaDiCaL version: 2.1.3
% 11.18/8.01  % (1798141)Termination reason: Instruction limit
% 11.18/8.01  % (1798141)Termination phase: Saturation
% 11.18/8.01  % (1798141)Time elapsed: 0.180 s
% 11.18/8.01  % (1798141)Peak memory usage: 90 MB
% 11.18/8.01  % (1798141)Instructions burned: 181 (million)
% 11.18/8.01  % (1798150)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=2674803315:i=143:sd=2:aac=none:ss=axioms:sgt=16_2995 on theBenchmark for (2995ds/143Mi)
% 11.18/8.01  % (1798151)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=3358090892:st=3:avsq=on:s2a=on:i=189:s2at=1.2:avsqr=1,16:sd=2:bd=all:nm=64:ss=axioms:sgt=30_2995 on theBenchmark for (2995ds/189Mi)
% 11.18/8.01  % (1798150)Refutation not found, incomplete strategy
% 11.18/8.01  % (1798150)------------------------------
% 11.18/8.01  % (1798150)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.18/8.01  % (1798150)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.18/8.01  % (1798150)CaDiCaL version: 2.1.3
% 11.18/8.01  % (1798150)Termination reason: Refutation not found, incomplete strategy
% 11.18/8.01  % (1798150)Time elapsed: 0.001 s
% 11.18/8.01  % (1798150)Peak memory usage: 88 MB
% 11.18/8.01  % (1798151)Refutation not found, incomplete strategy
% 11.18/8.01  % (1798151)------------------------------
% 11.18/8.01  % (1798151)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.18/8.01  % (1798151)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.18/8.01  % (1798151)CaDiCaL version: 2.1.3
% 11.18/8.01  % (1798151)Termination reason: Refutation not found, incomplete strategy
% 11.18/8.01  % (1798151)Time elapsed: 0.002 s
% 11.18/8.01  % (1798151)Peak memory usage: 87 MB
% 11.18/8.01  % (1798152)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=3411470321:st=4:i=219:sd=3:ss=axioms_2995 on theBenchmark for (2995ds/219Mi)
% 11.18/8.01  % (1798152)Refutation not found, incomplete strategy
% 11.18/8.01  % (1798152)------------------------------
% 11.18/8.01  % (1798152)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.18/8.01  % (1798152)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.18/8.01  % (1798152)CaDiCaL version: 2.1.3
% 11.18/8.01  % (1798152)Termination reason: Refutation not found, incomplete strategy
% 11.18/8.01  % (1798152)Time elapsed: 0.002 s
% 11.18/8.01  % (1798152)Peak memory usage: 88 MB
% 11.18/8.01  % (1798152)Instructions burned: 1 (million)
% 11.18/8.01  % (1798153)lrs+10_64_to=lpo:sil=8000:random_seed=3652797380:i=126:bd=preordered_2995 on theBenchmark for (2995ds/126Mi)
% 11.18/8.01  % (1798153)Instruction limit reached! 
% 11.18/8.01  % (1798153)------------------------------
% 11.18/8.01  % (1798153)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.18/8.01  % (1798153)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.18/8.01  % (1798153)CaDiCaL version: 2.1.3
% 11.18/8.01  % (1798153)Termination reason: Instruction limit
% 11.18/8.01  % (1798153)Termination phase: Saturation
% 11.18/8.01  % (1798153)Time elapsed: 0.116 s
% 11.18/8.01  % (1798153)Peak memory usage: 89 MB
% 11.18/8.01  % (1798153)Instructions burned: 126 (million)
% 11.18/8.01  % (1798150)------------------------------
% 11.18/8.01  % (1798150)------------------------------
% 11.18/8.01  % (1798151)------------------------------
% 11.18/8.01  % (1798151)------------------------------
% 11.18/8.01  % (1798152)------------------------------
% 11.18/8.01  % (1798152)------------------------------
% 11.18/8.01  % (1798159)lrs+10_1_sil=8000:tgt=full:acc=on:random_seed=456931581:i=157:gtg=all_2990 on theBenchmark for (2990ds/157Mi)
% 11.18/8.01  % (1798158)lrs+1011_16_to=lpo:sil=8000:drc=off:sp=reverse_frequency:spb=goal_then_units:random_seed=1739635235:avsq=on:i=194:fgj=on:bd=preordered_2990 on theBenchmark for (2990ds/194Mi)
% 11.18/8.01  % (1798159)Instruction limit reached! 
% 11.18/8.01  % (1798159)------------------------------
% 11.18/8.01  % (1798159)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.18/8.01  % (1798159)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.18/8.01  % (1798159)CaDiCaL version: 2.1.3
% 11.18/8.01  % (1798159)Termination reason: Instruction limit
% 11.18/8.01  % (1798159)Termination phase: Saturation
% 11.18/8.01  % (1798159)Time elapsed: 0.161 s
% 11.18/8.01  % (1798159)Peak memory usage: 91 MB
% 11.18/8.01  % (1798159)Instructions burned: 157 (million)
% 11.18/8.01  % (1798160)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:random_seed=1834459257:i=3394:sd=4:ss=included:sgt=64_2989 on theBenchmark for (2989ds/3394Mi)
% 11.18/8.01  % (1798161)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=700635388:cts=off:s2a=on:i=106:fsr=off:gsp=on:ss=axioms:sgt=16:rawr=on_2989 on theBenchmark for (2989ds/106Mi)
% 11.18/8.01  % (1798158)Instruction limit reached! 
% 11.18/8.01  % (1798158)------------------------------
% 11.18/8.01  % (1798158)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.18/8.01  % (1798158)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.18/8.01  % (1798158)CaDiCaL version: 2.1.3
% 11.18/8.01  % (1798158)Termination reason: Instruction limit
% 11.18/8.01  % (1798158)Termination phase: Saturation
% 11.18/8.01  % (1798158)Time elapsed: 0.205 s
% 11.18/8.01  % (1798158)Peak memory usage: 90 MB
% 11.18/8.01  % (1798158)Instructions burned: 194 (million)
% 11.18/8.01  % (1798161)Instruction limit reached! 
% 11.18/8.01  % (1798161)------------------------------
% 11.18/8.01  % (1798161)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.18/8.01  % (1798161)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.18/8.01  % (1798161)CaDiCaL version: 2.1.3
% 11.18/8.01  % (1798161)Termination reason: Instruction limit
% 11.18/8.01  % (1798161)Termination phase: Saturation
% 11.18/8.01  % (1798161)Time elapsed: 0.094 s
% 11.18/8.01  % (1798161)Peak memory usage: 89 MB
% 11.18/8.01  % (1798161)Instructions burned: 107 (million)
% 11.18/8.01  % (1798136)First to succeed.
% 11.18/8.01  % (1798136)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1798131"
% 11.18/8.01  % (1798164)lrs+2_4096_sil=8000:plsq=on:plsqr=12672147,131072:sos=on:spb=goal:lcm=predicate:random_seed=3017889796:i=107_2986 on theBenchmark for (2986ds/107Mi)
% 11.18/8.01  % (1798164)Refutation not found, incomplete strategy
% 11.18/8.01  % (1798164)------------------------------
% 11.18/8.01  % (1798164)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.18/8.01  % (1798164)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.18/8.01  % (1798164)CaDiCaL version: 2.1.3
% 11.18/8.01  % (1798164)Termination reason: Refutation not found, incomplete strategy
% 11.18/8.01  % (1798164)Time elapsed: 0.002 s
% 11.18/8.01  % (1798164)Peak memory usage: 87 MB
% 11.18/8.01  % (1798167)lrs+1011_20_sil=64000:tgt=ground:plsq=on:fde=unused:plsqc=1:plsqr=14,1:plsql=on:nwc=0.6:random_seed=2027069006:st=6:i=242:gtgl=5:kws=arity_squared:av=off:gtg=exists_sym:ss=included_2986 on theBenchmark for (2986ds/242Mi)
% 11.18/8.01  % (1798168)lrs+1010_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:tgt=ground:npcc=on:sims=off:random_seed=1231670510:cond=fast:i=5208:av=off_2985 on theBenchmark for (2985ds/5208Mi)
% 11.18/8.01  % (1798136)Refutation found. Thanks to Tanya!
% 11.18/8.01  % SZS status Unsatisfiable for theBenchmark
% 11.18/8.01  % SZS output start Proof for theBenchmark
% See solution above
% 0.22/8.21  % (1798136)------------------------------
% 0.22/8.21  % (1798136)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.22/8.21  % (1798136)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/8.21  % (1798136)CaDiCaL version: 2.1.3
% 0.22/8.21  % (1798136)Termination reason: Refutation
% 0.22/8.21  % (1798136)Time elapsed: 1.260 s
% 0.22/8.21  % (1798136)Peak memory usage: 134 MB
% 0.22/8.21  % (1798136)Instructions burned: 1553 (million)
% 0.22/8.21  % (1798136)------------------------------
% 0.22/8.21  % (1798136)------------------------------
% 0.22/8.21  % (1798131)Success in time 1.795 s
% 0.22/8.21  % Vampire exiting
%------------------------------------------------------------------------------