%------------------------------------------------------------------------------
% File : iProver-SAT---3.9.4
% Problem : SYN464+1 : TPTP v9.3.1. Released v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p SAT
% Computer : n015.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:37 PM UTC 2026
% Result : CounterSatisfiable 3.33s 1.40s
% Output : Model 3.33s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
%------ Positive definition of hskp0
fof(lit_def,axiom,
( hskp0
<=> $true ) ).
%------ Positive definition of ndr1_0
fof(lit_def_001,axiom,
( ndr1_0
<=> $true ) ).
%------ Positive definition of c2_1
fof(lit_def_002,axiom,
! [X0] :
( c2_1(X0)
<=> ( X0 = iProver_Domain_i_2
| X0 = iProver_Domain_i_1 ) ) ).
%------ Positive definition of c1_1
fof(lit_def_003,axiom,
! [X0] :
( c1_1(X0)
<=> $false ) ).
%------ Positive definition of c0_1
fof(lit_def_004,axiom,
! [X0] :
( c0_1(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of hskp1
fof(lit_def_005,axiom,
( hskp1
<=> $false ) ).
%------ Positive definition of c3_1
fof(lit_def_006,axiom,
! [X0] :
( c3_1(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of hskp2
fof(lit_def_007,axiom,
( hskp2
<=> $false ) ).
%------ Positive definition of hskp3
fof(lit_def_008,axiom,
( hskp3
<=> $false ) ).
%------ Positive definition of hskp4
fof(lit_def_009,axiom,
( hskp4
<=> $false ) ).
%------ Positive definition of hskp5
fof(lit_def_010,axiom,
( hskp5
<=> $false ) ).
%------ Positive definition of hskp6
fof(lit_def_011,axiom,
( hskp6
<=> $false ) ).
%------ Positive definition of hskp7
fof(lit_def_012,axiom,
( hskp7
<=> $true ) ).
%------ Positive definition of hskp8
fof(lit_def_013,axiom,
( hskp8
<=> $true ) ).
%------ Positive definition of hskp9
fof(lit_def_014,axiom,
( hskp9
<=> $true ) ).
%------ Positive definition of hskp10
fof(lit_def_015,axiom,
( hskp10
<=> $false ) ).
%------ Positive definition of hskp11
fof(lit_def_016,axiom,
( hskp11
<=> $true ) ).
%------ Positive definition of hskp12
fof(lit_def_017,axiom,
( hskp12
<=> $false ) ).
%------ Positive definition of hskp13
fof(lit_def_018,axiom,
( hskp13
<=> $false ) ).
%------ Positive definition of hskp14
fof(lit_def_019,axiom,
( hskp14
<=> $true ) ).
%------ Positive definition of hskp15
fof(lit_def_020,axiom,
( hskp15
<=> $false ) ).
%------ Positive definition of hskp16
fof(lit_def_021,axiom,
( hskp16
<=> $false ) ).
%------ Positive definition of hskp17
fof(lit_def_022,axiom,
( hskp17
<=> $false ) ).
%------ Positive definition of hskp18
fof(lit_def_023,axiom,
( hskp18
<=> $false ) ).
%------ Positive definition of hskp19
fof(lit_def_024,axiom,
( hskp19
<=> $false ) ).
%------ Positive definition of hskp20
fof(lit_def_025,axiom,
( hskp20
<=> $false ) ).
%------ Positive definition of hskp21
fof(lit_def_026,axiom,
( hskp21
<=> $false ) ).
%------ Positive definition of hskp22
fof(lit_def_027,axiom,
( hskp22
<=> $false ) ).
%------ Positive definition of hskp23
fof(lit_def_028,axiom,
( hskp23
<=> $true ) ).
%------ Positive definition of hskp24
fof(lit_def_029,axiom,
( hskp24
<=> $false ) ).
%------ Positive definition of hskp25
fof(lit_def_030,axiom,
( hskp25
<=> $false ) ).
%------ Positive definition of hskp26
fof(lit_def_031,axiom,
( hskp26
<=> $false ) ).
%------ Positive definition of hskp27
fof(lit_def_032,axiom,
( hskp27
<=> $true ) ).
%------ Positive definition of hskp28
fof(lit_def_033,axiom,
( hskp28
<=> $false ) ).
%------ Positive definition of hskp29
fof(lit_def_034,axiom,
( hskp29
<=> $true ) ).
%------ Positive definition of hskp30
fof(lit_def_035,axiom,
( hskp30
<=> $false ) ).
%------ Positive definition of hskp31
fof(lit_def_036,axiom,
( hskp31
<=> $false ) ).
%------ Positive definition of hskp32
fof(lit_def_037,axiom,
( hskp32
<=> $false ) ).
%------ Positive definition of hskp33
fof(lit_def_038,axiom,
( hskp33
<=> $false ) ).
%------ Positive definition of hskp34
fof(lit_def_039,axiom,
( hskp34
<=> $false ) ).
%------ Positive definition of hskp35
fof(lit_def_040,axiom,
( hskp35
<=> $false ) ).
%------ Positive definition of hskp36
fof(lit_def_041,axiom,
( hskp36
<=> $false ) ).
%------ Positive definition of hskp37
fof(lit_def_042,axiom,
( hskp37
<=> $false ) ).
%------ Positive definition of hskp38
fof(lit_def_043,axiom,
( hskp38
<=> $true ) ).
%------ Positive definition of hskp39
fof(lit_def_044,axiom,
( hskp39
<=> $true ) ).
%------ Positive definition of hskp40
fof(lit_def_045,axiom,
( hskp40
<=> $false ) ).
%------ Positive definition of hskp41
fof(lit_def_046,axiom,
( hskp41
<=> $false ) ).
%------ Positive definition of hskp42
fof(lit_def_047,axiom,
( hskp42
<=> $false ) ).
%------ Positive definition of hskp43
fof(lit_def_048,axiom,
( hskp43
<=> $false ) ).
%------ Positive definition of hskp44
fof(lit_def_049,axiom,
( hskp44
<=> $false ) ).
%------ Positive definition of hskp45
fof(lit_def_050,axiom,
( hskp45
<=> $false ) ).
%------ Positive definition of hskp46
fof(lit_def_051,axiom,
( hskp46
<=> $false ) ).
%------ Positive definition of hskp47
fof(lit_def_052,axiom,
( hskp47
<=> $false ) ).
%------ Positive definition of hskp48
fof(lit_def_053,axiom,
( hskp48
<=> $false ) ).
%------ Positive definition of hskp49
fof(lit_def_054,axiom,
( hskp49
<=> $false ) ).
%------ Positive definition of hskp50
fof(lit_def_055,axiom,
( hskp50
<=> $true ) ).
%------ Positive definition of hskp51
fof(lit_def_056,axiom,
( hskp51
<=> $false ) ).
%------ Positive definition of hskp52
fof(lit_def_057,axiom,
( hskp52
<=> $true ) ).
%------ Positive definition of hskp53
fof(lit_def_058,axiom,
( hskp53
<=> $false ) ).
%------ Positive definition of hskp54
fof(lit_def_059,axiom,
( hskp54
<=> $false ) ).
%------ Positive definition of hskp55
fof(lit_def_060,axiom,
( hskp55
<=> $false ) ).
%------ Positive definition of hskp56
fof(lit_def_061,axiom,
( hskp56
<=> $false ) ).
%------ Positive definition of hskp57
fof(lit_def_062,axiom,
( hskp57
<=> $false ) ).
%------ Positive definition of hskp58
fof(lit_def_063,axiom,
( hskp58
<=> $false ) ).
%------ Positive definition of hskp59
fof(lit_def_064,axiom,
( hskp59
<=> $true ) ).
%------ Positive definition of hskp60
fof(lit_def_065,axiom,
( hskp60
<=> $false ) ).
%------ Positive definition of hskp61
fof(lit_def_066,axiom,
( hskp61
<=> $false ) ).
%------ Positive definition of hskp62
fof(lit_def_067,axiom,
( hskp62
<=> $false ) ).
%------ Positive definition of hskp63
fof(lit_def_068,axiom,
( hskp63
<=> $false ) ).
%------ Positive definition of hskp64
fof(lit_def_069,axiom,
( hskp64
<=> $false ) ).
%------ Positive definition of hskp65
fof(lit_def_070,axiom,
( hskp65
<=> $false ) ).
%------ Positive definition of hskp66
fof(lit_def_071,axiom,
( hskp66
<=> $false ) ).
%------ Positive definition of hskp67
fof(lit_def_072,axiom,
( hskp67
<=> $false ) ).
%------ Positive definition of hskp68
fof(lit_def_073,axiom,
( hskp68
<=> $false ) ).
%------ Positive definition of hskp69
fof(lit_def_074,axiom,
( hskp69
<=> $false ) ).
%------ Positive definition of iProver_Flat_a2428
fof(lit_def_075,axiom,
! [X0] :
( iProver_Flat_a2428(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_a2430
fof(lit_def_076,axiom,
! [X0] :
( iProver_Flat_a2430(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a2435
fof(lit_def_077,axiom,
! [X0] :
( iProver_Flat_a2435(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a2438
fof(lit_def_078,axiom,
! [X0] :
( iProver_Flat_a2438(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a2440
fof(lit_def_079,axiom,
! [X0] :
( iProver_Flat_a2440(X0)
<=> X0 = iProver_Domain_i_3 ) ).
%------ Positive definition of iProver_Flat_a2441
fof(lit_def_080,axiom,
! [X0] :
( iProver_Flat_a2441(X0)
<=> X0 = iProver_Domain_i_3 ) ).
%------ Positive definition of iProver_Flat_a2442
fof(lit_def_081,axiom,
! [X0] :
( iProver_Flat_a2442(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a2443
fof(lit_def_082,axiom,
! [X0] :
( iProver_Flat_a2443(X0)
<=> X0 = iProver_Domain_i_3 ) ).
%------ Positive definition of iProver_Flat_a2445
fof(lit_def_083,axiom,
! [X0] :
( iProver_Flat_a2445(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_a2446
fof(lit_def_084,axiom,
! [X0] :
( iProver_Flat_a2446(X0)
<=> X0 = iProver_Domain_i_3 ) ).
%------ Positive definition of iProver_Flat_a2448
fof(lit_def_085,axiom,
! [X0] :
( iProver_Flat_a2448(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_a2453
fof(lit_def_086,axiom,
! [X0] :
( iProver_Flat_a2453(X0)
<=> X0 = iProver_Domain_i_3 ) ).
%------ Positive definition of iProver_Flat_a2454
fof(lit_def_087,axiom,
! [X0] :
( iProver_Flat_a2454(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_a2458
fof(lit_def_088,axiom,
! [X0] :
( iProver_Flat_a2458(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_a2462
fof(lit_def_089,axiom,
! [X0] :
( iProver_Flat_a2462(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_a2464
fof(lit_def_090,axiom,
! [X0] :
( iProver_Flat_a2464(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a2466
fof(lit_def_091,axiom,
! [X0] :
( iProver_Flat_a2466(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a2469
fof(lit_def_092,axiom,
! [X0] :
( iProver_Flat_a2469(X0)
<=> X0 = iProver_Domain_i_3 ) ).
%------ Positive definition of iProver_Flat_a2472
fof(lit_def_093,axiom,
! [X0] :
( iProver_Flat_a2472(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a2473
fof(lit_def_094,axiom,
! [X0] :
( iProver_Flat_a2473(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a2478
fof(lit_def_095,axiom,
! [X0] :
( iProver_Flat_a2478(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a2482
fof(lit_def_096,axiom,
! [X0] :
( iProver_Flat_a2482(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a2483
fof(lit_def_097,axiom,
! [X0] :
( iProver_Flat_a2483(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a2485
fof(lit_def_098,axiom,
! [X0] :
( iProver_Flat_a2485(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_a2486
fof(lit_def_099,axiom,
! [X0] :
( iProver_Flat_a2486(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a2489
fof(lit_def_100,axiom,
! [X0] :
( iProver_Flat_a2489(X0)
<=> X0 = iProver_Domain_i_3 ) ).
%------ Positive definition of iProver_Flat_a2492
fof(lit_def_101,axiom,
! [X0] :
( iProver_Flat_a2492(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a2495
fof(lit_def_102,axiom,
! [X0] :
( iProver_Flat_a2495(X0)
<=> X0 = iProver_Domain_i_3 ) ).
%------ Positive definition of iProver_Flat_a2497
fof(lit_def_103,axiom,
! [X0] :
( iProver_Flat_a2497(X0)
<=> X0 = iProver_Domain_i_3 ) ).
%------ Positive definition of iProver_Flat_a2501
fof(lit_def_104,axiom,
! [X0] :
( iProver_Flat_a2501(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a2506
fof(lit_def_105,axiom,
! [X0] :
( iProver_Flat_a2506(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a2510
fof(lit_def_106,axiom,
! [X0] :
( iProver_Flat_a2510(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a2511
fof(lit_def_107,axiom,
! [X0] :
( iProver_Flat_a2511(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_a2513
fof(lit_def_108,axiom,
! [X0] :
( iProver_Flat_a2513(X0)
<=> X0 = iProver_Domain_i_3 ) ).
%------ Positive definition of iProver_Flat_a2514
fof(lit_def_109,axiom,
! [X0] :
( iProver_Flat_a2514(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a2515
fof(lit_def_110,axiom,
! [X0] :
( iProver_Flat_a2515(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a2429
fof(lit_def_111,axiom,
! [X0] :
( iProver_Flat_a2429(X0)
<=> X0 = iProver_Domain_i_3 ) ).
%------ Positive definition of iProver_Flat_a2431
fof(lit_def_112,axiom,
! [X0] :
( iProver_Flat_a2431(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a2432
fof(lit_def_113,axiom,
! [X0] :
( iProver_Flat_a2432(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_a2433
fof(lit_def_114,axiom,
! [X0] :
( iProver_Flat_a2433(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a2434
fof(lit_def_115,axiom,
! [X0] :
( iProver_Flat_a2434(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a2436
fof(lit_def_116,axiom,
! [X0] :
( iProver_Flat_a2436(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a2437
fof(lit_def_117,axiom,
! [X0] :
( iProver_Flat_a2437(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a2439
fof(lit_def_118,axiom,
! [X0] :
( iProver_Flat_a2439(X0)
<=> X0 = iProver_Domain_i_3 ) ).
%------ Positive definition of iProver_Flat_a2444
fof(lit_def_119,axiom,
! [X0] :
( iProver_Flat_a2444(X0)
<=> X0 = iProver_Domain_i_3 ) ).
%------ Positive definition of iProver_Flat_a2447
fof(lit_def_120,axiom,
! [X0] :
( iProver_Flat_a2447(X0)
<=> X0 = iProver_Domain_i_3 ) ).
%------ Positive definition of iProver_Flat_a2451
fof(lit_def_121,axiom,
! [X0] :
( iProver_Flat_a2451(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a2452
fof(lit_def_122,axiom,
! [X0] :
( iProver_Flat_a2452(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a2455
fof(lit_def_123,axiom,
! [X0] :
( iProver_Flat_a2455(X0)
<=> X0 = iProver_Domain_i_3 ) ).
%------ Positive definition of iProver_Flat_a2456
fof(lit_def_124,axiom,
! [X0] :
( iProver_Flat_a2456(X0)
<=> X0 = iProver_Domain_i_3 ) ).
%------ Positive definition of iProver_Flat_a2457
fof(lit_def_125,axiom,
! [X0] :
( iProver_Flat_a2457(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_a2459
fof(lit_def_126,axiom,
! [X0] :
( iProver_Flat_a2459(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_a2460
fof(lit_def_127,axiom,
! [X0] :
( iProver_Flat_a2460(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a2461
fof(lit_def_128,axiom,
! [X0] :
( iProver_Flat_a2461(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a2463
fof(lit_def_129,axiom,
! [X0] :
( iProver_Flat_a2463(X0)
<=> X0 = iProver_Domain_i_3 ) ).
%------ Positive definition of iProver_Flat_a2468
fof(lit_def_130,axiom,
! [X0] :
( iProver_Flat_a2468(X0)
<=> X0 = iProver_Domain_i_3 ) ).
%------ Positive definition of iProver_Flat_a2471
fof(lit_def_131,axiom,
! [X0] :
( iProver_Flat_a2471(X0)
<=> X0 = iProver_Domain_i_3 ) ).
%------ Positive definition of iProver_Flat_a2475
fof(lit_def_132,axiom,
! [X0] :
( iProver_Flat_a2475(X0)
<=> X0 = iProver_Domain_i_3 ) ).
%------ Positive definition of iProver_Flat_a2476
fof(lit_def_133,axiom,
! [X0] :
( iProver_Flat_a2476(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a2479
fof(lit_def_134,axiom,
! [X0] :
( iProver_Flat_a2479(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a2487
fof(lit_def_135,axiom,
! [X0] :
( iProver_Flat_a2487(X0)
<=> X0 = iProver_Domain_i_3 ) ).
%------ Positive definition of iProver_Flat_a2491
fof(lit_def_136,axiom,
! [X0] :
( iProver_Flat_a2491(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a2493
fof(lit_def_137,axiom,
! [X0] :
( iProver_Flat_a2493(X0)
<=> X0 = iProver_Domain_i_3 ) ).
%------ Positive definition of iProver_Flat_a2494
fof(lit_def_138,axiom,
! [X0] :
( iProver_Flat_a2494(X0)
<=> X0 = iProver_Domain_i_3 ) ).
%------ Positive definition of iProver_Flat_a2498
fof(lit_def_139,axiom,
! [X0] :
( iProver_Flat_a2498(X0)
<=> X0 = iProver_Domain_i_3 ) ).
%------ Positive definition of iProver_Flat_a2499
fof(lit_def_140,axiom,
! [X0] :
( iProver_Flat_a2499(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a2502
fof(lit_def_141,axiom,
! [X0] :
( iProver_Flat_a2502(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a2503
fof(lit_def_142,axiom,
! [X0] :
( iProver_Flat_a2503(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a2505
fof(lit_def_143,axiom,
! [X0] :
( iProver_Flat_a2505(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a2509
fof(lit_def_144,axiom,
! [X0] :
( iProver_Flat_a2509(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN464+1 : TPTP v9.3.1. Released v2.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p SAT
% 0.11/0.59 % Computer : n015.cluster.edu
% 0.11/0.59 % Model : x86_64 x86_64
% 0.11/0.59 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.59 % Memory : 8046.5625MB
% 0.11/0.59 % OS : Linux 6.8.0-71-generic
% 0.11/0.59 % CPULimit : 300
% 0.11/0.59 % WCLimit : 300
% 0.11/0.59 % DateTime : Fri Sep 25 01:23:14 UTC 2026
% 0.11/0.60 % CPUTime :
% 0.11/0.60 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p SAT
% 0.11/0.62 Running model finding
% 0.11/0.62 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fnt_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.64
% 0.14/0.64 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.64
% 0.14/0.64 % Detected problem language: tptp
% 0.14/0.65 % Proving...
% 3.33/1.40 % SZS status Started for theBenchmark.p
% 3.33/1.40 % SZS status CounterSatisfiable for theBenchmark.p
% 3.33/1.40
% 3.33/1.40 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.33/1.40
% 3.33/1.40 ------ iProver source info
% 3.33/1.40
% 3.33/1.40 git: date: 2026-07-19 20:42:38 +0200
% 3.33/1.40 git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.33/1.40 git: non_committed_changes: false
% 3.33/1.40
% 3.33/1.40 ------ Parsing...
% 3.33/1.40 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.33/1.40 ------ Proving...
% 3.33/1.40 ------ Problem Properties
% 3.33/1.40
% 3.33/1.40
% 3.33/1.40 clauses 340
% 3.33/1.40 conjectures 340
% 3.33/1.40 EPR 340
% 3.33/1.40 Horn 281
% 3.33/1.40 unary 0
% 3.33/1.40 binary 280
% 3.33/1.40 lits 975
% 3.33/1.40 lits eq 0
% 3.33/1.40 fd_pure 0
% 3.33/1.40 fd_pseudo 0
% 3.33/1.40 fd_cond 0
% 3.33/1.40 fd_pseudo_cond 0
% 3.33/1.40 AC symbols 0
% 3.33/1.40
% 3.33/1.40 ------ Input Options Time Limit: Unbounded
% 3.33/1.40
% 3.33/1.40
% 3.33/1.40 ------ Finite Models:
% 3.33/1.40
% 3.33/1.40 ------ lit_activity_flag true
% 3.33/1.40
% 3.33/1.40
% 3.33/1.40 ------ Trying domains of size >= : 1
% 3.33/1.40
% 3.33/1.40 ------ Trying domains of size >= : 2
% 3.33/1.40 ------
% 3.33/1.40 Current options:
% 3.33/1.40 ------
% 3.33/1.40
% 3.33/1.40 ------ Input Options
% 3.33/1.40
% 3.33/1.40 --out_options all
% 3.33/1.40 --tptp_safe_out true
% 3.33/1.40 --problem_path ""
% 3.33/1.40 --include_path ""
% 3.33/1.40 --clausifier res/vclausify_rel
% 3.33/1.40 --clausifier_options --mode clausify -t 101.66 -updr off
% 3.33/1.40 --stdin false
% 3.33/1.40 --proof_out true
% 3.33/1.40 --proof_dot_file ""
% 3.33/1.40 --proof_reduce_dot []
% 3.33/1.40 --suppress_sat_res false
% 3.33/1.40 --suppress_unsat_res true
% 3.33/1.40 --stats_out none
% 3.33/1.40 --stats_mem false
% 3.33/1.40 --theory_stats_out false
% 3.33/1.40
% 3.33/1.40 ------ General Options
% 3.33/1.40
% 3.33/1.40 --fof false
% 3.33/1.40 --time_out_real 304.98
% 3.33/1.40 --time_out_virtual -1.
% 3.33/1.40 --rnd_seed 13
% 3.33/1.40 --symbol_type_check false
% 3.33/1.40 --clausify_out false
% 3.33/1.40 --sig_cnt_out false
% 3.33/1.40 --trig_cnt_out false
% 3.33/1.40 --trig_cnt_out_tolerance 1.
% 3.33/1.40 --trig_cnt_out_sk_spl false
% 3.33/1.40 --abstr_cl_out false
% 3.33/1.40
% 3.33/1.40 ------ Interactive Mode
% 3.33/1.40
% 3.33/1.40 --interactive_mode false
% 3.33/1.40 --external_ip_address ""
% 3.33/1.40 --external_port 0
% 3.33/1.40
% 3.33/1.40 ------ Global Options
% 3.33/1.40
% 3.33/1.40 --schedule none
% 3.33/1.40 --add_important_lit false
% 3.33/1.40 --prop_solver_per_cl 500
% 3.33/1.40 --subs_bck_mult 8
% 3.33/1.40 --min_unsat_core false
% 3.33/1.40 --soft_assumptions false
% 3.33/1.40 --soft_lemma_size 3
% 3.33/1.40 --prop_impl_unit_size 0
% 3.33/1.40 --prop_impl_unit []
% 3.33/1.40 --share_sel_clauses true
% 3.33/1.40 --reset_solvers false
% 3.33/1.40 --bc_imp_inh [conj_cone]
% 3.33/1.40 --conj_cone_tolerance 3.
% 3.33/1.40 --extra_neg_conj none
% 3.33/1.40 --large_theory_mode true
% 3.33/1.40 --prolific_symb_bound 200
% 3.33/1.40 --lt_threshold 2000
% 3.33/1.40 --clause_weak_htbl true
% 3.33/1.40 --gc_record_bc_elim false
% 3.33/1.40
% 3.33/1.40 ------ Preprocessing Options
% 3.33/1.40
% 3.33/1.40 --preprocessing_flag false
% 3.33/1.40 --time_out_prep_mult 0.1
% 3.33/1.40 --splitting_mode input
% 3.33/1.40 --splitting_grd true
% 3.33/1.40 --splitting_cvd false
% 3.33/1.40 --splitting_cvd_svl false
% 3.33/1.40 --splitting_nvd 32
% 3.33/1.40 --sub_typing false
% 3.33/1.40 --prep_eq_flat_conj false
% 3.33/1.40 --prep_ineq_split false
% 3.33/1.40 --prep_eq_flat_all_gr false
% 3.33/1.40 --prep_gs_sim true
% 3.33/1.40 --prep_unflatten true
% 3.33/1.40 --prep_res_sim true
% 3.33/1.40 --prep_sup_sim_all true
% 3.33/1.40 --prep_sup_sim_sup false
% 3.33/1.40 --prep_upred true
% 3.33/1.40 --prep_well_definedness true
% 3.33/1.40 --prep_sem_filter exhaustive
% 3.33/1.40 --prep_sem_filter_out false
% 3.33/1.40 --pred_elim true
% 3.33/1.40 --res_sim_input true
% 3.33/1.40 --eq_ax_congr_red true
% 3.33/1.40 --pure_diseq_elim true
% 3.33/1.40 --brand_transform false
% 3.33/1.40 --non_eq_to_eq false
% 3.33/1.40 --prep_eq_proxy false
% 3.33/1.40 --prep_def_merge true
% 3.33/1.40 --prep_def_merge_prop_impl false
% 3.33/1.40 --prep_def_merge_mbd true
% 3.33/1.40 --prep_def_merge_tr_red false
% 3.33/1.40 --prep_def_merge_tr_cl false
% 3.33/1.40 --smt_preprocessing false
% 3.33/1.40 --smt_ac_axioms fast
% 3.33/1.40 --preprocessed_out false
% 3.33/1.40 --preprocessed_stats false
% 3.33/1.40
% 3.33/1.40 ------ Abstraction refinement Options
% 3.33/1.40
% 3.33/1.40 --abstr_ref []
% 3.33/1.40 --abstr_ref_prep false
% 3.33/1.40 --abstr_ref_until_sat false
% 3.33/1.40 --abstr_ref_sig_restrict funpre
% 3.33/1.40 --abstr_ref_af_restrict_to_split_sk false
% 3.33/1.40 --abstr_ref_under []
% 3.33/1.40
% 3.33/1.40 ------ SAT Options
% 3.33/1.40
% 3.33/1.40 --sat_mode true
% 3.33/1.40 --sat_fm_restart_options ""
% 3.33/1.40 --sat_gr_def false
% 3.33/1.40 --sat_epr_types false
% 3.33/1.40 --sat_non_cyclic_types false
% 3.33/1.40 --sat_finite_models true
% 3.33/1.40 --sat_fm_lemmas false
% 3.33/1.40 --sat_fm_prep false
% 3.33/1.40 --sat_fm_uc_incr false
% 3.33/1.40 --sat_out_model pos
% 3.33/1.40 --sat_out_clauses false
% 3.33/1.40
% 3.33/1.40 ------ QBF Options
% 3.33/1.40
% 3.33/1.40 --qbf_mode false
% 3.33/1.40 --qbf_elim_univ false
% 3.33/1.40 --qbf_dom_inst none
% 3.33/1.40 --qbf_dom_pre_inst false
% 3.33/1.40 --qbf_sk_in false
% 3.33/1.40 --qbf_pred_elim true
% 3.33/1.40 --qbf_split 512
% 3.33/1.40
% 3.33/1.40 ------ BMC1 Options
% 3.33/1.40
% 3.33/1.40 --bmc1_incremental false
% 3.33/1.40 --bmc1_axioms reachable_all
% 3.33/1.40 --bmc1_min_bound 0
% 3.33/1.40 --bmc1_max_bound -1
% 3.33/1.40 --bmc1_max_bound_default -1
% 3.33/1.40 --bmc1_symbol_reachability true
% 3.33/1.40 --bmc1_property_lemmas false
% 3.33/1.40 --bmc1_k_induction false
% 3.33/1.40 --bmc1_non_equiv_states false
% 3.33/1.40 --bmc1_deadlock false
% 3.33/1.40 --bmc1_ucm false
% 3.33/1.40 --bmc1_add_unsat_core none
% 3.33/1.40 --bmc1_unsat_core_children false
% 3.33/1.40 --bmc1_unsat_core_extrapolate_axioms false
% 3.33/1.40 --bmc1_out_stat full
% 3.33/1.40 --bmc1_ground_init false
% 3.33/1.40 --bmc1_pre_inst_next_state false
% 3.33/1.40 --bmc1_pre_inst_state false
% 3.33/1.40 --bmc1_pre_inst_reach_state false
% 3.33/1.40 --bmc1_out_unsat_core false
% 3.33/1.40 --bmc1_aig_witness_out false
% 3.33/1.40 --bmc1_verbose false
% 3.33/1.40 --bmc1_dump_clauses_tptp false
% 3.33/1.40 --bmc1_dump_unsat_core_tptp false
% 3.33/1.40 --bmc1_dump_file -
% 3.33/1.40 --bmc1_ucm_expand_uc_limit 128
% 3.33/1.40 --bmc1_ucm_n_expand_iterations 6
% 3.33/1.40 --bmc1_ucm_extend_mode 1
% 3.33/1.40 --bmc1_ucm_init_mode 2
% 3.33/1.40 --bmc1_ucm_cone_mode none
% 3.33/1.40 --bmc1_ucm_reduced_relation_type 0
% 3.33/1.40 --bmc1_ucm_relax_model 4
% 3.33/1.40 --bmc1_ucm_full_tr_after_sat true
% 3.33/1.40 --bmc1_ucm_expand_neg_assumptions false
% 3.33/1.40 --bmc1_ucm_layered_model none
% 3.33/1.40 --bmc1_ucm_max_lemma_size 10
% 3.33/1.40
% 3.33/1.40 ------ AIG Options
% 3.33/1.40
% 3.33/1.40 --aig_mode false
% 3.33/1.40
% 3.33/1.40 ------ Instantiation Options
% 3.33/1.40
% 3.33/1.40 --instantiation_flag true
% 3.33/1.40 --inst_sos_flag false
% 3.33/1.40 --inst_sos_phase true
% 3.33/1.40 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb]
% 3.33/1.40 --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 3.33/1.40 --inst_lit_sel_side num_symb
% 3.33/1.40 --inst_solver_per_active 1400
% 3.33/1.40 --inst_solver_calls_frac 1.
% 3.33/1.40 --inst_to_smt_solver true
% 3.33/1.40 --inst_passive_queue_type priority_queues
% 3.33/1.40 --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 3.33/1.40 --inst_passive_queues_freq [25;2]
% 3.33/1.40 --inst_dismatching true
% 3.33/1.40 --inst_eager_unprocessed_to_passive true
% 3.33/1.40 --inst_unprocessed_bound 1000
% 3.33/1.40 --inst_prop_sim_given true
% 3.33/1.40 --inst_prop_sim_new false
% 3.33/1.40 --inst_subs_new false
% 3.33/1.40 --inst_eq_res_simp false
% 3.33/1.40 --inst_subs_given false
% 3.33/1.40 --inst_orphan_elimination true
% 3.33/1.40 --inst_learning_loop_flag true
% 3.33/1.40 --inst_learning_start 3000
% 3.33/1.40 --inst_learning_factor 2
% 3.33/1.40 --inst_start_prop_sim_after_learn 3
% 3.33/1.40 --inst_sel_renew solver
% 3.33/1.40 --inst_lit_activity_flag true
% 3.33/1.40 --inst_restr_to_given false
% 3.33/1.40 --inst_activity_threshold 500
% 3.33/1.40
% 3.33/1.40 ------ Resolution Options
% 3.33/1.40
% 3.33/1.40 --resolution_flag false
% 3.33/1.40 --res_lit_sel adaptive
% 3.33/1.40 --res_lit_sel_side none
% 3.33/1.40 --res_ordering kbo
% 3.33/1.40 --res_to_prop_solver active
% 3.33/1.40 --res_prop_simpl_new false
% 3.33/1.40 --res_prop_simpl_given true
% 3.33/1.40 --res_to_smt_solver true
% 3.33/1.40 --res_passive_queue_type priority_queues
% 3.33/1.40 --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 3.33/1.40 --res_passive_queues_freq [15;5]
% 3.33/1.40 --res_forward_subs full
% 3.33/1.40 --res_backward_subs full
% 3.33/1.40 --res_forward_subs_resolution true
% 3.33/1.40 --res_backward_subs_resolution true
% 3.33/1.40 --res_orphan_elimination true
% 3.33/1.40 --res_time_limit 300.
% 3.33/1.40
% 3.33/1.40 ------ Superposition Options
% 3.33/1.40
% 3.33/1.40 --superposition_flag false
% 3.33/1.40 --sup_passive_queue_type priority_queues
% 3.33/1.40 --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]]
% 3.33/1.40 --sup_passive_queues_freq [8;1;4;4]
% 3.33/1.40 --twee_lhs_weight 4
% 3.33/1.40 --sup_set_join false
% 3.33/1.40 --sup_set_join_goals true
% 3.33/1.40 --sup_set_join_limit 1000
% 3.33/1.40 --demod_completeness_check fast
% 3.33/1.40 --demod_use_ground true
% 3.33/1.40 --sup_unprocessed_bound 0
% 3.33/1.40 --sup_to_prop_solver passive
% 3.33/1.40 --sup_prop_simpl_new true
% 3.33/1.40 --sup_prop_simpl_given true
% 3.33/1.40 --sup_fun_splitting false
% 3.33/1.40 --sup_iter_deepening 2
% 3.33/1.40 --sup_restarts_mult 12
% 3.33/1.40 --sup_score sim_d_gen
% 3.33/1.40 --sup_share_score_frac 0.2
% 3.33/1.40 --sup_share_max_num_cl 500
% 3.33/1.40 --sup_ordering kbo
% 3.33/1.40 --sup_symb_ordering invfreq
% 3.33/1.40 --sup_term_weight default
% 3.33/1.40
% 3.33/1.40 ------ Superposition Simplification Setup
% 3.33/1.40
% 3.33/1.40 --sup_indices_passive [LightNormIndex;FwDemodIndex]
% 3.33/1.40 --sup_full_triv [SMTSimplify;PropSubs]
% 3.33/1.40 --sup_full_fw [ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 3.33/1.40 --sup_full_bw [BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 3.33/1.40 --sup_immed_triv []
% 3.33/1.40 --sup_immed_fw_main [ACNormalisation;FwLightNorm;FwUnitSubsAndRes]
% 3.33/1.40 --sup_immed_fw_immed [ACNormalisation;FwUnitSubsAndRes]
% 3.33/1.40 --sup_immed_bw_main [BwUnitSubsAndRes;BwDemod]
% 3.33/1.40 --sup_immed_bw_immed [BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 3.33/1.40 --sup_input_triv [Unflattening;SMTSimplify]
% 3.33/1.40 --sup_input_fw [FwACDemod;ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 3.33/1.40 --sup_input_bw [BwACDemod;BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 3.33/1.40 --sup_full_fixpoint true
% 3.33/1.40 --sup_main_fixpoint true
% 3.33/1.40 --sup_immed_fixpoint false
% 3.33/1.40 --sup_input_fixpoint true
% 3.33/1.40 --sup_cache_sim none
% 3.33/1.40 --sup_smt_interval 500
% 3.33/1.40 --sup_bw_gjoin_interval 0
% 3.33/1.40
% 3.33/1.40 ------ Combination Options
% 3.33/1.40
% 3.33/1.40 --comb_mode clause_based
% 3.33/1.40 --comb_inst_mult 5
% 3.33/1.40 --comb_res_mult 1
% 3.33/1.40 --comb_sup_mult 8
% 3.33/1.40 --comb_sup_deep_mult 2
% 3.33/1.40
% 3.33/1.40 ------ Debug Options
% 3.33/1.40
% 3.33/1.40 --dbg_backtrace false
% 3.33/1.40 --dbg_dump_prop_clauses false
% 3.33/1.40 --dbg_dump_prop_clauses_file -
% 3.33/1.40 --dbg_out_stat false
% 3.33/1.40 --dbg_just_parse false
% 3.33/1.40
% 3.33/1.40
% 3.33/1.40
% 3.33/1.40
% 3.33/1.40 ------ Proving...
% 3.33/1.40
% 3.33/1.40 ------ Trying domains of size >= : 3
% 3.33/1.40
% 3.33/1.40
% 3.33/1.40 ------ Proving...
% 3.33/1.40
% 3.33/1.40
% 3.33/1.40 % SZS status CounterSatisfiable for theBenchmark.p
% 3.33/1.40
% 3.33/1.40 ------ Building Model...Done
% 3.33/1.40
% 3.33/1.40 %------ The model is defined over ground terms (initial term algebra).
% 3.33/1.40 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 3.33/1.40 %------ where \phi is a formula over the term algebra.
% 3.33/1.40 %------ If we have equality in the problem then it is also defined as a predicate above,
% 3.33/1.40 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 3.33/1.40 %------ See help for --sat_out_model for different model outputs.
% 3.33/1.40 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 3.33/1.40 %------ where the first argument stands for the sort ($i in the unsorted case)
% 3.33/1.40 % SZS output start Model for theBenchmark.p
% See solution above
% 3.33/1.41
%------------------------------------------------------------------------------