%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEV048^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n016.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:38:55 AM UTC 2026
% Result : Theorem 0.25s 0.32s
% Output : Refutation 0.25s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV048^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.22 % Computer : n016.cluster.edu
% 0.11/0.22 % Model : x86_64 x86_64
% 0.11/0.22 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.22 % Memory : 8046.5625MB
% 0.11/0.22 % OS : Linux 6.8.0-71-generic
% 0.11/0.22 % CPULimit : 300
% 0.11/0.22 % WCLimit : 300
% 0.11/0.22 % DateTime : Tue Sep 29 15:10:04 UTC 2026
% 0.11/0.22 % CPUTime :
% 0.11/0.22 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.27 Running first-order model finding
% 0.11/0.27 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.25/0.32 % (464173)Will run a generic schedule for satisfiability detection.
% 0.25/0.32 % (464178)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4293319788_3000 on theBenchmark for (3000ds/0Mi)
% 0.25/0.32 % Exception at run slice level
% 0.25/0.32 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.25/0.32 % (464179)% WARNING: option uhcvi not known.
% 0.25/0.32 % (464181)dis+10_1_sil=32000:sp=arity:random_seed=3973757693:i=103:fgj=on_3000 on theBenchmark for (3000ds/103Mi)
% 0.25/0.32 % (464183)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2986038908:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 0.25/0.32 % (464180)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=805991200:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 0.25/0.32 % (464179)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1324403232:i=135531:add=off:rawr=on_3000 on theBenchmark for (3000ds/135531Mi)
% 0.25/0.32 % (464182)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=196270330:i=116_3000 on theBenchmark for (3000ds/116Mi)
% 0.25/0.32 % (464184)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4193395041:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_3000 on theBenchmark for (3000ds/159Mi)
% 0.25/0.32 % (464179)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.25/0.32 % (464182)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.25/0.32 % (464179)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.25/0.32 % (464180) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-464173-464180"...
% 0.25/0.32 % (464183) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-464173-464183"...
% 0.25/0.32 % (464182) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-464173-464182"...
% 0.25/0.32 % (464181) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-464173-464181"...
% 0.25/0.32 % (464179) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-464173-464179"...
% 0.25/0.32 % (464184) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-464173-464184"...
% 0.25/0.32 % (464180)...printing done.
% 0.25/0.32 % (464183)...printing done.
% 0.25/0.32 % (464182)...printing done.
% 0.25/0.32 % (464179)...printing done.
% 0.25/0.32 % (464184)...printing done.
% 0.25/0.32 % (464181)...printing done.
% 0.25/0.32 % (464180)Refutation found. Thanks to Tanya!
% 0.25/0.32 % SZS status Theorem for theBenchmark
% 0.25/0.32 % SZS output start Proof for theBenchmark
% 0.25/0.32 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.25/0.32 thf(func_def_3, type, sK0: ((($i > $o) > ($i > $o) > $o) > $i > $o)).
% 0.25/0.32 thf(func_def_4, type, sK1: ((($i > $o) > ($i > $o) > $o) > $i > $o)).
% 0.25/0.32 thf(func_def_5, type, sK2: ((($i > $o) > ($i > $o) > $o) > $i > $o)).
% 0.25/0.32 thf(func_def_6, type, vNOT: ($o > $o)).
% 0.25/0.32 thf(func_def_7, type, db0: !>[X0: $tType]:(X0)).
% 0.25/0.32 thf(func_def_8, type, db1: !>[X0: $tType]:(X0)).
% 0.25/0.32 thf(func_def_9, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.25/0.32 thf(func_def_10, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.25/0.32 thf(f1,conjecture,(
% 0.25/0.32 ? [X0 : (($i > $o) > ($i > $o) > $o)] : ! [X1 : ($i > $o),X2 : ($i > $o),X3 : ($i > $o)] : (((X0 @ X2 @ X3) & (X0 @ X1 @ X2)) => (X0 @ X1 @ X3))),
% 0.25/0.32 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM120_pme)).
% 0.25/0.32 thf(f2,negated_conjecture,(
% 0.25/0.32 ~ ? [X0 : (($i > $o) > ($i > $o) > $o)] : ! [X1 : ($i > $o),X2 : ($i > $o),X3 : ($i > $o)] : (((X0 @ X2 @ X3) & (X0 @ X1 @ X2)) => (X0 @ X1 @ X3))),
% 0.25/0.32 inference(negated_conjecture,[status(cth)],[f1])).
% 0.25/0.32 thf(f3,plain,(
% 0.25/0.32 ~ ? [X0 : (($i > $o) > ($i > $o) > $o)] : ! [X1 : ($i > $o),X2 : ($i > $o),X3 : ($i > $o)] : (((X0 @ X2 @ X3) & (X0 @ X1 @ X2)) => (X0 @ X1 @ X3))),
% 0.25/0.32 inference(rectify,[],[f2])).
% 0.25/0.32 thf(f4,plain,(
% 0.25/0.32 ~ ? [X0 : (($i > $o) > ($i > $o) > $o)] : ! [X1 : ($i > $o),X2 : ($i > $o),X3 : ($i > $o)] : (((((X0 @ X2 @ X3)) = $true) & (((X0 @ X1 @ X2)) = $true)) => (((X0 @ X1 @ X3)) = $true))),
% 0.25/0.32 inference(fool_elimination,[],[f3])).
% 0.25/0.32 thf(f5,plain,(
% 0.25/0.32 ! [X0 : (($i > $o) > ($i > $o) > $o)] : ? [X1 : ($i > $o),X2 : ($i > $o),X3 : ($i > $o)] : ((((X0 @ X1 @ X3)) != $true) & ((((X0 @ X2 @ X3)) = $true) & (((X0 @ X1 @ X2)) = $true)))),
% 0.25/0.32 inference(ennf_transformation,[],[f4])).
% 0.25/0.32 thf(f6,plain,(
% 0.25/0.32 ! [X0 : (($i > $o) > ($i > $o) > $o)] : ? [X1 : ($i > $o),X2 : ($i > $o),X3 : ($i > $o)] : ((((X0 @ X1 @ X3)) != $true) & (((X0 @ X2 @ X3)) = $true) & (((X0 @ X1 @ X2)) = $true))),
% 0.25/0.32 inference(flattening,[],[f5])).
% 0.25/0.32 thf(f7,plain,(
% 0.25/0.32 ! [X0 : (($i > $o) > ($i > $o) > $o)] : (($true != ((X0 @ (sK0 @ X0) @ (sK2 @ X0)))) & ($true = ((X0 @ (sK1 @ X0) @ (sK2 @ X0)))) & ($true = ((X0 @ (sK0 @ X0) @ (sK1 @ X0)))))),
% 0.25/0.32 inference(skolemize,[status(esa),new_symbols(skolem,[vAPP,vAPP,vAPP]),skolemize(X3,sK2 @ X0),skolemize(X3,sK2 @ X0),skolemize(X3,sK2 @ X0)],[f6])).
% 0.25/0.32 thf(f10,plain,(
% 0.25/0.32 ( ! [X0 : (($i > $o) > ($i > $o) > $o)] : (($true != ((X0 @ (sK0 @ X0) @ (sK2 @ X0))))) )),
% 0.25/0.32 inference(cnf_transformation,[],[f7])).
% 0.25/0.32 thf(f18,plain,(
% 0.25/0.32 $false),
% 0.25/0.32 inference(equality_resolution,[],[f10])).
% 0.25/0.32 % SZS output end Proof for theBenchmark
% 0.25/0.32 % (464180)------------------------------
% 0.25/0.32 % (464180)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.25/0.32 % (464180)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.25/0.32 % (464180)CaDiCaL version: 2.1.3
% 0.25/0.32 % (464180)Termination reason: Refutation
% 0.25/0.32 % (464180)Time elapsed: 0.003 s
% 0.25/0.32 % (464180)Peak memory usage: 12 MB
% 0.25/0.32 % (464180)Instructions burned: 1 (million)
% 0.25/0.32 % (464173)Success in time 0.038 s
% 0.25/0.32 % Vampire exiting
%------------------------------------------------------------------------------