%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU935^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 : n018.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:26 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 : SEU935^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.10/0.19 % Computer : n018.cluster.edu
% 0.10/0.19 % Model : x86_64 x86_64
% 0.10/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.19 % Memory : 8046.5625MB
% 0.10/0.19 % OS : Linux 6.8.0-71-generic
% 0.10/0.19 % CPULimit : 300
% 0.10/0.19 % WCLimit : 300
% 0.10/0.19 % DateTime : Tue Sep 29 14:49:26 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.20/0.27 % (183507)Will run a generic schedule for satisfiability detection.
% 0.20/0.27 % (183520)% WARNING: option uhcvi not known.
% 0.20/0.27 % (183520)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3655836387:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.27 % (183521)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1663065769:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.27 % (183522)dis+10_1_sil=32000:sp=arity:random_seed=3593728705:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.27 % (183520)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.27 % (183523)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=207316327:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.27 % (183520)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.20/0.27 % (183523)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.27 % (183525)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=816049010:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.27 % (183522) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-183507-183522"...
% 0.20/0.27 % (183521) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-183507-183521"...
% 0.20/0.27 % (183520) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-183507-183520"...
% 0.20/0.27 % (183523) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-183507-183523"...
% 0.20/0.27 % (183519)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4070564109_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.27 % (183525) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-183507-183525"...
% 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 % (183525)...printing done.
% 0.20/0.27 % (183521)...printing done.
% 0.20/0.27 % (183522)...printing done.
% 0.20/0.27 % (183520)...printing done.
% 0.20/0.27 % (183523)...printing done.
% 0.20/0.27 % (183525)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, a: $tType).
% 0.20/0.27 thf(type_def_6, type, b: $tType).
% 0.20/0.27 thf(type_def_7, type, c: $tType).
% 0.20/0.27 thf(type_def_8, type, sTfun: ($tType * $tType) > $tType).
% 0.20/0.27 thf(func_def_1, type, sK0: (a > b)).
% 0.20/0.27 thf(func_def_2, type, sK1: (b > c)).
% 0.20/0.27 thf(func_def_3, type, sK2: c).
% 0.20/0.27 thf(func_def_4, type, sK3: (c > b)).
% 0.20/0.27 thf(func_def_5, type, sK4: (b > a)).
% 0.20/0.27 thf(f1,conjecture,(
% 0.20/0.27 ! [X0 : (a > b),X1 : (b > c)] : ((! [X2 : c] : ? [X3 : b] : (((X1 @ X3)) = X2) & ! [X2 : b] : ? [X3 : a] : (((X0 @ X3)) = X2)) => ! [X2 : c] : ? [X3 : a] : (((X1 @ (X0 @ X3))) = X2))),
% 0.20/0.27 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cFN_THM_2_pme)).
% 0.20/0.27 thf(f2,negated_conjecture,(
% 0.20/0.27 ~ ! [X0 : (a > b),X1 : (b > c)] : ((! [X2 : c] : ? [X3 : b] : (((X1 @ X3)) = X2) & ! [X2 : b] : ? [X3 : a] : (((X0 @ X3)) = X2)) => ! [X2 : c] : ? [X3 : a] : (((X1 @ (X0 @ X3))) = X2))),
% 0.20/0.27 inference(negated_conjecture,[status(cth)],[f1])).
% 0.20/0.27 thf(f3,plain,(
% 0.20/0.28 ~ ! [X0 : (a > b),X1 : (b > c)] : ((! [X2 : c] : ? [X3 : b] : (((X1 @ X3)) = X2) & ! [X4 : b] : ? [X5 : a] : (((X0 @ X5)) = X4)) => ! [X6 : c] : ? [X7 : a] : (((X1 @ (X0 @ X7))) = X6))),
% 0.20/0.28 inference(rectify,[],[f2])).
% 0.20/0.28 thf(f4,plain,(
% 0.20/0.28 ? [X0 : (a > b),X1 : (b > c)] : (? [X6 : c] : ! [X7 : a] : (((X1 @ (X0 @ X7))) != X6) & (! [X2 : c] : ? [X3 : b] : (((X1 @ X3)) = X2) & ! [X4 : b] : ? [X5 : a] : (((X0 @ X5)) = X4)))),
% 0.20/0.28 inference(ennf_transformation,[],[f3])).
% 0.20/0.28 thf(f5,plain,(
% 0.20/0.28 ? [X0 : (a > b),X1 : (b > c)] : (? [X6 : c] : ! [X7 : a] : (((X1 @ (X0 @ X7))) != X6) & ! [X2 : c] : ? [X3 : b] : (((X1 @ X3)) = X2) & ! [X4 : b] : ? [X5 : a] : (((X0 @ X5)) = X4))),
% 0.20/0.28 inference(flattening,[],[f4])).
% 0.20/0.28 thf(f6,plain,(
% 0.20/0.28 ? [X0 : (a > b),X1 : (b > c)] : (? [X2 : c] : ! [X3 : a] : (((X1 @ (X0 @ X3))) != X2) & ! [X4 : c] : ? [X5 : b] : (((X1 @ X5)) = X4) & ! [X6 : b] : ? [X7 : a] : (((X0 @ X7)) = X6))),
% 0.20/0.28 inference(rectify,[],[f5])).
% 0.20/0.28 thf(f7,plain,(
% 0.20/0.28 ! [X3 : a] : (sK2 != ((sK1 @ (sK0 @ X3)))) & ! [X4 : c] : (((sK1 @ (sK3 @ X4))) = X4) & ! [X6 : b] : (((sK0 @ (sK4 @ X6))) = X6)),
% 0.20/0.28 inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,vAPP,vAPP]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X7,sK4 @ X6),skolemize(X7,sK4 @ X6)],[f6])).
% 0.20/0.28 thf(f8,plain,(
% 0.20/0.28 ( ! [X6 : b] : ((((sK0 @ (sK4 @ X6))) = X6)) )),
% 0.20/0.28 inference(cnf_transformation,[],[f7])).
% 0.20/0.28 thf(f9,plain,(
% 0.20/0.28 ( ! [X4 : c] : ((((sK1 @ (sK3 @ X4))) = X4)) )),
% 0.20/0.28 inference(cnf_transformation,[],[f7])).
% 0.20/0.28 thf(f10,plain,(
% 0.20/0.28 ( ! [X3 : a] : ((sK2 != ((sK1 @ (sK0 @ X3))))) )),
% 0.20/0.28 inference(cnf_transformation,[],[f7])).
% 0.20/0.28 thf(f11,plain,(
% 0.20/0.28 ( ! [X0 : b] : ((sK2 != ((sK1 @ X0)))) )),
% 0.20/0.28 inference(constrained_superposition,[],[f10,f8])).
% 0.20/0.28 thf(f12,plain,(
% 0.20/0.28 ( ! [X0 : c] : ((sK2 != X0)) )),
% 0.20/0.28 inference(constrained_superposition,[],[f11,f9])).
% 0.20/0.28 thf(f13,plain,(
% 0.20/0.28 $false),
% 0.20/0.28 inference(equality_resolution,[],[f12])).
% 0.20/0.28 % SZS output end Proof for theBenchmark
% 0.20/0.28 % (183525)------------------------------
% 0.20/0.28 % (183525)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.28 % (183525)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.28 % (183525)CaDiCaL version: 2.1.3
% 0.20/0.28 % (183525)Termination reason: Refutation
% 0.20/0.28 % (183525)Time elapsed: 0.001 s
% 0.20/0.28 % (183525)Peak memory usage: 12 MB
% 0.20/0.28 % (183525)Instructions burned: 1 (million)
% 0.20/0.28 % (183507)Success in time 0.041 s
% 0.20/0.28 % Vampire exiting
%------------------------------------------------------------------------------