%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : COM286_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 : n001.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:00 AM UTC 2026
% Result : Theorem 4.55s 1.58s
% Output : Refutation 5.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 21 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 70 ( 39 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 70 ( 21 ~; 14 |; 32 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 21 ( 20 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 25 ( 23 usr; 1 prp; 0-3 aty)
% Number of functors : 150 ( 150 usr; 24 con; 0-3 aty)
% Number of variables : 51 ( 37 !; 14 ?; 51 :)
% 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,
vq1: vQuery ).
tff(func_def_31,type,
vbindContext: ( vName * vTType * vTTContext ) > vTTContext ).
tff(func_def_32,type,
vlt: ( vExp * vExp ) > vPred ).
tff(func_def_33,type,
vemptyContext: vTTContext ).
tff(func_def_34,type,
vgt: ( vExp * vExp ) > vPred ).
tff(func_def_35,type,
vsomeTable: vTable > vOptTable ).
tff(func_def_36,type,
vemptyStore: vTStore ).
tff(func_def_37,type,
veq: ( vExp * vExp ) > vPred ).
tff(func_def_38,type,
vand: ( vPred * vPred ) > vPred ).
tff(func_def_39,type,
vlist: vAttrL > vSelect ).
tff(func_def_40,type,
vtable: ( vAttrL * vRawTable ) > vTable ).
tff(func_def_41,type,
vq2: vQuery ).
tff(func_def_42,type,
vprojectTable: ( vSelect * vTable ) > vOptTable ).
tff(func_def_43,type,
vinitFType: vFType ).
tff(func_def_44,type,
vprojectTypeAttrL: ( vAttrL * vTType ) > vOptTType ).
tff(func_def_45,type,
venumVal: vVal > vVal ).
tff(func_def_46,type,
vinitVal: vVal ).
tff(func_def_47,type,
vgetRaw: vTable > vRawTable ).
tff(func_def_48,type,
vprojectFirstRaw: vRawTable > vRawTable ).
tff(func_def_49,type,
vlookupStore: ( vName * vTStore ) > vOptTable ).
tff(func_def_50,type,
vrawUnion: ( vRawTable * vRawTable ) > vRawTable ).
tff(func_def_51,type,
venumFType: vFType > vFType ).
tff(func_def_52,type,
vattachColToFrontRaw: ( vRawTable * vRawTable ) > vRawTable ).
tff(func_def_53,type,
vprojectEmptyCol: vRawTable > vRawTable ).
tff(func_def_54,type,
vfilterTable: ( vTable * vPred ) > vTable ).
tff(func_def_55,type,
venumName: vName > vName ).
tff(func_def_56,type,
vgetAttrL: vTable > vAttrL ).
tff(func_def_57,type,
vevalExpRow: ( vExp * vAttrL * vRow ) > vOptVal ).
tff(func_def_58,type,
vfindCol: ( vName * vAttrL * vRawTable ) > vOptRawTable ).
tff(func_def_59,type,
vlookupContext: ( vName * vTTContext ) > vOptTType ).
tff(func_def_60,type,
vreduce: ( vQuery * vTStore ) > vOptQuery ).
tff(func_def_61,type,
vfieldType: vVal > vFType ).
tff(func_def_62,type,
vrawIntersection: ( vRawTable * vRawTable ) > vRawTable ).
tff(func_def_63,type,
vtypeOfExp: ( vExp * vTType ) > vOptFType ).
tff(func_def_64,type,
vdropFirstColRaw: vRawTable > vRawTable ).
tff(func_def_65,type,
vfindColType: ( vName * vTType ) > vOptFType ).
tff(func_def_66,type,
vinitName: vName ).
tff(func_def_67,type,
vfilterRows: ( vRawTable * vAttrL * vPred ) > vRawTable ).
tff(func_def_68,type,
vprojectType: ( vSelect * vTType ) > vOptTType ).
tff(func_def_69,type,
vprojectCols: ( vAttrL * vAttrL * vRawTable ) > vOptRawTable ).
tff(func_def_70,type,
vrawDifference: ( vRawTable * vRawTable ) > vRawTable ).
tff(func_def_71,type,
vappend: ( vAttrL * vAttrL ) > vAttrL ).
tff(func_def_72,type,
vgetFType: vOptFType > vFType ).
tff(func_def_73,type,
vgetQuery: vOptQuery > vQuery ).
tff(func_def_74,type,
vgetTType: vOptTType > vTType ).
tff(func_def_75,type,
vgetVal: vOptVal > vVal ).
tff(func_def_76,type,
vgetTable: vOptTable > vTable ).
tff(func_def_77,type,
vgetRawTable: vOptRawTable > vRawTable ).
tff(func_def_78,type,
sK4: vQuery ).
tff(func_def_79,type,
sK5: vTable ).
tff(func_def_80,type,
sK6: vTTContext ).
tff(func_def_81,type,
sK7: vTStore ).
tff(func_def_82,type,
sK8: vTType ).
tff(func_def_83,type,
sK9: vOptQuery > vQuery ).
tff(func_def_84,type,
sK10: ( vTStore * vTTContext ) > vTStore ).
tff(func_def_85,type,
sK11: ( vTStore * vTTContext ) > vTTContext ).
tff(func_def_86,type,
sK12: ( vTStore * vTTContext ) > vName ).
tff(func_def_87,type,
sK13: ( vTStore * vTTContext ) > vTable ).
tff(func_def_88,type,
sK14: ( vTStore * vTTContext ) > vTTContext ).
tff(func_def_89,type,
sK15: ( vTStore * vTTContext ) > vName ).
tff(func_def_90,type,
sK16: ( vTStore * vTTContext ) > vTStore ).
tff(func_def_91,type,
sK17: ( vTStore * vTTContext ) > vTType ).
tff(func_def_92,type,
sK18: ( vTStore * vTTContext ) > vName ).
tff(func_def_93,type,
sK19: ( vTStore * vTTContext ) > vTable ).
tff(func_def_94,type,
sK20: ( vTStore * vTTContext ) > vTTContext ).
tff(func_def_95,type,
sK21: ( vTStore * vTTContext ) > vName ).
tff(func_def_96,type,
sK22: ( vTStore * vTTContext ) > vTStore ).
tff(func_def_97,type,
sK23: ( vTStore * vTTContext ) > vTType ).
tff(func_def_98,type,
sK24: vTStore > vName ).
tff(func_def_99,type,
sK25: vTStore > vTable ).
tff(func_def_100,type,
sK26: vTStore > vTStore ).
tff(func_def_101,type,
sK27: vTTContext > vName ).
tff(func_def_102,type,
sK28: vTTContext > vTType ).
tff(func_def_103,type,
sK29: vTTContext > vTTContext ).
tff(func_def_104,type,
sK30: vTTContext > vName ).
tff(func_def_105,type,
sK31: vTTContext > vTType ).
tff(func_def_106,type,
sK32: vTTContext > vTTContext ).
tff(func_def_107,type,
sK33: ( vName * vTStore ) > vName ).
tff(func_def_108,type,
sK34: ( vName * vTStore ) > vTable ).
tff(func_def_109,type,
sK35: ( vName * vTStore ) > vTStore ).
tff(func_def_110,type,
sK36: ( vName * vTStore ) > vName ).
tff(func_def_111,type,
sK37: ( vName * vTStore ) > vName ).
tff(func_def_112,type,
sK38: ( vName * vTStore ) > vTable ).
tff(func_def_113,type,
sK39: ( vName * vTStore ) > vTStore ).
tff(func_def_114,type,
sK40: ( vName * vTStore ) > vName ).
tff(func_def_115,type,
sK41: ( vName * vTStore ) > vName ).
tff(func_def_116,type,
sK42: vTStore > vName ).
tff(func_def_117,type,
sK43: vTStore > vTable ).
tff(func_def_118,type,
sK44: vTStore > vTStore ).
tff(func_def_119,type,
sK45: vOptTable > vTable ).
tff(func_def_120,type,
sK46: vOptTable > vTable ).
tff(func_def_121,type,
sK47: vQuery > vTable ).
tff(func_def_122,type,
sK48: vQuery > vSelect ).
tff(func_def_123,type,
sK49: vQuery > vName ).
tff(func_def_124,type,
sK50: vQuery > vPred ).
tff(func_def_125,type,
sK51: vQuery > vQuery ).
tff(func_def_126,type,
sK52: vQuery > vQuery ).
tff(func_def_127,type,
sK53: vQuery > vQuery ).
tff(func_def_128,type,
sK54: vQuery > vQuery ).
tff(func_def_129,type,
sK55: vQuery > vQuery ).
tff(func_def_130,type,
sK56: vQuery > vQuery ).
tff(func_def_131,type,
sK57: ( vQuery * vQuery ) > vTable ).
tff(func_def_132,type,
sK58: ( vQuery * vQuery ) > vTable ).
tff(func_def_133,type,
sK59: ( vQuery * vQuery ) > vTable ).
tff(func_def_134,type,
sK60: ( vQuery * vQuery ) > vQuery ).
tff(func_def_135,type,
sK61: ( vTable * vQuery ) > vTable ).
tff(func_def_136,type,
sK62: ( vTable * vQuery ) > vTable ).
tff(func_def_137,type,
sK63: ( vQuery * vQuery ) > vTable ).
tff(func_def_138,type,
sK64: ( vQuery * vQuery ) > vTable ).
tff(func_def_139,type,
sK65: ( vQuery * vQuery ) > vTable ).
tff(func_def_140,type,
sK66: ( vQuery * vQuery ) > vQuery ).
tff(func_def_141,type,
sK67: ( vTable * vQuery ) > vTable ).
tff(func_def_142,type,
sK68: ( vTable * vQuery ) > vTable ).
tff(func_def_143,type,
sK69: ( vQuery * vQuery ) > vTable ).
tff(func_def_144,type,
sK70: ( vQuery * vQuery ) > vTable ).
tff(func_def_145,type,
sK71: ( vQuery * vQuery ) > vTable ).
tff(func_def_146,type,
sK72: ( vQuery * vQuery ) > vQuery ).
tff(func_def_147,type,
sK73: ( vTable * vQuery ) > vTable ).
tff(func_def_148,type,
sK74: ( vTable * vQuery ) > vTable ).
tff(func_def_149,type,
sK75: 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: ( vTStore * vTTContext ) > $o ).
tff(pred_def_21,type,
sP1: ( vTStore * vTTContext ) > $o ).
tff(pred_def_22,type,
sP2: ( vName * vTStore ) > $o ).
tff(pred_def_23,type,
sP3: ( vName * vTStore ) > $o ).
tff(f45,axiom,
! [X0: vQuery] : ( vnoQuery != vsomeQuery(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','DIFF-noQuery-someQuery') ).
tff(f241,axiom,
! [X0: vTable,X1: vQuery,X2: vTStore] :
( ( ! [X3: vTable,X4: vTable] :
( ( X0 != X3 )
| ( X1 != vtvalue(X4) ) )
& ~ visSomeQuery(vreduce(X1,X2)) )
=> ( vreduce(vDifference(vtvalue(X0),X1),X2) = vnoQuery ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','reduce-16') ).
tff(f295,conjecture,
! [X0: vQuery,X1: vTable,X2: vTTContext,X3: vTStore,X4: vTType] :
( ( ~ visSomeQuery(vreduce(vq2,X3))
& ! [X5: vTable] : ( vq2 != vtvalue(X5) )
& ( vq1 = vtvalue(X1) )
& vstoreContextConsistent(X3,X2)
& vptcheck(X2,vDifference(vq1,vq2),X4)
& ( vreduce(vDifference(vq1,vq2),X3) = vsomeQuery(X0) ) )
=> vptcheck(X2,X0,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','Preservation-Difference-tvalue-q2-isSomeQuery-False') ).
tff(f296,negated_conjecture,
~ ! [X0: vQuery,X1: vTable,X2: vTTContext,X3: vTStore,X4: vTType] :
( ( ~ visSomeQuery(vreduce(vq2,X3))
& ! [X5: vTable] : ( vq2 != vtvalue(X5) )
& ( vq1 = vtvalue(X1) )
& vstoreContextConsistent(X3,X2)
& vptcheck(X2,vDifference(vq1,vq2),X4)
& ( vreduce(vDifference(vq1,vq2),X3) = vsomeQuery(X0) ) )
=> vptcheck(X2,X0,X4) ),
inference(negated_conjecture,[status(cth)],[f295]) ).
tff(f298,plain,
? [X0: vQuery,X1: vTable,X2: vTTContext,X3: vTStore,X4: vTType] :
( ~ vptcheck(X2,X0,X4)
& ~ visSomeQuery(vreduce(vq2,X3))
& ! [X5: vTable] : ( vq2 != vtvalue(X5) )
& ( vq1 = vtvalue(X1) )
& vstoreContextConsistent(X3,X2)
& vptcheck(X2,vDifference(vq1,vq2),X4)
& ( vreduce(vDifference(vq1,vq2),X3) = vsomeQuery(X0) ) ),
inference(ennf_transformation,[],[f296]) ).
tff(f299,plain,
? [X0: vQuery,X1: vTable,X2: vTTContext,X3: vTStore,X4: vTType] :
( ~ vptcheck(X2,X0,X4)
& ~ visSomeQuery(vreduce(vq2,X3))
& ! [X5: vTable] : ( vq2 != vtvalue(X5) )
& ( vq1 = vtvalue(X1) )
& vstoreContextConsistent(X3,X2)
& vptcheck(X2,vDifference(vq1,vq2),X4)
& ( vreduce(vDifference(vq1,vq2),X3) = vsomeQuery(X0) ) ),
inference(flattening,[],[f298]) ).
tff(f333,plain,
! [X0: vTable,X1: vQuery,X2: vTStore] :
( ( vreduce(vDifference(vtvalue(X0),X1),X2) = vnoQuery )
| ? [X3: vTable,X4: vTable] :
( ( X0 = X3 )
& ( vtvalue(X4) = X1 ) )
| visSomeQuery(vreduce(X1,X2)) ),
inference(ennf_transformation,[],[f241]) ).
tff(f334,plain,
! [X0: vTable,X1: vQuery,X2: vTStore] :
( ( vreduce(vDifference(vtvalue(X0),X1),X2) = vnoQuery )
| ? [X3: vTable,X4: vTable] :
( ( X0 = X3 )
& ( vtvalue(X4) = X1 ) )
| visSomeQuery(vreduce(X1,X2)) ),
inference(flattening,[],[f333]) ).
tff(f361,plain,
( ~ vptcheck(sK6,sK4,sK8)
& ~ visSomeQuery(vreduce(vq2,sK7))
& ! [X5: vTable] : ( vq2 != vtvalue(X5) )
& ( vq1 = vtvalue(sK5) )
& vstoreContextConsistent(sK7,sK6)
& vptcheck(sK6,vDifference(vq1,vq2),sK8)
& ( vsomeQuery(sK4) = vreduce(vDifference(vq1,vq2),sK7) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5,sK6,sK7,sK8]),skolemize(X0,sK4),skolemize(X1,sK5),skolemize(X2,sK6),skolemize(X3,sK7),skolemize(X4,sK8)],[f299]) ).
tff(f385,plain,
! [X0: vTable,X1: vQuery,X2: vTStore] :
( ( vreduce(vDifference(vtvalue(X0),X1),X2) = vnoQuery )
| ( ( sK61(X0,X1) = X0 )
& ( vtvalue(sK62(X0,X1)) = X1 ) )
| visSomeQuery(vreduce(X1,X2)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK61,sK62]),skolemize(X3,sK61(X0,X1)),skolemize(X4,sK62(X0,X1))],[f334]) ).
tff(f391,plain,
vsomeQuery(sK4) = vreduce(vDifference(vq1,vq2),sK7),
inference(cnf_transformation,[],[f361]) ).
tff(f394,plain,
vq1 = vtvalue(sK5),
inference(cnf_transformation,[],[f361]) ).
tff(f395,plain,
! [X5: vTable] : ( vtvalue(X5) != vq2 ),
inference(cnf_transformation,[],[f361]) ).
tff(f396,plain,
~ visSomeQuery(vreduce(vq2,sK7)),
inference(cnf_transformation,[],[f361]) ).
tff(f481,plain,
! [X2: vTStore,X0: vTable,X1: vQuery] :
( ( vnoQuery = vreduce(vDifference(vtvalue(X0),X1),X2) )
| ( vtvalue(sK62(X0,X1)) = X1 )
| visSomeQuery(vreduce(X1,X2)) ),
inference(cnf_transformation,[],[f385]) ).
tff(f498,plain,
! [X0: vQuery] : ( vnoQuery != vsomeQuery(X0) ),
inference(cnf_transformation,[],[f45]) ).
tff(f921,plain,
! [X0: vQuery,X1: vTStore] :
( ( vnoQuery = vreduce(vDifference(vq1,X0),X1) )
| ( vtvalue(sK62(sK5,X0)) = X0 )
| visSomeQuery(vreduce(X0,X1)) ),
inference(superposition,[],[f481,f394]) ).
tff(f923,plain,
( ( vnoQuery = vsomeQuery(sK4) )
| ( vq2 = vtvalue(sK62(sK5,vq2)) )
| visSomeQuery(vreduce(vq2,sK7)) ),
inference(superposition,[],[f391,f921]) ).
tff(f924,plain,
( ( vq2 = vtvalue(sK62(sK5,vq2)) )
| visSomeQuery(vreduce(vq2,sK7)) ),
inference(forward_subsumption_resolution,[],[f923,f498]) ).
tff(f926,plain,
visSomeQuery(vreduce(vq2,sK7)),
inference(forward_subsumption_resolution,[],[f924,f395]) ).
tff(f928,plain,
$false,
inference(forward_subsumption_resolution,[],[f926,f396]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM286_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.11/0.24 % Computer : n001.cluster.edu
% 0.11/0.24 % Model : x86_64 x86_64
% 0.11/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.24 % Memory : 8046.5625MB
% 0.11/0.24 % OS : Linux 6.8.0-71-generic
% 0.11/0.24 % CPULimit : 300
% 0.11/0.24 % WCLimit : 300
% 0.11/0.24 % DateTime : Mon Sep 28 22:10:05 UTC 2026
% 0.11/0.25 % CPUTime :
% 0.11/0.25 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/0.30 Running first-order theorem proving
% 0.23/0.30 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
% 4.55/1.58 % (800322)Detected formulas, will run a generic FOF schedule.
% 4.55/1.58 % (800338)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=2148161245:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 4.55/1.58 % (800342)dis-21_1_sil=8000:lcm=predicate:random_seed=1038904258: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)
% 4.55/1.58 % (800336)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=809938751:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 4.55/1.58 % (800341)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1552329996:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 4.55/1.58 % (800339)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3762460710:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 4.55/1.58 % (800340)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3103283650:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 4.55/1.58 % (800337)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=1657443651:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 4.55/1.58 % (800339)Refutation not found, incomplete strategy
% 4.55/1.58 % (800339)------------------------------
% 4.55/1.58 % (800339)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.55/1.58 % (800339)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.55/1.58 % (800339)CaDiCaL version: 2.1.3
% 4.55/1.58 % (800339)Termination reason: Refutation not found, incomplete strategy
% 4.55/1.58 % (800339)Time elapsed: 0.009 s
% 4.55/1.58 % (800339)Peak memory usage: 89 MB
% 4.55/1.58 % (800339)Instructions burned: 7 (million)
% 4.55/1.58 % (800340)First to succeed.
% 4.55/1.58 % (800340)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-800322"
% 4.55/1.58 % (800342)Instruction limit reached!
% 4.55/1.58 % (800342)------------------------------
% 4.55/1.58 % (800342)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.55/1.58 % (800342)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.55/1.58 % (800342)CaDiCaL version: 2.1.3
% 4.55/1.58 % (800342)Termination reason: Instruction limit
% 4.55/1.58 % (800342)Termination phase: Saturation
% 4.55/1.58 % (800342)Time elapsed: 0.126 s
% 4.55/1.58 % (800342)Peak memory usage: 91 MB
% 4.55/1.58 % (800342)Instructions burned: 129 (million)
% 4.55/1.58 % (800341)Also succeeded, but the first one will report.
% 4.55/1.58 % (800339)------------------------------
% 4.55/1.58 % (800339)------------------------------
% 4.55/1.58 % (800351)lrs+10_1_sil=8000:sp=occurrence:random_seed=3186521489:i=285:sd=3:ss=axioms:sgt=8_2996 on theBenchmark for (2996ds/285Mi)
% 4.55/1.58 % (800340)Refutation found. Thanks to Tanya!
% 4.55/1.58 % SZS status Theorem for theBenchmark
% 4.55/1.58 % SZS output start Proof for theBenchmark
% See solution above
% 5.61/1.82 % (800340)------------------------------
% 5.61/1.82 % (800340)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.61/1.82 % (800340)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.61/1.82 % (800340)CaDiCaL version: 2.1.3
% 5.61/1.82 % (800340)Termination reason: Refutation
% 5.61/1.82 % (800340)Time elapsed: 0.035 s
% 5.61/1.82 % (800340)Peak memory usage: 89 MB
% 5.61/1.82 % (800340)Instructions burned: 31 (million)
% 5.61/1.82 % (800340)------------------------------
% 5.61/1.82 % (800340)------------------------------
% 5.61/1.82 % (800322)Success in time 0.677 s
% 5.61/1.82 % Vampire exiting
%------------------------------------------------------------------------------