%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : CSR139^2 : 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 : n013.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:19 AM UTC 2026
% Result : Theorem 0.09s 0.26s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR139^2 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19 % Computer : n013.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Tue Sep 29 17:55:52 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22 Running first-order model finding
% 0.09/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.09/0.26 % (2444249)Will run a generic schedule for satisfiability detection.
% 0.09/0.26 % (2444260)dis+10_1_sil=32000:sp=arity:random_seed=75506864:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.09/0.26 % (2444258)% WARNING: option uhcvi not known.
% 0.09/0.26 % (2444257)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=637562667_2999 on theBenchmark for (2999ds/0Mi)
% 0.09/0.26 % (2444258)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1515740119:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.09/0.26 % (2444259)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=485195739:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.09/0.26 % (2444262)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3618572916:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.09/0.26 % (2444263)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2066732368:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.09/0.26 % (2444261)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1559485148:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.09/0.26 % (2444258)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.09/0.26 % (2444260) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2444249-2444260"...
% 0.09/0.26 % Exception at run slice level
% 0.09/0.26 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.09/0.26 % (2444261)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.09/0.26 % (2444258)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.09/0.26 % (2444260)...printing done.
% 0.09/0.26 % (2444260)Refutation found. Thanks to Tanya!
% 0.09/0.26 % SZS status Theorem for theBenchmark
% 0.09/0.26 % SZS output start Proof for theBenchmark
% 0.09/0.26 thf(type_def_5, type, num: $tType).
% 0.09/0.26 thf(type_def_6, type, sTfun: ($tType * $tType) > $tType).
% 0.09/0.26 thf(func_def_1, type, domain_THFTYPE_IIiioIiioI: (($i > $i > $o) > $i > $i > $o)).
% 0.09/0.26 thf(func_def_2, type, domain_THFTYPE_IiiioI: ($i > $i > $i > $o)).
% 0.09/0.26 thf(func_def_4, type, holdsDuring_THFTYPE_IiooI: ($i > $o > $o)).
% 0.09/0.26 thf(func_def_5, type, instance_THFTYPE_IIiioIioI: (($i > $i > $o) > $i > $o)).
% 0.09/0.26 thf(func_def_6, type, instance_THFTYPE_IIiooIioI: (($i > $o > $o) > $i > $o)).
% 0.09/0.26 thf(func_def_7, type, instance_THFTYPE_IiioI: ($i > $i > $o)).
% 0.09/0.26 thf(func_def_17, type, likes_THFTYPE_IiioI: ($i > $i > $o)).
% 0.09/0.26 thf(func_def_20, type, parent_THFTYPE_IiioI: ($i > $i > $o)).
% 0.09/0.26 thf(func_def_21, type, range_THFTYPE_IiioI: ($i > $i > $o)).
% 0.09/0.26 thf(func_def_22, type, subclass_THFTYPE_IiioI: ($i > $i > $o)).
% 0.09/0.26 thf(func_def_23, type, subrelation_THFTYPE_IIioIIioIoI: (($i > $o) > ($i > $o) > $o)).
% 0.09/0.26 thf(func_def_24, type, subrelation_THFTYPE_IiioI: ($i > $i > $o)).
% 0.09/0.26 thf(func_def_26, type, vNOT: ($o > $o)).
% 0.09/0.26 thf(func_def_29, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.09/0.26 thf(func_def_30, type, sK0: ($i > $i)).
% 0.09/0.26 thf(func_def_31, type, db0: !>[X0: $tType]:(X0)).
% 0.09/0.26 thf(func_def_32, type, db1: !>[X0: $tType]:(X0)).
% 0.09/0.26 thf(func_def_33, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.09/0.26 thf(func_def_35, type, db2: !>[X0: $tType]:(X0)).
% 0.09/0.26 thf(f1,axiom,(
% 0.09/0.26 (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i)),
% 0.09/0.26 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax)).
% 0.09/0.26 thf(f5,axiom,(
% 0.09/0.26 (parent_THFTYPE_IiioI @ lMary_THFTYPE_i @ lAnna_THFTYPE_i)),
% 0.09/0.26 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_004)).
% 0.09/0.26 thf(f27,axiom,(
% 0.09/0.26 (~ (parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i))),
% 0.09/0.26 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_026)).
% 0.09/0.26 thf(f45,conjecture,(
% 0.09/0.26 ? [X0 : ($i > $i > $o),X1 : ($i > $i > $o),X2 : $i] : ((~ (X1 = X0)) & (X0 @ X2 @ lAnna_THFTYPE_i) & (X1 @ X2 @ lBill_THFTYPE_i))),
% 0.09/0.26 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con)).
% 0.09/0.26 thf(f46,negated_conjecture,(
% 0.09/0.26 ~ ? [X0 : ($i > $i > $o),X1 : ($i > $i > $o),X2 : $i] : ((~ (X1 = X0)) & (X0 @ X2 @ lAnna_THFTYPE_i) & (X1 @ X2 @ lBill_THFTYPE_i))),
% 0.09/0.26 inference(negated_conjecture,[status(cth)],[f45])).
% 0.09/0.26 thf(f47,plain,(
% 0.09/0.26 (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i)),
% 0.09/0.26 inference(rectify,[],[f1])).
% 0.20/0.26 thf(f48,plain,(
% 0.20/0.26 (((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i)) = $true)),
% 0.20/0.26 inference(fool_elimination,[],[f47])).
% 0.20/0.26 thf(f55,plain,(
% 0.20/0.26 (parent_THFTYPE_IiioI @ lMary_THFTYPE_i @ lAnna_THFTYPE_i)),
% 0.20/0.26 inference(rectify,[],[f5])).
% 0.20/0.26 thf(f56,plain,(
% 0.20/0.26 (((parent_THFTYPE_IiioI @ lMary_THFTYPE_i @ lAnna_THFTYPE_i)) = $true)),
% 0.20/0.26 inference(fool_elimination,[],[f55])).
% 0.20/0.26 thf(f99,plain,(
% 0.20/0.26 (~ (parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i))),
% 0.20/0.26 inference(rectify,[],[f27])).
% 0.20/0.26 thf(f100,plain,(
% 0.20/0.26 (((~ (parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i))) = $true)),
% 0.20/0.26 inference(fool_elimination,[],[f99])).
% 0.20/0.26 thf(f135,plain,(
% 0.20/0.26 ~ ? [X0 : ($i > $i > $o),X1 : ($i > $i > $o),X2 : $i] : ((~ (X1 = X0)) & (X0 @ X2 @ lAnna_THFTYPE_i) & (X1 @ X2 @ lBill_THFTYPE_i))),
% 0.20/0.26 inference(rectify,[],[f46])).
% 0.20/0.26 thf(f136,plain,(
% 0.20/0.26 ~ ? [X0 : ($i > $i > $o),X1 : ($i > $i > $o),X2 : $i] : (($true = ((~ (X0 = X1)))) & (((X0 @ X2 @ lAnna_THFTYPE_i)) = $true) & (((X1 @ X2 @ lBill_THFTYPE_i)) = $true))),
% 0.20/0.26 inference(fool_elimination,[],[f135])).
% 0.20/0.26 thf(f155,plain,(
% 0.20/0.26 ! [X0 : ($i > $i > $o),X1 : ($i > $i > $o),X2 : $i] : (($true != ((~ (X0 = X1)))) | (((X0 @ X2 @ lAnna_THFTYPE_i)) != $true) | (((X1 @ X2 @ lBill_THFTYPE_i)) != $true))),
% 0.20/0.26 inference(ennf_transformation,[],[f136])).
% 0.20/0.26 thf(f157,plain,(
% 0.20/0.26 (((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i)) = $true)),
% 0.20/0.26 inference(cnf_transformation,[],[f48])).
% 0.20/0.26 thf(f161,plain,(
% 0.20/0.26 (((parent_THFTYPE_IiioI @ lMary_THFTYPE_i @ lAnna_THFTYPE_i)) = $true)),
% 0.20/0.26 inference(cnf_transformation,[],[f56])).
% 0.20/0.26 thf(f183,plain,(
% 0.20/0.26 (((~ (parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i))) = $true)),
% 0.20/0.26 inference(cnf_transformation,[],[f100])).
% 0.20/0.26 thf(f201,plain,(
% 0.20/0.26 ( ! [X2 : $i,X0 : ($i > $i > $o),X1 : ($i > $i > $o)] : (($true != ((~ (X0 = X1)))) | (((X0 @ X2 @ lAnna_THFTYPE_i)) != $true) | (((X1 @ X2 @ lBill_THFTYPE_i)) != $true)) )),
% 0.20/0.26 inference(cnf_transformation,[],[f155])).
% 0.20/0.26 thf(f203,definition,(
% 0.20/0.26 ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 0.20/0.26 introduced(theory,[fool_exhaustiveness_axiom])).
% 0.20/0.26 thf(f206,plain,(
% 0.20/0.26 ( ! [X2 : $i,X0 : ($i > $i > $o),X1 : ($i > $i > $o)] : (($true = ((X0 = X1))) | (((X0 @ X2 @ lAnna_THFTYPE_i)) != $true) | (((X1 @ X2 @ lBill_THFTYPE_i)) != $true)) )),
% 0.20/0.26 inference(not_proxy_clausification,[],[f201])).
% 0.20/0.26 thf(f207,plain,(
% 0.20/0.26 ( ! [X2 : $i,X0 : ($i > $i > $o),X1 : ($i > $i > $o)] : ((((X1 @ X2 @ lBill_THFTYPE_i)) != $true) | (((X0 @ X2 @ lAnna_THFTYPE_i)) != $true) | (X0 = X1)) )),
% 0.20/0.26 inference(equality_proxy_clausification,[],[f206])).
% 0.20/0.26 thf(f208,plain,(
% 0.20/0.26 (((parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i)) = $false)),
% 0.20/0.26 inference(not_proxy_clausification,[],[f183])).
% 0.20/0.26 thf(f219,plain,(
% 0.20/0.26 ( ! [X2 : $i,X0 : ($i > $i > $o)] : (($true != (((^[Y0 : $i]: ((^[Y1 : $i]: (Y0 = Y1)))) @ X2 @ lBill_THFTYPE_i))) | (((X0 @ X2 @ lAnna_THFTYPE_i)) != $true) | ((^[Y0 : $i]: ((^[Y1 : $i]: (Y0 = Y1)))) = X0)) )),
% 0.20/0.26 inference(primitive_instantiation,[],[f207])).
% 0.20/0.26 thf(f233,plain,(
% 0.20/0.26 ( ! [X2 : $i,X0 : ($i > $i > $o)] : (($true != ((X2 = lBill_THFTYPE_i))) | (((X0 @ X2 @ lAnna_THFTYPE_i)) != $true) | (= = X0)) )),
% 0.20/0.26 inference(beta-eta_normalization,[],[f219])).
% 0.20/0.26 thf(f234,plain,(
% 0.20/0.26 ( ! [X2 : $i,X0 : ($i > $i > $o)] : ((((X0 @ X2 @ lAnna_THFTYPE_i)) != $true) | (lBill_THFTYPE_i != X2) | (= = X0)) )),
% 0.20/0.26 inference(equality_proxy_clausification,[],[f233])).
% 0.20/0.26 thf(f252,definition,(
% 0.20/0.26 spl1_1 <=> (= = (^[Y0 : $i]: ((^[Y1 : $i]: ($true)))))),
% 0.20/0.26 introduced(definition,[new_symbols(definition,[spl1_1])],[avatar_definition])).
% 0.20/0.26 thf(f254,plain,(
% 0.20/0.26 (= = (^[Y0 : $i]: ((^[Y1 : $i]: ($true))))) | ~spl1_1),
% 0.20/0.26 inference(avatar_component_clause,[],[f252])).
% 0.20/0.26 thf(f256,definition,(
% 0.20/0.26 spl1_2 <=> ! [X0 : $i] : (lBill_THFTYPE_i != X0)),
% 0.20/0.26 introduced(definition,[new_symbols(definition,[spl1_2])],[avatar_definition])).
% 0.20/0.26 thf(f257,plain,(
% 0.20/0.26 ( ! [X0 : $i] : ((lBill_THFTYPE_i != X0)) ) | ~spl1_2),
% 0.20/0.26 inference(avatar_component_clause,[],[f256])).
% 0.20/0.26 thf(f270,plain,(
% 0.20/0.26 ( ! [X0 : $o,X1 : $i] : (($true != X0) | (lBill_THFTYPE_i != X1) | (= = (^[Y0 : $i]: ((^[Y1 : $i]: ($true))))) | ($false = X0)) )),
% 0.20/0.26 inference(constrained_superposition,[],[f234,f203])).
% 0.20/0.26 thf(f281,plain,(
% 0.20/0.26 ( ! [X0 : $o,X1 : $i] : ((lBill_THFTYPE_i != X1) | (= = (^[Y0 : $i]: ((^[Y1 : $i]: ($true))))) | ($false = X0)) )),
% 0.20/0.26 inference(forward_subsumption_resolution,[],[f270,f203])).
% 0.20/0.26 thf(f284,definition,(
% 0.20/0.26 spl1_5 <=> ! [X0 : $o] : ($false = X0)),
% 0.20/0.26 introduced(definition,[new_symbols(definition,[spl1_5])],[avatar_definition])).
% 0.20/0.26 thf(f285,plain,(
% 0.20/0.26 ( ! [X0 : $o] : (($false = X0)) ) | ~spl1_5),
% 0.20/0.26 inference(avatar_component_clause,[],[f284])).
% 0.20/0.26 thf(f286,plain,(
% 0.20/0.26 spl1_5 | spl1_1 | spl1_2),
% 0.20/0.26 inference(avatar_split_clause,[],[f281,f256,f252,f284])).
% 0.20/0.26 thf(f291,plain,(
% 0.20/0.26 $false | ~spl1_2),
% 0.20/0.26 inference(equality_resolution,[],[f257])).
% 0.20/0.26 thf(f292,plain,(
% 0.20/0.26 ~spl1_2),
% 0.20/0.26 inference(avatar_contradiction_clause,[],[f291])).
% 0.20/0.26 thf(f314,plain,(
% 0.20/0.26 ($true = $false) | ~spl1_5),
% 0.20/0.26 inference(constrained_superposition,[],[f157,f285])).
% 0.20/0.26 thf(f320,plain,(
% 0.20/0.26 $false | ~spl1_5),
% 0.20/0.26 inference(trivial_inequality_removal,[],[f314])).
% 0.20/0.26 thf(f321,plain,(
% 0.20/0.26 ~spl1_5),
% 0.20/0.26 inference(avatar_contradiction_clause,[],[f320])).
% 0.20/0.26 thf(f334,plain,(
% 0.20/0.26 ( ! [X1 : $i] : (((((^[Y0 : $i]: ((^[Y1 : $i]: ($true)))) @ X1)) = ((= @ X1)))) ) | ~spl1_1),
% 0.20/0.26 inference(argument_congruence,[],[f254])).
% 0.20/0.26 thf(f335,plain,(
% 0.20/0.26 ( ! [X1 : $i] : (((^[Y0 : $i]: ($true)) = ((= @ X1)))) ) | ~spl1_1),
% 0.20/0.26 inference(beta-eta_normalization,[],[f334])).
% 0.20/0.26 thf(f351,plain,(
% 0.20/0.26 ( ! [X2 : $i,X1 : $i] : (((((^[Y0 : $i]: ($true)) @ X2)) = ((X1 = X2)))) ) | ~spl1_1),
% 0.20/0.26 inference(argument_congruence,[],[f335])).
% 0.20/0.26 thf(f353,plain,(
% 0.20/0.26 ( ! [X2 : $i,X1 : $i] : (($false = (((^[Y0 : $i]: ($true)) @ X2))) | ($true = ((X1 = X2)))) ) | ~spl1_1),
% 0.20/0.26 inference(iff_proxy_clausification,[],[f351])).
% 0.20/0.26 thf(f354,plain,(
% 0.20/0.26 ( ! [X2 : $i,X1 : $i] : (($false = (((^[Y0 : $i]: ($true)) @ X2))) | (X1 = X2)) ) | ~spl1_1),
% 0.20/0.26 inference(equality_proxy_clausification,[],[f353])).
% 0.20/0.26 thf(f355,plain,(
% 0.20/0.26 ( ! [X2 : $i,X1 : $i] : (($true = $false) | (X1 = X2)) ) | ~spl1_1),
% 0.20/0.26 inference(beta-eta_normalization,[],[f354])).
% 0.20/0.26 thf(f356,plain,(
% 0.20/0.26 ( ! [X2 : $i,X1 : $i] : ((X1 = X2)) ) | ~spl1_1),
% 0.20/0.26 inference(trivial_inequality_removal,[],[f355])).
% 0.20/0.26 thf(f363,plain,(
% 0.20/0.26 ( ! [X0 : $i] : (($true = ((parent_THFTYPE_IiioI @ X0 @ lAnna_THFTYPE_i)))) ) | ~spl1_1),
% 0.20/0.26 inference(constrained_superposition,[],[f161,f356])).
% 0.20/0.26 thf(f617,plain,(
% 0.20/0.26 ($true = $false) | ~spl1_1),
% 0.20/0.26 inference(forward_demodulation,[],[f208,f363])).
% 0.20/0.26 thf(f618,plain,(
% 0.20/0.26 $false | ~spl1_1),
% 0.20/0.26 inference(trivial_inequality_removal,[],[f617])).
% 0.20/0.26 thf(f619,plain,(
% 0.20/0.26 ~spl1_1),
% 0.20/0.26 inference(avatar_contradiction_clause,[],[f618])).
% 0.20/0.26 cnf(s4, plain, spl1_1 | spl1_2 | spl1_5, inference(sat_conversion,[],[f286])).
% 0.20/0.26 cnf(s6, plain, ~spl1_2, inference(sat_conversion,[],[f292])).
% 0.20/0.26 cnf(s8, plain, ~spl1_5, inference(sat_conversion,[],[f321])).
% 0.20/0.26 cnf(s10, plain, ~spl1_1, inference(sat_conversion,[],[f619])).
% 0.20/0.26 cnf(s12, plain, $false, inference(rat,[],[s4,s8,s6,s10])).
% 0.20/0.26 thf(f620,plain,(
% 0.20/0.26 $false),
% 0.20/0.26 inference(avatar_sat_refutation,[],[s12])).
% 0.20/0.26 % SZS output end Proof for theBenchmark
% 0.20/0.26 % (2444260)------------------------------
% 0.20/0.26 % (2444260)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.26 % (2444260)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.26 % (2444260)CaDiCaL version: 2.1.3
% 0.20/0.26 % (2444260)Termination reason: Refutation
% 0.20/0.26 % (2444260)Time elapsed: 0.010 s
% 0.20/0.26 % (2444260)Peak memory usage: 13 MB
% 0.20/0.26 % (2444260)Instructions burned: 31 (million)
% 0.20/0.26 % (2444249)Success in time 0.026 s
% 0.20/0.26 % Vampire exiting
%------------------------------------------------------------------------------