%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : COM256_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 : 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:39:54 AM UTC 2026
% Result : Theorem 2.89s 1.12s
% Output : Refutation 3.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 13 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 23 ( 12 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 18 ( 8 ~; 0 |; 8 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 27 ( 26 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 16 ( 14 usr; 1 prp; 0-3 aty)
% Number of functors : 195 ( 195 usr; 39 con; 0-4 aty)
% Number of variables : 34 ( 20 !; 14 ?; 34 :)
% 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,
vqvar: vQID > vExp ).
tff(func_def_45,type,
vnoMapConf: vOptMapConf ).
tff(func_def_46,type,
vatmbind: ( vQID * vAType * vATMap ) > vATMap ).
tff(func_def_47,type,
vgtop: vBinOpT ).
tff(func_def_48,type,
vsempty: vstring ).
tff(func_def_49,type,
vqmbind: ( vQID * vLabel * vAType * vQMap ) > vQMap ).
tff(func_def_50,type,
vask: vQID > vEntry ).
tff(func_def_51,type,
vsomeAType: vAType > vOptAType ).
tff(func_def_52,type,
vnoQuestion: vOptQuestion ).
tff(func_def_53,type,
vqgroup: ( vGID * vQuestionnaire ) > vQuestionnaire ).
tff(func_def_54,type,
vatmempty: vATMap ).
tff(func_def_55,type,
vno: vYN ).
tff(func_def_56,type,
vvalue: ( vQID * vAType * vExp ) > vEntry ).
tff(func_def_57,type,
vgetAnswer: ( vLabel * vAType ) > vAval ).
tff(func_def_58,type,
vecheck: ( vATMap * vExp ) > vOptAType ).
tff(func_def_59,type,
vgetAM: vQConf > vAnsMap ).
tff(func_def_60,type,
venumGID: vGID > vGID ).
tff(func_def_61,type,
vaskText: vLabel > vstring ).
tff(func_def_62,type,
vminus: ( vnat * vnat ) > vnat ).
tff(func_def_63,type,
vtypeOf: vAval > vAType ).
tff(func_def_64,type,
vevalBinOp: ( vBinOpT * vAval * vAval ) > vOptExp ).
tff(func_def_65,type,
vgetQM: vQConf > vQMap ).
tff(func_def_66,type,
vinitQID: vQID ).
tff(func_def_67,type,
vplus: ( vnat * vnat ) > vnat ).
tff(func_def_68,type,
vaskYesNo: vLabel > vYN ).
tff(func_def_69,type,
vtypeAM: vAnsMap > vATMap ).
tff(func_def_70,type,
vlookupQMap: ( vQID * vQMap ) > vOptQuestion ).
tff(func_def_71,type,
vaskNumber: vLabel > vnat ).
tff(func_def_72,type,
vinitLabel: vLabel ).
tff(func_def_73,type,
vdivide: ( vnat * vnat ) > vnat ).
tff(func_def_74,type,
vappendATMap: ( vATMap * vATMap ) > vATMap ).
tff(func_def_75,type,
vor: ( vYN * vYN ) > vYN ).
tff(func_def_76,type,
vpred: vnat > vnat ).
tff(func_def_77,type,
vlookupATMap: ( vQID * vATMap ) > vOptAType ).
tff(func_def_78,type,
vqcappend: ( vQConf * vQuestionnaire ) > vQConf ).
tff(func_def_79,type,
venumchar: vchar > vchar ).
tff(func_def_80,type,
vinitchar: vchar ).
tff(func_def_81,type,
vgetQuest: vQConf > vQuestionnaire ).
tff(func_def_82,type,
vevalUnOp: ( vUnOpT * vAval ) > vOptExp ).
tff(func_def_83,type,
vcheckBinOp: ( vBinOpT * vAType * vAType ) > vOptAType ).
tff(func_def_84,type,
vnot: vYN > vYN ).
tff(func_def_85,type,
vreduce: ( vQuestionnaire * vAnsMap * vQMap ) > vOptQConf ).
tff(func_def_86,type,
vmultiply: ( vnat * vnat ) > vnat ).
tff(func_def_87,type,
vappendAnsMap: ( vAnsMap * vAnsMap ) > vAnsMap ).
tff(func_def_88,type,
vcheckUnOp: ( vUnOpT * vAType ) > vOptAType ).
tff(func_def_89,type,
vtypeQM: vQMap > vATMap ).
tff(func_def_90,type,
vintersectATM: ( vATMap * vATMap ) > vATMap ).
tff(func_def_91,type,
venumLabel: vLabel > vLabel ).
tff(func_def_92,type,
vinitGID: vGID ).
tff(func_def_93,type,
vlt: ( vnat * vnat ) > vYN ).
tff(func_def_94,type,
vgt: ( vnat * vnat ) > vYN ).
tff(func_def_95,type,
vlookupAnsMap: ( vQID * vAnsMap ) > vOptAval ).
tff(func_def_96,type,
vreduceExp: ( vExp * vAnsMap ) > vOptExp ).
tff(func_def_97,type,
venumQID: vQID > vQID ).
tff(func_def_98,type,
vand: ( vYN * vYN ) > vYN ).
tff(func_def_99,type,
vappend: ( vATList * vATList ) > vATList ).
tff(func_def_100,type,
vgetQuestionQID: vOptQuestion > vQID ).
tff(func_def_101,type,
vgetMapConf: vOptMapConf > vMapConf ).
tff(func_def_102,type,
vgetQuestionLabel: vOptQuestion > vLabel ).
tff(func_def_103,type,
vgetAType: vOptAType > vAType ).
tff(func_def_104,type,
vgetQuestionAType: vOptQuestion > vAType ).
tff(func_def_105,type,
vgetQC: vOptQConf > vQConf ).
tff(func_def_106,type,
vgetExpValue: vExp > vAval ).
tff(func_def_107,type,
vgetAval: vOptAval > vAval ).
tff(func_def_108,type,
vgetExp: vOptExp > vExp ).
tff(func_def_109,type,
sK5: vATMap ).
tff(func_def_110,type,
sK6: vQuestionnaire ).
tff(func_def_111,type,
sK7: vQMap ).
tff(func_def_112,type,
sK8: vAnsMap ).
tff(func_def_113,type,
sK9: vATMap ).
tff(func_def_114,type,
sK10: vAnsMap ).
tff(func_def_115,type,
sK11: vQMap ).
tff(func_def_116,type,
sK12: vQConf > vAnsMap ).
tff(func_def_117,type,
sK13: vQConf > vQMap ).
tff(func_def_118,type,
sK14: vQConf > vQuestionnaire ).
tff(func_def_119,type,
sK15: vMapConf > vATMap ).
tff(func_def_120,type,
sK16: vMapConf > vATMap ).
tff(func_def_121,type,
sK17: vAnsMap > vQID ).
tff(func_def_122,type,
sK18: vAnsMap > vAval ).
tff(func_def_123,type,
sK19: vAnsMap > vAnsMap ).
tff(func_def_124,type,
sK20: vQMap > vQID ).
tff(func_def_125,type,
sK21: vQMap > vLabel ).
tff(func_def_126,type,
sK22: vQMap > vAType ).
tff(func_def_127,type,
sK23: vQMap > vQMap ).
tff(func_def_128,type,
sK24: vAnsMap > vQID ).
tff(func_def_129,type,
sK25: vAnsMap > vAval ).
tff(func_def_130,type,
sK26: vAnsMap > vAnsMap ).
tff(func_def_131,type,
sK27: ( vQID * vATMap ) > vQID ).
tff(func_def_132,type,
sK28: ( vQID * vATMap ) > vAType ).
tff(func_def_133,type,
sK29: ( vQID * vATMap ) > vATMap ).
tff(func_def_134,type,
sK30: ( vQID * vATMap ) > vQID ).
tff(func_def_135,type,
sK31: ( vQID * vATMap ) > vQID ).
tff(func_def_136,type,
sK32: ( vQID * vATMap ) > vAType ).
tff(func_def_137,type,
sK33: ( vQID * vATMap ) > vATMap ).
tff(func_def_138,type,
sK34: ( vQID * vATMap ) > vQID ).
tff(func_def_139,type,
sK35: ( vQID * vATMap ) > vQID ).
tff(func_def_140,type,
sK36: vATMap > vQID ).
tff(func_def_141,type,
sK37: vATMap > vAType ).
tff(func_def_142,type,
sK38: vATMap > vATMap ).
tff(func_def_143,type,
sK39: vAval > vYN ).
tff(func_def_144,type,
sK40: vAval > vnat ).
tff(func_def_145,type,
sK41: vAval > vstring ).
tff(func_def_146,type,
sK42: ( vATMap * vATMap * vQuestionnaire ) > vATMap ).
tff(func_def_147,type,
sK43: ( vATMap * vATMap * vQuestionnaire ) > vATMap ).
tff(func_def_148,type,
sK44: ( vATMap * vQuestionnaire * vATMap ) > vATMap ).
tff(func_def_149,type,
sK45: ( vATMap * vQuestionnaire * vATMap ) > vATMap ).
tff(func_def_150,type,
sK46: ( vQID * vQMap ) > vQMap ).
tff(func_def_151,type,
sK47: ( vQID * vQMap ) > vQID ).
tff(func_def_152,type,
sK48: ( vQID * vQMap ) > vAType ).
tff(func_def_153,type,
sK49: ( vQID * vQMap ) > vLabel ).
tff(func_def_154,type,
sK50: ( vQID * vQMap ) > vQID ).
tff(func_def_155,type,
sK51: ( vQID * vQMap ) > vQMap ).
tff(func_def_156,type,
sK52: ( vQID * vQMap ) > vQID ).
tff(func_def_157,type,
sK53: ( vQID * vQMap ) > vAType ).
tff(func_def_158,type,
sK54: ( vQID * vQMap ) > vLabel ).
tff(func_def_159,type,
sK55: ( vQID * vQMap ) > vQID ).
tff(func_def_160,type,
sK56: ( vQID * vQMap ) > vQID ).
tff(func_def_161,type,
sK57: vQMap > vQID ).
tff(func_def_162,type,
sK58: vQMap > vLabel ).
tff(func_def_163,type,
sK59: vQMap > vAType ).
tff(func_def_164,type,
sK60: vQMap > vQMap ).
tff(func_def_165,type,
sK61: vOptAType > vAType ).
tff(func_def_166,type,
sK62: vAval > vYN ).
tff(func_def_167,type,
sK63: vAval > vnat ).
tff(func_def_168,type,
sK64: vAval > vstring ).
tff(func_def_169,type,
sK65: vOptQuestion > vQID ).
tff(func_def_170,type,
sK66: vOptQuestion > vLabel ).
tff(func_def_171,type,
sK67: vOptQuestion > vAType ).
tff(func_def_172,type,
sK68: vEntry > vQID ).
tff(func_def_173,type,
sK69: vEntry > vLabel ).
tff(func_def_174,type,
sK70: vEntry > vAType ).
tff(func_def_175,type,
sK71: vEntry > vQID ).
tff(func_def_176,type,
sK72: vEntry > vAType ).
tff(func_def_177,type,
sK73: vEntry > vExp ).
tff(func_def_178,type,
sK74: vEntry > vQID ).
tff(func_def_179,type,
sK75: vEntry > vLabel ).
tff(func_def_180,type,
sK76: vEntry > vAType ).
tff(func_def_181,type,
sK77: vEntry > vQID ).
tff(func_def_182,type,
sK78: vOptQuestion > vQID ).
tff(func_def_183,type,
sK79: vOptQuestion > vLabel ).
tff(func_def_184,type,
sK80: vOptQuestion > vAType ).
tff(func_def_185,type,
sK81: ( vExp * vQuestionnaire * vQuestionnaire ) > vQuestionnaire ).
tff(func_def_186,type,
sK82: ( vExp * vQuestionnaire * vQuestionnaire ) > vQuestionnaire ).
tff(func_def_187,type,
sK83: ( vQuestionnaire * vExp * vQuestionnaire ) > vQuestionnaire ).
tff(func_def_188,type,
sK84: ( vQuestionnaire * vExp * vQuestionnaire ) > vQuestionnaire ).
tff(func_def_189,type,
sK85: vOptQConf > vQConf ).
tff(func_def_190,type,
sK86: ( vATMap * vQID ) > vAType ).
tff(func_def_191,type,
sK87: vOptExp > vExp ).
tff(func_def_192,type,
sK88: vExp > vExp ).
tff(func_def_193,type,
sK89: vExp > vAval ).
tff(func_def_194,type,
sK90: vExp > vAval ).
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,
sP0: ( vQID * vATMap ) > $o ).
tff(pred_def_11,type,
sP1: ( vQID * vATMap ) > $o ).
tff(pred_def_12,type,
sP2: ( vQID * vQMap ) > $o ).
tff(pred_def_13,type,
sP3: ( vQID * vQMap ) > $o ).
tff(pred_def_14,type,
sP4: ( vExp * vQuestionnaire * vQuestionnaire ) > $o ).
tff(f58,axiom,
! [X0: vQConf] : ( vnoQConf != vsomeQConf(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','DIFF-noQConf-someQConf') ).
tff(f263,axiom,
! [X0: vAnsMap,X1: vQMap] : ( vreduce(vqempty,X0,X1) = vnoQConf ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','reduce-0') ).
tff(f360,conjecture,
! [X0: vATMap,X1: vQuestionnaire,X2: vQMap,X3: vAnsMap,X4: vATMap,X5: vAnsMap,X6: vQMap] :
( ( vptcheck(vMC(vtypeAM(X5),vtypeQM(X2)),vqempty,vMC(X4,X0))
& ( vreduce(vqempty,X5,X2) = vsomeQConf(vQC(X3,X6,X1)) ) )
=> vptcheck(vMC(vtypeAM(X3),vtypeQM(X6)),X1,vMC(X4,X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','Preservation-qempty') ).
tff(f361,negated_conjecture,
~ ! [X0: vATMap,X1: vQuestionnaire,X2: vQMap,X3: vAnsMap,X4: vATMap,X5: vAnsMap,X6: vQMap] :
( ( vptcheck(vMC(vtypeAM(X5),vtypeQM(X2)),vqempty,vMC(X4,X0))
& ( vreduce(vqempty,X5,X2) = vsomeQConf(vQC(X3,X6,X1)) ) )
=> vptcheck(vMC(vtypeAM(X3),vtypeQM(X6)),X1,vMC(X4,X0)) ),
inference(negated_conjecture,[status(cth)],[f360]) ).
tff(f363,plain,
? [X0: vATMap,X1: vQuestionnaire,X2: vQMap,X3: vAnsMap,X4: vATMap,X5: vAnsMap,X6: vQMap] :
( ~ vptcheck(vMC(vtypeAM(X3),vtypeQM(X6)),X1,vMC(X4,X0))
& vptcheck(vMC(vtypeAM(X5),vtypeQM(X2)),vqempty,vMC(X4,X0))
& ( vreduce(vqempty,X5,X2) = vsomeQConf(vQC(X3,X6,X1)) ) ),
inference(ennf_transformation,[],[f361]) ).
tff(f364,plain,
? [X0: vATMap,X1: vQuestionnaire,X2: vQMap,X3: vAnsMap,X4: vATMap,X5: vAnsMap,X6: vQMap] :
( ~ vptcheck(vMC(vtypeAM(X3),vtypeQM(X6)),X1,vMC(X4,X0))
& vptcheck(vMC(vtypeAM(X5),vtypeQM(X2)),vqempty,vMC(X4,X0))
& ( vreduce(vqempty,X5,X2) = vsomeQConf(vQC(X3,X6,X1)) ) ),
inference(flattening,[],[f363]) ).
tff(f441,plain,
( ~ vptcheck(vMC(vtypeAM(sK8),vtypeQM(sK11)),sK6,vMC(sK9,sK5))
& vptcheck(vMC(vtypeAM(sK10),vtypeQM(sK7)),vqempty,vMC(sK9,sK5))
& ( vreduce(vqempty,sK10,sK7) = vsomeQConf(vQC(sK8,sK11,sK6)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5,sK6,sK7,sK8,sK9,sK10,sK11]),skolemize(X0,sK5),skolemize(X1,sK6),skolemize(X2,sK7),skolemize(X3,sK8),skolemize(X4,sK9),skolemize(X5,sK10),skolemize(X6,sK11)],[f364]) ).
tff(f481,plain,
vreduce(vqempty,sK10,sK7) = vsomeQConf(vQC(sK8,sK11,sK6)),
inference(cnf_transformation,[],[f441]) ).
tff(f630,plain,
! [X0: vAnsMap,X1: vQMap] : ( vnoQConf = vreduce(vqempty,X0,X1) ),
inference(cnf_transformation,[],[f263]) ).
tff(f631,plain,
! [X0: vQConf] : ( vnoQConf != vsomeQConf(X0) ),
inference(cnf_transformation,[],[f58]) ).
tff(f663,plain,
vnoQConf != vreduce(vqempty,sK10,sK7),
inference(superposition,[],[f631,f481]) ).
tff(f669,plain,
vnoQConf != vnoQConf,
inference(superposition,[],[f663,f630]) ).
tff(f670,plain,
$false,
inference(trivial_inequality_removal,[],[f669]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : COM256_1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.18 % Computer : n004.cluster.edu
% 0.09/0.18 % Model : x86_64 x86_64
% 0.09/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18 % Memory : 8046.5625MB
% 0.09/0.18 % OS : Linux 6.8.0-71-generic
% 0.09/0.18 % CPULimit : 300
% 0.09/0.18 % WCLimit : 300
% 0.09/0.18 % DateTime : Mon Sep 28 22:03:07 UTC 2026
% 0.09/0.18 % CPUTime :
% 0.09/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.22 Running first-order theorem proving
% 0.09/0.22 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.89/1.12 % (836350)Detected formulas, will run a generic FOF schedule.
% 2.89/1.12 % (836471)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3026529955:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.89/1.12 % (836471)Refutation not found, incomplete strategy
% 2.89/1.12 % (836471)------------------------------
% 2.89/1.12 % (836471)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.89/1.12 % (836471)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.89/1.12 % (836471)CaDiCaL version: 2.1.3
% 2.89/1.12 % (836471)Termination reason: Refutation not found, incomplete strategy
% 2.89/1.12 % (836471)Time elapsed: 0.002 s
% 2.89/1.12 % (836471)Peak memory usage: 89 MB
% 2.89/1.12 % (836471)Instructions burned: 4 (million)
% 2.89/1.12 % (836470)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=422289536:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.89/1.12 % (836469)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=3235947284:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.89/1.12 % (836468)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=3891013815:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.89/1.12 % (836473)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=850855071:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.89/1.12 % (836474)dis-21_1_sil=8000:lcm=predicate:random_seed=3797880226: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.89/1.12 % (836472)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=120083569:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.89/1.12 % (836472)First to succeed.
% 2.89/1.12 % (836472)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-836350"
% 2.89/1.12 % (836473)Also succeeded, but the first one will report.
% 2.89/1.12 % (836474)Instruction limit reached!
% 2.89/1.12 % (836474)------------------------------
% 2.89/1.12 % (836474)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.89/1.12 % (836474)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.89/1.12 % (836474)CaDiCaL version: 2.1.3
% 2.89/1.12 % (836474)Termination reason: Instruction limit
% 2.89/1.12 % (836474)Termination phase: Saturation
% 2.89/1.12 % (836474)Time elapsed: 0.073 s
% 2.89/1.12 % (836474)Peak memory usage: 90 MB
% 2.89/1.12 % (836474)Instructions burned: 129 (million)
% 2.89/1.12 % (836471)------------------------------
% 2.89/1.12 % (836471)------------------------------
% 2.89/1.12 % (836482)lrs+10_1_sil=8000:sp=occurrence:random_seed=3765287710:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.89/1.12 % (836472)Refutation found. Thanks to Tanya!
% 2.89/1.12 % SZS status Theorem for theBenchmark
% 2.89/1.12 % SZS output start Proof for theBenchmark
% See solution above
% 3.76/1.32 % (836472)------------------------------
% 3.76/1.32 % (836472)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.76/1.32 % (836472)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.76/1.32 % (836472)CaDiCaL version: 2.1.3
% 3.76/1.32 % (836472)Termination reason: Refutation
% 3.76/1.32 % (836472)Time elapsed: 0.008 s
% 3.76/1.32 % (836472)Peak memory usage: 88 MB
% 3.76/1.32 % (836472)Instructions burned: 11 (million)
% 3.76/1.32 % (836472)------------------------------
% 3.76/1.32 % (836472)------------------------------
% 3.76/1.32 % (836350)Success in time 0.456 s
% 3.76/1.32 % Vampire exiting
%------------------------------------------------------------------------------