%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYO040^1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n009.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 08:48:46 AM UTC 2026
% Result : Unsatisfiable 0.11s 0.26s
% Output : Refutation 0.11s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO040^1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.17 % Computer : n009.cluster.edu
% 0.11/0.17 % Model : x86_64 x86_64
% 0.11/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.17 % Memory : 8046.5625MB
% 0.11/0.17 % OS : Linux 6.8.0-71-generic
% 0.11/0.17 % CPULimit : 300
% 0.11/0.17 % WCLimit : 300
% 0.11/0.17 % DateTime : Tue Sep 29 16:23:45 UTC 2026
% 0.11/0.17 % CPUTime :
% 0.11/0.17 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.20 Running first-order model finding
% 0.11/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.11/0.26 % (10679)Will run a generic schedule for satisfiability detection.
% 0.11/0.26 % (10684)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2904226701_2999 on theBenchmark for (2999ds/0Mi)
% 0.11/0.26 % Exception at run slice level
% 0.11/0.26 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.11/0.26 % (10687)dis+10_1_sil=32000:sp=arity:random_seed=2229791824:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.11/0.26 % (10686)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2763103319:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.11/0.26 % (10692)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2900895708:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.11/0.26 % Exception at run slice level
% 0.11/0.26 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.11/0.26 % (10685)% WARNING: option uhcvi not known.
% 0.11/0.26 % (10686) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-10679-10686"...
% 0.11/0.26 % (10690)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3445101180:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.11/0.26 % (10686)...printing done.
% 0.11/0.26 % (10686)Refutation found. Thanks to Tanya!
% 0.11/0.26 % SZS status Unsatisfiable for theBenchmark
% 0.11/0.26 % SZS output start Proof for theBenchmark
% 0.11/0.26 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.11/0.26 thf(func_def_0, type, f: ($o > $o)).
% 0.11/0.26 thf(func_def_1, type, h: ($o > $i)).
% 0.11/0.26 thf(func_def_2, type, x: $o).
% 0.11/0.26 thf(f1,axiom,(
% 0.11/0.26 (((h @ (f @ (f @ (f @ x))))) != ((h @ (f @ x))))),
% 0.11/0.26 file('/export/starexec/sandbox/benchmark/theBenchmark.p',2)).
% 0.11/0.26 thf(f2,plain,(
% 0.11/0.26 (((h @ (f @ (f @ (f @ x))))) != ((h @ (f @ x))))),
% 0.11/0.26 inference(cnf_transformation,[],[f1])).
% 0.11/0.26 thf(f4,definition,(
% 0.11/0.26 ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 0.11/0.26 introduced(theory,[fool_exhaustiveness_axiom])).
% 0.11/0.26 thf(f14,plain,(
% 0.11/0.26 (((h @ (f @ (f @ $true)))) != ((h @ $true))) | (((f @ x)) = $false)),
% 0.11/0.26 inference(constrained_superposition,[],[f2,f4])).
% 0.11/0.26 thf(f79,definition,(
% 0.11/0.26 spl0_3 <=> (((f @ x)) = $false)),
% 0.11/0.26 introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition])).
% 0.11/0.26 thf(f80,plain,(
% 0.11/0.26 (((f @ x)) != $false) | spl0_3),
% 0.11/0.26 inference(avatar_component_clause,[],[f79])).
% 0.11/0.26 thf(f81,plain,(
% 0.11/0.26 (((f @ x)) = $false) | ~spl0_3),
% 0.11/0.26 inference(avatar_component_clause,[],[f79])).
% 0.11/0.26 thf(f83,definition,(
% 0.11/0.26 spl0_4 <=> (((h @ (f @ (f @ $true)))) = ((h @ $true)))),
% 0.11/0.26 introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition])).
% 0.11/0.26 thf(f85,plain,(
% 0.11/0.26 (((h @ (f @ (f @ $true)))) != ((h @ $true))) | spl0_4),
% 0.11/0.26 inference(avatar_component_clause,[],[f83])).
% 0.11/0.26 thf(f86,plain,(
% 0.11/0.26 spl0_3 | ~spl0_4),
% 0.11/0.26 inference(avatar_split_clause,[],[f14,f83,f79])).
% 0.11/0.26 thf(f87,plain,(
% 0.11/0.26 ($false = ((f @ $true))) | (x = $false) | ~spl0_3),
% 0.11/0.26 inference(constrained_superposition,[],[f81,f4])).
% 0.11/0.26 thf(f89,plain,(
% 0.11/0.26 (((h @ (f @ (f @ $false)))) != ((h @ $false))) | ~spl0_3),
% 0.11/0.26 inference(constrained_superposition,[],[f2,f81])).
% 0.11/0.26 thf(f94,definition,(
% 0.11/0.26 spl0_5 <=> (x = $false)),
% 0.11/0.26 introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition])).
% 0.11/0.26 thf(f95,plain,(
% 0.11/0.26 (x != $false) | spl0_5),
% 0.11/0.26 inference(avatar_component_clause,[],[f94])).
% 0.11/0.26 thf(f96,plain,(
% 0.11/0.26 (x = $false) | ~spl0_5),
% 0.11/0.26 inference(avatar_component_clause,[],[f94])).
% 0.11/0.26 thf(f98,definition,(
% 0.11/0.26 spl0_6 <=> ($false = ((f @ $true)))),
% 0.11/0.26 introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition])).
% 0.11/0.26 thf(f99,plain,(
% 0.11/0.26 ($false != ((f @ $true))) | spl0_6),
% 0.11/0.26 inference(avatar_component_clause,[],[f98])).
% 0.11/0.26 thf(f100,plain,(
% 0.11/0.26 ($false = ((f @ $true))) | ~spl0_6),
% 0.11/0.26 inference(avatar_component_clause,[],[f98])).
% 0.11/0.26 thf(f101,plain,(
% 0.11/0.26 spl0_5 | spl0_6 | ~spl0_3),
% 0.11/0.26 inference(avatar_split_clause,[],[f87,f79,f98,f94])).
% 0.11/0.26 thf(f103,plain,(
% 0.11/0.26 ($false = ((f @ $false))) | (~spl0_3 | ~spl0_5)),
% 0.11/0.26 inference(constrained_superposition,[],[f81,f96])).
% 0.11/0.26 thf(f111,plain,(
% 0.11/0.26 (((h @ (f @ $false))) != ((h @ $false))) | (~spl0_3 | ~spl0_5)),
% 0.11/0.26 inference(constrained_superposition,[],[f89,f103])).
% 0.11/0.26 thf(f113,plain,(
% 0.11/0.26 (((h @ $false)) != ((h @ $false))) | (~spl0_3 | ~spl0_5)),
% 0.11/0.26 inference(forward_demodulation,[],[f111,f103])).
% 0.11/0.26 thf(f114,plain,(
% 0.11/0.26 $false | (~spl0_3 | ~spl0_5)),
% 0.11/0.26 inference(trivial_inequality_removal,[],[f113])).
% 0.11/0.26 thf(f115,plain,(
% 0.11/0.26 ~spl0_3 | ~spl0_5),
% 0.11/0.26 inference(avatar_contradiction_clause,[],[f114])).
% 0.11/0.26 thf(f169,plain,(
% 0.11/0.26 ($false != ((f @ $true))) | (x = $false) | spl0_3),
% 0.11/0.26 inference(constrained_superposition,[],[f80,f4])).
% 0.11/0.26 thf(f175,plain,(
% 0.11/0.26 (x = $false) | (spl0_3 | ~spl0_6)),
% 0.11/0.26 inference(forward_subsumption_resolution,[],[f169,f100])).
% 0.11/0.26 thf(f176,plain,(
% 0.11/0.26 $false | (spl0_3 | spl0_5 | ~spl0_6)),
% 0.11/0.26 inference(forward_subsumption_resolution,[],[f175,f95])).
% 0.11/0.26 thf(f177,plain,(
% 0.11/0.26 spl0_3 | spl0_5 | ~spl0_6),
% 0.11/0.26 inference(avatar_contradiction_clause,[],[f176])).
% 0.11/0.26 thf(f182,plain,(
% 0.11/0.26 (((h @ (f @ $true))) != ((h @ $true))) | ($false = ((f @ $true))) | spl0_4),
% 0.11/0.26 inference(constrained_superposition,[],[f85,f4])).
% 0.11/0.26 thf(f185,plain,(
% 0.11/0.26 (((h @ (f @ $true))) != ((h @ $true))) | (spl0_4 | spl0_6)),
% 0.11/0.26 inference(forward_subsumption_resolution,[],[f182,f99])).
% 0.11/0.26 thf(f187,plain,(
% 0.11/0.26 (((h @ $true)) != ((h @ $true))) | ($false = ((f @ $true))) | (spl0_4 | spl0_6)),
% 0.11/0.26 inference(constrained_superposition,[],[f185,f4])).
% 0.11/0.26 thf(f188,plain,(
% 0.11/0.26 ($false = ((f @ $true))) | (spl0_4 | spl0_6)),
% 0.11/0.26 inference(trivial_inequality_removal,[],[f187])).
% 0.11/0.26 thf(f189,plain,(
% 0.11/0.26 $false | (spl0_4 | spl0_6)),
% 0.11/0.26 inference(forward_subsumption_resolution,[],[f188,f99])).
% 0.11/0.26 thf(f190,plain,(
% 0.11/0.26 spl0_4 | spl0_6),
% 0.11/0.26 inference(avatar_contradiction_clause,[],[f189])).
% 0.11/0.26 thf(f193,plain,(
% 0.11/0.26 (((h @ (f @ (f @ $false)))) != ((h @ $false))) | ~spl0_3),
% 0.11/0.26 inference(constrained_superposition,[],[f2,f81])).
% 0.11/0.26 thf(f198,plain,(
% 0.11/0.26 ( ! [X0 : $o] : (($false = ((f @ X0))) | ($false = X0)) ) | ~spl0_6),
% 0.11/0.26 inference(constrained_superposition,[],[f100,f4])).
% 0.11/0.26 thf(f205,plain,(
% 0.11/0.26 (((h @ $false)) != ((h @ $false))) | ($false = ((f @ $false))) | (~spl0_3 | ~spl0_6)),
% 0.11/0.26 inference(constrained_superposition,[],[f193,f198])).
% 0.11/0.26 thf(f206,plain,(
% 0.11/0.26 ($false = ((f @ $false))) | (~spl0_3 | ~spl0_6)),
% 0.11/0.26 inference(trivial_inequality_removal,[],[f205])).
% 0.11/0.26 thf(f212,plain,(
% 0.11/0.26 (((h @ (f @ $false))) != ((h @ $false))) | (~spl0_3 | ~spl0_6)),
% 0.11/0.26 inference(constrained_superposition,[],[f193,f206])).
% 0.11/0.26 thf(f214,plain,(
% 0.11/0.26 (((h @ $false)) != ((h @ $false))) | (~spl0_3 | ~spl0_6)),
% 0.11/0.26 inference(forward_demodulation,[],[f212,f206])).
% 0.11/0.26 thf(f215,plain,(
% 0.11/0.26 $false | (~spl0_3 | ~spl0_6)),
% 0.11/0.26 inference(trivial_inequality_removal,[],[f214])).
% 0.11/0.26 thf(f216,plain,(
% 0.11/0.26 ~spl0_3 | ~spl0_6),
% 0.11/0.26 inference(avatar_contradiction_clause,[],[f215])).
% 0.11/0.26 thf(f226,plain,(
% 0.11/0.26 ($false != ((f @ $false))) | (spl0_3 | ~spl0_5)),
% 0.11/0.26 inference(constrained_superposition,[],[f80,f96])).
% 0.11/0.26 thf(f227,plain,(
% 0.11/0.26 (((h @ (f @ (f @ (f @ $false))))) != ((h @ (f @ $false)))) | ~spl0_5),
% 0.11/0.26 inference(constrained_superposition,[],[f2,f96])).
% 0.11/0.26 thf(f232,plain,(
% 0.11/0.26 (((h @ (f @ $false))) != ((h @ (f @ $false)))) | ($false = ((f @ $false))) | (~spl0_5 | ~spl0_6)),
% 0.11/0.26 inference(constrained_superposition,[],[f227,f198])).
% 0.11/0.26 thf(f235,plain,(
% 0.11/0.26 ($false = ((f @ $false))) | (~spl0_5 | ~spl0_6)),
% 0.11/0.26 inference(trivial_inequality_removal,[],[f232])).
% 0.11/0.26 thf(f236,plain,(
% 0.11/0.26 $false | (spl0_3 | ~spl0_5 | ~spl0_6)),
% 0.11/0.26 inference(forward_subsumption_resolution,[],[f235,f226])).
% 0.11/0.26 thf(f237,plain,(
% 0.11/0.26 spl0_3 | ~spl0_5 | ~spl0_6),
% 0.11/0.26 inference(avatar_contradiction_clause,[],[f236])).
% 0.11/0.26 cnf(s26, plain, spl0_3 | ~spl0_4, inference(sat_conversion,[],[f86])).
% 0.11/0.26 cnf(s35, plain, ~spl0_3 | spl0_5 | spl0_6, inference(sat_conversion,[],[f101])).
% 0.11/0.26 cnf(s45, plain, ~spl0_3 | ~spl0_5, inference(sat_conversion,[],[f115])).
% 0.11/0.26 cnf(s73, plain, spl0_3 | spl0_5 | ~spl0_6, inference(sat_conversion,[],[f177])).
% 0.11/0.26 cnf(s84, plain, spl0_4 | spl0_6, inference(sat_conversion,[],[f190])).
% 0.11/0.26 cnf(s100, plain, ~spl0_3 | ~spl0_6, inference(sat_conversion,[],[f216])).
% 0.11/0.26 cnf(s118, plain, spl0_3 | ~spl0_5 | ~spl0_6, inference(sat_conversion,[],[f237])).
% 0.11/0.26 cnf(s120, plain, ~spl0_6 | spl0_3, inference(rat,[],[s73,s118])).
% 0.11/0.26 cnf(s121, plain, spl0_3, inference(rat,[],[s120,s84,s26])).
% 0.11/0.26 cnf(s122, plain, ~spl0_6, inference(rat,[],[s100,s121])).
% 0.11/0.26 cnf(s123, plain, ~spl0_5, inference(rat,[],[s45,s121])).
% 0.11/0.26 cnf(s124, plain, $false, inference(rat,[],[s35,s123,s122,s121])).
% 0.11/0.26 thf(f241,plain,(
% 0.11/0.26 $false),
% 0.11/0.26 inference(avatar_sat_refutation,[],[s124])).
% 0.11/0.26 % SZS output end Proof for theBenchmark
% 0.11/0.26 % (10686)------------------------------
% 0.11/0.26 % (10686)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.26 % (10686)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.26 % (10686)CaDiCaL version: 2.1.3
% 0.11/0.26 % (10686)Termination reason: Refutation
% 0.11/0.26 % (10686)Time elapsed: 0.007 s
% 0.11/0.26 % (10686)Peak memory usage: 13 MB
% 0.11/0.26 % (10686)Instructions burned: 10 (million)
% 0.11/0.26 % (10679)Success in time 0.043 s
% 0.11/0.26 % Vampire exiting
%------------------------------------------------------------------------------