%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYO212^5 : 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 : n001.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:49:32 AM UTC 2026
% Result : Theorem 0.20s 0.27s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO212^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.20 % Computer : n001.cluster.edu
% 0.09/0.20 % Model : x86_64 x86_64
% 0.09/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20 % Memory : 8046.5625MB
% 0.09/0.20 % OS : Linux 6.8.0-71-generic
% 0.09/0.20 % CPULimit : 300
% 0.09/0.20 % WCLimit : 300
% 0.09/0.20 % DateTime : Tue Sep 29 16:45:21 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22 Running first-order model finding
% 0.09/0.22 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.20/0.27 % (1478750)Will run a generic schedule for satisfiability detection.
% 0.20/0.27 % (1478755)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2860465351_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.27 % Exception at run slice level
% 0.20/0.27 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.27 % (1478756)% WARNING: option uhcvi not known.
% 0.20/0.27 % (1478756)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4205919893:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.27 % (1478759)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=549635767:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.27 % (1478757)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2480829207:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.27 % (1478758)dis+10_1_sil=32000:sp=arity:random_seed=3784916404:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.27 % (1478759)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.27 % (1478756)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.27 % (1478756)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.20/0.27 % (1478757) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1478750-1478757"...
% 0.20/0.27 % (1478759) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1478750-1478759"...
% 0.20/0.27 % (1478758) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1478750-1478758"...
% 0.20/0.27 % (1478756) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1478750-1478756"...
% 0.20/0.27 % (1478757)...printing done.
% 0.20/0.27 % (1478759)...printing done.
% 0.20/0.27 % (1478763)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=178194936:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.20/0.27 % (1478758)...printing done.
% 0.20/0.27 % (1478756)...printing done.
% 0.20/0.27 % Exception at run slice level
% 0.20/0.27 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.27 % (1478757)Refutation found. Thanks to Tanya!
% 0.20/0.27 % SZS status Theorem for theBenchmark
% 0.20/0.27 % SZS output start Proof for theBenchmark
% 0.20/0.27 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.20/0.27 thf(func_def_0, type, b: $o).
% 0.20/0.27 thf(func_def_1, type, a: $o).
% 0.20/0.27 thf(func_def_5, type, vAND: ($o > $o > $o)).
% 0.20/0.27 thf(func_def_6, type, sK0: ($o > $o)).
% 0.20/0.27 thf(f1,conjecture,(
% 0.20/0.27 ! [X0 : ($o > $o)] : (((X0 @ b) & (X0 @ a)) => (X0 @ b & a))),
% 0.20/0.27 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cEMB2)).
% 0.20/0.27 thf(f2,negated_conjecture,(
% 0.20/0.27 ~ ! [X0 : ($o > $o)] : (((X0 @ b) & (X0 @ a)) => (X0 @ b & a))),
% 0.20/0.27 inference(negated_conjecture,[status(cth)],[f1])).
% 0.20/0.27 thf(f3,plain,(
% 0.20/0.27 ~ ! [X0 : ($o > $o)] : (((X0 @ b) & (X0 @ a)) => (X0 @ b & a))),
% 0.20/0.27 inference(rectify,[],[f2])).
% 0.20/0.27 thf(f4,plain,(
% 0.20/0.27 ~ ! [X0 : ($o > $o)] : (((((X0 @ b)) = $true) & (((X0 @ a)) = $true)) => ($true = ((X0 @ (a & b)))))),
% 0.20/0.27 inference(fool_elimination,[],[f3])).
% 0.20/0.27 thf(f5,plain,(
% 0.20/0.27 ? [X0 : ($o > $o)] : (($true != ((X0 @ (a & b)))) & ((((X0 @ b)) = $true) & (((X0 @ a)) = $true)))),
% 0.20/0.27 inference(ennf_transformation,[],[f4])).
% 0.20/0.27 thf(f6,plain,(
% 0.20/0.27 ? [X0 : ($o > $o)] : (($true != ((X0 @ (a & b)))) & (((X0 @ b)) = $true) & (((X0 @ a)) = $true))),
% 0.20/0.27 inference(flattening,[],[f5])).
% 0.20/0.27 thf(f7,plain,(
% 0.20/0.27 ($true != ((sK0 @ (a & b)))) & ($true = ((sK0 @ b))) & ($true = ((sK0 @ a)))),
% 0.20/0.27 inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f6])).
% 0.20/0.27 thf(f8,plain,(
% 0.20/0.27 ($true = ((sK0 @ a)))),
% 0.20/0.27 inference(cnf_transformation,[],[f7])).
% 0.20/0.27 thf(f9,plain,(
% 0.20/0.27 ($true = ((sK0 @ b)))),
% 0.20/0.27 inference(cnf_transformation,[],[f7])).
% 0.20/0.27 thf(f10,plain,(
% 0.20/0.27 ($true != ((sK0 @ (a & b))))),
% 0.20/0.27 inference(cnf_transformation,[],[f7])).
% 0.20/0.27 thf(f12,definition,(
% 0.20/0.27 ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 0.20/0.27 introduced(theory,[fool_exhaustiveness_axiom])).
% 0.20/0.27 thf(f24,plain,(
% 0.20/0.27 ($true != ((sK0 @ ($true & b)))) | (a = $false)),
% 0.20/0.27 inference(constrained_superposition,[],[f10,f12])).
% 0.20/0.27 thf(f30,plain,(
% 0.20/0.27 ($true != ((sK0 @ b))) | (a = $false)),
% 0.20/0.27 inference(boolean_simplification,[],[f24])).
% 0.20/0.27 thf(f36,plain,(
% 0.20/0.27 (a = $false)),
% 0.20/0.27 inference(forward_subsumption_resolution,[],[f30,f9])).
% 0.20/0.27 thf(f39,plain,(
% 0.20/0.27 ($true = ((sK0 @ $false)))),
% 0.20/0.27 inference(constrained_superposition,[],[f8,f36])).
% 0.20/0.27 thf(f40,plain,(
% 0.20/0.27 ($true != ((sK0 @ ($false & b))))),
% 0.20/0.27 inference(constrained_superposition,[],[f10,f36])).
% 0.20/0.27 thf(f41,plain,(
% 0.20/0.27 ($true != ((sK0 @ $false)))),
% 0.20/0.27 inference(boolean_simplification,[],[f40])).
% 0.20/0.27 thf(f43,plain,(
% 0.20/0.27 $false),
% 0.20/0.27 inference(global_subsumption,[],[f39,f41])).
% 0.20/0.27 % SZS output end Proof for theBenchmark
% 0.20/0.27 % (1478757)------------------------------
% 0.20/0.27 % (1478757)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.27 % (1478757)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.27 % (1478757)CaDiCaL version: 2.1.3
% 0.20/0.27 % (1478757)Termination reason: Refutation
% 0.20/0.27 % (1478757)Time elapsed: 0.003 s
% 0.20/0.27 % (1478757)Peak memory usage: 12 MB
% 0.20/0.27 % (1478757)Instructions burned: 2 (million)
% 0.20/0.27 % (1478750)Success in time 0.04 s
% 0.20/0.27 % Vampire exiting
%------------------------------------------------------------------------------