%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : COM309_1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 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 : Tue Sep 29 09:40:03 AM UTC 2026
% Result : Theorem 0.67s 1.05s
% Output : Refutation 3.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of formulae : 11 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 21 ( 2 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 16 ( 6 ~; 0 |; 8 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 21 ( 20 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 24 ( 22 usr; 1 prp; 0-3 aty)
% Number of functors : 145 ( 145 usr; 19 con; 0-3 aty)
% Number of variables : 10 ( 6 !; 4 ?; 10 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
vRow: $tType ).
tff(type_def_6,type,
vPred: $tType ).
tff(type_def_7,type,
vName: $tType ).
tff(type_def_8,type,
vAttrL: $tType ).
tff(type_def_9,type,
vRawTable: $tType ).
tff(type_def_10,type,
vOptRawTable: $tType ).
tff(type_def_11,type,
vFType: $tType ).
tff(type_def_12,type,
vOptTType: $tType ).
tff(type_def_13,type,
vTTContext: $tType ).
tff(type_def_14,type,
vQuery: $tType ).
tff(type_def_15,type,
vVal: $tType ).
tff(type_def_16,type,
vOptTable: $tType ).
tff(type_def_17,type,
vTStore: $tType ).
tff(type_def_18,type,
vExp: $tType ).
tff(type_def_19,type,
vTable: $tType ).
tff(type_def_20,type,
vTType: $tType ).
tff(type_def_21,type,
vSelect: $tType ).
tff(type_def_22,type,
vOptFType: $tType ).
tff(type_def_23,type,
vOptVal: $tType ).
tff(type_def_24,type,
vOptQuery: $tType ).
tff(func_def_0,type,
vrempty: vRow ).
tff(func_def_1,type,
vconstant: vVal > vExp ).
tff(func_def_2,type,
vlookup: vName > vExp ).
tff(func_def_3,type,
vtvalue: vTable > vQuery ).
tff(func_def_4,type,
vacons: ( vName * vAttrL ) > vAttrL ).
tff(func_def_5,type,
vsomeQuery: vQuery > vOptQuery ).
tff(func_def_6,type,
vsomeFType: vFType > vOptFType ).
tff(func_def_7,type,
vall: vSelect ).
tff(func_def_8,type,
vrcons: ( vVal * vRow ) > vRow ).
tff(func_def_9,type,
vttcons: ( vName * vFType * vTType ) > vTType ).
tff(func_def_10,type,
vtempty: vRawTable ).
tff(func_def_11,type,
vselectFromWhere: ( vSelect * vName * vPred ) > vQuery ).
tff(func_def_12,type,
vaempty: vAttrL ).
tff(func_def_13,type,
vnoRawTable: vOptRawTable ).
tff(func_def_14,type,
vtcons: ( vRow * vRawTable ) > vRawTable ).
tff(func_def_15,type,
vsomeTType: vTType > vOptTType ).
tff(func_def_16,type,
vsomeVal: vVal > vOptVal ).
tff(func_def_17,type,
vIntersection: ( vQuery * vQuery ) > vQuery ).
tff(func_def_18,type,
vptrue: vPred ).
tff(func_def_19,type,
vsomeRawTable: vRawTable > vOptRawTable ).
tff(func_def_20,type,
vbindStore: ( vName * vTable * vTStore ) > vTStore ).
tff(func_def_21,type,
vnoQuery: vOptQuery ).
tff(func_def_22,type,
vnot: vPred > vPred ).
tff(func_def_23,type,
vnoVal: vOptVal ).
tff(func_def_24,type,
vnoTType: vOptTType ).
tff(func_def_25,type,
vttempty: vTType ).
tff(func_def_26,type,
vnoTable: vOptTable ).
tff(func_def_27,type,
vDifference: ( vQuery * vQuery ) > vQuery ).
tff(func_def_28,type,
vnoFType: vOptFType ).
tff(func_def_29,type,
vUnion: ( vQuery * vQuery ) > vQuery ).
tff(func_def_30,type,
vbindContext: ( vName * vTType * vTTContext ) > vTTContext ).
tff(func_def_31,type,
vlt: ( vExp * vExp ) > vPred ).
tff(func_def_32,type,
vemptyContext: vTTContext ).
tff(func_def_33,type,
vgt: ( vExp * vExp ) > vPred ).
tff(func_def_34,type,
vsomeTable: vTable > vOptTable ).
tff(func_def_35,type,
vemptyStore: vTStore ).
tff(func_def_36,type,
veq: ( vExp * vExp ) > vPred ).
tff(func_def_37,type,
vand: ( vPred * vPred ) > vPred ).
tff(func_def_38,type,
vlist: vAttrL > vSelect ).
tff(func_def_39,type,
vtable: ( vAttrL * vRawTable ) > vTable ).
tff(func_def_40,type,
vprojectTable: ( vSelect * vTable ) > vOptTable ).
tff(func_def_41,type,
vinitFType: vFType ).
tff(func_def_42,type,
vprojectTypeAttrL: ( vAttrL * vTType ) > vOptTType ).
tff(func_def_43,type,
venumVal: vVal > vVal ).
tff(func_def_44,type,
vinitVal: vVal ).
tff(func_def_45,type,
vgetRaw: vTable > vRawTable ).
tff(func_def_46,type,
vprojectFirstRaw: vRawTable > vRawTable ).
tff(func_def_47,type,
vlookupStore: ( vName * vTStore ) > vOptTable ).
tff(func_def_48,type,
vrawUnion: ( vRawTable * vRawTable ) > vRawTable ).
tff(func_def_49,type,
venumFType: vFType > vFType ).
tff(func_def_50,type,
vattachColToFrontRaw: ( vRawTable * vRawTable ) > vRawTable ).
tff(func_def_51,type,
vprojectEmptyCol: vRawTable > vRawTable ).
tff(func_def_52,type,
vfilterTable: ( vTable * vPred ) > vTable ).
tff(func_def_53,type,
venumName: vName > vName ).
tff(func_def_54,type,
vgetAttrL: vTable > vAttrL ).
tff(func_def_55,type,
vevalExpRow: ( vExp * vAttrL * vRow ) > vOptVal ).
tff(func_def_56,type,
vfindCol: ( vName * vAttrL * vRawTable ) > vOptRawTable ).
tff(func_def_57,type,
vlookupContext: ( vName * vTTContext ) > vOptTType ).
tff(func_def_58,type,
vreduce: ( vQuery * vTStore ) > vOptQuery ).
tff(func_def_59,type,
vfieldType: vVal > vFType ).
tff(func_def_60,type,
vrawIntersection: ( vRawTable * vRawTable ) > vRawTable ).
tff(func_def_61,type,
vtypeOfExp: ( vExp * vTType ) > vOptFType ).
tff(func_def_62,type,
vdropFirstColRaw: vRawTable > vRawTable ).
tff(func_def_63,type,
vfindColType: ( vName * vTType ) > vOptFType ).
tff(func_def_64,type,
vinitName: vName ).
tff(func_def_65,type,
vfilterRows: ( vRawTable * vAttrL * vPred ) > vRawTable ).
tff(func_def_66,type,
vprojectType: ( vSelect * vTType ) > vOptTType ).
tff(func_def_67,type,
vprojectCols: ( vAttrL * vAttrL * vRawTable ) > vOptRawTable ).
tff(func_def_68,type,
vrawDifference: ( vRawTable * vRawTable ) > vRawTable ).
tff(func_def_69,type,
vappend: ( vAttrL * vAttrL ) > vAttrL ).
tff(func_def_70,type,
vgetFType: vOptFType > vFType ).
tff(func_def_71,type,
vgetQuery: vOptQuery > vQuery ).
tff(func_def_72,type,
vgetTType: vOptTType > vTType ).
tff(func_def_73,type,
vgetVal: vOptVal > vVal ).
tff(func_def_74,type,
vgetTable: vOptTable > vTable ).
tff(func_def_75,type,
vgetRawTable: vOptRawTable > vRawTable ).
tff(func_def_76,type,
sK3: vTType ).
tff(func_def_77,type,
sK4: vRawTable ).
tff(func_def_78,type,
sK5: ( vTType * vTable ) > vTType ).
tff(func_def_79,type,
sK6: ( vTType * vTable ) > vAttrL ).
tff(func_def_80,type,
sK7: ( vTType * vTable ) > vRawTable ).
tff(func_def_81,type,
sK8: ( vTType * vTable ) > vTType ).
tff(func_def_82,type,
sK9: ( vTType * vTable ) > vAttrL ).
tff(func_def_83,type,
sK10: ( vTType * vTable ) > vRawTable ).
tff(func_def_84,type,
sK11: ( vTType * vRawTable ) > vRow ).
tff(func_def_85,type,
sK12: ( vTType * vRawTable ) > vRawTable ).
tff(func_def_86,type,
sK13: ( vTType * vRawTable ) > vTType ).
tff(func_def_87,type,
sK14: ( vTType * vRawTable ) > vTType ).
tff(func_def_88,type,
sK15: ( vTType * vRawTable ) > vRow ).
tff(func_def_89,type,
sK16: ( vTType * vRawTable ) > vRawTable ).
tff(func_def_90,type,
sK17: ( vTType * vRawTable ) > vTType ).
tff(func_def_91,type,
sK18: vRawTable > vRow ).
tff(func_def_92,type,
sK19: vRawTable > vRawTable ).
tff(func_def_93,type,
sK20: ( vRawTable * vRawTable ) > vRow ).
tff(func_def_94,type,
sK21: ( vRawTable * vRawTable ) > vRawTable ).
tff(func_def_95,type,
sK22: ( vRawTable * vRawTable ) > vRawTable ).
tff(func_def_96,type,
sK23: ( vRawTable * vRawTable ) > vRawTable ).
tff(func_def_97,type,
sK24: ( vRawTable * vRawTable ) > vRow ).
tff(func_def_98,type,
sK25: ( vRawTable * vRawTable ) > vRawTable ).
tff(func_def_99,type,
sK26: ( vRawTable * vRawTable ) > vRawTable ).
tff(func_def_100,type,
sK27: ( vRawTable * vRawTable ) > vRawTable ).
tff(func_def_101,type,
sK28: ( vRawTable * vRawTable ) > vRawTable ).
tff(func_def_102,type,
sK29: ( vTType * vAttrL ) > vTType ).
tff(func_def_103,type,
sK30: ( vTType * vAttrL ) > vAttrL ).
tff(func_def_104,type,
sK31: ( vTType * vAttrL ) > vTType ).
tff(func_def_105,type,
sK32: ( vTType * vAttrL ) > vName ).
tff(func_def_106,type,
sK33: ( vTType * vAttrL ) > vFType ).
tff(func_def_107,type,
sK34: ( vTType * vAttrL ) > vName ).
tff(func_def_108,type,
sK35: ( vTType * vAttrL ) > vAttrL ).
tff(func_def_109,type,
sK36: ( vTType * vAttrL ) > vTType ).
tff(func_def_110,type,
sK37: ( vTType * vAttrL ) > vName ).
tff(func_def_111,type,
sK38: ( vTType * vAttrL ) > vFType ).
tff(func_def_112,type,
sK39: ( vTType * vAttrL ) > vName ).
tff(func_def_113,type,
sK40: ( vTType * vAttrL ) > vAttrL ).
tff(func_def_114,type,
sK41: vTType > vName ).
tff(func_def_115,type,
sK42: vTType > vFType ).
tff(func_def_116,type,
sK43: vTType > vTType ).
tff(func_def_117,type,
sK44: vAttrL > vName ).
tff(func_def_118,type,
sK45: vAttrL > vAttrL ).
tff(func_def_119,type,
sK46: vTable > vAttrL ).
tff(func_def_120,type,
sK47: vTable > vRawTable ).
tff(func_def_121,type,
sK48: vTType > vName ).
tff(func_def_122,type,
sK49: vTType > vFType ).
tff(func_def_123,type,
sK50: vTType > vTType ).
tff(func_def_124,type,
sK51: vRow > vVal ).
tff(func_def_125,type,
sK52: vRow > vRow ).
tff(func_def_126,type,
sK53: vOptQuery > vQuery ).
tff(func_def_127,type,
sK54: vTable > vAttrL ).
tff(func_def_128,type,
sK55: vTable > vRawTable ).
tff(func_def_129,type,
sK56: vTable > vAttrL ).
tff(func_def_130,type,
sK57: vTable > vRawTable ).
tff(func_def_131,type,
sK58: ( vRow * vRawTable ) > vRow ).
tff(func_def_132,type,
sK59: ( vRow * vRawTable ) > vRow ).
tff(func_def_133,type,
sK60: ( vRow * vRawTable ) > vRawTable ).
tff(func_def_134,type,
sK61: ( vRow * vRawTable ) > vRow ).
tff(func_def_135,type,
sK62: ( vRow * vRawTable ) > vRow ).
tff(func_def_136,type,
sK63: ( vRow * vRawTable ) > vRawTable ).
tff(func_def_137,type,
sK64: ( vRow * vRawTable ) > vRow ).
tff(func_def_138,type,
sK65: vAttrL > vName ).
tff(func_def_139,type,
sK66: vAttrL > vAttrL ).
tff(func_def_140,type,
sK67: vTType > vName ).
tff(func_def_141,type,
sK68: vTType > vFType ).
tff(func_def_142,type,
sK69: vTType > vTType ).
tff(func_def_143,type,
sK70: vRow > vVal ).
tff(func_def_144,type,
sK71: vRow > vRow ).
tff(pred_def_1,type,
vmatchingAttrL: ( vTType * vAttrL ) > $o ).
tff(pred_def_2,type,
visSomeTType: vOptTType > $o ).
tff(pred_def_3,type,
visSomeRawTable: vOptRawTable > $o ).
tff(pred_def_4,type,
vsameLength: ( vRawTable * vRawTable ) > $o ).
tff(pred_def_5,type,
vfilterSingleRow: ( vPred * vAttrL * vRow ) > $o ).
tff(pred_def_6,type,
vlessThan: ( vVal * vVal ) > $o ).
tff(pred_def_7,type,
visSomeVal: vOptVal > $o ).
tff(pred_def_8,type,
vwelltypedRawtable: ( vTType * vRawTable ) > $o ).
tff(pred_def_9,type,
vgreaterThan: ( vVal * vVal ) > $o ).
tff(pred_def_10,type,
visValue: vQuery > $o ).
tff(pred_def_11,type,
vwelltypedtable: ( vTType * vTable ) > $o ).
tff(pred_def_12,type,
visSomeFType: vOptFType > $o ).
tff(pred_def_13,type,
vtcheckPred: ( vPred * vTType ) > $o ).
tff(pred_def_14,type,
vrowIn: ( vRow * vRawTable ) > $o ).
tff(pred_def_15,type,
visSomeTable: vOptTable > $o ).
tff(pred_def_16,type,
vwelltypedRow: ( vTType * vRow ) > $o ).
tff(pred_def_17,type,
visSomeQuery: vOptQuery > $o ).
tff(pred_def_18,type,
vstoreContextConsistent: ( vTStore * vTTContext ) > $o ).
tff(pred_def_19,type,
vptcheck: ( vTTContext * vQuery * vTType ) > $o ).
tff(pred_def_20,type,
sP0: ( vRawTable * vRawTable ) > $o ).
tff(pred_def_21,type,
sP1: ( vRawTable * vRawTable ) > $o ).
tff(pred_def_22,type,
sP2: ( vTType * vAttrL ) > $o ).
tff(f144,axiom,
! [X0: vRawTable] : ( vrawUnion(vtempty,X0) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','rawUnion-0') ).
tff(f293,conjecture,
! [X0: vTType,X1: vRawTable] :
( ( vwelltypedRawtable(X0,vtempty)
& vwelltypedRawtable(X0,X1) )
=> vwelltypedRawtable(X0,vrawUnion(vtempty,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','rawUnionPreservesWellTypedRaw-tempty') ).
tff(f294,negated_conjecture,
~ ! [X0: vTType,X1: vRawTable] :
( ( vwelltypedRawtable(X0,vtempty)
& vwelltypedRawtable(X0,X1) )
=> vwelltypedRawtable(X0,vrawUnion(vtempty,X1)) ),
inference(negated_conjecture,[status(cth)],[f293]) ).
tff(f296,plain,
? [X0: vTType,X1: vRawTable] :
( ~ vwelltypedRawtable(X0,vrawUnion(vtempty,X1))
& vwelltypedRawtable(X0,vtempty)
& vwelltypedRawtable(X0,X1) ),
inference(ennf_transformation,[],[f294]) ).
tff(f297,plain,
? [X0: vTType,X1: vRawTable] :
( ~ vwelltypedRawtable(X0,vrawUnion(vtempty,X1))
& vwelltypedRawtable(X0,vtempty)
& vwelltypedRawtable(X0,X1) ),
inference(flattening,[],[f296]) ).
tff(f346,plain,
( ~ vwelltypedRawtable(sK3,vrawUnion(vtempty,sK4))
& vwelltypedRawtable(sK3,vtempty)
& vwelltypedRawtable(sK3,sK4) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4]),skolemize(X0,sK3),skolemize(X1,sK4)],[f297]) ).
tff(f383,plain,
vwelltypedRawtable(sK3,sK4),
inference(cnf_transformation,[],[f346]) ).
tff(f385,plain,
~ vwelltypedRawtable(sK3,vrawUnion(vtempty,sK4)),
inference(cnf_transformation,[],[f346]) ).
tff(f429,plain,
! [X0: vRawTable] : ( vrawUnion(vtempty,X0) = X0 ),
inference(cnf_transformation,[],[f144]) ).
tff(f529,plain,
~ vwelltypedRawtable(sK3,sK4),
inference(superposition,[],[f385,f429]) ).
tff(f530,plain,
$false,
inference(forward_subsumption_resolution,[],[f529,f383]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : COM309_1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.28 % Computer : n010.cluster.edu
% 0.24/0.28 % Model : x86_64 x86_64
% 0.24/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.24/0.28 % Memory : 8046.5625MB
% 0.24/0.28 % OS : Linux 6.8.0-71-generic
% 0.24/0.28 % CPULimit : 300
% 0.24/0.28 % WCLimit : 300
% 0.24/0.28 % DateTime : Mon Sep 28 22:04:47 UTC 2026
% 0.24/0.28 % CPUTime :
% 0.24/0.28 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.32 Running first-order theorem proving
% 0.24/0.32 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.67/1.05 % (2414654)Detected formulas, will run a generic FOF schedule.
% 0.67/1.05 % (2414663)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1074245693:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 0.67/1.05 % (2414663)First to succeed.
% 0.67/1.05 % (2414663)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2414654"
% 0.67/1.05 % (2414660)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=3757822313:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 0.67/1.05 % (2414661)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=1788764870:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 0.67/1.05 % (2414659)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=3444034882:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 0.67/1.05 % (2414664)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2793422176:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 0.67/1.05 % (2414662)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3021986016:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 0.67/1.05 % (2414662)Also succeeded, but the first one will report.
% 0.67/1.05 % (2414665)dis-21_1_sil=8000:lcm=predicate:random_seed=3265670344:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 0.67/1.05 % (2414664)Also succeeded, but the first one will report.
% 0.67/1.05 % (2414663)Refutation found. Thanks to Tanya!
% 0.67/1.05 % SZS status Theorem for theBenchmark
% 0.67/1.05 % SZS output start Proof for theBenchmark
% See solution above
% 3.22/1.23 % (2414663)------------------------------
% 3.22/1.23 % (2414663)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.22/1.23 % (2414663)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.22/1.23 % (2414663)CaDiCaL version: 2.1.3
% 3.22/1.23 % (2414663)Termination reason: Refutation
% 3.22/1.23 % (2414663)Time elapsed: 0.004 s
% 3.22/1.23 % (2414663)Peak memory usage: 89 MB
% 3.22/1.23 % (2414663)Instructions burned: 8 (million)
% 3.22/1.23 % (2414663)------------------------------
% 3.22/1.23 % (2414663)------------------------------
% 3.22/1.23 % (2414654)Success in time 0.363 s
% 3.22/1.23 % Vampire exiting
%------------------------------------------------------------------------------