%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SYO132^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 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:46:40 AM UTC 2026
% Result : Theorem 0.21s 0.26s
% Output : Refutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYO132^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.19 % Computer : n009.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 16:34:46 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.23 Running higher-order theorem proving
% 0.08/0.24 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.21/0.26 % (25904)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.21/0.26 % (25912)dis+1002_4:1_sfv=off:to=lpo:plsq=on:fde=none:e2e=on:si=on:spb=non_intro:acc=on:uwa=off:fd=preordered:foolp=on:s2agt=32:slsqc=1:slsq=on:random_seed=3875534980:hsq=on:hsqr=16,1:s2a=on:i=634:add=on:nm=16:nicw=on:rtra=on:gtg=position:ss=included:ixr=off:c=on:inj=on:ntd=on:rawr=on_2999 on theBenchmark for (2999ds/634Mi)
% 0.21/0.26 % (25912) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-25904-25912"...
% 0.21/0.26 % (25912)...printing done.
% 0.21/0.26 % (25912)Refutation found. Thanks to Tanya!
% 0.21/0.26 % SZS status Theorem for theBenchmark
% 0.21/0.26 % SZS output start Proof for theBenchmark
% 0.21/0.26 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.21/0.26 thf(func_def_1, type, cS: ($i > $o)).
% 0.21/0.26 thf(func_def_2, type, cT: ($i > $o)).
% 0.21/0.26 thf(func_def_3, type, cP: (($i > $o) > $o)).
% 0.21/0.26 thf(f1,conjecture,(
% 0.21/0.26 ((cP @ cS) & (cT @ cX) & (cS = cT)) => ((cP @ cT) & (cS @ cX))),
% 0.21/0.26 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM503)).
% 0.21/0.26 thf(f2,negated_conjecture,(
% 0.21/0.26 ~(((cP @ cS) & (cT @ cX) & (cS = cT)) => ((cP @ cT) & (cS @ cX)))),
% 0.21/0.26 inference(negated_conjecture,[status(cth)],[f1])).
% 0.21/0.26 thf(f3,plain,(
% 0.21/0.26 ~(((cP @ cS) & (cT @ cX) & (cS = cT)) => ((cP @ cT) & (cS @ cX)))),
% 0.21/0.26 inference(rectify,[],[f2])).
% 0.21/0.26 thf(f4,plain,(
% 0.21/0.26 ~(((((cP @ cS)) = $true) & (cS = cT) & (((cT @ cX)) = $true)) => ((((cS @ cX)) = $true) & (((cP @ cT)) = $true)))),
% 0.21/0.26 inference(fool_elimination,[],[f3])).
% 0.21/0.26 thf(f5,plain,(
% 0.21/0.26 ((((cP @ cT)) != $true) | (((cS @ cX)) != $true)) & ((((cP @ cS)) = $true) & (cS = cT) & (((cT @ cX)) = $true))),
% 0.21/0.26 inference(ennf_transformation,[],[f4])).
% 0.21/0.26 thf(f6,plain,(
% 0.21/0.26 (((cT @ cX)) = $true) & (((cP @ cS)) = $true) & ((((cP @ cT)) != $true) | (((cS @ cX)) != $true)) & (cS = cT)),
% 0.21/0.26 inference(flattening,[],[f5])).
% 0.21/0.26 thf(f7,plain,(
% 0.21/0.26 (cS = cT)),
% 0.21/0.26 inference(cnf_transformation,[],[f6])).
% 0.21/0.26 thf(f8,plain,(
% 0.21/0.26 (((cP @ cT)) != $true) | (((cS @ cX)) != $true)),
% 0.21/0.26 inference(cnf_transformation,[],[f6])).
% 0.21/0.26 thf(f9,plain,(
% 0.21/0.26 (((cP @ cS)) = $true)),
% 0.21/0.26 inference(cnf_transformation,[],[f6])).
% 0.21/0.26 thf(f10,plain,(
% 0.21/0.26 (((cT @ cX)) = $true)),
% 0.21/0.26 inference(cnf_transformation,[],[f6])).
% 0.21/0.26 thf(f13,definition,(
% 0.21/0.26 spl0_1 <=> (((cT @ cX)) = $true)),
% 0.21/0.26 introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition])).
% 0.21/0.26 thf(f16,plain,(
% 0.21/0.26 spl0_1),
% 0.21/0.26 inference(avatar_split_clause,[],[f10,f13])).
% 0.21/0.26 thf(f18,definition,(
% 0.21/0.26 spl0_2 <=> (((cP @ cT)) = $true)),
% 0.21/0.26 introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition])).
% 0.21/0.26 thf(f22,definition,(
% 0.21/0.26 spl0_3 <=> (((cS @ cX)) = $true)),
% 0.21/0.26 introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition])).
% 0.21/0.26 thf(f25,plain,(
% 0.21/0.26 ~spl0_2 | ~spl0_3),
% 0.21/0.26 inference(avatar_split_clause,[],[f8,f22,f18])).
% 0.21/0.26 thf(f27,definition,(
% 0.21/0.26 spl0_4 <=> (cS = cT)),
% 0.21/0.26 introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition])).
% 0.21/0.26 thf(f30,plain,(
% 0.21/0.26 spl0_4),
% 0.21/0.26 inference(avatar_split_clause,[],[f7,f27])).
% 0.21/0.26 thf(f32,definition,(
% 0.21/0.26 spl0_5 <=> (((cP @ cS)) = $true)),
% 0.21/0.26 introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition])).
% 0.21/0.26 thf(f35,plain,(
% 0.21/0.26 spl0_5),
% 0.21/0.26 inference(avatar_split_clause,[],[f9,f32])).
% 0.21/0.26 thf(f36,definition,(
% 0.21/0.26 (cS != cT) | (((cP @ cS)) != $true) | (((cP @ cT)) = $true)),
% 0.21/0.26 introduced(theory,[theory_tautology_sat_conflict])).
% 0.21/0.26 thf(f37,definition,(
% 0.21/0.26 (cS != cT) | (((cT @ cX)) != $true) | (((cS @ cX)) = $true)),
% 0.21/0.26 introduced(theory,[theory_tautology_sat_conflict])).
% 0.21/0.26 cnf(s1, plain, spl0_1, inference(sat_conversion,[],[f16])).
% 0.21/0.26 cnf(s2, plain, ~spl0_2 | ~spl0_3, inference(sat_conversion,[],[f25])).
% 0.21/0.26 cnf(s3, plain, spl0_4, inference(sat_conversion,[],[f30])).
% 0.21/0.26 cnf(s4, plain, spl0_5, inference(sat_conversion,[],[f35])).
% 0.21/0.26 cnf(s5, plain, spl0_2 | ~spl0_4 | ~spl0_5, inference(sat_conversion,[],[f36])).
% 0.21/0.26 cnf(s6, plain, ~spl0_1 | spl0_3 | ~spl0_4, inference(sat_conversion,[],[f37])).
% 0.21/0.26 cnf(s7, plain, spl0_2, inference(rat,[],[s5,s4,s3])).
% 0.21/0.26 cnf(s8, plain, ~spl0_3, inference(rat,[],[s2,s7])).
% 0.21/0.26 cnf(s9, plain, ~spl0_1, inference(rat,[],[s6,s3,s8])).
% 0.21/0.26 cnf(s10, plain, $false, inference(rat,[],[s1,s9])).
% 0.21/0.26 thf(f38,plain,(
% 0.21/0.26 $false),
% 0.21/0.26 inference(avatar_sat_refutation,[],[s10])).
% 0.21/0.26 % SZS output end Proof for theBenchmark
% 0.21/0.26 % (25912)------------------------------
% 0.21/0.26 % (25912)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.26 % (25912)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.26 % (25912)CaDiCaL version: 2.1.3
% 0.21/0.26 % (25912)Termination reason: Refutation
% 0.21/0.26 % (25912)Time elapsed: 0.001 s
% 0.21/0.26 % (25912)Peak memory usage: 12 MB
% 0.21/0.26 % (25912)Instructions burned: 1 (million)
% 0.21/0.26 % (25904)Success in time 0.017 s
% 0.21/0.26 % Vampire exiting
%------------------------------------------------------------------------------