%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYO038^1.003.003 : TPTP v9.3.1. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 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 : Wed Sep 30 08:48:46 AM UTC 2026
% Result : Theorem 0.11s 0.30s
% Output : Refutation 0.11s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO038^1.003.003 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.19 % Computer : n014.cluster.edu
% 0.11/0.19 % Model : x86_64 x86_64
% 0.11/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.19 % Memory : 8046.5625MB
% 0.11/0.19 % OS : Linux 6.8.0-71-generic
% 0.11/0.19 % CPULimit : 300
% 0.11/0.19 % WCLimit : 300
% 0.11/0.19 % DateTime : Tue Sep 29 16:23:15 UTC 2026
% 0.11/0.20 % CPUTime :
% 0.11/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.23 Running first-order model finding
% 0.11/0.23 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.30 % (2873310)Will run a generic schedule for satisfiability detection.
% 0.11/0.30 % (2873317)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1490058760:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.11/0.30 % (2873316)% WARNING: option uhcvi not known.
% 0.11/0.30 % (2873316)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1709326575:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.11/0.30 % (2873315)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3526517112_2999 on theBenchmark for (2999ds/0Mi)
% 0.11/0.30 % (2873318)dis+10_1_sil=32000:sp=arity:random_seed=4036022691:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.11/0.30 % (2873316)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.11/0.30 % (2873319)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1635812028:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.11/0.30 % (2873316)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.11/0.30 % Exception at run slice level
% 0.11/0.30 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.11/0.30 % (2873321)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=352605407:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.11/0.30 % (2873319)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.11/0.30 % (2873320)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1942302145:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.11/0.30 % (2873320) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2873310-2873320"...
% 0.11/0.30 % (2873320)...printing done.
% 0.11/0.30 % (2873320)Refutation found. Thanks to Tanya!
% 0.11/0.30 % SZS status Theorem for theBenchmark
% 0.11/0.30 % SZS output start Proof for theBenchmark
% 0.11/0.30 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.11/0.30 thf(func_def_1, type, s: ($i > $i)).
% 0.11/0.30 thf(func_def_2, type, f: ($i > $i > $i)).
% 0.11/0.30 thf(func_def_3, type, d: ($i > $o)).
% 0.11/0.30 thf(f1,axiom,(
% 0.11/0.30 ! [X0 : $i] : (((f @ X0 @ one)) = ((s @ one)))),
% 0.11/0.30 file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax1)).
% 0.11/0.30 thf(f2,axiom,(
% 0.11/0.30 ! [X0 : $i] : (((f @ one @ (s @ X0))) = ((s @ (s @ (f @ one @ X0)))))),
% 0.11/0.30 file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax2)).
% 0.11/0.30 thf(f3,axiom,(
% 0.11/0.30 ! [X0 : $i,X1 : $i] : (((f @ (s @ X0) @ (s @ X1))) = ((f @ X0 @ (f @ (s @ X0) @ X1))))),
% 0.11/0.30 file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax3)).
% 0.11/0.30 thf(f4,axiom,(
% 0.11/0.30 (d @ one)),
% 0.11/0.30 file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax4)).
% 0.11/0.30 thf(f5,axiom,(
% 0.11/0.30 ! [X0 : $i] : ((d @ X0) => (d @ (s @ X0)))),
% 0.11/0.30 file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax5)).
% 0.11/0.30 thf(f6,conjecture,(
% 0.11/0.30 (d @ (f @ (s @ (s @ one)) @ (s @ (s @ one))))),
% 0.11/0.30 file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj)).
% 0.11/0.30 thf(f7,negated_conjecture,(
% 0.11/0.30 ~(d @ (f @ (s @ (s @ one)) @ (s @ (s @ one))))),
% 0.11/0.30 inference(negated_conjecture,[status(cth)],[f6])).
% 0.11/0.30 thf(f8,plain,(
% 0.11/0.30 (d @ one)),
% 0.11/0.30 inference(rectify,[],[f4])).
% 0.11/0.30 thf(f9,plain,(
% 0.11/0.30 (((d @ one)) = $true)),
% 0.11/0.30 inference(fool_elimination,[],[f8])).
% 0.11/0.30 thf(f10,plain,(
% 0.11/0.30 ! [X0 : $i] : ((d @ X0) => (d @ (s @ X0)))),
% 0.11/0.30 inference(rectify,[],[f5])).
% 0.11/0.30 thf(f11,plain,(
% 0.11/0.30 ! [X0 : $i] : ((((d @ X0)) = $true) => (((d @ (s @ X0))) = $true))),
% 0.11/0.30 inference(fool_elimination,[],[f10])).
% 0.11/0.30 thf(f12,plain,(
% 0.11/0.30 ~(d @ (f @ (s @ (s @ one)) @ (s @ (s @ one))))),
% 0.11/0.30 inference(rectify,[],[f7])).
% 0.11/0.30 thf(f13,plain,(
% 0.11/0.30 ~ (((d @ (f @ (s @ (s @ one)) @ (s @ (s @ one))))) = $true)),
% 0.11/0.30 inference(fool_elimination,[],[f12])).
% 0.11/0.30 thf(f14,plain,(
% 0.11/0.30 (((d @ (f @ (s @ (s @ one)) @ (s @ (s @ one))))) != $true)),
% 0.11/0.30 inference(flattening,[],[f13])).
% 0.11/0.30 thf(f15,plain,(
% 0.11/0.30 ! [X0 : $i] : ((((d @ (s @ X0))) = $true) | (((d @ X0)) != $true))),
% 0.11/0.30 inference(ennf_transformation,[],[f11])).
% 0.11/0.30 thf(f16,plain,(
% 0.11/0.30 ( ! [X0 : $i] : ((((f @ X0 @ one)) = ((s @ one)))) )),
% 0.11/0.30 inference(cnf_transformation,[],[f1])).
% 0.11/0.30 thf(f17,plain,(
% 0.11/0.30 ( ! [X0 : $i] : ((((f @ one @ (s @ X0))) = ((s @ (s @ (f @ one @ X0)))))) )),
% 0.11/0.30 inference(cnf_transformation,[],[f2])).
% 0.11/0.30 thf(f18,plain,(
% 0.11/0.30 ( ! [X0 : $i,X1 : $i] : ((((f @ (s @ X0) @ (s @ X1))) = ((f @ X0 @ (f @ (s @ X0) @ X1))))) )),
% 0.11/0.30 inference(cnf_transformation,[],[f3])).
% 0.11/0.30 thf(f19,plain,(
% 0.11/0.30 (((d @ one)) = $true)),
% 0.11/0.30 inference(cnf_transformation,[],[f9])).
% 0.11/0.30 thf(f20,plain,(
% 0.11/0.30 ( ! [X0 : $i] : ((((d @ X0)) != $true) | (((d @ (s @ X0))) = $true)) )),
% 0.11/0.30 inference(cnf_transformation,[],[f15])).
% 0.11/0.30 thf(f21,plain,(
% 0.11/0.30 (((d @ (f @ (s @ (s @ one)) @ (s @ (s @ one))))) != $true)),
% 0.11/0.30 inference(cnf_transformation,[],[f14])).
% 0.11/0.30 thf(f23,definition,(
% 0.11/0.30 ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 0.11/0.30 introduced(theory,[fool_exhaustiveness_axiom])).
% 0.11/0.30 thf(f26,plain,(
% 0.11/0.30 ($true != $true) | (((d @ (f @ (s @ (s @ one)) @ (s @ (s @ one))))) = $false)),
% 0.11/0.30 inference(constrained_superposition,[],[f21,f23])).
% 0.11/0.30 thf(f28,plain,(
% 0.11/0.30 (((d @ (f @ (s @ (s @ one)) @ (s @ (s @ one))))) = $false)),
% 0.11/0.30 inference(trivial_inequality_removal,[],[f26])).
% 0.11/0.30 thf(f33,plain,(
% 0.11/0.30 ($false = ((d @ (f @ (s @ one) @ (f @ (s @ (s @ one)) @ (s @ one))))))),
% 0.11/0.30 inference(forward_demodulation,[],[f28,f18])).
% 0.11/0.30 thf(f34,plain,(
% 0.11/0.30 ($false = ((d @ (f @ (s @ one) @ (f @ (s @ one) @ (f @ (s @ (s @ one)) @ one))))))),
% 0.11/0.30 inference(forward_demodulation,[],[f33,f18])).
% 0.11/0.30 thf(f35,plain,(
% 0.11/0.30 ($false = ((d @ (f @ (s @ one) @ (f @ (s @ one) @ (s @ one))))))),
% 0.11/0.30 inference(forward_demodulation,[],[f34,f16])).
% 0.11/0.30 thf(f36,plain,(
% 0.11/0.30 ($false = ((d @ (f @ (s @ one) @ (f @ one @ (f @ (s @ one) @ one))))))),
% 0.11/0.30 inference(forward_demodulation,[],[f35,f18])).
% 0.11/0.30 thf(f37,plain,(
% 0.11/0.30 ($false = ((d @ (f @ (s @ one) @ (f @ one @ (s @ one))))))),
% 0.11/0.30 inference(forward_demodulation,[],[f36,f16])).
% 0.11/0.30 thf(f38,plain,(
% 0.11/0.30 ($false = ((d @ (f @ (s @ one) @ (s @ (s @ (f @ one @ one)))))))),
% 0.11/0.30 inference(forward_demodulation,[],[f37,f17])).
% 0.11/0.30 thf(f39,plain,(
% 0.11/0.30 ($false = ((d @ (f @ one @ (f @ (s @ one) @ (s @ (f @ one @ one)))))))),
% 0.11/0.30 inference(forward_demodulation,[],[f38,f18])).
% 0.11/0.30 thf(f40,plain,(
% 0.11/0.30 ($false = ((d @ (f @ one @ (f @ one @ (f @ (s @ one) @ (f @ one @ one)))))))),
% 0.11/0.30 inference(forward_demodulation,[],[f39,f18])).
% 0.11/0.30 thf(f41,plain,(
% 0.11/0.30 ($false = ((d @ (f @ one @ (f @ one @ (f @ (s @ one) @ (s @ one)))))))),
% 0.11/0.30 inference(forward_demodulation,[],[f40,f16])).
% 0.11/0.30 thf(f42,plain,(
% 0.11/0.30 ($false = ((d @ (f @ one @ (f @ one @ (f @ one @ (f @ (s @ one) @ one)))))))),
% 0.11/0.30 inference(forward_demodulation,[],[f41,f18])).
% 0.11/0.30 thf(f43,plain,(
% 0.11/0.30 ($false = ((d @ (f @ one @ (f @ one @ (f @ one @ (s @ one)))))))),
% 0.11/0.30 inference(forward_demodulation,[],[f42,f16])).
% 0.11/0.30 thf(f44,plain,(
% 0.11/0.30 ($false = ((d @ (f @ one @ (f @ one @ (s @ (s @ (f @ one @ one))))))))),
% 0.11/0.30 inference(forward_demodulation,[],[f43,f17])).
% 0.11/0.30 thf(f45,plain,(
% 0.11/0.30 ($false = ((d @ (f @ one @ (s @ (s @ (f @ one @ (s @ (f @ one @ one)))))))))),
% 0.11/0.30 inference(forward_demodulation,[],[f44,f17])).
% 0.11/0.30 thf(f46,plain,(
% 0.11/0.30 ($false = ((d @ (s @ (s @ (f @ one @ (s @ (f @ one @ (s @ (f @ one @ one))))))))))),
% 0.11/0.30 inference(forward_demodulation,[],[f45,f17])).
% 0.11/0.30 thf(f47,plain,(
% 0.11/0.30 ($false = ((d @ (s @ (s @ (s @ (s @ (f @ one @ (f @ one @ (s @ (f @ one @ one)))))))))))),
% 0.11/0.30 inference(forward_demodulation,[],[f46,f17])).
% 0.11/0.30 thf(f48,plain,(
% 0.11/0.30 ($false = ((d @ (s @ (s @ (s @ (s @ (f @ one @ (s @ (s @ (f @ one @ (f @ one @ one))))))))))))),
% 0.11/0.30 inference(forward_demodulation,[],[f47,f17])).
% 0.11/0.30 thf(f49,plain,(
% 0.11/0.30 ($false = ((d @ (s @ (s @ (s @ (s @ (s @ (s @ (f @ one @ (s @ (f @ one @ (f @ one @ one)))))))))))))),
% 0.11/0.30 inference(forward_demodulation,[],[f48,f17])).
% 0.11/0.30 thf(f50,plain,(
% 0.11/0.30 ($false = ((d @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (f @ one @ (f @ one @ (f @ one @ one))))))))))))))),
% 0.11/0.30 inference(forward_demodulation,[],[f49,f17])).
% 0.11/0.30 thf(f51,plain,(
% 0.11/0.30 ($false = ((d @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (f @ one @ (f @ one @ (s @ one))))))))))))))),
% 0.11/0.30 inference(forward_demodulation,[],[f50,f16])).
% 0.11/0.30 thf(f52,plain,(
% 0.11/0.30 ($false = ((d @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (f @ one @ (s @ (s @ (f @ one @ one)))))))))))))))),
% 0.11/0.30 inference(forward_demodulation,[],[f51,f17])).
% 0.11/0.30 thf(f53,plain,(
% 0.11/0.30 ($false = ((d @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (f @ one @ (s @ (f @ one @ one))))))))))))))))),
% 0.11/0.30 inference(forward_demodulation,[],[f52,f17])).
% 0.11/0.30 thf(f54,plain,(
% 0.11/0.30 ($false = ((d @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (f @ one @ (f @ one @ one)))))))))))))))))),
% 0.11/0.30 inference(forward_demodulation,[],[f53,f17])).
% 0.11/0.30 thf(f55,plain,(
% 0.11/0.30 ($false = ((d @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (f @ one @ (s @ one)))))))))))))))))),
% 0.11/0.30 inference(forward_demodulation,[],[f54,f16])).
% 0.11/0.30 thf(f56,plain,(
% 0.11/0.30 ($false = ((d @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (f @ one @ one))))))))))))))))))),
% 0.11/0.30 inference(forward_demodulation,[],[f55,f17])).
% 0.11/0.30 thf(f57,plain,(
% 0.11/0.30 ($false = ((d @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ one))))))))))))))))))),
% 0.11/0.30 inference(forward_demodulation,[],[f56,f16])).
% 0.11/0.30 thf(f60,plain,(
% 0.11/0.30 ( ! [X0 : $i] : (($true != $true) | (((d @ (s @ X0))) = $true) | (((d @ X0)) = $false)) )),
% 0.11/0.30 inference(constrained_superposition,[],[f20,f23])).
% 0.11/0.30 thf(f61,plain,(
% 0.11/0.30 ($true != $true) | ($true = ((d @ (s @ one))))),
% 0.11/0.30 inference(constrained_superposition,[],[f20,f19])).
% 0.11/0.30 thf(f63,plain,(
% 0.11/0.30 ($true = ((d @ (s @ one))))),
% 0.11/0.30 inference(trivial_inequality_removal,[],[f61])).
% 0.11/0.30 thf(f64,plain,(
% 0.11/0.30 ( ! [X0 : $i] : ((((d @ (s @ X0))) = $true) | (((d @ X0)) = $false)) )),
% 0.11/0.30 inference(trivial_inequality_removal,[],[f60])).
% 0.11/0.30 thf(f65,plain,(
% 0.11/0.30 ($true != $true) | ($true = ((d @ (s @ (s @ one)))))),
% 0.11/0.30 inference(constrained_superposition,[],[f20,f63])).
% 0.11/0.30 thf(f66,plain,(
% 0.11/0.30 ($true = ((d @ (s @ (s @ one)))))),
% 0.11/0.30 inference(trivial_inequality_removal,[],[f65])).
% 0.11/0.30 thf(f96,plain,(
% 0.11/0.30 ($true = $false) | ($false = ((d @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ one)))))))))))))))))),
% 0.11/0.30 inference(constrained_superposition,[],[f57,f64])).
% 0.11/0.30 thf(f97,plain,(
% 0.11/0.30 ( ! [X0 : $i] : (($true != $true) | ($true = ((d @ (s @ (s @ X0))))) | (((d @ X0)) = $false)) )),
% 0.11/0.30 inference(constrained_superposition,[],[f20,f64])).
% 0.11/0.30 thf(f98,plain,(
% 0.11/0.30 ( ! [X0 : $i] : (($true = ((d @ (s @ (s @ X0))))) | (((d @ X0)) = $false)) )),
% 0.11/0.30 inference(trivial_inequality_removal,[],[f97])).
% 0.11/0.30 thf(f99,plain,(
% 0.11/0.30 ($false = ((d @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ one)))))))))))))))))),
% 0.11/0.30 inference(trivial_inequality_removal,[],[f96])).
% 0.11/0.30 thf(f111,plain,(
% 0.11/0.30 ($true = $false) | ($false = ((d @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ one)))))))))))))))),
% 0.11/0.30 inference(constrained_superposition,[],[f99,f98])).
% 0.11/0.30 thf(f112,plain,(
% 0.11/0.30 ( ! [X0 : $i] : (($true != $true) | ($true = ((d @ (s @ (s @ (s @ X0)))))) | (((d @ X0)) = $false)) )),
% 0.11/0.30 inference(constrained_superposition,[],[f20,f98])).
% 0.11/0.30 thf(f113,plain,(
% 0.11/0.30 ( ! [X0 : $i] : (($true = ((d @ (s @ (s @ (s @ X0)))))) | (((d @ X0)) = $false)) )),
% 0.11/0.30 inference(trivial_inequality_removal,[],[f112])).
% 0.11/0.30 thf(f114,plain,(
% 0.11/0.30 ($false = ((d @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ one)))))))))))))))),
% 0.11/0.30 inference(trivial_inequality_removal,[],[f111])).
% 0.11/0.30 thf(f121,plain,(
% 0.11/0.30 ($true = $false) | ($false = ((d @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ one)))))))))))))),
% 0.11/0.30 inference(constrained_superposition,[],[f98,f114])).
% 0.11/0.30 thf(f125,plain,(
% 0.11/0.30 ($false = ((d @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ one)))))))))))))),
% 0.11/0.30 inference(trivial_inequality_removal,[],[f121])).
% 0.11/0.30 thf(f143,plain,(
% 0.11/0.30 ($true = $false) | ($false = ((d @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ one)))))))))))),
% 0.11/0.30 inference(constrained_superposition,[],[f98,f125])).
% 0.11/0.30 thf(f147,plain,(
% 0.11/0.30 ($false = ((d @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ (s @ one)))))))))))),
% 0.11/0.30 inference(trivial_inequality_removal,[],[f143])).
% 0.11/0.30 thf(f175,plain,(
% 0.11/0.30 ($true = $false) | ($false = ((d @ (s @ (s @ (s @ (s @ (s @ one))))))))),
% 0.11/0.30 inference(constrained_superposition,[],[f147,f113])).
% 0.11/0.30 thf(f178,plain,(
% 0.11/0.30 ($false = ((d @ (s @ (s @ (s @ (s @ (s @ one))))))))),
% 0.11/0.30 inference(trivial_inequality_removal,[],[f175])).
% 0.11/0.30 thf(f194,plain,(
% 0.11/0.30 ($true = $false) | ($false = ((d @ (s @ (s @ one)))))),
% 0.11/0.30 inference(constrained_superposition,[],[f113,f178])).
% 0.11/0.30 thf(f200,plain,(
% 0.11/0.30 ($false = ((d @ (s @ (s @ one)))))),
% 0.11/0.30 inference(trivial_inequality_removal,[],[f194])).
% 0.11/0.30 thf(f224,plain,(
% 0.11/0.30 ($true = $false)),
% 0.11/0.30 inference(constrained_superposition,[],[f66,f200])).
% 0.11/0.30 thf(f230,plain,(
% 0.11/0.30 $false),
% 0.11/0.30 inference(trivial_inequality_removal,[],[f224])).
% 0.11/0.30 % SZS output end Proof for theBenchmark
% 0.11/0.30 % (2873320)------------------------------
% 0.11/0.30 % (2873320)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.30 % (2873320)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.30 % (2873320)CaDiCaL version: 2.1.3
% 0.11/0.30 % (2873320)Termination reason: Refutation
% 0.11/0.30 % (2873320)Time elapsed: 0.010 s
% 0.11/0.30 % (2873320)Peak memory usage: 12 MB
% 0.11/0.30 % (2873320)Instructions burned: 19 (million)
% 0.11/0.30 % (2873310)Success in time 0.06 s
% 0.11/0.30 % Vampire exiting
%------------------------------------------------------------------------------