%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : COM219_1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n009.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:31 AM UTC 2026
% Result : Theorem 0.25s 0.35s
% Output : Refutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 6
% Syntax : Number of formulae : 47 ( 12 unt; 0 typ; 3 def)
% Number of atoms : 170 ( 56 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 209 ( 86 ~; 83 |; 33 &)
% ( 3 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 34 ( 32 usr; 4 prp; 0-3 aty)
% Number of functors : 116 ( 116 usr; 10 con; 0-3 aty)
% Number of variables : 52 ( 0 sgn 46 !; 6 ?; 52 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
vTerm: $tType ).
tff(type_def_6,type,
vOptTerm: $tType ).
tff(type_def_7,type,
vTy: $tType ).
tff(func_def_0,type,
vNat: vTy ).
tff(func_def_1,type,
vSucc: vTerm > vTerm ).
tff(func_def_2,type,
vPred: vTerm > vTerm ).
tff(func_def_3,type,
vsomeTerm: vTerm > vOptTerm ).
tff(func_def_4,type,
vZero: vTerm ).
tff(func_def_5,type,
vIszero: vTerm > vTerm ).
tff(func_def_6,type,
vTrue: vTerm ).
tff(func_def_7,type,
vFalse: vTerm ).
tff(func_def_8,type,
vnoTerm: vOptTerm ).
tff(func_def_9,type,
vPlus: ( vTerm * vTerm ) > vTerm ).
tff(func_def_10,type,
vB: vTy ).
tff(func_def_11,type,
vIfelse: ( vTerm * vTerm * vTerm ) > vTerm ).
tff(func_def_12,type,
vt1: vTerm ).
tff(func_def_13,type,
vreduce: vTerm > vOptTerm ).
tff(func_def_14,type,
vplusop: ( vTerm * vTerm ) > vTerm ).
tff(func_def_15,type,
vgetTerm: vOptTerm > vTerm ).
tff(func_def_16,type,
sK25: vTerm > vTerm ).
tff(func_def_17,type,
sK26: vTerm > vTerm ).
tff(func_def_18,type,
sK27: vTerm > vTerm ).
tff(func_def_19,type,
sK28: vTerm > vTerm ).
tff(func_def_20,type,
sK29: vTerm > vTerm ).
tff(func_def_21,type,
sK30: vTerm > vTerm ).
tff(func_def_22,type,
sK31: vTerm > vTerm ).
tff(func_def_23,type,
sK32: vTerm > vTerm ).
tff(func_def_24,type,
sK33: vOptTerm > vTerm ).
tff(func_def_25,type,
sK34: vTerm > vTerm ).
tff(func_def_26,type,
sK35: vTerm > vTerm ).
tff(func_def_27,type,
sK36: vTerm > vTerm ).
tff(func_def_28,type,
sK37: vTerm > vTerm ).
tff(func_def_29,type,
sK38: vTerm > vTerm ).
tff(func_def_30,type,
sK39: vTerm > vTerm ).
tff(func_def_31,type,
sK40: vOptTerm > vTerm ).
tff(func_def_32,type,
sK41: vTerm > vTerm ).
tff(func_def_33,type,
sK42: ( vTerm * vTerm ) > vTerm ).
tff(func_def_34,type,
sK43: ( vTerm * vTerm ) > vTerm ).
tff(func_def_35,type,
sK44: ( vTerm * vTerm ) > vTerm ).
tff(func_def_36,type,
sK45: ( vTerm * vTerm ) > vTerm ).
tff(func_def_37,type,
sK46: ( vTerm * vTerm ) > vTerm ).
tff(func_def_38,type,
sK47: ( vTerm * vTerm * vTerm ) > vTerm ).
tff(func_def_39,type,
sK48: ( vTerm * vTerm * vTerm ) > vTerm ).
tff(func_def_40,type,
sK49: ( vTerm * vTerm * vTerm ) > vTerm ).
tff(func_def_41,type,
sK50: ( vTerm * vTerm * vTerm ) > vTerm ).
tff(func_def_42,type,
sK51: ( vTerm * vTerm * vTerm ) > vTerm ).
tff(func_def_43,type,
sK52: ( vTerm * vTerm * vTerm ) > vTerm ).
tff(func_def_44,type,
sK53: ( vTerm * vTerm * vTerm ) > vTerm ).
tff(func_def_45,type,
sK54: ( vTerm * vTerm * vTerm ) > vTerm ).
tff(func_def_46,type,
sK55: vTerm > vTerm ).
tff(func_def_47,type,
sK56: vTerm > vTerm ).
tff(func_def_48,type,
sK57: vTerm > vTerm ).
tff(func_def_49,type,
sK58: vTerm > vTerm ).
tff(func_def_50,type,
sK59: vTerm > vTerm ).
tff(func_def_51,type,
sK60: vTerm > vTerm ).
tff(func_def_52,type,
sK61: vTerm > vTerm ).
tff(func_def_53,type,
sK62: vTerm > vTerm ).
tff(func_def_54,type,
sK63: vTerm > vTerm ).
tff(func_def_55,type,
sK64: vTerm > vTerm ).
tff(func_def_56,type,
sK65: vTerm > vTerm ).
tff(func_def_57,type,
sK66: vTerm > vTerm ).
tff(func_def_58,type,
sK67: vTerm > vTerm ).
tff(func_def_59,type,
sK68: vTerm > vTerm ).
tff(func_def_60,type,
sK69: vTerm > vTerm ).
tff(func_def_61,type,
sK70: vTerm > vTerm ).
tff(func_def_62,type,
sK71: vTerm > vTerm ).
tff(func_def_63,type,
sK72: vTerm > vTerm ).
tff(func_def_64,type,
sK73: vTerm > vTerm ).
tff(func_def_65,type,
sK74: vTerm > vTerm ).
tff(func_def_66,type,
sK75: vTerm > vTerm ).
tff(func_def_67,type,
sK76: vTerm > vOptTerm ).
tff(func_def_68,type,
sK77: vTerm > vTerm ).
tff(func_def_69,type,
sK78: vTerm > vOptTerm ).
tff(func_def_70,type,
sK79: vTerm > vTerm ).
tff(func_def_71,type,
sK80: vTerm > vTerm ).
tff(func_def_72,type,
sK81: vTerm > vTerm ).
tff(func_def_73,type,
sK82: vTerm > vOptTerm ).
tff(func_def_74,type,
sK83: vTerm > vTerm ).
tff(func_def_75,type,
sK84: vTerm > vOptTerm ).
tff(func_def_76,type,
sK85: vTerm > vTerm ).
tff(func_def_77,type,
sK86: vTerm > vOptTerm ).
tff(func_def_78,type,
sK87: vTerm > vTerm ).
tff(func_def_79,type,
sK88: vTerm > vOptTerm ).
tff(func_def_80,type,
sK89: vTerm > vTerm ).
tff(func_def_81,type,
sK90: vTerm > vTerm ).
tff(func_def_82,type,
sK91: vTerm > vOptTerm ).
tff(func_def_83,type,
sK92: vTerm > vTerm ).
tff(func_def_84,type,
sK93: vTerm > vTerm ).
tff(func_def_85,type,
sK94: vTerm > vOptTerm ).
tff(func_def_86,type,
sK95: vTerm > vTerm ).
tff(func_def_87,type,
sK96: vTerm > vTerm ).
tff(func_def_88,type,
sK97: vTerm > vTerm ).
tff(func_def_89,type,
sK98: vTerm > vOptTerm ).
tff(func_def_90,type,
sK99: vTerm > vTerm ).
tff(func_def_91,type,
sK100: vTerm > vTerm ).
tff(func_def_92,type,
sK101: vTerm > vTerm ).
tff(func_def_93,type,
sK102: vTerm > vOptTerm ).
tff(func_def_94,type,
sK103: vTerm > vTerm ).
tff(func_def_95,type,
sK104: vTerm > vOptTerm ).
tff(func_def_96,type,
sK105: vTerm > vTerm ).
tff(func_def_97,type,
sK106: vTerm > vOptTerm ).
tff(func_def_98,type,
sK107: vTerm > vTerm ).
tff(func_def_99,type,
sK108: vTerm > vOptTerm ).
tff(func_def_100,type,
sK109: vTerm > vTerm ).
tff(func_def_101,type,
sK110: vTerm > vOptTerm ).
tff(func_def_102,type,
sK111: vTerm > vTerm ).
tff(func_def_103,type,
sK112: vTerm > vTerm ).
tff(func_def_104,type,
sK113: vTerm > vOptTerm ).
tff(func_def_105,type,
sK114: vTerm > vTerm ).
tff(func_def_106,type,
sK115: vTerm > vTerm ).
tff(func_def_107,type,
sK116: vTerm > vOptTerm ).
tff(func_def_108,type,
sK117: vTerm > vTerm ).
tff(func_def_109,type,
sK118: vTerm > vTerm ).
tff(func_def_110,type,
sK119: vTerm > vTerm ).
tff(func_def_111,type,
sK120: vTerm > vTerm ).
tff(func_def_112,type,
sK121: vTerm > vTerm ).
tff(func_def_113,type,
sK122: vTerm ).
tff(func_def_114,type,
sK123: vTy ).
tff(func_def_115,type,
sK124: vTerm ).
tff(pred_def_1,type,
visValue: vTerm > $o ).
tff(pred_def_2,type,
visNV: vTerm > $o ).
tff(pred_def_3,type,
visSomeTerm: vOptTerm > $o ).
tff(pred_def_4,type,
vptchecksimple: ( vTerm * vTy ) > $o ).
tff(pred_def_5,type,
sP0: ( vTerm * vTerm ) > $o ).
tff(pred_def_6,type,
sP1: ( vTerm * vTerm ) > $o ).
tff(pred_def_7,type,
sP2: ( vTerm * vTerm * vTerm ) > $o ).
tff(pred_def_8,type,
sP3: ( vTerm * vTerm * vTerm ) > $o ).
tff(pred_def_9,type,
sP4: vTerm > $o ).
tff(pred_def_10,type,
sP5: vTerm > $o ).
tff(pred_def_11,type,
sP6: vTerm > $o ).
tff(pred_def_12,type,
sP7: vTerm > $o ).
tff(pred_def_13,type,
sP8: vTerm > $o ).
tff(pred_def_14,type,
sP9: vTerm > $o ).
tff(pred_def_15,type,
sP10: vTerm > $o ).
tff(pred_def_16,type,
sP11: vTerm > $o ).
tff(pred_def_17,type,
sP12: vTerm > $o ).
tff(pred_def_18,type,
sP13: vTerm > $o ).
tff(pred_def_19,type,
sP14: vTerm > $o ).
tff(pred_def_20,type,
sP15: vTerm > $o ).
tff(pred_def_21,type,
sP16: vTerm > $o ).
tff(pred_def_22,type,
sP17: vTerm > $o ).
tff(pred_def_23,type,
sP18: vTerm > $o ).
tff(pred_def_24,type,
sP19: vTerm > $o ).
tff(pred_def_25,type,
sP20: vTerm > $o ).
tff(pred_def_26,type,
sP21: vTerm > $o ).
tff(pred_def_27,type,
sP22: vTerm > $o ).
tff(pred_def_28,type,
sP23: vTerm > $o ).
tff(pred_def_29,type,
sP24: vTerm > $o ).
tff(f106,axiom,
! [X0: vTerm,X1: vTy,X2: vTerm] :
( ( visSomeTerm(vreduce(vSucc(X0)))
& ~ visNV(X0)
& ( vt1 != vZero )
& ( vt1 = vSucc(X0) )
& vptchecksimple(vIszero(vt1),X1)
& ( vreduce(vIszero(vt1)) = vsomeTerm(X2) ) )
=> vptchecksimple(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','Preservation-Iszero-Succ-isNV-False-isSomeTerm-True') ).
tff(f107,axiom,
! [X0: vTerm,X1: vTy,X2: vTerm] :
( ( ~ visSomeTerm(vreduce(vSucc(X0)))
& ~ visNV(X0)
& ( vt1 != vZero )
& ( vt1 = vSucc(X0) )
& vptchecksimple(vIszero(vt1),X1)
& ( vreduce(vIszero(vt1)) = vsomeTerm(X2) ) )
=> vptchecksimple(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','Preservation-Iszero-Succ-isNV-False-isSomeTerm-False') ).
tff(f108,conjecture,
! [X0: vTerm,X1: vTy,X2: vTerm] :
( ( ~ visNV(X0)
& ( vt1 != vZero )
& ( vt1 = vSucc(X0) )
& vptchecksimple(vIszero(vt1),X1)
& ( vreduce(vIszero(vt1)) = vsomeTerm(X2) ) )
=> vptchecksimple(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','Preservation-Iszero-Succ-isNV-False') ).
tff(f109,negated_conjecture,
~ ! [X0: vTerm,X1: vTy,X2: vTerm] :
( ( ~ visNV(X0)
& ( vt1 != vZero )
& ( vt1 = vSucc(X0) )
& vptchecksimple(vIszero(vt1),X1)
& ( vreduce(vIszero(vt1)) = vsomeTerm(X2) ) )
=> vptchecksimple(X2,X1) ),
inference(negated_conjecture,[status(cth)],[f108]) ).
tff(f191,plain,
! [X0: vTerm,X1: vTy,X2: vTerm] :
( vptchecksimple(X2,X1)
| ~ visSomeTerm(vreduce(vSucc(X0)))
| visNV(X0)
| ( vZero = vt1 )
| ( vSucc(X0) != vt1 )
| ~ vptchecksimple(vIszero(vt1),X1)
| ( vreduce(vIszero(vt1)) != vsomeTerm(X2) ) ),
inference(ennf_transformation,[],[f106]) ).
tff(f192,plain,
! [X0: vTerm,X1: vTy,X2: vTerm] :
( vptchecksimple(X2,X1)
| ~ visSomeTerm(vreduce(vSucc(X0)))
| visNV(X0)
| ( vZero = vt1 )
| ( vSucc(X0) != vt1 )
| ~ vptchecksimple(vIszero(vt1),X1)
| ( vreduce(vIszero(vt1)) != vsomeTerm(X2) ) ),
inference(flattening,[],[f191]) ).
tff(f193,plain,
! [X0: vTerm,X1: vTy,X2: vTerm] :
( vptchecksimple(X2,X1)
| visSomeTerm(vreduce(vSucc(X0)))
| visNV(X0)
| ( vZero = vt1 )
| ( vSucc(X0) != vt1 )
| ~ vptchecksimple(vIszero(vt1),X1)
| ( vreduce(vIszero(vt1)) != vsomeTerm(X2) ) ),
inference(ennf_transformation,[],[f107]) ).
tff(f194,plain,
! [X0: vTerm,X1: vTy,X2: vTerm] :
( vptchecksimple(X2,X1)
| visSomeTerm(vreduce(vSucc(X0)))
| visNV(X0)
| ( vZero = vt1 )
| ( vSucc(X0) != vt1 )
| ~ vptchecksimple(vIszero(vt1),X1)
| ( vreduce(vIszero(vt1)) != vsomeTerm(X2) ) ),
inference(flattening,[],[f193]) ).
tff(f195,plain,
? [X0: vTerm,X1: vTy,X2: vTerm] :
( ~ vptchecksimple(X2,X1)
& ~ visNV(X0)
& ( vt1 != vZero )
& ( vt1 = vSucc(X0) )
& vptchecksimple(vIszero(vt1),X1)
& ( vreduce(vIszero(vt1)) = vsomeTerm(X2) ) ),
inference(ennf_transformation,[],[f109]) ).
tff(f196,plain,
? [X0: vTerm,X1: vTy,X2: vTerm] :
( ~ vptchecksimple(X2,X1)
& ~ visNV(X0)
& ( vt1 != vZero )
& ( vt1 = vSucc(X0) )
& vptchecksimple(vIszero(vt1),X1)
& ( vreduce(vIszero(vt1)) = vsomeTerm(X2) ) ),
inference(flattening,[],[f195]) ).
tff(f319,plain,
( ~ vptchecksimple(sK124,sK123)
& ~ visNV(sK122)
& ( vt1 != vZero )
& ( vt1 = vSucc(sK122) )
& vptchecksimple(vIszero(vt1),sK123)
& ( vreduce(vIszero(vt1)) = vsomeTerm(sK124) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK122,sK123,sK124]),skolemize(X0,sK122),skolemize(X1,sK123),skolemize(X2,sK124)],[f196]) ).
tff(f580,plain,
! [X2: vTerm,X0: vTerm,X1: vTy] :
( vptchecksimple(X2,X1)
| ~ visSomeTerm(vreduce(vSucc(X0)))
| visNV(X0)
| ( vZero = vt1 )
| ( vSucc(X0) != vt1 )
| ~ vptchecksimple(vIszero(vt1),X1)
| ( vreduce(vIszero(vt1)) != vsomeTerm(X2) ) ),
inference(cnf_transformation,[],[f192]) ).
tff(f581,plain,
! [X2: vTerm,X0: vTerm,X1: vTy] :
( vptchecksimple(X2,X1)
| visSomeTerm(vreduce(vSucc(X0)))
| visNV(X0)
| ( vZero = vt1 )
| ( vSucc(X0) != vt1 )
| ~ vptchecksimple(vIszero(vt1),X1)
| ( vreduce(vIszero(vt1)) != vsomeTerm(X2) ) ),
inference(cnf_transformation,[],[f194]) ).
tff(f582,plain,
vreduce(vIszero(vt1)) = vsomeTerm(sK124),
inference(cnf_transformation,[],[f319]) ).
tff(f583,plain,
vptchecksimple(vIszero(vt1),sK123),
inference(cnf_transformation,[],[f319]) ).
tff(f584,plain,
vt1 = vSucc(sK122),
inference(cnf_transformation,[],[f319]) ).
tff(f585,plain,
vZero != vt1,
inference(cnf_transformation,[],[f319]) ).
tff(f586,plain,
~ visNV(sK122),
inference(cnf_transformation,[],[f319]) ).
tff(f587,plain,
~ vptchecksimple(sK124,sK123),
inference(cnf_transformation,[],[f319]) ).
tff(f588,plain,
! [X2: vTerm,X0: vTerm,X1: vTy] :
( vptchecksimple(X2,X1)
| visSomeTerm(vreduce(vSucc(X0)))
| visNV(X0)
| ( vSucc(X0) != vt1 )
| ~ vptchecksimple(vIszero(vt1),X1)
| ( vreduce(vIszero(vt1)) != vsomeTerm(X2) ) ),
inference(forward_subsumption_resolution,[],[f581,f585]) ).
tff(f589,plain,
! [X2: vTerm,X0: vTerm,X1: vTy] :
( vptchecksimple(X2,X1)
| ~ visSomeTerm(vreduce(vSucc(X0)))
| visNV(X0)
| ( vSucc(X0) != vt1 )
| ~ vptchecksimple(vIszero(vt1),X1)
| ( vreduce(vIszero(vt1)) != vsomeTerm(X2) ) ),
inference(forward_subsumption_resolution,[],[f580,f585]) ).
tff(f591,definition,
( spl125_1
<=> ! [X0: vTerm] :
( visSomeTerm(vreduce(vSucc(X0)))
| ( vSucc(X0) != vt1 )
| visNV(X0) ) ),
introduced(definition,[new_symbols(definition,[spl125_1])],[avatar_definition]) ).
tff(f592,plain,
( ! [X0: vTerm] :
( visSomeTerm(vreduce(vSucc(X0)))
| ( vSucc(X0) != vt1 )
| visNV(X0) )
| ~ spl125_1 ),
inference(avatar_component_clause,[],[f591]) ).
tff(f594,definition,
( spl125_2
<=> ! [X2: vTerm,X1: vTy] :
( vptchecksimple(X2,X1)
| ( vreduce(vIszero(vt1)) != vsomeTerm(X2) )
| ~ vptchecksimple(vIszero(vt1),X1) ) ),
introduced(definition,[new_symbols(definition,[spl125_2])],[avatar_definition]) ).
tff(f595,plain,
( ! [X2: vTerm,X1: vTy] :
( ~ vptchecksimple(vIszero(vt1),X1)
| ( vreduce(vIszero(vt1)) != vsomeTerm(X2) )
| vptchecksimple(X2,X1) )
| ~ spl125_2 ),
inference(avatar_component_clause,[],[f594]) ).
tff(f596,plain,
( spl125_1
| spl125_2 ),
inference(avatar_split_clause,[],[f588,f594,f591]) ).
tff(f598,definition,
( spl125_3
<=> ! [X0: vTerm] :
( ~ visSomeTerm(vreduce(vSucc(X0)))
| ( vSucc(X0) != vt1 )
| visNV(X0) ) ),
introduced(definition,[new_symbols(definition,[spl125_3])],[avatar_definition]) ).
tff(f599,plain,
( ! [X0: vTerm] :
( ~ visSomeTerm(vreduce(vSucc(X0)))
| ( vSucc(X0) != vt1 )
| visNV(X0) )
| ~ spl125_3 ),
inference(avatar_component_clause,[],[f598]) ).
tff(f600,plain,
( spl125_3
| spl125_2 ),
inference(avatar_split_clause,[],[f589,f594,f598]) ).
tff(f601,plain,
( ! [X0: vTerm] :
( ( vsomeTerm(X0) != vreduce(vIszero(vt1)) )
| vptchecksimple(X0,sK123) )
| ~ spl125_2 ),
inference(resolution,[],[f595,f583]) ).
tff(f602,plain,
( ( vreduce(vIszero(vt1)) != vreduce(vIszero(vt1)) )
| vptchecksimple(sK124,sK123)
| ~ spl125_2 ),
inference(superposition,[],[f601,f582]) ).
tff(f603,plain,
( vptchecksimple(sK124,sK123)
| ~ spl125_2 ),
inference(trivial_inequality_removal,[],[f602]) ).
tff(f604,plain,
( $false
| ~ spl125_2 ),
inference(forward_subsumption_resolution,[],[f603,f587]) ).
tff(f605,plain,
~ spl125_2,
inference(avatar_contradiction_clause,[],[f604]) ).
tff(f606,plain,
( ! [X0: vTerm] :
( ( vSucc(X0) != vt1 )
| visNV(X0) )
| ~ spl125_1
| ~ spl125_3 ),
inference(forward_subsumption_resolution,[],[f599,f592]) ).
tff(f607,plain,
( ( vt1 != vt1 )
| visNV(sK122)
| ~ spl125_1
| ~ spl125_3 ),
inference(superposition,[],[f606,f584]) ).
tff(f608,plain,
( visNV(sK122)
| ~ spl125_1
| ~ spl125_3 ),
inference(trivial_inequality_removal,[],[f607]) ).
tff(f609,plain,
( $false
| ~ spl125_1
| ~ spl125_3 ),
inference(forward_subsumption_resolution,[],[f608,f586]) ).
tff(f610,plain,
( ~ spl125_1
| ~ spl125_3 ),
inference(avatar_contradiction_clause,[],[f609]) ).
cnf(s1,plain,
( spl125_1
| spl125_2 ),
inference(sat_conversion,[],[f596]) ).
cnf(s2,plain,
( spl125_2
| spl125_3 ),
inference(sat_conversion,[],[f600]) ).
cnf(s3,plain,
~ spl125_2,
inference(sat_conversion,[],[f605]) ).
cnf(s4,plain,
( ~ spl125_1
| ~ spl125_3 ),
inference(sat_conversion,[],[f610]) ).
cnf(s5,plain,
spl125_3,
inference(rat,[],[s2,s3]) ).
cnf(s6,plain,
~ spl125_1,
inference(rat,[],[s4,s5]) ).
cnf(s7,plain,
$false,
inference(rat,[],[s1,s3,s6]) ).
tff(f611,plain,
$false,
inference(avatar_sat_refutation,[],[s7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM219_1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.21 % Computer : n009.cluster.edu
% 0.09/0.21 % Model : x86_64 x86_64
% 0.09/0.21 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.21 % Memory : 8046.5625MB
% 0.09/0.21 % OS : Linux 6.8.0-71-generic
% 0.09/0.21 % CPULimit : 300
% 0.09/0.21 % WCLimit : 300
% 0.09/0.21 % DateTime : Mon Sep 28 22:02:15 UTC 2026
% 0.09/0.21 % CPUTime :
% 0.09/0.21 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.25 Running first-order model finding
% 0.09/0.25 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.25/0.35 % (3539202)Will run a generic schedule for satisfiability detection.
% 0.25/0.35 % (3539209)% WARNING: option uhcvi not known.
% 0.25/0.35 % (3539213)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2817173085:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.25/0.35 % (3539214)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4208195102:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.25/0.35 % (3539212)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4089771991:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.25/0.35 % (3539209)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3345179081:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.25/0.35 % (3539211)dis+10_1_sil=32000:sp=arity:random_seed=2135379278:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.25/0.35 % (3539213) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3539202-3539213"...
% 0.25/0.35 % (3539213)...printing done.
% 0.25/0.35 % (3539213)Refutation found. Thanks to Tanya!
% 0.25/0.35 % SZS status Theorem for theBenchmark
% 0.25/0.35 % SZS output start Proof for theBenchmark
% See solution above
% 0.25/0.35 % (3539213)------------------------------
% 0.25/0.35 % (3539213)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.25/0.35 % (3539213)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.25/0.35 % (3539213)CaDiCaL version: 2.1.3
% 0.25/0.35 % (3539213)Termination reason: Refutation
% 0.25/0.35 % (3539213)Time elapsed: 0.020 s
% 0.25/0.35 % (3539213)Peak memory usage: 13 MB
% 0.25/0.35 % (3539213)Instructions burned: 18 (million)
% 0.25/0.35 % (3539202)Success in time 0.084 s
% 0.25/0.35 % Vampire exiting
%------------------------------------------------------------------------------