↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : LCL285-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 : n010.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:52 AM UTC 2026

% Result   : Unsatisfiable 10.43s 2.36s
% Output   : Refutation 10.95s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   19
%            Number of leaves      :   26
% Syntax   : Number of formulae    :  107 (  67 unt;  15 def)
%            Number of atoms       :  161 (  28 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :  109 (  55   ~;  51   |;   0   &)
%                                         (   3 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :   10 (   2 avg)
%            Number of predicates  :    7 (   5 usr;   4 prp; 0-2 aty)
%            Number of functors    :   19 (  19 usr;  14 con; 0-2 aty)
%            Number of variables   :   79 (   0 sgn  79   !;   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(equivalent(p,or(p,and(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(not(or(not(or(not(p),or(p,not(or(not(p),not(q)))))),not(or(not(or(p,not(or(not(p),not(q))))),p))))),
    inference(definition_unfolding,[],[f11,f12,f9]) ).

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 = or(p,sF3),
    introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).

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

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

fof(f31,plain,
    or(sF0,sF4) = 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 = not(sF4),
    introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).

fof(f35,plain,
    not(sF4) = sF7,
    inference(reorient_equations,[],[f34]) ).

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

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

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

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

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

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

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

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

fof(f44,plain,
    ~ theorem(sF11),
    inference(definition_folding,[],[f19,f43,f41,f39,f37,f35,f29,f27,f25,f23,f21,f33,f31,f29,f27,f25,f23,f21,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(f62,plain,
    ! [X2,X0,X1] :
      ( theorem(or(not(or(X0,X1)),or(X0,X2)))
      | ~ theorem(or(not(X1),X2)) ),
    inference(resolution,[],[f18,f45]) ).

fof(f66,plain,
    ! [X0] :
      ( ~ theorem(or(sF6,X0))
      | theorem(X0)
      | ~ theorem(sF5) ),
    inference(superposition,[],[f18,f33]) ).

fof(f77,definition,
    ( spl12_3
  <=> theorem(sF5) ),
    introduced(definition,[new_symbols(definition,[spl12_3])],[avatar_definition]) ).

fof(f79,plain,
    ( ~ theorem(sF5)
    | spl12_3 ),
    inference(avatar_component_clause,[],[f77]) ).

fof(f81,definition,
    ( spl12_4
  <=> ! [X0] :
        ( ~ theorem(or(sF6,X0))
        | theorem(X0) ) ),
    introduced(definition,[new_symbols(definition,[spl12_4])],[avatar_definition]) ).

fof(f82,plain,
    ( ! [X0] :
        ( ~ theorem(or(sF6,X0))
        | theorem(X0) )
    | ~ spl12_4 ),
    inference(avatar_component_clause,[],[f81]) ).

fof(f83,plain,
    ( ~ spl12_3
    | spl12_4 ),
    inference(avatar_split_clause,[],[f66,f81,f77]) ).

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

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

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

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

fof(f205,plain,
    theorem(or(not(sF4),or(sF3,p))),
    inference(superposition,[],[f187,f29]) ).

fof(f208,plain,
    theorem(or(not(sF10),or(sF9,sF6))),
    inference(superposition,[],[f187,f41]) ).

fof(f216,plain,
    theorem(or(sF11,or(sF9,sF6))),
    inference(forward_demodulation,[],[f208,f43]) ).

fof(f219,plain,
    theorem(or(sF7,or(sF3,p))),
    inference(forward_demodulation,[],[f205,f35]) ).

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

fof(f248,plain,
    theorem(or(not(p),sF8)),
    inference(superposition,[],[f220,f37]) ).

fof(f249,plain,
    theorem(or(sF0,sF8)),
    inference(forward_demodulation,[],[f248,f21]) ).

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

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

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

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

fof(f290,plain,
    ! [X0,X1] :
      ( ~ theorem(or(sF9,X0))
      | theorem(or(X1,X0))
      | ~ theorem(or(X1,sF8)) ),
    inference(superposition,[],[f260,f39]) ).

fof(f296,plain,
    ! [X0,X1] : theorem(or(not(X0),or(X0,X1))),
    inference(resolution,[],[f282,f220]) ).

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

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

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

fof(f401,plain,
    theorem(or(sF9,or(sF11,sF6))),
    inference(resolution,[],[f216,f119]) ).

fof(f439,plain,
    ! [X0] :
      ( ~ theorem(or(X0,sF0))
      | theorem(or(X0,sF2)) ),
    inference(superposition,[],[f359,f25]) ).

fof(f444,plain,
    theorem(or(sF9,or(sF6,sF11))),
    inference(resolution,[],[f401,f282]) ).

fof(f449,plain,
    theorem(or(sF6,or(sF9,sF11))),
    inference(resolution,[],[f444,f119]) ).

fof(f568,plain,
    theorem(or(not(p),sF4)),
    inference(superposition,[],[f296,f29]) ).

fof(f573,plain,
    theorem(or(sF0,sF4)),
    inference(forward_demodulation,[],[f568,f21]) ).

fof(f574,plain,
    theorem(sF5),
    inference(forward_demodulation,[],[f573,f31]) ).

fof(f575,plain,
    ( $false
    | spl12_3 ),
    inference(forward_subsumption_resolution,[],[f574,f79]) ).

fof(f576,plain,
    spl12_3,
    inference(avatar_contradiction_clause,[],[f575]) ).

fof(f605,plain,
    theorem(or(sF3,or(sF7,p))),
    inference(resolution,[],[f219,f119]) ).

fof(f607,plain,
    theorem(or(sF3,sF8)),
    inference(forward_demodulation,[],[f605,f37]) ).

fof(f843,definition,
    ( spl12_41
  <=> theorem(or(sF11,sF2)) ),
    introduced(definition,[new_symbols(definition,[spl12_41])],[avatar_definition]) ).

fof(f844,plain,
    ( theorem(or(sF11,sF2))
    | ~ spl12_41 ),
    inference(avatar_component_clause,[],[f843]) ).

fof(f845,plain,
    ( ~ theorem(or(sF11,sF2))
    | spl12_41 ),
    inference(avatar_component_clause,[],[f843]) ).

fof(f901,plain,
    ( theorem(or(sF9,sF11))
    | ~ spl12_4 ),
    inference(resolution,[],[f449,f82]) ).

fof(f906,plain,
    ( ! [X0] :
        ( ~ theorem(or(X0,sF8))
        | theorem(or(X0,sF11)) )
    | ~ spl12_4 ),
    inference(resolution,[],[f901,f290]) ).

fof(f912,plain,
    ( theorem(or(sF0,sF11))
    | ~ spl12_4 ),
    inference(resolution,[],[f906,f249]) ).

fof(f913,plain,
    ( theorem(or(sF3,sF11))
    | ~ spl12_4 ),
    inference(resolution,[],[f906,f607]) ).

fof(f915,plain,
    ( ! [X0] :
        ( ~ theorem(or(X0,sF2))
        | theorem(or(X0,sF11)) )
    | ~ spl12_4 ),
    inference(resolution,[],[f913,f287]) ).

fof(f917,plain,
    ( theorem(or(sF11,sF0))
    | ~ spl12_4 ),
    inference(resolution,[],[f912,f203]) ).

fof(f1171,plain,
    ( theorem(or(sF11,sF2))
    | ~ spl12_4 ),
    inference(resolution,[],[f439,f917]) ).

fof(f1172,plain,
    ( $false
    | ~ spl12_4
    | spl12_41 ),
    inference(forward_subsumption_resolution,[],[f1171,f845]) ).

fof(f1173,plain,
    ( ~ spl12_4
    | spl12_41 ),
    inference(avatar_contradiction_clause,[],[f1172]) ).

fof(f1175,plain,
    ( theorem(or(sF11,sF11))
    | ~ spl12_4
    | ~ spl12_41 ),
    inference(resolution,[],[f844,f915]) ).

fof(f1181,plain,
    ( theorem(sF11)
    | ~ spl12_4
    | ~ spl12_41 ),
    inference(resolution,[],[f1175,f316]) ).

fof(f1183,plain,
    ( $false
    | ~ spl12_4
    | ~ spl12_41 ),
    inference(forward_subsumption_resolution,[],[f1181,f44]) ).

fof(f1184,plain,
    ( ~ spl12_4
    | ~ spl12_41 ),
    inference(avatar_contradiction_clause,[],[f1183]) ).

cnf(s2,plain,
    ( ~ spl12_3
    | spl12_4 ),
    inference(sat_conversion,[],[f83]) ).

cnf(s13,plain,
    spl12_3,
    inference(sat_conversion,[],[f576]) ).

cnf(s38,plain,
    ( ~ spl12_4
    | spl12_41 ),
    inference(sat_conversion,[],[f1173]) ).

cnf(s40,plain,
    ( ~ spl12_4
    | ~ spl12_41 ),
    inference(sat_conversion,[],[f1184]) ).

cnf(s41,plain,
    spl12_4,
    inference(rat,[],[s2,s13]) ).

cnf(s42,plain,
    ~ spl12_41,
    inference(rat,[],[s40,s41]) ).

cnf(s44,plain,
    $false,
    inference(rat,[],[s38,s42,s41]) ).

fof(f1185,plain,
    $false,
    inference(avatar_sat_refutation,[],[s44]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL285-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.40  % Computer : n010.cluster.edu
% 0.13/0.40  % Model    : x86_64 x86_64
% 0.13/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.40  % Memory   : 8046.5625MB
% 0.13/0.40  % OS       : Linux 6.8.0-71-generic
% 0.13/0.40  % CPULimit : 300
% 0.13/0.40  % WCLimit  : 300
% 0.13/0.40  % DateTime : Sun Sep 27 15:32:46 UTC 2026
% 0.13/0.40  % CPUTime  : 
% 0.13/0.40  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.43  Running first-order theorem proving
% 0.13/0.43  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
% 10.43/2.36  % (1103553)Input is clausal, will run a generic CNF schedule.
% 10.43/2.36  % (1103661)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=4041348802:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 10.43/2.36  % (1103663)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=957151804:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 10.43/2.36  % (1103665)dis-21_1_sil=8000:lcm=predicate:random_seed=3389458110: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)
% 10.43/2.36  % (1103660)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=616011840:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 10.43/2.36  % (1103664)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1415849460:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 10.43/2.36  % (1103659)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=531151860:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 10.43/2.36  % (1103662)lrs+10_1_sil=8000:sp=occurrence:random_seed=2580770891:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 10.43/2.36  % (1103665)Instruction limit reached! 
% 10.43/2.36  % (1103665)------------------------------
% 10.43/2.36  % (1103665)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.43/2.36  % (1103665)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.43/2.36  % (1103665)CaDiCaL version: 2.1.3
% 10.43/2.36  % (1103665)Termination reason: Instruction limit
% 10.43/2.36  % (1103665)Termination phase: Saturation
% 10.43/2.36  % (1103665)Time elapsed: 0.058 s
% 10.43/2.36  % (1103665)Peak memory usage: 87 MB
% 10.43/2.36  % (1103665)Instructions burned: 117 (million)
% 10.43/2.36  % (1103662)Instruction limit reached! 
% 10.43/2.36  % (1103662)------------------------------
% 10.43/2.36  % (1103662)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.43/2.36  % (1103662)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.43/2.36  % (1103662)CaDiCaL version: 2.1.3
% 10.43/2.36  % (1103662)Termination reason: Instruction limit
% 10.43/2.36  % (1103662)Termination phase: Saturation
% 10.43/2.36  % (1103662)Time elapsed: 0.070 s
% 10.43/2.36  % (1103662)Peak memory usage: 89 MB
% 10.43/2.36  % (1103662)Instructions burned: 108 (million)
% 10.43/2.36  % (1103663)Instruction limit reached! 
% 10.43/2.36  % (1103663)------------------------------
% 10.43/2.36  % (1103663)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.43/2.36  % (1103663)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.43/2.36  % (1103663)CaDiCaL version: 2.1.3
% 10.43/2.36  % (1103663)Termination reason: Instruction limit
% 10.43/2.36  % (1103663)Termination phase: Saturation
% 10.43/2.36  % (1103663)Time elapsed: 0.072 s
% 10.43/2.36  % (1103663)Peak memory usage: 88 MB
% 10.43/2.36  % (1103663)Instructions burned: 115 (million)
% 10.43/2.36  % (1103664)Instruction limit reached! 
% 10.43/2.36  % (1103664)------------------------------
% 10.43/2.36  % (1103664)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.43/2.36  % (1103664)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.43/2.36  % (1103664)CaDiCaL version: 2.1.3
% 10.43/2.36  % (1103664)Termination reason: Instruction limit
% 10.43/2.36  % (1103664)Termination phase: Saturation
% 10.43/2.36  % (1103664)Time elapsed: 0.124 s
% 10.43/2.36  % (1103664)Peak memory usage: 89 MB
% 10.43/2.36  % (1103664)Instructions burned: 181 (million)
% 10.43/2.36  % (1103677)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=1823078128:i=143:sd=2:aac=none:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/143Mi)
% 10.43/2.36  % (1103677)Refutation not found, incomplete strategy
% 10.43/2.36  % (1103677)------------------------------
% 10.43/2.36  % (1103677)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.43/2.36  % (1103677)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.43/2.36  % (1103677)CaDiCaL version: 2.1.3
% 10.43/2.36  % (1103677)Termination reason: Refutation not found, incomplete strategy
% 10.43/2.36  % (1103677)Time elapsed: 0.001 s
% 10.43/2.36  % (1103677)Peak memory usage: 88 MB
% 10.43/2.36  % (1103679)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=2913798150: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)
% 10.43/2.36  % (1103679)Refutation not found, incomplete strategy
% 10.43/2.36  % (1103679)------------------------------
% 10.43/2.36  % (1103679)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.43/2.36  % (1103679)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.43/2.36  % (1103679)CaDiCaL version: 2.1.3
% 10.43/2.36  % (1103679)Termination reason: Refutation not found, incomplete strategy
% 10.43/2.36  % (1103679)Time elapsed: 0.001 s
% 10.43/2.36  % (1103679)Peak memory usage: 87 MB
% 10.43/2.36  % (1103681)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=141792225:st=4:i=219:sd=3:ss=axioms_2997 on theBenchmark for (2997ds/219Mi)
% 10.43/2.36  % (1103681)Refutation not found, incomplete strategy
% 10.43/2.36  % (1103681)------------------------------
% 10.43/2.36  % (1103681)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.43/2.36  % (1103681)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.43/2.36  % (1103681)CaDiCaL version: 2.1.3
% 10.43/2.36  % (1103681)Termination reason: Refutation not found, incomplete strategy
% 10.43/2.36  % (1103681)Time elapsed: 0.003 s
% 10.43/2.36  % (1103681)Peak memory usage: 88 MB
% 10.43/2.36  % (1103681)Instructions burned: 1 (million)
% 10.43/2.36  % (1103689)lrs+10_64_to=lpo:sil=8000:random_seed=1301019856:i=126:bd=preordered_2997 on theBenchmark for (2997ds/126Mi)
% 10.43/2.36  % (1103689)Instruction limit reached! 
% 10.43/2.36  % (1103689)------------------------------
% 10.43/2.36  % (1103689)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.43/2.36  % (1103689)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.43/2.36  % (1103689)CaDiCaL version: 2.1.3
% 10.43/2.36  % (1103689)Termination reason: Instruction limit
% 10.43/2.36  % (1103689)Termination phase: Saturation
% 10.43/2.36  % (1103689)Time elapsed: 0.073 s
% 10.43/2.36  % (1103689)Peak memory usage: 89 MB
% 10.43/2.36  % (1103689)Instructions burned: 128 (million)
% 10.43/2.36  % (1103681)------------------------------
% 10.43/2.36  % (1103681)------------------------------
% 10.43/2.36  % (1103677)------------------------------
% 10.43/2.36  % (1103677)------------------------------
% 10.43/2.36  % (1103679)------------------------------
% 10.43/2.36  % (1103679)------------------------------
% 10.43/2.36  % (1103694)lrs+1011_16_to=lpo:sil=8000:drc=off:sp=reverse_frequency:spb=goal_then_units:random_seed=2017091320:avsq=on:i=194:fgj=on:bd=preordered_2994 on theBenchmark for (2994ds/194Mi)
% 10.43/2.36  % (1103695)lrs+10_1_sil=8000:tgt=full:acc=on:random_seed=224707854:i=157:gtg=all_2993 on theBenchmark for (2993ds/157Mi)
% 10.43/2.36  % (1103696)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:random_seed=4164181969:i=3394:sd=4:ss=included:sgt=64_2993 on theBenchmark for (2993ds/3394Mi)
% 10.43/2.36  % (1103695)Instruction limit reached! 
% 10.43/2.36  % (1103695)------------------------------
% 10.43/2.36  % (1103695)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.43/2.36  % (1103695)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.43/2.36  % (1103695)CaDiCaL version: 2.1.3
% 10.43/2.36  % (1103695)Termination reason: Instruction limit
% 10.43/2.36  % (1103695)Termination phase: Saturation
% 10.43/2.36  % (1103695)Time elapsed: 0.057 s
% 10.43/2.36  % (1103695)Peak memory usage: 91 MB
% 10.43/2.36  % (1103695)Instructions burned: 159 (million)
% 10.43/2.36  % (1103697)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=507563029:cts=off:s2a=on:i=106:fsr=off:gsp=on:ss=axioms:sgt=16:rawr=on_2993 on theBenchmark for (2993ds/106Mi)
% 10.43/2.36  % (1103694)Instruction limit reached! 
% 10.43/2.36  % (1103694)------------------------------
% 10.43/2.36  % (1103694)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.43/2.36  % (1103694)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.43/2.36  % (1103694)CaDiCaL version: 2.1.3
% 10.43/2.36  % (1103694)Termination reason: Instruction limit
% 10.43/2.36  % (1103694)Termination phase: Saturation
% 10.43/2.36  % (1103694)Time elapsed: 0.126 s
% 10.43/2.36  % (1103694)Peak memory usage: 90 MB
% 10.43/2.36  % (1103694)Instructions burned: 195 (million)
% 10.43/2.36  % (1103697)Instruction limit reached! 
% 10.43/2.36  % (1103697)------------------------------
% 10.43/2.36  % (1103697)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.43/2.36  % (1103697)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.43/2.36  % (1103697)CaDiCaL version: 2.1.3
% 10.43/2.36  % (1103697)Termination reason: Instruction limit
% 10.43/2.36  % (1103697)Termination phase: Saturation
% 10.43/2.36  % (1103697)Time elapsed: 0.075 s
% 10.43/2.36  % (1103697)Peak memory usage: 89 MB
% 10.43/2.36  % (1103697)Instructions burned: 107 (million)
% 10.43/2.36  % (1103701)lrs+2_4096_sil=8000:plsq=on:plsqr=12672147,131072:sos=on:spb=goal:lcm=predicate:random_seed=3796833327:i=107_2992 on theBenchmark for (2992ds/107Mi)
% 10.43/2.36  % (1103701)Refutation not found, incomplete strategy
% 10.43/2.36  % (1103701)------------------------------
% 10.43/2.36  % (1103701)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.43/2.36  % (1103701)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.43/2.36  % (1103701)CaDiCaL version: 2.1.3
% 10.43/2.36  % (1103701)Termination reason: Refutation not found, incomplete strategy
% 10.43/2.36  % (1103701)Time elapsed: 0.001 s
% 10.43/2.36  % (1103701)Peak memory usage: 87 MB
% 10.43/2.36  % (1103659)First to succeed.
% 10.43/2.36  % (1103659)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1103553"
% 10.43/2.36  % (1103703)lrs+1011_20_sil=64000:tgt=ground:plsq=on:fde=unused:plsqc=1:plsqr=14,1:plsql=on:nwc=0.6:random_seed=3618857106:st=6:i=242:gtgl=5:kws=arity_squared:av=off:gtg=exists_sym:ss=included_2991 on theBenchmark for (2991ds/242Mi)
% 10.43/2.36  % (1103701)------------------------------
% 10.43/2.36  % (1103701)------------------------------
% 10.43/2.36  % (1103706)lrs+1010_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:tgt=ground:npcc=on:sims=off:random_seed=1643587907:cond=fast:i=5208:av=off_2991 on theBenchmark for (2991ds/5208Mi)
% 10.43/2.36  % (1103724)lrs+1011_16_sil=32000:erd=off:bce=on:random_seed=666878925:i=134:sd=2:doe=on:ss=axioms:sgt=14_2988 on theBenchmark for (2988ds/134Mi)
% 10.43/2.36  % (1103724)Instruction limit reached! 
% 10.43/2.36  % (1103724)------------------------------
% 10.43/2.36  % (1103724)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.43/2.36  % (1103724)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.43/2.36  % (1103724)CaDiCaL version: 2.1.3
% 10.43/2.36  % (1103724)Termination reason: Instruction limit
% 10.43/2.36  % (1103724)Termination phase: Saturation
% 10.43/2.36  % (1103724)Time elapsed: 0.076 s
% 10.43/2.36  % (1103724)Peak memory usage: 90 MB
% 10.43/2.36  % (1103724)Instructions burned: 135 (million)
% 10.43/2.36  % (1103703)Instruction limit reached! 
% 10.43/2.36  % (1103703)------------------------------
% 10.43/2.36  % (1103703)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.43/2.36  % (1103703)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.43/2.36  % (1103703)CaDiCaL version: 2.1.3
% 10.43/2.36  % (1103703)Termination reason: Instruction limit
% 10.43/2.36  % (1103703)Termination phase: Saturation
% 10.43/2.36  % (1103703)Time elapsed: 0.262 s
% 10.43/2.36  % (1103703)Peak memory usage: 90 MB
% 10.43/2.36  % (1103703)Instructions burned: 243 (million)
% 10.43/2.36  % (1103659)Refutation found. Thanks to Tanya!
% 10.43/2.36  % SZS status Unsatisfiable for theBenchmark
% 10.43/2.36  % SZS output start Proof for theBenchmark
% See solution above
% 10.95/2.47  % (1103659)------------------------------
% 10.95/2.47  % (1103659)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.95/2.47  % (1103659)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.95/2.47  % (1103659)CaDiCaL version: 2.1.3
% 10.95/2.47  % (1103659)Termination reason: Refutation
% 10.95/2.47  % (1103659)Time elapsed: 0.888 s
% 10.95/2.47  % (1103659)Peak memory usage: 132 MB
% 10.95/2.47  % (1103659)Instructions burned: 1234 (million)
% 10.95/2.47  % (1103659)------------------------------
% 10.95/2.47  % (1103659)------------------------------
% 10.95/2.47  % (1103553)Success in time 1.484 s
% 10.95/2.47  % Vampire exiting
%------------------------------------------------------------------------------