%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : DAT157^1 : TPTP v9.3.1. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n005.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 : Wed Sep 30 07:48:58 AM UTC 2026
% Result : Theorem 0.20s 0.31s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : DAT157^1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.19 % Computer : n005.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Tue Sep 29 18:02:31 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.22 Running first-order model finding
% 0.08/0.22 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.31 % (2006749)Will run a generic schedule for satisfiability detection.
% 0.20/0.31 % (2006758)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=303412031:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.31 % (2006755)% WARNING: option uhcvi not known.
% 0.20/0.31 % (2006754)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2033263429_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.31 % (2006755)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1102504107:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.31 % (2006756)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4088585217:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.31 % (2006758)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.31 % (2006757)dis+10_1_sil=32000:sp=arity:random_seed=2780262341:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.31 % (2006755)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.31 % (2006759)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=794531518:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.31 % (2006760)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2623020497:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.31 % (2006758) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2006749-2006758"...
% 0.20/0.31 % (2006758)...printing done.
% 0.20/0.31 % (2006758)Refutation found. Thanks to Tanya!
% 0.20/0.31 % SZS status Theorem for theBenchmark
% 0.20/0.31 % SZS output start Proof for theBenchmark
% 0.20/0.31 thf(type_def_5, type, coinductive_llist: $tType > $tType).
% 0.20/0.31 thf(type_def_6, type, list: $tType > $tType).
% 0.20/0.31 thf(type_def_7, type, set: $tType > $tType).
% 0.20/0.31 thf(type_def_8, type, itself: $tType > $tType).
% 0.20/0.31 thf(type_def_9, type, a: $tType).
% 0.20/0.31 thf(type_def_10, type, sTfun: ($tType * $tType) > $tType).
% 0.20/0.31 thf(func_def_0, type, type: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.20/0.31 thf(func_def_1, type, order: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.20/0.31 thf(func_def_2, type, linorder: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.20/0.31 thf(func_def_3, type, coindu351974385stinct: !>[X0: $tType]:((coinductive_llist @ X0 > $o))).
% 0.20/0.31 thf(func_def_4, type, coinductive_lfinite: !>[X0: $tType]:((coinductive_llist @ X0 > $o))).
% 0.20/0.31 thf(func_def_5, type, coinductive_LCons: !>[X0: $tType]:((X0 > coinductive_llist @ X0 > coinductive_llist @ X0))).
% 0.20/0.31 thf(func_def_6, type, coinductive_lset: !>[X0: $tType]:((coinductive_llist @ X0 > set @ X0))).
% 0.20/0.31 thf(func_def_7, type, coinductive_lsorted: !>[X0: $tType]:(((X0 > X0 > $o) > coinductive_llist @ X0 > $o))).
% 0.20/0.31 thf(func_def_8, type, condit2040224947_above: !>[X0: $tType]:(((X0 > X0 > $o) > set @ X0 > $o))).
% 0.20/0.31 thf(func_def_9, type, condit1201339847_below: !>[X0: $tType]:(((X0 > X0 > $o) > set @ X0 > $o))).
% 0.20/0.31 thf(func_def_10, type, finite_folding: !>[X0: $tType, X1: $tType]:(((X0 > X1 > X1) > $o))).
% 0.20/0.31 thf(func_def_11, type, semigroup: !>[X0: $tType]:(((X0 > X0 > X0) > $o))).
% 0.20/0.31 thf(func_def_12, type, hammin1328233080lmerge: !>[X0: $tType]:(((X0 > X0 > $o) > coinductive_llist @ X0 > coinductive_llist @ X0 > coinductive_llist @ X0))).
% 0.20/0.31 thf(func_def_13, type, inf_inf: !>[X0: $tType]:((X0 > X0 > X0))).
% 0.20/0.31 thf(func_def_14, type, semilattice: !>[X0: $tType]:(((X0 > X0 > X0) > $o))).
% 0.20/0.31 thf(func_def_15, type, lattic1693879045er_set: !>[X0: $tType]:(((X0 > X0 > X0) > (X0 > X0 > $o) > (X0 > X0 > $o) > $o))).
% 0.20/0.31 thf(func_def_16, type, insort_key: !>[X0: $tType, X1: $tType]:(((X0 > X0 > $o) > (X1 > X0) > X1 > list @ X1 > list @ X1))).
% 0.20/0.31 thf(func_def_17, type, least: !>[X0: $tType]:(((X0 > X0 > $o) > (X0 > $o) > X0))).
% 0.20/0.31 thf(func_def_18, type, min: !>[X0: $tType]:(((X0 > X0 > $o) > X0 > X0 > X0))).
% 0.20/0.31 thf(func_def_19, type, ord_less_eq: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.20/0.31 thf(func_def_20, type, antimono: !>[X0: $tType, X1: $tType]:(((X0 > X0 > $o) > (X0 > X1) > $o))).
% 0.20/0.31 thf(func_def_21, type, mono: !>[X0: $tType, X1: $tType]:(((X0 > X0 > $o) > (X0 > X1) > $o))).
% 0.20/0.31 thf(func_def_22, type, strict_mono: !>[X0: $tType, X1: $tType]:(((X0 > X0 > $o) > (X0 > X1) > $o))).
% 0.20/0.31 thf(func_def_23, type, ordering: !>[X0: $tType]:(((X0 > X0 > $o) > (X0 > X0 > $o) > $o))).
% 0.20/0.31 thf(func_def_24, type, type2: !>[X0: $tType]:(itself @ X0)).
% 0.20/0.31 thf(func_def_25, type, transp: !>[X0: $tType]:(((X0 > X0 > $o) > $o))).
% 0.20/0.31 thf(func_def_26, type, collect: !>[X0: $tType]:(((X0 > $o) > set @ X0))).
% 0.20/0.31 thf(func_def_27, type, set_atLeast: !>[X0: $tType]:(((X0 > X0 > $o) > X0 > set @ X0))).
% 0.20/0.31 thf(func_def_28, type, set_atLeastAtMost: !>[X0: $tType]:(((X0 > X0 > $o) > X0 > X0 > set @ X0))).
% 0.20/0.31 thf(func_def_29, type, set_atLeastLessThan: !>[X0: $tType]:(((X0 > X0 > $o) > (X0 > X0 > $o) > X0 > X0 > set @ X0))).
% 0.20/0.31 thf(func_def_30, type, set_atMost: !>[X0: $tType]:(((X0 > X0 > $o) > X0 > set @ X0))).
% 0.20/0.31 thf(func_def_31, type, set_greaterThan: !>[X0: $tType]:(((X0 > X0 > $o) > X0 > set @ X0))).
% 0.20/0.31 thf(func_def_32, type, set_gr323396891AtMost: !>[X0: $tType]:(((X0 > X0 > $o) > (X0 > X0 > $o) > X0 > X0 > set @ X0))).
% 0.20/0.31 thf(func_def_33, type, set_gr1161524159ssThan: !>[X0: $tType]:(((X0 > X0 > $o) > X0 > X0 > set @ X0))).
% 0.20/0.31 thf(func_def_34, type, set_lessThan: !>[X0: $tType]:(((X0 > X0 > $o) > X0 > set @ X0))).
% 0.20/0.31 thf(func_def_35, type, member: !>[X0: $tType]:((X0 > set @ X0 > $o))).
% 0.20/0.31 thf(func_def_36, type, less: (a > a > $o)).
% 0.20/0.31 thf(func_def_37, type, less_eq: (a > a > $o)).
% 0.20/0.31 thf(func_def_38, type, thesis: $o).
% 0.20/0.31 thf(func_def_39, type, x: a).
% 0.20/0.31 thf(func_def_40, type, x2: a).
% 0.20/0.31 thf(func_def_41, type, xsa: coinductive_llist @ a).
% 0.20/0.31 thf(func_def_42, type, ysa: coinductive_llist @ a).
% 0.20/0.31 thf(func_def_46, type, vNOT: ($o > $o)).
% 0.20/0.31 thf(func_def_47, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.20/0.31 thf(func_def_48, type, vOR: ($o > $o > $o)).
% 0.20/0.31 thf(func_def_49, type, db1: !>[X0: $tType]:(X0)).
% 0.20/0.31 thf(func_def_50, type, db0: !>[X0: $tType]:(X0)).
% 0.20/0.31 thf(func_def_51, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.20/0.31 thf(func_def_52, type, vAND: ($o > $o > $o)).
% 0.20/0.31 thf(func_def_53, type, vPI: !>[X0: $tType]:(((X0 > $o) > $o))).
% 0.20/0.31 thf(func_def_54, type, vIMP: ($o > $o > $o)).
% 0.20/0.31 thf(func_def_55, type, vSIGMA: !>[X0: $tType]:(((X0 > $o) > $o))).
% 0.20/0.31 thf(func_def_56, type, db2: !>[X0: $tType]:(X0)).
% 0.20/0.31 thf(func_def_57, type, sP0: (a > a > a > $o)).
% 0.20/0.31 thf(func_def_58, type, sP1: (a > a > a > $o)).
% 0.20/0.31 thf(func_def_59, type, sP2: (a > a > a > $o)).
% 0.20/0.31 thf(func_def_60, type, sK3: ((a > a > $o) > a)).
% 0.20/0.31 thf(func_def_61, type, sK4: ((a > a > $o) > a)).
% 0.20/0.31 thf(func_def_62, type, sK5: ((a > a > $o) > a)).
% 0.20/0.31 thf(func_def_63, type, sK6: ((a > a > $o) > a)).
% 0.20/0.31 thf(func_def_64, type, sK7: a).
% 0.20/0.31 thf(func_def_65, type, sK8: !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > X0))).
% 0.20/0.31 thf(func_def_66, type, sK9: !>[X0: $tType, X1: $tType]:(((X1 > X0) > (X1 > X0) > X1))).
% 0.20/0.31 thf(func_def_67, type, sK10: ((a > $o) > (a > $o) > a)).
% 0.20/0.31 thf(func_def_68, type, sK11: (a > (a > $o) > a)).
% 0.20/0.31 thf(func_def_69, type, sK12: (a > (a > $o) > a)).
% 0.20/0.31 thf(func_def_70, type, sK13: (a > set @ a > a)).
% 0.20/0.31 thf(func_def_71, type, sK14: (a > set @ a > a)).
% 0.20/0.31 thf(func_def_72, type, sK15: !>[X0: $tType]:((coinductive_llist @ X0 > X0 > X0))).
% 0.20/0.31 thf(func_def_73, type, sK16: !>[X0: $tType]:((coinductive_llist @ X0 > X0 > coinductive_llist @ X0))).
% 0.20/0.31 thf(func_def_74, type, sK17: !>[X0: $tType]:((coinductive_llist @ X0 > X0 > coinductive_llist @ X0))).
% 0.20/0.31 thf(func_def_75, type, sK18: !>[X0: $tType]:(((coinductive_llist @ X0 > $o) > X0 > X0))).
% 0.20/0.31 thf(func_def_76, type, sK19: !>[X0: $tType]:(((coinductive_llist @ X0 > $o) > X0 > coinductive_llist @ X0))).
% 0.20/0.31 thf(func_def_77, type, sK20: !>[X0: $tType]:(((coinductive_llist @ X0 > $o) > X0 > coinductive_llist @ X0))).
% 0.20/0.31 thf(func_def_78, type, sK21: !>[X0: $tType]:(((coinductive_llist @ X0 > $o) > X0 > X0))).
% 0.20/0.31 thf(func_def_79, type, sK22: !>[X0: $tType]:(((coinductive_llist @ X0 > $o) > X0 > coinductive_llist @ X0))).
% 0.20/0.31 thf(func_def_80, type, sK23: !>[X0: $tType]:(((coinductive_llist @ X0 > $o) > X0 > coinductive_llist @ X0))).
% 0.20/0.31 thf(func_def_81, type, sK24: !>[X0: $tType]:((coinductive_llist @ X0 > X0 > X0))).
% 0.20/0.31 thf(func_def_82, type, sK25: !>[X0: $tType]:((coinductive_llist @ X0 > X0 > coinductive_llist @ X0))).
% 0.20/0.31 thf(func_def_83, type, sK26: !>[X0: $tType]:((coinductive_llist @ X0 > X0 > coinductive_llist @ X0))).
% 0.20/0.31 thf(func_def_84, type, sK27: !>[X0: $tType]:(((X0 > coinductive_llist @ X0 > $o) > X0))).
% 0.20/0.31 thf(func_def_85, type, sK28: !>[X0: $tType]:(((X0 > coinductive_llist @ X0 > $o) > coinductive_llist @ X0))).
% 0.20/0.31 thf(func_def_86, type, sK29: !>[X0: $tType]:(((X0 > coinductive_llist @ X0 > $o) > X0))).
% 0.20/0.31 thf(func_def_87, type, sK30: !>[X0: $tType]:(((X0 > coinductive_llist @ X0 > $o) > X0))).
% 0.20/0.31 thf(func_def_88, type, sK31: !>[X0: $tType]:(((X0 > coinductive_llist @ X0 > $o) > coinductive_llist @ X0))).
% 0.20/0.31 thf(func_def_89, type, sK32: !>[X0: $tType]:(((a > X0) > a))).
% 0.20/0.31 thf(func_def_90, type, sK33: !>[X0: $tType]:(((a > X0) > a))).
% 0.20/0.31 thf(func_def_91, type, sK34: !>[X0: $tType]:(((a > X0) > a))).
% 0.20/0.31 thf(func_def_92, type, sK35: !>[X0: $tType]:(((a > X0) > a))).
% 0.20/0.31 thf(func_def_93, type, sK36: !>[X0: $tType]:(((X0 > X0 > $o) > X0))).
% 0.20/0.31 thf(func_def_94, type, sK37: !>[X0: $tType]:(((X0 > X0 > $o) > X0))).
% 0.20/0.31 thf(func_def_95, type, sK38: !>[X0: $tType]:((set @ X0 > set @ X0 > X0))).
% 0.20/0.31 thf(func_def_96, type, sK39: !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > X0))).
% 0.20/0.31 thf(func_def_97, type, sK40: !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > set @ X0 > X0))).
% 0.20/0.31 thf(func_def_98, type, sK41: !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > X0))).
% 0.20/0.31 thf(func_def_99, type, sK42: !>[X0: $tType]:(((a > X0) > a))).
% 0.20/0.31 thf(func_def_100, type, sK43: !>[X0: $tType]:(((a > X0) > a))).
% 0.20/0.31 thf(func_def_101, type, sK44: !>[X0: $tType]:(((a > X0) > a))).
% 0.20/0.31 thf(func_def_102, type, sK45: !>[X0: $tType]:(((a > X0) > a))).
% 0.20/0.31 thf(func_def_103, type, sK46: (set @ a > a)).
% 0.20/0.31 thf(func_def_104, type, sK47: (a > set @ a > a)).
% 0.20/0.31 thf(func_def_105, type, sK48: (set @ a > a)).
% 0.20/0.31 thf(func_def_106, type, sK49: (a > set @ a > a)).
% 0.20/0.31 thf(func_def_107, type, sK50: (coinductive_llist @ a > a > a)).
% 0.20/0.31 thf(f44,axiom,(
% 0.20/0.31 ? [X0 : a] : ((less_eq @ x @ X0) & (member @ a @ X0 @ (coinductive_lset @ a @ ysa)))),
% 0.20/0.31 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_43_step_Oprems_I3_J)).
% 0.20/0.31 thf(f261,axiom,(
% 0.20/0.31 ! [X0 : a] : ((member @ a @ X0 @ (coinductive_lset @ a @ ysa)) => ((less_eq @ x @ X0) => thesis))),
% 0.20/0.31 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0)).
% 0.20/0.31 thf(f262,conjecture,(
% 0.20/0.31 thesis),
% 0.20/0.31 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_1)).
% 0.20/0.31 thf(f263,negated_conjecture,(
% 0.20/0.31 ~thesis),
% 0.20/0.31 inference(negated_conjecture,[status(cth)],[f262])).
% 0.20/0.31 thf(f348,plain,(
% 0.20/0.31 ? [X0 : a] : ((less_eq @ x @ X0) & (member @ a @ X0 @ (coinductive_lset @ a @ ysa)))),
% 0.20/0.31 inference(rectify,[],[f44])).
% 0.20/0.31 thf(f349,plain,(
% 0.20/0.31 ? [X0 : a] : ((((less_eq @ x @ X0)) = $true) & (((member @ a @ X0 @ (coinductive_lset @ a @ ysa))) = $true))),
% 0.20/0.31 inference(fool_elimination,[],[f348])).
% 0.20/0.31 thf(f710,plain,(
% 0.20/0.31 ! [X0 : a] : ((member @ a @ X0 @ (coinductive_lset @ a @ ysa)) => ((less_eq @ x @ X0) => thesis))),
% 0.20/0.31 inference(rectify,[],[f261])).
% 0.20/0.31 thf(f711,plain,(
% 0.20/0.31 ! [X0 : a] : ((((member @ a @ X0 @ (coinductive_lset @ a @ ysa))) = $true) => ((((less_eq @ x @ X0)) = $true) => (thesis = $true)))),
% 0.20/0.31 inference(fool_elimination,[],[f710])).
% 0.20/0.31 thf(f712,plain,(
% 0.20/0.31 ~thesis),
% 0.20/0.31 inference(rectify,[],[f263])).
% 0.20/0.31 thf(f713,plain,(
% 0.20/0.31 ~ (thesis = $true)),
% 0.20/0.31 inference(fool_elimination,[],[f712])).
% 0.20/0.31 thf(f746,plain,(
% 0.20/0.31 (thesis != $true)),
% 0.20/0.31 inference(flattening,[],[f713])).
% 0.20/0.31 thf(f953,plain,(
% 0.20/0.31 ! [X0 : a] : (((thesis = $true) | (((less_eq @ x @ X0)) != $true)) | (((member @ a @ X0 @ (coinductive_lset @ a @ ysa))) != $true))),
% 0.20/0.31 inference(ennf_transformation,[],[f711])).
% 0.20/0.31 thf(f954,plain,(
% 0.20/0.31 ! [X0 : a] : ((thesis = $true) | (((less_eq @ x @ X0)) != $true) | (((member @ a @ X0 @ (coinductive_lset @ a @ ysa))) != $true))),
% 0.20/0.31 inference(flattening,[],[f953])).
% 0.20/0.31 thf(f967,plain,(
% 0.20/0.31 ($true = ((less_eq @ x @ sK7))) & ($true = ((member @ a @ sK7 @ (coinductive_lset @ a @ ysa))))),
% 0.20/0.31 inference(skolemize,[status(esa),new_symbols(skolem,[sK7]),skolemize(X0,sK7)],[f349])).
% 0.20/0.31 thf(f1050,plain,(
% 0.20/0.31 ($true = ((member @ a @ sK7 @ (coinductive_lset @ a @ ysa))))),
% 0.20/0.31 inference(cnf_transformation,[],[f967])).
% 0.20/0.31 thf(f1051,plain,(
% 0.20/0.31 ($true = ((less_eq @ x @ sK7)))),
% 0.20/0.31 inference(cnf_transformation,[],[f967])).
% 0.20/0.31 thf(f1304,plain,(
% 0.20/0.31 ( ! [X0 : a] : ((thesis = $true) | (((less_eq @ x @ X0)) != $true) | (((member @ a @ X0 @ (coinductive_lset @ a @ ysa))) != $true)) )),
% 0.20/0.31 inference(cnf_transformation,[],[f954])).
% 0.20/0.31 thf(f1305,plain,(
% 0.20/0.31 (thesis != $true)),
% 0.20/0.31 inference(cnf_transformation,[],[f746])).
% 0.20/0.31 thf(f1711,plain,(
% 0.20/0.31 ( ! [X0 : a] : ((((member @ a @ X0 @ (coinductive_lset @ a @ ysa))) != $true) | (((less_eq @ x @ X0)) != $true)) )),
% 0.20/0.31 inference(forward_subsumption_resolution,[],[f1304,f1305])).
% 0.20/0.31 thf(f1760,plain,(
% 0.20/0.31 ($true != $true) | ($true != ((less_eq @ x @ sK7)))),
% 0.20/0.31 inference(constrained_superposition,[],[f1711,f1050])).
% 0.20/0.31 thf(f1761,plain,(
% 0.20/0.31 ($true != ((less_eq @ x @ sK7)))),
% 0.20/0.31 inference(trivial_inequality_removal,[],[f1760])).
% 0.20/0.31 thf(f1764,plain,(
% 0.20/0.31 $false),
% 0.20/0.31 inference(forward_subsumption_resolution,[],[f1761,f1051])).
% 0.20/0.31 % SZS output end Proof for theBenchmark
% 0.20/0.31 % (2006758)------------------------------
% 0.20/0.31 % (2006758)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.31 % (2006758)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.31 % (2006758)CaDiCaL version: 2.1.3
% 0.20/0.31 % (2006758)Termination reason: Refutation
% 0.20/0.31 % (2006758)Time elapsed: 0.029 s
% 0.20/0.31 % (2006758)Peak memory usage: 13 MB
% 0.20/0.31 % (2006758)Instructions burned: 117 (million)
% 0.20/0.31 % (2006749)Success in time 0.079 s
% 0.20/0.31 % Vampire exiting
%------------------------------------------------------------------------------