%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : CSR123^1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n002.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:14 AM UTC 2026
% Result : Theorem 0.19s 0.29s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : CSR123^1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.19 % Computer : n002.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 17:57:37 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.19/0.29 % (1638767)Will run a generic schedule for satisfiability detection.
% 0.19/0.29 % (1638773)% WARNING: option uhcvi not known.
% 0.19/0.29 % (1638773)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2591102907:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.29 % (1638773)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.19/0.29 % (1638773)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.19/0.29 % (1638772)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3327845979_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.29 % Exception at run slice level% (1638776)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2961221906:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.29
% 0.19/0.29 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.19/0.29 % (1638774)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1992028089:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.29 % (1638775)dis+10_1_sil=32000:sp=arity:random_seed=3324539486:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.29 % (1638776)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.19/0.29 % (1638778)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2621074970:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.19/0.29 % (1638777)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2243938808:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.29 % (1638784)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=842036782:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.19/0.29 % Exception at run slice level
% 0.19/0.29 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.19/0.29 % (1638773) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1638767-1638773"...
% 0.19/0.29 % (1638773)...printing done.
% 0.19/0.29 % (1638773)Refutation found. Thanks to Tanya!
% 0.19/0.29 % SZS status Theorem for theBenchmark
% 0.19/0.29 % SZS output start Proof for theBenchmark
% 0.19/0.29 thf(type_def_5, type, num: $tType).
% 0.19/0.29 thf(type_def_6, type, sTfun: ($tType * $tType) > $tType).
% 0.19/0.29 thf(func_def_0, type, holdsDuring_THFTYPE_IiooI: ($i > $o > $o)).
% 0.19/0.29 thf(func_def_5, type, lYearFn_THFTYPE_IiiI: ($i > $i)).
% 0.19/0.29 thf(func_def_6, type, likes_THFTYPE_IiioI: ($i > $i > $o)).
% 0.19/0.29 thf(func_def_9, type, vNOT: ($o > $o)).
% 0.19/0.29 thf(func_def_12, type, vAND: ($o > $o > $o)).
% 0.19/0.29 thf(func_def_13, type, db0: !>[X0: $tType]:(X0)).
% 0.19/0.29 thf(func_def_14, type, db1: !>[X0: $tType]:(X0)).
% 0.19/0.29 thf(func_def_15, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.19/0.29 thf(func_def_17, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.19/0.29 thf(f1,axiom,(
% 0.19/0.29 (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i)),
% 0.19/0.29 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax)).
% 0.19/0.29 thf(f3,axiom,(
% 0.19/0.29 (holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (~ (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBen_THFTYPE_i)))),
% 0.19/0.29 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_002)).
% 0.19/0.29 thf(f4,conjecture,(
% 0.19/0.29 ? [X0 : ($i > $i > $o),X1 : $i,X2 : $i] : (holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (~ (X0 @ lSue_THFTYPE_i @ X2)) & (X0 @ lSue_THFTYPE_i @ X1))),
% 0.19/0.29 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con)).
% 0.19/0.29 thf(f5,negated_conjecture,(
% 0.19/0.29 ~ ? [X0 : ($i > $i > $o),X1 : $i,X2 : $i] : (holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (~ (X0 @ lSue_THFTYPE_i @ X2)) & (X0 @ lSue_THFTYPE_i @ X1))),
% 0.19/0.29 inference(negated_conjecture,[status(cth)],[f4])).
% 0.19/0.29 thf(f6,plain,(
% 0.19/0.29 (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i)),
% 0.19/0.29 inference(rectify,[],[f1])).
% 0.19/0.29 thf(f7,plain,(
% 0.19/0.29 (((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i)) = $true)),
% 0.19/0.29 inference(fool_elimination,[],[f6])).
% 0.19/0.29 thf(f10,plain,(
% 0.19/0.29 (holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (~ (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBen_THFTYPE_i)))),
% 0.19/0.29 inference(rectify,[],[f3])).
% 0.19/0.29 thf(f11,plain,(
% 0.19/0.29 (((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (~ (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBen_THFTYPE_i)))) = $true)),
% 0.19/0.30 inference(fool_elimination,[],[f10])).
% 0.19/0.30 thf(f12,plain,(
% 0.19/0.30 ~ ? [X0 : ($i > $i > $o),X1 : $i,X2 : $i] : (holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (~ (X0 @ lSue_THFTYPE_i @ X2)) & (X0 @ lSue_THFTYPE_i @ X1))),
% 0.19/0.30 inference(rectify,[],[f5])).
% 0.19/0.30 thf(f13,plain,(
% 0.19/0.30 ~ ? [X0 : ($i > $i > $o),X1 : $i,X2 : $i] : ($true = ((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ ((X0 @ lSue_THFTYPE_i @ X1) & (~ (X0 @ lSue_THFTYPE_i @ X2))))))),
% 0.19/0.30 inference(fool_elimination,[],[f12])).
% 0.19/0.30 thf(f14,plain,(
% 0.19/0.30 ! [X0 : ($i > $i > $o),X1 : $i,X2 : $i] : ($true != ((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ ((X0 @ lSue_THFTYPE_i @ X1) & (~ (X0 @ lSue_THFTYPE_i @ X2))))))),
% 0.19/0.30 inference(ennf_transformation,[],[f13])).
% 0.19/0.30 thf(f15,plain,(
% 0.19/0.30 (((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i)) = $true)),
% 0.19/0.30 inference(cnf_transformation,[],[f7])).
% 0.19/0.30 thf(f17,plain,(
% 0.19/0.30 (((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (~ (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBen_THFTYPE_i)))) = $true)),
% 0.19/0.30 inference(cnf_transformation,[],[f11])).
% 0.19/0.30 thf(f18,plain,(
% 0.19/0.30 ( ! [X2 : $i,X0 : ($i > $i > $o),X1 : $i] : (($true != ((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ ((X0 @ lSue_THFTYPE_i @ X1) & (~ (X0 @ lSue_THFTYPE_i @ X2))))))) )),
% 0.19/0.30 inference(cnf_transformation,[],[f14])).
% 0.19/0.30 thf(f20,definition,(
% 0.19/0.30 ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 0.19/0.30 introduced(theory,[fool_exhaustiveness_axiom])).
% 0.19/0.30 thf(f24,plain,(
% 0.19/0.30 ( ! [X0 : $o,X1 : $i] : (($true != ((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (((^[Y0 : $i]: ((^[Y1 : $i]: ($true)))) @ lSue_THFTYPE_i @ X1) & (~ X0))))) | ($false = X0)) )),
% 0.19/0.30 inference(constrained_superposition,[],[f18,f20])).
% 0.19/0.30 thf(f27,plain,(
% 0.19/0.30 ( ! [X2 : $i,X0 : ($i > $i > $o),X1 : $i] : (($true != ((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ ((X0 @ lSue_THFTYPE_i @ X1) & $true)))) | (((~ (X0 @ lSue_THFTYPE_i @ X2))) = $false)) )),
% 0.19/0.30 inference(constrained_superposition,[],[f18,f20])).
% 0.19/0.30 thf(f34,plain,(
% 0.19/0.30 ( ! [X2 : $i,X0 : ($i > $i > $o),X1 : $i] : (($true != ((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ ((X0 @ lSue_THFTYPE_i @ X1) & $true)))) | (((X0 @ lSue_THFTYPE_i @ X2)) = $true)) )),
% 0.19/0.30 inference(not_proxy_clausification,[],[f27])).
% 0.19/0.30 thf(f35,plain,(
% 0.19/0.30 ( ! [X2 : $i,X0 : ($i > $i > $o),X1 : $i] : (($true != ((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (X0 @ lSue_THFTYPE_i @ X1)))) | (((X0 @ lSue_THFTYPE_i @ X2)) = $true)) )),
% 0.19/0.30 inference(boolean_simplification,[],[f34])).
% 0.19/0.30 thf(f39,plain,(
% 0.19/0.30 ( ! [X0 : $o] : (($true != ((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ ($true & (~ X0))))) | ($false = X0)) )),
% 0.19/0.30 inference(beta-eta_normalization,[],[f24])).
% 0.19/0.30 thf(f40,plain,(
% 0.19/0.30 ( ! [X0 : $o] : (($true != ((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (~ X0)))) | ($false = X0)) )),
% 0.19/0.30 inference(boolean_simplification,[],[f39])).
% 0.19/0.30 thf(f49,definition,(
% 0.19/0.30 spl0_1 <=> ! [X2 : $i,X0 : ($i > $i > $o),X1 : $i] : ((((X0 @ lSue_THFTYPE_i @ X2)) = $true) | (((X0 @ lSue_THFTYPE_i @ X1)) = $false))),
% 0.19/0.30 introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition])).
% 0.19/0.30 thf(f50,plain,(
% 0.19/0.30 ( ! [X2 : $i,X0 : ($i > $i > $o),X1 : $i] : ((((X0 @ lSue_THFTYPE_i @ X2)) = $true) | (((X0 @ lSue_THFTYPE_i @ X1)) = $false)) ) | ~spl0_1),
% 0.19/0.30 inference(avatar_component_clause,[],[f49])).
% 0.19/0.30 thf(f52,definition,(
% 0.19/0.30 spl0_2 <=> ($true = ((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ $true)))),
% 0.19/0.30 introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition])).
% 0.19/0.30 thf(f68,plain,(
% 0.19/0.30 ( ! [X2 : $i,X0 : ($i > $i > $i),X1 : $i] : (($true != ((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ ($true & (~ ((^[Y0 : $i]: ((^[Y1 : $i]: (likes_THFTYPE_IiioI @ (X0 @ Y0 @ Y1) @ ((^[Y2 : $i]: ((^[Y3 : $i]: (Y3)))) @ Y0 @ Y1))))) @ lSue_THFTYPE_i @ X2)))))) | (lSue_THFTYPE_i != ((X0 @ lSue_THFTYPE_i @ X1))) | (lBill_THFTYPE_i != X1)) )),
% 0.19/0.30 inference(constrained_superposition,[],[f18,f15])).
% 0.19/0.30 thf(f80,plain,(
% 0.19/0.30 ( ! [X2 : $i,X0 : ($i > $i > $i),X1 : $i] : (($true != ((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ ($true & (~ (likes_THFTYPE_IiioI @ (X0 @ lSue_THFTYPE_i @ X2) @ X2)))))) | (lSue_THFTYPE_i != ((X0 @ lSue_THFTYPE_i @ X1))) | (lBill_THFTYPE_i != X1)) )),
% 0.19/0.30 inference(beta-eta_normalization,[],[f68])).
% 0.19/0.30 thf(f81,plain,(
% 0.19/0.30 ( ! [X2 : $i,X0 : ($i > $i > $i),X1 : $i] : (($true != ((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (~ (likes_THFTYPE_IiioI @ (X0 @ lSue_THFTYPE_i @ X2) @ X2))))) | (lSue_THFTYPE_i != ((X0 @ lSue_THFTYPE_i @ X1))) | (lBill_THFTYPE_i != X1)) )),
% 0.19/0.30 inference(boolean_simplification,[],[f80])).
% 0.19/0.30 thf(f142,definition,(
% 0.19/0.30 spl0_11 <=> (((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBen_THFTYPE_i)) = $false)),
% 0.19/0.30 introduced(definition,[new_symbols(definition,[spl0_11])],[avatar_definition])).
% 0.19/0.30 thf(f144,plain,(
% 0.19/0.30 (((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBen_THFTYPE_i)) = $false) | ~spl0_11),
% 0.19/0.30 inference(avatar_component_clause,[],[f142])).
% 0.19/0.30 thf(f169,plain,(
% 0.19/0.30 ($true != $true) | (((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBen_THFTYPE_i)) = $false)),
% 0.19/0.30 inference(constrained_superposition,[],[f40,f17])).
% 0.19/0.30 thf(f170,plain,(
% 0.19/0.30 (((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBen_THFTYPE_i)) = $false)),
% 0.19/0.30 inference(trivial_inequality_removal,[],[f169])).
% 0.19/0.30 thf(f173,plain,(
% 0.19/0.30 spl0_11),
% 0.19/0.30 inference(avatar_split_clause,[],[f170,f142])).
% 0.19/0.30 thf(f175,plain,(
% 0.19/0.30 ( ! [X2 : $i,X0 : ($i > $i > $o),X1 : $i] : (($true != ((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ $true))) | (((X0 @ lSue_THFTYPE_i @ X2)) = $true) | (((X0 @ lSue_THFTYPE_i @ X1)) = $false)) )),
% 0.19/0.30 inference(constrained_superposition,[],[f35,f20])).
% 0.19/0.30 thf(f203,plain,(
% 0.19/0.30 ($true = ((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (~ $false)))) | ~spl0_11),
% 0.19/0.30 inference(constrained_superposition,[],[f17,f144])).
% 0.19/0.30 thf(f204,plain,(
% 0.19/0.30 ($true = ((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ $true))) | ~spl0_11),
% 0.19/0.30 inference(boolean_simplification,[],[f203])).
% 0.19/0.30 thf(f240,plain,(
% 0.19/0.30 spl0_1 | ~spl0_2),
% 0.19/0.30 inference(avatar_split_clause,[],[f175,f52,f49])).
% 0.19/0.30 thf(f241,plain,(
% 0.19/0.30 spl0_2 | ~spl0_11),
% 0.19/0.30 inference(avatar_split_clause,[],[f204,f142,f52])).
% 0.19/0.30 thf(f267,plain,(
% 0.19/0.30 ( ! [X2 : $i,X1 : $i] : (($true = (((^[Y0 : $i]: ((^[Y1 : $i]: (Y0 = Y1)))) @ lSue_THFTYPE_i @ X2))) | ($false = (((^[Y0 : $i]: ((^[Y1 : $i]: (Y0 = Y1)))) @ lSue_THFTYPE_i @ X1)))) ) | ~spl0_1),
% 0.19/0.30 inference(primitive_instantiation,[],[f50])).
% 0.19/0.30 thf(f593,plain,(
% 0.19/0.30 ( ! [X2 : $i,X1 : $i] : (($true = ((lSue_THFTYPE_i = X2))) | ($false = ((lSue_THFTYPE_i = X1)))) ) | ~spl0_1),
% 0.19/0.30 inference(beta-eta_normalization,[],[f267])).
% 0.19/0.30 thf(f594,plain,(
% 0.19/0.30 ( ! [X2 : $i,X1 : $i] : ((lSue_THFTYPE_i = X2) | ($false = ((lSue_THFTYPE_i = X1)))) ) | ~spl0_1),
% 0.19/0.30 inference(equality_proxy_clausification,[],[f593])).
% 0.19/0.30 thf(f595,plain,(
% 0.19/0.30 ( ! [X2 : $i,X1 : $i] : ((lSue_THFTYPE_i = X2) | (lSue_THFTYPE_i != X1)) ) | ~spl0_1),
% 0.19/0.30 inference(equality_proxy_clausification,[],[f594])).
% 0.19/0.30 thf(f640,definition,(
% 0.19/0.30 spl0_29 <=> ! [X1 : $i] : (lSue_THFTYPE_i = X1)),
% 0.19/0.30 introduced(definition,[new_symbols(definition,[spl0_29])],[avatar_definition])).
% 0.19/0.30 thf(f641,plain,(
% 0.19/0.30 ( ! [X1 : $i] : ((lSue_THFTYPE_i = X1)) ) | ~spl0_29),
% 0.19/0.30 inference(avatar_component_clause,[],[f640])).
% 0.19/0.30 thf(f643,definition,(
% 0.19/0.30 spl0_30 <=> ! [X2 : $i] : (lSue_THFTYPE_i != X2)),
% 0.19/0.30 introduced(definition,[new_symbols(definition,[spl0_30])],[avatar_definition])).
% 0.19/0.30 thf(f644,plain,(
% 0.19/0.30 ( ! [X2 : $i] : ((lSue_THFTYPE_i != X2)) ) | ~spl0_30),
% 0.19/0.30 inference(avatar_component_clause,[],[f643])).
% 0.19/0.30 thf(f648,plain,(
% 0.19/0.30 spl0_30 | spl0_29 | ~spl0_1),
% 0.19/0.30 inference(avatar_split_clause,[],[f595,f49,f640,f643])).
% 0.19/0.30 thf(f748,plain,(
% 0.19/0.30 ($true = ((holdsDuring_THFTYPE_IiooI @ lSue_THFTYPE_i @ (~ (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBen_THFTYPE_i))))) | ~spl0_29),
% 0.19/0.30 inference(constrained_superposition,[],[f17,f641])).
% 0.19/0.30 thf(f750,plain,(
% 0.19/0.30 ($true = ((holdsDuring_THFTYPE_IiooI @ lSue_THFTYPE_i @ (~ $false)))) | (~spl0_11 | ~spl0_29)),
% 0.19/0.30 inference(forward_demodulation,[],[f748,f144])).
% 0.19/0.30 thf(f985,definition,(
% 0.19/0.30 spl0_35 <=> ($true = ((holdsDuring_THFTYPE_IiooI @ lSue_THFTYPE_i @ $true)))),
% 0.19/0.30 introduced(definition,[new_symbols(definition,[spl0_35])],[avatar_definition])).
% 0.19/0.30 thf(f1630,plain,(
% 0.19/0.30 $false | ~spl0_30),
% 0.19/0.30 inference(equality_resolution,[],[f644])).
% 0.19/0.30 thf(f1631,plain,(
% 0.19/0.30 ~spl0_30),
% 0.19/0.30 inference(avatar_contradiction_clause,[],[f1630])).
% 0.19/0.30 thf(f1637,plain,(
% 0.19/0.30 ($true = ((holdsDuring_THFTYPE_IiooI @ lSue_THFTYPE_i @ $true))) | (~spl0_11 | ~spl0_29)),
% 0.19/0.30 inference(boolean_simplification,[],[f750])).
% 0.19/0.30 thf(f1805,plain,(
% 0.19/0.30 spl0_35 | ~spl0_11 | ~spl0_29),
% 0.19/0.30 inference(avatar_split_clause,[],[f1637,f640,f142,f985])).
% 0.19/0.30 thf(f2552,plain,(
% 0.19/0.30 ( ! [X2 : $i,X0 : ($i > $i > $i),X1 : $i] : (($true != ((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (~ (likes_THFTYPE_IiioI @ (X0 @ lSue_THFTYPE_i @ X2) @ X2))))) | (lBill_THFTYPE_i != X1)) ) | ~spl0_29),
% 0.19/0.30 inference(backward_subsumption_resolution,[],[f81,f641])).
% 0.19/0.30 thf(f2621,plain,(
% 0.19/0.30 ( ! [X2 : $i,X0 : ($i > $i > $i),X1 : $i] : (($true != ((holdsDuring_THFTYPE_IiooI @ lSue_THFTYPE_i @ (~ (likes_THFTYPE_IiioI @ (X0 @ lSue_THFTYPE_i @ X2) @ X2))))) | (lBill_THFTYPE_i != X1)) ) | ~spl0_29),
% 0.19/0.30 inference(forward_demodulation,[],[f2552,f641])).
% 0.19/0.30 thf(f2637,plain,(
% 0.19/0.30 ( ! [X2 : $i,X1 : $i] : (($true != ((holdsDuring_THFTYPE_IiooI @ lSue_THFTYPE_i @ (~ (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X2))))) | (lBill_THFTYPE_i != X1)) ) | ~spl0_29),
% 0.19/0.30 inference(forward_demodulation,[],[f2621,f641])).
% 0.19/0.30 thf(f2649,plain,(
% 0.19/0.30 ( ! [X2 : $i,X1 : $i] : ((lSue_THFTYPE_i != X1) | ($true != ((holdsDuring_THFTYPE_IiooI @ lSue_THFTYPE_i @ (~ (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X2)))))) ) | ~spl0_29),
% 0.19/0.30 inference(forward_demodulation,[],[f2637,f641])).
% 0.19/0.30 thf(f2658,plain,(
% 0.19/0.30 ( ! [X2 : $i] : (($true != ((holdsDuring_THFTYPE_IiooI @ lSue_THFTYPE_i @ (~ (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X2)))))) ) | ~spl0_29),
% 0.19/0.30 inference(forward_subsumption_resolution,[],[f2649,f641])).
% 0.19/0.30 thf(f2663,plain,(
% 0.19/0.30 ($true != ((holdsDuring_THFTYPE_IiooI @ lSue_THFTYPE_i @ (~ $false)))) | (~spl0_11 | ~spl0_29)),
% 0.19/0.30 inference(constrained_superposition,[],[f2658,f144])).
% 0.19/0.30 thf(f2705,plain,(
% 0.19/0.30 ($true != ((holdsDuring_THFTYPE_IiooI @ lSue_THFTYPE_i @ $true))) | (~spl0_11 | ~spl0_29)),
% 0.19/0.30 inference(boolean_simplification,[],[f2663])).
% 0.19/0.30 thf(f2722,plain,(
% 0.19/0.30 ~spl0_35 | ~spl0_11 | ~spl0_29),
% 0.19/0.30 inference(avatar_split_clause,[],[f2705,f640,f142,f985])).
% 0.19/0.30 cnf(s14, plain, spl0_11, inference(sat_conversion,[],[f173])).
% 0.19/0.30 cnf(s20, plain, spl0_1 | ~spl0_2, inference(sat_conversion,[],[f240])).
% 0.19/0.30 cnf(s21, plain, spl0_2 | ~spl0_11, inference(sat_conversion,[],[f241])).
% 0.19/0.30 cnf(s42, plain, ~spl0_1 | spl0_29 | spl0_30, inference(sat_conversion,[],[f648])).
% 0.19/0.30 cnf(s112, plain, ~spl0_30, inference(sat_conversion,[],[f1631])).
% 0.19/0.30 cnf(s121, plain, ~spl0_11 | ~spl0_29 | spl0_35, inference(sat_conversion,[],[f1805])).
% 0.19/0.30 cnf(s276, plain, ~spl0_11 | ~spl0_29 | ~spl0_35, inference(sat_conversion,[],[f2722])).
% 0.19/0.30 cnf(s290, plain, ~spl0_1 | spl0_29, inference(rat,[],[s42,s112])).
% 0.19/0.30 cnf(s296, plain, spl0_2, inference(rat,[],[s21,s14])).
% 0.19/0.30 cnf(s301, plain, spl0_1, inference(rat,[],[s20,s296])).
% 0.19/0.30 cnf(s303, plain, spl0_29, inference(rat,[],[s290,s301])).
% 0.19/0.30 cnf(s305, plain, ~spl0_35, inference(rat,[],[s276,s14,s303])).
% 0.19/0.30 cnf(s310, plain, $false, inference(rat,[],[s121,s14,s305,s303])).
% 0.19/0.30 thf(f2759,plain,(
% 0.19/0.30 $false),
% 0.19/0.30 inference(avatar_sat_refutation,[],[s310])).
% 0.19/0.30 % SZS output end Proof for theBenchmark
% 0.19/0.30 % (1638773)------------------------------
% 0.19/0.30 % (1638773)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.30 % (1638773)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.30 % (1638773)CaDiCaL version: 2.1.3
% 0.19/0.30 % (1638773)Termination reason: Refutation
% 0.19/0.30 % (1638773)Time elapsed: 0.038 s
% 0.19/0.30 % (1638773)Peak memory usage: 13 MB
% 0.19/0.30 % (1638773)Instructions burned: 144 (million)
% 0.19/0.30 % (1638767)Success in time 0.063 s
% 0.19/0.30 % Vampire exiting
%------------------------------------------------------------------------------