%------------------------------------------------------------------------------
% File : iProver-SAT---3.9.4
% Problem : SYN426+1 : TPTP v9.3.1. Released v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p SAT
% Computer : n003.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 : Fri Sep 25 03:46:30 PM UTC 2026
% Result : CounterSatisfiable 2.61s 11.20s
% Output : Model 3.91s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
%------ Positive definition of ndr1_0
fof(lit_def,axiom,
( ndr1_0
<=> $true ) ).
%------ Positive definition of sP66
fof(lit_def_001,axiom,
( sP66
<=> $true ) ).
%------ Positive definition of c3_2
fof(lit_def_002,axiom,
! [X0,X1] :
( c3_2(X0,X1)
<=> ( ( X1 != a358
& X1 != a348
& X1 != a347
& X1 != a343
& X1 != a225
& X1 != a393
& X1 != a345
& X1 != a276
& X0 = a281 )
| ( X1 = a395
& X0 = a429 )
| ( X1 = a412
& X0 = a411 )
| ( X1 = a274
& X0 = a403 ) ) ) ).
%------ Positive definition of c10_2
fof(lit_def_003,axiom,
! [X0,X1] :
( c10_2(X0,X1)
<=> ( ( X1 = a267
& X0 = a364 )
| ( X1 = a334
& X0 = a333 )
| ( X1 = a344
& X0 = a332 )
| ( X1 = a354
& X0 = a330 )
| ( X1 = a395
& X0 = a429 )
| ( X1 = a267
& X0 = a424 )
| ( X1 = a419
& X0 = a418 )
| ( X1 = a404
& X0 = a403 )
| ( X1 = a398
& X0 = a397 )
| ( X1 = a354
& X0 = a335 ) ) ) ).
%------ Positive definition of c5_2
fof(lit_def_004,axiom,
! [X0,X1] :
( c5_2(X0,X1)
<=> ( ( X0 != a389
& X0 != a333
& X0 != a281
& X0 != a222
& X0 != a424
& X0 != a350
& X0 != a219
& X1 = a276 )
| ( X1 = a276
& X0 = a389 )
| ( X1 = a276
& X0 = a333 )
| ( X1 = a320
& X0 = a319 )
| ( X1 = a430
& X0 = a429 )
| ( X1 = a419
& X0 = a418 )
| ( X1 = a404
& X0 = a403 )
| ( X1 = a351
& X0 = a350 )
| ( X1 = a276
& X0 = a350 )
| ( X1 = a276
& X0 = a219 ) ) ) ).
%------ Positive definition of ndr1_1
fof(lit_def_005,axiom,
! [X0] :
( ndr1_1(X0)
<=> $true ) ).
%------ Positive definition of c2_2
fof(lit_def_006,axiom,
! [X0,X1] :
( c2_2(X0,X1)
<=> ( ( X0 != a281
& X0 != a222
& X0 != a429
& X0 != a424
& X0 != a411
& X0 != a335
& X0 != a219
& X1 = a347 )
| ( X1 = a367
& X0 = a389 )
| ( X1 = a367
& X0 = a333 )
| ( X1 = a272
& X0 = a333 )
| ( X1 = a393
& X0 = a332 )
| ( X1 = a321
& X0 = a319 )
| ( X1 = a347
& X0 = a281 )
| ( X1 = a266
& X0 = a265 )
| ( X1 = a367
& X0 = a222 )
| ( X1 = a347
& X0 = a222 )
| ( X1 = a359
& X0 = a222 )
| ( X1 = a272
& X0 = a222 )
| ( X1 = a367
& X0 = a429 )
| ( X1 = a430
& X0 = a429 )
| ( X1 = a359
& X0 = a429 )
| ( X1 = a272
& X0 = a429 )
| ( X1 = a402
& X0 = a424 )
| ( X1 = a367
& X0 = a418 )
| ( X1 = a359
& X0 = a418 )
| ( X1 = a272
& X0 = a418 )
| ( X1 = a274
& X0 = a403 )
| ( X1 = a402
& X0 = a397 )
| ( X1 = a352
& X0 = a350 )
| ( X1 = a367
& X0 = a335 )
| ( X1 = a359
& X0 = a335 )
| ( X1 = a336
& X0 = a335 )
| ( X1 = a272
& X0 = a335 )
| ( X1 = a367
& X0 = a219 )
| ( X1 = a272
& X0 = a219 )
| ( X1 = a220
& X0 = a219 )
| ( X1 != a367
& X1 != a359
& X1 != a272
& ( X1 != a359
| X0 != a389 )
& ( X1 != a359
| X0 != a333 )
& ( X1 != a321
| X0 != a319 )
& X0 != a281
& ( X1 != a396
| X0 != a265 )
& ( X1 != a347
| X0 != a222 )
& X0 != a424
& X0 != a411
& ( X1 != a359
| X0 != a219 ) ) ) ) ).
%------ Positive definition of c1_2
fof(lit_def_007,axiom,
! [X0,X1] :
( c1_2(X0,X1)
<=> ( ( X0 != a332
& X0 != a222
& X1 = a344 )
| ( X0 != a332
& X0 != a281
& X0 != a222
& X0 != a424
& X0 != a411
& X1 = a393 )
| ( X1 = a272
& X0 = a389 )
| ( X1 = a344
& X0 = a332 )
| ( X1 = a270
& X0 = a281 )
| ( X1 = a270
& X0 = a259 )
| ( X1 = a344
& X0 = a222 )
| ( X1 = a393
& X0 = a222 )
| ( X1 = a394
& X0 = a429 )
| ( X1 = a430
& X0 = a429 ) ) ) ).
%------ Positive definition of c6_2
fof(lit_def_008,axiom,
! [X0,X1] :
( c6_2(X0,X1)
<=> ( ( X0 != a319
& X0 != a403
& X1 = a367 )
| ( X0 != a281
& X0 != a403
& X1 = a344 )
| ( X0 != a424
& X0 != a403
& X1 = a359 )
| X1 = a272
| ( X1 = a331
& X0 = a364 )
| ( X1 = a331
& X0 = a342 )
| ( X1 = a331
& X0 = a337 )
| ( X1 = a331
& X0 = a333 )
| ( X1 = a331
& X0 = a327 )
| ( X1 = a320
& X0 = a319 )
| ( X1 = a344
& X0 = a281 )
| ( X1 = a331
& X0 = a281 )
| ( X1 = a396
& X0 = a265 )
| ( X1 = a331
& X0 = a259 )
| ( X1 = a331
& X0 = a222 )
| ( X1 = a331
& X0 = a429 )
| ( X1 = a331
& X0 = a411 )
| ( X1 = a331
& X0 = a219 )
| ( X1 = a221
& X0 = a219 ) ) ) ).
%------ Positive definition of c7_2
fof(lit_def_009,axiom,
! [X0,X1] :
( c7_2(X0,X1)
<=> ( ( X0 != a346
& X0 != a342
& X0 != a327
& X0 != a281
& X0 != a259
& X0 != a429
& X0 != a411
& X1 = a393 )
| ( X0 != a346
& X0 != a342
& X0 != a327
& X0 != a281
& X0 != a259
& X0 != a429
& X0 != a411
& X0 != a335
& X0 != a219
& X1 = a345 )
| ( X1 = a266
& X0 = a265 )
| ( X1 = a352
& X0 = a350 )
| ( X1 = a221
& X0 = a219 ) ) ) ).
%------ Positive definition of sP65
fof(lit_def_010,axiom,
( sP65
<=> $false ) ).
%------ Positive definition of c9_1
fof(lit_def_011,axiom,
! [X0] :
( c9_1(X0)
<=> X0 = a429 ) ).
%------ Positive definition of c1_1
fof(lit_def_012,axiom,
! [X0] :
( c1_1(X0)
<=> ( X0 = a364
| X0 = a424
| X0 = a411 ) ) ).
%------ Positive definition of c10_1
fof(lit_def_013,axiom,
! [X0] :
( c10_1(X0)
<=> ( X0 = a427
| X0 = a327 ) ) ).
%------ Positive definition of sP64
fof(lit_def_014,axiom,
! [X0] :
( sP64(X0)
<=> $false ) ).
%------ Positive definition of c4_2
fof(lit_def_015,axiom,
! [X0,X1] :
( c4_2(X0,X1)
<=> ( ( X1 = a320
& X0 = a319 )
| ( X1 = a266
& X0 = a265 )
| ( X1 = a398
& X0 = a397 ) ) ) ).
%------ Positive definition of sP63
fof(lit_def_016,axiom,
( sP63
<=> $false ) ).
%------ Positive definition of c4_1
fof(lit_def_017,axiom,
! [X0] :
( c4_1(X0)
<=> X0 = a403 ) ).
%------ Positive definition of sP62
fof(lit_def_018,axiom,
! [X0] :
( sP62(X0)
<=> $false ) ).
%------ Positive definition of c8_2
fof(lit_def_019,axiom,
! [X0,X1] :
( c8_2(X0,X1)
<=> ( ( X0 != a389
& X0 != a364
& X0 != a319
& X0 != a222
& X0 != a429
& X0 != a424
& X0 != a355
& X0 != a335
& X0 != a219
& X1 = a347 )
| ( X0 != a389
& X0 != a364
& X0 != a319
& X0 != a424
& X0 != a355
& X0 != a219
& X1 = a272 )
| ( X1 = a331
& X0 = a364 )
| ( X1 = a267
& X0 = a364 )
| ( X1 = a331
& X0 = a342 )
| ( X1 = a331
& X0 = a337 )
| ( X1 = a331
& X0 = a333 )
| ( X1 = a331
& X0 = a327 )
| ( X1 = a347
& X0 = a319 )
| ( X1 = a331
& X0 = a281 )
| ( X1 = a282
& X0 = a281 )
| ( X1 = a331
& X0 = a259 )
| ( X1 = a331
& X0 = a222 )
| ( X1 = a331
& X0 = a429 )
| ( X1 = a267
& X0 = a424 )
| ( X1 = a272
& X0 = a424 )
| ( X1 = a331
& X0 = a411 )
| ( X1 = a267
& X0 = a411 )
| ( X1 = a404
& X0 = a403 )
| ( X1 = a399
& X0 = a397 )
| ( X1 = a347
& X0 = a355 )
| ( X1 = a272
& X0 = a355 )
| ( X1 = a336
& X0 = a335 )
| ( X1 = a331
& X0 = a219 )
| ( X1 = a221
& X0 = a219 ) ) ) ).
%------ Positive definition of sP61
fof(lit_def_020,axiom,
! [X0] :
( sP61(X0)
<=> $false ) ).
%------ Positive definition of sP60
fof(lit_def_021,axiom,
( sP60
<=> $false ) ).
%------ Positive definition of c9_2
fof(lit_def_022,axiom,
! [X0,X1] :
( c9_2(X0,X1)
<=> ( ( X1 = a428
& X0 = a427 )
| ( X1 = a360
& X0 = a427 )
| ( X1 = a416
& X0 = a423 )
| ( X1 = a360
& X0 = a423 )
| ( X1 = a360
& X0 = a327 )
| ( X1 = a348
& X0 = a222 ) ) ) ).
%------ Positive definition of sP59
fof(lit_def_023,axiom,
( sP59
<=> $false ) ).
%------ Positive definition of sP58
fof(lit_def_024,axiom,
! [X0] :
( sP58(X0)
<=> $false ) ).
%------ Positive definition of sP57
fof(lit_def_025,axiom,
! [X0] :
( sP57(X0)
<=> $false ) ).
%------ Positive definition of sP56
fof(lit_def_026,axiom,
( sP56
<=> $false ) ).
%------ Positive definition of c6_1
fof(lit_def_027,axiom,
! [X0] :
( c6_1(X0)
<=> ( X0 = a330
| X0 = a327 ) ) ).
%------ Positive definition of sP54
fof(lit_def_028,axiom,
! [X0] :
( sP54(X0)
<=> ( X0 != a389
& X0 != a364
& X0 != a333
& X0 != a319
& X0 != a222
& X0 != a429
& X0 != a418
& X0 != a403
& X0 != a335
& X0 != a219 ) ) ).
%------ Positive definition of sP55
fof(lit_def_029,axiom,
( sP55
<=> $false ) ).
%------ Positive definition of c3_1
fof(lit_def_030,axiom,
! [X0] :
( c3_1(X0)
<=> ( X0 = a389
| X0 = a339
| X0 = a269
| X0 = a403
| X0 = a355
| X0 = a335
| ( X0 != a427
& X0 != a389
& X0 != a342
& X0 != a333
& X0 != a327
& X0 != a269
& X0 != a222
& X0 != a219 ) ) ) ).
%------ Positive definition of sP53
fof(lit_def_031,axiom,
( sP53
<=> $true ) ).
%------ Positive definition of sP52
fof(lit_def_032,axiom,
! [X0] :
( sP52(X0)
<=> ( X0 != a281
& X0 != a222
& X0 != a424 ) ) ).
%------ Positive definition of c2_1
fof(lit_def_033,axiom,
! [X0] :
( c2_1(X0)
<=> $false ) ).
%------ Positive definition of sP50
fof(lit_def_034,axiom,
! [X0] :
( sP50(X0)
<=> $false ) ).
%------ Positive definition of sP51
fof(lit_def_035,axiom,
( sP51
<=> $false ) ).
%------ Positive definition of sP49
fof(lit_def_036,axiom,
! [X0] :
( sP49(X0)
<=> $false ) ).
%------ Positive definition of sP48
fof(lit_def_037,axiom,
( sP48
<=> $false ) ).
%------ Positive definition of sP47
fof(lit_def_038,axiom,
! [X0] :
( sP47(X0)
<=> $false ) ).
%------ Positive definition of sP46
fof(lit_def_039,axiom,
( sP46
<=> $false ) ).
%------ Positive definition of c7_1
fof(lit_def_040,axiom,
! [X0] :
( c7_1(X0)
<=> ( X0 = a389
| X0 = a333
| X0 = a222
| X0 = a429
| X0 = a418
| X0 = a335
| X0 = a219 ) ) ).
%------ Positive definition of sP44
fof(lit_def_041,axiom,
! [X0] :
( sP44(X0)
<=> $false ) ).
%------ Positive definition of sP45
fof(lit_def_042,axiom,
( sP45
<=> $false ) ).
%------ Positive definition of sP42
fof(lit_def_043,axiom,
! [X0] :
( sP42(X0)
<=> $false ) ).
%------ Positive definition of sP43
fof(lit_def_044,axiom,
( sP43
<=> $false ) ).
%------ Positive definition of sP41
fof(lit_def_045,axiom,
! [X0] :
( sP41(X0)
<=> $false ) ).
%------ Positive definition of sP38
fof(lit_def_046,axiom,
! [X0] :
( sP38(X0)
<=> $false ) ).
%------ Positive definition of sP40
fof(lit_def_047,axiom,
( sP40
<=> $false ) ).
%------ Positive definition of sP39
fof(lit_def_048,axiom,
! [X0] :
( sP39(X0)
<=> $false ) ).
%------ Positive definition of sP37
fof(lit_def_049,axiom,
! [X0] :
( sP37(X0)
<=> $false ) ).
%------ Positive definition of sP36
fof(lit_def_050,axiom,
( sP36
<=> $false ) ).
%------ Positive definition of sP35
fof(lit_def_051,axiom,
( sP35
<=> $false ) ).
%------ Positive definition of c8_1
fof(lit_def_052,axiom,
! [X0] :
( c8_1(X0)
<=> ( X0 = a362
| X0 = a330
| X0 = a319
| X0 = a265
| X0 = a429
| X0 = a418
| X0 = a397
| X0 = a376
| X0 = a335
| ( X0 != a362
& X0 != a330
& X0 != a319
& X0 != a429
& X0 != a424
& X0 != a397
& X0 != a335 ) ) ) ).
%------ Positive definition of sP34
fof(lit_def_053,axiom,
( sP34
<=> $false ) ).
%------ Positive definition of sP33
fof(lit_def_054,axiom,
( sP33
<=> $false ) ).
%------ Positive definition of sP32
fof(lit_def_055,axiom,
( sP32
<=> $false ) ).
%------ Positive definition of sP31
fof(lit_def_056,axiom,
( sP31
<=> $false ) ).
%------ Positive definition of sP30
fof(lit_def_057,axiom,
( sP30
<=> $false ) ).
%------ Positive definition of sP29
fof(lit_def_058,axiom,
( sP29
<=> $true ) ).
%------ Positive definition of sP28
fof(lit_def_059,axiom,
! [X0] :
( sP28(X0)
<=> $false ) ).
%------ Positive definition of sP27
fof(lit_def_060,axiom,
( sP27
<=> $true ) ).
%------ Positive definition of sP26
fof(lit_def_061,axiom,
( sP26
<=> $true ) ).
%------ Positive definition of sP25
fof(lit_def_062,axiom,
( sP25
<=> $true ) ).
%------ Positive definition of sP24
fof(lit_def_063,axiom,
! [X0] :
( sP24(X0)
<=> X0 = a403 ) ).
%------ Positive definition of sP23
fof(lit_def_064,axiom,
( sP23
<=> $false ) ).
%------ Positive definition of sP22
fof(lit_def_065,axiom,
! [X0] :
( sP22(X0)
<=> ( X0 = a389
| X0 = a418 ) ) ).
%------ Positive definition of sP21
fof(lit_def_066,axiom,
( sP21
<=> $true ) ).
%------ Positive definition of sP20
fof(lit_def_067,axiom,
( sP20
<=> $false ) ).
%------ Positive definition of sP18
fof(lit_def_068,axiom,
! [X0] :
( sP18(X0)
<=> $false ) ).
%------ Positive definition of sP19
fof(lit_def_069,axiom,
( sP19
<=> $false ) ).
%------ Positive definition of sP17
fof(lit_def_070,axiom,
( sP17
<=> $false ) ).
%------ Positive definition of sP16
fof(lit_def_071,axiom,
( sP16
<=> $false ) ).
%------ Positive definition of c5_1
fof(lit_def_072,axiom,
! [X0] :
( c5_1(X0)
<=> ( X0 = a427
| X0 = a423
| X0 = a389
| X0 = a269
| X0 = a424
| X0 = a403
| ( X0 != a427
& X0 != a423
& X0 != a389
& X0 != a364
& X0 != a342
& X0 != a337
& X0 != a333
& X0 != a327
& X0 != a281
& X0 != a259
& X0 != a222
& X0 != a429
& X0 != a411
& X0 != a403
& X0 != a219 ) ) ) ).
%------ Positive definition of sP15
fof(lit_def_073,axiom,
( sP15
<=> $false ) ).
%------ Positive definition of sP14
fof(lit_def_074,axiom,
( sP14
<=> $false ) ).
%------ Positive definition of sP13
fof(lit_def_075,axiom,
! [X0] :
( sP13(X0)
<=> ( X0 != a346
& X0 != a342
& X0 != a332
& X0 != a327
& X0 != a281
& X0 != a259
& X0 != a429
& X0 != a411 ) ) ).
%------ Positive definition of sP12
fof(lit_def_076,axiom,
( sP12
<=> $false ) ).
%------ Positive definition of sP11
fof(lit_def_077,axiom,
( sP11
<=> $false ) ).
%------ Positive definition of sP10
fof(lit_def_078,axiom,
( sP10
<=> $false ) ).
%------ Positive definition of sP9
fof(lit_def_079,axiom,
( sP9
<=> $false ) ).
%------ Positive definition of sP8
fof(lit_def_080,axiom,
( sP8
<=> $false ) ).
%------ Positive definition of sP7
fof(lit_def_081,axiom,
( sP7
<=> $false ) ).
%------ Positive definition of sP6
fof(lit_def_082,axiom,
( sP6
<=> $true ) ).
%------ Positive definition of sP5
fof(lit_def_083,axiom,
( sP5
<=> $false ) ).
%------ Positive definition of sP4
fof(lit_def_084,axiom,
( sP4
<=> $true ) ).
%------ Positive definition of sP3
fof(lit_def_085,axiom,
( sP3
<=> $false ) ).
%------ Positive definition of sP2
fof(lit_def_086,axiom,
( sP2
<=> $true ) ).
%------ Positive definition of sP1
fof(lit_def_087,axiom,
( sP1
<=> $false ) ).
%------ Positive definition of sP0
fof(lit_def_088,axiom,
( sP0
<=> $false ) ).
%------ Positive definition of c5_0
fof(lit_def_089,axiom,
( c5_0
<=> $false ) ).
%------ Positive definition of c1_0
fof(lit_def_090,axiom,
( c1_0
<=> $false ) ).
%------ Positive definition of c3_0
fof(lit_def_091,axiom,
( c3_0
<=> $true ) ).
%------ Positive definition of c4_0
fof(lit_def_092,axiom,
( c4_0
<=> $true ) ).
%------ Positive definition of c8_0
fof(lit_def_093,axiom,
( c8_0
<=> $true ) ).
%------ Positive definition of c10_0
fof(lit_def_094,axiom,
( c10_0
<=> $true ) ).
%------ Positive definition of c9_0
fof(lit_def_095,axiom,
( c9_0
<=> $true ) ).
%------ Positive definition of c7_0
fof(lit_def_096,axiom,
( c7_0
<=> $true ) ).
%------ Positive definition of c2_0
fof(lit_def_097,axiom,
( c2_0
<=> $true ) ).
%------ Positive definition of c6_0
fof(lit_def_098,axiom,
( c6_0
<=> $false ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN426+1 : TPTP v9.3.1. Released v2.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p SAT
% 0.10/10.39 % Computer : n003.cluster.edu
% 0.10/10.39 % Model : x86_64 x86_64
% 0.10/10.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/10.39 % Memory : 8046.5625MB
% 0.10/10.39 % OS : Linux 6.8.0-71-generic
% 0.10/10.39 % CPULimit : 300
% 0.10/10.39 % WCLimit : 300
% 0.10/10.39 % DateTime : Fri Sep 25 01:10:17 UTC 2026
% 0.10/10.39 % CPUTime :
% 0.10/10.39 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p SAT
% 0.15/10.42 Running model finding
% 0.15/10.42 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fnt_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/10.43
% 0.15/10.43 % ======== iProver multi-core TPTP/SMT =========
% 0.15/10.43
% 0.15/10.43 % Detected problem language: tptp
% 0.15/10.45 % Proving...
% 2.61/11.20 % SZS status Started for theBenchmark.p
% 2.61/11.20 % SZS status CounterSatisfiable for theBenchmark.p
% 2.61/11.20
% 2.61/11.20 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.61/11.20
% 2.61/11.20 ------ iProver source info
% 2.61/11.20
% 2.61/11.20 git: date: 2026-07-19 20:42:38 +0200
% 2.61/11.20 git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.61/11.20 git: non_committed_changes: false
% 2.61/11.20
% 2.61/11.20 ------ Parsing...
% 2.61/11.20 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.61/11.20 ------ Proving...
% 2.61/11.20 ------ Problem Properties
% 2.61/11.20
% 2.61/11.20
% 2.61/11.20 clauses 769
% 2.61/11.20 conjectures 416
% 2.61/11.20 EPR 769
% 2.61/11.20 Horn 391
% 2.61/11.20 unary 1
% 2.61/11.20 binary 324
% 2.61/11.20 lits 3454
% 2.61/11.20 lits eq 0
% 2.61/11.20 fd_pure 0
% 2.61/11.20 fd_pseudo 0
% 2.61/11.20 fd_cond 0
% 2.61/11.20 fd_pseudo_cond 0
% 2.61/11.20 AC symbols 0
% 2.61/11.20
% 2.61/11.20 ------ Input Options Time Limit: Unbounded
% 2.61/11.20
% 2.61/11.20
% 2.61/11.20 ------ Finite Models:
% 2.61/11.20
% 2.61/11.20 ------ lit_activity_flag true
% 2.61/11.20
% 2.61/11.20 ------
% 2.61/11.20 Current options:
% 2.61/11.20 ------
% 2.61/11.20
% 2.61/11.20 ------ Input Options
% 2.61/11.20
% 2.61/11.20 --out_options all
% 2.61/11.20 --tptp_safe_out true
% 2.61/11.20 --problem_path ""
% 2.61/11.20 --include_path ""
% 2.61/11.20 --clausifier res/vclausify_rel
% 2.61/11.20 --clausifier_options --mode clausify -t 101.66 -updr off
% 2.61/11.20 --stdin false
% 2.61/11.20 --proof_out true
% 2.61/11.20 --proof_dot_file ""
% 2.61/11.20 --proof_reduce_dot []
% 2.61/11.20 --suppress_sat_res false
% 2.61/11.20 --suppress_unsat_res true
% 2.61/11.20 --stats_out none
% 2.61/11.20 --stats_mem false
% 2.61/11.20 --theory_stats_out false
% 2.61/11.20
% 2.61/11.20 ------ General Options
% 2.61/11.20
% 2.61/11.20 --fof false
% 2.61/11.20 --time_out_real 304.98
% 2.61/11.20 --time_out_virtual -1.
% 2.61/11.20 --rnd_seed 13
% 2.61/11.20 --symbol_type_check false
% 2.61/11.20 --clausify_out false
% 2.61/11.20 --sig_cnt_out false
% 2.61/11.20 --trig_cnt_out false
% 2.61/11.20 --trig_cnt_out_tolerance 1.
% 2.61/11.20 --trig_cnt_out_sk_spl false
% 2.61/11.20 --abstr_cl_out false
% 2.61/11.20
% 2.61/11.20 ------ Interactive Mode
% 2.61/11.20
% 2.61/11.20 --interactive_mode false
% 2.61/11.20 --external_ip_address ""
% 2.61/11.20 --external_port 0
% 2.61/11.20
% 2.61/11.20 ------ Global Options
% 2.61/11.20
% 2.61/11.20 --schedule none
% 2.61/11.20 --add_important_lit false
% 2.61/11.20 --prop_solver_per_cl 500
% 2.61/11.20 --subs_bck_mult 8
% 2.61/11.20 --min_unsat_core false
% 2.61/11.20 --soft_assumptions false
% 2.61/11.20 --soft_lemma_size 3
% 2.61/11.20 --prop_impl_unit_size 0
% 2.61/11.20 --prop_impl_unit []
% 2.61/11.20 --share_sel_clauses true
% 2.61/11.20 --reset_solvers false
% 2.61/11.20 --bc_imp_inh [conj_cone]
% 2.61/11.20 --conj_cone_tolerance 3.
% 2.61/11.20 --extra_neg_conj none
% 2.61/11.20 --large_theory_mode true
% 2.61/11.20 --prolific_symb_bound 200
% 2.61/11.20 --lt_threshold 2000
% 2.61/11.20 --clause_weak_htbl true
% 2.61/11.20 --gc_record_bc_elim false
% 2.61/11.20
% 2.61/11.20 ------ Preprocessing Options
% 2.61/11.20
% 2.61/11.20 --preprocessing_flag false
% 2.61/11.20 --time_out_prep_mult 0.1
% 2.61/11.20 --splitting_mode input
% 2.61/11.20 --splitting_grd true
% 2.61/11.20 --splitting_cvd false
% 2.61/11.20 --splitting_cvd_svl false
% 2.61/11.20 --splitting_nvd 32
% 2.61/11.20 --sub_typing false
% 2.61/11.20 --prep_eq_flat_conj false
% 2.61/11.20 --prep_ineq_split false
% 2.61/11.20 --prep_eq_flat_all_gr false
% 2.61/11.20 --prep_gs_sim true
% 2.61/11.20 --prep_unflatten true
% 2.61/11.20 --prep_res_sim true
% 2.61/11.20 --prep_sup_sim_all true
% 2.61/11.20 --prep_sup_sim_sup false
% 2.61/11.20 --prep_upred true
% 2.61/11.20 --prep_well_definedness true
% 2.61/11.20 --prep_sem_filter exhaustive
% 2.61/11.20 --prep_sem_filter_out false
% 2.61/11.20 --pred_elim true
% 2.61/11.20 --res_sim_input true
% 2.61/11.20 --eq_ax_congr_red true
% 2.61/11.20 --pure_diseq_elim true
% 2.61/11.20 --brand_transform false
% 2.61/11.20 --non_eq_to_eq false
% 2.61/11.20 --prep_eq_proxy false
% 2.61/11.20 --prep_def_merge true
% 2.61/11.20 --prep_def_merge_prop_impl false
% 2.61/11.20 --prep_def_merge_mbd true
% 2.61/11.20 --prep_def_merge_tr_red false
% 2.61/11.20 --prep_def_merge_tr_cl false
% 2.61/11.20 --smt_preprocessing false
% 2.61/11.20 --smt_ac_axioms fast
% 2.61/11.20 --preprocessed_out false
% 2.61/11.20 --preprocessed_stats false
% 2.61/11.20
% 2.61/11.20 ------ Abstraction refinement Options
% 2.61/11.20
% 2.61/11.20 --abstr_ref []
% 2.61/11.20 --abstr_ref_prep false
% 2.61/11.20 --abstr_ref_until_sat false
% 2.61/11.20 --abstr_ref_sig_restrict funpre
% 2.61/11.20 --abstr_ref_af_restrict_to_split_sk false
% 2.61/11.20 --abstr_ref_under []
% 2.61/11.20
% 2.61/11.20 ------ SAT Options
% 2.61/11.20
% 2.61/11.20 --sat_mode true
% 2.61/11.20 --sat_fm_restart_options ""
% 2.61/11.20 --sat_gr_def false
% 2.61/11.20 --sat_epr_types false
% 2.61/11.20 --sat_non_cyclic_types true
% 2.61/11.20 --sat_finite_models true
% 2.61/11.20 --sat_fm_lemmas false
% 2.61/11.20 --sat_fm_prep false
% 2.61/11.20 --sat_fm_uc_incr true
% 2.61/11.20 --sat_out_model pos
% 2.61/11.20 --sat_out_clauses false
% 2.61/11.20
% 2.61/11.20 ------ QBF Options
% 2.61/11.20
% 2.61/11.20 --qbf_mode false
% 2.61/11.20 --qbf_elim_univ false
% 2.61/11.20 --qbf_dom_inst none
% 2.61/11.20 --qbf_dom_pre_inst false
% 2.61/11.20 --qbf_sk_in false
% 2.61/11.20 --qbf_pred_elim true
% 2.61/11.20 --qbf_split 512
% 2.61/11.20
% 2.61/11.20 ------ BMC1 Options
% 2.61/11.20
% 2.61/11.20 --bmc1_incremental false
% 2.61/11.20 --bmc1_axioms reachable_all
% 2.61/11.20 --bmc1_min_bound 0
% 2.61/11.20 --bmc1_max_bound -1
% 2.61/11.20 --bmc1_max_bound_default -1
% 2.61/11.20 --bmc1_symbol_reachability true
% 2.61/11.20 --bmc1_property_lemmas false
% 2.61/11.20 --bmc1_k_induction false
% 2.61/11.20 --bmc1_non_equiv_states false
% 2.61/11.20 --bmc1_deadlock false
% 2.61/11.20 --bmc1_ucm false
% 2.61/11.20 --bmc1_add_unsat_core none
% 2.61/11.20 --bmc1_unsat_core_children false
% 2.61/11.20 --bmc1_unsat_core_extrapolate_axioms false
% 2.61/11.20 --bmc1_out_stat full
% 2.61/11.20 --bmc1_ground_init false
% 2.61/11.20 --bmc1_pre_inst_next_state false
% 2.61/11.20 --bmc1_pre_inst_state false
% 2.61/11.20 --bmc1_pre_inst_reach_state false
% 2.61/11.20 --bmc1_out_unsat_core false
% 2.61/11.20 --bmc1_aig_witness_out false
% 2.61/11.20 --bmc1_verbose false
% 2.61/11.20 --bmc1_dump_clauses_tptp false
% 2.61/11.20 --bmc1_dump_unsat_core_tptp false
% 2.61/11.20 --bmc1_dump_file -
% 2.61/11.20 --bmc1_ucm_expand_uc_limit 128
% 2.61/11.20 --bmc1_ucm_n_expand_iterations 6
% 2.61/11.20 --bmc1_ucm_extend_mode 1
% 2.61/11.20 --bmc1_ucm_init_mode 2
% 2.61/11.20 --bmc1_ucm_cone_mode none
% 2.61/11.20 --bmc1_ucm_reduced_relation_type 0
% 2.61/11.20 --bmc1_ucm_relax_model 4
% 2.61/11.20 --bmc1_ucm_full_tr_after_sat true
% 2.61/11.20 --bmc1_ucm_expand_neg_assumptions false
% 2.61/11.20 --bmc1_ucm_layered_model none
% 2.61/11.20 --bmc1_ucm_max_lemma_size 10
% 2.61/11.20
% 2.61/11.20 ------ AIG Options
% 2.61/11.20
% 2.61/11.20 --aig_mode false
% 2.61/11.20
% 2.61/11.20 ------ Instantiation Options
% 2.61/11.20
% 2.61/11.20 --instantiation_flag true
% 2.61/11.20 --inst_sos_flag false
% 2.61/11.20 --inst_sos_phase true
% 2.61/11.20 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb]
% 2.61/11.20 --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 2.61/11.20 --inst_lit_sel_side num_symb
% 2.61/11.20 --inst_solver_per_active 1400
% 2.61/11.20 --inst_solver_calls_frac 1.
% 2.61/11.20 --inst_to_smt_solver true
% 2.61/11.20 --inst_passive_queue_type priority_queues
% 2.61/11.20 --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 2.61/11.20 --inst_passive_queues_freq [25;2]
% 2.61/11.20 --inst_dismatching true
% 2.61/11.20 --inst_eager_unprocessed_to_passive true
% 2.61/11.20 --inst_unprocessed_bound 1000
% 2.61/11.20 --inst_prop_sim_given true
% 2.61/11.20 --inst_prop_sim_new false
% 2.61/11.20 --inst_subs_new false
% 2.61/11.20 --inst_eq_res_simp false
% 2.61/11.20 --inst_subs_given false
% 2.61/11.20 --inst_orphan_elimination true
% 2.61/11.20 --inst_learning_loop_flag true
% 2.61/11.20 --inst_learning_start 3000
% 2.61/11.20 --inst_learning_factor 2
% 2.61/11.20 --inst_start_prop_sim_after_learn 3
% 2.61/11.20 --inst_sel_renew solver
% 2.61/11.20 --inst_lit_activity_flag true
% 2.61/11.20 --inst_restr_to_given false
% 2.61/11.20 --inst_activity_threshold 500
% 2.61/11.20
% 2.61/11.20 ------ Resolution Options
% 2.61/11.20
% 2.61/11.20 --resolution_flag false
% 2.61/11.20 --res_lit_sel adaptive
% 2.61/11.20 --res_lit_sel_side none
% 2.61/11.20 --res_ordering kbo
% 2.61/11.20 --res_to_prop_solver active
% 2.61/11.20 --res_prop_simpl_new false
% 2.61/11.20 --res_prop_simpl_given true
% 2.61/11.20 --res_to_smt_solver true
% 2.61/11.20 --res_passive_queue_type priority_queues
% 2.61/11.20 --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 2.61/11.20 --res_passive_queues_freq [15;5]
% 2.61/11.20 --res_forward_subs full
% 2.61/11.20 --res_backward_subs full
% 2.61/11.20 --res_forward_subs_resolution true
% 2.61/11.20 --res_backward_subs_resolution true
% 2.61/11.20 --res_orphan_elimination true
% 2.61/11.20 --res_time_limit 300.
% 2.61/11.20
% 2.61/11.20 ------ Superposition Options
% 2.61/11.20
% 2.61/11.20 --superposition_flag false
% 2.61/11.20 --sup_passive_queue_type priority_queues
% 2.61/11.20 --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]]
% 2.61/11.20 --sup_passive_queues_freq [8;1;4;4]
% 2.61/11.20 --twee_lhs_weight 4
% 2.61/11.20 --sup_set_join false
% 2.61/11.20 --sup_set_join_goals true
% 2.61/11.20 --sup_set_join_limit 1000
% 2.61/11.20 --demod_completeness_check fast
% 2.61/11.20 --demod_use_ground true
% 2.61/11.20 --sup_unprocessed_bound 0
% 2.61/11.20 --sup_to_prop_solver passive
% 2.61/11.20 --sup_prop_simpl_new true
% 2.61/11.20 --sup_prop_simpl_given true
% 2.61/11.20 --sup_fun_splitting false
% 2.61/11.20 --sup_iter_deepening 2
% 2.61/11.20 --sup_restarts_mult 12
% 2.61/11.20 --sup_score sim_d_gen
% 2.61/11.20 --sup_share_score_frac 0.2
% 2.61/11.20 --sup_share_max_num_cl 500
% 2.61/11.20 --sup_ordering kbo
% 2.61/11.20 --sup_symb_ordering invfreq
% 2.61/11.20 --sup_term_weight default
% 2.61/11.20
% 2.61/11.20 ------ Superposition Simplification Setup
% 2.61/11.20
% 2.61/11.20 --sup_indices_passive [LightNormIndex;FwDemodIndex]
% 2.61/11.20 --sup_full_triv [SMTSimplify;PropSubs]
% 2.61/11.20 --sup_full_fw [ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 2.61/11.20 --sup_full_bw [BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 2.61/11.20 --sup_immed_triv []
% 2.61/11.20 --sup_immed_fw_main [ACNormalisation;FwLightNorm;FwUnitSubsAndRes]
% 2.61/11.20 --sup_immed_fw_immed [ACNormalisation;FwUnitSubsAndRes]
% 2.61/11.20 --sup_immed_bw_main [BwUnitSubsAndRes;BwDemod]
% 2.61/11.20 --sup_immed_bw_immed [BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 2.61/11.20 --sup_input_triv [Unflattening;SMTSimplify]
% 2.61/11.20 --sup_input_fw [FwACDemod;ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 2.61/11.20 --sup_input_bw [BwACDemod;BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 2.61/11.20 --sup_full_fixpoint true
% 2.61/11.20 --sup_main_fixpoint true
% 2.61/11.20 --sup_immed_fixpoint false
% 2.61/11.20 --sup_input_fixpoint true
% 2.61/11.20 --sup_cache_sim none
% 2.61/11.20 --sup_smt_interval 500
% 2.61/11.20 --sup_bw_gjoin_interval 0
% 2.61/11.20
% 2.61/11.20 ------ Combination Options
% 2.61/11.20
% 2.61/11.20 --comb_mode clause_based
% 2.61/11.20 --comb_inst_mult 5
% 2.61/11.20 --comb_res_mult 1
% 2.61/11.20 --comb_sup_mult 8
% 2.61/11.20 --comb_sup_deep_mult 2
% 2.61/11.20
% 2.61/11.20 ------ Debug Options
% 2.61/11.20
% 2.61/11.20 --dbg_backtrace false
% 2.61/11.20 --dbg_dump_prop_clauses false
% 2.61/11.20 --dbg_dump_prop_clauses_file -
% 2.61/11.20 --dbg_out_stat false
% 2.61/11.20 --dbg_just_parse false
% 2.61/11.20
% 2.61/11.20
% 2.61/11.20
% 2.61/11.20
% 2.61/11.20 ------ Proving...
% 2.61/11.20
% 2.61/11.20
% 2.61/11.20 % SZS status CounterSatisfiable for theBenchmark.p
% 2.61/11.20
% 2.61/11.20 ------ Building Model...Done
% 2.61/11.20
% 2.61/11.20 %------ The model is defined over ground terms (initial term algebra).
% 2.61/11.20 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 2.61/11.20 %------ where \phi is a formula over the term algebra.
% 2.61/11.20 %------ If we have equality in the problem then it is also defined as a predicate above,
% 2.61/11.20 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 2.61/11.20 %------ See help for --sat_out_model for different model outputs.
% 2.61/11.20 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 2.61/11.20 %------ where the first argument stands for the sort ($i in the unsorted case)
% 2.61/11.20 % SZS output start Model for theBenchmark.p
% See solution above
% 3.91/11.21
%------------------------------------------------------------------------------