%------------------------------------------------------------------------------
% File : iProver-SAT---3.9.4
% Problem : SYN437+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 : n016.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:33 PM UTC 2026
% Result : CounterSatisfiable 3.29s 6.41s
% Output : Model 3.29s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
%------ Positive definition of hskp0
fof(lit_def,axiom,
( hskp0
<=> $false ) ).
%------ Positive definition of ndr1_0
fof(lit_def_001,axiom,
( ndr1_0
<=> $true ) ).
%------ Positive definition of c3_1
fof(lit_def_002,axiom,
! [X0] :
( c3_1(X0)
<=> X0 != iProver_Domain_i_1 ) ).
%------ Positive definition of c2_1
fof(lit_def_003,axiom,
! [X0] :
( c2_1(X0)
<=> $true ) ).
%------ Positive definition of c1_1
fof(lit_def_004,axiom,
! [X0] :
( c1_1(X0)
<=> X0 != iProver_Domain_i_1 ) ).
%------ Positive definition of hskp1
fof(lit_def_005,axiom,
( hskp1
<=> $false ) ).
%------ Positive definition of hskp2
fof(lit_def_006,axiom,
( hskp2
<=> $false ) ).
%------ Positive definition of c0_1
fof(lit_def_007,axiom,
! [X0] :
( c0_1(X0)
<=> $false ) ).
%------ Positive definition of hskp3
fof(lit_def_008,axiom,
( hskp3
<=> $true ) ).
%------ 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
<=> $true ) ).
%------ Positive definition of hskp7
fof(lit_def_012,axiom,
( hskp7
<=> $false ) ).
%------ Positive definition of hskp8
fof(lit_def_013,axiom,
( hskp8
<=> $false ) ).
%------ Positive definition of hskp9
fof(lit_def_014,axiom,
( hskp9
<=> $false ) ).
%------ Positive definition of hskp10
fof(lit_def_015,axiom,
( hskp10
<=> $false ) ).
%------ Positive definition of hskp11
fof(lit_def_016,axiom,
( hskp11
<=> $false ) ).
%------ 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
<=> $false ) ).
%------ 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
<=> $true ) ).
%------ 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
<=> $false ) ).
%------ 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
<=> $false ) ).
%------ Positive definition of hskp28
fof(lit_def_033,axiom,
( hskp28
<=> $false ) ).
%------ Positive definition of hskp29
fof(lit_def_034,axiom,
( hskp29
<=> $false ) ).
%------ 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
<=> $true ) ).
%------ 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
<=> $false ) ).
%------ 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
<=> $true ) ).
%------ Positive definition of hskp49
fof(lit_def_054,axiom,
( hskp49
<=> $false ) ).
%------ Positive definition of hskp50
fof(lit_def_055,axiom,
( hskp50
<=> $false ) ).
%------ Positive definition of hskp51
fof(lit_def_056,axiom,
( hskp51
<=> $false ) ).
%------ Positive definition of iProver_Flat_a402
fof(lit_def_057,axiom,
! [X0] :
( iProver_Flat_a402(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_a403
fof(lit_def_058,axiom,
! [X0] :
( iProver_Flat_a403(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_a405
fof(lit_def_059,axiom,
! [X0] :
( iProver_Flat_a405(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_a407
fof(lit_def_060,axiom,
! [X0] :
( iProver_Flat_a407(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a411
fof(lit_def_061,axiom,
! [X0] :
( iProver_Flat_a411(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a413
fof(lit_def_062,axiom,
! [X0] :
( iProver_Flat_a413(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_a416
fof(lit_def_063,axiom,
! [X0] :
( iProver_Flat_a416(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a418
fof(lit_def_064,axiom,
! [X0] :
( iProver_Flat_a418(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a420
fof(lit_def_065,axiom,
! [X0] :
( iProver_Flat_a420(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_a421
fof(lit_def_066,axiom,
! [X0] :
( iProver_Flat_a421(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a422
fof(lit_def_067,axiom,
! [X0] :
( iProver_Flat_a422(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a428
fof(lit_def_068,axiom,
! [X0] :
( iProver_Flat_a428(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_a430
fof(lit_def_069,axiom,
! [X0] :
( iProver_Flat_a430(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_a433
fof(lit_def_070,axiom,
! [X0] :
( iProver_Flat_a433(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_a437
fof(lit_def_071,axiom,
! [X0] :
( iProver_Flat_a437(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a440
fof(lit_def_072,axiom,
! [X0] :
( iProver_Flat_a440(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a441
fof(lit_def_073,axiom,
! [X0] :
( iProver_Flat_a441(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a443
fof(lit_def_074,axiom,
! [X0] :
( iProver_Flat_a443(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a444
fof(lit_def_075,axiom,
! [X0] :
( iProver_Flat_a444(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a445
fof(lit_def_076,axiom,
! [X0] :
( iProver_Flat_a445(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a448
fof(lit_def_077,axiom,
! [X0] :
( iProver_Flat_a448(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a450
fof(lit_def_078,axiom,
! [X0] :
( iProver_Flat_a450(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a451
fof(lit_def_079,axiom,
! [X0] :
( iProver_Flat_a451(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a452
fof(lit_def_080,axiom,
! [X0] :
( iProver_Flat_a452(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a454
fof(lit_def_081,axiom,
! [X0] :
( iProver_Flat_a454(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_a460
fof(lit_def_082,axiom,
! [X0] :
( iProver_Flat_a460(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a461
fof(lit_def_083,axiom,
! [X0] :
( iProver_Flat_a461(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a404
fof(lit_def_084,axiom,
! [X0] :
( iProver_Flat_a404(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_a408
fof(lit_def_085,axiom,
! [X0] :
( iProver_Flat_a408(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a409
fof(lit_def_086,axiom,
! [X0] :
( iProver_Flat_a409(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a410
fof(lit_def_087,axiom,
! [X0] :
( iProver_Flat_a410(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a412
fof(lit_def_088,axiom,
! [X0] :
( iProver_Flat_a412(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a414
fof(lit_def_089,axiom,
! [X0] :
( iProver_Flat_a414(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a415
fof(lit_def_090,axiom,
! [X0] :
( iProver_Flat_a415(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a417
fof(lit_def_091,axiom,
! [X0] :
( iProver_Flat_a417(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a419
fof(lit_def_092,axiom,
! [X0] :
( iProver_Flat_a419(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_a424
fof(lit_def_093,axiom,
! [X0] :
( iProver_Flat_a424(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a427
fof(lit_def_094,axiom,
! [X0] :
( iProver_Flat_a427(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_a429
fof(lit_def_095,axiom,
! [X0] :
( iProver_Flat_a429(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_a431
fof(lit_def_096,axiom,
! [X0] :
( iProver_Flat_a431(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_a432
fof(lit_def_097,axiom,
! [X0] :
( iProver_Flat_a432(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a434
fof(lit_def_098,axiom,
! [X0] :
( iProver_Flat_a434(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_a435
fof(lit_def_099,axiom,
! [X0] :
( iProver_Flat_a435(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a436
fof(lit_def_100,axiom,
! [X0] :
( iProver_Flat_a436(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a438
fof(lit_def_101,axiom,
! [X0] :
( iProver_Flat_a438(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a439
fof(lit_def_102,axiom,
! [X0] :
( iProver_Flat_a439(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a446
fof(lit_def_103,axiom,
! [X0] :
( iProver_Flat_a446(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_a449
fof(lit_def_104,axiom,
! [X0] :
( iProver_Flat_a449(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a455
fof(lit_def_105,axiom,
! [X0] :
( iProver_Flat_a455(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_a459
fof(lit_def_106,axiom,
! [X0] :
( iProver_Flat_a459(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a462
fof(lit_def_107,axiom,
! [X0] :
( iProver_Flat_a462(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_a464
fof(lit_def_108,axiom,
! [X0] :
( iProver_Flat_a464(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SYN437+1 : TPTP v9.3.1. Released v2.1.0.
% 0.00/0.07 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p SAT
% 0.18/5.45 % Computer : n016.cluster.edu
% 0.18/5.45 % Model : x86_64 x86_64
% 0.18/5.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/5.45 % Memory : 8046.5625MB
% 0.18/5.45 % OS : Linux 6.8.0-71-generic
% 0.18/5.45 % CPULimit : 300
% 0.18/5.45 % WCLimit : 300
% 0.18/5.45 % DateTime : Fri Sep 25 01:15:49 UTC 2026
% 0.18/5.45 % CPUTime :
% 0.18/5.45 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p SAT
% 0.18/5.50 Running model finding
% 0.18/5.50 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.21/5.51
% 0.21/5.51 % ======== iProver multi-core TPTP/SMT =========
% 0.21/5.51
% 0.21/5.51 % Detected problem language: tptp
% 0.21/5.53 % Proving...
% 3.29/6.41 % SZS status Started for theBenchmark.p
% 3.29/6.41 % SZS status CounterSatisfiable for theBenchmark.p
% 3.29/6.41
% 3.29/6.41 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.29/6.41
% 3.29/6.41 ------ iProver source info
% 3.29/6.41
% 3.29/6.41 git: date: 2026-07-19 20:42:38 +0200
% 3.29/6.41 git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.29/6.41 git: non_committed_changes: false
% 3.29/6.41
% 3.29/6.41 ------ Parsing...
% 3.29/6.41 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.29/6.41 ------ Proving...
% 3.29/6.41 ------ Problem Properties
% 3.29/6.41
% 3.29/6.41
% 3.29/6.41 clauses 256
% 3.29/6.41 conjectures 256
% 3.29/6.41 EPR 256
% 3.29/6.41 Horn 209
% 3.29/6.41 unary 0
% 3.29/6.41 binary 208
% 3.29/6.41 lits 764
% 3.29/6.41 lits eq 0
% 3.29/6.41 fd_pure 0
% 3.29/6.41 fd_pseudo 0
% 3.29/6.41 fd_cond 0
% 3.29/6.41 fd_pseudo_cond 0
% 3.29/6.41 AC symbols 0
% 3.29/6.41
% 3.29/6.41 ------ Input Options Time Limit: Unbounded
% 3.29/6.41
% 3.29/6.41
% 3.29/6.41 ------ Finite Models:
% 3.29/6.41
% 3.29/6.41 ------ lit_activity_flag true
% 3.29/6.41
% 3.29/6.41
% 3.29/6.41 ------ Trying domains of size >= : 1
% 3.29/6.41
% 3.29/6.41 ------ Trying domains of size >= : 2
% 3.29/6.41 ------
% 3.29/6.41 Current options:
% 3.29/6.41 ------
% 3.29/6.41
% 3.29/6.41 ------ Input Options
% 3.29/6.41
% 3.29/6.41 --out_options all
% 3.29/6.41 --tptp_safe_out true
% 3.29/6.41 --problem_path ""
% 3.29/6.41 --include_path ""
% 3.29/6.41 --clausifier res/vclausify_rel
% 3.29/6.41 --clausifier_options --mode clausify -t 101.66 -updr off
% 3.29/6.41 --stdin false
% 3.29/6.41 --proof_out true
% 3.29/6.41 --proof_dot_file ""
% 3.29/6.41 --proof_reduce_dot []
% 3.29/6.41 --suppress_sat_res false
% 3.29/6.41 --suppress_unsat_res true
% 3.29/6.41 --stats_out none
% 3.29/6.41 --stats_mem false
% 3.29/6.41 --theory_stats_out false
% 3.29/6.41
% 3.29/6.41 ------ General Options
% 3.29/6.41
% 3.29/6.41 --fof false
% 3.29/6.41 --time_out_real 304.97
% 3.29/6.41 --time_out_virtual -1.
% 3.29/6.41 --rnd_seed 13
% 3.29/6.41 --symbol_type_check false
% 3.29/6.41 --clausify_out false
% 3.29/6.41 --sig_cnt_out false
% 3.29/6.41 --trig_cnt_out false
% 3.29/6.41 --trig_cnt_out_tolerance 1.
% 3.29/6.41 --trig_cnt_out_sk_spl false
% 3.29/6.41 --abstr_cl_out false
% 3.29/6.41
% 3.29/6.41 ------ Interactive Mode
% 3.29/6.41
% 3.29/6.41 --interactive_mode false
% 3.29/6.41 --external_ip_address ""
% 3.29/6.41 --external_port 0
% 3.29/6.41
% 3.29/6.41 ------ Global Options
% 3.29/6.41
% 3.29/6.41 --schedule none
% 3.29/6.41 --add_important_lit false
% 3.29/6.41 --prop_solver_per_cl 500
% 3.29/6.41 --subs_bck_mult 8
% 3.29/6.41 --min_unsat_core false
% 3.29/6.41 --soft_assumptions false
% 3.29/6.41 --soft_lemma_size 3
% 3.29/6.41 --prop_impl_unit_size 0
% 3.29/6.41 --prop_impl_unit []
% 3.29/6.41 --share_sel_clauses true
% 3.29/6.41 --reset_solvers false
% 3.29/6.41 --bc_imp_inh [conj_cone]
% 3.29/6.41 --conj_cone_tolerance 3.
% 3.29/6.41 --extra_neg_conj none
% 3.29/6.41 --large_theory_mode true
% 3.29/6.41 --prolific_symb_bound 200
% 3.29/6.41 --lt_threshold 2000
% 3.29/6.41 --clause_weak_htbl true
% 3.29/6.41 --gc_record_bc_elim false
% 3.29/6.41
% 3.29/6.41 ------ Preprocessing Options
% 3.29/6.41
% 3.29/6.41 --preprocessing_flag false
% 3.29/6.41 --time_out_prep_mult 0.1
% 3.29/6.41 --splitting_mode input
% 3.29/6.41 --splitting_grd true
% 3.29/6.41 --splitting_cvd false
% 3.29/6.41 --splitting_cvd_svl false
% 3.29/6.41 --splitting_nvd 32
% 3.29/6.41 --sub_typing false
% 3.29/6.41 --prep_eq_flat_conj false
% 3.29/6.41 --prep_ineq_split false
% 3.29/6.41 --prep_eq_flat_all_gr false
% 3.29/6.41 --prep_gs_sim true
% 3.29/6.41 --prep_unflatten true
% 3.29/6.41 --prep_res_sim true
% 3.29/6.41 --prep_sup_sim_all true
% 3.29/6.41 --prep_sup_sim_sup false
% 3.29/6.41 --prep_upred true
% 3.29/6.41 --prep_well_definedness true
% 3.29/6.41 --prep_sem_filter exhaustive
% 3.29/6.41 --prep_sem_filter_out false
% 3.29/6.41 --pred_elim true
% 3.29/6.41 --res_sim_input true
% 3.29/6.41 --eq_ax_congr_red true
% 3.29/6.41 --pure_diseq_elim true
% 3.29/6.41 --brand_transform false
% 3.29/6.41 --non_eq_to_eq false
% 3.29/6.41 --prep_eq_proxy false
% 3.29/6.41 --prep_def_merge true
% 3.29/6.41 --prep_def_merge_prop_impl false
% 3.29/6.41 --prep_def_merge_mbd true
% 3.29/6.41 --prep_def_merge_tr_red false
% 3.29/6.41 --prep_def_merge_tr_cl false
% 3.29/6.41 --smt_preprocessing false
% 3.29/6.41 --smt_ac_axioms fast
% 3.29/6.41 --preprocessed_out false
% 3.29/6.41 --preprocessed_stats false
% 3.29/6.41
% 3.29/6.41 ------ Abstraction refinement Options
% 3.29/6.41
% 3.29/6.41 --abstr_ref []
% 3.29/6.41 --abstr_ref_prep false
% 3.29/6.41 --abstr_ref_until_sat false
% 3.29/6.41 --abstr_ref_sig_restrict funpre
% 3.29/6.41 --abstr_ref_af_restrict_to_split_sk false
% 3.29/6.41 --abstr_ref_under []
% 3.29/6.41
% 3.29/6.41 ------ SAT Options
% 3.29/6.41
% 3.29/6.41 --sat_mode true
% 3.29/6.41 --sat_fm_restart_options ""
% 3.29/6.41 --sat_gr_def false
% 3.29/6.41 --sat_epr_types false
% 3.29/6.41 --sat_non_cyclic_types false
% 3.29/6.41 --sat_finite_models true
% 3.29/6.41 --sat_fm_lemmas false
% 3.29/6.41 --sat_fm_prep false
% 3.29/6.41 --sat_fm_uc_incr false
% 3.29/6.41 --sat_out_model pos
% 3.29/6.41 --sat_out_clauses false
% 3.29/6.41
% 3.29/6.41 ------ QBF Options
% 3.29/6.41
% 3.29/6.41 --qbf_mode false
% 3.29/6.41 --qbf_elim_univ false
% 3.29/6.41 --qbf_dom_inst none
% 3.29/6.41 --qbf_dom_pre_inst false
% 3.29/6.41 --qbf_sk_in false
% 3.29/6.41 --qbf_pred_elim true
% 3.29/6.41 --qbf_split 512
% 3.29/6.41
% 3.29/6.41 ------ BMC1 Options
% 3.29/6.41
% 3.29/6.41 --bmc1_incremental false
% 3.29/6.41 --bmc1_axioms reachable_all
% 3.29/6.41 --bmc1_min_bound 0
% 3.29/6.41 --bmc1_max_bound -1
% 3.29/6.41 --bmc1_max_bound_default -1
% 3.29/6.41 --bmc1_symbol_reachability true
% 3.29/6.41 --bmc1_property_lemmas false
% 3.29/6.41 --bmc1_k_induction false
% 3.29/6.41 --bmc1_non_equiv_states false
% 3.29/6.41 --bmc1_deadlock false
% 3.29/6.41 --bmc1_ucm false
% 3.29/6.41 --bmc1_add_unsat_core none
% 3.29/6.41 --bmc1_unsat_core_children false
% 3.29/6.41 --bmc1_unsat_core_extrapolate_axioms false
% 3.29/6.41 --bmc1_out_stat full
% 3.29/6.41 --bmc1_ground_init false
% 3.29/6.41 --bmc1_pre_inst_next_state false
% 3.29/6.41 --bmc1_pre_inst_state false
% 3.29/6.41 --bmc1_pre_inst_reach_state false
% 3.29/6.41 --bmc1_out_unsat_core false
% 3.29/6.41 --bmc1_aig_witness_out false
% 3.29/6.41 --bmc1_verbose false
% 3.29/6.41 --bmc1_dump_clauses_tptp false
% 3.29/6.41 --bmc1_dump_unsat_core_tptp false
% 3.29/6.41 --bmc1_dump_file -
% 3.29/6.41 --bmc1_ucm_expand_uc_limit 128
% 3.29/6.41 --bmc1_ucm_n_expand_iterations 6
% 3.29/6.41 --bmc1_ucm_extend_mode 1
% 3.29/6.41 --bmc1_ucm_init_mode 2
% 3.29/6.41 --bmc1_ucm_cone_mode none
% 3.29/6.41 --bmc1_ucm_reduced_relation_type 0
% 3.29/6.41 --bmc1_ucm_relax_model 4
% 3.29/6.41 --bmc1_ucm_full_tr_after_sat true
% 3.29/6.41 --bmc1_ucm_expand_neg_assumptions false
% 3.29/6.41 --bmc1_ucm_layered_model none
% 3.29/6.41 --bmc1_ucm_max_lemma_size 10
% 3.29/6.41
% 3.29/6.41 ------ AIG Options
% 3.29/6.41
% 3.29/6.41 --aig_mode false
% 3.29/6.41
% 3.29/6.41 ------ Instantiation Options
% 3.29/6.41
% 3.29/6.41 --instantiation_flag true
% 3.29/6.41 --inst_sos_flag false
% 3.29/6.41 --inst_sos_phase true
% 3.29/6.41 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb]
% 3.29/6.41 --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 3.29/6.41 --inst_lit_sel_side num_symb
% 3.29/6.41 --inst_solver_per_active 1400
% 3.29/6.41 --inst_solver_calls_frac 1.
% 3.29/6.41 --inst_to_smt_solver true
% 3.29/6.41 --inst_passive_queue_type priority_queues
% 3.29/6.41 --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 3.29/6.41 --inst_passive_queues_freq [25;2]
% 3.29/6.41 --inst_dismatching true
% 3.29/6.41 --inst_eager_unprocessed_to_passive true
% 3.29/6.41 --inst_unprocessed_bound 1000
% 3.29/6.41 --inst_prop_sim_given true
% 3.29/6.41 --inst_prop_sim_new false
% 3.29/6.41 --inst_subs_new false
% 3.29/6.41 --inst_eq_res_simp false
% 3.29/6.41 --inst_subs_given false
% 3.29/6.41 --inst_orphan_elimination true
% 3.29/6.41 --inst_learning_loop_flag true
% 3.29/6.41 --inst_learning_start 3000
% 3.29/6.41 --inst_learning_factor 2
% 3.29/6.41 --inst_start_prop_sim_after_learn 3
% 3.29/6.41 --inst_sel_renew solver
% 3.29/6.41 --inst_lit_activity_flag true
% 3.29/6.41 --inst_restr_to_given false
% 3.29/6.41 --inst_activity_threshold 500
% 3.29/6.41
% 3.29/6.41 ------ Resolution Options
% 3.29/6.41
% 3.29/6.41 --resolution_flag false
% 3.29/6.41 --res_lit_sel adaptive
% 3.29/6.41 --res_lit_sel_side none
% 3.29/6.41 --res_ordering kbo
% 3.29/6.41 --res_to_prop_solver active
% 3.29/6.41 --res_prop_simpl_new false
% 3.29/6.41 --res_prop_simpl_given true
% 3.29/6.41 --res_to_smt_solver true
% 3.29/6.41 --res_passive_queue_type priority_queues
% 3.29/6.41 --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 3.29/6.41 --res_passive_queues_freq [15;5]
% 3.29/6.41 --res_forward_subs full
% 3.29/6.41 --res_backward_subs full
% 3.29/6.41 --res_forward_subs_resolution true
% 3.29/6.41 --res_backward_subs_resolution true
% 3.29/6.41 --res_orphan_elimination true
% 3.29/6.41 --res_time_limit 300.
% 3.29/6.41
% 3.29/6.41 ------ Superposition Options
% 3.29/6.41
% 3.29/6.41 --superposition_flag false
% 3.29/6.41 --sup_passive_queue_type priority_queues
% 3.29/6.41 --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.29/6.41 --sup_passive_queues_freq [8;1;4;4]
% 3.29/6.41 --twee_lhs_weight 4
% 3.29/6.41 --sup_set_join false
% 3.29/6.41 --sup_set_join_goals true
% 3.29/6.41 --sup_set_join_limit 1000
% 3.29/6.41 --demod_completeness_check fast
% 3.29/6.41 --demod_use_ground true
% 3.29/6.41 --sup_unprocessed_bound 0
% 3.29/6.41 --sup_to_prop_solver passive
% 3.29/6.41 --sup_prop_simpl_new true
% 3.29/6.41 --sup_prop_simpl_given true
% 3.29/6.41 --sup_fun_splitting false
% 3.29/6.41 --sup_iter_deepening 2
% 3.29/6.41 --sup_restarts_mult 12
% 3.29/6.41 --sup_score sim_d_gen
% 3.29/6.41 --sup_share_score_frac 0.2
% 3.29/6.41 --sup_share_max_num_cl 500
% 3.29/6.41 --sup_ordering kbo
% 3.29/6.41 --sup_symb_ordering invfreq
% 3.29/6.41 --sup_term_weight default
% 3.29/6.41
% 3.29/6.41 ------ Superposition Simplification Setup
% 3.29/6.41
% 3.29/6.41 --sup_indices_passive [LightNormIndex;FwDemodIndex]
% 3.29/6.41 --sup_full_triv [SMTSimplify;PropSubs]
% 3.29/6.41 --sup_full_fw [ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 3.29/6.41 --sup_full_bw [BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 3.29/6.41 --sup_immed_triv []
% 3.29/6.41 --sup_immed_fw_main [ACNormalisation;FwLightNorm;FwUnitSubsAndRes]
% 3.29/6.41 --sup_immed_fw_immed [ACNormalisation;FwUnitSubsAndRes]
% 3.29/6.41 --sup_immed_bw_main [BwUnitSubsAndRes;BwDemod]
% 3.29/6.41 --sup_immed_bw_immed [BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 3.29/6.41 --sup_input_triv [Unflattening;SMTSimplify]
% 3.29/6.41 --sup_input_fw [FwACDemod;ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 3.29/6.41 --sup_input_bw [BwACDemod;BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 3.29/6.41 --sup_full_fixpoint true
% 3.29/6.41 --sup_main_fixpoint true
% 3.29/6.41 --sup_immed_fixpoint false
% 3.29/6.41 --sup_input_fixpoint true
% 3.29/6.41 --sup_cache_sim none
% 3.29/6.41 --sup_smt_interval 500
% 3.29/6.41 --sup_bw_gjoin_interval 0
% 3.29/6.41
% 3.29/6.41 ------ Combination Options
% 3.29/6.41
% 3.29/6.41 --comb_mode clause_based
% 3.29/6.41 --comb_inst_mult 5
% 3.29/6.41 --comb_res_mult 1
% 3.29/6.41 --comb_sup_mult 8
% 3.29/6.41 --comb_sup_deep_mult 2
% 3.29/6.41
% 3.29/6.41 ------ Debug Options
% 3.29/6.41
% 3.29/6.41 --dbg_backtrace false
% 3.29/6.41 --dbg_dump_prop_clauses false
% 3.29/6.41 --dbg_dump_prop_clauses_file -
% 3.29/6.41 --dbg_out_stat false
% 3.29/6.41 --dbg_just_parse false
% 3.29/6.41
% 3.29/6.41
% 3.29/6.41
% 3.29/6.41
% 3.29/6.41 ------ Proving...
% 3.29/6.41
% 3.29/6.41
% 3.29/6.41 % SZS status CounterSatisfiable for theBenchmark.p
% 3.29/6.41
% 3.29/6.41 ------ Building Model...Done
% 3.29/6.41
% 3.29/6.41 %------ The model is defined over ground terms (initial term algebra).
% 3.29/6.41 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 3.29/6.41 %------ where \phi is a formula over the term algebra.
% 3.29/6.41 %------ If we have equality in the problem then it is also defined as a predicate above,
% 3.29/6.41 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 3.29/6.41 %------ See help for --sat_out_model for different model outputs.
% 3.29/6.41 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 3.29/6.41 %------ where the first argument stands for the sort ($i in the unsorted case)
% 3.29/6.41 % SZS output start Model for theBenchmark.p
% See solution above
% 3.29/6.42
%------------------------------------------------------------------------------