%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : COL044-10 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n014.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 09:37:43 AM UTC 2026
% Result : Unsatisfiable 7.45s 1.83s
% Output : Refutation 7.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 17
% Syntax : Number of formulae : 68 ( 68 unt; 12 def)
% Number of atoms : 68 ( 67 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 13 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 19 ( 19 usr; 16 con; 0-4 aty)
% Number of variables : 67 ( 67 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
! [X2,X0,X1] : ifeq(X0,X0,X1,X2) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifeq_axiom) ).
fof(f2,negated_conjecture,
! [X2,X0,X1] : apply(apply(apply(b,X0),X1),X2) = apply(X0,apply(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_definition) ).
fof(f3,negated_conjecture,
! [X2,X0,X1] : apply(apply(apply(n,X0),X1),X2) = apply(apply(apply(X0,X2),X1),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',n_definition) ).
fof(f4,axiom,
! [X0] : ifeq(apply(X0,fixed_pt),apply(fixed_pt,apply(X0,fixed_pt)),fixed_point(X0),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',strong_fixed_point) ).
fof(f5,plain,
! [X0] : true = ifeq(apply(X0,fixed_pt),apply(fixed_pt,apply(X0,fixed_pt)),fixed_point(X0),true),
inference(reorient_equations,[],[f4]) ).
fof(f6,negated_conjecture,
fixed_point(apply(apply(b,apply(apply(b,apply(apply(n,apply(apply(b,b),apply(apply(n,apply(n,apply(b,b))),n))),n)),b)),b)) != true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_strong_fixed_point) ).
fof(f7,plain,
true != fixed_point(apply(apply(b,apply(apply(b,apply(apply(n,apply(apply(b,b),apply(apply(n,apply(n,apply(b,b))),n))),n)),b)),b)),
inference(reorient_equations,[],[f6]) ).
fof(f8,definition,
sF0 = apply(b,b),
introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).
fof(f9,plain,
apply(b,b) = sF0,
inference(reorient_equations,[],[f8]) ).
fof(f10,definition,
sF1 = apply(n,sF0),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
fof(f11,plain,
apply(n,sF0) = sF1,
inference(reorient_equations,[],[f10]) ).
fof(f12,definition,
sF2 = apply(n,sF1),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
fof(f13,plain,
apply(n,sF1) = sF2,
inference(reorient_equations,[],[f12]) ).
fof(f14,definition,
sF3 = apply(sF2,n),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f15,plain,
apply(sF2,n) = sF3,
inference(reorient_equations,[],[f14]) ).
fof(f16,definition,
sF4 = apply(sF0,sF3),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
fof(f17,plain,
apply(sF0,sF3) = sF4,
inference(reorient_equations,[],[f16]) ).
fof(f18,definition,
sF5 = apply(n,sF4),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
fof(f19,plain,
apply(n,sF4) = sF5,
inference(reorient_equations,[],[f18]) ).
fof(f20,definition,
sF6 = apply(sF5,n),
introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).
fof(f21,plain,
apply(sF5,n) = sF6,
inference(reorient_equations,[],[f20]) ).
fof(f22,definition,
sF7 = apply(b,sF6),
introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).
fof(f23,plain,
apply(b,sF6) = sF7,
inference(reorient_equations,[],[f22]) ).
fof(f24,definition,
sF8 = apply(sF7,b),
introduced(definition,[new_symbols(definition,[sF8])],[function_definition]) ).
fof(f25,plain,
apply(sF7,b) = sF8,
inference(reorient_equations,[],[f24]) ).
fof(f26,definition,
sF9 = apply(b,sF8),
introduced(definition,[new_symbols(definition,[sF9])],[function_definition]) ).
fof(f27,plain,
apply(b,sF8) = sF9,
inference(reorient_equations,[],[f26]) ).
fof(f28,definition,
sF10 = apply(sF9,b),
introduced(definition,[new_symbols(definition,[sF10])],[function_definition]) ).
fof(f29,plain,
apply(sF9,b) = sF10,
inference(reorient_equations,[],[f28]) ).
fof(f30,definition,
sF11 = fixed_point(sF10),
introduced(definition,[new_symbols(definition,[sF11])],[function_definition]) ).
fof(f31,plain,
fixed_point(sF10) = sF11,
inference(reorient_equations,[],[f30]) ).
fof(f32,plain,
true != sF11,
inference(definition_folding,[],[f7,f31,f29,f27,f25,f23,f21,f19,f17,f15,f13,f11,f9,f9]) ).
fof(f34,plain,
true = ifeq(apply(sF10,fixed_pt),apply(fixed_pt,apply(sF10,fixed_pt)),sF11,true),
inference(superposition,[],[f5,f31]) ).
fof(f35,plain,
! [X0,X1] : apply(sF8,apply(X0,X1)) = apply(apply(sF9,X0),X1),
inference(superposition,[],[f2,f27]) ).
fof(f36,plain,
! [X0] : apply(sF8,apply(b,X0)) = apply(sF10,X0),
inference(superposition,[],[f35,f29]) ).
fof(f40,plain,
! [X0,X1] : apply(sF6,apply(X0,X1)) = apply(apply(sF7,X0),X1),
inference(superposition,[],[f2,f23]) ).
fof(f42,plain,
! [X0] : apply(sF6,apply(b,X0)) = apply(sF8,X0),
inference(superposition,[],[f40,f25]) ).
fof(f47,plain,
! [X0,X1] : apply(b,apply(X0,X1)) = apply(apply(sF0,X0),X1),
inference(superposition,[],[f2,f9]) ).
fof(f48,plain,
! [X0] : apply(b,apply(sF3,X0)) = apply(sF4,X0),
inference(superposition,[],[f47,f17]) ).
fof(f52,plain,
! [X2,X0,X1] : apply(apply(sF3,X0),apply(X1,X2)) = apply(apply(apply(sF4,X0),X1),X2),
inference(superposition,[],[f2,f48]) ).
fof(f55,plain,
! [X0,X1] : apply(apply(apply(sF4,X1),X0),X1) = apply(apply(sF5,X0),X1),
inference(superposition,[],[f3,f19]) ).
fof(f62,plain,
! [X2,X0,X1] : apply(apply(apply(n,apply(sF0,X0)),X2),X1) = apply(apply(apply(b,apply(X0,X1)),X2),X1),
inference(superposition,[],[f3,f47]) ).
fof(f66,plain,
! [X2,X0,X1] : apply(apply(apply(n,apply(b,X0)),X2),X1) = apply(apply(X0,apply(X1,X2)),X1),
inference(superposition,[],[f3,f2]) ).
fof(f81,plain,
! [X2,X0,X1] : apply(apply(apply(n,apply(sF0,X0)),X2),X1) = apply(apply(X0,X1),apply(X2,X1)),
inference(forward_demodulation,[],[f62,f2]) ).
fof(f84,plain,
! [X0,X1] : apply(apply(sF5,X0),X1) = apply(apply(sF3,X1),apply(X0,X1)),
inference(forward_demodulation,[],[f55,f52]) ).
fof(f149,plain,
! [X2,X0,X1] : apply(apply(X1,X0),apply(X1,X2)) = apply(apply(apply(apply(n,apply(b,b)),X0),X1),X2),
inference(superposition,[],[f2,f66]) ).
fof(f161,plain,
! [X2,X0,X1] : apply(apply(X1,X0),apply(X1,X2)) = apply(apply(apply(apply(n,sF0),X0),X1),X2),
inference(forward_demodulation,[],[f149,f9]) ).
fof(f166,plain,
! [X2,X0,X1] : apply(apply(X1,X0),apply(X1,X2)) = apply(apply(apply(sF1,X0),X1),X2),
inference(forward_demodulation,[],[f161,f11]) ).
fof(f202,plain,
! [X0,X1] : apply(apply(apply(n,sF1),X0),X1) = apply(apply(X0,X1),apply(X0,X1)),
inference(superposition,[],[f3,f166]) ).
fof(f209,plain,
! [X0,X1] : apply(apply(sF2,X0),X1) = apply(apply(X0,X1),apply(X0,X1)),
inference(forward_demodulation,[],[f202,f13]) ).
fof(f262,plain,
! [X0,X1] : apply(apply(X0,apply(X1,apply(n,apply(b,X0)))),X1) = apply(apply(apply(sF2,n),apply(b,X0)),X1),
inference(superposition,[],[f66,f209]) ).
fof(f275,plain,
! [X0,X1] : apply(apply(X0,apply(X1,apply(n,apply(b,X0)))),X1) = apply(apply(sF3,apply(b,X0)),X1),
inference(forward_demodulation,[],[f262,f15]) ).
fof(f554,plain,
! [X0,X1] : apply(X0,apply(apply(X1,apply(n,apply(b,apply(b,X0)))),X1)) = apply(apply(sF3,apply(b,apply(b,X0))),X1),
inference(superposition,[],[f2,f275]) ).
fof(f806,plain,
! [X0] : apply(apply(sF3,apply(b,apply(b,X0))),apply(n,apply(b,apply(b,X0)))) = apply(X0,apply(apply(apply(sF2,n),apply(b,apply(b,X0))),apply(n,apply(b,apply(b,X0))))),
inference(superposition,[],[f554,f209]) ).
fof(f890,plain,
! [X0] : apply(apply(sF3,apply(b,apply(b,X0))),apply(n,apply(b,apply(b,X0)))) = apply(X0,apply(apply(apply(n,apply(sF0,apply(sF2,n))),n),apply(b,apply(b,X0)))),
inference(forward_demodulation,[],[f806,f81]) ).
fof(f904,plain,
! [X0] : apply(apply(sF3,apply(b,apply(b,X0))),apply(n,apply(b,apply(b,X0)))) = apply(X0,apply(apply(apply(n,apply(sF0,sF3)),n),apply(b,apply(b,X0)))),
inference(forward_demodulation,[],[f890,f15]) ).
fof(f910,plain,
! [X0] : apply(apply(sF3,apply(b,apply(b,X0))),apply(n,apply(b,apply(b,X0)))) = apply(X0,apply(apply(apply(n,sF4),n),apply(b,apply(b,X0)))),
inference(forward_demodulation,[],[f904,f17]) ).
fof(f914,plain,
! [X0] : apply(apply(sF3,apply(b,apply(b,X0))),apply(n,apply(b,apply(b,X0)))) = apply(X0,apply(apply(sF5,n),apply(b,apply(b,X0)))),
inference(forward_demodulation,[],[f910,f19]) ).
fof(f917,plain,
! [X0] : apply(apply(sF3,apply(b,apply(b,X0))),apply(n,apply(b,apply(b,X0)))) = apply(X0,apply(sF6,apply(b,apply(b,X0)))),
inference(forward_demodulation,[],[f914,f21]) ).
fof(f918,plain,
! [X0] : apply(apply(sF3,apply(b,apply(b,X0))),apply(n,apply(b,apply(b,X0)))) = apply(X0,apply(sF8,apply(b,X0))),
inference(forward_demodulation,[],[f917,f42]) ).
fof(f919,plain,
! [X0] : apply(apply(sF3,apply(b,apply(b,X0))),apply(n,apply(b,apply(b,X0)))) = apply(X0,apply(sF10,X0)),
inference(forward_demodulation,[],[f918,f36]) ).
fof(f920,plain,
! [X0] : apply(apply(sF5,n),apply(b,apply(b,X0))) = apply(X0,apply(sF10,X0)),
inference(forward_demodulation,[],[f919,f84]) ).
fof(f921,plain,
! [X0] : apply(sF6,apply(b,apply(b,X0))) = apply(X0,apply(sF10,X0)),
inference(forward_demodulation,[],[f920,f21]) ).
fof(f922,plain,
! [X0] : apply(sF8,apply(b,X0)) = apply(X0,apply(sF10,X0)),
inference(forward_demodulation,[],[f921,f42]) ).
fof(f923,plain,
! [X0] : apply(sF10,X0) = apply(X0,apply(sF10,X0)),
inference(forward_demodulation,[],[f922,f36]) ).
fof(f924,plain,
true = ifeq(apply(sF10,fixed_pt),apply(sF10,fixed_pt),sF11,true),
inference(backward_demodulation,[],[f34,f923]) ).
fof(f925,plain,
true = sF11,
inference(forward_demodulation,[],[f924,f1]) ).
fof(f926,plain,
$false,
inference(forward_subsumption_resolution,[],[f925,f32]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COL044-10 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.19 % Computer : n014.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Mon Sep 28 21:30:31 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.22 Running first-order theorem proving
% 0.09/0.22 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
% 6.84/1.63 % (2207498)Detected a unit-equality problem, will run specialized UEQ schedule.
% 6.84/1.63 % (2207507)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=2748764602:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 6.84/1.63 % (2207509)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=2096365576:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 6.84/1.63 % (2207506)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=3644317024:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 6.84/1.63 % (2207504)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=24026698:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 6.84/1.63 % (2207505)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=1638111153:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 6.84/1.63 % (2207503)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=116851604:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 6.84/1.63 % (2207508)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=2961246637:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 6.84/1.63 % (2207507)Instruction limit reached!
% 6.84/1.63 % (2207507)------------------------------
% 6.84/1.63 % (2207507)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.84/1.63 % (2207507)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.84/1.63 % (2207507)CaDiCaL version: 2.1.3
% 6.84/1.63 % (2207507)Termination reason: Instruction limit
% 6.84/1.63 % (2207507)Termination phase: Saturation
% 6.84/1.63 % (2207507)Time elapsed: 0.055 s
% 6.84/1.63 % (2207507)Peak memory usage: 90 MB
% 6.84/1.63 % (2207507)Instructions burned: 182 (million)
% 6.84/1.63 % (2207506)Instruction limit reached!
% 6.84/1.63 % (2207506)------------------------------
% 6.84/1.63 % (2207506)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.84/1.63 % (2207506)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.84/1.63 % (2207506)CaDiCaL version: 2.1.3
% 6.84/1.63 % (2207506)Termination reason: Instruction limit
% 6.84/1.63 % (2207506)Termination phase: Saturation
% 6.84/1.63 % (2207506)Time elapsed: 0.083 s
% 6.84/1.63 % (2207506)Peak memory usage: 89 MB
% 6.84/1.63 % (2207506)Instructions burned: 136 (million)
% 6.84/1.63 % (2207517)lrs-1011_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:prc=on:fde=unused:lcm=predicate:bsr=on:flr=on:random_seed=4031001878:i=2051:gtgl=2:fgj=on:bd=all:gtg=exists_top_2998 on theBenchmark for (2998ds/2051Mi)
% 6.84/1.63 % (2207508)Instruction limit reached!
% 6.84/1.63 % (2207508)------------------------------
% 6.84/1.63 % (2207508)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.84/1.63 % (2207508)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.84/1.63 % (2207508)CaDiCaL version: 2.1.3
% 6.84/1.63 % (2207508)Termination reason: Instruction limit
% 6.84/1.63 % (2207508)Termination phase: Saturation
% 6.84/1.63 % (2207508)Time elapsed: 0.164 s
% 6.84/1.63 % (2207508)Peak memory usage: 91 MB
% 6.84/1.63 % (2207508)Instructions burned: 257 (million)
% 6.84/1.63 % (2207518)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=3406872549:i=4948:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/4948Mi)
% 6.84/1.63 % (2207520)lrs+10_5:1_sil=8000:sos=all:urr=on:br=off:flr=on:random_seed=524540365:i=215:ep=RSTC_2996 on theBenchmark for (2996ds/215Mi)
% 6.84/1.63 % (2207520)Instruction limit reached!
% 6.84/1.63 % (2207520)------------------------------
% 6.84/1.63 % (2207520)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.84/1.63 % (2207520)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.84/1.63 % (2207520)CaDiCaL version: 2.1.3
% 6.84/1.63 % (2207520)Termination reason: Instruction limit
% 6.84/1.63 % (2207520)Termination phase: Saturation
% 6.84/1.63 % (2207520)Time elapsed: 0.107 s
% 7.45/1.83 % (2207520)Peak memory usage: 88 MB
% 7.45/1.83 % (2207520)Instructions burned: 217 (million)
% 7.45/1.83 % (2207523)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=3012453595: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)
% 7.45/1.83 % (2207509)Instruction limit reached!
% 7.45/1.83 % (2207509)------------------------------
% 7.45/1.83 % (2207509)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.45/1.83 % (2207509)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.45/1.83 % (2207509)CaDiCaL version: 2.1.3
% 7.45/1.83 % (2207509)Termination reason: Instruction limit
% 7.45/1.83 % (2207509)Termination phase: Saturation
% 7.45/1.83 % (2207509)Time elapsed: 0.636 s
% 7.45/1.83 % (2207509)Peak memory usage: 98 MB
% 7.45/1.83 % (2207509)Instructions burned: 1188 (million)
% 7.45/1.83 % (2207505)First to succeed.
% 7.45/1.83 % (2207505)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2207498"
% 7.45/1.83 % (2207523)Instruction limit reached!
% 7.45/1.83 % (2207523)------------------------------
% 7.45/1.83 % (2207523)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.45/1.83 % (2207523)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.45/1.83 % (2207523)CaDiCaL version: 2.1.3
% 7.45/1.83 % (2207523)Termination reason: Instruction limit
% 7.45/1.83 % (2207523)Termination phase: Saturation
% 7.45/1.83 % (2207523)Time elapsed: 0.190 s
% 7.45/1.83 % (2207523)Peak memory usage: 94 MB
% 7.45/1.83 % (2207523)Instructions burned: 318 (million)
% 7.45/1.83 % (2207525)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=3104370683:i=12125:sd=2:fgj=on:ss=axioms:sgt=64_2992 on theBenchmark for (2992ds/12125Mi)
% 7.45/1.83 % (2207505)Refutation found. Thanks to Tanya!
% 7.45/1.83 % SZS status Unsatisfiable for theBenchmark
% 7.45/1.83 % SZS output start Proof for theBenchmark
% See solution above
% 7.45/1.83 % (2207505)------------------------------
% 7.45/1.83 % (2207505)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.45/1.83 % (2207505)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.45/1.83 % (2207505)CaDiCaL version: 2.1.3
% 7.45/1.83 % (2207505)Termination reason: Refutation
% 7.45/1.83 % (2207505)Time elapsed: 0.659 s
% 7.45/1.83 % (2207505)Peak memory usage: 132 MB
% 7.45/1.83 % (2207505)Instructions burned: 1227 (million)
% 7.45/1.83 % (2207505)------------------------------
% 7.45/1.83 % (2207505)------------------------------
% 7.45/1.83 % (2207498)Success in time 0.963 s
% 7.45/1.83 % Vampire exiting
%------------------------------------------------------------------------------