%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : CSR120^1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n016.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:03 AM UTC 2026
% Result : Theorem 0.10s 0.25s
% Output : Refutation 0.10s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR120^1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.17 % Computer : n016.cluster.edu
% 0.10/0.17 % Model : x86_64 x86_64
% 0.10/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.17 % Memory : 8046.5625MB
% 0.10/0.17 % OS : Linux 6.8.0-71-generic
% 0.10/0.17 % CPULimit : 300
% 0.10/0.17 % WCLimit : 300
% 0.10/0.17 % DateTime : Tue Sep 29 17:58:20 UTC 2026
% 0.10/0.17 % CPUTime :
% 0.10/0.17 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.20 Running higher-order theorem proving
% 0.10/0.22 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.25 % (694910)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.10/0.25 % (694920)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=2388792695:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.10/0.25 % (694920) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-694910-694920"...
% 0.10/0.25 % (694920)...printing done.
% 0.10/0.25 % (694920)Refutation found. Thanks to Tanya!
% 0.10/0.25 % SZS status Theorem for theBenchmark
% 0.10/0.25 % SZS output start Proof for theBenchmark
% 0.10/0.25 thf(type_def_5, type, num: $tType).
% 0.10/0.25 thf(type_def_6, type, sTfun: ($tType * $tType) > $tType).
% 0.10/0.25 thf(func_def_0, type, holdsDuring_THFTYPE_IiooI: ($i > $o > $o)).
% 0.10/0.25 thf(func_def_4, type, lYearFn_THFTYPE_IiiI: ($i > $i)).
% 0.10/0.25 thf(func_def_5, type, likes_THFTYPE_IiioI: ($i > $i > $o)).
% 0.10/0.25 thf(func_def_8, type, vNOT: ($o > $o)).
% 0.10/0.25 thf(func_def_9, type, vOR: ($o > $o > $o)).
% 0.10/0.25 thf(f1,axiom,(
% 0.10/0.25 (holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (~ (~ (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i)) | (~ (likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i))))),
% 0.10/0.25 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax)).
% 0.10/0.25 thf(f2,conjecture,(
% 0.10/0.25 ? [X0 : $i] : (holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (likes_THFTYPE_IiioI @ X0 @ lBill_THFTYPE_i))),
% 0.10/0.25 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con)).
% 0.10/0.25 thf(f3,negated_conjecture,(
% 0.10/0.25 ~ ? [X0 : $i] : (holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (likes_THFTYPE_IiioI @ X0 @ lBill_THFTYPE_i))),
% 0.10/0.25 inference(negated_conjecture,[status(cth)],[f2])).
% 0.10/0.25 thf(f4,plain,(
% 0.10/0.25 (holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (~ (~ (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i)) | (~ (likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i))))),
% 0.10/0.25 inference(rectify,[],[f1])).
% 0.10/0.25 thf(f5,plain,(
% 0.10/0.25 (((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (~ ((~ (likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i)) | (~ (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i)))))) = $true)),
% 0.10/0.25 inference(fool_elimination,[],[f4])).
% 0.10/0.25 thf(f6,plain,(
% 0.10/0.25 ~ ? [X0 : $i] : (holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (likes_THFTYPE_IiioI @ X0 @ lBill_THFTYPE_i))),
% 0.10/0.25 inference(rectify,[],[f3])).
% 0.10/0.25 thf(f7,plain,(
% 0.10/0.25 ~ ? [X0 : $i] : (((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (likes_THFTYPE_IiioI @ X0 @ lBill_THFTYPE_i))) = $true)),
% 0.10/0.25 inference(fool_elimination,[],[f6])).
% 0.10/0.25 thf(f8,plain,(
% 0.10/0.25 ! [X0 : $i] : (((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (likes_THFTYPE_IiioI @ X0 @ lBill_THFTYPE_i))) != $true)),
% 0.10/0.25 inference(ennf_transformation,[],[f7])).
% 0.10/0.25 thf(f9,plain,(
% 0.10/0.25 (((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (~ ((~ (likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i)) | (~ (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i)))))) = $true)),
% 0.10/0.25 inference(cnf_transformation,[],[f5])).
% 0.10/0.25 thf(f10,plain,(
% 0.10/0.25 ( ! [X0 : $i] : ((((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (likes_THFTYPE_IiioI @ X0 @ lBill_THFTYPE_i))) != $true)) )),
% 0.10/0.25 inference(cnf_transformation,[],[f8])).
% 0.10/0.25 thf(f12,definition,(
% 0.10/0.25 ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 0.10/0.25 introduced(theory,[fool_exhaustiveness_axiom])).
% 0.10/0.25 thf(f16,plain,(
% 0.10/0.25 (((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (~ ((~ (likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i)) | (~ $true))))) = $true) | (((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i)) = $false)),
% 0.10/0.25 inference(constrained_superposition,[],[f9,f12])).
% 0.10/0.25 thf(f17,plain,(
% 0.10/0.25 (((likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i)) = $false) | (((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (~ ((~ $true) | (~ (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i)))))) = $true)),
% 0.10/0.25 inference(constrained_superposition,[],[f9,f12])).
% 0.10/0.25 thf(f18,plain,(
% 0.10/0.25 ( ! [X0 : $i] : (($true != $true) | (((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (likes_THFTYPE_IiioI @ X0 @ lBill_THFTYPE_i))) = $false)) )),
% 0.10/0.25 inference(constrained_superposition,[],[f10,f12])).
% 0.10/0.25 thf(f24,plain,(
% 0.10/0.25 (((likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i)) = $false) | ($true = ((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (~ ($false | (~ (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i)))))))),
% 0.10/0.25 inference(boolean_simplification,[],[f17])).
% 0.10/0.25 thf(f25,plain,(
% 0.10/0.25 (((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (~ (~ (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i))))) = $true) | (((likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i)) = $false)),
% 0.10/0.25 inference(boolean_simplification,[],[f24])).
% 0.10/0.25 thf(f26,plain,(
% 0.10/0.25 (((likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i)) = $false) | (((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i))) = $true)),
% 0.10/0.25 inference(boolean_simplification,[],[f25])).
% 0.10/0.25 thf(f27,plain,(
% 0.10/0.25 ( ! [X0 : $i] : ((((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (likes_THFTYPE_IiioI @ X0 @ lBill_THFTYPE_i))) = $false)) )),
% 0.10/0.25 inference(trivial_inequality_removal,[],[f18])).
% 0.10/0.25 thf(f48,plain,(
% 0.10/0.25 (((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (~ ((~ (likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i)) | $false)))) = $true) | (((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i)) = $false)),
% 0.10/0.25 inference(boolean_simplification,[],[f16])).
% 0.10/0.25 thf(f49,plain,(
% 0.10/0.25 (((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (~ (~ (likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i))))) = $true) | (((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i)) = $false)),
% 0.10/0.25 inference(boolean_simplification,[],[f48])).
% 0.10/0.25 thf(f50,plain,(
% 0.10/0.25 (((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i)) = $false) | ($true = ((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i))))),
% 0.10/0.25 inference(boolean_simplification,[],[f49])).
% 0.10/0.25 thf(f51,plain,(
% 0.10/0.25 (((likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i)) = $false)),
% 0.10/0.25 inference(forward_subsumption_resolution,[],[f26,f10])).
% 0.10/0.25 thf(f57,definition,(
% 0.10/0.25 spl0_2 <=> (((likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i)) = $false)),
% 0.10/0.25 introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition])).
% 0.10/0.25 thf(f58,plain,(
% 0.10/0.25 (((likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i)) = $false) | ~spl0_2),
% 0.10/0.25 inference(avatar_component_clause,[],[f57])).
% 0.10/0.25 thf(f60,definition,(
% 0.10/0.25 spl0_3 <=> (((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i)) = $false)),
% 0.10/0.25 introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition])).
% 0.10/0.25 thf(f61,plain,(
% 0.10/0.25 (((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i)) = $false) | ~spl0_3),
% 0.10/0.25 inference(avatar_component_clause,[],[f60])).
% 0.10/0.25 thf(f81,plain,(
% 0.10/0.25 ($true = $false) | (((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i)) = $false)),
% 0.10/0.25 inference(forward_demodulation,[],[f50,f27])).
% 0.10/0.25 thf(f82,plain,(
% 0.10/0.25 (((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i)) = $false)),
% 0.10/0.25 inference(trivial_inequality_removal,[],[f81])).
% 0.10/0.25 thf(f83,plain,(
% 0.10/0.25 spl0_2),
% 0.10/0.25 inference(avatar_split_clause,[],[f51,f57])).
% 0.10/0.25 thf(f84,plain,(
% 0.10/0.25 spl0_3),
% 0.10/0.25 inference(avatar_split_clause,[],[f82,f60])).
% 0.10/0.25 thf(f85,plain,(
% 0.10/0.25 (((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (~ ((~ (likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i)) | (~ $false))))) = $true) | ~spl0_3),
% 0.10/0.25 inference(backward_demodulation,[],[f9,f61])).
% 0.10/0.25 thf(f86,plain,(
% 0.10/0.25 ($true = ((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (~ ((~ (likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i)) | $true))))) | ~spl0_3),
% 0.10/0.25 inference(boolean_simplification,[],[f85])).
% 0.10/0.25 thf(f87,plain,(
% 0.10/0.25 (((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (~ $true))) = $true) | ~spl0_3),
% 0.10/0.25 inference(boolean_simplification,[],[f86])).
% 0.10/0.25 thf(f88,plain,(
% 0.10/0.25 (((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ $false)) = $true) | ~spl0_3),
% 0.10/0.25 inference(boolean_simplification,[],[f87])).
% 0.10/0.25 thf(f108,plain,(
% 0.10/0.25 (((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ $false)) = $false) | ~spl0_2),
% 0.10/0.25 inference(constrained_superposition,[],[f27,f58])).
% 0.10/0.25 thf(f116,plain,(
% 0.10/0.25 ($true = $false) | (~spl0_2 | ~spl0_3)),
% 0.10/0.25 inference(forward_demodulation,[],[f88,f108])).
% 0.10/0.25 thf(f117,plain,(
% 0.10/0.25 $false | (~spl0_2 | ~spl0_3)),
% 0.10/0.25 inference(trivial_inequality_removal,[],[f116])).
% 0.10/0.25 thf(f118,plain,(
% 0.10/0.25 ~spl0_2 | ~spl0_3),
% 0.10/0.25 inference(avatar_contradiction_clause,[],[f117])).
% 0.10/0.25 cnf(s7, plain, spl0_2, inference(sat_conversion,[],[f83])).
% 0.10/0.25 cnf(s8, plain, spl0_3, inference(sat_conversion,[],[f84])).
% 0.10/0.25 cnf(s13, plain, ~spl0_2 | ~spl0_3, inference(sat_conversion,[],[f118])).
% 0.10/0.25 cnf(s15, plain, ~spl0_2, inference(rat,[],[s13,s8])).
% 0.10/0.25 cnf(s17, plain, $false, inference(rat,[],[s7,s15])).
% 0.10/0.25 thf(f122,plain,(
% 0.10/0.25 $false),
% 0.10/0.25 inference(avatar_sat_refutation,[],[s17])).
% 0.10/0.25 % SZS output end Proof for theBenchmark
% 0.10/0.25 % (694920)------------------------------
% 0.10/0.25 % (694920)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.25 % (694920)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.25 % (694920)CaDiCaL version: 2.1.3
% 0.10/0.25 % (694920)Termination reason: Refutation
% 0.10/0.25 % (694920)Time elapsed: 0.003 s
% 0.10/0.25 % (694920)Peak memory usage: 13 MB
% 0.10/0.25 % (694920)Instructions burned: 6 (million)
% 0.10/0.25 % (694910)Success in time 0.03 s
% 0.10/0.25 % Vampire exiting
%------------------------------------------------------------------------------