%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : CSR128^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 : n012.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:16 AM UTC 2026
% Result : Theorem 0.06s 0.17s
% Output : Refutation 0.06s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : CSR128^1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.06/0.12 % Computer : n012.cluster.edu
% 0.06/0.12 % Model : x86_64 x86_64
% 0.06/0.12 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.12 % Memory : 8046.5625MB
% 0.06/0.12 % OS : Linux 6.8.0-71-generic
% 0.06/0.12 % CPULimit : 300
% 0.06/0.12 % WCLimit : 300
% 0.06/0.12 % DateTime : Tue Sep 29 17:55:04 UTC 2026
% 0.06/0.12 % CPUTime :
% 0.06/0.12 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.06/0.13 Running first-order model finding
% 0.06/0.13 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.06/0.17 % (459993)Will run a generic schedule for satisfiability detection.
% 0.06/0.17 % (459999)% WARNING: option uhcvi not known.
% 0.06/0.17 % (459999)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3436322520:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.06/0.17 % (460000)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=314907889:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.06/0.17 % (459998)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3611787460_2999 on theBenchmark for (2999ds/0Mi)
% 0.06/0.17 % (460002)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3032282359:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.06/0.17 % (459999)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.06/0.17 % (459999)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.06/0.17 % Exception at run slice level
% 0.06/0.17 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.06/0.17 % (460002)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.06/0.17 % (459999) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-459993-459999"...
% 0.06/0.17 % (460002) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-459993-460002"...
% 0.06/0.17 % (459999)...printing done.
% 0.06/0.17 % (459999)Refutation found. Thanks to Tanya!
% 0.06/0.17 % SZS status Theorem for theBenchmark
% 0.06/0.17 % SZS output start Proof for theBenchmark
% 0.06/0.17 thf(type_def_5, type, num: $tType).
% 0.06/0.17 thf(type_def_6, type, sTfun: ($tType * $tType) > $tType).
% 0.06/0.17 thf(func_def_0, type, holdsDuring_THFTYPE_IiooI: ($i > $o > $o)).
% 0.06/0.17 thf(func_def_4, type, lYearFn_THFTYPE_IiiI: ($i > $i)).
% 0.06/0.17 thf(func_def_5, type, likes_THFTYPE_IiioI: ($i > $i > $o)).
% 0.06/0.17 thf(func_def_10, type, vIMP: ($o > $o > $o)).
% 0.06/0.17 thf(func_def_12, type, vNOT: ($o > $o)).
% 0.06/0.17 thf(f1,axiom,(
% 0.06/0.17 (holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i))),
% 0.06/0.17 file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax)).
% 0.06/0.17 thf(f2,axiom,(
% 0.06/0.17 ! [X0 : $i] : (holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X0) => (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X0))),
% 0.06/0.17 file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_001)).
% 0.06/0.17 thf(f3,conjecture,(
% 0.06/0.17 ? [X0 : $i,X1 : $i] : (holdsDuring_THFTYPE_IiooI @ X0 @ (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1))),
% 0.06/0.17 file('/export/starexec/sandbox/benchmark/theBenchmark.p',con)).
% 0.06/0.17 thf(f4,negated_conjecture,(
% 0.06/0.17 ~ ? [X0 : $i,X1 : $i] : (holdsDuring_THFTYPE_IiooI @ X0 @ (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1))),
% 0.06/0.17 inference(negated_conjecture,[status(cth)],[f3])).
% 0.06/0.17 thf(f5,plain,(
% 0.06/0.17 (holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i))),
% 0.06/0.17 inference(rectify,[],[f1])).
% 0.06/0.17 thf(f6,plain,(
% 0.06/0.17 (((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i))) = $true)),
% 0.06/0.17 inference(fool_elimination,[],[f5])).
% 0.06/0.17 thf(f7,plain,(
% 0.06/0.17 ! [X0 : $i] : (holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X0) => (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X0))),
% 0.06/0.17 inference(rectify,[],[f2])).
% 0.06/0.17 thf(f8,plain,(
% 0.06/0.17 ! [X0 : $i] : ($true = ((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ ((likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X0) => (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X0)))))),
% 0.06/0.17 inference(fool_elimination,[],[f7])).
% 0.06/0.17 thf(f9,plain,(
% 0.06/0.17 ~ ? [X0 : $i,X1 : $i] : (holdsDuring_THFTYPE_IiooI @ X0 @ (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1))),
% 0.06/0.17 inference(rectify,[],[f4])).
% 0.06/0.17 thf(f10,plain,(
% 0.06/0.17 ~ ? [X0 : $i,X1 : $i] : (((holdsDuring_THFTYPE_IiooI @ X0 @ (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1))) = $true)),
% 0.06/0.17 inference(fool_elimination,[],[f9])).
% 0.06/0.17 thf(f11,plain,(
% 0.06/0.17 ! [X0 : $i,X1 : $i] : (((holdsDuring_THFTYPE_IiooI @ X0 @ (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1))) != $true)),
% 0.06/0.17 inference(ennf_transformation,[],[f10])).
% 0.06/0.17 thf(f12,plain,(
% 0.06/0.17 (((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i))) = $true)),
% 0.06/0.17 inference(cnf_transformation,[],[f6])).
% 0.06/0.17 thf(f13,plain,(
% 0.06/0.17 ( ! [X0 : $i] : (($true = ((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ ((likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X0) => (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X0)))))) )),
% 0.06/0.17 inference(cnf_transformation,[],[f8])).
% 0.06/0.17 thf(f14,plain,(
% 0.06/0.17 ( ! [X0 : $i,X1 : $i] : ((((holdsDuring_THFTYPE_IiooI @ X0 @ (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1))) != $true)) )),
% 0.06/0.17 inference(cnf_transformation,[],[f11])).
% 0.06/0.17 thf(f16,definition,(
% 0.06/0.17 ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 0.06/0.17 introduced(theory,[fool_exhaustiveness_axiom])).
% 0.06/0.17 thf(f19,plain,(
% 0.06/0.17 ( ! [X0 : $i,X1 : $i] : (($true != ((holdsDuring_THFTYPE_IiooI @ X0 @ $true))) | (((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1)) = $false)) )),
% 0.06/0.17 inference(constrained_superposition,[],[f14,f16])).
% 0.06/0.17 thf(f20,plain,(
% 0.06/0.17 ( ! [X0 : $i,X1 : $i] : (($true != $true) | (((holdsDuring_THFTYPE_IiooI @ X0 @ (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1))) = $false)) )),
% 0.06/0.17 inference(constrained_superposition,[],[f14,f16])).
% 0.06/0.17 thf(f22,plain,(
% 0.06/0.17 ( ! [X0 : $i,X1 : $i] : ((((holdsDuring_THFTYPE_IiooI @ X0 @ (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1))) = $false)) )),
% 0.06/0.17 inference(trivial_inequality_removal,[],[f20])).
% 0.06/0.17 thf(f28,definition,(
% 0.06/0.17 spl0_1 <=> ! [X1 : $i] : (((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1)) = $false)),
% 0.06/0.17 introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition])).
% 0.06/0.17 thf(f29,plain,(
% 0.06/0.17 ( ! [X1 : $i] : ((((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1)) = $false)) ) | ~spl0_1),
% 0.06/0.17 inference(avatar_component_clause,[],[f28])).
% 0.06/0.17 thf(f31,definition,(
% 0.06/0.17 spl0_2 <=> ! [X0 : $i] : ($true != ((holdsDuring_THFTYPE_IiooI @ X0 @ $true)))),
% 0.06/0.17 introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition])).
% 0.06/0.17 thf(f32,plain,(
% 0.06/0.17 ( ! [X0 : $i] : (($true != ((holdsDuring_THFTYPE_IiooI @ X0 @ $true)))) ) | ~spl0_2),
% 0.06/0.17 inference(avatar_component_clause,[],[f31])).
% 0.06/0.17 thf(f33,plain,(
% 0.06/0.17 spl0_1 | spl0_2),
% 0.06/0.17 inference(avatar_split_clause,[],[f19,f31,f28])).
% 0.06/0.17 thf(f46,plain,(
% 0.06/0.17 ( ! [X0 : $i] : (($true = ((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ ($true => (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X0))))) | (((likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X0)) = $false)) )),
% 0.06/0.17 inference(constrained_superposition,[],[f13,f16])).
% 0.06/0.17 thf(f48,plain,(
% 0.06/0.17 ( ! [X0 : $i] : (($true = ((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ $true))) | ((((likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X0) => (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X0))) = $false)) )),
% 0.06/0.17 inference(constrained_superposition,[],[f13,f16])).
% 0.06/0.17 thf(f49,plain,(
% 0.06/0.17 ( ! [X0 : $i] : (($true = ((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ $true))) | (((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X0)) = $false)) )),
% 0.06/0.17 inference(imp_proxy_clausification,[],[f48])).
% 0.06/0.17 thf(f52,plain,(
% 0.06/0.17 ( ! [X0 : $i] : (($true = ((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X0)))) | (((likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X0)) = $false)) )),
% 0.06/0.17 inference(boolean_simplification,[],[f46])).
% 0.06/0.17 thf(f55,plain,(
% 0.06/0.17 ( ! [X0 : $i] : ((((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X0)) = $false)) ) | ~spl0_2),
% 0.06/0.17 inference(forward_subsumption_resolution,[],[f49,f32])).
% 0.06/0.17 thf(f58,plain,(
% 0.06/0.17 ( ! [X0 : $i] : ((((likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X0)) = $false)) )),
% 0.06/0.17 inference(forward_subsumption_resolution,[],[f52,f14])).
% 0.06/0.17 thf(f60,plain,(
% 0.06/0.17 spl0_1 | ~spl0_2),
% 0.06/0.17 inference(avatar_split_clause,[],[f55,f31,f28])).
% 0.06/0.17 thf(f82,plain,(
% 0.06/0.17 ($true = ((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ $false)))),
% 0.06/0.17 inference(constrained_superposition,[],[f12,f58])).
% 0.06/0.17 thf(f87,plain,(
% 0.06/0.17 ( ! [X0 : $i] : (($false = ((holdsDuring_THFTYPE_IiooI @ X0 @ $false)))) ) | ~spl0_1),
% 0.06/0.17 inference(forward_demodulation,[],[f22,f29])).
% 0.06/0.17 thf(f91,plain,(
% 0.06/0.17 ($true = $false) | ~spl0_1),
% 0.06/0.17 inference(forward_demodulation,[],[f82,f87])).
% 0.06/0.17 thf(f92,plain,(
% 0.06/0.17 $false | ~spl0_1),
% 0.06/0.17 inference(trivial_inequality_removal,[],[f91])).
% 0.06/0.17 thf(f93,plain,(
% 0.06/0.17 ~spl0_1),
% 0.06/0.17 inference(avatar_contradiction_clause,[],[f92])).
% 0.06/0.17 cnf(s1, plain, spl0_1 | spl0_2, inference(sat_conversion,[],[f33])).
% 0.06/0.17 cnf(s3, plain, spl0_1 | ~spl0_2, inference(sat_conversion,[],[f60])).
% 0.06/0.17 cnf(s10, plain, ~spl0_1, inference(sat_conversion,[],[f93])).
% 0.06/0.17 cnf(s11, plain, ~spl0_2, inference(rat,[],[s3,s10])).
% 0.06/0.17 cnf(s12, plain, $false, inference(rat,[],[s1,s11,s10])).
% 0.06/0.17 thf(f94,plain,(
% 0.06/0.17 $false),
% 0.06/0.17 inference(avatar_sat_refutation,[],[s12])).
% 0.06/0.17 % SZS output end Proof for theBenchmark
% 0.06/0.17 % (459999)------------------------------
% 0.06/0.17 % (459999)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.06/0.17 % (459999)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.06/0.17 % (459999)CaDiCaL version: 2.1.3
% 0.06/0.17 % (459999)Termination reason: Refutation
% 0.06/0.17 % (459999)Time elapsed: 0.003 s
% 0.06/0.17 % (459999)Peak memory usage: 12 MB
% 0.06/0.17 % (459999)Instructions burned: 5 (million)
% 0.06/0.17 % (459993)Success in time 0.032 s
% 0.06/0.17 % Vampire exiting
%------------------------------------------------------------------------------