↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Result   : Unsatisfiable 13.67s 8.22s
% Output   : Refutation 16.57s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   19
%            Number of leaves      :   22
% Syntax   : Number of formulae    :  104 (  73 unt;  12 def)
%            Number of atoms       :  144 (  26 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   87 (  47   ~;  40   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    8 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   19 (  19 usr;  15 con; 0-2 aty)
%            Number of variables   :  110 ( 110   !;   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,negated_conjecture,
    ~ theorem(implies(and(r,implies(p,q)),implies(p,and(q,r)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

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

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

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

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

fof(f15,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(f16,plain,
    ! [X0,X1] :
      ( ~ theorem(or(not(X1),X0))
      | theorem(X0)
      | ~ theorem(X1) ),
    inference(definition_unfolding,[],[f8,f6]) ).

fof(f17,plain,
    ~ theorem(or(not(not(or(not(r),not(or(not(p),q))))),or(not(p),not(or(not(q),not(r)))))),
    inference(definition_unfolding,[],[f10,f6,f9,f6,f6,f9]) ).

fof(f18,definition,
    sF0 = not(r),
    introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).

fof(f19,plain,
    not(r) = sF0,
    inference(reorient_equations,[],[f18]) ).

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

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

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

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

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

fof(f25,plain,
    not(sF2) = sF3,
    inference(reorient_equations,[],[f24]) ).

fof(f26,definition,
    sF4 = or(sF0,sF3),
    introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).

fof(f27,plain,
    or(sF0,sF3) = sF4,
    inference(reorient_equations,[],[f26]) ).

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

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

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

fof(f31,plain,
    not(sF5) = sF6,
    inference(reorient_equations,[],[f30]) ).

fof(f32,definition,
    sF7 = not(q),
    introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).

fof(f33,plain,
    not(q) = sF7,
    inference(reorient_equations,[],[f32]) ).

fof(f34,definition,
    sF8 = or(sF7,sF0),
    introduced(definition,[new_symbols(definition,[sF8])],[function_definition]) ).

fof(f35,plain,
    or(sF7,sF0) = sF8,
    inference(reorient_equations,[],[f34]) ).

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

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

fof(f38,definition,
    sF10 = or(sF1,sF9),
    introduced(definition,[new_symbols(definition,[sF10])],[function_definition]) ).

fof(f39,plain,
    or(sF1,sF9) = sF10,
    inference(reorient_equations,[],[f38]) ).

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

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

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

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

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

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

fof(f146,plain,
    ! [X0] : theorem(or(not(or(sF1,or(X0,sF9))),or(X0,sF10))),
    inference(superposition,[],[f128,f39]) ).

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

fof(f193,plain,
    ! [X0,X1] :
      ( ~ theorem(or(X1,X0))
      | theorem(or(X0,X1)) ),
    inference(resolution,[],[f179,f16]) ).

fof(f197,plain,
    theorem(or(not(sF2),or(q,sF1))),
    inference(superposition,[],[f179,f23]) ).

fof(f199,plain,
    theorem(or(not(sF8),or(sF0,sF7))),
    inference(superposition,[],[f179,f35]) ).

fof(f205,plain,
    theorem(or(sF9,or(sF0,sF7))),
    inference(forward_demodulation,[],[f199,f37]) ).

fof(f206,plain,
    theorem(or(sF3,or(q,sF1))),
    inference(forward_demodulation,[],[f197,f25]) ).

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

fof(f231,plain,
    theorem(or(not(sF3),sF4)),
    inference(superposition,[],[f208,f27]) ).

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

fof(f273,plain,
    ! [X2,X3,X0,X1] :
      ( ~ theorem(or(X0,or(X2,or(X1,X3))))
      | theorem(or(X0,or(X1,or(X2,X3)))) ),
    inference(resolution,[],[f255,f128]) ).

fof(f274,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(X0,or(X2,X1)))
      | theorem(or(X0,or(X1,X2))) ),
    inference(resolution,[],[f255,f179]) ).

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

fof(f276,plain,
    ! [X2,X0,X1] :
      ( theorem(or(X0,or(X1,X2)))
      | ~ theorem(or(X0,X2)) ),
    inference(resolution,[],[f255,f208]) ).

fof(f281,plain,
    ! [X0,X1] :
      ( ~ theorem(or(sF5,X0))
      | theorem(or(X1,X0))
      | ~ theorem(or(X1,sF4)) ),
    inference(superposition,[],[f255,f29]) ).

fof(f288,plain,
    ! [X0,X1] : theorem(or(not(X0),or(X0,X1))),
    inference(resolution,[],[f274,f208]) ).

fof(f295,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,[],[f275,f128]) ).

fof(f296,plain,
    ! [X2,X0,X1] :
      ( theorem(or(not(or(X0,X1)),or(X1,X2)))
      | ~ theorem(or(not(X0),X2)) ),
    inference(resolution,[],[f275,f179]) ).

fof(f308,plain,
    ! [X2,X0,X1] :
      ( theorem(or(X0,or(X1,X2)))
      | ~ theorem(or(X0,X1)) ),
    inference(resolution,[],[f276,f274]) ).

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

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

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

fof(f367,plain,
    ! [X2,X0,X1] : theorem(or(not(or(or(X0,X1),X2)),or(X0,or(X2,X1)))),
    inference(resolution,[],[f273,f179]) ).

fof(f378,plain,
    ! [X2,X3,X0,X1] :
      ( ~ theorem(or(not(or(X0,X1)),X2))
      | theorem(or(X3,X2))
      | ~ theorem(or(X0,or(X3,X1))) ),
    inference(resolution,[],[f295,f16]) ).

fof(f406,plain,
    ! [X0] :
      ( ~ theorem(or(X0,sF6))
      | theorem(or(X0,sF11)) ),
    inference(superposition,[],[f308,f41]) ).

fof(f410,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(not(X0),X1))
      | theorem(or(X2,X1))
      | ~ theorem(or(X0,X2)) ),
    inference(resolution,[],[f296,f16]) ).

fof(f414,plain,
    ! [X0,X1] :
      ( theorem(or(not(or(X0,X1)),X1))
      | ~ theorem(or(not(X0),X1)) ),
    inference(resolution,[],[f296,f317]) ).

fof(f437,plain,
    ! [X0] : theorem(or(X0,not(X0))),
    inference(resolution,[],[f326,f193]) ).

fof(f552,plain,
    theorem(or(not(sF0),sF4)),
    inference(superposition,[],[f288,f27]) ).

fof(f553,plain,
    theorem(or(not(sF1),sF10)),
    inference(superposition,[],[f288,f39]) ).

fof(f562,plain,
    ! [X0] :
      ( theorem(or(X0,not(sF5)))
      | ~ theorem(or(X0,sF4)) ),
    inference(resolution,[],[f281,f437]) ).

fof(f563,plain,
    ! [X0] :
      ( ~ theorem(or(X0,sF4))
      | theorem(or(X0,sF6)) ),
    inference(forward_demodulation,[],[f562,f31]) ).

fof(f641,plain,
    theorem(or(not(or(sF1,or(sF6,sF9))),sF11)),
    inference(superposition,[],[f146,f41]) ).

fof(f645,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(X0,or(X2,X1)))
      | theorem(or(X2,X1))
      | ~ theorem(or(not(X0),X1)) ),
    inference(resolution,[],[f414,f378]) ).

fof(f728,plain,
    ! [X0] :
      ( ~ theorem(or(X0,or(sF1,or(sF6,sF9))))
      | theorem(or(X0,sF11)) ),
    inference(resolution,[],[f641,f255]) ).

fof(f734,plain,
    ! [X0] :
      ( ~ theorem(or(X0,or(sF6,sF9)))
      | theorem(or(X0,sF11)) ),
    inference(resolution,[],[f728,f276]) ).

fof(f778,plain,
    theorem(or(not(sF9),sF11)),
    inference(resolution,[],[f734,f208]) ).

fof(f790,plain,
    ! [X0] :
      ( ~ theorem(or(sF9,X0))
      | theorem(or(X0,sF11)) ),
    inference(resolution,[],[f778,f410]) ).

fof(f883,plain,
    theorem(or(or(sF0,sF7),sF11)),
    inference(resolution,[],[f790,f205]) ).

fof(f1111,plain,
    theorem(or(not(sF3),sF6)),
    inference(resolution,[],[f231,f563]) ).

fof(f1117,plain,
    theorem(or(not(sF3),sF11)),
    inference(resolution,[],[f1111,f406]) ).

fof(f1119,plain,
    ! [X0] :
      ( ~ theorem(or(sF3,X0))
      | theorem(or(X0,sF11)) ),
    inference(resolution,[],[f1117,f410]) ).

fof(f1129,plain,
    theorem(or(or(q,sF1),sF11)),
    inference(resolution,[],[f1119,f206]) ).

fof(f1231,plain,
    theorem(or(not(sF0),sF6)),
    inference(resolution,[],[f552,f563]) ).

fof(f1236,plain,
    theorem(or(not(sF0),sF11)),
    inference(resolution,[],[f1231,f406]) ).

fof(f1285,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(or(X0,X2),X1))
      | theorem(or(X0,or(X1,X2))) ),
    inference(resolution,[],[f367,f16]) ).

fof(f2238,plain,
    ! [X0] :
      ( ~ theorem(or(X0,sF11))
      | theorem(sF11)
      | ~ theorem(or(not(X0),sF10)) ),
    inference(superposition,[],[f645,f41]) ).

fof(f2241,plain,
    ! [X0] :
      ( ~ theorem(or(not(X0),sF10))
      | ~ theorem(or(X0,sF11)) ),
    inference(forward_subsumption_resolution,[],[f2238,f42]) ).

fof(f2253,plain,
    ~ theorem(or(sF1,sF11)),
    inference(resolution,[],[f2241,f553]) ).

fof(f2448,plain,
    theorem(or(sF0,or(sF11,sF7))),
    inference(resolution,[],[f1285,f883]) ).

fof(f2449,plain,
    theorem(or(q,or(sF11,sF1))),
    inference(resolution,[],[f1285,f1129]) ).

fof(f2458,plain,
    theorem(or(sF0,or(sF7,sF11))),
    inference(resolution,[],[f2448,f274]) ).

fof(f2475,plain,
    ( theorem(or(sF7,sF11))
    | ~ theorem(or(not(sF0),sF11)) ),
    inference(resolution,[],[f2458,f645]) ).

fof(f2478,plain,
    theorem(or(sF7,sF11)),
    inference(forward_subsumption_resolution,[],[f2475,f1236]) ).

fof(f2492,plain,
    theorem(or(q,or(sF1,sF11))),
    inference(resolution,[],[f2449,f274]) ).

fof(f2509,plain,
    ( theorem(or(sF1,sF11))
    | ~ theorem(or(not(q),sF11)) ),
    inference(resolution,[],[f2492,f645]) ).

fof(f2512,plain,
    ~ theorem(or(not(q),sF11)),
    inference(forward_subsumption_resolution,[],[f2509,f2253]) ).

fof(f2513,plain,
    ~ theorem(or(sF7,sF11)),
    inference(forward_demodulation,[],[f2512,f33]) ).

fof(f2514,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f2513,f2478]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL332-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.17/5.46  % Computer : n008.cluster.edu
% 0.17/5.46  % Model    : x86_64 x86_64
% 0.17/5.46  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/5.46  % Memory   : 8046.5625MB
% 0.17/5.46  % OS       : Linux 6.8.0-71-generic
% 0.17/5.46  % CPULimit : 300
% 0.17/5.46  % WCLimit  : 300
% 0.17/5.46  % DateTime : Sun Sep 27 15:36:00 UTC 2026
% 0.17/5.47  % CPUTime  : 
% 0.17/5.47  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/5.52  Running first-order theorem proving
% 0.23/5.52  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
% 13.67/8.22  % (1394429)Input is clausal, will run a generic CNF schedule.
% 13.67/8.22  % (1394436)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=1142199414:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 13.67/8.22  % (1394439)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=4240231133:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 13.67/8.22  % (1394435)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=2659587754:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 13.67/8.22  % (1394434)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=1456357384:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 13.67/8.22  % (1394437)lrs+10_1_sil=8000:sp=occurrence:random_seed=758390048:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 13.67/8.22  % (1394438)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=3006498703:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 13.67/8.22  % (1394440)dis-21_1_sil=8000:lcm=predicate:random_seed=2007567090: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)
% 13.67/8.22  % (1394440)Instruction limit reached! 
% 13.67/8.22  % (1394440)------------------------------
% 13.67/8.22  % (1394440)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.67/8.22  % (1394440)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.67/8.22  % (1394440)CaDiCaL version: 2.1.3
% 13.67/8.22  % (1394440)Termination reason: Instruction limit
% 13.67/8.22  % (1394440)Termination phase: Saturation
% 13.67/8.22  % (1394440)Time elapsed: 0.098 s
% 13.67/8.22  % (1394440)Peak memory usage: 87 MB
% 13.67/8.22  % (1394440)Instructions burned: 118 (million)
% 13.67/8.22  % (1394437)Instruction limit reached! 
% 13.67/8.22  % (1394437)------------------------------
% 13.67/8.22  % (1394437)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.67/8.22  % (1394437)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.67/8.22  % (1394437)CaDiCaL version: 2.1.3
% 13.67/8.22  % (1394437)Termination reason: Instruction limit
% 13.67/8.22  % (1394437)Termination phase: Saturation
% 13.67/8.22  % (1394437)Time elapsed: 0.114 s
% 13.67/8.22  % (1394437)Peak memory usage: 89 MB
% 13.67/8.22  % (1394437)Instructions burned: 107 (million)
% 13.67/8.22  % (1394438)Instruction limit reached! 
% 13.67/8.22  % (1394438)------------------------------
% 13.67/8.22  % (1394438)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.67/8.22  % (1394438)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.67/8.22  % (1394438)CaDiCaL version: 2.1.3
% 13.67/8.22  % (1394438)Termination reason: Instruction limit
% 13.67/8.22  % (1394438)Termination phase: Saturation
% 13.67/8.22  % (1394438)Time elapsed: 0.118 s
% 13.67/8.22  % (1394438)Peak memory usage: 89 MB
% 13.67/8.22  % (1394438)Instructions burned: 115 (million)
% 13.67/8.22  % (1394439)Instruction limit reached! 
% 13.67/8.22  % (1394439)------------------------------
% 13.67/8.22  % (1394439)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.67/8.22  % (1394439)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.67/8.22  % (1394439)CaDiCaL version: 2.1.3
% 13.67/8.22  % (1394439)Termination reason: Instruction limit
% 13.67/8.22  % (1394439)Termination phase: Saturation
% 13.67/8.22  % (1394439)Time elapsed: 0.172 s
% 13.67/8.22  % (1394439)Peak memory usage: 89 MB
% 13.67/8.22  % (1394439)Instructions burned: 180 (million)
% 13.67/8.22  % (1394450)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=1037308346:i=143:sd=2:aac=none:ss=axioms:sgt=16_2996 on theBenchmark for (2996ds/143Mi)
% 13.67/8.22  % (1394450)Refutation not found, incomplete strategy
% 13.67/8.22  % (1394450)------------------------------
% 13.67/8.22  % (1394450)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.67/8.22  % (1394450)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.67/8.22  % (1394450)CaDiCaL version: 2.1.3
% 13.67/8.22  % (1394450)Termination reason: Refutation not found, incomplete strategy
% 13.67/8.22  % (1394450)Time elapsed: 0.002 s
% 13.67/8.22  % (1394450)Peak memory usage: 88 MB
% 13.67/8.22  % (1394451)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=2362011905:st=3:avsq=on:s2a=on:i=189:s2at=1.2:avsqr=1,16:sd=2:bd=all:nm=64:ss=axioms:sgt=30_2996 on theBenchmark for (2996ds/189Mi)
% 13.67/8.22  % (1394452)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=2950361896:st=4:i=219:sd=3:ss=axioms_2995 on theBenchmark for (2995ds/219Mi)
% 13.67/8.22  % (1394451)Refutation not found, incomplete strategy
% 13.67/8.22  % (1394451)------------------------------
% 13.67/8.22  % (1394451)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.67/8.22  % (1394451)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.67/8.22  % (1394451)CaDiCaL version: 2.1.3
% 13.67/8.22  % (1394451)Termination reason: Refutation not found, incomplete strategy
% 13.67/8.22  % (1394451)Time elapsed: 0.002 s
% 13.67/8.22  % (1394451)Peak memory usage: 87 MB
% 13.67/8.22  % (1394452)Refutation not found, incomplete strategy
% 13.67/8.22  % (1394452)------------------------------
% 13.67/8.22  % (1394452)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.67/8.22  % (1394452)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.67/8.22  % (1394452)CaDiCaL version: 2.1.3
% 13.67/8.22  % (1394452)Termination reason: Refutation not found, incomplete strategy
% 13.67/8.22  % (1394452)Time elapsed: 0.002 s
% 13.67/8.22  % (1394452)Peak memory usage: 88 MB
% 13.67/8.22  % (1394452)Instructions burned: 1 (million)
% 13.67/8.22  % (1394453)lrs+10_64_to=lpo:sil=8000:random_seed=3752679336:i=126:bd=preordered_2995 on theBenchmark for (2995ds/126Mi)
% 13.67/8.22  % (1394453)Instruction limit reached! 
% 13.67/8.22  % (1394453)------------------------------
% 13.67/8.22  % (1394453)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.67/8.22  % (1394453)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.67/8.22  % (1394453)CaDiCaL version: 2.1.3
% 13.67/8.22  % (1394453)Termination reason: Instruction limit
% 13.67/8.22  % (1394453)Termination phase: Saturation
% 13.67/8.22  % (1394453)Time elapsed: 0.115 s
% 13.67/8.22  % (1394453)Peak memory usage: 89 MB
% 13.67/8.22  % (1394453)Instructions burned: 127 (million)
% 13.67/8.22  % (1394450)------------------------------
% 13.67/8.22  % (1394450)------------------------------
% 13.67/8.22  % (1394452)------------------------------
% 13.67/8.22  % (1394452)------------------------------
% 13.67/8.22  % (1394451)------------------------------
% 13.67/8.22  % (1394451)------------------------------
% 13.67/8.22  % (1394458)lrs+1011_16_to=lpo:sil=8000:drc=off:sp=reverse_frequency:spb=goal_then_units:random_seed=2223012655:avsq=on:i=194:fgj=on:bd=preordered_2991 on theBenchmark for (2991ds/194Mi)
% 13.67/8.22  % (1394458)Instruction limit reached! 
% 13.67/8.22  % (1394458)------------------------------
% 13.67/8.22  % (1394458)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.67/8.22  % (1394458)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.67/8.22  % (1394458)CaDiCaL version: 2.1.3
% 13.67/8.22  % (1394458)Termination reason: Instruction limit
% 13.67/8.22  % (1394458)Termination phase: Saturation
% 13.67/8.22  % (1394458)Time elapsed: 0.196 s
% 13.67/8.22  % (1394458)Peak memory usage: 90 MB
% 13.67/8.22  % (1394458)Instructions burned: 194 (million)
% 13.67/8.22  % (1394459)lrs+10_1_sil=8000:tgt=full:acc=on:random_seed=450437474:i=157:gtg=all_2989 on theBenchmark for (2989ds/157Mi)
% 13.67/8.22  % (1394461)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=2143451832:cts=off:s2a=on:i=106:fsr=off:gsp=on:ss=axioms:sgt=16:rawr=on_2988 on theBenchmark for (2988ds/106Mi)
% 13.67/8.22  % (1394460)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:random_seed=4215186067:i=3394:sd=4:ss=included:sgt=64_2989 on theBenchmark for (2989ds/3394Mi)
% 13.67/8.22  % (1394461)Instruction limit reached! 
% 13.67/8.22  % (1394461)------------------------------
% 13.67/8.22  % (1394461)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.67/8.22  % (1394461)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.67/8.22  % (1394461)CaDiCaL version: 2.1.3
% 13.67/8.22  % (1394461)Termination reason: Instruction limit
% 13.67/8.22  % (1394461)Termination phase: Saturation
% 13.67/8.22  % (1394461)Time elapsed: 0.097 s
% 13.67/8.22  % (1394461)Peak memory usage: 88 MB
% 13.67/8.22  % (1394461)Instructions burned: 106 (million)
% 13.67/8.22  % (1394459)Instruction limit reached! 
% 13.67/8.22  % (1394459)------------------------------
% 13.67/8.22  % (1394459)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.67/8.22  % (1394459)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.67/8.22  % (1394459)CaDiCaL version: 2.1.3
% 13.67/8.22  % (1394459)Termination reason: Instruction limit
% 13.67/8.22  % (1394459)Termination phase: Saturation
% 13.67/8.22  % (1394459)Time elapsed: 0.173 s
% 13.67/8.22  % (1394459)Peak memory usage: 91 MB
% 13.67/8.22  % (1394459)Instructions burned: 157 (million)
% 13.67/8.22  % (1394463)lrs+2_4096_sil=8000:plsq=on:plsqr=12672147,131072:sos=on:spb=goal:lcm=predicate:random_seed=3428277213:i=107_2986 on theBenchmark for (2986ds/107Mi)
% 13.67/8.22  % (1394463)Refutation not found, incomplete strategy
% 13.67/8.22  % (1394463)------------------------------
% 13.67/8.22  % (1394463)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.67/8.22  % (1394463)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.67/8.22  % (1394463)CaDiCaL version: 2.1.3
% 13.67/8.22  % (1394463)Termination reason: Refutation not found, incomplete strategy
% 13.67/8.22  % (1394463)Time elapsed: 0.002 s
% 13.67/8.22  % (1394463)Peak memory usage: 87 MB
% 13.67/8.22  % (1394467)lrs+1011_20_sil=64000:tgt=ground:plsq=on:fde=unused:plsqc=1:plsqr=14,1:plsql=on:nwc=0.6:random_seed=3013940483:st=6:i=242:gtgl=5:kws=arity_squared:av=off:gtg=exists_sym:ss=included_2985 on theBenchmark for (2985ds/242Mi)
% 13.67/8.22  % (1394468)lrs+1010_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:tgt=ground:npcc=on:sims=off:random_seed=1239526529:cond=fast:i=5208:av=off_2984 on theBenchmark for (2984ds/5208Mi)
% 13.67/8.22  % (1394434)First to succeed.
% 13.67/8.22  % (1394434)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1394429"
% 13.67/8.22  % (1394463)------------------------------
% 13.67/8.22  % (1394463)------------------------------
% 13.67/8.22  % (1394467)Instruction limit reached! 
% 13.67/8.22  % (1394467)------------------------------
% 13.67/8.22  % (1394467)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.67/8.22  % (1394467)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.67/8.22  % (1394467)CaDiCaL version: 2.1.3
% 13.67/8.22  % (1394467)Termination reason: Instruction limit
% 13.67/8.22  % (1394467)Termination phase: Saturation
% 13.67/8.22  % (1394467)Time elapsed: 0.256 s
% 13.67/8.22  % (1394467)Peak memory usage: 90 MB
% 13.67/8.22  % (1394467)Instructions burned: 244 (million)
% 13.67/8.22  % (1394434)Refutation found. Thanks to Tanya!
% 13.67/8.22  % SZS status Unsatisfiable for theBenchmark
% 13.67/8.22  % SZS output start Proof for theBenchmark
% See solution above
% 16.57/8.56  % (1394434)------------------------------
% 16.57/8.56  % (1394434)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 16.57/8.56  % (1394434)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 16.57/8.56  % (1394434)CaDiCaL version: 2.1.3
% 16.57/8.56  % (1394434)Termination reason: Refutation
% 16.57/8.56  % (1394434)Time elapsed: 1.632 s
% 16.57/8.56  % (1394434)Peak memory usage: 134 MB
% 16.57/8.56  % (1394434)Instructions burned: 1523 (million)
% 16.57/8.56  % (1394434)------------------------------
% 16.57/8.56  % (1394434)------------------------------
% 16.57/8.56  % (1394429)Success in time 2.215 s
% 16.57/8.56  % Vampire exiting
%------------------------------------------------------------------------------