TSTP Solution File: SYN425-1 by iProver-SAT---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver-SAT---3.8
% Problem : SYN425-1 : TPTP v8.1.2. Released v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d SAT
% Computer : n001.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 1 03:16:50 EDT 2023
% Result : Satisfiable 6.39s 1.64s
% Output : Model 6.39s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
%------ Positive definition of c10_0
fof(lit_def,axiom,
( c10_0
<=> $true ) ).
%------ Positive definition of ssSkC32
fof(lit_def_001,axiom,
( ssSkC32
<=> $true ) ).
%------ Positive definition of ssSkC27
fof(lit_def_002,axiom,
( ssSkC27
<=> $false ) ).
%------ Positive definition of ssSkC19
fof(lit_def_003,axiom,
( ssSkC19
<=> $true ) ).
%------ Positive definition of c2_0
fof(lit_def_004,axiom,
( c2_0
<=> $false ) ).
%------ Positive definition of c1_0
fof(lit_def_005,axiom,
( c1_0
<=> $true ) ).
%------ Positive definition of ssSkC31
fof(lit_def_006,axiom,
( ssSkC31
<=> $true ) ).
%------ Positive definition of ssSkC29
fof(lit_def_007,axiom,
( ssSkC29
<=> $false ) ).
%------ Positive definition of ssSkC28
fof(lit_def_008,axiom,
( ssSkC28
<=> $true ) ).
%------ Positive definition of ssSkC26
fof(lit_def_009,axiom,
( ssSkC26
<=> $false ) ).
%------ Positive definition of ssSkC24
fof(lit_def_010,axiom,
( ssSkC24
<=> $true ) ).
%------ Positive definition of ssSkC22
fof(lit_def_011,axiom,
( ssSkC22
<=> $false ) ).
%------ Positive definition of ssSkC20
fof(lit_def_012,axiom,
( ssSkC20
<=> $true ) ).
%------ Positive definition of ssSkC18
fof(lit_def_013,axiom,
( ssSkC18
<=> $true ) ).
%------ Positive definition of ssSkC17
fof(lit_def_014,axiom,
( ssSkC17
<=> $true ) ).
%------ Positive definition of ssSkC15
fof(lit_def_015,axiom,
( ssSkC15
<=> $true ) ).
%------ Positive definition of ssSkC11
fof(lit_def_016,axiom,
( ssSkC11
<=> $true ) ).
%------ Positive definition of ssSkC10
fof(lit_def_017,axiom,
( ssSkC10
<=> $true ) ).
%------ Positive definition of ssSkC9
fof(lit_def_018,axiom,
( ssSkC9
<=> $false ) ).
%------ Positive definition of ssSkC8
fof(lit_def_019,axiom,
( ssSkC8
<=> $true ) ).
%------ Positive definition of ssSkC6
fof(lit_def_020,axiom,
( ssSkC6
<=> $true ) ).
%------ Positive definition of ssSkC4
fof(lit_def_021,axiom,
( ssSkC4
<=> $true ) ).
%------ Positive definition of ssSkC3
fof(lit_def_022,axiom,
( ssSkC3
<=> $false ) ).
%------ Positive definition of ssSkC1
fof(lit_def_023,axiom,
( ssSkC1
<=> $false ) ).
%------ Negative definition of ndr1_1
fof(lit_def_024,axiom,
! [X0] :
( ~ ndr1_1(X0)
<=> $false ) ).
%------ Positive definition of ssSkC33
fof(lit_def_025,axiom,
( ssSkC33
<=> $false ) ).
%------ Positive definition of c8_0
fof(lit_def_026,axiom,
( c8_0
<=> $false ) ).
%------ Positive definition of c4_1
fof(lit_def_027,axiom,
! [X0] :
( c4_1(X0)
<=> ( X0 = a1354
| X0 = a1323
| X0 = a1278
| X0 = a1249 ) ) ).
%------ Positive definition of ssSkC30
fof(lit_def_028,axiom,
( ssSkC30
<=> $false ) ).
%------ Positive definition of c3_0
fof(lit_def_029,axiom,
( c3_0
<=> $false ) ).
%------ Positive definition of c6_0
fof(lit_def_030,axiom,
( c6_0
<=> $false ) ).
%------ Positive definition of ssSkC23
fof(lit_def_031,axiom,
( ssSkC23
<=> $false ) ).
%------ Positive definition of ssSkC16
fof(lit_def_032,axiom,
( ssSkC16
<=> $true ) ).
%------ Positive definition of ssSkC7
fof(lit_def_033,axiom,
( ssSkC7
<=> $true ) ).
%------ Positive definition of ssSkC5
fof(lit_def_034,axiom,
( ssSkC5
<=> $false ) ).
%------ Positive definition of ssSkP11
fof(lit_def_035,axiom,
! [X0] :
( ssSkP11(X0)
<=> ( X0 = a1349
| X0 = a1218
| X0 = a1211
| X0 = a1327
| X0 = a1311
| X0 = a1210
| X0 = a1261
| X0 = a1288
| X0 = a1250 ) ) ).
%------ Positive definition of ssSkP10
fof(lit_def_036,axiom,
! [X0] :
( ssSkP10(X0)
<=> ( X0 = a1284
| X0 = a1278
| X0 = a1249
| X0 = a1218
| X0 = a1311 ) ) ).
%------ Positive definition of ssSkP9
fof(lit_def_037,axiom,
! [X0] :
( ssSkP9(X0)
<=> ( X0 = a1278
| X0 = a1223
| X0 = a1311
| X0 = a1250 ) ) ).
%------ Negative definition of c6_1
fof(lit_def_038,axiom,
! [X0] :
( ~ c6_1(X0)
<=> $false ) ).
%------ Positive definition of c3_1
fof(lit_def_039,axiom,
! [X0] :
( c3_1(X0)
<=> ( X0 = a1343
| X0 = a1333
| X0 = a1284
| X0 = a1278
| X0 = a1361
| X0 = a1214
| X0 = a1250 ) ) ).
%------ Positive definition of ssSkP8
fof(lit_def_040,axiom,
! [X0] :
( ssSkP8(X0)
<=> $true ) ).
%------ Positive definition of c2_1
fof(lit_def_041,axiom,
! [X0] :
( c2_1(X0)
<=> ( X0 = a1278
| X0 = a1250 ) ) ).
%------ Positive definition of ssSkP7
fof(lit_def_042,axiom,
! [X0] :
( ssSkP7(X0)
<=> X0 = a1311 ) ).
%------ Positive definition of ssSkP6
fof(lit_def_043,axiom,
! [X0] :
( ssSkP6(X0)
<=> $true ) ).
%------ Positive definition of c10_1
fof(lit_def_044,axiom,
! [X0] :
( c10_1(X0)
<=> X0 = a1210 ) ).
%------ Negative definition of ssSkP5
fof(lit_def_045,axiom,
! [X0] :
( ~ ssSkP5(X0)
<=> ( X0 = a1305
| X0 = a1357
| X0 = a1226
| X0 = a1214 ) ) ).
%------ Positive definition of c1_1
fof(lit_def_046,axiom,
! [X0] :
( c1_1(X0)
<=> ( X0 = a1305
| X0 = a1214 ) ) ).
%------ Positive definition of ssSkP4
fof(lit_def_047,axiom,
! [X0] :
( ssSkP4(X0)
<=> X0 = a1311 ) ).
%------ Positive definition of c7_1
fof(lit_def_048,axiom,
! [X0] :
( c7_1(X0)
<=> ( X0 = a1305
| X0 = a1357
| X0 = a1226
| X0 = a1214 ) ) ).
%------ Positive definition of c8_1
fof(lit_def_049,axiom,
! [X0] :
( c8_1(X0)
<=> ( X0 = a1343
| X0 = a1333
| X0 = a1278
| X0 = a1218
| X0 = a1361
| X0 = a1311
| X0 = a1214
| X0 = a1250 ) ) ).
%------ Positive definition of c9_1
fof(lit_def_050,axiom,
! [X0] :
( c9_1(X0)
<=> ( X0 = a1242
| X0 = a1207
| X0 = a1247
| X0 = a1214 ) ) ).
%------ Negative definition of ssSkP2
fof(lit_def_051,axiom,
! [X0] :
( ~ ssSkP2(X0)
<=> $false ) ).
%------ Negative definition of ssSkP1
fof(lit_def_052,axiom,
! [X0] :
( ~ ssSkP1(X0)
<=> $false ) ).
%------ Negative definition of c2_2
fof(lit_def_053,axiom,
! [X0,X1] :
( ~ c2_2(X0,X1)
<=> ( ( X0 = a1343
& X1 = a1310 )
| ( X0 = a1333
& X1 = a1310 )
| ( X0 = a1305
& X1 = a1313 )
| ( X0 = a1284
& X1 = a1310 )
| ( X0 = a1278
& X1 = a1352 )
| ( X0 = a1278
& X1 = a1310 )
| ( X0 = a1357
& X1 = a1313 )
| ( X0 = a1346
& X1 = a1347 )
| ( X0 = a1252
& X1 = a1253 )
| ( X0 = a1223
& X1 = a1352 )
| ( X0 = a1211
& X1 = a1212 )
| ( X0 = a1361
& X1 = a1310 )
| ( X0 = a1311
& X1 = a1352 )
| ( X0 = a1247
& X1 = a1351 )
| ( X0 = a1226
& X1 = a1313 )
| ( X0 = a1214
& X1 = a1313 )
| ( X0 = a1214
& X1 = a1310 )
| ( X0 = a1237
& X1 = a1239 )
| ( X0 = a1250
& X1 = a1352 )
| ( X0 = a1250
& X1 = a1310 )
| X1 = a1279
| X1 = a1340
| X1 = a1330 ) ) ).
%------ Positive definition of ssSkC34
fof(lit_def_054,axiom,
( ssSkC34
<=> $true ) ).
%------ Positive definition of c8_2
fof(lit_def_055,axiom,
! [X0,X1] :
( c8_2(X0,X1)
<=> ( ( X0 = a1315
& X1 = a1351 )
| ( X0 = a1305
& X1 = a1313 )
| ( X0 = a1284
& X1 = a1351 )
| ( X0 = a1242
& X1 = a1243 )
| ( X0 = a1193
& X1 = a1351 )
| ( X0 = a1357
& X1 = a1313 )
| ( X0 = a1281
& X1 = a1282 )
| ( X0 = a1226
& X1 = a1348 )
| ( X0 = a1214
& X1 = a1313 )
| ( X0 = a1241
& X1 = a1351 )
| ( X0 = a1288
& X1 = a1351 )
| ( X1 = a1351
& X0 != a1315
& X0 != a1284
& X0 != a1278
& X0 != a1193
& X0 != a1223
& X0 != a1311
& X0 != a1241
& X0 != a1288
& X0 != a1250 ) ) ) ).
%------ Positive definition of c10_2
fof(lit_def_056,axiom,
! [X0,X1] :
( c10_2(X0,X1)
<=> ( ( X0 = a1363
& X1 = a1351 )
| ( X0 = a1293
& X1 = a1294 )
| ( X0 = a1242
& X1 = a1243 )
| ( X0 = a1223
& X1 = a1352 )
| ( X0 = a1211
& X1 = a1212 )
| ( X0 = a1311
& X1 = a1352 )
| ( X0 = a1262
& X1 = a1351 )
| ( X0 = a1247
& X1 = a1351 )
| ( X0 = a1250
& X1 = a1355 )
| ( X1 = a1351
& X0 != a1363
& X0 != a1278
& X0 != a1262
& X0 != a1247 ) ) ) ).
%------ Positive definition of c5_2
fof(lit_def_057,axiom,
! [X0,X1] :
( c5_2(X0,X1)
<=> ( ( X0 = a1293
& X1 = a1294 )
| ( X0 = a1278
& X1 = a1348 )
| ( X0 = a1249
& X1 != a1359
& X1 != a1355
& X1 != a1351
& X1 != a1279
& X1 != a1356
& X1 != a1280
& X1 != a1314 )
| ( X0 = a1193
& X1 = a1194 )
| ( X0 = a1307
& X1 = a1308 )
| ( X0 = a1307
& X1 = a1348 )
| ( X0 = a1281
& X1 = a1282 )
| ( X0 = a1252
& X1 = a1254 )
| ( X0 = a1252
& X1 = a1253 )
| ( X0 = a1223
& X1 = a1348 )
| ( X0 = a1274
& X1 = a1348 )
| ( X0 = a1226
& X1 = a1348 )
| ( X0 = a1237
& X1 = a1239 )
| ( X0 = a1237
& X1 = a1238 ) ) ) ).
%------ Positive definition of ssSkC14
fof(lit_def_058,axiom,
( ssSkC14
<=> $true ) ).
%------ Positive definition of c1_2
fof(lit_def_059,axiom,
! [X0,X1] :
( c1_2(X0,X1)
<=> ( ( X0 = a1343
& X1 = a1359 )
| ( X0 = a1333
& X1 = a1359 )
| ( X0 = a1305
& X1 = a1313 )
| ( X0 = a1305
& X1 = a1306 )
| ( X0 = a1284
& X1 = a1356 )
| ( X0 = a1284
& X1 = a1310 )
| ( X0 = a1278
& X1 = a1359 )
| ( X0 = a1249
& X1 = a1356 )
| ( X0 = a1357
& X1 = a1313 )
| ( X0 = a1357
& X1 = a1358 )
| ( X0 = a1307
& X1 = a1359 )
| ( X0 = a1223
& X1 = a1359 )
| ( X0 = a1361
& X1 = a1359 )
| ( X0 = a1274
& X1 = a1359 )
| ( X0 = a1226
& X1 = a1359 )
| ( X0 = a1226
& X1 = a1313 )
| ( X0 = a1214
& X1 = a1313 )
| ( X1 = a1359
& X0 != a1349
& X0 != a1343
& X0 != a1333
& X0 != a1278
& X0 != a1218
& X0 != a1307
& X0 != a1223
& X0 != a1361
& X0 != a1327
& X0 != a1311
& X0 != a1274
& X0 != a1226
& X0 != a1210
& X0 != a1288
& X0 != a1250 ) ) ) ).
%------ Negative definition of c7_2
fof(lit_def_060,axiom,
! [X0,X1] :
( ~ c7_2(X0,X1)
<=> ( ( X0 = a1305
& X1 = a1313 )
| ( X0 = a1357
& X1 = a1313 )
| ( X0 = a1223
& X1 = a1351 )
| ( X0 = a1211
& X1 != a1359 )
| ( X0 = a1211
& X1 = a1359 )
| ( X0 = a1361
& X1 != a1359 )
| ( X0 = a1226
& X1 = a1348 )
| ( X0 = a1214
& X1 = a1313 )
| ( X0 = a1261
& X1 != a1359 )
| ( X0 = a1250
& X1 != a1359 )
| ( X0 = a1250
& X1 = a1359 )
| ( X0 = a1255
& X1 = a1256 )
| X1 = a1279
| X1 = a1231 ) ) ).
%------ Positive definition of c9_2
fof(lit_def_061,axiom,
! [X0,X1] :
( c9_2(X0,X1)
<=> ( ( X0 = a1323
& X1 = a1324 )
| ( X0 = a1305
& X1 = a1260 )
| ( X0 = a1193
& X1 = a1355 )
| ( X0 = a1193
& X1 = a1194 )
| ( X0 = a1357
& X1 = a1355 )
| ( X0 = a1357
& X1 = a1358 )
| ( X0 = a1357
& X1 = a1260 )
| ( X0 = a1338
& X1 = a1355 )
| ( X0 = a1281
& X1 = a1283 )
| ( X0 = a1240
& X1 = a1355 )
| ( X0 = a1311
& X1 != a1246
& X1 != a1268
& X1 != a1302
& X1 != a1340
& X1 != a1326 )
| ( X0 = a1226
& X1 = a1260 )
| ( X0 = a1241
& X1 = a1355 )
| ( X1 = a1355
& X0 != a1218
& X0 != a1193
& X0 != a1357
& X0 != a1338
& X0 != a1240
& X0 != a1241 ) ) ) ).
%------ Positive definition of c6_2
fof(lit_def_062,axiom,
! [X0,X1] :
( c6_2(X0,X1)
<=> ( ( X0 = a1293
& X1 = a1355 )
| ( X0 = a1333
& X1 = a1334 )
| ( X0 = a1315
& X1 = a1355 )
| ( X0 = a1287
& X1 = a1355 )
| ( X0 = a1357
& X1 = a1358 )
| ( X0 = a1346
& X1 = a1355 )
| ( X0 = a1346
& X1 = a1347 )
| ( X0 = a1331
& X1 = a1355 )
| ( X0 = a1223
& X1 = a1355 )
| ( X0 = a1240
& X1 != a1317
& X1 != a1301
& X1 != a1319
& X1 != a1292 )
| ( X0 = a1215
& X1 = a1355 )
| ( X0 = a1250
& X1 = a1355 )
| ( X1 = a1355
& X0 != a1293
& X0 != a1315
& X0 != a1287
& X0 != a1284
& X0 != a1278
& X0 != a1249
& X0 != a1218
& X0 != a1346
& X0 != a1331
& X0 != a1223
& X0 != a1311
& X0 != a1215
& X0 != a1250 ) ) ) ).
%------ Positive definition of c5_1
fof(lit_def_063,axiom,
! [X0] :
( c5_1(X0)
<=> ( X0 = a1284
| X0 = a1249
| X0 = a1226
| X0 = a1250 ) ) ).
%------ Positive definition of c3_2
fof(lit_def_064,axiom,
! [X0,X1] :
( c3_2(X0,X1)
<=> ( ( X0 = a1349
& X1 = a1351 )
| ( X0 = a1305
& X1 = a1306 )
| ( X0 = a1249
& X1 = a1351 )
| ( X0 = a1357
& X1 = a1358 )
| ( X0 = a1307
& X1 = a1351 )
| ( X0 = a1223
& X1 = a1351 )
| ( X0 = a1327
& X1 = a1351 )
| ( X0 = a1274
& X1 = a1351 )
| X1 = a1359
| ( X1 = a1351
& X0 != a1349
& X0 != a1278
& X0 != a1249
& X0 != a1307
& X0 != a1223
& X0 != a1327
& X0 != a1274 ) ) ) ).
%------ Positive definition of c4_2
fof(lit_def_065,axiom,
! [X0,X1] :
( c4_2(X0,X1)
<=> ( ( X0 = a1305
& X1 = a1313 )
| ( X0 = a1193
& X1 = a1194 )
| ( X0 = a1357
& X1 = a1313 )
| ( X0 = a1281
& X1 = a1283 )
| ( X0 = a1226
& X1 = a1348 )
| ( X0 = a1214
& X1 = a1313 )
| ( X0 = a1237
& X1 = a1238 ) ) ) ).
%------ Positive definition of ssSkC21
fof(lit_def_066,axiom,
( ssSkC21
<=> $false ) ).
%------ Positive definition of sP1_iProver_split
fof(lit_def_067,axiom,
( sP1_iProver_split
<=> $false ) ).
%------ Positive definition of sP2_iProver_split
fof(lit_def_068,axiom,
( sP2_iProver_split
<=> $false ) ).
%------ Positive definition of sP4_iProver_split
fof(lit_def_069,axiom,
! [X0] :
( sP4_iProver_split(X0)
<=> $false ) ).
%------ Positive definition of sP5_iProver_split
fof(lit_def_070,axiom,
( sP5_iProver_split
<=> $true ) ).
%------ Positive definition of sP6_iProver_split
fof(lit_def_071,axiom,
! [X0] :
( sP6_iProver_split(X0)
<=> $false ) ).
%------ Positive definition of sP7_iProver_split
fof(lit_def_072,axiom,
( sP7_iProver_split
<=> $true ) ).
%------ Positive definition of sP8_iProver_split
fof(lit_def_073,axiom,
( sP8_iProver_split
<=> $true ) ).
%------ Positive definition of sP9_iProver_split
fof(lit_def_074,axiom,
( sP9_iProver_split
<=> $false ) ).
%------ Positive definition of sP10_iProver_split
fof(lit_def_075,axiom,
! [X0] :
( sP10_iProver_split(X0)
<=> $false ) ).
%------ Positive definition of sP11_iProver_split
fof(lit_def_076,axiom,
( sP11_iProver_split
<=> $true ) ).
%------ Positive definition of sP14_iProver_split
fof(lit_def_077,axiom,
! [X0] :
( sP14_iProver_split(X0)
<=> $false ) ).
%------ Positive definition of sP15_iProver_split
fof(lit_def_078,axiom,
! [X0] :
( sP15_iProver_split(X0)
<=> $false ) ).
%------ Positive definition of sP16_iProver_split
fof(lit_def_079,axiom,
! [X0] :
( sP16_iProver_split(X0)
<=> $false ) ).
%------ Positive definition of sP18_iProver_split
fof(lit_def_080,axiom,
( sP18_iProver_split
<=> $false ) ).
%------ Positive definition of sP19_iProver_split
fof(lit_def_081,axiom,
( sP19_iProver_split
<=> $false ) ).
%------ Positive definition of sP22_iProver_split
fof(lit_def_082,axiom,
! [X0] :
( sP22_iProver_split(X0)
<=> $false ) ).
%------ Positive definition of sP23_iProver_split
fof(lit_def_083,axiom,
! [X0] :
( sP23_iProver_split(X0)
<=> $false ) ).
%------ Positive definition of sP24_iProver_split
fof(lit_def_084,axiom,
( sP24_iProver_split
<=> $false ) ).
%------ Positive definition of sP25_iProver_split
fof(lit_def_085,axiom,
( sP25_iProver_split
<=> $false ) ).
%------ Positive definition of sP27_iProver_split
fof(lit_def_086,axiom,
! [X0] :
( sP27_iProver_split(X0)
<=> $false ) ).
%------ Positive definition of sP29_iProver_split
fof(lit_def_087,axiom,
( sP29_iProver_split
<=> $false ) ).
%------ Positive definition of sP32_iProver_split
fof(lit_def_088,axiom,
( sP32_iProver_split
<=> $false ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN425-1 : TPTP v8.1.2. Released v2.1.0.
% 0.12/0.13 % Command : run_iprover %s %d SAT
% 0.13/0.34 % Computer : n001.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sat Aug 26 22:01:16 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running model finding
% 0.19/0.46 Running: /export/starexec/sandbox/solver/bin/run_problem --no_cores 8 --heuristic_context fnt --schedule fnt_schedule /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 6.39/1.64 % SZS status Started for theBenchmark.p
% 6.39/1.64 % SZS status Satisfiable for theBenchmark.p
% 6.39/1.64
% 6.39/1.64 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 6.39/1.64
% 6.39/1.64 ------ iProver source info
% 6.39/1.64
% 6.39/1.64 git: date: 2023-05-31 18:12:56 +0000
% 6.39/1.64 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 6.39/1.64 git: non_committed_changes: false
% 6.39/1.64 git: last_make_outside_of_git: false
% 6.39/1.64
% 6.39/1.64 ------ Parsing...successful
% 6.39/1.64
% 6.39/1.64
% 6.39/1.64
% 6.39/1.64 ------ Preprocessing... pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe_e pe_s pe_e
% 6.39/1.64
% 6.39/1.64 ------ Preprocessing... scvd_s sp: 55 0s scvd_e snvd_s sp: 0 0s snvd_e
% 6.39/1.64 ------ Proving...
% 6.39/1.64 ------ Problem Properties
% 6.39/1.64
% 6.39/1.64
% 6.39/1.64 clauses 481
% 6.39/1.64 conjectures 475
% 6.39/1.64 EPR 481
% 6.39/1.64 Horn 177
% 6.39/1.64 unary 6
% 6.39/1.64 binary 169
% 6.39/1.64 lits 1787
% 6.39/1.64 lits eq 0
% 6.39/1.64 fd_pure 0
% 6.39/1.64 fd_pseudo 0
% 6.39/1.64 fd_cond 0
% 6.39/1.64 fd_pseudo_cond 0
% 6.39/1.64 AC symbols 0
% 6.39/1.64
% 6.39/1.64 ------ Input Options Time Limit: Unbounded
% 6.39/1.64
% 6.39/1.64
% 6.39/1.64 ------ Finite Models:
% 6.39/1.64
% 6.39/1.64 ------ lit_activity_flag true
% 6.39/1.64
% 6.39/1.64 ------
% 6.39/1.64 Current options:
% 6.39/1.64 ------
% 6.39/1.64
% 6.39/1.64 ------ Input Options
% 6.39/1.64
% 6.39/1.64 --out_options all
% 6.39/1.64 --tptp_safe_out true
% 6.39/1.64 --problem_path ""
% 6.39/1.64 --include_path ""
% 6.39/1.64 --clausifier res/vclausify_rel
% 6.39/1.64 --clausifier_options --mode clausify -t 300.00
% 6.39/1.64 --stdin false
% 6.39/1.64 --proof_out true
% 6.39/1.64 --proof_dot_file ""
% 6.39/1.64 --proof_reduce_dot []
% 6.39/1.64 --suppress_sat_res false
% 6.39/1.64 --suppress_unsat_res true
% 6.39/1.64 --stats_out all
% 6.39/1.64 --stats_mem false
% 6.39/1.64 --theory_stats_out false
% 6.39/1.64
% 6.39/1.64 ------ General Options
% 6.39/1.64
% 6.39/1.64 --fof false
% 6.39/1.64 --time_out_real 300.
% 6.39/1.64 --time_out_virtual -1.
% 6.39/1.64 --rnd_seed 13
% 6.39/1.64 --symbol_type_check false
% 6.39/1.64 --clausify_out false
% 6.39/1.64 --sig_cnt_out false
% 6.39/1.64 --trig_cnt_out false
% 6.39/1.64 --trig_cnt_out_tolerance 1.
% 6.39/1.64 --trig_cnt_out_sk_spl false
% 6.39/1.64 --abstr_cl_out false
% 6.39/1.64
% 6.39/1.64 ------ Interactive Mode
% 6.39/1.64
% 6.39/1.64 --interactive_mode false
% 6.39/1.64 --external_ip_address ""
% 6.39/1.64 --external_port 0
% 6.39/1.64
% 6.39/1.64 ------ Global Options
% 6.39/1.64
% 6.39/1.64 --schedule none
% 6.39/1.64 --add_important_lit false
% 6.39/1.64 --prop_solver_per_cl 500
% 6.39/1.64 --subs_bck_mult 8
% 6.39/1.64 --min_unsat_core false
% 6.39/1.64 --soft_assumptions false
% 6.39/1.64 --soft_lemma_size 3
% 6.39/1.64 --prop_impl_unit_size 0
% 6.39/1.64 --prop_impl_unit []
% 6.39/1.64 --share_sel_clauses true
% 6.39/1.64 --reset_solvers false
% 6.39/1.64 --bc_imp_inh [conj_cone]
% 6.39/1.64 --conj_cone_tolerance 3.
% 6.39/1.64 --extra_neg_conj all_pos_neg
% 6.39/1.64 --large_theory_mode true
% 6.39/1.64 --prolific_symb_bound 500
% 6.39/1.64 --lt_threshold 2000
% 6.39/1.64 --clause_weak_htbl true
% 6.39/1.64 --gc_record_bc_elim false
% 6.39/1.64
% 6.39/1.64 ------ Preprocessing Options
% 6.39/1.64
% 6.39/1.64 --preprocessing_flag true
% 6.39/1.64 --time_out_prep_mult 0.2
% 6.39/1.64 --splitting_mode input
% 6.39/1.64 --splitting_grd false
% 6.39/1.64 --splitting_cvd true
% 6.39/1.64 --splitting_cvd_svl true
% 6.39/1.64 --splitting_nvd 256
% 6.39/1.64 --sub_typing false
% 6.39/1.64 --prep_gs_sim false
% 6.39/1.64 --prep_unflatten true
% 6.39/1.64 --prep_res_sim true
% 6.39/1.64 --prep_sup_sim_all true
% 6.39/1.64 --prep_sup_sim_sup false
% 6.39/1.64 --prep_upred true
% 6.39/1.64 --prep_well_definedness true
% 6.39/1.64 --prep_sem_filter none
% 6.39/1.64 --prep_sem_filter_out false
% 6.39/1.64 --pred_elim true
% 6.39/1.64 --res_sim_input false
% 6.39/1.64 --eq_ax_congr_red true
% 6.39/1.64 --pure_diseq_elim false
% 6.39/1.64 --brand_transform false
% 6.39/1.64 --non_eq_to_eq false
% 6.39/1.64 --prep_def_merge false
% 6.39/1.64 --prep_def_merge_prop_impl false
% 6.39/1.64 --prep_def_merge_mbd true
% 6.39/1.64 --prep_def_merge_tr_red false
% 6.39/1.64 --prep_def_merge_tr_cl false
% 6.39/1.64 --smt_preprocessing false
% 6.39/1.64 --smt_ac_axioms fast
% 6.39/1.64 --preprocessed_out false
% 6.39/1.64 --preprocessed_stats false
% 6.39/1.64
% 6.39/1.64 ------ Abstraction refinement Options
% 6.39/1.64
% 6.39/1.64 --abstr_ref []
% 6.39/1.64 --abstr_ref_prep false
% 6.39/1.64 --abstr_ref_until_sat false
% 6.39/1.64 --abstr_ref_sig_restrict funpre
% 6.39/1.64 --abstr_ref_af_restrict_to_split_sk false
% 6.39/1.64 --abstr_ref_under []
% 6.39/1.64
% 6.39/1.64 ------ SAT Options
% 6.39/1.64
% 6.39/1.64 --sat_mode true
% 6.39/1.64 --sat_fm_restart_options ""
% 6.39/1.64 --sat_gr_def false
% 6.39/1.64 --sat_epr_types false
% 6.39/1.64 --sat_non_cyclic_types true
% 6.39/1.64 --sat_finite_models true
% 6.39/1.64 --sat_fm_lemmas false
% 6.39/1.64 --sat_fm_prep false
% 6.39/1.64 --sat_fm_uc_incr true
% 6.39/1.64 --sat_out_model small
% 6.39/1.64 --sat_out_clauses false
% 6.39/1.64
% 6.39/1.64 ------ QBF Options
% 6.39/1.64
% 6.39/1.64 --qbf_mode false
% 6.39/1.64 --qbf_elim_univ false
% 6.39/1.64 --qbf_dom_inst none
% 6.39/1.64 --qbf_dom_pre_inst false
% 6.39/1.64 --qbf_sk_in false
% 6.39/1.64 --qbf_pred_elim true
% 6.39/1.64 --qbf_split 512
% 6.39/1.64
% 6.39/1.64 ------ BMC1 Options
% 6.39/1.64
% 6.39/1.64 --bmc1_incremental false
% 6.39/1.64 --bmc1_axioms reachable_all
% 6.39/1.64 --bmc1_min_bound 0
% 6.39/1.64 --bmc1_max_bound -1
% 6.39/1.64 --bmc1_max_bound_default -1
% 6.39/1.64 --bmc1_symbol_reachability false
% 6.39/1.64 --bmc1_property_lemmas false
% 6.39/1.64 --bmc1_k_induction false
% 6.39/1.64 --bmc1_non_equiv_states false
% 6.39/1.64 --bmc1_deadlock false
% 6.39/1.64 --bmc1_ucm false
% 6.39/1.64 --bmc1_add_unsat_core none
% 6.39/1.64 --bmc1_unsat_core_children false
% 6.39/1.64 --bmc1_unsat_core_extrapolate_axioms false
% 6.39/1.64 --bmc1_out_stat full
% 6.39/1.64 --bmc1_ground_init false
% 6.39/1.64 --bmc1_pre_inst_next_state false
% 6.39/1.64 --bmc1_pre_inst_state false
% 6.39/1.64 --bmc1_pre_inst_reach_state false
% 6.39/1.64 --bmc1_out_unsat_core false
% 6.39/1.64 --bmc1_aig_witness_out false
% 6.39/1.64 --bmc1_verbose false
% 6.39/1.64 --bmc1_dump_clauses_tptp false
% 6.39/1.64 --bmc1_dump_unsat_core_tptp false
% 6.39/1.64 --bmc1_dump_file -
% 6.39/1.64 --bmc1_ucm_expand_uc_limit 128
% 6.39/1.64 --bmc1_ucm_n_expand_iterations 6
% 6.39/1.64 --bmc1_ucm_extend_mode 1
% 6.39/1.64 --bmc1_ucm_init_mode 2
% 6.39/1.64 --bmc1_ucm_cone_mode none
% 6.39/1.64 --bmc1_ucm_reduced_relation_type 0
% 6.39/1.64 --bmc1_ucm_relax_model 4
% 6.39/1.64 --bmc1_ucm_full_tr_after_sat true
% 6.39/1.64 --bmc1_ucm_expand_neg_assumptions false
% 6.39/1.64 --bmc1_ucm_layered_model none
% 6.39/1.64 --bmc1_ucm_max_lemma_size 10
% 6.39/1.64
% 6.39/1.64 ------ AIG Options
% 6.39/1.64
% 6.39/1.64 --aig_mode false
% 6.39/1.64
% 6.39/1.64 ------ Instantiation Options
% 6.39/1.64
% 6.39/1.64 --instantiation_flag true
% 6.39/1.64 --inst_sos_flag false
% 6.39/1.64 --inst_sos_phase true
% 6.39/1.64 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb]
% 6.39/1.64 --inst_lit_sel [-sign;+num_symb;+non_prol_conj_symb]
% 6.39/1.64 --inst_lit_sel_side num_lit
% 6.39/1.64 --inst_solver_per_active 1400
% 6.39/1.64 --inst_solver_calls_frac 0.01
% 6.39/1.64 --inst_to_smt_solver true
% 6.39/1.64 --inst_passive_queue_type priority_queues
% 6.39/1.64 --inst_passive_queues [[+conj_dist;+num_lits;-age];[-conj_symb;-min_def_symb;+bc_imp_inh]]
% 6.39/1.64 --inst_passive_queues_freq [512;64]
% 6.39/1.64 --inst_dismatching true
% 6.39/1.64 --inst_eager_unprocessed_to_passive false
% 6.39/1.64 --inst_unprocessed_bound 1000
% 6.39/1.64 --inst_prop_sim_given true
% 6.39/1.64 --inst_prop_sim_new true
% 6.39/1.64 --inst_subs_new false
% 6.39/1.64 --inst_eq_res_simp false
% 6.39/1.64 --inst_subs_given true
% 6.39/1.64 --inst_orphan_elimination false
% 6.39/1.64 --inst_learning_loop_flag true
% 6.39/1.64 --inst_learning_start 5
% 6.39/1.64 --inst_learning_factor 8
% 6.39/1.64 --inst_start_prop_sim_after_learn 0
% 6.39/1.64 --inst_sel_renew solver
% 6.39/1.64 --inst_lit_activity_flag true
% 6.39/1.64 --inst_restr_to_given false
% 6.39/1.64 --inst_activity_threshold 10000
% 6.39/1.64
% 6.39/1.64 ------ Resolution Options
% 6.39/1.64
% 6.39/1.64 --resolution_flag false
% 6.39/1.64 --res_lit_sel neg_max
% 6.39/1.64 --res_lit_sel_side num_lit
% 6.39/1.64 --res_ordering kbo
% 6.39/1.64 --res_to_prop_solver passive
% 6.39/1.64 --res_prop_simpl_new true
% 6.39/1.64 --res_prop_simpl_given true
% 6.39/1.64 --res_to_smt_solver true
% 6.39/1.64 --res_passive_queue_type priority_queues
% 6.39/1.64 --res_passive_queues [[-has_eq;-conj_non_prolific_symb;+ground];[-bc_imp_inh;-conj_symb]]
% 6.39/1.64 --res_passive_queues_freq [1024;32]
% 6.39/1.64 --res_forward_subs subset_subsumption
% 6.39/1.64 --res_backward_subs subset_subsumption
% 6.39/1.64 --res_forward_subs_resolution true
% 6.39/1.64 --res_backward_subs_resolution false
% 6.39/1.64 --res_orphan_elimination false
% 6.39/1.64 --res_time_limit 10.
% 6.39/1.64
% 6.39/1.64 ------ Superposition Options
% 6.39/1.64
% 6.39/1.64 --superposition_flag false
% 6.39/1.64 --sup_passive_queue_type priority_queues
% 6.39/1.64 --sup_passive_queues [[-conj_dist;-num_symb];[+score;+min_def_symb;-max_atom_input_occur;+conj_non_prolific_symb];[+age;-num_symb];[+score;-num_symb]]
% 6.39/1.64 --sup_passive_queues_freq [8;1;4;4]
% 6.39/1.64 --demod_completeness_check fast
% 6.39/1.64 --demod_use_ground true
% 6.39/1.64 --sup_unprocessed_bound 0
% 6.39/1.64 --sup_to_prop_solver passive
% 6.39/1.64 --sup_prop_simpl_new true
% 6.39/1.64 --sup_prop_simpl_given true
% 6.39/1.64 --sup_fun_splitting false
% 6.39/1.64 --sup_iter_deepening 2
% 6.39/1.64 --sup_restarts_mult 12
% 6.39/1.64 --sup_score sim_d_gen
% 6.39/1.64 --sup_share_score_frac 0.2
% 6.39/1.64 --sup_share_max_num_cl 500
% 6.39/1.64 --sup_ordering kbo
% 6.39/1.64 --sup_symb_ordering invfreq
% 6.39/1.64 --sup_term_weight default
% 6.39/1.64
% 6.39/1.64 ------ Superposition Simplification Setup
% 6.39/1.64
% 6.39/1.64 --sup_indices_passive [LightNormIndex;FwDemodIndex]
% 6.39/1.64 --sup_full_triv [SMTSimplify;PropSubs]
% 6.39/1.64 --sup_full_fw [ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 6.39/1.64 --sup_full_bw [BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 6.39/1.64 --sup_immed_triv []
% 6.39/1.64 --sup_immed_fw_main [ACNormalisation;FwLightNorm;FwUnitSubsAndRes]
% 6.39/1.64 --sup_immed_fw_immed [ACNormalisation;FwUnitSubsAndRes]
% 6.39/1.64 --sup_immed_bw_main [BwUnitSubsAndRes;BwDemod]
% 6.39/1.64 --sup_immed_bw_immed [BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 6.39/1.64 --sup_input_triv [Unflattening;SMTSimplify]
% 6.39/1.64 --sup_input_fw [FwACDemod;ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 6.39/1.64 --sup_input_bw [BwACDemod;BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 6.39/1.64 --sup_full_fixpoint true
% 6.39/1.64 --sup_main_fixpoint true
% 6.39/1.64 --sup_immed_fixpoint false
% 6.39/1.64 --sup_input_fixpoint true
% 6.39/1.64 --sup_cache_sim none
% 6.39/1.64 --sup_smt_interval 500
% 6.39/1.64 --sup_bw_gjoin_interval 0
% 6.39/1.64
% 6.39/1.64 ------ Combination Options
% 6.39/1.64
% 6.39/1.64 --comb_mode clause_based
% 6.39/1.64 --comb_inst_mult 1000
% 6.39/1.64 --comb_res_mult 10
% 6.39/1.64 --comb_sup_mult 8
% 6.39/1.64 --comb_sup_deep_mult 2
% 6.39/1.64
% 6.39/1.64 ------ Debug Options
% 6.39/1.64
% 6.39/1.64 --dbg_backtrace false
% 6.39/1.64 --dbg_dump_prop_clauses false
% 6.39/1.64 --dbg_dump_prop_clauses_file -
% 6.39/1.64 --dbg_out_stat false
% 6.39/1.64 --dbg_just_parse false
% 6.39/1.64
% 6.39/1.64
% 6.39/1.64
% 6.39/1.64
% 6.39/1.64 ------ Proving...
% 6.39/1.64
% 6.39/1.64
% 6.39/1.64 % SZS status Satisfiable for theBenchmark.p
% 6.39/1.64
% 6.39/1.64 ------ Building Model...Done
% 6.39/1.64
% 6.39/1.64 %------ The model is defined over ground terms (initial term algebra).
% 6.39/1.64 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 6.39/1.64 %------ where \phi is a formula over the term algebra.
% 6.39/1.64 %------ If we have equality in the problem then it is also defined as a predicate above,
% 6.39/1.64 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 6.39/1.64 %------ See help for --sat_out_model for different model outputs.
% 6.39/1.64 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 6.39/1.64 %------ where the first argument stands for the sort ($i in the unsorted case)
% 6.39/1.64 % SZS output start Model for theBenchmark.p
% See solution above
% 6.39/1.65 ------ Statistics
% 6.39/1.65
% 6.39/1.65 ------ Problem properties
% 6.39/1.65
% 6.39/1.65 clauses: 481
% 6.39/1.65 conjectures: 475
% 6.39/1.65 epr: 481
% 6.39/1.65 horn: 177
% 6.39/1.65 ground: 197
% 6.39/1.65 unary: 6
% 6.39/1.65 binary: 169
% 6.39/1.65 lits: 1787
% 6.39/1.65 lits_eq: 0
% 6.39/1.65 fd_pure: 0
% 6.39/1.65 fd_pseudo: 0
% 6.39/1.65 fd_cond: 0
% 6.39/1.65 fd_pseudo_cond: 0
% 6.39/1.65 ac_symbols: 0
% 6.39/1.65
% 6.39/1.65 ------ General
% 6.39/1.65
% 6.39/1.65 abstr_ref_over_cycles: 0
% 6.39/1.65 abstr_ref_under_cycles: 0
% 6.39/1.65 gc_basic_clause_elim: 0
% 6.39/1.65 num_of_symbols: 357
% 6.39/1.65 num_of_terms: 5423
% 6.39/1.65
% 6.39/1.65 parsing_time: 0.02
% 6.39/1.65 unif_index_cands_time: 0.002
% 6.39/1.65 unif_index_add_time: 0.001
% 6.39/1.65 orderings_time: 0.
% 6.39/1.65 out_proof_time: 0.
% 6.39/1.65 total_time: 0.826
% 6.39/1.65
% 6.39/1.65 ------ Preprocessing
% 6.39/1.65
% 6.39/1.65 num_of_splits: 55
% 6.39/1.65 num_of_split_atoms: 33
% 6.39/1.65 num_of_reused_defs: 22
% 6.39/1.65 num_eq_ax_congr_red: 0
% 6.39/1.65 num_of_sem_filtered_clauses: 0
% 6.39/1.65 num_of_subtypes: 0
% 6.39/1.65 monotx_restored_types: 0
% 6.39/1.65 sat_num_of_epr_types: 1
% 6.39/1.65 sat_num_of_non_cyclic_types: 1
% 6.39/1.65 sat_guarded_non_collapsed_types: 0
% 6.39/1.65 num_pure_diseq_elim: 0
% 6.39/1.65 simp_replaced_by: 0
% 6.39/1.65 res_preprocessed: 0
% 6.39/1.65 sup_preprocessed: 0
% 6.39/1.65 prep_upred: 0
% 6.39/1.65 prep_unflattend: 0
% 6.39/1.65 prep_well_definedness: 0
% 6.39/1.65 smt_new_axioms: 0
% 6.39/1.65 pred_elim_cands: 68
% 6.39/1.65 pred_elim: 11
% 6.39/1.65 pred_elim_cl: 28
% 6.39/1.65 pred_elim_cycles: 115
% 6.39/1.65 merged_defs: 0
% 6.39/1.65 merged_defs_ncl: 0
% 6.39/1.65 bin_hyper_res: 0
% 6.39/1.65 prep_cycles: 2
% 6.39/1.65
% 6.39/1.65 splitting_time: 0.004
% 6.39/1.65 sem_filter_time: 0.
% 6.39/1.65 monotx_time: 0.
% 6.39/1.65 subtype_inf_time: 0.
% 6.39/1.65 res_prep_time: 0.183
% 6.39/1.65 sup_prep_time: 0.
% 6.39/1.65 pred_elim_time: 0.35
% 6.39/1.65 bin_hyper_res_time: 0.
% 6.39/1.65 prep_time_total: 0.562
% 6.39/1.65
% 6.39/1.65 ------ Propositional Solver
% 6.39/1.65
% 6.39/1.65 prop_solver_calls: 99
% 6.39/1.65 prop_fast_solver_calls: 41023
% 6.39/1.65 smt_solver_calls: 0
% 6.39/1.65 smt_fast_solver_calls: 0
% 6.39/1.65 prop_num_of_clauses: 3824
% 6.39/1.65 prop_preprocess_simplified: 28475
% 6.39/1.65 prop_fo_subsumed: 427
% 6.39/1.65
% 6.39/1.65 prop_solver_time: 0.011
% 6.39/1.65 prop_fast_solver_time: 0.046
% 6.39/1.65 prop_unsat_core_time: 0.
% 6.39/1.65 smt_solver_time: 0.
% 6.39/1.65 smt_fast_solver_time: 0.
% 6.39/1.65
% 6.39/1.65 ------ QBF
% 6.39/1.65
% 6.39/1.65 qbf_q_res: 0
% 6.39/1.65 qbf_num_tautologies: 0
% 6.39/1.65 qbf_prep_cycles: 0
% 6.39/1.65
% 6.39/1.65 ------ BMC1
% 6.39/1.65
% 6.39/1.65 bmc1_current_bound: -1
% 6.39/1.65 bmc1_last_solved_bound: -1
% 6.39/1.65 bmc1_unsat_core_size: -1
% 6.39/1.65 bmc1_unsat_core_parents_size: -1
% 6.39/1.65 bmc1_merge_next_fun: 0
% 6.39/1.65
% 6.39/1.65 bmc1_unsat_core_clauses_time: 0.
% 6.39/1.65
% 6.39/1.65 ------ Instantiation
% 6.39/1.65
% 6.39/1.65 inst_num_of_clauses: 1523
% 6.39/1.65 inst_num_in_passive: 0
% 6.39/1.65 inst_num_in_active: 1874
% 6.39/1.65 inst_num_of_loops: 2010
% 6.39/1.65 inst_num_in_unprocessed: 0
% 6.39/1.65 inst_num_of_learning_restarts: 3
% 6.39/1.65 inst_num_moves_active_passive: 122
% 6.39/1.65 inst_lit_activity: 0
% 6.39/1.65 inst_lit_activity_moves: 0
% 6.39/1.65 inst_num_tautologies: 0
% 6.39/1.65 inst_num_prop_implied: 0
% 6.39/1.65 inst_num_existing_simplified: 0
% 6.39/1.65 inst_num_eq_res_simplified: 0
% 6.39/1.65 inst_num_child_elim: 0
% 6.39/1.65 inst_num_of_dismatching_blockings: 212
% 6.39/1.65 inst_num_of_non_proper_insts: 461
% 6.39/1.65 inst_num_of_duplicates: 0
% 6.39/1.65 inst_inst_num_from_inst_to_res: 0
% 6.39/1.65
% 6.39/1.65 inst_time_sim_new: 0.087
% 6.39/1.65 inst_time_sim_given: 0.057
% 6.39/1.65 inst_time_dismatching_checking: 0.001
% 6.39/1.65 inst_time_total: 0.193
% 6.39/1.65
% 6.39/1.65 ------ Resolution
% 6.39/1.65
% 6.39/1.65 res_num_of_clauses: 448
% 6.39/1.65 res_num_in_passive: 0
% 6.39/1.65 res_num_in_active: 0
% 6.39/1.65 res_num_of_loops: 926
% 6.39/1.65 res_forward_subset_subsumed: 103
% 6.39/1.65 res_backward_subset_subsumed: 0
% 6.39/1.65 res_forward_subsumed: 16
% 6.39/1.65 res_backward_subsumed: 0
% 6.39/1.65 res_forward_subsumption_resolution: 1
% 6.39/1.65 res_backward_subsumption_resolution: 4
% 6.39/1.65 res_clause_to_clause_subsumption: 962
% 6.39/1.65 res_subs_bck_cnt: 4
% 6.39/1.65 res_orphan_elimination: 0
% 6.39/1.65 res_tautology_del: 12
% 6.39/1.65 res_num_eq_res_simplified: 0
% 6.39/1.65 res_num_sel_changes: 0
% 6.39/1.65 res_moves_from_active_to_pass: 0
% 6.39/1.65
% 6.39/1.65 res_time_sim_new: 0.045
% 6.39/1.65 res_time_sim_fw_given: 0.071
% 6.39/1.65 res_time_sim_bw_given: 0.053
% 6.39/1.65 res_time_total: 0.049
% 6.39/1.65
% 6.39/1.65 ------ Superposition
% 6.39/1.65
% 6.39/1.65 sup_num_of_clauses: undef
% 6.39/1.65 sup_num_in_active: undef
% 6.39/1.65 sup_num_in_passive: undef
% 6.39/1.65 sup_num_of_loops: 0
% 6.39/1.65 sup_fw_superposition: 0
% 6.39/1.65 sup_bw_superposition: 0
% 6.39/1.65 sup_eq_factoring: 0
% 6.39/1.65 sup_eq_resolution: 0
% 6.39/1.65 sup_immediate_simplified: 0
% 6.39/1.65 sup_given_eliminated: 0
% 6.39/1.65 comparisons_done: 0
% 6.39/1.65 comparisons_avoided: 0
% 6.39/1.65 comparisons_inc_criteria: 0
% 6.39/1.65 sup_deep_cl_discarded: 0
% 6.39/1.65 sup_num_of_deepenings: 0
% 6.39/1.65 sup_num_of_restarts: 0
% 6.39/1.65
% 6.39/1.65 sup_time_generating: 0.
% 6.39/1.65 sup_time_sim_fw_full: 0.
% 6.39/1.65 sup_time_sim_bw_full: 0.
% 6.39/1.65 sup_time_sim_fw_immed: 0.
% 6.39/1.65 sup_time_sim_bw_immed: 0.
% 6.39/1.65 sup_time_prep_sim_fw_input: 0.
% 6.39/1.65 sup_time_prep_sim_bw_input: 0.
% 6.39/1.65 sup_time_total: 0.
% 6.39/1.65
% 6.39/1.65 ------ Simplifications
% 6.39/1.65
% 6.39/1.65 sim_repeated: 0
% 6.39/1.65 sim_fw_subset_subsumed: 0
% 6.39/1.65 sim_bw_subset_subsumed: 0
% 6.39/1.65 sim_fw_subsumed: 0
% 6.39/1.65 sim_bw_subsumed: 0
% 6.39/1.65 sim_fw_subsumption_res: 0
% 6.39/1.65 sim_bw_subsumption_res: 0
% 6.39/1.65 sim_fw_unit_subs: 0
% 6.39/1.65 sim_bw_unit_subs: 0
% 6.39/1.65 sim_tautology_del: 0
% 6.39/1.65 sim_eq_tautology_del: 0
% 6.39/1.65 sim_eq_res_simp: 0
% 6.39/1.65 sim_fw_demodulated: 0
% 6.39/1.65 sim_bw_demodulated: 0
% 6.39/1.65 sim_encompassment_demod: 0
% 6.39/1.65 sim_light_normalised: 0
% 6.39/1.65 sim_ac_normalised: 0
% 6.39/1.65 sim_joinable_taut: 0
% 6.39/1.65 sim_joinable_simp: 0
% 6.39/1.65 sim_fw_ac_demod: 0
% 6.39/1.65 sim_bw_ac_demod: 0
% 6.39/1.65 sim_smt_subsumption: 0
% 6.39/1.65 sim_smt_simplified: 0
% 6.39/1.65 sim_ground_joinable: 0
% 6.39/1.65 sim_bw_ground_joinable: 0
% 6.39/1.65 sim_connectedness: 0
% 6.39/1.65
% 6.39/1.65 sim_time_fw_subset_subs: 0.
% 6.39/1.65 sim_time_bw_subset_subs: 0.
% 6.39/1.65 sim_time_fw_subs: 0.
% 6.39/1.65 sim_time_bw_subs: 0.
% 6.39/1.65 sim_time_fw_subs_res: 0.
% 6.39/1.65 sim_time_bw_subs_res: 0.
% 6.39/1.65 sim_time_fw_unit_subs: 0.
% 6.39/1.65 sim_time_bw_unit_subs: 0.
% 6.39/1.65 sim_time_tautology_del: 0.
% 6.39/1.65 sim_time_eq_tautology_del: 0.
% 6.39/1.65 sim_time_eq_res_simp: 0.
% 6.39/1.65 sim_time_fw_demod: 0.
% 6.39/1.65 sim_time_bw_demod: 0.
% 6.39/1.65 sim_time_light_norm: 0.
% 6.39/1.65 sim_time_joinable: 0.
% 6.39/1.65 sim_time_ac_norm: 0.
% 6.39/1.65 sim_time_fw_ac_demod: 0.
% 6.39/1.65 sim_time_bw_ac_demod: 0.
% 6.39/1.65 sim_time_smt_subs: 0.
% 6.39/1.65 sim_time_fw_gjoin: 0.
% 6.39/1.65 sim_time_fw_connected: 0.
% 6.39/1.65
% 6.39/1.65
%------------------------------------------------------------------------------