%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU884^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:34:20 AM UTC 2026
% Result : Theorem 0.11s 0.25s
% Output : Refutation 0.11s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU884^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.11/0.16 % Computer : n008.cluster.edu
% 0.11/0.16 % Model : x86_64 x86_64
% 0.11/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.16 % Memory : 8046.5625MB
% 0.11/0.16 % OS : Linux 6.8.0-71-generic
% 0.11/0.16 % CPULimit : 300
% 0.11/0.16 % WCLimit : 300
% 0.11/0.16 % DateTime : Tue Sep 29 14:44:39 UTC 2026
% 0.11/0.17 % CPUTime :
% 0.11/0.17 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.20 Running first-order model finding
% 0.11/0.20 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.11/0.25 % (3254422)Will run a generic schedule for satisfiability detection.
% 0.11/0.25 % (3254427)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1974181171_2999 on theBenchmark for (2999ds/0Mi)
% 0.11/0.25 % Exception at run slice level
% 0.11/0.25 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.11/0.25 % (3254428)% WARNING: option uhcvi not known.
% 0.11/0.25 % (3254428)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2609481489:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.11/0.25 % (3254429)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3693421431:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.11/0.25 % (3254430)dis+10_1_sil=32000:sp=arity:random_seed=2401749735:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.11/0.25 % (3254428)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.11/0.25 % (3254428)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.11/0.25 % (3254432)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1120575775:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.11/0.25 % (3254433)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2999975142:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.11/0.25 % (3254428) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3254422-3254428"...
% 0.11/0.25 % (3254430) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3254422-3254430"...
% 0.11/0.25 % (3254433) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3254422-3254433"...
% 0.11/0.25 % (3254432) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3254422-3254432"...
% 0.11/0.25 % (3254429) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3254422-3254429"...
% 0.11/0.25 % (3254435)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1511462789:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.11/0.25 % Exception at run slice level
% 0.11/0.25 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.11/0.25 % (3254428)...printing done.
% 0.11/0.25 % (3254430)...printing done.
% 0.11/0.25 % (3254433)...printing done.
% 0.11/0.25 % (3254432)...printing done.
% 0.11/0.25 % (3254429)...printing done.
% 0.11/0.25 % (3254428)Refutation found. Thanks to Tanya!
% 0.11/0.25 % SZS status Theorem for theBenchmark
% 0.11/0.25 % SZS output start Proof for theBenchmark
% 0.11/0.25 thf(type_def_5, type, a: $tType).
% 0.11/0.25 thf(type_def_6, type, sTfun: ($tType * $tType) > $tType).
% 0.11/0.25 thf(func_def_0, type, cS: (a > $o)).
% 0.11/0.25 thf(func_def_1, type, cR: (a > $o)).
% 0.11/0.25 thf(func_def_5, type, sK0: a).
% 0.11/0.25 thf(func_def_6, type, sK1: (a > a)).
% 0.11/0.25 thf(func_def_7, type, vNOT: ($o > $o)).
% 0.11/0.25 thf(f1,conjecture,(
% 0.11/0.25 ! [X0 : a] : (? [X1 : a] : ((X0 = X1) & (cR @ X1)) => ? [X1 : a] : ((X0 = X1) & (cS @ X1))) => ! [X0 : a] : ((cR @ X0) => (cS @ X0))),
% 0.11/0.25 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM30B_pme)).
% 0.11/0.25 thf(f2,negated_conjecture,(
% 0.11/0.25 ~(! [X0 : a] : (? [X1 : a] : ((X0 = X1) & (cR @ X1)) => ? [X1 : a] : ((X0 = X1) & (cS @ X1))) => ! [X0 : a] : ((cR @ X0) => (cS @ X0)))),
% 0.11/0.25 inference(negated_conjecture,[status(cth)],[f1])).
% 0.11/0.25 thf(f3,plain,(
% 0.11/0.25 ~(! [X0 : a] : (? [X1 : a] : ((X0 = X1) & (cR @ X1)) => ? [X2 : a] : ((X0 = X2) & (cS @ X2))) => ! [X3 : a] : ((cR @ X3) => (cS @ X3)))),
% 0.11/0.25 inference(rectify,[],[f2])).
% 0.11/0.25 thf(f4,plain,(
% 0.11/0.25 ~(! [X0 : a] : (? [X1 : a] : ((X0 = X1) & (((cR @ X1)) = $true)) => ? [X2 : a] : ((X0 = X2) & (((cS @ X2)) = $true))) => ! [X3 : a] : ((((cR @ X3)) = $true) => (((cS @ X3)) = $true)))),
% 0.11/0.25 inference(fool_elimination,[],[f3])).
% 0.11/0.25 thf(f5,plain,(
% 0.11/0.25 ? [X3 : a] : ((((cS @ X3)) != $true) & (((cR @ X3)) = $true)) & ! [X0 : a] : (? [X2 : a] : ((X0 = X2) & (((cS @ X2)) = $true)) | ! [X1 : a] : ((X0 != X1) | (((cR @ X1)) != $true)))),
% 0.11/0.25 inference(ennf_transformation,[],[f4])).
% 0.11/0.25 thf(f6,plain,(
% 0.11/0.25 ? [X0 : a] : ((((cS @ X0)) != $true) & (((cR @ X0)) = $true)) & ! [X1 : a] : (? [X2 : a] : ((X1 = X2) & (((cS @ X2)) = $true)) | ! [X3 : a] : ((X1 != X3) | (((cR @ X3)) != $true)))),
% 0.11/0.25 inference(rectify,[],[f5])).
% 0.11/0.25 thf(f7,plain,(
% 0.11/0.25 (($true != ((cS @ sK0))) & ($true = ((cR @ sK0)))) & ! [X1 : a] : (((((sK1 @ X1)) = X1) & ($true = ((cS @ (sK1 @ X1))))) | ! [X3 : a] : ((X1 != X3) | (((cR @ X3)) != $true)))),
% 0.11/0.25 inference(skolemize,[status(esa),new_symbols(skolem,[sK0,vAPP]),skolemize(X0,sK0),skolemize(X2,sK1 @ X1)],[f6])).
% 0.11/0.25 thf(f8,plain,(
% 0.11/0.25 ( ! [X3 : a,X1 : a] : (($true = ((cS @ (sK1 @ X1)))) | (X1 != X3) | (((cR @ X3)) != $true)) )),
% 0.11/0.25 inference(cnf_transformation,[],[f7])).
% 0.11/0.25 thf(f9,plain,(
% 0.11/0.25 ( ! [X3 : a,X1 : a] : ((((sK1 @ X1)) = X1) | (X1 != X3) | (((cR @ X3)) != $true)) )),
% 0.11/0.25 inference(cnf_transformation,[],[f7])).
% 0.11/0.25 thf(f10,plain,(
% 0.11/0.25 ($true = ((cR @ sK0)))),
% 0.11/0.25 inference(cnf_transformation,[],[f7])).
% 0.11/0.25 thf(f11,plain,(
% 0.11/0.25 ($true != ((cS @ sK0)))),
% 0.11/0.25 inference(cnf_transformation,[],[f7])).
% 0.11/0.25 thf(f14,plain,(
% 0.11/0.25 ( ! [X3 : a] : ((((cR @ X3)) != $true) | (((sK1 @ X3)) = X3)) )),
% 0.11/0.25 inference(equality_resolution,[],[f9])).
% 0.11/0.25 thf(f15,plain,(
% 0.11/0.25 ( ! [X3 : a] : ((((cR @ X3)) != $true) | ($true = ((cS @ (sK1 @ X3))))) )),
% 0.11/0.25 inference(equality_resolution,[],[f8])).
% 0.11/0.25 thf(f16,plain,(
% 0.11/0.25 ($true != $true) | (sK0 = ((sK1 @ sK0)))),
% 0.11/0.25 inference(constrained_superposition,[],[f14,f10])).
% 0.11/0.25 thf(f17,plain,(
% 0.11/0.25 (sK0 = ((sK1 @ sK0)))),
% 0.11/0.25 inference(trivial_inequality_removal,[],[f16])).
% 0.11/0.25 thf(f18,plain,(
% 0.11/0.25 ($true != $true) | ($true = ((cS @ (sK1 @ sK0))))),
% 0.11/0.25 inference(constrained_superposition,[],[f15,f10])).
% 0.11/0.25 thf(f19,plain,(
% 0.11/0.25 ($true = ((cS @ (sK1 @ sK0))))),
% 0.11/0.25 inference(trivial_inequality_removal,[],[f18])).
% 0.11/0.25 thf(f20,plain,(
% 0.11/0.25 ($true = ((cS @ sK0)))),
% 0.11/0.25 inference(forward_demodulation,[],[f19,f17])).
% 0.11/0.25 thf(f21,plain,(
% 0.11/0.25 $false),
% 0.11/0.25 inference(forward_subsumption_resolution,[],[f20,f11])).
% 0.11/0.25 % SZS output end Proof for theBenchmark
% 0.11/0.25 % (3254428)------------------------------
% 0.11/0.25 % (3254428)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.25 % (3254428)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.25 % (3254428)CaDiCaL version: 2.1.3
% 0.11/0.25 % (3254428)Termination reason: Refutation
% 0.11/0.25 % (3254428)Time elapsed: 0.002 s
% 0.11/0.25 % (3254428)Peak memory usage: 12 MB
% 0.11/0.25 % (3254428)Instructions burned: 1 (million)
% 0.11/0.25 % (3254422)Success in time 0.044 s
% 0.11/0.25 % Vampire exiting
%------------------------------------------------------------------------------