%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : CSR134^1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n011.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:47:17 AM UTC 2026
% Result : Theorem 0.31s 0.30s
% Output : Refutation 0.31s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR134^1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.17 % Computer : n011.cluster.edu
% 0.07/0.17 % Model : x86_64 x86_64
% 0.07/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.17 % Memory : 8046.5625MB
% 0.07/0.17 % OS : Linux 6.8.0-71-generic
% 0.07/0.17 % CPULimit : 300
% 0.07/0.17 % WCLimit : 300
% 0.07/0.17 % DateTime : Tue Sep 29 17:56:01 UTC 2026
% 0.07/0.17 % CPUTime :
% 0.07/0.17 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.20 Running first-order model finding
% 0.07/0.20 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.31/0.30 % (438121)Will run a generic schedule for satisfiability detection.
% 0.31/0.30 % (438138)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3099431716:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.31/0.30 % (438133)% WARNING: option uhcvi not known.
% 0.31/0.30 % (438136)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=503738415:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.31/0.30 % (438134)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3960989840:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.31/0.30 % (438133)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4028172379:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.31/0.30 % (438132)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3397068674_2999 on theBenchmark for (2999ds/0Mi)
% 0.31/0.30 % (438135)dis+10_1_sil=32000:sp=arity:random_seed=3732039366:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.31/0.30 % (438137)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2797263399:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.31/0.30 % (438136)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.31/0.30 % (438133)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.31/0.30 % Exception at run slice level
% 0.31/0.30 % (438133)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.31/0.30 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.31/0.30 % (438154)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=4231638203:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.31/0.30 % Exception at run slice level
% 0.31/0.30 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.31/0.30 % (438138)Instruction limit reached!
% 0.31/0.30 % (438138)------------------------------
% 0.31/0.30 % (438138)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.31/0.30 % (438138)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.31/0.30 % (438138)CaDiCaL version: 2.1.3
% 0.31/0.30 % (438138)Termination reason: Instruction limit
% 0.31/0.30 % (438138)Termination phase: Saturation
% 0.31/0.30 % (438138)Time elapsed: 0.043 s
% 0.31/0.30 % (438138)Peak memory usage: 13 MB
% 0.31/0.30 % (438138)Instructions burned: 164 (million)
% 0.31/0.30 % (438163)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1686781321:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 0.31/0.30 % (438171)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=3375789936:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 0.31/0.30 % (438136) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-438121-438136"...
% 0.31/0.30 % (438171)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.31/0.30 % (438171)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.31/0.30 % (438137) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-438121-438137"...
% 0.31/0.30 % (438136)...printing done.
% 0.31/0.30 % (438136)Refutation found. Thanks to Tanya!
% 0.31/0.30 % SZS status Theorem for theBenchmark
% 0.31/0.30 % SZS output start Proof for theBenchmark
% 0.31/0.30 thf(type_def_5, type, num: $tType).
% 0.31/0.30 thf(type_def_6, type, sTfun: ($tType * $tType) > $tType).
% 0.31/0.30 thf(func_def_0, type, holdsDuring_THFTYPE_IiooI: ($i > $o > $o)).
% 0.31/0.30 thf(func_def_7, type, lYearFn_THFTYPE_IiiI: ($i > $i)).
% 0.31/0.30 thf(func_def_8, type, likes_THFTYPE_IiioI: ($i > $i > $o)).
% 0.31/0.30 thf(func_def_10, type, parent_THFTYPE_IiioI: ($i > $i > $o)).
% 0.31/0.30 thf(func_def_12, type, vNOT: ($o > $o)).
% 0.31/0.30 thf(func_def_15, type, vAND: ($o > $o > $o)).
% 0.31/0.30 thf(func_def_16, type, db0: !>[X0: $tType]:(X0)).
% 0.31/0.30 thf(func_def_17, type, db1: !>[X0: $tType]:(X0)).
% 0.31/0.30 thf(func_def_18, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.31/0.30 thf(func_def_20, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.31/0.30 thf(f1,axiom,(
% 0.31/0.30 (holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (parent_THFTYPE_IiioI @ lMary_THFTYPE_i @ lAnna_THFTYPE_i))),
% 0.31/0.30 file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax)).
% 0.31/0.30 thf(f3,axiom,(
% 0.31/0.30 (holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (~ (parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i)))),
% 0.31/0.30 file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_002)).
% 0.31/0.30 thf(f11,conjecture,(
% 0.31/0.30 ? [X0 : ($i > $i > $o),X1 : $i,X2 : $i] : (holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (~ (X0 @ X2 @ lAnna_THFTYPE_i)) & (X0 @ X1 @ lAnna_THFTYPE_i))),
% 0.31/0.30 file('/export/starexec/sandbox/benchmark/theBenchmark.p',con)).
% 0.31/0.30 thf(f12,negated_conjecture,(
% 0.31/0.30 ~ ? [X0 : ($i > $i > $o),X1 : $i,X2 : $i] : (holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (~ (X0 @ X2 @ lAnna_THFTYPE_i)) & (X0 @ X1 @ lAnna_THFTYPE_i))),
% 0.31/0.30 inference(negated_conjecture,[status(cth)],[f11])).
% 0.31/0.30 thf(f13,plain,(
% 0.31/0.30 (holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (parent_THFTYPE_IiioI @ lMary_THFTYPE_i @ lAnna_THFTYPE_i))),
% 0.31/0.30 inference(rectify,[],[f1])).
% 0.31/0.30 thf(f14,plain,(
% 0.31/0.30 (((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (parent_THFTYPE_IiioI @ lMary_THFTYPE_i @ lAnna_THFTYPE_i))) = $true)),
% 0.31/0.30 inference(fool_elimination,[],[f13])).
% 0.31/0.30 thf(f17,plain,(
% 0.31/0.30 (holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (~ (parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i)))),
% 0.31/0.30 inference(rectify,[],[f3])).
% 0.31/0.30 thf(f18,plain,(
% 0.31/0.30 (((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (~ (parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i)))) = $true)),
% 0.31/0.30 inference(fool_elimination,[],[f17])).
% 0.31/0.30 thf(f33,plain,(
% 0.31/0.30 ~ ? [X0 : ($i > $i > $o),X1 : $i,X2 : $i] : (holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (~ (X0 @ X2 @ lAnna_THFTYPE_i)) & (X0 @ X1 @ lAnna_THFTYPE_i))),
% 0.31/0.30 inference(rectify,[],[f12])).
% 0.31/0.30 thf(f34,plain,(
% 0.31/0.30 ~ ? [X0 : ($i > $i > $o),X1 : $i,X2 : $i] : ($true = ((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ ((X0 @ X1 @ lAnna_THFTYPE_i) & (~ (X0 @ X2 @ lAnna_THFTYPE_i))))))),
% 0.31/0.30 inference(fool_elimination,[],[f33])).
% 0.31/0.30 thf(f35,plain,(
% 0.31/0.30 ! [X0 : ($i > $i > $o),X1 : $i,X2 : $i] : ($true != ((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ ((X0 @ X1 @ lAnna_THFTYPE_i) & (~ (X0 @ X2 @ lAnna_THFTYPE_i))))))),
% 0.31/0.30 inference(ennf_transformation,[],[f34])).
% 0.31/0.30 thf(f36,plain,(
% 0.31/0.30 (((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (parent_THFTYPE_IiioI @ lMary_THFTYPE_i @ lAnna_THFTYPE_i))) = $true)),
% 0.31/0.30 inference(cnf_transformation,[],[f14])).
% 0.31/0.30 thf(f38,plain,(
% 0.31/0.30 (((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (~ (parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i)))) = $true)),
% 0.31/0.30 inference(cnf_transformation,[],[f18])).
% 0.31/0.30 thf(f46,plain,(
% 0.31/0.30 ( ! [X2 : $i,X0 : ($i > $i > $o),X1 : $i] : (($true != ((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ ((X0 @ X1 @ lAnna_THFTYPE_i) & (~ (X0 @ X2 @ lAnna_THFTYPE_i))))))) )),
% 0.31/0.30 inference(cnf_transformation,[],[f35])).
% 0.31/0.30 thf(f47,definition,(
% 0.31/0.30 ($true != $false)),
% 0.31/0.30 introduced(theory,[fool_distinctness_axiom])).
% 0.31/0.30 thf(f48,definition,(
% 0.31/0.30 ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 0.31/0.30 introduced(theory,[fool_exhaustiveness_axiom])).
% 0.31/0.30 thf(f51,plain,(
% 0.31/0.30 ( ! [X2 : $i,X0 : $o] : (($true != ((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (X0 & (~ ((^[Y0 : $i]: ((^[Y1 : $i]: ($true)))) @ X2 @ lAnna_THFTYPE_i)))))) | ($false = X0)) )),
% 0.31/0.30 inference(constrained_superposition,[],[f46,f48])).
% 0.31/0.30 thf(f52,plain,(
% 0.31/0.30 ( ! [X0 : $o,X1 : $i] : (($true != ((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (((^[Y0 : $i]: ((^[Y1 : $i]: ($true)))) @ X1 @ lAnna_THFTYPE_i) & (~ X0))))) | ($false = X0)) )),
% 0.31/0.30 inference(constrained_superposition,[],[f46,f48])).
% 0.31/0.30 thf(f56,plain,(
% 0.31/0.30 ( ! [X2 : $i,X0 : ($i > $i > $o),X1 : $i] : (($true != ((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ $true))) | ((((X0 @ X1 @ lAnna_THFTYPE_i) & (~ (X0 @ X2 @ lAnna_THFTYPE_i)))) = $false)) )),
% 0.31/0.30 inference(constrained_superposition,[],[f46,f48])).
% 0.31/0.30 thf(f60,plain,(
% 0.31/0.30 ( ! [X2 : $i,X0 : ($i > $i > $o),X1 : $i] : (($true != ((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ $true))) | (((~ (X0 @ X2 @ lAnna_THFTYPE_i))) = $false) | (((X0 @ X1 @ lAnna_THFTYPE_i)) = $false)) )),
% 0.31/0.30 inference(and_proxy_clausification,[],[f56])).
% 0.31/0.30 thf(f61,plain,(
% 0.31/0.30 ( ! [X2 : $i,X0 : ($i > $i > $o),X1 : $i] : (($true != ((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ $true))) | (((X0 @ X2 @ lAnna_THFTYPE_i)) = $true) | (((X0 @ X1 @ lAnna_THFTYPE_i)) = $false)) )),
% 0.31/0.30 inference(not_proxy_clausification,[],[f60])).
% 0.31/0.30 thf(f67,plain,(
% 0.31/0.30 ( ! [X0 : $o] : (($true != ((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ ($true & (~ X0))))) | ($false = X0)) )),
% 0.31/0.30 inference(beta-eta_normalization,[],[f52])).
% 0.31/0.30 thf(f68,plain,(
% 0.31/0.30 ( ! [X0 : $o] : (($true != ((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (~ X0)))) | ($false = X0)) )),
% 0.31/0.30 inference(boolean_simplification,[],[f67])).
% 0.31/0.30 thf(f69,plain,(
% 0.31/0.30 ( ! [X0 : $o] : (($true != ((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (X0 & (~ $true))))) | ($false = X0)) )),
% 0.31/0.30 inference(beta-eta_normalization,[],[f51])).
% 0.31/0.30 thf(f70,plain,(
% 0.31/0.30 ( ! [X0 : $o] : (($true != ((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (X0 & $false)))) | ($false = X0)) )),
% 0.31/0.30 inference(boolean_simplification,[],[f69])).
% 0.31/0.30 thf(f71,plain,(
% 0.31/0.30 ( ! [X0 : $o] : (($true != ((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ $false))) | ($false = X0)) )),
% 0.31/0.30 inference(boolean_simplification,[],[f70])).
% 0.31/0.30 thf(f77,definition,(
% 0.31/0.30 spl0_1 <=> ! [X2 : $i,X0 : ($i > $i > $o),X1 : $i] : ((((X0 @ X2 @ lAnna_THFTYPE_i)) = $true) | (((X0 @ X1 @ lAnna_THFTYPE_i)) = $false))),
% 0.31/0.30 introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition])).
% 0.31/0.30 thf(f78,plain,(
% 0.31/0.30 ( ! [X2 : $i,X0 : ($i > $i > $o),X1 : $i] : ((((X0 @ X2 @ lAnna_THFTYPE_i)) = $true) | (((X0 @ X1 @ lAnna_THFTYPE_i)) = $false)) ) | ~spl0_1),
% 0.31/0.30 inference(avatar_component_clause,[],[f77])).
% 0.31/0.30 thf(f80,definition,(
% 0.31/0.30 spl0_2 <=> ($true = ((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ $true)))),
% 0.31/0.30 introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition])).
% 0.31/0.30 thf(f82,plain,(
% 0.31/0.30 ($true != ((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ $true))) | spl0_2),
% 0.31/0.30 inference(avatar_component_clause,[],[f80])).
% 0.31/0.30 thf(f83,plain,(
% 0.31/0.30 spl0_1 | ~spl0_2),
% 0.31/0.30 inference(avatar_split_clause,[],[f61,f80,f77])).
% 0.31/0.30 thf(f88,definition,(
% 0.31/0.30 spl0_4 <=> ($true = ((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ $false)))),
% 0.31/0.30 introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition])).
% 0.31/0.30 thf(f90,plain,(
% 0.31/0.30 ($true != ((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ $false))) | spl0_4),
% 0.31/0.30 inference(avatar_component_clause,[],[f88])).
% 0.31/0.30 thf(f93,definition,(
% 0.31/0.30 spl0_5 <=> ! [X0 : $o] : ($false = X0)),
% 0.31/0.30 introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition])).
% 0.31/0.30 thf(f94,plain,(
% 0.31/0.30 ( ! [X0 : $o] : (($false = X0)) ) | ~spl0_5),
% 0.31/0.30 inference(avatar_component_clause,[],[f93])).
% 0.31/0.30 thf(f95,plain,(
% 0.31/0.30 spl0_5 | ~spl0_4),
% 0.31/0.30 inference(avatar_split_clause,[],[f71,f88,f93])).
% 0.31/0.30 thf(f96,plain,(
% 0.31/0.30 ($true = ((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ $true))) | (((parent_THFTYPE_IiioI @ lMary_THFTYPE_i @ lAnna_THFTYPE_i)) = $false)),
% 0.31/0.30 inference(constrained_superposition,[],[f36,f48])).
% 0.31/0.30 thf(f104,plain,(
% 0.31/0.30 (((parent_THFTYPE_IiioI @ lMary_THFTYPE_i @ lAnna_THFTYPE_i)) = $false) | spl0_2),
% 0.31/0.30 inference(forward_subsumption_resolution,[],[f96,f82])).
% 0.31/0.30 thf(f112,plain,(
% 0.31/0.30 ($true = ((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ $false))) | spl0_2),
% 0.31/0.30 inference(constrained_superposition,[],[f36,f104])).
% 0.31/0.30 thf(f129,plain,(
% 0.31/0.30 $false | (spl0_2 | spl0_4)),
% 0.31/0.30 inference(forward_subsumption_resolution,[],[f112,f90])).
% 0.31/0.30 thf(f130,plain,(
% 0.31/0.30 spl0_2 | spl0_4),
% 0.31/0.30 inference(avatar_contradiction_clause,[],[f129])).
% 0.31/0.30 thf(f158,plain,(
% 0.31/0.30 ($true != $true) | ($false = ((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ $false))) | spl0_4),
% 0.31/0.30 inference(constrained_superposition,[],[f90,f48])).
% 0.31/0.30 thf(f159,plain,(
% 0.31/0.30 ($false = ((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ $false))) | spl0_4),
% 0.31/0.30 inference(trivial_inequality_removal,[],[f158])).
% 0.31/0.30 thf(f297,plain,(
% 0.31/0.30 ($true != $true) | (((parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i)) = $false)),
% 0.31/0.30 inference(constrained_superposition,[],[f68,f38])).
% 0.31/0.30 thf(f298,plain,(
% 0.31/0.30 (((parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i)) = $false)),
% 0.31/0.30 inference(trivial_inequality_removal,[],[f297])).
% 0.31/0.30 thf(f325,plain,(
% 0.31/0.30 ($false != $false) | ~spl0_5),
% 0.31/0.30 inference(constrained_superposition,[],[f47,f94])).
% 0.31/0.30 thf(f378,plain,(
% 0.31/0.30 $false | ~spl0_5),
% 0.31/0.30 inference(trivial_inequality_removal,[],[f325])).
% 0.31/0.30 thf(f379,plain,(
% 0.31/0.30 ~spl0_5),
% 0.31/0.30 inference(avatar_contradiction_clause,[],[f378])).
% 0.31/0.30 thf(f506,plain,(
% 0.31/0.30 ( ! [X2 : $i,X1 : $i] : (($true = (((^[Y0 : $i]: ((^[Y1 : $i]: (Y0 = Y1)))) @ X2 @ lAnna_THFTYPE_i))) | ($false = (((^[Y0 : $i]: ((^[Y1 : $i]: (Y0 = Y1)))) @ X1 @ lAnna_THFTYPE_i)))) ) | ~spl0_1),
% 0.31/0.30 inference(primitive_instantiation,[],[f78])).
% 0.31/0.30 thf(f1042,plain,(
% 0.31/0.30 ( ! [X2 : $i,X1 : $i] : (($true = ((X2 = lAnna_THFTYPE_i))) | ($false = ((X1 = lAnna_THFTYPE_i)))) ) | ~spl0_1),
% 0.31/0.30 inference(beta-eta_normalization,[],[f506])).
% 0.31/0.30 thf(f1043,plain,(
% 0.31/0.30 ( ! [X2 : $i,X1 : $i] : ((lAnna_THFTYPE_i = X2) | ($false = ((X1 = lAnna_THFTYPE_i)))) ) | ~spl0_1),
% 0.31/0.30 inference(equality_proxy_clausification,[],[f1042])).
% 0.31/0.30 thf(f1044,plain,(
% 0.31/0.30 ( ! [X2 : $i,X1 : $i] : ((lAnna_THFTYPE_i = X2) | (lAnna_THFTYPE_i != X1)) ) | ~spl0_1),
% 0.31/0.30 inference(equality_proxy_clausification,[],[f1043])).
% 0.31/0.30 thf(f1116,definition,(
% 0.31/0.30 spl0_16 <=> ! [X1 : $i] : (lAnna_THFTYPE_i = X1)),
% 0.31/0.30 introduced(definition,[new_symbols(definition,[spl0_16])],[avatar_definition])).
% 0.31/0.30 thf(f1117,plain,(
% 0.31/0.30 ( ! [X1 : $i] : ((lAnna_THFTYPE_i = X1)) ) | ~spl0_16),
% 0.31/0.30 inference(avatar_component_clause,[],[f1116])).
% 0.31/0.30 thf(f1119,definition,(
% 0.31/0.30 spl0_17 <=> ! [X2 : $i] : (lAnna_THFTYPE_i != X2)),
% 0.31/0.30 introduced(definition,[new_symbols(definition,[spl0_17])],[avatar_definition])).
% 0.31/0.30 thf(f1120,plain,(
% 0.31/0.30 ( ! [X2 : $i] : ((lAnna_THFTYPE_i != X2)) ) | ~spl0_17),
% 0.31/0.30 inference(avatar_component_clause,[],[f1119])).
% 0.31/0.30 thf(f1124,plain,(
% 0.31/0.30 spl0_17 | spl0_16 | ~spl0_1),
% 0.31/0.30 inference(avatar_split_clause,[],[f1044,f77,f1116,f1119])).
% 0.31/0.30 thf(f1129,plain,(
% 0.31/0.30 ( ! [X0 : $i] : (($true = ((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (parent_THFTYPE_IiioI @ lMary_THFTYPE_i @ X0))))) ) | ~spl0_16),
% 0.31/0.30 inference(constrained_superposition,[],[f36,f1117])).
% 0.31/0.30 thf(f1135,plain,(
% 0.31/0.30 ( ! [X0 : $i] : (($false = ((parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ X0)))) ) | ~spl0_16),
% 0.31/0.30 inference(constrained_superposition,[],[f298,f1117])).
% 0.31/0.30 thf(f1171,plain,(
% 0.31/0.30 ($false = ((holdsDuring_THFTYPE_IiooI @ lAnna_THFTYPE_i @ $false))) | (spl0_4 | ~spl0_16)),
% 0.31/0.30 inference(constrained_superposition,[],[f159,f1117])).
% 0.31/0.30 thf(f1204,plain,(
% 0.31/0.30 ( ! [X0 : $i] : (($false = ((parent_THFTYPE_IiioI @ lAnna_THFTYPE_i @ X0)))) ) | ~spl0_16),
% 0.31/0.30 inference(forward_demodulation,[],[f1135,f1117])).
% 0.31/0.30 thf(f1208,plain,(
% 0.31/0.30 ( ! [X0 : $i] : (($true = ((holdsDuring_THFTYPE_IiooI @ lAnna_THFTYPE_i @ (parent_THFTYPE_IiioI @ lMary_THFTYPE_i @ X0))))) ) | ~spl0_16),
% 0.31/0.30 inference(forward_demodulation,[],[f1129,f1117])).
% 0.31/0.30 thf(f1234,plain,(
% 0.31/0.30 ( ! [X0 : $i] : (($true = ((holdsDuring_THFTYPE_IiooI @ lAnna_THFTYPE_i @ (parent_THFTYPE_IiioI @ lAnna_THFTYPE_i @ X0))))) ) | ~spl0_16),
% 0.31/0.30 inference(forward_demodulation,[],[f1208,f1117])).
% 0.31/0.30 thf(f1259,plain,(
% 0.31/0.30 ($true = ((holdsDuring_THFTYPE_IiooI @ lAnna_THFTYPE_i @ $false))) | ~spl0_16),
% 0.31/0.30 inference(forward_demodulation,[],[f1234,f1204])).
% 0.31/0.30 thf(f1278,plain,(
% 0.31/0.30 ($true = $false) | (spl0_4 | ~spl0_16)),
% 0.31/0.30 inference(forward_demodulation,[],[f1259,f1171])).
% 0.31/0.30 thf(f1279,plain,(
% 0.31/0.30 $false | (spl0_4 | ~spl0_16)),
% 0.31/0.30 inference(trivial_inequality_removal,[],[f1278])).
% 0.31/0.30 thf(f1280,plain,(
% 0.31/0.30 spl0_4 | ~spl0_16),
% 0.31/0.30 inference(avatar_contradiction_clause,[],[f1279])).
% 0.31/0.30 thf(f1503,plain,(
% 0.31/0.30 $false | ~spl0_17),
% 0.31/0.30 inference(equality_resolution,[],[f1120])).
% 0.31/0.30 thf(f1504,plain,(
% 0.31/0.30 ~spl0_17),
% 0.31/0.30 inference(avatar_contradiction_clause,[],[f1503])).
% 0.31/0.30 cnf(s1, plain, spl0_1 | ~spl0_2, inference(sat_conversion,[],[f83])).
% 0.31/0.30 cnf(s3, plain, ~spl0_4 | spl0_5, inference(sat_conversion,[],[f95])).
% 0.31/0.30 cnf(s4, plain, spl0_2 | spl0_4, inference(sat_conversion,[],[f130])).
% 0.31/0.30 cnf(s17, plain, ~spl0_5, inference(sat_conversion,[],[f379])).
% 0.31/0.30 cnf(s38, plain, ~spl0_1 | spl0_16 | spl0_17, inference(sat_conversion,[],[f1124])).
% 0.31/0.30 cnf(s48, plain, spl0_4 | ~spl0_16, inference(sat_conversion,[],[f1280])).
% 0.31/0.30 cnf(s54, plain, ~spl0_17, inference(sat_conversion,[],[f1504])).
% 0.31/0.30 cnf(s56, plain, ~spl0_1 | spl0_16, inference(rat,[],[s38,s54])).
% 0.31/0.30 cnf(s63, plain, ~spl0_4, inference(rat,[],[s3,s17])).
% 0.31/0.30 cnf(s64, plain, ~spl0_16, inference(rat,[],[s48,s63])).
% 0.31/0.30 cnf(s65, plain, spl0_2, inference(rat,[],[s4,s63])).
% 0.31/0.30 cnf(s66, plain, ~spl0_1, inference(rat,[],[s56,s64])).
% 0.31/0.30 cnf(s69, plain, $false, inference(rat,[],[s1,s65,s66])).
% 0.31/0.30 thf(f1505,plain,(
% 0.31/0.30 $false),
% 0.31/0.30 inference(avatar_sat_refutation,[],[s69])).
% 0.31/0.30 % SZS output end Proof for theBenchmark
% 0.31/0.30 % (438136)------------------------------
% 0.31/0.30 % (438136)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.31/0.30 % (438136)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.31/0.30 % (438136)CaDiCaL version: 2.1.3
% 0.31/0.30 % (438136)Termination reason: Refutation
% 0.31/0.30 % (438136)Time elapsed: 0.048 s
% 0.31/0.30 % (438136)Peak memory usage: 13 MB
% 0.31/0.30 % (438136)Instructions burned: 95 (million)
% 0.31/0.30 % (438121)Success in time 0.087 s
% 0.31/0.30 % Vampire exiting
%------------------------------------------------------------------------------