0.07/0.13	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.13	% Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
0.13/0.34	% Computer : n025.cluster.edu
0.13/0.34	% Model    : x86_64 x86_64
0.13/0.34	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	% Memory   : 8042.1875MB
0.13/0.34	% OS       : Linux 3.10.0-693.el7.x86_64
0.13/0.34	% CPULimit   : 300
0.13/0.34	% WCLimit    : 300
0.13/0.34	% DateTime   : Fri Jul  5 04:22:09 EDT 2024
0.13/0.34	% CPUTime    : 
0.13/0.36	This is a TFF_ problem
0.13/0.36	Running vampire --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
0.13/0.37	% (11832)Running in auto input_syntax mode. Trying TPTP
0.21/0.43	% (11833)lrs+2_32_add=large:amm=off:bd=off:bs=unit_only:drc=off:flr=on:fsd=off:fde=none:nm=0:nwc=1.1:sos=theory:sp=reverse_arity:tgt=ground:stl=180_1034 on theBenchmark for (1034ds/0Mi)
0.21/0.45	% (11834)dis-1010_2:3_canc=force:fsd=off:fde=unused:gs=on:gsem=on:nm=0:nwc=1.3:sas=z3:tha=off:thf=on:uwa=ground_572 on theBenchmark for (572ds/0Mi)
0.21/0.46	% (11835)dis-10_20_canc=force:fsd=off:gs=on:gsem=off:nm=0:sas=z3:sac=on:tha=off:thi=strong:tgt=ground_476 on theBenchmark for (476ds/0Mi)
0.21/0.46	% (11836)dis-11_10:1_canc=force:fsd=off:nwc=1.5:sas=z3:tha=off:uwa=all_472 on theBenchmark for (472ds/0Mi)
0.21/0.46	% (11837)lrs+1010_2:1_amm=off:bs=on:bsr=on:canc=force:fsd=off:fsr=off:gs=on:gsaa=full_model:gsem=on:nm=0:nwc=1.3:sas=z3:sac=on:tha=off:thi=overlap:tgt=ground:uwa=ground:stl=60_408 on theBenchmark for (408ds/0Mi)
0.21/0.46	% (11838)ott+10_1024_av=off:bd=preordered:br=off:ep=RSTC:fsr=off:fde=none:nm=2:urr=on_318 on theBenchmark for (318ds/0Mi)
0.21/0.46	% (11839)lrs-1010_3_av=off:br=off:drc=off:er=known:fsd=off:fde=unused:nm=4:nwc=3.0:sp=scramble:urr=on:stl=180_280 on theBenchmark for (280ds/0Mi)
50.48/7.62	% (11839)First to succeed.
50.48/7.64	% (11839)Refutation found. Thanks to Tanya!
50.48/7.64	% SZS status Theorem for theBenchmark
50.48/7.64	% SZS output start Proof for theBenchmark
50.48/7.64	tff(type_def_5, type, uni: $tType).
50.48/7.64	tff(type_def_6, type, ty: $tType).
50.48/7.64	tff(type_def_7, type, bool: $tType).
50.48/7.64	tff(type_def_8, type, tuple0: $tType).
50.48/7.64	tff(type_def_9, type, elt: $tType).
50.48/7.64	tff(type_def_10, type, list_elt: $tType).
50.48/7.64	tff(func_def_0, type, witness: ty > uni).
50.48/7.64	tff(func_def_1, type, int: ty).
50.48/7.64	tff(func_def_2, type, real: ty).
50.48/7.64	tff(func_def_3, type, bool1: ty).
50.48/7.64	tff(func_def_4, type, true: bool).
50.48/7.64	tff(func_def_5, type, false: bool).
50.48/7.64	tff(func_def_6, type, match_bool: (ty * bool * uni * uni) > uni).
50.48/7.64	tff(func_def_7, type, tuple01: ty).
50.48/7.64	tff(func_def_8, type, tuple02: tuple0).
50.48/7.64	tff(func_def_9, type, qtmark: ty).
50.48/7.64	tff(func_def_10, type, list: ty > ty).
50.48/7.64	tff(func_def_11, type, nil: ty > uni).
50.48/7.64	tff(func_def_12, type, cons: (ty * uni * uni) > uni).
50.48/7.64	tff(func_def_13, type, match_list: (ty * ty * uni * uni * uni) > uni).
50.48/7.64	tff(func_def_14, type, cons_proj_1: (ty * uni) > uni).
50.48/7.64	tff(func_def_15, type, cons_proj_2: (ty * uni) > uni).
50.48/7.64	tff(func_def_16, type, length: (ty * uni) > $int).
50.48/7.64	tff(func_def_17, type, infix_plpl: (ty * uni * uni) > uni).
50.48/7.64	tff(func_def_18, type, num_occ: (ty * uni * uni) > $int).
50.48/7.64	tff(func_def_19, type, reverse: (ty * uni) > uni).
50.48/7.64	tff(func_def_20, type, elt1: ty).
50.48/7.64	tff(func_def_21, type, t2tb: list_elt > uni).
50.48/7.64	tff(func_def_22, type, tb2t: uni > list_elt).
50.48/7.64	tff(func_def_23, type, t2tb1: elt > uni).
50.48/7.64	tff(func_def_24, type, tb2t1: uni > elt).
50.48/7.64	tff(func_def_25, type, rev_append: (ty * uni * uni) > uni).
50.48/7.64	tff(func_def_26, type, prefix: (ty * $int * uni) > uni).
50.48/7.64	tff(func_def_27, type, abs: $int > $int).
50.48/7.64	tff(func_def_28, type, div: ($int * $int) > $int).
50.48/7.64	tff(func_def_29, type, mod: ($int * $int) > $int).
50.48/7.64	tff(func_def_36, type, sK1: elt).
50.48/7.64	tff(func_def_37, type, sK2: list_elt).
50.48/7.64	tff(func_def_38, type, sK3: list_elt > elt).
50.48/7.64	tff(func_def_39, type, sK4: list_elt > elt).
50.48/7.64	tff(func_def_40, type, sK5: list_elt > elt).
50.48/7.64	tff(func_def_41, type, sK6: list_elt > list_elt).
50.48/7.64	tff(func_def_42, type, sK7: (list_elt * list_elt) > elt).
50.48/7.64	tff(func_def_43, type, sK8: (list_elt * list_elt) > elt).
50.48/7.64	tff(func_def_44, type, sK9: (list_elt * elt) > elt).
50.48/7.64	tff(func_def_45, type, sK10: (elt * list_elt) > elt).
50.48/7.64	tff(func_def_46, type, sK11: (list_elt * list_elt) > elt).
50.48/7.64	tff(func_def_47, type, sK12: (list_elt * list_elt) > elt).
50.48/7.64	tff(func_def_48, type, sK13: (ty * uni * uni) > uni).
50.48/7.64	tff(func_def_49, type, sK14: (ty * uni * uni) > uni).
50.48/7.64	tff(func_def_50, type, sK15: (ty * uni * uni) > uni).
50.48/7.64	tff(pred_def_1, type, sort: (ty * uni) > $o).
50.48/7.64	tff(pred_def_2, type, mem: (ty * uni * uni) > $o).
50.48/7.64	tff(pred_def_3, type, permut: (ty * uni * uni) > $o).
50.48/7.64	tff(pred_def_4, type, le: (elt * elt) > $o).
50.48/7.64	tff(pred_def_5, type, sorted: list_elt > $o).
50.48/7.64	tff(pred_def_8, type, sP0: (list_elt * list_elt) > $o).
50.48/7.64	tff(f646655,plain,(
50.48/7.64	  $false),
50.48/7.64	  inference(subsumption_resolution,[],[f646646,f30848])).
50.48/7.64	tff(f30848,plain,(
50.48/7.64	  ( ! [X0 : uni] : (permut(elt1,cons(elt1,X0,prefix(elt1,length(elt1,t2tb(sK2)),t2tb(sK2))),cons(elt1,X0,t2tb(sK2)))) )),
50.48/7.64	  inference(unit_resulting_resolution,[],[f467,f443])).
50.48/7.64	tff(f443,plain,(
50.48/7.64	  ( ! [X2 : uni,X3 : uni,X0 : ty,X1 : uni] : (permut(X0,cons(X0,X1,X2),cons(X0,X1,X3)) | ~permut(X0,X2,X3)) )),
50.48/7.64	  inference(cnf_transformation,[],[f268])).
50.48/7.64	tff(f268,plain,(
50.48/7.64	  ! [X0 : ty,X1 : uni,X2 : uni,X3 : uni] : (permut(X0,cons(X0,X1,X2),cons(X0,X1,X3)) | ~permut(X0,X2,X3))),
50.48/7.64	  inference(ennf_transformation,[],[f206])).
50.48/7.64	tff(f206,plain,(
50.48/7.64	  ! [X0 : ty,X1 : uni,X2 : uni,X3 : uni] : (permut(X0,X2,X3) => permut(X0,cons(X0,X1,X2),cons(X0,X1,X3)))),
50.48/7.64	  inference(rectify,[],[f88])).
50.48/7.64	tff(f88,axiom,(
50.48/7.64	  ! [X3 : ty,X0 : uni,X4 : uni,X5 : uni] : (permut(X3,X4,X5) => permut(X3,cons(X3,X0,X4),cons(X3,X0,X5)))),
50.48/7.64	  file('/export/starexec/sandbox2/benchmark/theBenchmark.p',permut_cons)).
50.48/7.64	tff(f467,plain,(
50.48/7.64	  permut(elt1,prefix(elt1,length(elt1,t2tb(sK2)),t2tb(sK2)),t2tb(sK2))),
50.48/7.64	  inference(subsumption_resolution,[],[f465,f341])).
50.48/7.64	tff(f341,plain,(
50.48/7.64	  ( ! [X0 : ty,X1 : uni] : (permut(X0,X1,X1)) )),
50.48/7.64	  inference(cnf_transformation,[],[f151])).
50.48/7.64	tff(f151,plain,(
50.48/7.64	  ! [X0 : ty,X1 : uni] : permut(X0,X1,X1)),
50.48/7.64	  inference(rectify,[],[f97])).
50.48/7.64	tff(f97,axiom,(
50.48/7.64	  ! [X3 : ty,X14 : uni] : permut(X3,X14,X14)),
50.48/7.64	  file('/export/starexec/sandbox2/benchmark/theBenchmark.p',permut_refl)).
50.48/7.64	tff(f465,plain,(
50.48/7.64	  ~permut(elt1,nil(elt1),nil(elt1)) | permut(elt1,prefix(elt1,length(elt1,t2tb(sK2)),t2tb(sK2)),t2tb(sK2))),
50.48/7.64	  inference(backward_demodulation,[],[f463,f346])).
50.48/7.64	tff(f346,plain,(
50.48/7.64	  ( ! [X0 : ty,X1 : uni] : (nil(X0) = prefix(X0,0,X1)) )),
50.48/7.64	  inference(cnf_transformation,[],[f156])).
50.48/7.64	tff(f156,plain,(
50.48/7.64	  ! [X0 : ty,X1 : uni] : nil(X0) = prefix(X0,0,X1)),
50.48/7.64	  inference(rectify,[],[f14])).
50.48/7.64	tff(f14,axiom,(
50.48/7.64	  ! [X3 : ty,X14 : uni] : nil(X3) = prefix(X3,0,X14)),
50.48/7.64	  file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prefix_def1)).
50.48/7.64	tff(f463,plain,(
50.48/7.64	  ~permut(elt1,prefix(elt1,0,nil(elt1)),nil(elt1)) | permut(elt1,prefix(elt1,length(elt1,t2tb(sK2)),t2tb(sK2)),t2tb(sK2))),
50.48/7.64	  inference(backward_demodulation,[],[f313,f330])).
50.48/7.64	tff(f330,plain,(
50.48/7.64	  ( ! [X0 : ty] : (0 = length(X0,nil(X0))) )),
50.48/7.64	  inference(cnf_transformation,[],[f146])).
50.48/7.64	tff(f146,plain,(
50.48/7.64	  ! [X0 : ty] : (! [X1 : uni,X2 : uni] : length(X0,cons(X0,X1,X2)) = $sum(1,length(X0,X2)) & 0 = length(X0,nil(X0)))),
50.48/7.64	  inference(rectify,[],[f84])).
50.48/7.64	tff(f84,axiom,(
50.48/7.64	  ! [X3 : ty] : (! [X0 : uni,X9 : uni] : length(X3,cons(X3,X0,X9)) = $sum(1,length(X3,X9)) & 0 = length(X3,nil(X3)))),
50.48/7.64	  file('/export/starexec/sandbox2/benchmark/theBenchmark.p',length_def)).
50.48/7.64	tff(f313,plain,(
50.48/7.64	  permut(elt1,prefix(elt1,length(elt1,t2tb(sK2)),t2tb(sK2)),t2tb(sK2)) | ~permut(elt1,prefix(elt1,length(elt1,nil(elt1)),nil(elt1)),nil(elt1))),
50.48/7.64	  inference(cnf_transformation,[],[f281])).
50.48/7.64	tff(f281,plain,(
50.48/7.64	  (~permut(elt1,prefix(elt1,length(elt1,cons(elt1,t2tb1(sK1),t2tb(sK2))),cons(elt1,t2tb1(sK1),t2tb(sK2))),cons(elt1,t2tb1(sK1),t2tb(sK2))) & permut(elt1,prefix(elt1,length(elt1,t2tb(sK2)),t2tb(sK2)),t2tb(sK2))) | ~permut(elt1,prefix(elt1,length(elt1,nil(elt1)),nil(elt1)),nil(elt1))),
50.48/7.64	  inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f214,f280])).
50.48/7.64	tff(f280,plain,(
50.48/7.64	  ? [X0 : elt,X1 : list_elt] : (~permut(elt1,prefix(elt1,length(elt1,cons(elt1,t2tb1(X0),t2tb(X1))),cons(elt1,t2tb1(X0),t2tb(X1))),cons(elt1,t2tb1(X0),t2tb(X1))) & permut(elt1,prefix(elt1,length(elt1,t2tb(X1)),t2tb(X1)),t2tb(X1))) => (~permut(elt1,prefix(elt1,length(elt1,cons(elt1,t2tb1(sK1),t2tb(sK2))),cons(elt1,t2tb1(sK1),t2tb(sK2))),cons(elt1,t2tb1(sK1),t2tb(sK2))) & permut(elt1,prefix(elt1,length(elt1,t2tb(sK2)),t2tb(sK2)),t2tb(sK2)))),
50.48/7.64	  introduced(choice_axiom,[])).
50.48/7.64	tff(f214,plain,(
50.48/7.64	  ? [X0 : elt,X1 : list_elt] : (~permut(elt1,prefix(elt1,length(elt1,cons(elt1,t2tb1(X0),t2tb(X1))),cons(elt1,t2tb1(X0),t2tb(X1))),cons(elt1,t2tb1(X0),t2tb(X1))) & permut(elt1,prefix(elt1,length(elt1,t2tb(X1)),t2tb(X1)),t2tb(X1))) | ~permut(elt1,prefix(elt1,length(elt1,nil(elt1)),nil(elt1)),nil(elt1))),
50.48/7.64	  inference(ennf_transformation,[],[f139])).
50.48/7.64	tff(f139,plain,(
50.48/7.64	  ~(! [X0 : elt,X1 : list_elt] : (permut(elt1,prefix(elt1,length(elt1,t2tb(X1)),t2tb(X1)),t2tb(X1)) => permut(elt1,prefix(elt1,length(elt1,cons(elt1,t2tb1(X0),t2tb(X1))),cons(elt1,t2tb1(X0),t2tb(X1))),cons(elt1,t2tb1(X0),t2tb(X1)))) & permut(elt1,prefix(elt1,length(elt1,nil(elt1)),nil(elt1)),nil(elt1)))),
50.48/7.64	  inference(rectify,[],[f18])).
50.48/7.64	tff(f18,negated_conjecture,(
50.48/7.64	  ~(! [X0 : elt,X9 : list_elt] : (permut(elt1,prefix(elt1,length(elt1,t2tb(X9)),t2tb(X9)),t2tb(X9)) => permut(elt1,prefix(elt1,length(elt1,cons(elt1,t2tb1(X0),t2tb(X9))),cons(elt1,t2tb1(X0),t2tb(X9))),cons(elt1,t2tb1(X0),t2tb(X9)))) & permut(elt1,prefix(elt1,length(elt1,nil(elt1)),nil(elt1)),nil(elt1)))),
50.48/7.64	  inference(negated_conjecture,[],[f17])).
50.48/7.64	tff(f17,conjecture,(
50.48/7.64	  ! [X0 : elt,X9 : list_elt] : (permut(elt1,prefix(elt1,length(elt1,t2tb(X9)),t2tb(X9)),t2tb(X9)) => permut(elt1,prefix(elt1,length(elt1,cons(elt1,t2tb1(X0),t2tb(X9))),cons(elt1,t2tb1(X0),t2tb(X9))),cons(elt1,t2tb1(X0),t2tb(X9)))) & permut(elt1,prefix(elt1,length(elt1,nil(elt1)),nil(elt1)),nil(elt1))),
50.48/7.64	  file('/export/starexec/sandbox2/benchmark/theBenchmark.p',permut_prefix)).
50.48/7.64	tff(f646646,plain,(
50.48/7.64	  ~permut(elt1,cons(elt1,t2tb1(sK1),prefix(elt1,length(elt1,t2tb(sK2)),t2tb(sK2))),cons(elt1,t2tb1(sK1),t2tb(sK2)))),
50.48/7.64	  inference(backward_demodulation,[],[f468,f643010])).
50.48/7.64	tff(f643010,plain,(
50.48/7.64	  ( ! [X2 : uni,X3 : uni,X0 : ty,X1 : ty,X4 : uni] : (prefix(X0,$sum(1,length(X1,X2)),cons(X0,X3,X4)) = cons(X0,X3,prefix(X0,length(X1,X2),X4))) )),
50.48/7.64	  inference(evaluation,[],[f641324])).
50.48/7.64	tff(f641324,plain,(
50.48/7.64	  ( ! [X2 : uni,X3 : uni,X0 : ty,X1 : ty,X4 : uni] : (prefix(X0,$sum(1,length(X1,X2)),cons(X0,X3,X4)) = cons(X0,X3,prefix(X0,$sum($sum(1,length(X1,X2)),-1),X4))) )),
50.48/7.64	  inference(unit_resulting_resolution,[],[f539,f457])).
50.48/7.64	tff(f457,plain,(
50.48/7.64	  ( ! [X2 : uni,X3 : uni,X0 : ty,X1 : $int] : (prefix(X0,X1,cons(X0,X2,X3)) = cons(X0,X2,prefix(X0,$sum(X1,-1),X3)) | ~$less(0,X1)) )),
50.48/7.64	  inference(evaluation,[],[f441])).
50.48/7.64	tff(f441,plain,(
50.48/7.64	  ( ! [X2 : uni,X3 : uni,X0 : ty,X1 : $int] : (prefix(X0,X1,cons(X0,X2,X3)) = cons(X0,X2,prefix(X0,$sum(X1,$uminus(1)),X3)) | ~$less(0,X1)) )),
50.48/7.64	  inference(cnf_transformation,[],[f266])).
50.48/7.64	tff(f266,plain,(
50.48/7.64	  ! [X0 : ty,X1 : $int,X2 : uni,X3 : uni] : (prefix(X0,X1,cons(X0,X2,X3)) = cons(X0,X2,prefix(X0,$sum(X1,$uminus(1)),X3)) | ~$less(0,X1))),
50.48/7.64	  inference(ennf_transformation,[],[f204])).
50.48/7.64	tff(f204,plain,(
50.48/7.64	  ! [X0 : ty,X1 : $int,X2 : uni,X3 : uni] : ($less(0,X1) => prefix(X0,X1,cons(X0,X2,X3)) = cons(X0,X2,prefix(X0,$sum(X1,$uminus(1)),X3)))),
50.48/7.64	  inference(rectify,[],[f119])).
50.48/7.64	tff(f119,plain,(
50.48/7.64	  ! [X3 : ty,X19 : $int,X0 : uni,X14 : uni] : ($less(0,X19) => prefix(X3,X19,cons(X3,X0,X14)) = cons(X3,X0,prefix(X3,$sum(X19,$uminus(1)),X14)))),
50.48/7.64	  inference(theory_normalization,[],[f64])).
50.48/7.64	tff(f64,axiom,(
50.48/7.64	  ! [X3 : ty,X19 : $int,X0 : uni,X14 : uni] : ($less(0,X19) => prefix(X3,X19,cons(X3,X0,X14)) = cons(X3,X0,prefix(X3,$difference(X19,1),X14)))),
50.48/7.64	  file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prefix_def2)).
50.48/7.64	tff(f539,plain,(
50.48/7.64	  ( ! [X0 : ty,X1 : uni] : ($less(0,$sum(1,length(X0,X1)))) )),
50.48/7.64	  inference(forward_demodulation,[],[f534,f121])).
50.48/7.64	tff(f121,plain,(
50.48/7.64	  ( ! [X0 : $int,X1 : $int] : ($sum(X0,X1) = $sum(X1,X0)) )),
50.48/7.64	  introduced(theory_axiom_138,[])).
50.48/7.64	tff(f534,plain,(
50.48/7.64	  ( ! [X0 : ty,X1 : uni] : ($less(0,$sum(length(X0,X1),1))) )),
50.48/7.64	  inference(unit_resulting_resolution,[],[f342,f130])).
50.48/7.64	tff(f130,plain,(
50.48/7.64	  ( ! [X0 : $int,X1 : $int] : ($less(X1,$sum(X0,1)) | $less(X0,X1)) )),
50.48/7.64	  introduced(theory_axiom_150,[])).
50.48/7.64	tff(f342,plain,(
50.48/7.64	  ( ! [X0 : ty,X1 : uni] : (~$less(length(X0,X1),0)) )),
50.48/7.64	  inference(cnf_transformation,[],[f152])).
50.48/7.64	tff(f152,plain,(
50.48/7.64	  ! [X0 : ty,X1 : uni] : ~$less(length(X0,X1),0)),
50.48/7.64	  inference(rectify,[],[f105])).
50.48/7.64	tff(f105,plain,(
50.48/7.64	  ! [X3 : ty,X14 : uni] : ~$less(length(X3,X14),0)),
50.48/7.64	  inference(theory_normalization,[],[f86])).
50.48/7.64	tff(f86,axiom,(
50.48/7.64	  ! [X3 : ty,X14 : uni] : $lesseq(0,length(X3,X14))),
50.48/7.64	  file('/export/starexec/sandbox2/benchmark/theBenchmark.p',length_nonnegative)).
50.48/7.64	tff(f468,plain,(
50.48/7.64	  ~permut(elt1,prefix(elt1,$sum(1,length(elt1,t2tb(sK2))),cons(elt1,t2tb1(sK1),t2tb(sK2))),cons(elt1,t2tb1(sK1),t2tb(sK2)))),
50.48/7.64	  inference(subsumption_resolution,[],[f466,f341])).
50.48/7.64	tff(f466,plain,(
50.48/7.64	  ~permut(elt1,nil(elt1),nil(elt1)) | ~permut(elt1,prefix(elt1,$sum(1,length(elt1,t2tb(sK2))),cons(elt1,t2tb1(sK1),t2tb(sK2))),cons(elt1,t2tb1(sK1),t2tb(sK2)))),
50.48/7.64	  inference(backward_demodulation,[],[f462,f346])).
50.48/7.64	tff(f462,plain,(
50.48/7.64	  ~permut(elt1,prefix(elt1,0,nil(elt1)),nil(elt1)) | ~permut(elt1,prefix(elt1,$sum(1,length(elt1,t2tb(sK2))),cons(elt1,t2tb1(sK1),t2tb(sK2))),cons(elt1,t2tb1(sK1),t2tb(sK2)))),
50.48/7.64	  inference(backward_demodulation,[],[f461,f330])).
50.48/7.64	tff(f461,plain,(
50.48/7.64	  ~permut(elt1,prefix(elt1,$sum(1,length(elt1,t2tb(sK2))),cons(elt1,t2tb1(sK1),t2tb(sK2))),cons(elt1,t2tb1(sK1),t2tb(sK2))) | ~permut(elt1,prefix(elt1,length(elt1,nil(elt1)),nil(elt1)),nil(elt1))),
50.48/7.64	  inference(backward_demodulation,[],[f314,f331])).
50.48/7.64	tff(f331,plain,(
50.48/7.64	  ( ! [X2 : uni,X0 : ty,X1 : uni] : (length(X0,cons(X0,X1,X2)) = $sum(1,length(X0,X2))) )),
50.48/7.64	  inference(cnf_transformation,[],[f146])).
50.48/7.64	tff(f314,plain,(
50.48/7.64	  ~permut(elt1,prefix(elt1,length(elt1,cons(elt1,t2tb1(sK1),t2tb(sK2))),cons(elt1,t2tb1(sK1),t2tb(sK2))),cons(elt1,t2tb1(sK1),t2tb(sK2))) | ~permut(elt1,prefix(elt1,length(elt1,nil(elt1)),nil(elt1)),nil(elt1))),
50.48/7.64	  inference(cnf_transformation,[],[f281])).
50.48/7.64	% SZS output end Proof for theBenchmark
50.48/7.64	% (11839)------------------------------
50.48/7.64	% (11839)Version: Vampire 4.7 (commit 05ef610bd on 2023-06-21 19:03:17 +0100)
50.48/7.64	% (11839)Linked with Z3 4.9.1.0 6ed071b44407cf6623b8d3c0dceb2a8fb7040cee z3-4.8.4-6427-g6ed071b44
50.48/7.64	% (11839)Termination reason: Refutation
50.48/7.64	
50.48/7.64	% (11839)Memory used [KB]: 159144
50.48/7.64	% (11839)Time elapsed: 7.165 s
50.48/7.64	% (11839)------------------------------
50.48/7.64	% (11839)------------------------------
50.48/7.64	% (11832)Success in time 7.232 s
50.48/7.64	% Vampire---4.8 exiting
50.48/7.69	EOF