%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : DAT276^1 : TPTP v9.3.1. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n010.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 07:49:07 AM UTC 2026
% Result : Theorem 0.20s 0.29s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : DAT276^1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.20 % Computer : n010.cluster.edu
% 0.09/0.20 % Model : x86_64 x86_64
% 0.09/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20 % Memory : 8046.5625MB
% 0.09/0.20 % OS : Linux 6.8.0-71-generic
% 0.09/0.20 % CPULimit : 300
% 0.09/0.20 % WCLimit : 300
% 0.09/0.20 % DateTime : Tue Sep 29 18:19:18 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.23 Running first-order model finding
% 0.09/0.23 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.20/0.29 % (3232578)Will run a generic schedule for satisfiability detection.
% 0.20/0.29 % (3232585)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3336825414:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.29 % (3232584)% WARNING: option uhcvi not known.
% 0.20/0.29 % (3232584)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=835524561:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.29 % (3232587)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2489821717:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.29 % (3232583)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2870093848_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.29 % (3232584)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.29 % (3232586)dis+10_1_sil=32000:sp=arity:random_seed=3707673348:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.29 % (3232587)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.29 % (3232584)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.20/0.29 % (3232589)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=976958399:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.29 % Exception at run slice level
% 0.20/0.29 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.29 % (3232588)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1328988379:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.29 % (3232589) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3232578-3232589"...
% 0.20/0.29 % (3232589)...printing done.
% 0.20/0.29 % (3232589)Refutation found. Thanks to Tanya!
% 0.20/0.29 % SZS status Theorem for theBenchmark
% 0.20/0.29 % SZS output start Proof for theBenchmark
% 0.20/0.29 thf(type_def_5, type, 'type/ind_types/list': $tType > $tType).
% 0.20/0.29 thf(type_def_6, type, sTfun: ($tType * $tType) > $tType).
% 0.20/0.29 thf(type_def_7, type, sK0: $tType).
% 0.20/0.29 thf(type_def_8, type, sK1: $tType).
% 0.20/0.29 thf(type_def_9, type, sK2: $tType).
% 0.20/0.29 thf(func_def_0, type, 'const/lists/TL': !>[X0: $tType]:(('type/ind_types/list' @ X0 > 'type/ind_types/list' @ X0))).
% 0.20/0.29 thf(func_def_1, type, 'const/lists/MAP2': !>[X0: $tType, X1: $tType, X2: $tType]:(((X0 > X1 > X2) > 'type/ind_types/list' @ X0 > 'type/ind_types/list' @ X1 > 'type/ind_types/list' @ X2))).
% 0.20/0.29 thf(func_def_2, type, 'const/lists/HD': !>[X0: $tType]:(('type/ind_types/list' @ X0 > X0))).
% 0.20/0.29 thf(func_def_3, type, 'const/ind_types/CONS': !>[X0: $tType]:((X0 > 'type/ind_types/list' @ X0 > 'type/ind_types/list' @ X0))).
% 0.20/0.29 thf(func_def_5, type, sK3: sK1).
% 0.20/0.29 thf(func_def_6, type, sK4: sK2).
% 0.20/0.29 thf(func_def_7, type, sK5: (sK1 > sK2 > sK0)).
% 0.20/0.29 thf(func_def_8, type, sK6: 'type/ind_types/list' @ sK1).
% 0.20/0.29 thf(func_def_9, type, sK7: 'type/ind_types/list' @ sK2).
% 0.20/0.29 thf(func_def_10, type, db0: !>[X0: $tType]:(X0)).
% 0.20/0.29 thf(func_def_11, type, db1: !>[X0: $tType]:(X0)).
% 0.20/0.29 thf(func_def_12, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.20/0.29 thf(func_def_13, type, db2: !>[X0: $tType]:(X0)).
% 0.20/0.29 thf(f1,axiom,(
% 0.20/0.29 ! [X0 : $tType,X1 : X0,X2 : 'type/ind_types/list' @ X0] : ((('const/lists/TL' @ X0 @ ('const/ind_types/CONS' @ X0 @ X1 @ X2))) = X2)),
% 0.20/0.29 file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/lists/TL_')).
% 0.20/0.29 thf(f2,axiom,(
% 0.20/0.29 ! [X0 : $tType,X1 : 'type/ind_types/list' @ X0,X2 : X0] : ((('const/lists/HD' @ X0 @ ('const/ind_types/CONS' @ X0 @ X2 @ X1))) = X2)),
% 0.20/0.29 file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/lists/HD_')).
% 0.20/0.29 thf(f3,axiom,(
% 0.20/0.29 ! [X0 : $tType,X1 : $tType,X2 : $tType,X3 : X1,X4 : (X1 > X2 > X0),X5 : 'type/ind_types/list' @ X1,X6 : 'type/ind_types/list' @ X2] : ((('const/lists/MAP2' @ X1 @ X2 @ X0 @ X4 @ ('const/ind_types/CONS' @ X1 @ X3 @ X5) @ X6)) = (('const/ind_types/CONS' @ X0 @ (X4 @ X3 @ ('const/lists/HD' @ X2 @ X6)) @ ('const/lists/MAP2' @ X1 @ X2 @ X0 @ X4 @ X5 @ ('const/lists/TL' @ X2 @ X6)))))),
% 0.20/0.29 file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/lists/MAP2_DEF_1')).
% 0.20/0.29 thf(f4,conjecture,(
% 0.20/0.29 ! [X0 : $tType,X1 : $tType,X2 : $tType,X3 : X1,X4 : X2,X5 : (X1 > X2 > X0),X6 : 'type/ind_types/list' @ X1,X7 : 'type/ind_types/list' @ X2] : ((('const/lists/MAP2' @ X1 @ X2 @ X0 @ X5 @ ('const/ind_types/CONS' @ X1 @ X3 @ X6) @ ('const/ind_types/CONS' @ X2 @ X4 @ X7))) = (('const/ind_types/CONS' @ X0 @ (X5 @ X3 @ X4) @ ('const/lists/MAP2' @ X1 @ X2 @ X0 @ X5 @ X6 @ X7))))),
% 0.20/0.29 file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/lists/MAP2_1')).
% 0.20/0.29 thf(f5,negated_conjecture,(
% 0.20/0.29 ~ ! [X0 : $tType,X1 : $tType,X2 : $tType,X3 : X1,X4 : X2,X5 : (X1 > X2 > X0),X6 : 'type/ind_types/list' @ X1,X7 : 'type/ind_types/list' @ X2] : ((('const/lists/MAP2' @ X1 @ X2 @ X0 @ X5 @ ('const/ind_types/CONS' @ X1 @ X3 @ X6) @ ('const/ind_types/CONS' @ X2 @ X4 @ X7))) = (('const/ind_types/CONS' @ X0 @ (X5 @ X3 @ X4) @ ('const/lists/MAP2' @ X1 @ X2 @ X0 @ X5 @ X6 @ X7))))),
% 0.20/0.29 inference(negated_conjecture,[status(cth)],[f4])).
% 0.20/0.29 thf(f6,plain,(
% 0.20/0.29 ? [X0 : $tType,X1 : $tType,X2 : $tType,X3 : X1,X4 : X2,X5 : (X1 > X2 > X0),X6 : 'type/ind_types/list' @ X1,X7 : 'type/ind_types/list' @ X2] : ((('const/lists/MAP2' @ X1 @ X2 @ X0 @ X5 @ ('const/ind_types/CONS' @ X1 @ X3 @ X6) @ ('const/ind_types/CONS' @ X2 @ X4 @ X7))) != (('const/ind_types/CONS' @ X0 @ (X5 @ X3 @ X4) @ ('const/lists/MAP2' @ X1 @ X2 @ X0 @ X5 @ X6 @ X7))))),
% 0.20/0.29 inference(ennf_transformation,[],[f5])).
% 0.20/0.29 thf(f7,plain,(
% 0.20/0.29 ((('const/lists/MAP2' @ sK1 @ sK2 @ sK0 @ sK5 @ ('const/ind_types/CONS' @ sK1 @ sK3 @ sK6) @ ('const/ind_types/CONS' @ sK2 @ sK4 @ sK7))) != (('const/ind_types/CONS' @ sK0 @ (sK5 @ sK3 @ sK4) @ ('const/lists/MAP2' @ sK1 @ sK2 @ sK0 @ sK5 @ sK6 @ sK7))))),
% 0.20/0.29 inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6,sK7]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4),skolemize(X5,sK5),skolemize(X6,sK6),skolemize(X7,sK7)],[f6])).
% 0.20/0.29 thf(f8,plain,(
% 0.20/0.29 ( ! [X0 : $tType,X2 : 'type/ind_types/list' @ X0,X1 : X0] : (((('const/lists/TL' @ X0 @ ('const/ind_types/CONS' @ X0 @ X1 @ X2))) = X2)) )),
% 0.20/0.29 inference(cnf_transformation,[],[f1])).
% 0.20/0.29 thf(f9,plain,(
% 0.20/0.29 ( ! [X0 : $tType,X2 : X0,X1 : 'type/ind_types/list' @ X0] : (((('const/lists/HD' @ X0 @ ('const/ind_types/CONS' @ X0 @ X2 @ X1))) = X2)) )),
% 0.20/0.29 inference(cnf_transformation,[],[f2])).
% 0.20/0.29 thf(f10,plain,(
% 0.20/0.29 ( ! [X1 : $tType,X0 : $tType,X2 : $tType,X3 : X1,X6 : 'type/ind_types/list' @ X2,X4 : (X1 > X2 > X0),X5 : 'type/ind_types/list' @ X1] : (((('const/lists/MAP2' @ X1 @ X2 @ X0 @ X4 @ ('const/ind_types/CONS' @ X1 @ X3 @ X5) @ X6)) = (('const/ind_types/CONS' @ X0 @ (X4 @ X3 @ ('const/lists/HD' @ X2 @ X6)) @ ('const/lists/MAP2' @ X1 @ X2 @ X0 @ X4 @ X5 @ ('const/lists/TL' @ X2 @ X6)))))) )),
% 0.20/0.29 inference(cnf_transformation,[],[f3])).
% 0.20/0.29 thf(f11,plain,(
% 0.20/0.29 ((('const/lists/MAP2' @ sK1 @ sK2 @ sK0 @ sK5 @ ('const/ind_types/CONS' @ sK1 @ sK3 @ sK6) @ ('const/ind_types/CONS' @ sK2 @ sK4 @ sK7))) != (('const/ind_types/CONS' @ sK0 @ (sK5 @ sK3 @ sK4) @ ('const/lists/MAP2' @ sK1 @ sK2 @ sK0 @ sK5 @ sK6 @ sK7))))),
% 0.20/0.29 inference(cnf_transformation,[],[f7])).
% 0.20/0.29 thf(f28,plain,(
% 0.20/0.29 ((('const/ind_types/CONS' @ sK0 @ (sK5 @ sK3 @ sK4) @ ('const/lists/MAP2' @ sK1 @ sK2 @ sK0 @ sK5 @ sK6 @ sK7))) != (('const/ind_types/CONS' @ sK0 @ (sK5 @ sK3 @ ('const/lists/HD' @ sK2 @ ('const/ind_types/CONS' @ sK2 @ sK4 @ sK7))) @ ('const/lists/MAP2' @ sK1 @ sK2 @ sK0 @ sK5 @ sK6 @ ('const/lists/TL' @ sK2 @ ('const/ind_types/CONS' @ sK2 @ sK4 @ sK7))))))),
% 0.20/0.29 inference(constrained_superposition,[],[f11,f10])).
% 0.20/0.29 thf(f41,plain,(
% 0.20/0.29 ((('const/ind_types/CONS' @ sK0 @ (sK5 @ sK3 @ sK4) @ ('const/lists/MAP2' @ sK1 @ sK2 @ sK0 @ sK5 @ sK6 @ sK7))) != (('const/ind_types/CONS' @ sK0 @ (sK5 @ sK3 @ ('const/lists/HD' @ sK2 @ ('const/ind_types/CONS' @ sK2 @ sK4 @ sK7))) @ ('const/lists/MAP2' @ sK1 @ sK2 @ sK0 @ sK5 @ sK6 @ sK7))))),
% 0.20/0.29 inference(constrained_superposition,[],[f28,f8])).
% 0.20/0.29 thf(f43,plain,(
% 0.20/0.29 ((('const/ind_types/CONS' @ sK0 @ (sK5 @ sK3 @ sK4) @ ('const/lists/MAP2' @ sK1 @ sK2 @ sK0 @ sK5 @ sK6 @ sK7))) != (('const/ind_types/CONS' @ sK0 @ (sK5 @ sK3 @ sK4) @ ('const/lists/MAP2' @ sK1 @ sK2 @ sK0 @ sK5 @ sK6 @ sK7))))),
% 0.20/0.29 inference(constrained_superposition,[],[f41,f9])).
% 0.20/0.29 thf(f44,plain,(
% 0.20/0.29 $false),
% 0.20/0.29 inference(trivial_inequality_removal,[],[f43])).
% 0.20/0.29 % SZS output end Proof for theBenchmark
% 0.20/0.29 % (3232589)------------------------------
% 0.20/0.29 % (3232589)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.29 % (3232589)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.29 % (3232589)CaDiCaL version: 2.1.3
% 0.20/0.29 % (3232589)Termination reason: Refutation
% 0.20/0.29 % (3232589)Time elapsed: 0.015 s
% 0.20/0.29 % (3232589)Peak memory usage: 12 MB
% 0.20/0.29 % (3232589)Instructions burned: 24 (million)
% 0.20/0.29 % (3232578)Success in time 0.048 s
% 0.20/0.29 % Vampire exiting
%------------------------------------------------------------------------------