↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : LAT393-1 : TPTP v9.3.1. Released v5.4.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:47:35 AM UTC 2026

% Result   : Unsatisfiable 11.24s 2.44s
% Output   : Refutation 11.71s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   35
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   82 (  82 unt;   6 def)
%            Number of atoms       :   82 (  81 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    2 (   2   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 avg)
%            Maximal term depth    :    8 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   9 con; 0-2 aty)
%            Number of variables   :   72 (  72   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X2,X3,X0,X1] : f(f(f(f(X0,X1),f(X1,X2)),X3),f(X1,f(f(X1,f(f(X0,X0),X0)),X2))) = X1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos) ).

fof(f6,negated_conjecture,
    f(x0,f(f(x1,x2),f(x1,x2))) != f(x1,f(f(x0,x2),f(x0,x2))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

fof(f7,definition,
    sF0 = f(x1,x2),
    introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).

fof(f8,plain,
    f(x1,x2) = sF0,
    inference(reorient_equations,[],[f7]) ).

fof(f9,definition,
    sF1 = f(sF0,sF0),
    introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).

fof(f10,plain,
    f(sF0,sF0) = sF1,
    inference(reorient_equations,[],[f9]) ).

fof(f11,definition,
    sF2 = f(x0,sF1),
    introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).

fof(f12,plain,
    f(x0,sF1) = sF2,
    inference(reorient_equations,[],[f11]) ).

fof(f13,definition,
    sF3 = f(x0,x2),
    introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).

fof(f14,plain,
    f(x0,x2) = sF3,
    inference(reorient_equations,[],[f13]) ).

fof(f15,definition,
    sF4 = f(sF3,sF3),
    introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).

fof(f16,plain,
    f(sF3,sF3) = sF4,
    inference(reorient_equations,[],[f15]) ).

fof(f17,definition,
    sF5 = f(x1,sF4),
    introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).

fof(f18,plain,
    f(x1,sF4) = sF5,
    inference(reorient_equations,[],[f17]) ).

fof(f19,plain,
    sF2 != sF5,
    inference(definition_folding,[],[f6,f18,f16,f14,f14,f12,f10,f8,f8]) ).

fof(f23,plain,
    ! [X2,X3,X0,X1] : f(X0,X2) = f(X0,f(f(X0,X2),f(f(f(X0,X2),f(f(f(X1,X0),f(X1,X0)),f(X1,X0))),X3))),
    inference(superposition,[],[f1,f1]) ).

fof(f55,plain,
    ! [X2,X0,X1] : f(f(X1,X0),f(X0,X2)) = f(f(X1,X0),f(f(f(X1,X0),f(X0,X2)),X0)),
    inference(superposition,[],[f23,f1]) ).

fof(f83,plain,
    ! [X2,X0,X1] : f(f(f(f(X1,X0),f(X0,X2)),X0),f(X0,X0)) = X0,
    inference(superposition,[],[f55,f1]) ).

fof(f114,plain,
    ! [X0] : f(f(X0,X0),f(X0,X0)) = X0,
    inference(superposition,[],[f83,f83]) ).

fof(f127,plain,
    sF0 = f(sF1,sF1),
    inference(superposition,[],[f114,f10]) ).

fof(f128,plain,
    sF3 = f(sF4,sF4),
    inference(superposition,[],[f114,f16]) ).

fof(f131,plain,
    ! [X0,X1] : f(f(X0,X1),f(X0,f(f(X0,f(f(X0,X0),X0)),X0))) = X0,
    inference(superposition,[],[f1,f114]) ).

fof(f246,plain,
    x0 = f(sF3,f(x0,f(f(x0,f(f(x0,x0),x0)),x0))),
    inference(superposition,[],[f131,f14]) ).

fof(f248,plain,
    x1 = f(sF0,f(x1,f(f(x1,f(f(x1,x1),x1)),x1))),
    inference(superposition,[],[f131,f8]) ).

fof(f268,plain,
    ! [X0,X1] : f(X0,X1) = f(X0,f(f(X0,X1),f(X0,X1))),
    inference(superposition,[],[f23,f131]) ).

fof(f281,plain,
    ! [X0] : f(X0,X0) = f(X0,f(f(X0,f(f(X0,X0),X0)),X0)),
    inference(superposition,[],[f114,f131]) ).

fof(f287,plain,
    ! [X0,X1] : f(f(X0,X1),f(X0,X0)) = X0,
    inference(backward_demodulation,[],[f131,f281]) ).

fof(f298,plain,
    x1 = f(sF0,f(x1,x1)),
    inference(forward_demodulation,[],[f248,f281]) ).

fof(f300,plain,
    x0 = f(sF3,f(x0,x0)),
    inference(forward_demodulation,[],[f246,f281]) ).

fof(f337,plain,
    ! [X0,X1] : f(X0,X0) = f(f(f(X0,X0),X1),X0),
    inference(superposition,[],[f287,f287]) ).

fof(f440,plain,
    ! [X0,X1] : f(f(X0,X0),f(X0,X0)) = f(f(X0,X0),f(X0,X1)),
    inference(superposition,[],[f55,f337]) ).

fof(f471,plain,
    ! [X0,X1] : f(f(X0,X0),f(X0,X1)) = X0,
    inference(forward_demodulation,[],[f440,f287]) ).

fof(f500,plain,
    ! [X0,X1] : f(X0,X1) = f(f(f(X0,X1),f(X0,X1)),X0),
    inference(superposition,[],[f471,f287]) ).

fof(f504,plain,
    x0 = f(f(x0,x0),sF2),
    inference(superposition,[],[f471,f12]) ).

fof(f506,plain,
    x1 = f(f(x1,x1),sF5),
    inference(superposition,[],[f471,f18]) ).

fof(f661,plain,
    ! [X2,X3,X0,X1] : f(f(f(f(X1,X0),f(X0,X2)),X3),f(X0,X0)) = X0,
    inference(superposition,[],[f268,f1]) ).

fof(f740,plain,
    ! [X0,X1] : f(f(X0,X1),f(X1,X1)) = X1,
    inference(superposition,[],[f661,f287]) ).

fof(f793,plain,
    x2 = f(sF3,f(x2,x2)),
    inference(superposition,[],[f740,f14]) ).

fof(f795,plain,
    x2 = f(sF0,f(x2,x2)),
    inference(superposition,[],[f740,f8]) ).

fof(f804,plain,
    ! [X0,X1] : f(X0,X0) = f(f(X1,f(X0,X0)),X0),
    inference(superposition,[],[f740,f471]) ).

fof(f891,plain,
    ! [X0,X1] : f(f(X0,X0),f(X1,X0)) = X0,
    inference(superposition,[],[f500,f740]) ).

fof(f895,plain,
    ! [X0,X1] : f(X0,X0) = f(f(f(X0,X0),f(X0,X0)),f(X1,f(X0,X0))),
    inference(superposition,[],[f500,f804]) ).

fof(f928,plain,
    ! [X0,X1] : f(X0,X0) = f(X0,f(X1,f(X0,X0))),
    inference(forward_demodulation,[],[f895,f287]) ).

fof(f954,plain,
    sF1 = f(f(sF1,sF1),sF2),
    inference(superposition,[],[f891,f12]) ).

fof(f956,plain,
    sF4 = f(f(sF4,sF4),sF5),
    inference(superposition,[],[f891,f18]) ).

fof(f994,plain,
    sF4 = f(sF3,sF5),
    inference(forward_demodulation,[],[f956,f128]) ).

fof(f995,plain,
    sF1 = f(sF0,sF2),
    inference(forward_demodulation,[],[f954,f127]) ).

fof(f1199,plain,
    ! [X0,X1] : sF2 = f(f(f(sF1,f(sF2,X0)),X1),f(sF2,sF2)),
    inference(superposition,[],[f661,f995]) ).

fof(f1214,plain,
    ! [X0] : sF2 = f(f(f(sF1,sF1),X0),f(sF2,sF2)),
    inference(superposition,[],[f1199,f928]) ).

fof(f1247,plain,
    ! [X0] : sF2 = f(f(sF0,X0),f(sF2,sF2)),
    inference(forward_demodulation,[],[f1214,f127]) ).

fof(f1252,plain,
    sF2 = f(x1,f(sF2,sF2)),
    inference(superposition,[],[f1247,f298]) ).

fof(f1289,plain,
    x1 = f(f(x1,x1),sF2),
    inference(superposition,[],[f471,f1252]) ).

fof(f1304,plain,
    ! [X0,X1] : sF2 = f(f(f(x1,f(sF2,X0)),X1),f(sF2,sF2)),
    inference(superposition,[],[f661,f1289]) ).

fof(f1367,plain,
    sF2 = f(x2,f(sF2,sF2)),
    inference(superposition,[],[f1247,f795]) ).

fof(f1425,plain,
    x2 = f(sF2,f(x2,x2)),
    inference(superposition,[],[f287,f1367]) ).

fof(f1581,plain,
    ! [X0,X1] : sF5 = f(f(f(sF4,f(sF5,X0)),X1),f(sF5,sF5)),
    inference(superposition,[],[f661,f994]) ).

fof(f1596,plain,
    ! [X0] : sF5 = f(f(f(sF4,sF4),X0),f(sF5,sF5)),
    inference(superposition,[],[f1581,f928]) ).

fof(f1629,plain,
    ! [X0] : sF5 = f(f(sF3,X0),f(sF5,sF5)),
    inference(forward_demodulation,[],[f1596,f128]) ).

fof(f1634,plain,
    sF5 = f(x0,f(sF5,sF5)),
    inference(superposition,[],[f1629,f300]) ).

fof(f1635,plain,
    sF5 = f(x2,f(sF5,sF5)),
    inference(superposition,[],[f1629,f793]) ).

fof(f1672,plain,
    x0 = f(f(x0,x0),sF5),
    inference(superposition,[],[f471,f1634]) ).

fof(f1687,plain,
    ! [X0,X1] : sF5 = f(f(f(x0,f(sF5,X0)),X1),f(sF5,sF5)),
    inference(superposition,[],[f661,f1672]) ).

fof(f1755,plain,
    x2 = f(sF5,f(x2,x2)),
    inference(superposition,[],[f287,f1635]) ).

fof(f2012,plain,
    ! [X0,X1] : sF2 = f(f(f(x0,f(sF2,X0)),X1),f(sF2,sF2)),
    inference(superposition,[],[f661,f504]) ).

fof(f2021,plain,
    ! [X0] : sF2 = f(f(f(x0,x2),X0),f(sF2,sF2)),
    inference(superposition,[],[f2012,f1425]) ).

fof(f2062,plain,
    ! [X0] : sF2 = f(f(sF3,X0),f(sF2,sF2)),
    inference(forward_demodulation,[],[f2021,f14]) ).

fof(f2079,plain,
    f(sF3,sF3) = f(sF2,sF3),
    inference(superposition,[],[f337,f2062]) ).

fof(f2096,plain,
    sF4 = f(sF2,sF3),
    inference(forward_demodulation,[],[f2079,f16]) ).

fof(f2101,plain,
    ! [X0] : sF2 = f(f(f(x1,sF4),X0),f(sF2,sF2)),
    inference(superposition,[],[f1304,f2096]) ).

fof(f2121,plain,
    ! [X0] : sF2 = f(f(sF5,X0),f(sF2,sF2)),
    inference(forward_demodulation,[],[f2101,f18]) ).

fof(f2138,plain,
    f(sF5,sF5) = f(sF2,sF5),
    inference(superposition,[],[f337,f2121]) ).

fof(f2177,plain,
    ! [X0,X1] : sF5 = f(f(f(x0,f(sF5,X0)),X1),f(sF2,sF5)),
    inference(backward_demodulation,[],[f1687,f2138]) ).

fof(f2896,plain,
    ! [X0,X1] : sF5 = f(f(f(x1,f(sF5,X0)),X1),f(sF5,sF5)),
    inference(superposition,[],[f661,f506]) ).

fof(f2904,plain,
    ! [X0,X1] : sF5 = f(f(f(x1,f(sF5,X0)),X1),f(sF2,sF5)),
    inference(forward_demodulation,[],[f2896,f2138]) ).

fof(f2908,plain,
    ! [X0] : sF5 = f(f(f(x1,x2),X0),f(sF2,sF5)),
    inference(superposition,[],[f2904,f1755]) ).

fof(f2957,plain,
    ! [X0] : sF5 = f(f(sF0,X0),f(sF2,sF5)),
    inference(forward_demodulation,[],[f2908,f8]) ).

fof(f2973,plain,
    f(sF0,sF0) = f(sF5,sF0),
    inference(superposition,[],[f337,f2957]) ).

fof(f2993,plain,
    sF1 = f(sF5,sF0),
    inference(forward_demodulation,[],[f2973,f10]) ).

fof(f3001,plain,
    ! [X0] : sF5 = f(f(f(x0,sF1),X0),f(sF2,sF5)),
    inference(superposition,[],[f2177,f2993]) ).

fof(f3025,plain,
    ! [X0] : sF5 = f(f(sF2,X0),f(sF2,sF5)),
    inference(forward_demodulation,[],[f3001,f12]) ).

fof(f3046,plain,
    sF2 = sF5,
    inference(superposition,[],[f471,f3025]) ).

fof(f3188,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f3046,f19]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LAT393-1 : TPTP v9.3.1. Released v5.4.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.39  % Computer : n010.cluster.edu
% 0.12/0.39  % Model    : x86_64 x86_64
% 0.12/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39  % Memory   : 8046.5625MB
% 0.12/0.39  % OS       : Linux 6.8.0-71-generic
% 0.12/0.39  % CPULimit : 300
% 0.12/0.39  % WCLimit  : 300
% 0.12/0.39  % DateTime : Sun Sep 27 15:14:46 UTC 2026
% 0.12/0.39  % CPUTime  : 
% 0.12/0.39  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.42  Running first-order theorem proving
% 0.12/0.42  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.24/2.44  % (1075075)Detected a unit-equality problem, will run specialized UEQ schedule.
% 11.24/2.44  % (1075084)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=2556332642:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 11.24/2.44  % (1075086)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=1647316769:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 11.24/2.44  % (1075083)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=1346339207:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 11.24/2.44  % (1075081)lrs+11_1_ncem=casc2026/models/loop6.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=4286930901:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 11.24/2.44  % (1075085)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=1264983900:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 11.24/2.44  % (1075082)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=3843150904:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 11.24/2.44  % (1075080)lrs+1002_1_ncem=casc2026/models/loop7.pt:sil=128000:tgt=ground:npcc=on:drc=off:sp=reverse_frequency:spb=goal:acc=on:s2agt=16:kmz=on:sac=on:random_seed=158972773:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 11.24/2.44  % (1075084)Instruction limit reached! 
% 11.24/2.44  % (1075084)------------------------------
% 11.24/2.44  % (1075084)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.24/2.44  % (1075084)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.24/2.44  % (1075084)CaDiCaL version: 2.1.3
% 11.24/2.44  % (1075084)Termination reason: Instruction limit
% 11.24/2.44  % (1075084)Termination phase: Saturation
% 11.24/2.44  % (1075084)Time elapsed: 0.053 s
% 11.24/2.44  % (1075084)Peak memory usage: 90 MB
% 11.24/2.44  % (1075084)Instructions burned: 182 (million)
% 11.24/2.44  % (1075083)Instruction limit reached! 
% 11.24/2.44  % (1075083)------------------------------
% 11.24/2.44  % (1075083)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.24/2.44  % (1075083)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.24/2.44  % (1075083)CaDiCaL version: 2.1.3
% 11.24/2.44  % (1075083)Termination reason: Instruction limit
% 11.24/2.44  % (1075083)Termination phase: Saturation
% 11.24/2.44  % (1075083)Time elapsed: 0.079 s
% 11.24/2.44  % (1075083)Peak memory usage: 89 MB
% 11.24/2.44  % (1075083)Instructions burned: 137 (million)
% 11.24/2.44  % (1075085)Instruction limit reached! 
% 11.24/2.44  % (1075085)------------------------------
% 11.24/2.44  % (1075085)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.24/2.44  % (1075085)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.24/2.44  % (1075085)CaDiCaL version: 2.1.3
% 11.24/2.44  % (1075085)Termination reason: Instruction limit
% 11.24/2.44  % (1075085)Termination phase: Saturation
% 11.24/2.44  % (1075085)Time elapsed: 0.154 s
% 11.24/2.44  % (1075085)Peak memory usage: 89 MB
% 11.24/2.44  % (1075085)Instructions burned: 257 (million)
% 11.24/2.44  % (1075094)lrs-1011_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:prc=on:fde=unused:lcm=predicate:bsr=on:flr=on:random_seed=2488661048:i=2051:gtgl=2:fgj=on:bd=all:gtg=exists_top_2998 on theBenchmark for (2998ds/2051Mi)
% 11.24/2.44  % (1075095)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=3577053467:i=4948:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/4948Mi)
% 11.24/2.44  % (1075097)lrs+10_5:1_sil=8000:sos=all:urr=on:br=off:flr=on:random_seed=355032063:i=215:ep=RSTC_2996 on theBenchmark for (2996ds/215Mi)
% 11.24/2.44  % (1075097)Instruction limit reached! 
% 11.24/2.44  % (1075097)------------------------------
% 11.24/2.44  % (1075097)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.24/2.44  % (1075097)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.24/2.44  % (1075097)CaDiCaL version: 2.1.3
% 11.24/2.44  % (1075097)Termination reason: Instruction limit
% 11.24/2.44  % (1075097)Termination phase: Saturation
% 11.24/2.44  % (1075097)Time elapsed: 0.104 s
% 11.24/2.44  % (1075097)Peak memory usage: 105 MB
% 11.24/2.44  % (1075097)Instructions burned: 215 (million)
% 11.24/2.44  % (1075100)lrs+11_1_sil=16000:tgt=full:fde=none:sp=reverse_frequency:lma=off:fs=off:acc=on:bsr=unit_only:rp=on:random_seed=3078765185:avsq=on:i=317:avsqr=1,16:kws=arity_squared:add=off:fgj=on:ins=10:fsr=off:gtg=exists_sym_2994 on theBenchmark for (2994ds/317Mi)
% 11.24/2.44  % (1075086)Instruction limit reached! 
% 11.24/2.44  % (1075086)------------------------------
% 11.24/2.44  % (1075086)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.24/2.44  % (1075086)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.24/2.44  % (1075086)CaDiCaL version: 2.1.3
% 11.24/2.44  % (1075086)Termination reason: Instruction limit
% 11.24/2.44  % (1075086)Termination phase: Saturation
% 11.24/2.44  % (1075086)Time elapsed: 0.663 s
% 11.24/2.44  % (1075086)Peak memory usage: 97 MB
% 11.24/2.44  % (1075086)Instructions burned: 1188 (million)
% 11.24/2.44  % (1075100)Instruction limit reached! 
% 11.24/2.44  % (1075100)------------------------------
% 11.24/2.44  % (1075100)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.24/2.44  % (1075100)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.24/2.44  % (1075100)CaDiCaL version: 2.1.3
% 11.24/2.44  % (1075100)Termination reason: Instruction limit
% 11.24/2.44  % (1075100)Termination phase: Saturation
% 11.24/2.44  % (1075100)Time elapsed: 0.184 s
% 11.24/2.44  % (1075100)Peak memory usage: 94 MB
% 11.24/2.44  % (1075100)Instructions burned: 318 (million)
% 11.24/2.44  % (1075102)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=64000:tgt=full:npcc=on:sp=arity:lcm=predicate:urr=on:s2agt=16:br=off:random_seed=3695566144:i=12125:sd=2:fgj=on:ss=axioms:sgt=64_2991 on theBenchmark for (2991ds/12125Mi)
% 11.24/2.44  % (1075094)Instruction limit reached! 
% 11.24/2.44  % (1075094)------------------------------
% 11.24/2.44  % (1075094)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.24/2.44  % (1075094)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.24/2.44  % (1075094)CaDiCaL version: 2.1.3
% 11.24/2.44  % (1075094)Termination reason: Instruction limit
% 11.24/2.44  % (1075094)Termination phase: Saturation
% 11.24/2.44  % (1075094)Time elapsed: 0.723 s
% 11.24/2.44  % (1075094)Peak memory usage: 138 MB
% 11.24/2.44  % (1075094)Instructions burned: 2053 (million)
% 11.24/2.44  % (1075103)lrs+10_32_sil=8000:tgt=ground:prc=on:sp=reverse_arity:spb=non_intro:random_seed=1966838474:i=2836:kws=inv_precedence:fgj=on:bd=preordered:ins=10_2990 on theBenchmark for (2990ds/2836Mi)
% 11.24/2.44  % (1075105)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:lma=off:kmz=on:random_seed=1096508237:i=14534:kws=arity:fgj=on:bd=preordered:ins=6:ss=axioms:sgt=30_2989 on theBenchmark for (2989ds/14534Mi)
% 11.24/2.44  % (1075082)First to succeed.
% 11.24/2.44  % (1075082)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1075075"
% 11.24/2.44  % (1075082)Refutation found. Thanks to Tanya!
% 11.24/2.44  % SZS status Unsatisfiable for theBenchmark
% 11.24/2.44  % SZS output start Proof for theBenchmark
% See solution above
% 11.71/2.64  % (1075082)------------------------------
% 11.71/2.64  % (1075082)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.71/2.64  % (1075082)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.71/2.64  % (1075082)CaDiCaL version: 2.1.3
% 11.71/2.64  % (1075082)Termination reason: Refutation
% 11.71/2.64  % (1075082)Time elapsed: 1.138 s
% 11.71/2.64  % (1075082)Peak memory usage: 135 MB
% 11.71/2.64  % (1075082)Instructions burned: 1780 (million)
% 11.71/2.64  % (1075082)------------------------------
% 11.71/2.64  % (1075082)------------------------------
% 11.71/2.64  % (1075075)Success in time 1.565 s
% 11.71/2.64  % Vampire exiting
%------------------------------------------------------------------------------