%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEV176^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 : n008.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:39:06 AM UTC 2026
% Result : Theorem 0.19s 0.27s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEV176^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.10/0.18 % Computer : n008.cluster.edu
% 0.10/0.18 % Model : x86_64 x86_64
% 0.10/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.18 % Memory : 8046.5625MB
% 0.10/0.18 % OS : Linux 6.8.0-71-generic
% 0.10/0.18 % CPULimit : 300
% 0.10/0.18 % WCLimit : 300
% 0.10/0.18 % DateTime : Tue Sep 29 15:19:24 UTC 2026
% 0.10/0.19 % CPUTime :
% 0.10/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.22 Running first-order model finding
% 0.10/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.19/0.27 % (3290202)Will run a generic schedule for satisfiability detection.
% 0.19/0.27 % (3290207)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2807396684_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.27 % Exception at run slice level
% 0.19/0.27 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.19/0.27 % (3290208)% WARNING: option uhcvi not known.
% 0.19/0.27 % (3290210)dis+10_1_sil=32000:sp=arity:random_seed=2465027604:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.27 % (3290208)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2963849027:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.27 % (3290209)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2326152485:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.27 % (3290208)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.19/0.27 % (3290208)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.19/0.27 % (3290212)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=493142721:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.27 % (3290210) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3290202-3290210"...
% 0.19/0.27 % (3290212) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3290202-3290212"...
% 0.19/0.27 % (3290208) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3290202-3290208"...
% 0.19/0.27 % (3290210)...printing done.
% 0.19/0.27 % (3290215)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1829204386:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.19/0.27 % Exception at run slice level
% 0.19/0.27 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.19/0.27 % (3290209) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3290202-3290209"...
% 0.19/0.27 % (3290212)...printing done.
% 0.19/0.27 % (3290208)...printing done.
% 0.19/0.27 % (3290210)Refutation found. Thanks to Tanya!
% 0.19/0.27 % SZS status Theorem for theBenchmark
% 0.19/0.27 % SZS output start Proof for theBenchmark
% 0.19/0.27 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.19/0.27 thf(func_def_0, type, cR: ($i > $i > $o)).
% 0.19/0.27 thf(func_def_5, type, sK1: ($i > $i)).
% 0.19/0.27 thf(f1,conjecture,(
% 0.19/0.27 ~ ? [X0 : $i] : ! [X1 : $i] : ((cR @ X1 @ X0) <=> ~ ? [X2 : $i] : ((cR @ X2 @ X1) & (cR @ X1 @ X2)))),
% 0.19/0.27 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM25)).
% 0.19/0.27 thf(f2,negated_conjecture,(
% 0.19/0.27 ~ ~ ? [X0 : $i] : ! [X1 : $i] : ((cR @ X1 @ X0) <=> ~ ? [X2 : $i] : ((cR @ X2 @ X1) & (cR @ X1 @ X2)))),
% 0.19/0.27 inference(negated_conjecture,[status(cth)],[f1])).
% 0.19/0.27 thf(f3,plain,(
% 0.19/0.27 ~ ~ ? [X0 : $i] : ! [X1 : $i] : ((cR @ X1 @ X0) <=> ~ ? [X2 : $i] : ((cR @ X2 @ X1) & (cR @ X1 @ X2)))),
% 0.19/0.27 inference(rectify,[],[f2])).
% 0.19/0.27 thf(f4,plain,(
% 0.19/0.27 ~ ~ ? [X0 : $i] : ! [X1 : $i] : ((((cR @ X1 @ X0)) = $true) <=> ~ ? [X2 : $i] : ((((cR @ X2 @ X1)) = $true) & (((cR @ X1 @ X2)) = $true)))),
% 0.19/0.27 inference(fool_elimination,[],[f3])).
% 0.19/0.27 thf(f5,plain,(
% 0.19/0.27 ? [X0 : $i] : ! [X1 : $i] : ((((cR @ X1 @ X0)) = $true) <=> ~ ? [X2 : $i] : ((((cR @ X2 @ X1)) = $true) & (((cR @ X1 @ X2)) = $true)))),
% 0.19/0.27 inference(flattening,[],[f4])).
% 0.19/0.27 thf(f6,plain,(
% 0.19/0.27 ? [X0 : $i] : ! [X1 : $i] : ((((cR @ X1 @ X0)) = $true) <=> ! [X2 : $i] : ((((cR @ X2 @ X1)) != $true) | (((cR @ X1 @ X2)) != $true)))),
% 0.19/0.27 inference(ennf_transformation,[],[f5])).
% 0.19/0.27 thf(f7,plain,(
% 0.19/0.27 ? [X0 : $i] : ! [X1 : $i] : (((((cR @ X1 @ X0)) = $true) | ? [X2 : $i] : ((((cR @ X2 @ X1)) = $true) & (((cR @ X1 @ X2)) = $true))) & (! [X2 : $i] : ((((cR @ X2 @ X1)) != $true) | (((cR @ X1 @ X2)) != $true)) | (((cR @ X1 @ X0)) != $true)))),
% 0.19/0.27 inference(nnf_transformation,[],[f6])).
% 0.19/0.27 thf(f8,plain,(
% 0.19/0.27 ? [X0 : $i] : ! [X1 : $i] : (((((cR @ X1 @ X0)) = $true) | ? [X2 : $i] : ((((cR @ X2 @ X1)) = $true) & (((cR @ X1 @ X2)) = $true))) & (! [X3 : $i] : (($true != ((cR @ X3 @ X1))) | ($true != ((cR @ X1 @ X3)))) | (((cR @ X1 @ X0)) != $true)))),
% 0.19/0.27 inference(rectify,[],[f7])).
% 0.19/0.27 thf(f9,plain,(
% 0.19/0.27 ! [X1 : $i] : ((($true = ((cR @ X1 @ sK0))) | (($true = ((cR @ (sK1 @ X1) @ X1))) & ($true = ((cR @ X1 @ (sK1 @ X1)))))) & (! [X3 : $i] : (($true != ((cR @ X3 @ X1))) | ($true != ((cR @ X1 @ X3)))) | ($true != ((cR @ X1 @ sK0)))))),
% 0.19/0.27 inference(skolemize,[status(esa),new_symbols(skolem,[sK0,vAPP]),skolemize(X0,sK0),skolemize(X2,sK1 @ X1)],[f8])).
% 0.19/0.27 thf(f10,plain,(
% 0.19/0.27 ( ! [X3 : $i,X1 : $i] : (($true != ((cR @ X3 @ X1))) | ($true != ((cR @ X1 @ X3))) | ($true != ((cR @ X1 @ sK0)))) )),
% 0.19/0.27 inference(cnf_transformation,[],[f9])).
% 0.19/0.27 thf(f11,plain,(
% 0.19/0.27 ( ! [X1 : $i] : (($true = ((cR @ X1 @ (sK1 @ X1)))) | ($true = ((cR @ X1 @ sK0)))) )),
% 0.19/0.27 inference(cnf_transformation,[],[f9])).
% 0.19/0.27 thf(f12,plain,(
% 0.19/0.27 ( ! [X1 : $i] : (($true = ((cR @ (sK1 @ X1) @ X1))) | ($true = ((cR @ X1 @ sK0)))) )),
% 0.19/0.27 inference(cnf_transformation,[],[f9])).
% 0.19/0.27 thf(f15,plain,(
% 0.19/0.27 ( ! [X0 : $i] : (($true != $true) | ($true != ((cR @ (sK1 @ X0) @ X0))) | ($true != ((cR @ (sK1 @ X0) @ sK0))) | ($true = ((cR @ X0 @ sK0)))) )),
% 0.19/0.27 inference(constrained_superposition,[],[f10,f11])).
% 0.19/0.27 thf(f17,plain,(
% 0.19/0.27 ( ! [X0 : $i] : (($true != ((cR @ (sK1 @ X0) @ X0))) | ($true != ((cR @ (sK1 @ X0) @ sK0))) | ($true = ((cR @ X0 @ sK0)))) )),
% 0.19/0.27 inference(trivial_inequality_removal,[],[f15])).
% 0.19/0.27 thf(f18,plain,(
% 0.19/0.27 ( ! [X0 : $i] : (($true != ((cR @ (sK1 @ X0) @ sK0))) | ($true = ((cR @ X0 @ sK0)))) )),
% 0.19/0.27 inference(forward_subsumption_resolution,[],[f17,f12])).
% 0.19/0.27 thf(f19,plain,(
% 0.19/0.27 ($true != $true) | ($true = ((cR @ sK0 @ sK0))) | ($true = ((cR @ sK0 @ sK0)))),
% 0.19/0.27 inference(constrained_superposition,[],[f18,f12])).
% 0.19/0.27 thf(f20,plain,(
% 0.19/0.27 ($true != $true) | ($true = ((cR @ sK0 @ sK0)))),
% 0.19/0.27 inference(duplicate_literal_removal,[],[f19])).
% 0.19/0.27 thf(f21,plain,(
% 0.19/0.27 ($true = ((cR @ sK0 @ sK0)))),
% 0.19/0.27 inference(trivial_inequality_removal,[],[f20])).
% 0.19/0.27 thf(f33,plain,(
% 0.19/0.27 ($true != $true) | ($true != $true) | ($true != $true)),
% 0.19/0.27 inference(constrained_superposition,[],[f10,f21])).
% 0.19/0.27 thf(f34,plain,(
% 0.19/0.27 ($true != $true)),
% 0.19/0.27 inference(duplicate_literal_removal,[],[f33])).
% 0.19/0.27 thf(f35,plain,(
% 0.19/0.27 $false),
% 0.19/0.27 inference(trivial_inequality_removal,[],[f34])).
% 0.19/0.27 % SZS output end Proof for theBenchmark
% 0.19/0.27 % (3290210)------------------------------
% 0.19/0.27 % (3290210)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.27 % (3290210)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.27 % (3290210)CaDiCaL version: 2.1.3
% 0.19/0.27 % (3290210)Termination reason: Refutation
% 0.19/0.27 % (3290210)Time elapsed: 0.003 s
% 0.19/0.27 % (3290210)Peak memory usage: 12 MB
% 0.19/0.27 % (3290210)Instructions burned: 3 (million)
% 0.19/0.27 % (3290202)Success in time 0.044 s
% 0.19/0.27 % Vampire exiting
%------------------------------------------------------------------------------