%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWW820_1 : TPTP v9.3.1. Released v7.0.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 01:37:53 PM UTC 2026
% Result : Unsatisfiable 5.59s 1.56s
% Output : Refutation 6.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 5
% Syntax : Number of formulae : 61 ( 22 unt; 0 typ; 3 def)
% Number of atoms : 420 ( 230 equ)
% Maximal formula atoms : 35 ( 6 avg)
% Number of connectives : 508 ( 149 ~; 74 |; 223 &)
% ( 5 <=>; 57 =>; 0 <=; 0 <~>)
% Maximal formula depth : 57 ( 11 avg)
% Maximal term depth : 8 ( 2 avg)
% Number arithmetic : 577 ( 124 atm; 70 fun; 226 num; 157 var)
% Number of types : 7 ( 4 usr; 2 ari; 0 dat; 0 cdt)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 28 ( 24 usr; 3 prp; 0-9 aty)
% Number of functors : 160 ( 149 usr; 34 con; 0-9 aty)
% Number of variables : 335 ( 0 sgn 212 !; 123 ?; 335 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
c_ssorted: $tType ).
tff(type_def_6,type,
c_Boolean: $tType ).
tff(type_def_7,type,
c_type: $tType ).
tff(type_def_8,type,
c_unique: $tType ).
tff(func_def_0,type,
pset_acc_range_left: ( c_ssorted * c_ssorted * $int ) > c_unique ).
tff(func_def_1,type,
c_Boolean_true: c_Boolean ).
tff(func_def_2,type,
ss2Real: c_ssorted > $real ).
tff(func_def_3,type,
base_addr: c_ssorted > c_unique ).
tff(func_def_4,type,
pset_acc_range: ( c_ssorted * c_ssorted * $int * $int ) > c_unique ).
tff(func_def_5,type,
type_pset: c_type > c_type ).
tff(func_def_6,type,
'%': ( $int * $int ) > $int ).
tff(func_def_7,type,
neq_int_bool: ( $int * $int ) > c_Boolean ).
tff(func_def_8,type,
whydivide: ( $int * $int ) > $int ).
tff(func_def_9,type,
c_Boolean_false: c_Boolean ).
tff(func_def_10,type,
pset_singleton: c_ssorted > c_unique ).
tff(func_def_11,type,
bool2U: c_Boolean > c_unique ).
tff(func_def_12,type,
type_alloc_table: c_type ).
tff(func_def_13,type,
gt_int_bool: ( $int * $int ) > c_Boolean ).
tff(func_def_14,type,
pset_acc_range_right: ( c_ssorted * c_ssorted * $int ) > c_unique ).
tff(func_def_15,type,
type_pointer: c_type > c_type ).
tff(func_def_16,type,
shift: ( c_ssorted * $int ) > c_unique ).
tff(func_def_17,type,
upd: ( c_ssorted * c_ssorted * c_ssorted ) > c_unique ).
tff(func_def_18,type,
pset_all: c_ssorted > c_unique ).
tff(func_def_19,type,
int2U: $int > c_unique ).
tff(func_def_20,type,
c_real: c_type ).
tff(func_def_21,type,
lt_int_bool: ( $int * $int ) > c_Boolean ).
tff(func_def_22,type,
pset_range: ( c_ssorted * $int * $int ) > c_unique ).
tff(func_def_23,type,
ss2Int: c_ssorted > $int ).
tff(func_def_24,type,
pset_union: ( c_ssorted * c_ssorted ) > c_unique ).
tff(func_def_25,type,
le_int_bool: ( $int * $int ) > c_Boolean ).
tff(func_def_26,type,
null: c_unique ).
tff(func_def_27,type,
real2U: $real > c_unique ).
tff(func_def_28,type,
smtlib__ite: ( c_Boolean * c_ssorted * c_ssorted ) > c_unique ).
tff(func_def_29,type,
pset_range_left: ( c_ssorted * $int ) > c_unique ).
tff(func_def_30,type,
block_length: ( c_ssorted * c_ssorted ) > $int ).
tff(func_def_31,type,
c_sort: ( c_type * c_unique ) > c_ssorted ).
tff(func_def_32,type,
eq_int_bool: ( $int * $int ) > c_Boolean ).
tff(func_def_33,type,
sub_pointer: ( c_ssorted * c_ssorted ) > $int ).
tff(func_def_34,type,
pset_empty: c_unique ).
tff(func_def_35,type,
c_bool: c_type ).
tff(func_def_36,type,
ss2Bool: c_ssorted > c_Boolean ).
tff(func_def_37,type,
type_memory: ( c_type * c_type ) > c_type ).
tff(func_def_38,type,
acc: ( c_ssorted * c_ssorted ) > c_unique ).
tff(func_def_39,type,
c_int: c_type ).
tff(func_def_40,type,
type_global: c_type ).
tff(func_def_41,type,
pset_range_right: ( c_ssorted * $int ) > c_unique ).
tff(func_def_42,type,
pset_acc_all: ( c_ssorted * c_ssorted ) > c_unique ).
tff(func_def_43,type,
pset_star: ( c_ssorted * c_ssorted ) > c_unique ).
tff(func_def_44,type,
ge_int_bool: ( $int * $int ) > c_Boolean ).
tff(func_def_45,type,
offset: c_ssorted > $int ).
tff(func_def_58,type,
sK1: ( c_unique * c_unique * c_type ) > c_type ).
tff(func_def_59,type,
sK2: ( c_unique * c_unique * c_type ) > c_ssorted ).
tff(func_def_60,type,
sK3: ( c_unique * c_unique * c_type ) > c_ssorted ).
tff(func_def_61,type,
sK4: ( c_type * c_unique * $int * $int * c_unique ) > c_ssorted ).
tff(func_def_62,type,
sK5: ( c_type * c_unique * $int * $int * c_unique ) > c_ssorted ).
tff(func_def_63,type,
sK6: ( c_type * c_unique * $int * $int * c_unique ) > $int ).
tff(func_def_64,type,
sK7: $int > $int ).
tff(func_def_65,type,
sK8: ( $int * c_unique * c_type ) > c_type ).
tff(func_def_66,type,
sK9: ( $int * c_unique * c_type ) > c_ssorted ).
tff(func_def_67,type,
sK10: ( $int * $int * c_unique * c_type * c_unique * $int ) > c_ssorted ).
tff(func_def_68,type,
sK11: ( $int * $int * c_unique * c_type * c_unique * $int ) > c_ssorted ).
tff(func_def_69,type,
sK12: ( $int * c_unique * $int * c_type ) > c_type ).
tff(func_def_70,type,
sK13: ( $int * c_unique * $int * c_type ) > c_ssorted ).
tff(func_def_71,type,
sK14: ( $int * c_unique * c_type * c_unique * $int ) > c_type ).
tff(func_def_72,type,
sK15: ( $int * c_unique * c_type * c_unique * $int ) > c_ssorted ).
tff(func_def_73,type,
sK16: ( $int * c_unique * c_type * c_unique * $int ) > c_ssorted ).
tff(func_def_74,type,
sK17: c_unique > c_ssorted ).
tff(func_def_75,type,
sK18: ( c_unique * c_type * c_unique * $int * c_unique ) > c_ssorted ).
tff(func_def_76,type,
sK19: ( c_type * c_unique * c_unique * $int * $int ) > c_type ).
tff(func_def_77,type,
sK20: ( c_type * c_unique * c_unique * $int * $int ) > c_ssorted ).
tff(func_def_78,type,
sK21: ( c_type * c_unique * c_unique * $int * $int ) > c_ssorted ).
tff(func_def_79,type,
sK22: ( c_type * c_unique * c_unique ) > c_type ).
tff(func_def_80,type,
sK23: ( c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_81,type,
sK24: ( c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_82,type,
sK25: ( c_unique * c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_83,type,
sK26: ( c_type * c_unique * $int * c_unique ) > c_type ).
tff(func_def_84,type,
sK27: ( c_type * c_unique * $int * c_unique ) > c_ssorted ).
tff(func_def_85,type,
sK28: ( c_type * c_unique * $int * c_unique ) > c_ssorted ).
tff(func_def_86,type,
sK29: ( c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_87,type,
sK30: ( c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_88,type,
sK31: ( c_type * c_unique * c_unique ) > $int ).
tff(func_def_89,type,
sK32: ( $int * c_type * c_type * c_unique * c_unique * c_unique ) > c_ssorted ).
tff(func_def_90,type,
sK33: ( $int * c_type * c_type * c_unique * c_unique * c_unique ) > c_ssorted ).
tff(func_def_91,type,
sK34: ( $int * c_type * c_type * c_unique * c_unique * c_unique ) > c_type ).
tff(func_def_92,type,
sK35: ( $int * c_type * c_type * c_unique ) > c_unique ).
tff(func_def_93,type,
sK36: ( $int * c_type * c_type * c_unique ) > c_unique ).
tff(func_def_94,type,
sK37: ( c_unique * c_type * c_unique * c_unique ) > c_type ).
tff(func_def_95,type,
sK38: ( c_unique * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_96,type,
sK39: ( c_unique * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_97,type,
sK40: ( c_unique * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_98,type,
sK41: ( c_unique * c_unique * c_type * $int * $int * c_unique ) > c_ssorted ).
tff(func_def_99,type,
sK42: ( c_unique * c_unique * c_type ) > c_type ).
tff(func_def_100,type,
sK43: ( c_unique * c_unique * c_type ) > c_ssorted ).
tff(func_def_101,type,
sK44: ( c_unique * c_unique * c_type ) > c_ssorted ).
tff(func_def_102,type,
sK45: ( $int * $int * c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_103,type,
sK46: ( $int * $int * c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_104,type,
sK47: ( c_type * $int * c_unique * c_unique ) > c_ssorted ).
tff(func_def_105,type,
sK48: ( c_type * $int * c_unique * c_unique ) > c_type ).
tff(func_def_106,type,
sK49: ( c_type * $int * c_unique * c_unique ) > c_ssorted ).
tff(func_def_107,type,
sK50: ( $int * c_unique * $int * c_unique * c_type ) > c_type ).
tff(func_def_108,type,
sK51: ( $int * c_unique * $int * c_unique * c_type ) > c_ssorted ).
tff(func_def_109,type,
sK52: ( $int * c_unique * $int * c_unique * c_type ) > c_ssorted ).
tff(func_def_110,type,
sK53: ( c_unique * c_unique * c_type ) > c_type ).
tff(func_def_111,type,
sK54: ( c_unique * c_unique * c_type ) > c_ssorted ).
tff(func_def_112,type,
sK55: ( c_unique * c_unique * c_type ) > c_ssorted ).
tff(func_def_113,type,
sK56: ( c_type * c_unique * $int ) > c_type ).
tff(func_def_114,type,
sK57: ( c_type * c_unique * $int ) > c_ssorted ).
tff(func_def_115,type,
sK58: ( c_type * c_unique * c_unique ) > c_type ).
tff(func_def_116,type,
sK59: ( c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_117,type,
sK60: ( c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_118,type,
sK61: ( c_type * c_unique * c_unique * $int * c_unique * c_type ) > c_type ).
tff(func_def_119,type,
sK62: ( c_type * c_unique * c_unique * $int * c_unique * c_type ) > c_ssorted ).
tff(func_def_120,type,
sK63: ( c_type * c_unique * c_unique * $int * c_unique * c_type ) > c_ssorted ).
tff(func_def_121,type,
sK64: ( c_type * c_unique * c_unique * $int * c_unique * c_type ) > c_ssorted ).
tff(func_def_122,type,
sK65: ( c_type * c_unique * c_unique ) > c_type ).
tff(func_def_123,type,
sK66: ( c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_124,type,
sK67: ( c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_125,type,
sK68: ( $int * $int * $int * c_unique * c_type * c_unique * $int * c_unique * c_unique ) > c_unique ).
tff(func_def_126,type,
sK69: ( $int * $int * $int * c_unique * c_type * c_unique * $int * c_unique * c_unique ) > $int ).
tff(func_def_127,type,
sK70: ( $int * $int * $int * c_unique * c_type * c_unique * $int * c_unique * c_unique ) > c_unique ).
tff(func_def_128,type,
sK71: ( $int * $int * $int * c_unique * c_type * c_unique * $int * c_unique * c_unique ) > $int ).
tff(func_def_129,type,
sK72: ( $int * $int * $int * c_unique * c_type * c_unique * $int * c_unique * c_unique ) > $int ).
tff(func_def_130,type,
sK73: c_unique ).
tff(func_def_131,type,
sK74: $int ).
tff(func_def_132,type,
sK75: $int ).
tff(func_def_133,type,
sK76: $int ).
tff(func_def_134,type,
sK77: c_unique ).
tff(func_def_135,type,
sK78: $int ).
tff(func_def_136,type,
sK79: c_unique ).
tff(func_def_137,type,
sK80: $int ).
tff(func_def_138,type,
sK81: $int ).
tff(func_def_139,type,
sK82: $int ).
tff(func_def_140,type,
sK83: $int ).
tff(func_def_141,type,
sK84: c_unique ).
tff(func_def_142,type,
sK85: $int ).
tff(func_def_143,type,
sK86: $int ).
tff(func_def_144,type,
sK87: $int ).
tff(func_def_145,type,
sK88: c_unique ).
tff(func_def_146,type,
sK89: $int > c_type ).
tff(func_def_147,type,
sK90: ( c_unique * c_unique * c_unique ) > c_ssorted ).
tff(func_def_148,type,
sK91: ( c_unique * c_unique * c_unique ) > c_ssorted ).
tff(func_def_149,type,
sK92: ( c_unique * c_unique * c_unique ) > c_ssorted ).
tff(func_def_150,type,
sK93: ( c_type * c_unique * c_unique ) > c_type ).
tff(func_def_151,type,
sK94: ( c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_152,type,
sK95: ( c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_153,type,
sK96: ( c_unique * c_type * c_unique * $int * $int * $int ) > c_ssorted ).
tff(func_def_154,type,
sK97: ( c_unique * c_type * c_unique * $int * $int * $int ) > c_type ).
tff(func_def_155,type,
sK98: ( c_unique * c_type * c_unique * $int * $int * $int ) > c_ssorted ).
tff(func_def_156,type,
sK99: ( c_type * c_unique * c_unique * $int ) > c_ssorted ).
tff(func_def_157,type,
sK100: ( c_type * c_unique * c_unique * $int ) > c_ssorted ).
tff(func_def_158,type,
sK101: ( c_type * c_unique * c_unique * $int ) > $int ).
tff(func_def_162,type,
'$inst102': $int ).
tff(func_def_163,type,
'$inst103': $int ).
tff(pred_def_1,type,
fresh: ( c_ssorted * c_ssorted ) > $o ).
tff(pred_def_2,type,
gt_pointer: ( c_ssorted * c_ssorted ) > $o ).
tff(pred_def_3,type,
valid_acc_range: ( c_ssorted * $int ) > $o ).
tff(pred_def_4,type,
on_stack: ( c_ssorted * c_ssorted ) > $o ).
tff(pred_def_5,type,
valid_acc: c_ssorted > $o ).
tff(pred_def_6,type,
le_pointer: ( c_ssorted * c_ssorted ) > $o ).
tff(pred_def_7,type,
not_assigns: ( c_ssorted * c_ssorted * c_ssorted * c_ssorted ) > $o ).
tff(pred_def_8,type,
valid_range: ( c_ssorted * c_ssorted * $int * $int ) > $o ).
tff(pred_def_9,type,
valid_index: ( c_ssorted * c_ssorted * $int ) > $o ).
tff(pred_def_10,type,
not_in_pset: ( c_ssorted * c_ssorted ) > $o ).
tff(pred_def_11,type,
ge_pointer: ( c_ssorted * c_ssorted ) > $o ).
tff(pred_def_12,type,
free_stack: ( c_ssorted * c_ssorted * c_ssorted ) > $o ).
tff(pred_def_13,type,
valid: ( c_ssorted * c_ssorted ) > $o ).
tff(pred_def_14,type,
separation1: ( c_ssorted * c_ssorted ) > $o ).
tff(pred_def_15,type,
alloc_extends: ( c_ssorted * c_ssorted ) > $o ).
tff(pred_def_16,type,
separation1_range: ( c_ssorted * $int ) > $o ).
tff(pred_def_17,type,
lt_pointer: ( c_ssorted * c_ssorted ) > $o ).
tff(pred_def_18,type,
on_heap: ( c_ssorted * c_ssorted ) > $o ).
tff(pred_def_19,type,
separation1_range1: ( c_ssorted * c_ssorted * $int ) > $o ).
tff(pred_def_20,type,
separation2_range1: ( c_ssorted * c_ssorted * $int ) > $o ).
tff(pred_def_21,type,
separation2: ( c_ssorted * c_ssorted ) > $o ).
tff(pred_def_26,type,
sP0: ( $int * $int * $int * c_unique * c_type * c_unique * $int * c_unique * c_unique ) > $o ).
tff(f28,axiom,
! [X2: c_unique,X1: c_unique,X0: c_type] :
? [X4: c_ssorted,X3: c_ssorted] :
( ( X3 = c_sort(type_alloc_table,X1) )
& ? [X5: $int] :
( ( valid(X3,X4)
<=> ( $lesseq(0,X5)
& $less(X5,block_length(X3,X4)) ) )
& ( X5 = offset(X4) ) )
& ( X4 = c_sort(type_pointer(X0),X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',formula_28) ).
tff(f101,negated_conjecture,
~ ! [X3: $int,X1: c_unique,X0: $int,X4: c_unique,X2: $int] :
( ( ( X2 = 0 )
& ( X0 = 10000 )
& ( X3 = 2800 )
& valid_range(c_sort(type_alloc_table,X1),c_sort(type_pointer(type_global),X4),0,2800) )
=> ! [X5: $int,X6: c_unique] :
( ( ! [X7: $int] :
? [X8: c_type] :
( ( X8 = type_pointer(type_global) )
& ( ( $less(X7,X5)
& $lesseq(0,X7) )
=> ( ss2Int(c_sort(c_int,acc(c_sort(type_memory(c_int,type_global),X6),c_sort(X8,shift(c_sort(X8,X4),X7))))) = 2000 ) ) )
& $lesseq(X5,2800)
& $lesseq(0,X5) )
=> ( ( $difference(X5,X3) = 0 )
=> ! [X9: $int] :
( ( $lesseq(X9,2800)
& ( '%'(X9,14) = 0 )
& $lesseq(0,X9) )
=> ! [X10: $int] :
( ( X10 = 0 )
=> ! [X11: $int] :
( ( X11 = $product(X9,2) )
=> ( ( X11 != 0 )
=> ! [X12: $int] :
( ( X12 = X9 )
=> ! [X14: $int,X16: c_unique,X13: $int,X15: $int] :
( ( $lesseq(1,X13)
& ( X15 = $product(X13,2) )
& $lesseq(X13,X9) )
=> ( ( 1 != 0 )
=> ! [X17: c_unique] :
? [X18: c_type] :
( ( X18 = type_pointer(type_global) )
& ( ( X17 = shift(c_sort(X18,X4),X13) )
=> ( valid(c_sort(type_alloc_table,X1),c_sort(X18,X17))
=> ! [X19: c_unique] :
( ( X19 = acc(c_sort(type_memory(c_int,type_global),X16),c_sort(X18,X17)) )
=> ! [X20: $int] :
( ( X20 = $sum(X14,$product(ss2Int(c_sort(c_int,X19)),X0)) )
=> ! [X21: c_unique] :
( ( X21 = shift(c_sort(X18,X4),X13) )
=> ! [X22: $int] :
( ( X22 = $difference(X15,1) )
=> ( ( X22 != 0 )
=> ! [X23: $int] :
? [X24: c_ssorted] :
( ? [X25: $int] :
( ( ( X23 = '%'(X20,X22) )
=> ( $less(X25,block_length(c_sort(type_alloc_table,X1),X24))
& $lesseq(0,X25) ) )
& ( X25 = offset(X24) ) )
& ( X24 = c_sort(X18,X21) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',formula_101) ).
tff(f129,plain,
! [X2: c_unique,X1: c_unique,X0: c_type] :
? [X4: c_ssorted,X3: c_ssorted] :
( ( X3 = c_sort(type_alloc_table,X1) )
& ? [X5: $int] :
( ( valid(X3,X4)
<=> ( ~ $less(X5,0)
& $less(X5,block_length(X3,X4)) ) )
& ( X5 = offset(X4) ) )
& ( X4 = c_sort(type_pointer(X0),X2) ) ),
inference(theory_normalization,[],[f28]) ).
tff(f134,plain,
~ ! [X3: $int,X1: c_unique,X0: $int,X4: c_unique,X2: $int] :
( ( ( X2 = 0 )
& ( X0 = 10000 )
& ( X3 = 2800 )
& valid_range(c_sort(type_alloc_table,X1),c_sort(type_pointer(type_global),X4),0,2800) )
=> ! [X5: $int,X6: c_unique] :
( ( ! [X7: $int] :
? [X8: c_type] :
( ( X8 = type_pointer(type_global) )
& ( ( $less(X7,X5)
& ~ $less(X7,0) )
=> ( ss2Int(c_sort(c_int,acc(c_sort(type_memory(c_int,type_global),X6),c_sort(X8,shift(c_sort(X8,X4),X7))))) = 2000 ) ) )
& ~ $less(2800,X5)
& ~ $less(X5,0) )
=> ( ( 0 = $sum(X5,$uminus(X3)) )
=> ! [X9: $int] :
( ( ( '%'(X9,14) = 0 )
& ~ $less(X9,0)
& ~ $less(2800,X9) )
=> ! [X10: $int] :
( ( X10 = 0 )
=> ! [X11: $int] :
( ( X11 = $product(X9,2) )
=> ( ( X11 != 0 )
=> ! [X12: $int] :
( ( X12 = X9 )
=> ! [X14: $int,X16: c_unique,X13: $int,X15: $int] :
( ( ~ $less(X13,1)
& ( X15 = $product(X13,2) )
& ~ $less(X9,X13) )
=> ( ( 1 != 0 )
=> ! [X17: c_unique] :
? [X18: c_type] :
( ( X18 = type_pointer(type_global) )
& ( ( X17 = shift(c_sort(X18,X4),X13) )
=> ( valid(c_sort(type_alloc_table,X1),c_sort(X18,X17))
=> ! [X19: c_unique] :
( ( X19 = acc(c_sort(type_memory(c_int,type_global),X16),c_sort(X18,X17)) )
=> ! [X20: $int] :
( ( X20 = $sum(X14,$product(ss2Int(c_sort(c_int,X19)),X0)) )
=> ! [X21: c_unique] :
( ( X21 = shift(c_sort(X18,X4),X13) )
=> ! [X22: $int] :
( ( $sum(X15,$uminus(1)) = X22 )
=> ( ( X22 != 0 )
=> ! [X23: $int] :
? [X24: c_ssorted] :
( ? [X25: $int] :
( ( X25 = offset(X24) )
& ( ( X23 = '%'(X20,X22) )
=> ( $less(X25,block_length(c_sort(type_alloc_table,X1),X24))
& ~ $less(X25,0) ) ) )
& ( X24 = c_sort(X18,X21) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(theory_normalization,[],[f101]) ).
tff(f156,plain,
~ ! [X3: c_unique,X1: c_unique,X0: $int,X4: $int,X2: $int] :
( ( valid_range(c_sort(type_alloc_table,X1),c_sort(type_pointer(type_global),X3),0,2800)
& ( 10000 = X2 )
& ( 0 = X4 )
& ( 2800 = X0 ) )
=> ! [X6: c_unique,X5: $int] :
( ( ! [X7: $int] :
? [X8: c_type] :
( ( X8 = type_pointer(type_global) )
& ( ( $less(X7,X5)
& ~ $less(X7,0) )
=> ( 2000 = ss2Int(c_sort(c_int,acc(c_sort(type_memory(c_int,type_global),X6),c_sort(X8,shift(c_sort(X8,X3),X7))))) ) ) )
& ~ $less(X5,0)
& ~ $less(2800,X5) )
=> ( ( 0 = $sum(X5,$uminus(X0)) )
=> ! [X9: $int] :
( ( ( '%'(X9,14) = 0 )
& ~ $less(X9,0)
& ~ $less(2800,X9) )
=> ! [X10: $int] :
( ( X10 = 0 )
=> ! [X11: $int] :
( ( X11 = $product(X9,2) )
=> ( ( X11 != 0 )
=> ! [X12: $int] :
( ( X12 = X9 )
=> ! [X13: $int,X16: $int,X15: $int,X14: c_unique] :
( ( ( $product(X15,2) = X16 )
& ~ $less(X15,1)
& ~ $less(X9,X15) )
=> ( ( 1 != 0 )
=> ! [X17: c_unique] :
? [X18: c_type] :
( ( ( shift(c_sort(X18,X3),X15) = X17 )
=> ( valid(c_sort(type_alloc_table,X1),c_sort(X18,X17))
=> ! [X19: c_unique] :
( ( acc(c_sort(type_memory(c_int,type_global),X14),c_sort(X18,X17)) = X19 )
=> ! [X20: $int] :
( ( $sum(X13,$product(ss2Int(c_sort(c_int,X19)),X2)) = X20 )
=> ! [X21: c_unique] :
( ( shift(c_sort(X18,X3),X15) = X21 )
=> ! [X22: $int] :
( ( $sum(X16,$uminus(1)) = X22 )
=> ( ( X22 != 0 )
=> ! [X23: $int] :
? [X24: c_ssorted] :
( ? [X25: $int] :
( ( X25 = offset(X24) )
& ( ( X23 = '%'(X20,X22) )
=> ( $less(X25,block_length(c_sort(type_alloc_table,X1),X24))
& ~ $less(X25,0) ) ) )
& ( X24 = c_sort(X18,X21) ) ) ) ) ) ) ) ) )
& ( X18 = type_pointer(type_global) ) ) ) ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f134]) ).
tff(f161,plain,
! [X2: c_type,X0: c_unique,X1: c_unique] :
? [X4: c_ssorted,X3: c_ssorted] :
( ( c_sort(type_alloc_table,X1) = X4 )
& ? [X5: $int] :
( ( ( ~ $less(X5,0)
& $less(X5,block_length(X4,X3)) )
<=> valid(X4,X3) )
& ( offset(X3) = X5 ) )
& ( c_sort(type_pointer(X2),X0) = X3 ) ),
inference(rectify,[],[f129]) ).
tff(f191,plain,
? [X3: c_unique,X1: c_unique,X0: $int,X4: $int,X2: $int] :
( ? [X6: c_unique,X5: $int] :
( ? [X9: $int] :
( ? [X10: $int] :
( ? [X11: $int] :
( ? [X12: $int] :
( ? [X13: $int,X16: $int,X15: $int,X14: c_unique] :
( ? [X17: c_unique] :
! [X18: c_type] :
( ( ? [X19: c_unique] :
( ? [X20: $int] :
( ? [X21: c_unique] :
( ? [X22: $int] :
( ? [X23: $int] :
! [X24: c_ssorted] :
( ! [X25: $int] :
( ( ( $less(X25,0)
| ~ $less(X25,block_length(c_sort(type_alloc_table,X1),X24)) )
& ( X23 = '%'(X20,X22) ) )
| ( offset(X24) != X25 ) )
| ( c_sort(X18,X21) != X24 ) )
& ( X22 != 0 )
& ( $sum(X16,$uminus(1)) = X22 ) )
& ( shift(c_sort(X18,X3),X15) = X21 ) )
& ( $sum(X13,$product(ss2Int(c_sort(c_int,X19)),X2)) = X20 ) )
& ( acc(c_sort(type_memory(c_int,type_global),X14),c_sort(X18,X17)) = X19 ) )
& valid(c_sort(type_alloc_table,X1),c_sort(X18,X17))
& ( shift(c_sort(X18,X3),X15) = X17 ) )
| ( type_pointer(type_global) != X18 ) )
& ( 1 != 0 )
& ( $product(X15,2) = X16 )
& ~ $less(X15,1)
& ~ $less(X9,X15) )
& ( X12 = X9 ) )
& ( X11 != 0 )
& ( X11 = $product(X9,2) ) )
& ( X10 = 0 ) )
& ( '%'(X9,14) = 0 )
& ~ $less(X9,0)
& ~ $less(2800,X9) )
& ( 0 = $sum(X5,$uminus(X0)) )
& ! [X7: $int] :
? [X8: c_type] :
( ( X8 = type_pointer(type_global) )
& ( ( 2000 = ss2Int(c_sort(c_int,acc(c_sort(type_memory(c_int,type_global),X6),c_sort(X8,shift(c_sort(X8,X3),X7))))) )
| ~ $less(X7,X5)
| $less(X7,0) ) )
& ~ $less(X5,0)
& ~ $less(2800,X5) )
& valid_range(c_sort(type_alloc_table,X1),c_sort(type_pointer(type_global),X3),0,2800)
& ( 10000 = X2 )
& ( 0 = X4 )
& ( 2800 = X0 ) ),
inference(ennf_transformation,[],[f156]) ).
tff(f192,plain,
? [X3: c_unique,X4: $int,X2: $int,X0: $int,X1: c_unique] :
( valid_range(c_sort(type_alloc_table,X1),c_sort(type_pointer(type_global),X3),0,2800)
& ( 0 = X4 )
& ( 2800 = X0 )
& ? [X5: $int,X6: c_unique] :
( ~ $less(2800,X5)
& ? [X9: $int] :
( ? [X10: $int] :
( ( X10 = 0 )
& ? [X11: $int] :
( ? [X12: $int] :
( ( X12 = X9 )
& ? [X14: c_unique,X13: $int,X16: $int,X15: $int] :
( ( 1 != 0 )
& ~ $less(X9,X15)
& ~ $less(X15,1)
& ( $product(X15,2) = X16 )
& ? [X17: c_unique] :
! [X18: c_type] :
( ( type_pointer(type_global) != X18 )
| ( ? [X19: c_unique] :
( ? [X20: $int] :
( ( $sum(X13,$product(ss2Int(c_sort(c_int,X19)),X2)) = X20 )
& ? [X21: c_unique] :
( ( shift(c_sort(X18,X3),X15) = X21 )
& ? [X22: $int] :
( ( X22 != 0 )
& ? [X23: $int] :
! [X24: c_ssorted] :
( ! [X25: $int] :
( ( ( $less(X25,0)
| ~ $less(X25,block_length(c_sort(type_alloc_table,X1),X24)) )
& ( X23 = '%'(X20,X22) ) )
| ( offset(X24) != X25 ) )
| ( c_sort(X18,X21) != X24 ) )
& ( $sum(X16,$uminus(1)) = X22 ) ) ) )
& ( acc(c_sort(type_memory(c_int,type_global),X14),c_sort(X18,X17)) = X19 ) )
& valid(c_sort(type_alloc_table,X1),c_sort(X18,X17))
& ( shift(c_sort(X18,X3),X15) = X17 ) ) ) ) )
& ( X11 != 0 )
& ( X11 = $product(X9,2) ) ) )
& ( '%'(X9,14) = 0 )
& ~ $less(2800,X9)
& ~ $less(X9,0) )
& ( 0 = $sum(X5,$uminus(X0)) )
& ~ $less(X5,0)
& ! [X7: $int] :
? [X8: c_type] :
( ( ~ $less(X7,X5)
| $less(X7,0)
| ( 2000 = ss2Int(c_sort(c_int,acc(c_sort(type_memory(c_int,type_global),X6),c_sort(X8,shift(c_sort(X8,X3),X7))))) ) )
& ( X8 = type_pointer(type_global) ) ) )
& ( 10000 = X2 ) ),
inference(flattening,[],[f191]) ).
tff(f218,definition,
! [X2: $int,X13: $int,X15: $int,X3: c_unique,X18: c_type,X1: c_unique,X16: $int,X17: c_unique,X14: c_unique] :
( ? [X19: c_unique] :
( ? [X20: $int] :
( ( $sum(X13,$product(ss2Int(c_sort(c_int,X19)),X2)) = X20 )
& ? [X21: c_unique] :
( ( shift(c_sort(X18,X3),X15) = X21 )
& ? [X22: $int] :
( ( X22 != 0 )
& ? [X23: $int] :
! [X24: c_ssorted] :
( ! [X25: $int] :
( ( ( $less(X25,0)
| ~ $less(X25,block_length(c_sort(type_alloc_table,X1),X24)) )
& ( X23 = '%'(X20,X22) ) )
| ( offset(X24) != X25 ) )
| ( c_sort(X18,X21) != X24 ) )
& ( $sum(X16,$uminus(1)) = X22 ) ) ) )
& ( acc(c_sort(type_memory(c_int,type_global),X14),c_sort(X18,X17)) = X19 ) )
| ~ sP0(X2,X13,X15,X3,X18,X1,X16,X17,X14) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
tff(f219,plain,
? [X3: c_unique,X4: $int,X2: $int,X0: $int,X1: c_unique] :
( valid_range(c_sort(type_alloc_table,X1),c_sort(type_pointer(type_global),X3),0,2800)
& ( 0 = X4 )
& ( 2800 = X0 )
& ? [X5: $int,X6: c_unique] :
( ~ $less(2800,X5)
& ? [X9: $int] :
( ? [X10: $int] :
( ( X10 = 0 )
& ? [X11: $int] :
( ? [X12: $int] :
( ( X12 = X9 )
& ? [X14: c_unique,X13: $int,X16: $int,X15: $int] :
( ( 1 != 0 )
& ~ $less(X9,X15)
& ~ $less(X15,1)
& ( $product(X15,2) = X16 )
& ? [X17: c_unique] :
! [X18: c_type] :
( ( type_pointer(type_global) != X18 )
| ( sP0(X2,X13,X15,X3,X18,X1,X16,X17,X14)
& valid(c_sort(type_alloc_table,X1),c_sort(X18,X17))
& ( shift(c_sort(X18,X3),X15) = X17 ) ) ) ) )
& ( X11 != 0 )
& ( X11 = $product(X9,2) ) ) )
& ( '%'(X9,14) = 0 )
& ~ $less(2800,X9)
& ~ $less(X9,0) )
& ( 0 = $sum(X5,$uminus(X0)) )
& ~ $less(X5,0)
& ! [X7: $int] :
? [X8: c_type] :
( ( ~ $less(X7,X5)
| $less(X7,0)
| ( 2000 = ss2Int(c_sort(c_int,acc(c_sort(type_memory(c_int,type_global),X6),c_sort(X8,shift(c_sort(X8,X3),X7))))) ) )
& ( X8 = type_pointer(type_global) ) ) )
& ( 10000 = X2 ) ),
inference(definition_folding,[],[f192,f218]) ).
tff(f255,plain,
! [X2: c_type,X0: c_unique,X1: c_unique] :
? [X4: c_ssorted,X3: c_ssorted] :
( ( c_sort(type_alloc_table,X1) = X4 )
& ? [X5: $int] :
( ( ( ~ $less(X5,0)
& $less(X5,block_length(X4,X3)) )
| ~ valid(X4,X3) )
& ( valid(X4,X3)
| $less(X5,0)
| ~ $less(X5,block_length(X4,X3)) )
& ( offset(X3) = X5 ) )
& ( c_sort(type_pointer(X2),X0) = X3 ) ),
inference(nnf_transformation,[],[f161]) ).
tff(f256,plain,
! [X2: c_type,X0: c_unique,X1: c_unique] :
? [X4: c_ssorted,X3: c_ssorted] :
( ( c_sort(type_alloc_table,X1) = X4 )
& ? [X5: $int] :
( ( ( ~ $less(X5,0)
& $less(X5,block_length(X4,X3)) )
| ~ valid(X4,X3) )
& ( valid(X4,X3)
| $less(X5,0)
| ~ $less(X5,block_length(X4,X3)) )
& ( offset(X3) = X5 ) )
& ( c_sort(type_pointer(X2),X0) = X3 ) ),
inference(flattening,[],[f255]) ).
tff(f257,plain,
! [X0: c_type,X1: c_unique,X2: c_unique] :
? [X3: c_ssorted,X4: c_ssorted] :
( ( c_sort(type_alloc_table,X2) = X3 )
& ? [X5: $int] :
( ( ( ~ $less(X5,0)
& $less(X5,block_length(X3,X4)) )
| ~ valid(X3,X4) )
& ( valid(X3,X4)
| $less(X5,0)
| ~ $less(X5,block_length(X3,X4)) )
& ( offset(X4) = X5 ) )
& ( c_sort(type_pointer(X0),X1) = X4 ) ),
inference(rectify,[],[f256]) ).
tff(f258,plain,
! [X0: c_type,X1: c_unique,X2: c_unique] :
( ( c_sort(type_alloc_table,X2) = sK29(X0,X1,X2) )
& ( ( ~ $less(sK31(X0,X1,X2),0)
& $less(sK31(X0,X1,X2),block_length(sK29(X0,X1,X2),sK30(X0,X1,X2))) )
| ~ valid(sK29(X0,X1,X2),sK30(X0,X1,X2)) )
& ( valid(sK29(X0,X1,X2),sK30(X0,X1,X2))
| $less(sK31(X0,X1,X2),0)
| ~ $less(sK31(X0,X1,X2),block_length(sK29(X0,X1,X2),sK30(X0,X1,X2))) )
& ( sK31(X0,X1,X2) = offset(sK30(X0,X1,X2)) )
& ( c_sort(type_pointer(X0),X1) = sK30(X0,X1,X2) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK29,sK30,sK31]),skolemize(X3,sK29(X0,X1,X2)),skolemize(X4,sK30(X0,X1,X2)),skolemize(X5,sK31(X0,X1,X2))],[f257]) ).
tff(f288,plain,
! [X2: $int,X13: $int,X15: $int,X3: c_unique,X18: c_type,X1: c_unique,X16: $int,X17: c_unique,X14: c_unique] :
( ? [X19: c_unique] :
( ? [X20: $int] :
( ( $sum(X13,$product(ss2Int(c_sort(c_int,X19)),X2)) = X20 )
& ? [X21: c_unique] :
( ( shift(c_sort(X18,X3),X15) = X21 )
& ? [X22: $int] :
( ( X22 != 0 )
& ? [X23: $int] :
! [X24: c_ssorted] :
( ! [X25: $int] :
( ( ( $less(X25,0)
| ~ $less(X25,block_length(c_sort(type_alloc_table,X1),X24)) )
& ( X23 = '%'(X20,X22) ) )
| ( offset(X24) != X25 ) )
| ( c_sort(X18,X21) != X24 ) )
& ( $sum(X16,$uminus(1)) = X22 ) ) ) )
& ( acc(c_sort(type_memory(c_int,type_global),X14),c_sort(X18,X17)) = X19 ) )
| ~ sP0(X2,X13,X15,X3,X18,X1,X16,X17,X14) ),
inference(nnf_transformation,[],[f218]) ).
tff(f289,plain,
! [X0: $int,X1: $int,X2: $int,X3: c_unique,X4: c_type,X5: c_unique,X6: $int,X7: c_unique,X8: c_unique] :
( ? [X9: c_unique] :
( ? [X10: $int] :
( ( $sum(X1,$product(ss2Int(c_sort(c_int,X9)),X0)) = X10 )
& ? [X11: c_unique] :
( ( shift(c_sort(X4,X3),X2) = X11 )
& ? [X12: $int] :
( ( 0 != X12 )
& ? [X13: $int] :
! [X14: c_ssorted] :
( ! [X15: $int] :
( ( ( $less(X15,0)
| ~ $less(X15,block_length(c_sort(type_alloc_table,X5),X14)) )
& ( '%'(X10,X12) = X13 ) )
| ( offset(X14) != X15 ) )
| ( c_sort(X4,X11) != X14 ) )
& ( $sum(X6,$uminus(1)) = X12 ) ) ) )
& ( acc(c_sort(type_memory(c_int,type_global),X8),c_sort(X4,X7)) = X9 ) )
| ~ sP0(X0,X1,X2,X3,X4,X5,X6,X7,X8) ),
inference(rectify,[],[f288]) ).
tff(f290,plain,
! [X0: $int,X1: $int,X2: $int,X3: c_unique,X4: c_type,X5: c_unique,X6: $int,X7: c_unique,X8: c_unique] :
( ( ( sK69(X0,X1,X2,X3,X4,X5,X6,X7,X8) = $sum(X1,$product(ss2Int(c_sort(c_int,sK68(X0,X1,X2,X3,X4,X5,X6,X7,X8))),X0)) )
& ( shift(c_sort(X4,X3),X2) = sK70(X0,X1,X2,X3,X4,X5,X6,X7,X8) )
& ( 0 != sK71(X0,X1,X2,X3,X4,X5,X6,X7,X8) )
& ! [X14: c_ssorted] :
( ! [X15: $int] :
( ( ( $less(X15,0)
| ~ $less(X15,block_length(c_sort(type_alloc_table,X5),X14)) )
& ( sK72(X0,X1,X2,X3,X4,X5,X6,X7,X8) = '%'(sK69(X0,X1,X2,X3,X4,X5,X6,X7,X8),sK71(X0,X1,X2,X3,X4,X5,X6,X7,X8)) ) )
| ( offset(X14) != X15 ) )
| ( c_sort(X4,sK70(X0,X1,X2,X3,X4,X5,X6,X7,X8)) != X14 ) )
& ( sK71(X0,X1,X2,X3,X4,X5,X6,X7,X8) = $sum(X6,$uminus(1)) )
& ( acc(c_sort(type_memory(c_int,type_global),X8),c_sort(X4,X7)) = sK68(X0,X1,X2,X3,X4,X5,X6,X7,X8) ) )
| ~ sP0(X0,X1,X2,X3,X4,X5,X6,X7,X8) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK68,sK69,sK70,sK71,sK72]),skolemize(X9,sK68(X0,X1,X2,X3,X4,X5,X6,X7,X8)),skolemize(X10,sK69(X0,X1,X2,X3,X4,X5,X6,X7,X8)),skolemize(X11,sK70(X0,X1,X2,X3,X4,X5,X6,X7,X8)),skolemize(X12,sK71(X0,X1,X2,X3,X4,X5,X6,X7,X8)),skolemize(X13,sK72(X0,X1,X2,X3,X4,X5,X6,X7,X8))],[f289]) ).
tff(f291,plain,
? [X0: c_unique,X1: $int,X2: $int,X3: $int,X4: c_unique] :
( valid_range(c_sort(type_alloc_table,X4),c_sort(type_pointer(type_global),X0),0,2800)
& ( 0 = X1 )
& ( 2800 = X3 )
& ? [X5: $int,X6: c_unique] :
( ~ $less(2800,X5)
& ? [X7: $int] :
( ? [X8: $int] :
( ( 0 = X8 )
& ? [X9: $int] :
( ? [X10: $int] :
( ( X7 = X10 )
& ? [X11: c_unique,X12: $int,X13: $int,X14: $int] :
( ( 1 != 0 )
& ~ $less(X7,X14)
& ~ $less(X14,1)
& ( $product(X14,2) = X13 )
& ? [X15: c_unique] :
! [X16: c_type] :
( ( type_pointer(type_global) != X16 )
| ( sP0(X2,X12,X14,X0,X16,X4,X13,X15,X11)
& valid(c_sort(type_alloc_table,X4),c_sort(X16,X15))
& ( shift(c_sort(X16,X0),X14) = X15 ) ) ) ) )
& ( 0 != X9 )
& ( $product(X7,2) = X9 ) ) )
& ( 0 = '%'(X7,14) )
& ~ $less(2800,X7)
& ~ $less(X7,0) )
& ( 0 = $sum(X5,$uminus(X3)) )
& ~ $less(X5,0)
& ! [X17: $int] :
? [X18: c_type] :
( ( ~ $less(X17,X5)
| $less(X17,0)
| ( 2000 = ss2Int(c_sort(c_int,acc(c_sort(type_memory(c_int,type_global),X6),c_sort(X18,shift(c_sort(X18,X0),X17))))) ) )
& ( type_pointer(type_global) = X18 ) ) )
& ( 10000 = X2 ) ),
inference(rectify,[],[f219]) ).
tff(f292,plain,
( valid_range(c_sort(type_alloc_table,sK77),c_sort(type_pointer(type_global),sK73),0,2800)
& ( 0 = sK74 )
& ( 2800 = sK76 )
& ~ $less(2800,sK78)
& ( 0 = sK81 )
& ( sK83 = sK80 )
& ( 1 != 0 )
& ~ $less(sK80,sK87)
& ~ $less(sK87,1)
& ( $product(sK87,2) = sK86 )
& ! [X16: c_type] :
( ( type_pointer(type_global) != X16 )
| ( sP0(sK75,sK85,sK87,sK73,X16,sK77,sK86,sK88,sK84)
& valid(c_sort(type_alloc_table,sK77),c_sort(X16,sK88))
& ( sK88 = shift(c_sort(X16,sK73),sK87) ) ) )
& ( 0 != sK82 )
& ( sK82 = $product(sK80,2) )
& ( 0 = '%'(sK80,14) )
& ~ $less(2800,sK80)
& ~ $less(sK80,0)
& ( 0 = $sum(sK78,$uminus(sK76)) )
& ~ $less(sK78,0)
& ! [X17: $int] :
( ( ~ $less(X17,sK78)
| $less(X17,0)
| ( 2000 = ss2Int(c_sort(c_int,acc(c_sort(type_memory(c_int,type_global),sK79),c_sort(sK89(X17),shift(c_sort(sK89(X17),sK73),X17))))) ) )
& ( type_pointer(type_global) = sK89(X17) ) )
& ( 10000 = sK75 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK73,sK74,sK75,sK76,sK77,sK78,sK79,sK80,sK81,sK82,sK83,sK84,sK85,sK86,sK87,sK88,sK89]),skolemize(X0,sK73),skolemize(X1,sK74),skolemize(X2,sK75),skolemize(X3,sK76),skolemize(X4,sK77),skolemize(X5,sK78),skolemize(X6,sK79),skolemize(X7,sK80),skolemize(X8,sK81),skolemize(X9,sK82),skolemize(X10,sK83),skolemize(X11,sK84),skolemize(X12,sK85),skolemize(X13,sK86),skolemize(X14,sK87),skolemize(X15,sK88),skolemize(X18,sK89(X17))],[f291]) ).
tff(f370,plain,
! [X2: c_unique,X0: c_type,X1: c_unique] : ( c_sort(type_pointer(X0),X1) = sK30(X0,X1,X2) ),
inference(cnf_transformation,[],[f258]) ).
tff(f371,plain,
! [X2: c_unique,X0: c_type,X1: c_unique] : ( sK31(X0,X1,X2) = offset(sK30(X0,X1,X2)) ),
inference(cnf_transformation,[],[f258]) ).
tff(f373,plain,
! [X2: c_unique,X0: c_type,X1: c_unique] :
( $less(sK31(X0,X1,X2),block_length(sK29(X0,X1,X2),sK30(X0,X1,X2)))
| ~ valid(sK29(X0,X1,X2),sK30(X0,X1,X2)) ),
inference(cnf_transformation,[],[f258]) ).
tff(f374,plain,
! [X2: c_unique,X0: c_type,X1: c_unique] :
( ~ $less(sK31(X0,X1,X2),0)
| ~ valid(sK29(X0,X1,X2),sK30(X0,X1,X2)) ),
inference(cnf_transformation,[],[f258]) ).
tff(f375,plain,
! [X2: c_unique,X0: c_type,X1: c_unique] : ( c_sort(type_alloc_table,X2) = sK29(X0,X1,X2) ),
inference(cnf_transformation,[],[f258]) ).
tff(f436,plain,
! [X2: $int,X3: c_unique,X0: $int,X1: $int,X8: c_unique,X6: $int,X7: c_unique,X14: c_ssorted,X4: c_type,X15: $int,X5: c_unique] :
( $less(X15,0)
| ~ $less(X15,block_length(c_sort(type_alloc_table,X5),X14))
| ( offset(X14) != X15 )
| ( c_sort(X4,sK70(X0,X1,X2,X3,X4,X5,X6,X7,X8)) != X14 )
| ~ sP0(X0,X1,X2,X3,X4,X5,X6,X7,X8) ),
inference(cnf_transformation,[],[f290]) ).
tff(f438,plain,
! [X2: $int,X3: c_unique,X0: $int,X1: $int,X8: c_unique,X6: $int,X7: c_unique,X4: c_type,X5: c_unique] :
( ~ sP0(X0,X1,X2,X3,X4,X5,X6,X7,X8)
| ( shift(c_sort(X4,X3),X2) = sK70(X0,X1,X2,X3,X4,X5,X6,X7,X8) ) ),
inference(cnf_transformation,[],[f290]) ).
tff(f440,plain,
10000 = sK75,
inference(cnf_transformation,[],[f292]) ).
tff(f450,plain,
! [X16: c_type] :
( ( type_pointer(type_global) != X16 )
| ( sK88 = shift(c_sort(X16,sK73),sK87) ) ),
inference(cnf_transformation,[],[f292]) ).
tff(f451,plain,
! [X16: c_type] :
( ( type_pointer(type_global) != X16 )
| valid(c_sort(type_alloc_table,sK77),c_sort(X16,sK88)) ),
inference(cnf_transformation,[],[f292]) ).
tff(f452,plain,
! [X16: c_type] :
( ( type_pointer(type_global) != X16 )
| sP0(sK75,sK85,sK87,sK73,X16,sK77,sK86,sK88,sK84) ),
inference(cnf_transformation,[],[f292]) ).
tff(f453,plain,
$product(sK87,2) = sK86,
inference(cnf_transformation,[],[f292]) ).
tff(f508,plain,
! [X2: c_unique,X0: c_type,X1: c_unique] : ( sK31(X0,X1,X2) = offset(c_sort(type_pointer(X0),X1)) ),
inference(definition_unfolding,[],[f371,f370]) ).
tff(f541,plain,
! [X2: c_unique,X0: c_type,X1: c_unique] :
( ~ valid(c_sort(type_alloc_table,X2),c_sort(type_pointer(X0),X1))
| ~ $less(offset(c_sort(type_pointer(X0),X1)),0) ),
inference(definition_unfolding,[],[f374,f508,f375,f370]) ).
tff(f542,plain,
! [X2: c_unique,X0: c_type,X1: c_unique] :
( ~ valid(c_sort(type_alloc_table,X2),c_sort(type_pointer(X0),X1))
| $less(offset(c_sort(type_pointer(X0),X1)),block_length(c_sort(type_alloc_table,X2),c_sort(type_pointer(X0),X1))) ),
inference(definition_unfolding,[],[f373,f508,f375,f370,f375,f370]) ).
tff(f559,plain,
! [X16: c_type] :
( ( type_pointer(type_global) != X16 )
| sP0(10000,sK85,sK87,sK73,X16,sK77,sK86,sK88,sK84) ),
inference(definition_unfolding,[],[f452,f440]) ).
tff(f579,plain,
! [X2: $int,X3: c_unique,X0: $int,X1: $int,X8: c_unique,X6: $int,X7: c_unique,X14: c_ssorted,X4: c_type,X5: c_unique] :
( $less(offset(X14),0)
| ~ $less(offset(X14),block_length(c_sort(type_alloc_table,X5),X14))
| ( c_sort(X4,sK70(X0,X1,X2,X3,X4,X5,X6,X7,X8)) != X14 )
| ~ sP0(X0,X1,X2,X3,X4,X5,X6,X7,X8) ),
inference(equality_resolution,[],[f436]) ).
tff(f580,plain,
! [X2: $int,X3: c_unique,X0: $int,X1: $int,X8: c_unique,X6: $int,X7: c_unique,X4: c_type,X5: c_unique] :
( ~ $less(offset(c_sort(X4,sK70(X0,X1,X2,X3,X4,X5,X6,X7,X8))),block_length(c_sort(type_alloc_table,X5),c_sort(X4,sK70(X0,X1,X2,X3,X4,X5,X6,X7,X8))))
| $less(offset(c_sort(X4,sK70(X0,X1,X2,X3,X4,X5,X6,X7,X8))),0)
| ~ sP0(X0,X1,X2,X3,X4,X5,X6,X7,X8) ),
inference(equality_resolution,[],[f579]) ).
tff(f583,plain,
sP0(10000,sK85,sK87,sK73,type_pointer(type_global),sK77,sK86,sK88,sK84),
inference(equality_resolution,[],[f559]) ).
tff(f584,plain,
valid(c_sort(type_alloc_table,sK77),c_sort(type_pointer(type_global),sK88)),
inference(equality_resolution,[],[f451]) ).
tff(f585,plain,
shift(c_sort(type_pointer(type_global),sK73),sK87) = sK88,
inference(equality_resolution,[],[f450]) ).
tff(f660,plain,
valid(c_sort(type_alloc_table,sK77),c_sort(type_pointer(type_global),shift(c_sort(type_pointer(type_global),sK73),sK87))),
inference(superposition,[],[f584,f585]) ).
tff(f663,plain,
sP0(10000,sK85,sK87,sK73,type_pointer(type_global),sK77,sK86,shift(c_sort(type_pointer(type_global),sK73),sK87),sK84),
inference(forward_demodulation,[],[f583,f585]) ).
tff(f664,plain,
sP0(10000,sK85,sK87,sK73,type_pointer(type_global),sK77,$product(sK87,2),shift(c_sort(type_pointer(type_global),sK73),sK87),sK84),
inference(forward_demodulation,[],[f663,f453]) ).
tff(f678,plain,
shift(c_sort(type_pointer(type_global),sK73),sK87) = sK70(10000,sK85,sK87,sK73,type_pointer(type_global),sK77,$product(sK87,2),shift(c_sort(type_pointer(type_global),sK73),sK87),sK84),
inference(resolution,[],[f664,f438]) ).
tff(f715,plain,
( ~ $less(offset(c_sort(type_pointer(type_global),shift(c_sort(type_pointer(type_global),sK73),sK87))),block_length(c_sort(type_alloc_table,sK77),c_sort(type_pointer(type_global),shift(c_sort(type_pointer(type_global),sK73),sK87))))
| ~ sP0(10000,sK85,sK87,sK73,type_pointer(type_global),sK77,$product(sK87,2),shift(c_sort(type_pointer(type_global),sK73),sK87),sK84)
| $less(offset(c_sort(type_pointer(type_global),shift(c_sort(type_pointer(type_global),sK73),sK87))),0) ),
inference(superposition,[],[f580,f678]) ).
tff(f716,plain,
( $less(offset(c_sort(type_pointer(type_global),shift(c_sort(type_pointer(type_global),sK73),sK87))),0)
| ~ $less(offset(c_sort(type_pointer(type_global),shift(c_sort(type_pointer(type_global),sK73),sK87))),block_length(c_sort(type_alloc_table,sK77),c_sort(type_pointer(type_global),shift(c_sort(type_pointer(type_global),sK73),sK87)))) ),
inference(forward_subsumption_resolution,[],[f715,f664]) ).
tff(f718,definition,
( spl104_3
<=> $less(offset(c_sort(type_pointer(type_global),shift(c_sort(type_pointer(type_global),sK73),sK87))),block_length(c_sort(type_alloc_table,sK77),c_sort(type_pointer(type_global),shift(c_sort(type_pointer(type_global),sK73),sK87)))) ),
introduced(definition,[new_symbols(definition,[spl104_3])],[avatar_definition]) ).
tff(f720,plain,
( ~ $less(offset(c_sort(type_pointer(type_global),shift(c_sort(type_pointer(type_global),sK73),sK87))),block_length(c_sort(type_alloc_table,sK77),c_sort(type_pointer(type_global),shift(c_sort(type_pointer(type_global),sK73),sK87))))
| spl104_3 ),
inference(avatar_component_clause,[],[f718]) ).
tff(f722,definition,
( spl104_4
<=> $less(offset(c_sort(type_pointer(type_global),shift(c_sort(type_pointer(type_global),sK73),sK87))),0) ),
introduced(definition,[new_symbols(definition,[spl104_4])],[avatar_definition]) ).
tff(f725,plain,
( ~ spl104_3
| spl104_4 ),
inference(avatar_split_clause,[],[f716,f722,f718]) ).
tff(f1485,plain,
~ $less(offset(c_sort(type_pointer(type_global),shift(c_sort(type_pointer(type_global),sK73),sK87))),0),
inference(resolution,[],[f541,f660]) ).
tff(f1487,plain,
~ spl104_4,
inference(avatar_split_clause,[],[f1485,f722]) ).
tff(f1814,plain,
$less(offset(c_sort(type_pointer(type_global),sK88)),block_length(c_sort(type_alloc_table,sK77),c_sort(type_pointer(type_global),sK88))),
inference(resolution,[],[f542,f584]) ).
tff(f1816,plain,
$less(offset(c_sort(type_pointer(type_global),shift(c_sort(type_pointer(type_global),sK73),sK87))),block_length(c_sort(type_alloc_table,sK77),c_sort(type_pointer(type_global),shift(c_sort(type_pointer(type_global),sK73),sK87)))),
inference(forward_demodulation,[],[f1814,f585]) ).
tff(f1819,plain,
( $false
| spl104_3 ),
inference(forward_subsumption_resolution,[],[f1816,f720]) ).
tff(f1820,plain,
spl104_3,
inference(avatar_contradiction_clause,[],[f1819]) ).
cnf(s2,plain,
( ~ spl104_3
| spl104_4 ),
inference(sat_conversion,[],[f725]) ).
cnf(s29,plain,
~ spl104_4,
inference(sat_conversion,[],[f1487]) ).
cnf(s32,plain,
spl104_3,
inference(sat_conversion,[],[f1820]) ).
cnf(s35,plain,
$false,
inference(rat,[],[s2,s29,s32]) ).
tff(f1821,plain,
$false,
inference(avatar_sat_refutation,[],[s35]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWW820_1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.19 % Computer : n004.cluster.edu
% 0.10/0.19 % Model : x86_64 x86_64
% 0.10/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.19 % Memory : 8046.5625MB
% 0.10/0.19 % OS : Linux 6.8.0-71-generic
% 0.10/0.19 % CPULimit : 300
% 0.10/0.19 % WCLimit : 300
% 0.10/0.19 % DateTime : Mon Sep 28 14:30:52 UTC 2026
% 0.10/0.19 % CPUTime :
% 0.10/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.23 Running first-order theorem proving
% 0.10/0.23 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
% 5.59/1.56 % (394289)Detected arithmetic, will pick strategies from an ALASCA-aware ARI schedule.
% 5.59/1.56 % (394435)lrs+10_1_tgt=ground:sas=z3:si=on:random_seed=2655816247:i=33:rtra=on_2999 on theBenchmark for (2999ds/33Mi)
% 5.59/1.56 % (394432)lrs+1002_4:1_to=lpo:sil=64000:si=on:br=off:random_seed=2324946293:s2a=on:i=7:rtra=on:inst=on_2999 on theBenchmark for (2999ds/7Mi)
% 5.59/1.56 % (394432)Instruction limit reached!
% 5.59/1.56 % (394432)------------------------------
% 5.59/1.56 % (394432)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.59/1.56 % (394432)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.59/1.56 % (394432)CaDiCaL version: 2.1.3
% 5.59/1.56 % (394432)Termination reason: Instruction limit
% 5.59/1.56 % (394432)Termination phase: shuffling
% 5.59/1.56 % (394432)Time elapsed: 0.005 s
% 5.59/1.56 % (394432)Peak memory usage: 86 MB
% 5.59/1.56 % (394432)Instructions burned: 8 (million)
% 5.59/1.56 % (394435)Instruction limit reached!
% 5.59/1.56 % (394435)------------------------------
% 5.59/1.56 % (394435)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.59/1.56 % (394435)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.59/1.56 % (394435)CaDiCaL version: 2.1.3
% 5.59/1.56 % (394435)Termination reason: Instruction limit
% 5.59/1.56 % (394435)Termination phase: Saturation
% 5.59/1.56 % (394435)Time elapsed: 0.029 s
% 5.59/1.56 % (394435)Peak memory usage: 103 MB
% 5.59/1.56 % (394435)Instructions burned: 33 (million)
% 5.59/1.56 % (394429)dis+1002_16:1_to=lpo:sil=64000:sas=z3:si=on:norm_ineq=on:gve=force:uwa=one_side_constant:random_seed=278640110:i=12:doe=on:rtra=on:gtg=exists_top:ss=axioms_2999 on theBenchmark for (2999ds/12Mi)
% 5.59/1.56 % (394430)dis+1002_1_to=kbo:sil=128000:tgt=ground:sas=z3:si=on:spb=units:tha=off:random_seed=2893459989:i=307:kws=precedence:nm=0:rtra=on_2999 on theBenchmark for (2999ds/307Mi)
% 5.59/1.56 % (394431)dis+10_3_slsqr=1,4:to=lpo:sil=128000:thi=strong:si=on:uwa=off:s2agt=20:slsqc=1:slsq=on:random_seed=1393945706:i=201:slsql=off:asg=cautious:rtra=on:gtg=all:ss=axioms:sgt=16_2999 on theBenchmark for (2999ds/201Mi)
% 5.59/1.56 % (394434)lrs+10_1_to=lpo:sas=z3:si=on:tha=off:random_seed=3620900431:i=46:rtra=on_2999 on theBenchmark for (2999ds/46Mi)
% 5.59/1.56 % (394433)dis+21_64_to=kbo:sil=128000:si=on:sp=weighted_frequency:uwa=alasca_can_abstract:random_seed=2339659570:i=4:rtra=on_2999 on theBenchmark for (2999ds/4Mi)
% 5.59/1.56 % (394433)Instruction limit reached!
% 5.59/1.56 % (394433)------------------------------
% 5.59/1.56 % (394433)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.59/1.56 % (394433)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.59/1.56 % (394433)CaDiCaL version: 2.1.3
% 5.59/1.56 % (394433)Termination reason: Instruction limit
% 5.59/1.56 % (394433)Termination phase: Property scanning
% 5.59/1.56 % (394433)Time elapsed: 0.004 s
% 5.59/1.56 % (394433)Peak memory usage: 85 MB
% 5.59/1.56 % (394433)Instructions burned: 4 (million)
% 5.59/1.56 % (394429)Instruction limit reached!
% 5.59/1.56 % (394429)------------------------------
% 5.59/1.56 % (394429)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.59/1.56 % (394429)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.59/1.56 % (394429)CaDiCaL version: 2.1.3
% 5.59/1.56 % (394429)Termination reason: Instruction limit
% 5.59/1.56 % (394429)Termination phase: Clausification
% 5.59/1.56 % (394429)Time elapsed: 0.012 s
% 5.59/1.56 % (394429)Peak memory usage: 86 MB
% 5.59/1.56 % (394429)Instructions burned: 12 (million)
% 5.59/1.56 % (394434)Instruction limit reached!
% 5.59/1.56 % (394434)------------------------------
% 5.59/1.56 % (394434)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.59/1.56 % (394434)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.59/1.56 % (394434)CaDiCaL version: 2.1.3
% 5.59/1.56 % (394434)Termination reason: Instruction limit
% 5.59/1.56 % (394434)Termination phase: Saturation
% 5.59/1.56 % (394434)Time elapsed: 0.073 s
% 5.59/1.56 % (394434)Peak memory usage: 115 MB
% 5.59/1.56 % (394434)Instructions burned: 46 (million)
% 5.59/1.56 % (394431)First to succeed.
% 5.59/1.56 % (394451)dis+1011_2:1_to=kbo:sil=128000:tgt=full:fde=none:si=on:norm_ineq=on:spb=goal_then_units:tha=some:nwc=2:sac=on:random_seed=2718069546:i=29:thsqd=64:nm=0:thsqc=8:rtra=on:thsq=on:ev=off_2997 on theBenchmark for (2997ds/29Mi)
% 5.59/1.56 % (394431)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-394289"
% 5.59/1.56 % (394451)Instruction limit reached!
% 5.59/1.56 % (394451)------------------------------
% 5.59/1.56 % (394451)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.59/1.56 % (394451)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.59/1.56 % (394451)CaDiCaL version: 2.1.3
% 5.59/1.56 % (394451)Termination reason: Instruction limit
% 5.59/1.56 % (394451)Termination phase: Saturation
% 5.59/1.56 % (394451)Time elapsed: 0.015 s
% 5.59/1.56 % (394451)Peak memory usage: 88 MB
% 5.59/1.56 % (394451)Instructions burned: 29 (million)
% 5.59/1.56 % (394430)Also succeeded, but the first one will report.
% 5.59/1.56 % (394450)dis+11_3_anc=none:drc=ordering:si=on:urr=ec_only:bce=on:tha=off:sac=on:random_seed=701683356:st=5:i=14:sd=10:rtra=on:ss=axioms:rawr=on_2997 on theBenchmark for (2997ds/14Mi)
% 5.59/1.56 % (394450)Refutation not found, incomplete strategy
% 5.59/1.56 % (394450)------------------------------
% 5.59/1.56 % (394450)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.59/1.56 % (394450)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.59/1.56 % (394450)CaDiCaL version: 2.1.3
% 5.59/1.56 % (394450)Termination reason: Refutation not found, incomplete strategy
% 5.59/1.56 % (394450)Time elapsed: 0.005 s
% 5.59/1.56 % (394450)Peak memory usage: 88 MB
% 5.59/1.56 % (394450)Instructions burned: 4 (million)
% 5.59/1.56 % (394457)ott+21_1024_to=lakbo:sil=128000:bsd=on:si=on:alasca=on:uwa=alasca_main:nwc=0.5:random_seed=1508629203:cond=on:i=16:fgj=on:ep=RS:asg=force:nm=10:rtra=on:rawr=on_2997 on theBenchmark for (2997ds/16Mi)
% 5.59/1.56 % (394457)Instruction limit reached!
% 5.59/1.56 % (394457)------------------------------
% 5.59/1.56 % (394457)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.59/1.56 % (394457)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.59/1.56 % (394457)CaDiCaL version: 2.1.3
% 5.59/1.56 % (394457)Termination reason: Instruction limit
% 5.59/1.56 % (394457)Termination phase: Property scanning
% 5.59/1.56 % (394457)Time elapsed: 0.017 s
% 5.59/1.56 % (394457)Peak memory usage: 87 MB
% 5.59/1.56 % (394457)Instructions burned: 17 (million)
% 5.59/1.56 % (394458)dis+1011_1_prc=on:drc=off:si=on:sac=on:random_seed=3859707393:i=24:canc=force:rtra=on_2997 on theBenchmark for (2997ds/24Mi)
% 5.59/1.56 % (394459)ott+1010_8_to=lpo:sil=128000:si=on:norm_ineq=on:sp=unary_frequency:sos=on:gve=cautious:spb=goal_then_units:uwa=alasca_main_floor:tha=some:random_seed=1541069298:i=27:canc=cautious:fsr=off:rtra=on_2996 on theBenchmark for (2996ds/27Mi)
% 5.59/1.56 % (394458)Instruction limit reached!
% 5.59/1.56 % (394458)------------------------------
% 5.59/1.56 % (394458)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.59/1.56 % (394458)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.59/1.56 % (394458)CaDiCaL version: 2.1.3
% 5.59/1.56 % (394458)Termination reason: Instruction limit
% 5.59/1.56 % (394458)Termination phase: Property scanning
% 5.59/1.56 % (394458)Time elapsed: 0.024 s
% 5.59/1.56 % (394458)Peak memory usage: 87 MB
% 5.59/1.56 % (394458)Instructions burned: 25 (million)
% 5.59/1.56 % (394459)Instruction limit reached!
% 5.59/1.56 % (394459)------------------------------
% 5.59/1.56 % (394459)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.59/1.56 % (394459)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.59/1.56 % (394459)CaDiCaL version: 2.1.3
% 5.59/1.56 % (394459)Termination reason: Instruction limit
% 5.59/1.56 % (394459)Termination phase: Property scanning
% 5.59/1.56 % (394459)Time elapsed: 0.026 s
% 5.59/1.56 % (394459)Peak memory usage: 87 MB
% 5.59/1.56 % (394459)Instructions burned: 27 (million)
% 5.59/1.56 % (394461)dis+1002_24_to=kbo:sil=128000:si=on:random_seed=2195321351:i=85:gtgl=4:rtra=on:gtg=exists_sym_2995 on theBenchmark for (2995ds/85Mi)
% 5.59/1.56 % (394461)Instruction limit reached!
% 5.59/1.56 % (394461)------------------------------
% 5.59/1.56 % (394461)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.59/1.56 % (394461)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.59/1.56 % (394461)CaDiCaL version: 2.1.3
% 5.59/1.56 % (394461)Termination reason: Instruction limit
% 5.59/1.56 % (394461)Termination phase: Saturation
% 5.59/1.56 % (394461)Time elapsed: 0.044 s
% 5.59/1.56 % (394461)Peak memory usage: 90 MB
% 5.59/1.56 % (394461)Instructions burned: 86 (million)
% 5.59/1.56 % (394473)dis+1010_1_to=kbo:sil=128000:tgt=full:si=on:tha=off:random_seed=1061549846:i=181:rtra=on:ss=axioms:ev=cautious_2994 on theBenchmark for (2994ds/181Mi)
% 5.59/1.56 % (394469)ott+1002_1_si=on:sp=occurrence:spb=goal:lcm=predicate:random_seed=4207890062:i=2:bd=preordered:nm=2:ins=3:rtra=on:inst=on:tar=off_2994 on theBenchmark for (2994ds/2Mi)
% 5.59/1.56 % (394469)Instruction limit reached!
% 5.59/1.56 % (394469)------------------------------
% 5.59/1.56 % (394469)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.59/1.56 % (394469)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.59/1.56 % (394469)CaDiCaL version: 2.1.3
% 5.59/1.56 % (394469)Termination reason: Instruction limit
% 5.59/1.56 % (394469)Termination phase: Property scanning
% 5.59/1.56 % (394469)Time elapsed: 0.003 s
% 5.59/1.56 % (394469)Peak memory usage: 85 MB
% 5.59/1.56 % (394469)Instructions burned: 3 (million)
% 5.59/1.56 % (394473)Refutation not found, incomplete strategy
% 5.59/1.56 % (394473)------------------------------
% 5.59/1.56 % (394473)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.59/1.56 % (394473)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.59/1.56 % (394473)CaDiCaL version: 2.1.3
% 5.59/1.56 % (394473)Termination reason: Refutation not found, incomplete strategy
% 5.59/1.56 % (394473)Time elapsed: 0.005 s
% 5.59/1.56 % (394473)Peak memory usage: 88 MB
% 5.59/1.56 % (394473)Instructions burned: 3 (million)
% 5.59/1.56 % (394431)Refutation found. Thanks to Tanya!
% 5.59/1.56 % SZS status Unsatisfiable for theBenchmark
% 5.59/1.56 % SZS output start Proof for theBenchmark
% See solution above
% 6.73/1.85 % (394431)------------------------------
% 6.73/1.85 % (394431)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.73/1.85 % (394431)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.73/1.85 % (394431)CaDiCaL version: 2.1.3
% 6.73/1.85 % (394431)Termination reason: Refutation
% 6.73/1.85 % (394431)Time elapsed: 0.169 s
% 6.73/1.85 % (394431)Peak memory usage: 119 MB
% 6.73/1.85 % (394431)Instructions burned: 117 (million)
% 6.73/1.85 % (394431)------------------------------
% 6.73/1.85 % (394431)------------------------------
% 6.73/1.85 % (394289)Success in time 0.858 s
% 6.73/1.85 % Vampire exiting
%------------------------------------------------------------------------------