%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM765^1 : TPTP v9.3.1. Released v3.7.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:19:29 AM UTC 2026
% Result : Theorem 0.20s 0.28s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM765^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.18 % Computer : n014.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Tue Sep 29 12:53:30 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.21 Running first-order model finding
% 0.08/0.21 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.20/0.28 % (2604921)Will run a generic schedule for satisfiability detection.
% 0.20/0.28 % (2604926)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=547393462_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.28 % Exception at run slice level
% 0.20/0.28 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.28 % (2604927)% WARNING: option uhcvi not known.
% 0.20/0.28 % (2604927)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=770872251:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.28 % (2604928)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1593933189:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.28 % (2604929)dis+10_1_sil=32000:sp=arity:random_seed=22434025:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.28 % (2604930)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=545725062:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.28 % (2604927)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.28 % (2604930)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.28 % (2604927)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.20/0.28 % (2604932)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1889466915:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.28 % (2604934)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3131758404:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.20/0.28 % (2604930) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2604921-2604930"...
% 0.20/0.28 % Exception at run slice level
% 0.20/0.28 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.28 % (2604930)...printing done.
% 0.20/0.28 % (2604929) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2604921-2604929"...
% 0.20/0.28 % (2604930)Refutation found. Thanks to Tanya!
% 0.20/0.28 % SZS status Theorem for theBenchmark
% 0.20/0.28 % SZS output start Proof for theBenchmark
% 0.20/0.28 thf(type_def_5, type, frac: $tType).
% 0.20/0.28 thf(type_def_6, type, sTfun: ($tType * $tType) > $tType).
% 0.20/0.28 thf(func_def_0, type, x: frac).
% 0.20/0.28 thf(func_def_1, type, y: frac).
% 0.20/0.28 thf(func_def_2, type, z: frac).
% 0.20/0.28 thf(func_def_3, type, u: frac).
% 0.20/0.28 thf(func_def_4, type, moref: (frac > frac > $o)).
% 0.20/0.28 thf(func_def_5, type, eq: (frac > frac > $o)).
% 0.20/0.28 thf(func_def_7, type, pf: (frac > frac > frac)).
% 0.20/0.28 thf(func_def_10, type, vNOT: ($o > $o)).
% 0.20/0.28 thf(f1,axiom,(
% 0.20/0.28 ~(moref @ x @ y) => (eq @ x @ y)),
% 0.20/0.28 file('/export/starexec/sandbox/benchmark/theBenchmark.p',m)).
% 0.20/0.28 thf(f2,axiom,(
% 0.20/0.28 ~(moref @ z @ u) => (eq @ z @ u)),
% 0.20/0.28 file('/export/starexec/sandbox/benchmark/theBenchmark.p',n)).
% 0.20/0.28 thf(f4,axiom,(
% 0.20/0.28 ! [X0 : frac,X1 : frac,X2 : frac,X3 : frac] : ((eq @ X0 @ X1) => ((eq @ X2 @ X3) => (eq @ (pf @ X0 @ X2) @ (pf @ X1 @ X3))))),
% 0.20/0.28 file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz56)).
% 0.20/0.28 thf(f5,axiom,(
% 0.20/0.28 ! [X0 : frac,X1 : frac,X2 : frac,X3 : frac] : ((moref @ X0 @ X1) => ((~(moref @ X2 @ X3) => (eq @ X2 @ X3)) => (moref @ (pf @ X0 @ X2) @ (pf @ X1 @ X3))))),
% 0.20/0.28 file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz65b)).
% 0.20/0.28 thf(f6,axiom,(
% 0.20/0.28 ! [X0 : frac,X1 : frac,X2 : frac,X3 : frac] : ((~(moref @ X0 @ X1) => (eq @ X0 @ X1)) => ((moref @ X2 @ X3) => (moref @ (pf @ X0 @ X2) @ (pf @ X1 @ X3))))),
% 0.20/0.28 file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz65a)).
% 0.20/0.28 thf(f7,conjecture,(
% 0.20/0.28 ~(moref @ (pf @ x @ z) @ (pf @ y @ u)) => (eq @ (pf @ x @ z) @ (pf @ y @ u))),
% 0.20/0.28 file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz66)).
% 0.20/0.28 thf(f8,negated_conjecture,(
% 0.20/0.28 ~(~(moref @ (pf @ x @ z) @ (pf @ y @ u)) => (eq @ (pf @ x @ z) @ (pf @ y @ u)))),
% 0.20/0.28 inference(negated_conjecture,[status(cth)],[f7])).
% 0.20/0.28 thf(f9,plain,(
% 0.20/0.28 ~(moref @ x @ y) => (eq @ x @ y)),
% 0.20/0.28 inference(rectify,[],[f1])).
% 0.20/0.28 thf(f10,plain,(
% 0.20/0.28 ~ (((moref @ x @ y)) = $true) => (((eq @ x @ y)) = $true)),
% 0.20/0.28 inference(fool_elimination,[],[f9])).
% 0.20/0.28 thf(f11,plain,(
% 0.20/0.28 ~(moref @ z @ u) => (eq @ z @ u)),
% 0.20/0.28 inference(rectify,[],[f2])).
% 0.20/0.28 thf(f12,plain,(
% 0.20/0.28 ~ (((moref @ z @ u)) = $true) => (((eq @ z @ u)) = $true)),
% 0.20/0.28 inference(fool_elimination,[],[f11])).
% 0.20/0.28 thf(f15,plain,(
% 0.20/0.28 ! [X0 : frac,X1 : frac,X2 : frac,X3 : frac] : ((eq @ X0 @ X1) => ((eq @ X2 @ X3) => (eq @ (pf @ X0 @ X2) @ (pf @ X1 @ X3))))),
% 0.20/0.28 inference(rectify,[],[f4])).
% 0.20/0.28 thf(f16,plain,(
% 0.20/0.28 ! [X0 : frac,X1 : frac,X2 : frac,X3 : frac] : ((((eq @ X0 @ X1)) = $true) => ((((eq @ X2 @ X3)) = $true) => (((eq @ (pf @ X0 @ X2) @ (pf @ X1 @ X3))) = $true)))),
% 0.20/0.28 inference(fool_elimination,[],[f15])).
% 0.20/0.28 thf(f17,plain,(
% 0.20/0.28 ! [X0 : frac,X1 : frac,X2 : frac,X3 : frac] : ((moref @ X0 @ X1) => ((~(moref @ X2 @ X3) => (eq @ X2 @ X3)) => (moref @ (pf @ X0 @ X2) @ (pf @ X1 @ X3))))),
% 0.20/0.28 inference(rectify,[],[f5])).
% 0.20/0.28 thf(f18,plain,(
% 0.20/0.28 ! [X0 : frac,X1 : frac,X2 : frac,X3 : frac] : ((((moref @ X0 @ X1)) = $true) => ((~ (((moref @ X2 @ X3)) = $true) => (((eq @ X2 @ X3)) = $true)) => (((moref @ (pf @ X0 @ X2) @ (pf @ X1 @ X3))) = $true)))),
% 0.20/0.28 inference(fool_elimination,[],[f17])).
% 0.20/0.28 thf(f19,plain,(
% 0.20/0.28 ! [X0 : frac,X1 : frac,X2 : frac,X3 : frac] : ((~(moref @ X0 @ X1) => (eq @ X0 @ X1)) => ((moref @ X2 @ X3) => (moref @ (pf @ X0 @ X2) @ (pf @ X1 @ X3))))),
% 0.20/0.28 inference(rectify,[],[f6])).
% 0.20/0.28 thf(f20,plain,(
% 0.20/0.28 ! [X0 : frac,X1 : frac,X2 : frac,X3 : frac] : ((~ (((moref @ X0 @ X1)) = $true) => (((eq @ X0 @ X1)) = $true)) => ((((moref @ X2 @ X3)) = $true) => (((moref @ (pf @ X0 @ X2) @ (pf @ X1 @ X3))) = $true)))),
% 0.20/0.28 inference(fool_elimination,[],[f19])).
% 0.20/0.28 thf(f21,plain,(
% 0.20/0.28 ~(~(moref @ (pf @ x @ z) @ (pf @ y @ u)) => (eq @ (pf @ x @ z) @ (pf @ y @ u)))),
% 0.20/0.28 inference(rectify,[],[f8])).
% 0.20/0.28 thf(f22,plain,(
% 0.20/0.28 ~(~ (((moref @ (pf @ x @ z) @ (pf @ y @ u))) = $true) => (((eq @ (pf @ x @ z) @ (pf @ y @ u))) = $true))),
% 0.20/0.28 inference(fool_elimination,[],[f21])).
% 0.20/0.28 thf(f23,plain,(
% 0.20/0.28 (((moref @ x @ y)) != $true) => (((eq @ x @ y)) = $true)),
% 0.20/0.28 inference(flattening,[],[f10])).
% 0.20/0.28 thf(f24,plain,(
% 0.20/0.28 (((moref @ z @ u)) != $true) => (((eq @ z @ u)) = $true)),
% 0.20/0.28 inference(flattening,[],[f12])).
% 0.20/0.28 thf(f26,plain,(
% 0.20/0.28 ! [X0 : frac,X1 : frac,X2 : frac,X3 : frac] : ((((moref @ X0 @ X1)) = $true) => (((((moref @ X2 @ X3)) != $true) => (((eq @ X2 @ X3)) = $true)) => (((moref @ (pf @ X0 @ X2) @ (pf @ X1 @ X3))) = $true)))),
% 0.20/0.28 inference(flattening,[],[f18])).
% 0.20/0.28 thf(f27,plain,(
% 0.20/0.28 ! [X0 : frac,X1 : frac,X2 : frac,X3 : frac] : (((((moref @ X0 @ X1)) != $true) => (((eq @ X0 @ X1)) = $true)) => ((((moref @ X2 @ X3)) = $true) => (((moref @ (pf @ X0 @ X2) @ (pf @ X1 @ X3))) = $true)))),
% 0.20/0.28 inference(flattening,[],[f20])).
% 0.20/0.28 thf(f28,plain,(
% 0.20/0.28 ~((((moref @ (pf @ x @ z) @ (pf @ y @ u))) != $true) => (((eq @ (pf @ x @ z) @ (pf @ y @ u))) = $true))),
% 0.20/0.28 inference(flattening,[],[f22])).
% 0.20/0.28 thf(f29,plain,(
% 0.20/0.28 (((eq @ x @ y)) = $true) | (((moref @ x @ y)) = $true)),
% 0.20/0.28 inference(ennf_transformation,[],[f23])).
% 0.20/0.28 thf(f30,plain,(
% 0.20/0.28 (((eq @ z @ u)) = $true) | (((moref @ z @ u)) = $true)),
% 0.20/0.28 inference(ennf_transformation,[],[f24])).
% 0.20/0.28 thf(f32,plain,(
% 0.20/0.28 ! [X0 : frac,X1 : frac,X2 : frac,X3 : frac] : (((((eq @ (pf @ X0 @ X2) @ (pf @ X1 @ X3))) = $true) | (((eq @ X2 @ X3)) != $true)) | (((eq @ X0 @ X1)) != $true))),
% 0.20/0.28 inference(ennf_transformation,[],[f16])).
% 0.20/0.28 thf(f33,plain,(
% 0.20/0.28 ! [X0 : frac,X1 : frac,X2 : frac,X3 : frac] : ((((eq @ (pf @ X0 @ X2) @ (pf @ X1 @ X3))) = $true) | (((eq @ X2 @ X3)) != $true) | (((eq @ X0 @ X1)) != $true))),
% 0.20/0.28 inference(flattening,[],[f32])).
% 0.20/0.28 thf(f34,plain,(
% 0.20/0.28 ! [X0 : frac,X1 : frac,X2 : frac,X3 : frac] : (((((moref @ (pf @ X0 @ X2) @ (pf @ X1 @ X3))) = $true) | ((((eq @ X2 @ X3)) != $true) & (((moref @ X2 @ X3)) != $true))) | (((moref @ X0 @ X1)) != $true))),
% 0.20/0.28 inference(ennf_transformation,[],[f26])).
% 0.20/0.28 thf(f35,plain,(
% 0.20/0.28 ! [X0 : frac,X1 : frac,X2 : frac,X3 : frac] : ((((moref @ (pf @ X0 @ X2) @ (pf @ X1 @ X3))) = $true) | ((((eq @ X2 @ X3)) != $true) & (((moref @ X2 @ X3)) != $true)) | (((moref @ X0 @ X1)) != $true))),
% 0.20/0.28 inference(flattening,[],[f34])).
% 0.20/0.28 thf(f36,plain,(
% 0.20/0.28 ! [X0 : frac,X1 : frac,X2 : frac,X3 : frac] : (((((moref @ (pf @ X0 @ X2) @ (pf @ X1 @ X3))) = $true) | (((moref @ X2 @ X3)) != $true)) | ((((eq @ X0 @ X1)) != $true) & (((moref @ X0 @ X1)) != $true)))),
% 0.20/0.28 inference(ennf_transformation,[],[f27])).
% 0.20/0.28 thf(f37,plain,(
% 0.20/0.28 ! [X0 : frac,X1 : frac,X2 : frac,X3 : frac] : ((((moref @ (pf @ X0 @ X2) @ (pf @ X1 @ X3))) = $true) | (((moref @ X2 @ X3)) != $true) | ((((eq @ X0 @ X1)) != $true) & (((moref @ X0 @ X1)) != $true)))),
% 0.20/0.28 inference(flattening,[],[f36])).
% 0.20/0.28 thf(f38,plain,(
% 0.20/0.28 (((eq @ (pf @ x @ z) @ (pf @ y @ u))) != $true) & (((moref @ (pf @ x @ z) @ (pf @ y @ u))) != $true)),
% 0.20/0.28 inference(ennf_transformation,[],[f28])).
% 0.20/0.28 thf(f39,plain,(
% 0.20/0.28 (((eq @ x @ y)) = $true) | (((moref @ x @ y)) = $true)),
% 0.20/0.28 inference(cnf_transformation,[],[f29])).
% 0.20/0.28 thf(f40,plain,(
% 0.20/0.28 (((eq @ z @ u)) = $true) | (((moref @ z @ u)) = $true)),
% 0.20/0.28 inference(cnf_transformation,[],[f30])).
% 0.20/0.28 thf(f42,plain,(
% 0.20/0.28 ( ! [X2 : frac,X3 : frac,X0 : frac,X1 : frac] : ((((eq @ (pf @ X0 @ X2) @ (pf @ X1 @ X3))) = $true) | (((eq @ X2 @ X3)) != $true) | (((eq @ X0 @ X1)) != $true)) )),
% 0.20/0.28 inference(cnf_transformation,[],[f33])).
% 0.20/0.28 thf(f44,plain,(
% 0.20/0.28 ( ! [X2 : frac,X3 : frac,X0 : frac,X1 : frac] : ((((moref @ (pf @ X0 @ X2) @ (pf @ X1 @ X3))) = $true) | (((eq @ X2 @ X3)) != $true) | (((moref @ X0 @ X1)) != $true)) )),
% 0.20/0.28 inference(cnf_transformation,[],[f35])).
% 0.20/0.28 thf(f45,plain,(
% 0.20/0.28 ( ! [X2 : frac,X3 : frac,X0 : frac,X1 : frac] : ((((moref @ (pf @ X0 @ X2) @ (pf @ X1 @ X3))) = $true) | (((moref @ X2 @ X3)) != $true) | (((moref @ X0 @ X1)) != $true)) )),
% 0.20/0.28 inference(cnf_transformation,[],[f37])).
% 0.20/0.28 thf(f46,plain,(
% 0.20/0.28 ( ! [X2 : frac,X3 : frac,X0 : frac,X1 : frac] : ((((moref @ (pf @ X0 @ X2) @ (pf @ X1 @ X3))) = $true) | (((moref @ X2 @ X3)) != $true) | (((eq @ X0 @ X1)) != $true)) )),
% 0.20/0.28 inference(cnf_transformation,[],[f37])).
% 0.20/0.28 thf(f47,plain,(
% 0.20/0.28 (((moref @ (pf @ x @ z) @ (pf @ y @ u))) != $true)),
% 0.20/0.28 inference(cnf_transformation,[],[f38])).
% 0.20/0.28 thf(f48,plain,(
% 0.20/0.28 (((eq @ (pf @ x @ z) @ (pf @ y @ u))) != $true)),
% 0.20/0.28 inference(cnf_transformation,[],[f38])).
% 0.20/0.28 thf(f50,definition,(
% 0.20/0.28 ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 0.20/0.28 introduced(theory,[fool_exhaustiveness_axiom])).
% 0.20/0.28 thf(f53,definition,(
% 0.20/0.28 spl0_1 <=> (((moref @ z @ u)) = $true)),
% 0.20/0.28 introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition])).
% 0.20/0.28 thf(f55,plain,(
% 0.20/0.28 (((moref @ z @ u)) = $true) | ~spl0_1),
% 0.20/0.28 inference(avatar_component_clause,[],[f53])).
% 0.20/0.28 thf(f57,definition,(
% 0.20/0.28 spl0_2 <=> (((eq @ z @ u)) = $true)),
% 0.20/0.28 introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition])).
% 0.20/0.28 thf(f59,plain,(
% 0.20/0.28 (((eq @ z @ u)) = $true) | ~spl0_2),
% 0.20/0.28 inference(avatar_component_clause,[],[f57])).
% 0.20/0.28 thf(f60,plain,(
% 0.20/0.28 spl0_1 | spl0_2),
% 0.20/0.28 inference(avatar_split_clause,[],[f40,f57,f53])).
% 0.20/0.28 thf(f62,definition,(
% 0.20/0.28 spl0_3 <=> (((moref @ x @ y)) = $true)),
% 0.20/0.28 introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition])).
% 0.20/0.28 thf(f64,plain,(
% 0.20/0.28 (((moref @ x @ y)) = $true) | ~spl0_3),
% 0.20/0.28 inference(avatar_component_clause,[],[f62])).
% 0.20/0.28 thf(f66,definition,(
% 0.20/0.28 spl0_4 <=> (((eq @ x @ y)) = $true)),
% 0.20/0.28 introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition])).
% 0.20/0.28 thf(f68,plain,(
% 0.20/0.28 (((eq @ x @ y)) = $true) | ~spl0_4),
% 0.20/0.28 inference(avatar_component_clause,[],[f66])).
% 0.20/0.28 thf(f69,plain,(
% 0.20/0.28 spl0_3 | spl0_4),
% 0.20/0.28 inference(avatar_split_clause,[],[f39,f66,f62])).
% 0.20/0.28 thf(f72,plain,(
% 0.20/0.28 ($true != $true) | (((moref @ (pf @ x @ z) @ (pf @ y @ u))) = $false)),
% 0.20/0.28 inference(constrained_superposition,[],[f47,f50])).
% 0.20/0.28 thf(f76,plain,(
% 0.20/0.28 (((moref @ (pf @ x @ z) @ (pf @ y @ u))) = $false)),
% 0.20/0.28 inference(trivial_inequality_removal,[],[f72])).
% 0.20/0.28 thf(f89,plain,(
% 0.20/0.28 ($true != $true) | (((eq @ z @ u)) != $true) | (((eq @ x @ y)) != $true)),
% 0.20/0.28 inference(constrained_superposition,[],[f48,f42])).
% 0.20/0.28 thf(f90,plain,(
% 0.20/0.28 (((eq @ z @ u)) != $true) | (((eq @ x @ y)) != $true)),
% 0.20/0.28 inference(trivial_inequality_removal,[],[f89])).
% 0.20/0.28 thf(f93,plain,(
% 0.20/0.28 (((eq @ x @ y)) != $true) | ~spl0_2),
% 0.20/0.28 inference(forward_subsumption_resolution,[],[f90,f59])).
% 0.20/0.28 thf(f96,plain,(
% 0.20/0.28 ~spl0_4 | ~spl0_2),
% 0.20/0.28 inference(avatar_split_clause,[],[f93,f57,f66])).
% 0.20/0.28 thf(f102,plain,(
% 0.20/0.28 ($true = $false) | (((eq @ z @ u)) != $true) | (((moref @ x @ y)) != $true)),
% 0.20/0.28 inference(constrained_superposition,[],[f44,f76])).
% 0.20/0.28 thf(f107,plain,(
% 0.20/0.28 (((eq @ z @ u)) != $true) | (((moref @ x @ y)) != $true)),
% 0.20/0.28 inference(trivial_inequality_removal,[],[f102])).
% 0.20/0.28 thf(f110,plain,(
% 0.20/0.28 (((moref @ x @ y)) != $true) | ~spl0_2),
% 0.20/0.28 inference(forward_subsumption_resolution,[],[f107,f59])).
% 0.20/0.28 thf(f115,plain,(
% 0.20/0.28 $false | (~spl0_2 | ~spl0_3)),
% 0.20/0.28 inference(forward_subsumption_resolution,[],[f110,f64])).
% 0.20/0.28 thf(f116,plain,(
% 0.20/0.28 ~spl0_2 | ~spl0_3),
% 0.20/0.28 inference(avatar_contradiction_clause,[],[f115])).
% 0.20/0.28 thf(f122,plain,(
% 0.20/0.28 ($true = $false) | (((moref @ z @ u)) != $true) | (((moref @ x @ y)) != $true)),
% 0.20/0.28 inference(constrained_superposition,[],[f45,f76])).
% 0.20/0.28 thf(f127,plain,(
% 0.20/0.28 (((moref @ z @ u)) != $true) | (((moref @ x @ y)) != $true)),
% 0.20/0.28 inference(trivial_inequality_removal,[],[f122])).
% 0.20/0.28 thf(f130,plain,(
% 0.20/0.28 (((moref @ x @ y)) != $true) | ~spl0_1),
% 0.20/0.28 inference(forward_subsumption_resolution,[],[f127,f55])).
% 0.20/0.28 thf(f135,plain,(
% 0.20/0.28 $false | (~spl0_1 | ~spl0_3)),
% 0.20/0.28 inference(forward_subsumption_resolution,[],[f130,f64])).
% 0.20/0.28 thf(f136,plain,(
% 0.20/0.28 ~spl0_1 | ~spl0_3),
% 0.20/0.28 inference(avatar_contradiction_clause,[],[f135])).
% 0.20/0.28 thf(f142,plain,(
% 0.20/0.28 ($true = $false) | (((moref @ z @ u)) != $true) | (((eq @ x @ y)) != $true)),
% 0.20/0.28 inference(constrained_superposition,[],[f46,f76])).
% 0.20/0.28 thf(f147,plain,(
% 0.20/0.28 (((moref @ z @ u)) != $true) | (((eq @ x @ y)) != $true)),
% 0.20/0.28 inference(trivial_inequality_removal,[],[f142])).
% 0.20/0.28 thf(f150,plain,(
% 0.20/0.28 (((eq @ x @ y)) != $true) | ~spl0_1),
% 0.20/0.28 inference(forward_subsumption_resolution,[],[f147,f55])).
% 0.20/0.28 thf(f155,plain,(
% 0.20/0.28 $false | (~spl0_1 | ~spl0_4)),
% 0.20/0.28 inference(forward_subsumption_resolution,[],[f150,f68])).
% 0.20/0.28 thf(f156,plain,(
% 0.20/0.28 ~spl0_1 | ~spl0_4),
% 0.20/0.28 inference(avatar_contradiction_clause,[],[f155])).
% 0.20/0.28 cnf(s1, plain, spl0_1 | spl0_2, inference(sat_conversion,[],[f60])).
% 0.20/0.28 cnf(s2, plain, spl0_3 | spl0_4, inference(sat_conversion,[],[f69])).
% 0.20/0.28 cnf(s3, plain, ~spl0_2 | ~spl0_4, inference(sat_conversion,[],[f96])).
% 0.20/0.28 cnf(s8, plain, ~spl0_2 | ~spl0_3, inference(sat_conversion,[],[f116])).
% 0.20/0.28 cnf(s11, plain, ~spl0_1 | ~spl0_3, inference(sat_conversion,[],[f136])).
% 0.20/0.28 cnf(s14, plain, ~spl0_1 | ~spl0_4, inference(sat_conversion,[],[f156])).
% 0.20/0.28 cnf(s15, plain, ~spl0_2, inference(rat,[],[s2,s3,s8])).
% 0.20/0.28 cnf(s16, plain, spl0_1, inference(rat,[],[s1,s15])).
% 0.20/0.28 cnf(s17, plain, ~spl0_4, inference(rat,[],[s14,s16])).
% 0.20/0.28 cnf(s18, plain, ~spl0_3, inference(rat,[],[s11,s16])).
% 0.20/0.28 cnf(s19, plain, $false, inference(rat,[],[s2,s17,s18])).
% 0.20/0.28 thf(f157,plain,(
% 0.20/0.28 $false),
% 0.20/0.28 inference(avatar_sat_refutation,[],[s19])).
% 0.20/0.28 % SZS output end Proof for theBenchmark
% 0.20/0.28 % (2604930)------------------------------
% 0.20/0.28 % (2604930)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.28 % (2604930)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.28 % (2604930)CaDiCaL version: 2.1.3
% 0.20/0.28 % (2604930)Termination reason: Refutation
% 0.20/0.28 % (2604930)Time elapsed: 0.007 s
% 0.20/0.28 % (2604930)Peak memory usage: 12 MB
% 0.20/0.28 % (2604930)Instructions burned: 11 (million)
% 0.20/0.28 % (2604921)Success in time 0.051 s
% 0.20/0.28 % Vampire exiting
%------------------------------------------------------------------------------