%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYO377^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 : n020.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:49 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 : SYO377^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.19 % Computer : n020.cluster.edu
% 0.11/0.19 % Model : x86_64 x86_64
% 0.11/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.19 % Memory : 8046.5625MB
% 0.11/0.19 % OS : Linux 6.8.0-71-generic
% 0.11/0.19 % CPULimit : 300
% 0.11/0.19 % WCLimit : 300
% 0.11/0.19 % DateTime : Tue Sep 29 16:50:34 UTC 2026
% 0.11/0.19 % CPUTime :
% 0.11/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.22 Running first-order model finding
% 0.11/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 % (1298652)Will run a generic schedule for satisfiability detection.
% 0.20/0.27 % (1298666)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2335238458_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 % (1298667)% WARNING: option uhcvi not known.
% 0.20/0.27 % (1298668)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1291465565:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.27 % (1298670)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3123776227:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.27 % (1298669)dis+10_1_sil=32000:sp=arity:random_seed=3150876908:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.27 % (1298667)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1267361240:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.27 % (1298670)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.27 % (1298673)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1110536316:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.27 % (1298667)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.27 % (1298672)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2915456309:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.27 % (1298667)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.20/0.27 % (1298668) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1298652-1298668"...
% 0.20/0.27 % (1298670) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1298652-1298670"...
% 0.20/0.27 % (1298669) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1298652-1298669"...
% 0.20/0.27 % (1298667) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1298652-1298667"...
% 0.20/0.27 % (1298684)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2044466414:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 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 % (1298673) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1298652-1298673"...
% 0.20/0.27 % (1298668)...printing done.
% 0.20/0.27 % (1298670)...printing done.
% 0.20/0.27 % (1298667)...printing done.
% 0.20/0.27 % (1298669)...printing done.
% 0.20/0.27 % (1298673)...printing done.
% 0.20/0.27 % (1298668)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(func_def_7, type, vNOT: ($o > $o)).
% 0.20/0.27 thf(f1,conjecture,(
% 0.20/0.27 ! [X0 : $o,X1 : $o] : ((X0 <=> X1) => ! [X2 : ($o > $o)] : ((X2 @ X0) => (X2 @ X1))) => ! [X3 : ($o > $o)] : (((X3 @ b) & (X3 @ a)) => (X3 @ b & a))),
% 0.20/0.27 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cEXT_IMP_EMB2)).
% 0.20/0.27 thf(f2,negated_conjecture,(
% 0.20/0.27 ~(! [X0 : $o,X1 : $o] : ((X0 <=> X1) => ! [X2 : ($o > $o)] : ((X2 @ X0) => (X2 @ X1))) => ! [X3 : ($o > $o)] : (((X3 @ b) & (X3 @ a)) => (X3 @ 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,X1 : $o] : ((X0 <=> X1) => ! [X2 : ($o > $o)] : ((X2 @ X0) => (X2 @ X1))) => ! [X3 : ($o > $o)] : (((X3 @ b) & (X3 @ a)) => (X3 @ b & a)))),
% 0.20/0.27 inference(rectify,[],[f2])).
% 0.20/0.27 thf(f4,plain,(
% 0.20/0.27 ~(! [X0 : $o,X1 : $o] : ((X0 = X1) => ! [X2 : ($o > $o)] : ((((X2 @ X0)) = $true) => (((X2 @ X1)) = $true))) => ! [X3 : ($o > $o)] : (((((X3 @ b)) = $true) & (((X3 @ a)) = $true)) => ($true = ((X3 @ (a & b))))))),
% 0.20/0.27 inference(fool_elimination,[],[f3])).
% 0.20/0.27 thf(f5,plain,(
% 0.20/0.27 ? [X3 : ($o > $o)] : (($true != ((X3 @ (a & b)))) & ((((X3 @ b)) = $true) & (((X3 @ a)) = $true))) & ! [X0 : $o,X1 : $o] : (! [X2 : ($o > $o)] : ((((X2 @ X1)) = $true) | (((X2 @ X0)) != $true)) | (X0 != X1))),
% 0.20/0.27 inference(ennf_transformation,[],[f4])).
% 0.20/0.27 thf(f6,plain,(
% 0.20/0.27 ? [X3 : ($o > $o)] : (($true != ((X3 @ (a & b)))) & (((X3 @ b)) = $true) & (((X3 @ a)) = $true)) & ! [X0 : $o,X1 : $o] : (! [X2 : ($o > $o)] : ((((X2 @ X1)) = $true) | (((X2 @ X0)) != $true)) | (X0 != X1))),
% 0.20/0.27 inference(flattening,[],[f5])).
% 0.20/0.27 thf(f7,plain,(
% 0.20/0.27 ? [X0 : ($o > $o)] : (($true != ((X0 @ (a & b)))) & ($true = ((X0 @ b))) & ($true = ((X0 @ a)))) & ! [X1 : $o,X2 : $o] : (! [X3 : ($o > $o)] : (($true = ((X3 @ X2))) | ($true != ((X3 @ X1)))) | (X1 != X2))),
% 0.20/0.27 inference(rectify,[],[f6])).
% 0.20/0.27 thf(f8,plain,(
% 0.20/0.27 (($true != ((sK0 @ (a & b)))) & ($true = ((sK0 @ b))) & ($true = ((sK0 @ a)))) & ! [X1 : $o,X2 : $o] : (! [X3 : ($o > $o)] : (($true = ((X3 @ X2))) | ($true != ((X3 @ X1)))) | (X1 != X2))),
% 0.20/0.27 inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f7])).
% 0.20/0.27 thf(f10,plain,(
% 0.20/0.27 ($true = ((sK0 @ a)))),
% 0.20/0.27 inference(cnf_transformation,[],[f8])).
% 0.20/0.27 thf(f11,plain,(
% 0.20/0.27 ($true = ((sK0 @ b)))),
% 0.20/0.27 inference(cnf_transformation,[],[f8])).
% 0.20/0.27 thf(f12,plain,(
% 0.20/0.27 ($true != ((sK0 @ (a & b))))),
% 0.20/0.27 inference(cnf_transformation,[],[f8])).
% 0.20/0.27 thf(f14,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(f27,plain,(
% 0.20/0.27 ($true != ((sK0 @ ($true & b)))) | (a = $false)),
% 0.20/0.27 inference(constrained_superposition,[],[f12,f14])).
% 0.20/0.27 thf(f33,plain,(
% 0.20/0.27 ($true != ((sK0 @ b))) | (a = $false)),
% 0.20/0.27 inference(boolean_simplification,[],[f27])).
% 0.20/0.27 thf(f39,plain,(
% 0.20/0.27 (a = $false)),
% 0.20/0.27 inference(forward_subsumption_resolution,[],[f33,f11])).
% 0.20/0.27 thf(f42,plain,(
% 0.20/0.27 ($true = ((sK0 @ $false)))),
% 0.20/0.27 inference(constrained_superposition,[],[f10,f39])).
% 0.20/0.27 thf(f43,plain,(
% 0.20/0.27 ($true != ((sK0 @ ($false & b))))),
% 0.20/0.27 inference(constrained_superposition,[],[f12,f39])).
% 0.20/0.27 thf(f44,plain,(
% 0.20/0.27 ($true != ((sK0 @ $false)))),
% 0.20/0.27 inference(boolean_simplification,[],[f43])).
% 0.20/0.27 thf(f46,plain,(
% 0.20/0.27 $false),
% 0.20/0.27 inference(global_subsumption,[],[f42,f44])).
% 0.20/0.27 % SZS output end Proof for theBenchmark
% 0.20/0.27 % (1298668)------------------------------
% 0.20/0.27 % (1298668)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.27 % (1298668)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.27 % (1298668)CaDiCaL version: 2.1.3
% 0.20/0.27 % (1298668)Termination reason: Refutation
% 0.20/0.27 % (1298668)Time elapsed: 0.003 s
% 0.20/0.27 % (1298668)Peak memory usage: 12 MB
% 0.20/0.27 % (1298668)Instructions burned: 2 (million)
% 0.20/0.27 % (1298652)Success in time 0.036 s
% 0.20/0.27 % Vampire exiting
%------------------------------------------------------------------------------