%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : COM306_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 : n004.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 3.97s 1.44s
% Output : Refutation 4.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 10
% Syntax : Number of formulae : 55 ( 28 unt; 0 typ; 0 def)
% Number of atoms : 117 ( 52 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 112 ( 50 ~; 34 |; 24 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 21 ( 20 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 27 ( 25 usr; 1 prp; 0-3 aty)
% Number of functors : 189 ( 189 usr; 21 con; 0-5 aty)
% Number of variables : 115 ( 98 !; 17 ?; 115 :)
% 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,
sK6: vAttrL ).
tff(func_def_77,type,
sK7: vTable ).
tff(func_def_78,type,
sK8: vTType ).
tff(func_def_79,type,
sK9: vTType ).
tff(func_def_80,type,
sK10: vOptRawTable > vRawTable ).
tff(func_def_81,type,
sK11: ( vTType * vTable ) > vTType ).
tff(func_def_82,type,
sK12: ( vTType * vTable ) > vAttrL ).
tff(func_def_83,type,
sK13: ( vTType * vTable ) > vRawTable ).
tff(func_def_84,type,
sK14: ( vTType * vTable ) > vTType ).
tff(func_def_85,type,
sK15: ( vTType * vTable ) > vAttrL ).
tff(func_def_86,type,
sK16: ( vTType * vTable ) > vRawTable ).
tff(func_def_87,type,
sK17: vTable > vAttrL ).
tff(func_def_88,type,
sK18: vTable > vRawTable ).
tff(func_def_89,type,
sK19: vTable > vAttrL ).
tff(func_def_90,type,
sK20: vTable > vRawTable ).
tff(func_def_91,type,
sK21: ( vPred * vTType * vSelect * vName * vTTContext ) > vTType ).
tff(func_def_92,type,
sK22: ( vSelect * vTType ) > vAttrL ).
tff(func_def_93,type,
sK23: ( vSelect * vTType ) > vTType ).
tff(func_def_94,type,
sK24: ( vSelect * vTType ) > vTType ).
tff(func_def_95,type,
sK25: ( vTType * vAttrL ) > vTType ).
tff(func_def_96,type,
sK26: ( vTType * vAttrL ) > vAttrL ).
tff(func_def_97,type,
sK27: ( vTType * vAttrL ) > vTType ).
tff(func_def_98,type,
sK28: ( vTType * vAttrL ) > vName ).
tff(func_def_99,type,
sK29: ( vTType * vAttrL ) > vFType ).
tff(func_def_100,type,
sK30: ( vTType * vAttrL ) > vName ).
tff(func_def_101,type,
sK31: ( vTType * vAttrL ) > vAttrL ).
tff(func_def_102,type,
sK32: ( vTType * vAttrL ) > vTType ).
tff(func_def_103,type,
sK33: ( vTType * vAttrL ) > vName ).
tff(func_def_104,type,
sK34: ( vTType * vAttrL ) > vFType ).
tff(func_def_105,type,
sK35: ( vTType * vAttrL ) > vName ).
tff(func_def_106,type,
sK36: ( vTType * vAttrL ) > vAttrL ).
tff(func_def_107,type,
sK37: vTType > vName ).
tff(func_def_108,type,
sK38: vTType > vFType ).
tff(func_def_109,type,
sK39: vTType > vTType ).
tff(func_def_110,type,
sK40: vAttrL > vName ).
tff(func_def_111,type,
sK41: vAttrL > vAttrL ).
tff(func_def_112,type,
sK42: vTable > vAttrL ).
tff(func_def_113,type,
sK43: vTable > vRawTable ).
tff(func_def_114,type,
sK44: ( vName * vTStore ) > vName ).
tff(func_def_115,type,
sK45: ( vName * vTStore ) > vTable ).
tff(func_def_116,type,
sK46: ( vName * vTStore ) > vTStore ).
tff(func_def_117,type,
sK47: ( vName * vTStore ) > vName ).
tff(func_def_118,type,
sK48: ( vName * vTStore ) > vName ).
tff(func_def_119,type,
sK49: ( vName * vTStore ) > vTable ).
tff(func_def_120,type,
sK50: ( vName * vTStore ) > vTStore ).
tff(func_def_121,type,
sK51: ( vName * vTStore ) > vName ).
tff(func_def_122,type,
sK52: ( vName * vTStore ) > vName ).
tff(func_def_123,type,
sK53: vOptTable > vTable ).
tff(func_def_124,type,
sK54: vQuery > vTable ).
tff(func_def_125,type,
sK55: vQuery > vSelect ).
tff(func_def_126,type,
sK56: vQuery > vName ).
tff(func_def_127,type,
sK57: vQuery > vPred ).
tff(func_def_128,type,
sK58: vQuery > vQuery ).
tff(func_def_129,type,
sK59: vQuery > vQuery ).
tff(func_def_130,type,
sK60: vQuery > vQuery ).
tff(func_def_131,type,
sK61: vQuery > vQuery ).
tff(func_def_132,type,
sK62: vQuery > vQuery ).
tff(func_def_133,type,
sK63: vQuery > vQuery ).
tff(func_def_134,type,
sK64: ( vName * vTTContext ) > vName ).
tff(func_def_135,type,
sK65: ( vName * vTTContext ) > vTType ).
tff(func_def_136,type,
sK66: ( vName * vTTContext ) > vTTContext ).
tff(func_def_137,type,
sK67: ( vName * vTTContext ) > vName ).
tff(func_def_138,type,
sK68: ( vName * vTTContext ) > vName ).
tff(func_def_139,type,
sK69: ( vName * vTTContext ) > vTType ).
tff(func_def_140,type,
sK70: ( vName * vTTContext ) > vTTContext ).
tff(func_def_141,type,
sK71: ( vName * vTTContext ) > vName ).
tff(func_def_142,type,
sK72: ( vName * vTTContext ) > vName ).
tff(func_def_143,type,
sK73: vSelect > vAttrL ).
tff(func_def_144,type,
sK74: ( vAttrL * vRawTable * vAttrL ) > vRawTable ).
tff(func_def_145,type,
sK75: vAttrL > vName ).
tff(func_def_146,type,
sK76: vAttrL > vAttrL ).
tff(func_def_147,type,
sK77: vTType > vName ).
tff(func_def_148,type,
sK78: vTType > vFType ).
tff(func_def_149,type,
sK79: vTType > vTType ).
tff(func_def_150,type,
sK80: vRawTable > vRow ).
tff(func_def_151,type,
sK81: vRawTable > vRawTable ).
tff(func_def_152,type,
sK82: vTStore > vName ).
tff(func_def_153,type,
sK83: vTStore > vTable ).
tff(func_def_154,type,
sK84: vTStore > vTStore ).
tff(func_def_155,type,
sK85: vOptTable > vTable ).
tff(func_def_156,type,
sK86: vPred > vPred ).
tff(func_def_157,type,
sK87: vPred > vPred ).
tff(func_def_158,type,
sK88: vPred > vPred ).
tff(func_def_159,type,
sK89: vPred > vExp ).
tff(func_def_160,type,
sK90: vPred > vExp ).
tff(func_def_161,type,
sK91: vPred > vExp ).
tff(func_def_162,type,
sK92: vPred > vExp ).
tff(func_def_163,type,
sK93: vPred > vExp ).
tff(func_def_164,type,
sK94: vPred > vExp ).
tff(func_def_165,type,
sK95: vOptTType > vTType ).
tff(func_def_166,type,
sK96: vTTContext > vName ).
tff(func_def_167,type,
sK97: vTTContext > vTType ).
tff(func_def_168,type,
sK98: vTTContext > vTTContext ).
tff(func_def_169,type,
sK99: ( vQuery * vQuery ) > vTable ).
tff(func_def_170,type,
sK100: ( vQuery * vQuery ) > vTable ).
tff(func_def_171,type,
sK101: ( vQuery * vQuery ) > vTable ).
tff(func_def_172,type,
sK102: ( vQuery * vQuery ) > vQuery ).
tff(func_def_173,type,
sK103: ( vTable * vQuery ) > vTable ).
tff(func_def_174,type,
sK104: ( vTable * vQuery ) > vTable ).
tff(func_def_175,type,
sK105: ( vQuery * vQuery ) > vTable ).
tff(func_def_176,type,
sK106: ( vQuery * vQuery ) > vTable ).
tff(func_def_177,type,
sK107: ( vQuery * vQuery ) > vTable ).
tff(func_def_178,type,
sK108: ( vQuery * vQuery ) > vQuery ).
tff(func_def_179,type,
sK109: ( vTable * vQuery ) > vTable ).
tff(func_def_180,type,
sK110: ( vTable * vQuery ) > vTable ).
tff(func_def_181,type,
sK111: ( vQuery * vQuery ) > vTable ).
tff(func_def_182,type,
sK112: ( vQuery * vQuery ) > vTable ).
tff(func_def_183,type,
sK113: ( vQuery * vQuery ) > vTable ).
tff(func_def_184,type,
sK114: ( vQuery * vQuery ) > vQuery ).
tff(func_def_185,type,
sK115: ( vTable * vQuery ) > vTable ).
tff(func_def_186,type,
sK116: ( vTable * vQuery ) > vTable ).
tff(func_def_187,type,
sK117: vOptQuery > vQuery ).
tff(func_def_188,type,
sK118: vOptQuery > vQuery ).
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: ( vSelect * vTType ) > $o ).
tff(pred_def_21,type,
sP1: ( vTType * vAttrL ) > $o ).
tff(pred_def_22,type,
sP2: ( vName * vTStore ) > $o ).
tff(pred_def_23,type,
sP3: ( vName * vTStore ) > $o ).
tff(pred_def_24,type,
sP4: ( vName * vTTContext ) > $o ).
tff(pred_def_25,type,
sP5: ( vName * vTTContext ) > $o ).
tff(f98,axiom,
! [X0: vAttrL,X1: vRawTable] : ( vgetRaw(vtable(X0,X1)) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','getRaw-0') ).
tff(f99,axiom,
! [X0: vTable] :
? [X1: vAttrL,X2: vRawTable] :
( ( X0 = vtable(X1,X2) )
& ( vgetRaw(X0) = X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','getRaw-INV') ).
tff(f100,axiom,
! [X0: vAttrL,X1: vRawTable] : ( vgetAttrL(vtable(X0,X1)) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','getAttrL-0') ).
tff(f101,axiom,
! [X0: vTable] :
? [X1: vAttrL,X2: vRawTable] :
( ( X0 = vtable(X1,X2) )
& ( vgetAttrL(X0) = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','getAttrL-INV') ).
tff(f116,axiom,
! [X0: vTType,X1: vAttrL,X2: vRawTable] :
( vwelltypedtable(X0,vtable(X1,X2))
<=> ( vmatchingAttrL(X0,X1)
& vwelltypedRawtable(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','welltypedtable-0') ).
tff(f132,axiom,
! [X0: vRawTable] : visSomeRawTable(vsomeRawTable(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','isSomeRawTable-1') ).
tff(f257,axiom,
! [X0: vTType] : ( vprojectType(vall,X0) = vsomeTType(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','projectType-0') ).
tff(f258,axiom,
! [X0: vAttrL,X1: vTType] : ( vprojectType(vlist(X0),X1) = vprojectTypeAttrL(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','projectType-1') ).
tff(f293,axiom,
! [X0: vAttrL,X1: vRawTable,X2: vTType,X3: vAttrL,X4: vTType] :
( ( vwelltypedRawtable(X4,X1)
& vmatchingAttrL(X4,X0)
& ( vprojectTypeAttrL(X3,X4) = vsomeTType(X2) ) )
=> ? [X5: vRawTable] : ( vprojectCols(X3,X0,X1) = vsomeRawTable(X5) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',projectColsProgress) ).
tff(f296,conjecture,
! [X0: vAttrL,X1: vTable,X2: vTType,X3: vTType] :
( ( ~ visSomeRawTable(vprojectCols(X0,vgetAttrL(X1),vgetRaw(X1)))
& vwelltypedtable(X2,X1)
& ( vprojectType(vlist(X0),X2) = vsomeTType(X3) ) )
=> ? [X4: vTable] : ( vprojectTable(vlist(X0),X1) = vsomeTable(X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','projectTableProgress-list-isSomeRawTable-False') ).
tff(f297,negated_conjecture,
~ ! [X0: vAttrL,X1: vTable,X2: vTType,X3: vTType] :
( ( ~ visSomeRawTable(vprojectCols(X0,vgetAttrL(X1),vgetRaw(X1)))
& vwelltypedtable(X2,X1)
& ( vprojectType(vlist(X0),X2) = vsomeTType(X3) ) )
=> ? [X4: vTable] : ( vprojectTable(vlist(X0),X1) = vsomeTable(X4) ) ),
inference(negated_conjecture,[status(cth)],[f296]) ).
tff(f301,plain,
? [X0: vAttrL,X1: vTable,X2: vTType,X3: vTType] :
( ! [X4: vTable] : ( vsomeTable(X4) != vprojectTable(vlist(X0),X1) )
& ~ visSomeRawTable(vprojectCols(X0,vgetAttrL(X1),vgetRaw(X1)))
& vwelltypedtable(X2,X1)
& ( vprojectType(vlist(X0),X2) = vsomeTType(X3) ) ),
inference(ennf_transformation,[],[f297]) ).
tff(f302,plain,
? [X0: vAttrL,X1: vTable,X2: vTType,X3: vTType] :
( ! [X4: vTable] : ( vsomeTable(X4) != vprojectTable(vlist(X0),X1) )
& ~ visSomeRawTable(vprojectCols(X0,vgetAttrL(X1),vgetRaw(X1)))
& vwelltypedtable(X2,X1)
& ( vprojectType(vlist(X0),X2) = vsomeTType(X3) ) ),
inference(flattening,[],[f301]) ).
tff(f341,plain,
! [X0: vAttrL,X1: vRawTable,X2: vTType,X3: vAttrL,X4: vTType] :
( ? [X5: vRawTable] : ( vprojectCols(X3,X0,X1) = vsomeRawTable(X5) )
| ~ vwelltypedRawtable(X4,X1)
| ~ vmatchingAttrL(X4,X0)
| ( vsomeTType(X2) != vprojectTypeAttrL(X3,X4) ) ),
inference(ennf_transformation,[],[f293]) ).
tff(f342,plain,
! [X0: vAttrL,X1: vRawTable,X2: vTType,X3: vAttrL,X4: vTType] :
( ? [X5: vRawTable] : ( vprojectCols(X3,X0,X1) = vsomeRawTable(X5) )
| ~ vwelltypedRawtable(X4,X1)
| ~ vmatchingAttrL(X4,X0)
| ( vsomeTType(X2) != vprojectTypeAttrL(X3,X4) ) ),
inference(flattening,[],[f341]) ).
tff(f387,plain,
( ! [X4: vTable] : ( vsomeTable(X4) != vprojectTable(vlist(sK6),sK7) )
& ~ visSomeRawTable(vprojectCols(sK6,vgetAttrL(sK7),vgetRaw(sK7)))
& vwelltypedtable(sK8,sK7)
& ( vsomeTType(sK9) = vprojectType(vlist(sK6),sK8) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7,sK8,sK9]),skolemize(X0,sK6),skolemize(X1,sK7),skolemize(X2,sK8),skolemize(X3,sK9)],[f302]) ).
tff(f391,plain,
! [X0: vTType,X1: vAttrL,X2: vRawTable] :
( ( vwelltypedtable(X0,vtable(X1,X2))
| ~ vmatchingAttrL(X0,X1)
| ~ vwelltypedRawtable(X0,X2) )
& ( ( vmatchingAttrL(X0,X1)
& vwelltypedRawtable(X0,X2) )
| ~ vwelltypedtable(X0,vtable(X1,X2)) ) ),
inference(nnf_transformation,[],[f116]) ).
tff(f392,plain,
! [X0: vTType,X1: vAttrL,X2: vRawTable] :
( ( vwelltypedtable(X0,vtable(X1,X2))
| ~ vmatchingAttrL(X0,X1)
| ~ vwelltypedRawtable(X0,X2) )
& ( ( vmatchingAttrL(X0,X1)
& vwelltypedRawtable(X0,X2) )
| ~ vwelltypedtable(X0,vtable(X1,X2)) ) ),
inference(flattening,[],[f391]) ).
tff(f393,plain,
! [X0: vTable] :
( ( vtable(sK17(X0),sK18(X0)) = X0 )
& ( vgetRaw(X0) = sK18(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK17,sK18]),skolemize(X1,sK17(X0)),skolemize(X2,sK18(X0))],[f99]) ).
tff(f394,plain,
! [X0: vTable] :
( ( vtable(sK19(X0),sK20(X0)) = X0 )
& ( vgetAttrL(X0) = sK19(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK19,sK20]),skolemize(X1,sK19(X0)),skolemize(X2,sK20(X0))],[f101]) ).
tff(f429,plain,
! [X0: vAttrL,X1: vRawTable,X2: vTType,X3: vAttrL,X4: vTType] :
( ( vprojectCols(X3,X0,X1) = vsomeRawTable(sK74(X0,X1,X3)) )
| ~ vwelltypedRawtable(X4,X1)
| ~ vmatchingAttrL(X4,X0)
| ( vsomeTType(X2) != vprojectTypeAttrL(X3,X4) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK74]),skolemize(X5,sK74(X0,X1,X3))],[f342]) ).
tff(f449,plain,
vsomeTType(sK9) = vprojectType(vlist(sK6),sK8),
inference(cnf_transformation,[],[f387]) ).
tff(f450,plain,
vwelltypedtable(sK8,sK7),
inference(cnf_transformation,[],[f387]) ).
tff(f451,plain,
~ visSomeRawTable(vprojectCols(sK6,vgetAttrL(sK7),vgetRaw(sK7))),
inference(cnf_transformation,[],[f387]) ).
tff(f454,plain,
! [X0: vRawTable] : visSomeRawTable(vsomeRawTable(X0)),
inference(cnf_transformation,[],[f132]) ).
tff(f464,plain,
! [X2: vRawTable,X0: vTType,X1: vAttrL] :
( ~ vwelltypedtable(X0,vtable(X1,X2))
| vwelltypedRawtable(X0,X2) ),
inference(cnf_transformation,[],[f392]) ).
tff(f465,plain,
! [X2: vRawTable,X0: vTType,X1: vAttrL] :
( ~ vwelltypedtable(X0,vtable(X1,X2))
| vmatchingAttrL(X0,X1) ),
inference(cnf_transformation,[],[f392]) ).
tff(f471,plain,
! [X0: vTable] : ( vgetRaw(X0) = sK18(X0) ),
inference(cnf_transformation,[],[f393]) ).
tff(f472,plain,
! [X0: vTable] : ( vtable(sK17(X0),sK18(X0)) = X0 ),
inference(cnf_transformation,[],[f393]) ).
tff(f473,plain,
! [X0: vAttrL,X1: vRawTable] : ( vgetRaw(vtable(X0,X1)) = X1 ),
inference(cnf_transformation,[],[f98]) ).
tff(f474,plain,
! [X0: vTable] : ( vgetAttrL(X0) = sK19(X0) ),
inference(cnf_transformation,[],[f394]) ).
tff(f475,plain,
! [X0: vTable] : ( vtable(sK19(X0),sK20(X0)) = X0 ),
inference(cnf_transformation,[],[f394]) ).
tff(f476,plain,
! [X0: vAttrL,X1: vRawTable] : ( vgetAttrL(vtable(X0,X1)) = X0 ),
inference(cnf_transformation,[],[f100]) ).
tff(f487,plain,
! [X0: vAttrL,X1: vTType] : ( vprojectTypeAttrL(X0,X1) = vprojectType(vlist(X0),X1) ),
inference(cnf_transformation,[],[f258]) ).
tff(f488,plain,
! [X0: vTType] : ( vsomeTType(X0) = vprojectType(vall,X0) ),
inference(cnf_transformation,[],[f257]) ).
tff(f575,plain,
! [X2: vTType,X3: vAttrL,X0: vAttrL,X1: vRawTable,X4: vTType] :
( ( vprojectCols(X3,X0,X1) = vsomeRawTable(sK74(X0,X1,X3)) )
| ~ vwelltypedRawtable(X4,X1)
| ~ vmatchingAttrL(X4,X0)
| ( vsomeTType(X2) != vprojectTypeAttrL(X3,X4) ) ),
inference(cnf_transformation,[],[f429]) ).
tff(f679,plain,
~ visSomeRawTable(vprojectCols(sK6,sK19(sK7),sK18(sK7))),
inference(definition_unfolding,[],[f451,f474,f471]) ).
tff(f680,plain,
vprojectType(vlist(sK6),sK8) = vprojectType(vall,sK9),
inference(definition_unfolding,[],[f449,f488]) ).
tff(f684,plain,
! [X0: vAttrL,X1: vRawTable] : ( sK18(vtable(X0,X1)) = X1 ),
inference(definition_unfolding,[],[f473,f471]) ).
tff(f685,plain,
! [X0: vAttrL,X1: vRawTable] : ( sK19(vtable(X0,X1)) = X0 ),
inference(definition_unfolding,[],[f476,f474]) ).
tff(f697,plain,
! [X2: vTType,X3: vAttrL,X0: vAttrL,X1: vRawTable,X4: vTType] :
( ( vprojectType(vall,X2) != vprojectType(vlist(X3),X4) )
| ~ vwelltypedRawtable(X4,X1)
| ~ vmatchingAttrL(X4,X0)
| ( vprojectCols(X3,X0,X1) = vsomeRawTable(sK74(X0,X1,X3)) ) ),
inference(definition_unfolding,[],[f575,f488,f487]) ).
tff(f711,plain,
! [X0: vTable] : ( sK17(X0) = sK19(X0) ),
inference(superposition,[],[f685,f472]) ).
tff(f715,plain,
! [X0: vTable] : ( vtable(sK17(X0),sK20(X0)) = X0 ),
inference(forward_demodulation,[],[f475,f711]) ).
tff(f739,plain,
! [X0: vTable] : ( sK18(X0) = sK20(X0) ),
inference(superposition,[],[f684,f715]) ).
tff(f743,plain,
~ visSomeRawTable(vprojectCols(sK6,sK19(sK7),sK20(sK7))),
inference(superposition,[],[f679,f739]) ).
tff(f747,plain,
~ visSomeRawTable(vprojectCols(sK6,sK17(sK7),sK20(sK7))),
inference(forward_demodulation,[],[f743,f711]) ).
tff(f758,plain,
! [X0: vTable,X1: vTType] :
( vwelltypedRawtable(X1,sK20(X0))
| ~ vwelltypedtable(X1,X0) ),
inference(superposition,[],[f464,f715]) ).
tff(f763,plain,
! [X0: vTable,X1: vTType] :
( vmatchingAttrL(X1,sK17(X0))
| ~ vwelltypedtable(X1,X0) ),
inference(superposition,[],[f465,f472]) ).
tff(f2198,plain,
! [X2: vAttrL,X0: vTType,X1: vRawTable] :
( ( vprojectType(vall,X0) != vprojectType(vall,sK9) )
| ~ vwelltypedRawtable(sK8,X1)
| ~ vmatchingAttrL(sK8,X2)
| ( vprojectCols(sK6,X2,X1) = vsomeRawTable(sK74(X2,X1,sK6)) ) ),
inference(superposition,[],[f697,f680]) ).
tff(f2526,plain,
! [X0: vRawTable,X1: vAttrL] :
( ( vprojectCols(sK6,X1,X0) = vsomeRawTable(sK74(X1,X0,sK6)) )
| ~ vmatchingAttrL(sK8,X1)
| ~ vwelltypedRawtable(sK8,X0) ),
inference(equality_resolution,[],[f2198]) ).
tff(f2573,plain,
! [X0: vAttrL,X1: vRawTable] :
( visSomeRawTable(vprojectCols(sK6,X0,X1))
| ~ vmatchingAttrL(sK8,X0)
| ~ vwelltypedRawtable(sK8,X1) ),
inference(superposition,[],[f454,f2526]) ).
tff(f2578,plain,
( ~ vwelltypedRawtable(sK8,sK20(sK7))
| ~ vmatchingAttrL(sK8,sK17(sK7)) ),
inference(resolution,[],[f2573,f747]) ).
tff(f2585,plain,
( ~ vmatchingAttrL(sK8,sK17(sK7))
| ~ vwelltypedtable(sK8,sK7) ),
inference(resolution,[],[f2578,f758]) ).
tff(f2586,plain,
~ vwelltypedtable(sK8,sK7),
inference(forward_subsumption_resolution,[],[f2585,f763]) ).
tff(f2587,plain,
$false,
inference(forward_subsumption_resolution,[],[f2586,f450]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM306_1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.22 % Computer : n004.cluster.edu
% 0.10/0.22 % Model : x86_64 x86_64
% 0.10/0.22 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.22 % Memory : 8046.5625MB
% 0.10/0.22 % OS : Linux 6.8.0-71-generic
% 0.10/0.22 % CPULimit : 300
% 0.10/0.22 % WCLimit : 300
% 0.10/0.22 % DateTime : Mon Sep 28 22:04:52 UTC 2026
% 0.10/0.22 % CPUTime :
% 0.10/0.22 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.28 Running first-order theorem proving
% 0.25/0.28 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
% 3.97/1.44 % (841242)Detected formulas, will run a generic FOF schedule.
% 3.97/1.44 % (841253)dis-21_1_sil=8000:lcm=predicate:random_seed=434689967: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)
% 3.97/1.44 % (841251)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=582345381:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.97/1.44 % (841252)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1372551002:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.97/1.44 % (841247)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=2330332721:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.97/1.44 % (841249)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=1601720544:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.97/1.44 % (841250)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=642883032:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.97/1.44 % (841248)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=2796026116:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.97/1.44 % (841253)Instruction limit reached!
% 3.97/1.44 % (841253)------------------------------
% 3.97/1.44 % (841253)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.97/1.44 % (841253)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.97/1.44 % (841253)CaDiCaL version: 2.1.3
% 3.97/1.44 % (841253)Termination reason: Instruction limit
% 3.97/1.44 % (841253)Termination phase: Saturation
% 3.97/1.44 % (841253)Time elapsed: 0.092 s
% 3.97/1.44 % (841253)Peak memory usage: 91 MB
% 3.97/1.44 % (841253)Instructions burned: 130 (million)
% 3.97/1.44 % (841251)First to succeed.
% 3.97/1.44 % (841251)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-841242"
% 3.97/1.44 % (841252)Also succeeded, but the first one will report.
% 3.97/1.44 % (841250)Instruction limit reached!
% 3.97/1.44 % (841250)------------------------------
% 3.97/1.44 % (841250)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.97/1.44 % (841250)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.97/1.44 % (841250)CaDiCaL version: 2.1.3
% 3.97/1.44 % (841250)Termination reason: Instruction limit
% 3.97/1.44 % (841250)Termination phase: Saturation
% 3.97/1.44 % (841250)Time elapsed: 0.114 s
% 3.97/1.44 % (841250)Peak memory usage: 89 MB
% 3.97/1.44 % (841250)Instructions burned: 109 (million)
% 3.97/1.44 % (841261)lrs+10_1_sil=8000:sp=occurrence:random_seed=2276188363:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.97/1.44 % (841251)Refutation found. Thanks to Tanya!
% 3.97/1.44 % SZS status Theorem for theBenchmark
% 3.97/1.44 % SZS output start Proof for theBenchmark
% See solution above
% 4.77/1.67 % (841251)------------------------------
% 4.77/1.67 % (841251)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.77/1.67 % (841251)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.77/1.67 % (841251)CaDiCaL version: 2.1.3
% 4.77/1.67 % (841251)Termination reason: Refutation
% 4.77/1.67 % (841251)Time elapsed: 0.054 s
% 4.77/1.67 % (841251)Peak memory usage: 89 MB
% 4.77/1.67 % (841251)Instructions burned: 96 (million)
% 4.77/1.67 % (841251)------------------------------
% 4.77/1.67 % (841251)------------------------------
% 4.77/1.67 % (841242)Success in time 0.572 s
% 4.77/1.67 % Vampire exiting
%------------------------------------------------------------------------------