%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : COM253_1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n011.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:39:54 AM UTC 2026
% Result : Theorem 2.74s 1.14s
% Output : Refutation 3.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 8
% Syntax : Number of formulae : 53 ( 13 unt; 0 typ; 3 def)
% Number of atoms : 125 ( 88 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 131 ( 59 ~; 54 |; 11 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 27 ( 26 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 14 ( 12 usr; 3 prp; 0-3 aty)
% Number of functors : 118 ( 118 usr; 38 con; 0-4 aty)
% Number of variables : 85 ( 0 sgn 75 !; 10 ?; 85 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
vEntry: $tType ).
tff(type_def_6,type,
vYN: $tType ).
tff(type_def_7,type,
vMapConf: $tType ).
tff(type_def_8,type,
vOptAType: $tType ).
tff(type_def_9,type,
vATMap: $tType ).
tff(type_def_10,type,
vQuestionnaire: $tType ).
tff(type_def_11,type,
vOptMapConf: $tType ).
tff(type_def_12,type,
vQConf: $tType ).
tff(type_def_13,type,
vstring: $tType ).
tff(type_def_14,type,
vchar: $tType ).
tff(type_def_15,type,
vAval: $tType ).
tff(type_def_16,type,
vOptQConf: $tType ).
tff(type_def_17,type,
vOptQuestion: $tType ).
tff(type_def_18,type,
vAnsMap: $tType ).
tff(type_def_19,type,
vExp: $tType ).
tff(type_def_20,type,
vQMap: $tType ).
tff(type_def_21,type,
vQID: $tType ).
tff(type_def_22,type,
vLabel: $tType ).
tff(type_def_23,type,
vOptAval: $tType ).
tff(type_def_24,type,
vnat: $tType ).
tff(type_def_25,type,
vOptExp: $tType ).
tff(type_def_26,type,
vGID: $tType ).
tff(type_def_27,type,
vATList: $tType ).
tff(type_def_28,type,
vBinOpT: $tType ).
tff(type_def_29,type,
vUnOpT: $tType ).
tff(type_def_30,type,
vAType: $tType ).
tff(func_def_0,type,
vconstant: vAval > vExp ).
tff(func_def_1,type,
vqmempty: vQMap ).
tff(func_def_2,type,
vquestion: ( vQID * vLabel * vAType ) > vEntry ).
tff(func_def_3,type,
vsomeMapConf: vMapConf > vOptMapConf ).
tff(func_def_4,type,
vsomeExp: vExp > vOptExp ).
tff(func_def_5,type,
vsubop: vBinOpT ).
tff(func_def_6,type,
vqcond: ( vExp * vQuestionnaire * vQuestionnaire ) > vQuestionnaire ).
tff(func_def_7,type,
vandop: vBinOpT ).
tff(func_def_8,type,
vnotop: vUnOpT ).
tff(func_def_9,type,
vNum: vnat > vAval ).
tff(func_def_10,type,
vnoAType: vOptAType ).
tff(func_def_11,type,
vyes: vYN ).
tff(func_def_12,type,
vT: vstring > vAval ).
tff(func_def_13,type,
vNumber: vAType ).
tff(func_def_14,type,
vdivop: vBinOpT ).
tff(func_def_15,type,
vzero: vnat ).
tff(func_def_16,type,
vsucc: vnat > vnat ).
tff(func_def_17,type,
vabind: ( vQID * vAval * vAnsMap ) > vAnsMap ).
tff(func_def_18,type,
vnoAval: vOptAval ).
tff(func_def_19,type,
vYesNo: vAType ).
tff(func_def_20,type,
vdefquestion: ( vQID * vLabel * vAType ) > vEntry ).
tff(func_def_21,type,
vunop: ( vUnOpT * vExp ) > vExp ).
tff(func_def_22,type,
vaempty: vAnsMap ).
tff(func_def_23,type,
vatempty: vATList ).
tff(func_def_24,type,
vscons: ( vchar * vstring ) > vstring ).
tff(func_def_25,type,
vqseq: ( vQuestionnaire * vQuestionnaire ) > vQuestionnaire ).
tff(func_def_26,type,
vmulop: vBinOpT ).
tff(func_def_27,type,
vqempty: vQuestionnaire ).
tff(func_def_28,type,
vsomeQConf: vQConf > vOptQConf ).
tff(func_def_29,type,
vnoQConf: vOptQConf ).
tff(func_def_30,type,
vnoExp: vOptExp ).
tff(func_def_31,type,
vbinop: ( vExp * vBinOpT * vExp ) > vExp ).
tff(func_def_32,type,
vB: vYN > vAval ).
tff(func_def_33,type,
vQC: ( vAnsMap * vQMap * vQuestionnaire ) > vQConf ).
tff(func_def_34,type,
vorop: vBinOpT ).
tff(func_def_35,type,
veqop: vBinOpT ).
tff(func_def_36,type,
vatcons: ( vAType * vATList ) > vATList ).
tff(func_def_37,type,
vText: vAType ).
tff(func_def_38,type,
vsomeAval: vAval > vOptAval ).
tff(func_def_39,type,
vqsingle: vEntry > vQuestionnaire ).
tff(func_def_40,type,
vMC: ( vATMap * vATMap ) > vMapConf ).
tff(func_def_41,type,
vaddop: vBinOpT ).
tff(func_def_42,type,
vsomeQuestion: ( vQID * vLabel * vAType ) > vOptQuestion ).
tff(func_def_43,type,
vltop: vBinOpT ).
tff(func_def_44,type,
vam1: vAnsMap ).
tff(func_def_45,type,
vqvar: vQID > vExp ).
tff(func_def_46,type,
vnoMapConf: vOptMapConf ).
tff(func_def_47,type,
vatmbind: ( vQID * vAType * vATMap ) > vATMap ).
tff(func_def_48,type,
vgtop: vBinOpT ).
tff(func_def_49,type,
vsempty: vstring ).
tff(func_def_50,type,
vqmbind: ( vQID * vLabel * vAType * vQMap ) > vQMap ).
tff(func_def_51,type,
vask: vQID > vEntry ).
tff(func_def_52,type,
vsomeAType: vAType > vOptAType ).
tff(func_def_53,type,
vnoQuestion: vOptQuestion ).
tff(func_def_54,type,
vqgroup: ( vGID * vQuestionnaire ) > vQuestionnaire ).
tff(func_def_55,type,
vatmempty: vATMap ).
tff(func_def_56,type,
vno: vYN ).
tff(func_def_57,type,
vvalue: ( vQID * vAType * vExp ) > vEntry ).
tff(func_def_58,type,
vgetAnswer: ( vLabel * vAType ) > vAval ).
tff(func_def_59,type,
vecheck: ( vATMap * vExp ) > vOptAType ).
tff(func_def_60,type,
vgetAM: vQConf > vAnsMap ).
tff(func_def_61,type,
venumGID: vGID > vGID ).
tff(func_def_62,type,
vaskText: vLabel > vstring ).
tff(func_def_63,type,
vminus: ( vnat * vnat ) > vnat ).
tff(func_def_64,type,
vtypeOf: vAval > vAType ).
tff(func_def_65,type,
vevalBinOp: ( vBinOpT * vAval * vAval ) > vOptExp ).
tff(func_def_66,type,
vgetQM: vQConf > vQMap ).
tff(func_def_67,type,
vinitQID: vQID ).
tff(func_def_68,type,
vplus: ( vnat * vnat ) > vnat ).
tff(func_def_69,type,
vaskYesNo: vLabel > vYN ).
tff(func_def_70,type,
vtypeAM: vAnsMap > vATMap ).
tff(func_def_71,type,
vlookupQMap: ( vQID * vQMap ) > vOptQuestion ).
tff(func_def_72,type,
vaskNumber: vLabel > vnat ).
tff(func_def_73,type,
vinitLabel: vLabel ).
tff(func_def_74,type,
vdivide: ( vnat * vnat ) > vnat ).
tff(func_def_75,type,
vappendATMap: ( vATMap * vATMap ) > vATMap ).
tff(func_def_76,type,
vor: ( vYN * vYN ) > vYN ).
tff(func_def_77,type,
vpred: vnat > vnat ).
tff(func_def_78,type,
vlookupATMap: ( vQID * vATMap ) > vOptAType ).
tff(func_def_79,type,
vqcappend: ( vQConf * vQuestionnaire ) > vQConf ).
tff(func_def_80,type,
venumchar: vchar > vchar ).
tff(func_def_81,type,
vinitchar: vchar ).
tff(func_def_82,type,
vgetQuest: vQConf > vQuestionnaire ).
tff(func_def_83,type,
vevalUnOp: ( vUnOpT * vAval ) > vOptExp ).
tff(func_def_84,type,
vcheckBinOp: ( vBinOpT * vAType * vAType ) > vOptAType ).
tff(func_def_85,type,
vnot: vYN > vYN ).
tff(func_def_86,type,
vreduce: ( vQuestionnaire * vAnsMap * vQMap ) > vOptQConf ).
tff(func_def_87,type,
vmultiply: ( vnat * vnat ) > vnat ).
tff(func_def_88,type,
vappendAnsMap: ( vAnsMap * vAnsMap ) > vAnsMap ).
tff(func_def_89,type,
vcheckUnOp: ( vUnOpT * vAType ) > vOptAType ).
tff(func_def_90,type,
vtypeQM: vQMap > vATMap ).
tff(func_def_91,type,
vintersectATM: ( vATMap * vATMap ) > vATMap ).
tff(func_def_92,type,
venumLabel: vLabel > vLabel ).
tff(func_def_93,type,
vinitGID: vGID ).
tff(func_def_94,type,
vlt: ( vnat * vnat ) > vYN ).
tff(func_def_95,type,
vgt: ( vnat * vnat ) > vYN ).
tff(func_def_96,type,
vlookupAnsMap: ( vQID * vAnsMap ) > vOptAval ).
tff(func_def_97,type,
vreduceExp: ( vExp * vAnsMap ) > vOptExp ).
tff(func_def_98,type,
venumQID: vQID > vQID ).
tff(func_def_99,type,
vand: ( vYN * vYN ) > vYN ).
tff(func_def_100,type,
vappend: ( vATList * vATList ) > vATList ).
tff(func_def_101,type,
vgetQuestionQID: vOptQuestion > vQID ).
tff(func_def_102,type,
vgetMapConf: vOptMapConf > vMapConf ).
tff(func_def_103,type,
vgetQuestionLabel: vOptQuestion > vLabel ).
tff(func_def_104,type,
vgetAType: vOptAType > vAType ).
tff(func_def_105,type,
vgetQuestionAType: vOptQuestion > vAType ).
tff(func_def_106,type,
vgetQC: vOptQConf > vQConf ).
tff(func_def_107,type,
vgetExpValue: vExp > vAval ).
tff(func_def_108,type,
vgetAval: vOptAval > vAval ).
tff(func_def_109,type,
vgetExp: vOptExp > vExp ).
tff(func_def_110,type,
sK0: vQID ).
tff(func_def_111,type,
sK1: vAval ).
tff(func_def_112,type,
sK2: vAType ).
tff(func_def_113,type,
sK3: vAval ).
tff(func_def_114,type,
sK4: vQID ).
tff(func_def_115,type,
sK5: vAnsMap > vQID ).
tff(func_def_116,type,
sK6: vAnsMap > vAval ).
tff(func_def_117,type,
sK7: vAnsMap > vAnsMap ).
tff(pred_def_1,type,
vexpIsValue: vExp > $o ).
tff(pred_def_2,type,
visValue: vQuestionnaire > $o ).
tff(pred_def_3,type,
visSomeAType: vOptAType > $o ).
tff(pred_def_4,type,
visSomeQC: vOptQConf > $o ).
tff(pred_def_5,type,
visSomeAval: vOptAval > $o ).
tff(pred_def_6,type,
visSomeExp: vOptExp > $o ).
tff(pred_def_7,type,
visSomeMapConf: vOptMapConf > $o ).
tff(pred_def_8,type,
visSomeQuestion: vOptQuestion > $o ).
tff(pred_def_9,type,
vptcheck: ( vMapConf * vQuestionnaire * vMapConf ) > $o ).
tff(pred_def_10,type,
sP8: vAType > $o ).
tff(f135,axiom,
! [X0: vAval,X1: vAval] :
( ( vsomeAval(X0) = vsomeAval(X1) )
=> ( X0 = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','EQ-someAval') ).
tff(f194,axiom,
! [X0: vQID,X1: vAval,X2: vAnsMap] : ( vlookupAnsMap(X0,vabind(X0,X1,X2)) = vsomeAval(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','lookupAnsMap-1') ).
tff(f361,axiom,
! [X0: vQID,X1: vAval,X2: vAType,X3: vAval] :
( ( ( vlookupATMap(X0,vtypeAM(vabind(X0,X1,vam1))) = vsomeAType(X2) )
& ( vlookupAnsMap(X0,vabind(X0,X1,vam1)) = vsomeAval(X3) ) )
=> ( vtypeOf(X3) = X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','lookupAnsMapPreservation-abind-qid-qid1-True') ).
tff(f362,axiom,
! [X0: vQID,X1: vAval,X2: vAType,X3: vAval,X4: vQID] :
( ( ( X4 != X0 )
& ( vlookupATMap(X4,vtypeAM(vabind(X0,X1,vam1))) = vsomeAType(X2) )
& ( vlookupAnsMap(X4,vabind(X0,X1,vam1)) = vsomeAval(X3) ) )
=> ( vtypeOf(X3) = X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','lookupAnsMapPreservation-abind-qid-qid1-False') ).
tff(f363,conjecture,
! [X0: vQID,X1: vAval,X2: vAType,X3: vAval,X4: vQID] :
( ( ( vlookupATMap(X4,vtypeAM(vabind(X0,X1,vam1))) = vsomeAType(X2) )
& ( vlookupAnsMap(X4,vabind(X0,X1,vam1)) = vsomeAval(X3) ) )
=> ( vtypeOf(X3) = X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','lookupAnsMapPreservation-abind') ).
tff(f364,negated_conjecture,
~ ! [X0: vQID,X1: vAval,X2: vAType,X3: vAval,X4: vQID] :
( ( ( vlookupATMap(X4,vtypeAM(vabind(X0,X1,vam1))) = vsomeAType(X2) )
& ( vlookupAnsMap(X4,vabind(X0,X1,vam1)) = vsomeAval(X3) ) )
=> ( vtypeOf(X3) = X2 ) ),
inference(negated_conjecture,[status(cth)],[f363]) ).
tff(f365,plain,
? [X0: vQID,X1: vAval,X2: vAType,X3: vAval,X4: vQID] :
( ( vtypeOf(X3) != X2 )
& ( vlookupATMap(X4,vtypeAM(vabind(X0,X1,vam1))) = vsomeAType(X2) )
& ( vlookupAnsMap(X4,vabind(X0,X1,vam1)) = vsomeAval(X3) ) ),
inference(ennf_transformation,[],[f364]) ).
tff(f366,plain,
? [X0: vQID,X1: vAval,X2: vAType,X3: vAval,X4: vQID] :
( ( vtypeOf(X3) != X2 )
& ( vlookupATMap(X4,vtypeAM(vabind(X0,X1,vam1))) = vsomeAType(X2) )
& ( vlookupAnsMap(X4,vabind(X0,X1,vam1)) = vsomeAval(X3) ) ),
inference(flattening,[],[f365]) ).
tff(f368,plain,
! [X0: vAval,X1: vAval] :
( ( X0 = X1 )
| ( vsomeAval(X1) != vsomeAval(X0) ) ),
inference(ennf_transformation,[],[f135]) ).
tff(f369,plain,
! [X0: vQID,X1: vAval,X2: vAType,X3: vAval,X4: vQID] :
( ( vtypeOf(X3) = X2 )
| ( X0 = X4 )
| ( vsomeAType(X2) != vlookupATMap(X4,vtypeAM(vabind(X0,X1,vam1))) )
| ( vsomeAval(X3) != vlookupAnsMap(X4,vabind(X0,X1,vam1)) ) ),
inference(ennf_transformation,[],[f362]) ).
tff(f370,plain,
! [X0: vQID,X1: vAval,X2: vAType,X3: vAval,X4: vQID] :
( ( vtypeOf(X3) = X2 )
| ( X0 = X4 )
| ( vsomeAType(X2) != vlookupATMap(X4,vtypeAM(vabind(X0,X1,vam1))) )
| ( vsomeAval(X3) != vlookupAnsMap(X4,vabind(X0,X1,vam1)) ) ),
inference(flattening,[],[f369]) ).
tff(f371,plain,
! [X0: vQID,X1: vAval,X2: vAType,X3: vAval] :
( ( vtypeOf(X3) = X2 )
| ( vsomeAType(X2) != vlookupATMap(X0,vtypeAM(vabind(X0,X1,vam1))) )
| ( vlookupAnsMap(X0,vabind(X0,X1,vam1)) != vsomeAval(X3) ) ),
inference(ennf_transformation,[],[f361]) ).
tff(f372,plain,
! [X0: vQID,X1: vAval,X2: vAType,X3: vAval] :
( ( vtypeOf(X3) = X2 )
| ( vsomeAType(X2) != vlookupATMap(X0,vtypeAM(vabind(X0,X1,vam1))) )
| ( vlookupAnsMap(X0,vabind(X0,X1,vam1)) != vsomeAval(X3) ) ),
inference(flattening,[],[f371]) ).
tff(f378,plain,
( ( sK2 != vtypeOf(sK3) )
& ( vsomeAType(sK2) = vlookupATMap(sK4,vtypeAM(vabind(sK0,sK1,vam1))) )
& ( vsomeAval(sK3) = vlookupAnsMap(sK4,vabind(sK0,sK1,vam1)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4)],[f366]) ).
tff(f380,plain,
vsomeAval(sK3) = vlookupAnsMap(sK4,vabind(sK0,sK1,vam1)),
inference(cnf_transformation,[],[f378]) ).
tff(f381,plain,
vsomeAType(sK2) = vlookupATMap(sK4,vtypeAM(vabind(sK0,sK1,vam1))),
inference(cnf_transformation,[],[f378]) ).
tff(f382,plain,
sK2 != vtypeOf(sK3),
inference(cnf_transformation,[],[f378]) ).
tff(f386,plain,
! [X0: vAval,X1: vAval] :
( ( vsomeAval(X1) != vsomeAval(X0) )
| ( X0 = X1 ) ),
inference(cnf_transformation,[],[f368]) ).
tff(f387,plain,
! [X2: vAType,X3: vAval,X0: vQID,X1: vAval,X4: vQID] :
( ( vsomeAType(X2) != vlookupATMap(X4,vtypeAM(vabind(X0,X1,vam1))) )
| ( X0 = X4 )
| ( vtypeOf(X3) = X2 )
| ( vsomeAval(X3) != vlookupAnsMap(X4,vabind(X0,X1,vam1)) ) ),
inference(cnf_transformation,[],[f370]) ).
tff(f388,plain,
! [X2: vAType,X3: vAval,X0: vQID,X1: vAval] :
( ( vsomeAType(X2) != vlookupATMap(X0,vtypeAM(vabind(X0,X1,vam1))) )
| ( vtypeOf(X3) = X2 )
| ( vlookupAnsMap(X0,vabind(X0,X1,vam1)) != vsomeAval(X3) ) ),
inference(cnf_transformation,[],[f372]) ).
tff(f402,plain,
! [X2: vAnsMap,X0: vQID,X1: vAval] : ( vsomeAval(X1) = vlookupAnsMap(X0,vabind(X0,X1,X2)) ),
inference(cnf_transformation,[],[f194]) ).
tff(f403,definition,
~ sP8(sK2),
introduced(definition,[new_symbols(definition,[sP8])],[inequality_splitting_name_introduction]) ).
tff(f404,plain,
sP8(vtypeOf(sK3)),
inference(inequality_splitting,[],[f382,f403]) ).
tff(f408,definition,
( spl9_1
<=> ( sK0 = sK4 ) ),
introduced(definition,[new_symbols(definition,[spl9_1])],[avatar_definition]) ).
tff(f410,plain,
( ( sK0 = sK4 )
| ~ spl9_1 ),
inference(avatar_component_clause,[],[f408]) ).
tff(f417,plain,
! [X0: vAType,X1: vAval] :
( ( vsomeAType(X0) != vsomeAType(sK2) )
| ( sK0 = sK4 )
| ( vtypeOf(X1) = X0 )
| ( vsomeAval(X1) != vlookupAnsMap(sK4,vabind(sK0,sK1,vam1)) ) ),
inference(superposition,[],[f387,f381]) ).
tff(f418,plain,
! [X0: vAType,X1: vAval] :
( ( vsomeAval(X1) != vsomeAval(sK3) )
| ( vsomeAType(X0) != vsomeAType(sK2) )
| ( sK0 = sK4 )
| ( vtypeOf(X1) = X0 ) ),
inference(forward_demodulation,[],[f417,f380]) ).
tff(f420,definition,
( spl9_3
<=> ! [X0: vAType,X1: vAval] :
( ( vsomeAval(X1) != vsomeAval(sK3) )
| ( vtypeOf(X1) = X0 )
| ( vsomeAType(X0) != vsomeAType(sK2) ) ) ),
introduced(definition,[new_symbols(definition,[spl9_3])],[avatar_definition]) ).
tff(f421,plain,
( ! [X0: vAType,X1: vAval] :
( ( vsomeAType(X0) != vsomeAType(sK2) )
| ( vtypeOf(X1) = X0 )
| ( vsomeAval(X1) != vsomeAval(sK3) ) )
| ~ spl9_3 ),
inference(avatar_component_clause,[],[f420]) ).
tff(f422,plain,
( spl9_1
| spl9_3 ),
inference(avatar_split_clause,[],[f418,f420,f408]) ).
tff(f423,plain,
( ( vsomeAType(sK2) = vlookupATMap(sK0,vtypeAM(vabind(sK0,sK1,vam1))) )
| ~ spl9_1 ),
inference(superposition,[],[f381,f410]) ).
tff(f424,plain,
( ( vsomeAval(sK3) = vlookupAnsMap(sK0,vabind(sK0,sK1,vam1)) )
| ~ spl9_1 ),
inference(superposition,[],[f380,f410]) ).
tff(f425,plain,
( ( vsomeAval(sK3) = vsomeAval(sK1) )
| ~ spl9_1 ),
inference(forward_demodulation,[],[f424,f402]) ).
tff(f428,plain,
( ! [X0: vAval] :
( ( vsomeAval(X0) != vsomeAval(sK1) )
| ( sK3 = X0 ) )
| ~ spl9_1 ),
inference(superposition,[],[f386,f425]) ).
tff(f438,plain,
( ! [X2: vAval,X0: vQID,X1: vAval] :
( ( vlookupATMap(X0,vtypeAM(vabind(X0,X1,vam1))) != vlookupATMap(sK0,vtypeAM(vabind(sK0,sK1,vam1))) )
| ( vtypeOf(X2) = sK2 )
| ( vsomeAval(X2) != vlookupAnsMap(X0,vabind(X0,X1,vam1)) ) )
| ~ spl9_1 ),
inference(superposition,[],[f388,f423]) ).
tff(f440,plain,
( ! [X2: vAval,X0: vQID,X1: vAval] :
( ( vlookupATMap(X0,vtypeAM(vabind(X0,X1,vam1))) != vlookupATMap(sK0,vtypeAM(vabind(sK0,sK1,vam1))) )
| ( vsomeAval(X1) != vsomeAval(X2) )
| ( vtypeOf(X2) = sK2 ) )
| ~ spl9_1 ),
inference(forward_demodulation,[],[f438,f402]) ).
tff(f443,plain,
( ( sK1 = sK3 )
| ~ spl9_1 ),
inference(equality_resolution,[],[f428]) ).
tff(f448,plain,
( sP8(vtypeOf(sK1))
| ~ spl9_1 ),
inference(superposition,[],[f404,f443]) ).
tff(f453,plain,
( ! [X0: vAval] :
( ( vsomeAval(X0) != vsomeAval(sK1) )
| ( vtypeOf(X0) = sK2 ) )
| ~ spl9_1 ),
inference(equality_resolution,[],[f440]) ).
tff(f475,plain,
( ( sK2 = vtypeOf(sK1) )
| ~ spl9_1 ),
inference(equality_resolution,[],[f453]) ).
tff(f499,plain,
( ~ sP8(vtypeOf(sK1))
| ~ spl9_1 ),
inference(superposition,[],[f403,f475]) ).
tff(f500,plain,
( $false
| ~ spl9_1 ),
inference(forward_subsumption_resolution,[],[f499,f448]) ).
tff(f501,plain,
~ spl9_1,
inference(avatar_contradiction_clause,[],[f500]) ).
tff(f502,plain,
( ! [X0: vAval] :
( ( vsomeAval(X0) != vsomeAval(sK3) )
| ( vtypeOf(X0) = sK2 ) )
| ~ spl9_3 ),
inference(equality_resolution,[],[f421]) ).
tff(f503,plain,
( ( sK2 = vtypeOf(sK3) )
| ~ spl9_3 ),
inference(equality_resolution,[],[f502]) ).
tff(f504,plain,
( sP8(sK2)
| ~ spl9_3 ),
inference(superposition,[],[f404,f503]) ).
tff(f506,plain,
( $false
| ~ spl9_3 ),
inference(forward_subsumption_resolution,[],[f504,f403]) ).
tff(f507,plain,
~ spl9_3,
inference(avatar_contradiction_clause,[],[f506]) ).
cnf(s3,plain,
( spl9_1
| spl9_3 ),
inference(sat_conversion,[],[f422]) ).
cnf(s7,plain,
~ spl9_1,
inference(sat_conversion,[],[f501]) ).
cnf(s8,plain,
~ spl9_3,
inference(sat_conversion,[],[f507]) ).
cnf(s9,plain,
$false,
inference(rat,[],[s3,s8,s7]) ).
tff(f508,plain,
$false,
inference(avatar_sat_refutation,[],[s9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM253_1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.20 % Computer : n011.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 : Mon Sep 28 22:03:01 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.24 Running first-order theorem proving
% 0.09/0.24 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.74/1.14 % (3831244)Detected formulas, will run a generic FOF schedule.
% 2.74/1.14 % (3831249)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=3806013661:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.74/1.14 % (3831255)dis-21_1_sil=8000:lcm=predicate:random_seed=2396672896: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)
% 2.74/1.14 % (3831254)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1708002392:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.74/1.14 % (3831252)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1233044768:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.74/1.14 % (3831250)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=37800509:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.74/1.14 % (3831251)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=2908292383:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.74/1.14 % (3831253)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2690083798:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.74/1.14 % (3831252)First to succeed.
% 2.74/1.14 % (3831252)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3831244"
% 2.74/1.14 % (3831253)Also succeeded, but the first one will report.
% 2.74/1.14 % (3831254)Also succeeded, but the first one will report.
% 2.74/1.14 % (3831255)Instruction limit reached!
% 2.74/1.14 % (3831255)------------------------------
% 2.74/1.14 % (3831255)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.74/1.14 % (3831255)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.74/1.14 % (3831255)CaDiCaL version: 2.1.3
% 2.74/1.14 % (3831255)Termination reason: Instruction limit
% 2.74/1.14 % (3831255)Termination phase: Saturation
% 2.74/1.14 % (3831255)Time elapsed: 0.073 s
% 2.74/1.14 % (3831255)Peak memory usage: 90 MB
% 2.74/1.14 % (3831255)Instructions burned: 129 (million)
% 2.74/1.14 % (3831263)lrs+10_1_sil=8000:sp=occurrence:random_seed=1499379431:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.74/1.14 % (3831263)Also succeeded, but the first one will report.
% 2.74/1.14 % (3831252)Refutation found. Thanks to Tanya!
% 2.74/1.14 % SZS status Theorem for theBenchmark
% 2.74/1.14 % SZS output start Proof for theBenchmark
% See solution above
% 3.83/1.33 % (3831252)------------------------------
% 3.83/1.33 % (3831252)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.83/1.33 % (3831252)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.83/1.33 % (3831252)CaDiCaL version: 2.1.3
% 3.83/1.33 % (3831252)Termination reason: Refutation
% 3.83/1.33 % (3831252)Time elapsed: 0.009 s
% 3.83/1.33 % (3831252)Peak memory usage: 90 MB
% 3.83/1.33 % (3831252)Instructions burned: 10 (million)
% 3.83/1.33 % (3831252)------------------------------
% 3.83/1.33 % (3831252)------------------------------
% 3.83/1.33 % (3831244)Success in time 0.465 s
% 3.83/1.33 % Vampire exiting
%------------------------------------------------------------------------------