TSTP Solution File: SYN423+1 by iProver-SAT---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver-SAT---3.9
% Problem : SYN423+1 : TPTP v8.1.2. Released v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d SAT
% Computer : n008.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 May 3 03:34:58 EDT 2024
% Result : CounterSatisfiable 2.92s 1.15s
% Output : Model 2.92s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
%------ Positive definition of c6_2
fof(lit_def,axiom,
! [X0,X1] :
( c6_2(X0,X1)
<=> ( ( X0 = a617
& X1 = a478 )
| ( X0 = a521
& X1 = a478 )
| ( X0 = a491
& X1 = a478 )
| ( X0 = a485
& X1 = a478 )
| ( X0 = a434
& X1 = a478 )
| ( X0 = a581
& X1 = a478 )
| ( X0 = a571
& X1 = a478 )
| ( X0 = a563
& X1 = a478 )
| ( X0 = a526
& X1 = a478 )
| ( X0 = a513
& X1 = a478 )
| ( X0 = a498
& X1 = a478 )
| ( X0 = a493
& X1 = a478 )
| ( X0 = a470
& X1 = a478 )
| ( X0 = a468
& X1 = a478 )
| ( X0 = a468
& X1 = a469 )
| ( X0 = a465
& X1 = a478 )
| ( X0 = a465
& X1 = a466 )
| ( X0 = a460
& X1 = a478 )
| ( X0 = a453
& X1 = a478 )
| ( X0 = a451
& X1 = a478 )
| ( X0 = a448
& X1 = a478 ) ) ) ).
%------ Positive definition of c3_2
fof(lit_def_001,axiom,
! [X0,X1] :
( c3_2(X0,X1)
<=> ( ( X0 = a491
& X1 = a492 )
| ( X0 = a443
& X1 = a445 ) ) ) ).
%------ Positive definition of c10_2
fof(lit_def_002,axiom,
! [X0,X1] :
( c10_2(X0,X1)
<=> ( ( X0 = a479
& X1 = a480 )
| ( X0 = a457
& X1 = a459 )
| ( X1 = a597
& X0 != a436 )
| ( X1 = a432
& X0 != a516
& X0 != a460 ) ) ) ).
%------ Positive definition of ndr1_1
fof(lit_def_003,axiom,
! [X0] :
( ndr1_1(X0)
<=> ( ( X0 != a609
& X0 != a595
& X0 != a543
& X0 != a515
& X0 != a575
& X0 != a546
& X0 != a541
& X0 != a516
& X0 != a460
& X0 != a436 )
| X0 = a609
| X0 = a595
| X0 = a586
| X0 = a543
| X0 = a515
| X0 = a508
| X0 = a491
| X0 = a485
| X0 = a443
| X0 = a434
| X0 = a575
| X0 = a571
| X0 = a546
| X0 = a541
| X0 = a516
| X0 = a514
| X0 = a501
| X0 = a479
| X0 = a470
| X0 = a468
| X0 = a465
| X0 = a457
| X0 = a455
| X0 = a453
| X0 = a451 ) ) ).
%------ Positive definition of sP54
fof(lit_def_004,axiom,
( sP54
<=> $true ) ).
%------ Positive definition of c1_1
fof(lit_def_005,axiom,
! [X0] :
( c1_1(X0)
<=> ( X0 = a586
| X0 = a543
| X0 = a515
| X0 = a485
| X0 = a610
| X0 = a574
| X0 = a571
| X0 = a479
| X0 = a460
| X0 = a451 ) ) ).
%------ Positive definition of c6_1
fof(lit_def_006,axiom,
! [X0] :
( c6_1(X0)
<=> ( X0 = a616
| X0 = a434
| X0 = a571
| X0 = a490
| X0 = a483 ) ) ).
%------ Positive definition of ndr1_0
fof(lit_def_007,axiom,
( ndr1_0
<=> $true ) ).
%------ Positive definition of c9_2
fof(lit_def_008,axiom,
! [X0,X1] :
( c9_2(X0,X1)
<=> ( ( X0 = a609
& X1 = a523 )
| ( X0 = a595
& X1 = a523 )
| ( X0 = a586
& X1 = a587 )
| ( X0 = a515
& X1 = a523 )
| ( X0 = a575
& X1 = a523 )
| ( X0 = a546
& X1 = a523 )
| ( X0 = a541
& X1 = a523 )
| ( X0 = a516
& X1 = a523 )
| ( X0 = a514
& X1 = a523 )
| ( X0 = a479
& X1 = a480 )
| ( X0 = a468
& X1 = a469 ) ) ) ).
%------ Positive definition of sP53
fof(lit_def_009,axiom,
( sP53
<=> $false ) ).
%------ Positive definition of c8_2
fof(lit_def_010,axiom,
! [X0,X1] :
( c8_2(X0,X1)
<=> ( ( X0 = a609
& X1 != a545
& X1 != a506
& X1 != a476
& X1 != a577
& X1 != a561
& X1 != a535
& X1 != a518
& X1 != a511
& X1 != a432 )
| ( X0 = a543
& X1 = a432 )
| ( X0 = a479
& X1 = a481 )
| ( X0 = a455
& X1 = a456 )
| ( X0 = a453
& X1 != a545
& X1 != a506
& X1 != a476
& X1 != a577
& X1 != a561
& X1 != a535
& X1 != a518
& X1 != a511
& X1 != a432 ) ) ) ).
%------ Positive definition of c5_2
fof(lit_def_011,axiom,
! [X0,X1] :
( c5_2(X0,X1)
<=> ( ( X0 = a543
& X1 = a432 )
| ( X0 = a485
& X1 = a486 )
| ( X0 = a443
& X1 = a445 )
| ( X0 = a571
& X1 = a433 )
| ( X0 = a479
& X1 = a481 )
| ( X0 = a451
& X1 = a452 )
| ( X1 = a432
& X0 != a543
& X0 != a434
& X0 != a516
& X0 != a493
& X0 != a460
& X0 != a453 ) ) ) ).
%------ Positive definition of c4_2
fof(lit_def_012,axiom,
! [X0,X1] :
( c4_2(X0,X1)
<=> X1 = a432 ) ).
%------ Positive definition of c7_2
fof(lit_def_013,axiom,
! [X0,X1] :
( c7_2(X0,X1)
<=> ( ( X0 = a485
& X1 = a486 )
| ( X0 = a470
& X1 = a471 )
| ( X0 = a453
& X1 = a454 ) ) ) ).
%------ Positive definition of sP52
fof(lit_def_014,axiom,
( sP52
<=> $false ) ).
%------ Positive definition of c2_2
fof(lit_def_015,axiom,
! [X0,X1] :
( c2_2(X0,X1)
<=> ( X1 = a476
& X0 != a609
& X0 != a572
& X0 != a515
& X0 != a491
& X0 != a563
& X0 != a546
& X0 != a526
& X0 != a513
& X0 != a453 ) ) ).
%------ Positive definition of c8_1
fof(lit_def_016,axiom,
! [X0] :
( c8_1(X0)
<=> ( X0 = a515
| X0 = a491
| X0 = a453 ) ) ).
%------ Positive definition of c3_1
fof(lit_def_017,axiom,
! [X0] :
( c3_1(X0)
<=> $false ) ).
%------ Positive definition of sP51
fof(lit_def_018,axiom,
( sP51
<=> $false ) ).
%------ Positive definition of c1_2
fof(lit_def_019,axiom,
! [X0,X1] :
( c1_2(X0,X1)
<=> ( ( X0 = a572
& X1 = a475 )
| ( X0 = a543
& X1 = a475 )
| ( X0 = a443
& X1 = a444 )
| ( X0 = a457
& X1 = a458 ) ) ) ).
%------ Positive definition of sP50
fof(lit_def_020,axiom,
( sP50
<=> $false ) ).
%------ Positive definition of c9_1
fof(lit_def_021,axiom,
! [X0] :
( c9_1(X0)
<=> $false ) ).
%------ Positive definition of sP49
fof(lit_def_022,axiom,
( sP49
<=> $true ) ).
%------ Positive definition of sP46
fof(lit_def_023,axiom,
! [X0] :
( sP46(X0)
<=> $false ) ).
%------ Positive definition of c4_1
fof(lit_def_024,axiom,
! [X0] :
( c4_1(X0)
<=> ( X0 = a443
| X0 = a500 ) ) ).
%------ Positive definition of sP48
fof(lit_def_025,axiom,
( sP48
<=> $false ) ).
%------ Positive definition of sP47
fof(lit_def_026,axiom,
( sP47
<=> $false ) ).
%------ Positive definition of sP44
fof(lit_def_027,axiom,
! [X0] :
( sP44(X0)
<=> $false ) ).
%------ Positive definition of c10_1
fof(lit_def_028,axiom,
! [X0] :
( c10_1(X0)
<=> ( X0 = a609
| X0 = a595
| X0 = a515
| X0 = a575
| X0 = a546
| X0 = a541
| X0 = a516
| X0 = a514 ) ) ).
%------ Positive definition of sP45
fof(lit_def_029,axiom,
( sP45
<=> $false ) ).
%------ Positive definition of c7_1
fof(lit_def_030,axiom,
! [X0] :
( c7_1(X0)
<=> ( X0 = a615
| X0 = a571 ) ) ).
%------ Positive definition of sP43
fof(lit_def_031,axiom,
( sP43
<=> $true ) ).
%------ Positive definition of sP42
fof(lit_def_032,axiom,
( sP42
<=> $false ) ).
%------ Positive definition of sP41
fof(lit_def_033,axiom,
! [X0] :
( sP41(X0)
<=> $false ) ).
%------ Positive definition of sP40
fof(lit_def_034,axiom,
( sP40
<=> $false ) ).
%------ Positive definition of sP39
fof(lit_def_035,axiom,
( sP39
<=> $true ) ).
%------ Positive definition of sP38
fof(lit_def_036,axiom,
( sP38
<=> $false ) ).
%------ Positive definition of sP37
fof(lit_def_037,axiom,
( sP37
<=> $false ) ).
%------ Positive definition of sP36
fof(lit_def_038,axiom,
( sP36
<=> $false ) ).
%------ Positive definition of sP35
fof(lit_def_039,axiom,
( sP35
<=> $false ) ).
%------ Positive definition of sP34
fof(lit_def_040,axiom,
( sP34
<=> $false ) ).
%------ Positive definition of sP33
fof(lit_def_041,axiom,
( sP33
<=> $false ) ).
%------ Positive definition of sP32
fof(lit_def_042,axiom,
! [X0] :
( sP32(X0)
<=> $false ) ).
%------ Positive definition of c2_1
fof(lit_def_043,axiom,
! [X0] :
( c2_1(X0)
<=> ( ( X0 != a617
& X0 != a609
& X0 != a595
& X0 != a572
& X0 != a543
& X0 != a521
& X0 != a515
& X0 != a499
& X0 != a491
& X0 != a485
& X0 != a434
& X0 != a610
& X0 != a581
& X0 != a575
& X0 != a574
& X0 != a571
& X0 != a563
& X0 != a546
& X0 != a541
& X0 != a526
& X0 != a516
& X0 != a513
& X0 != a498
& X0 != a493
& X0 != a479
& X0 != a470
& X0 != a468
& X0 != a465
& X0 != a460
& X0 != a453
& X0 != a451
& X0 != a448 )
| X0 = a572
| X0 = a543
| X0 = a499
| X0 = a610
| X0 = a574
| X0 = a482
| X0 = a479 ) ) ).
%------ Positive definition of sP31
fof(lit_def_044,axiom,
( sP31
<=> $false ) ).
%------ Positive definition of sP30
fof(lit_def_045,axiom,
( sP30
<=> $false ) ).
%------ Positive definition of sP29
fof(lit_def_046,axiom,
! [X0] :
( sP29(X0)
<=> $false ) ).
%------ Positive definition of sP28
fof(lit_def_047,axiom,
( sP28
<=> $false ) ).
%------ Positive definition of sP27
fof(lit_def_048,axiom,
( sP27
<=> $true ) ).
%------ Positive definition of sP26
fof(lit_def_049,axiom,
( sP26
<=> $true ) ).
%------ Positive definition of sP25
fof(lit_def_050,axiom,
( sP25
<=> $false ) ).
%------ Positive definition of sP24
fof(lit_def_051,axiom,
( sP24
<=> $false ) ).
%------ Positive definition of sP23
fof(lit_def_052,axiom,
! [X0] :
( sP23(X0)
<=> $false ) ).
%------ Positive definition of sP22
fof(lit_def_053,axiom,
( sP22
<=> $false ) ).
%------ Positive definition of c5_1
fof(lit_def_054,axiom,
! [X0] :
( c5_1(X0)
<=> $false ) ).
%------ Positive definition of sP21
fof(lit_def_055,axiom,
( sP21
<=> $false ) ).
%------ Positive definition of sP20
fof(lit_def_056,axiom,
( sP20
<=> $false ) ).
%------ Positive definition of sP19
fof(lit_def_057,axiom,
( sP19
<=> $true ) ).
%------ Positive definition of sP18
fof(lit_def_058,axiom,
( sP18
<=> $true ) ).
%------ Positive definition of sP17
fof(lit_def_059,axiom,
( sP17
<=> $true ) ).
%------ Positive definition of sP16
fof(lit_def_060,axiom,
( sP16
<=> $false ) ).
%------ Positive definition of sP15
fof(lit_def_061,axiom,
( sP15
<=> $false ) ).
%------ Positive definition of sP13
fof(lit_def_062,axiom,
! [X0] :
( sP13(X0)
<=> $false ) ).
%------ Positive definition of sP14
fof(lit_def_063,axiom,
( sP14
<=> $false ) ).
%------ Positive definition of sP12
fof(lit_def_064,axiom,
! [X0] :
( sP12(X0)
<=> $false ) ).
%------ Positive definition of sP11
fof(lit_def_065,axiom,
( sP11
<=> $true ) ).
%------ Positive definition of sP10
fof(lit_def_066,axiom,
( sP10
<=> $true ) ).
%------ Positive definition of sP9
fof(lit_def_067,axiom,
( sP9
<=> $true ) ).
%------ Positive definition of sP8
fof(lit_def_068,axiom,
! [X0] :
( sP8(X0)
<=> ( X0 != a609
& X0 != a595
& X0 != a572
& X0 != a543
& X0 != a515
& X0 != a491
& X0 != a575
& X0 != a563
& X0 != a546
& X0 != a541
& X0 != a526
& X0 != a516
& X0 != a513
& X0 != a460
& X0 != a453 ) ) ).
%------ Positive definition of sP6
fof(lit_def_069,axiom,
! [X0] :
( sP6(X0)
<=> $false ) ).
%------ Positive definition of sP7
fof(lit_def_070,axiom,
( sP7
<=> $true ) ).
%------ Positive definition of sP5
fof(lit_def_071,axiom,
( sP5
<=> $false ) ).
%------ Positive definition of sP3
fof(lit_def_072,axiom,
! [X0] :
( sP3(X0)
<=> $false ) ).
%------ Positive definition of sP4
fof(lit_def_073,axiom,
( sP4
<=> $false ) ).
%------ Positive definition of sP2
fof(lit_def_074,axiom,
( sP2
<=> $true ) ).
%------ Positive definition of sP1
fof(lit_def_075,axiom,
( sP1
<=> $true ) ).
%------ Positive definition of sP0
fof(lit_def_076,axiom,
! [X0] :
( sP0(X0)
<=> $false ) ).
%------ Positive definition of c9_0
fof(lit_def_077,axiom,
( c9_0
<=> $false ) ).
%------ Positive definition of c7_0
fof(lit_def_078,axiom,
( c7_0
<=> $true ) ).
%------ Positive definition of c5_0
fof(lit_def_079,axiom,
( c5_0
<=> $false ) ).
%------ Positive definition of c4_0
fof(lit_def_080,axiom,
( c4_0
<=> $true ) ).
%------ Positive definition of c3_0
fof(lit_def_081,axiom,
( c3_0
<=> $true ) ).
%------ Positive definition of c2_0
fof(lit_def_082,axiom,
( c2_0
<=> $true ) ).
%------ Positive definition of c10_0
fof(lit_def_083,axiom,
( c10_0
<=> $false ) ).
%------ Positive definition of c1_0
fof(lit_def_084,axiom,
( c1_0
<=> $false ) ).
%------ Positive definition of c8_0
fof(lit_def_085,axiom,
( c8_0
<=> $false ) ).
%------ Positive definition of c6_0
fof(lit_def_086,axiom,
( c6_0
<=> $true ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN423+1 : TPTP v8.1.2. Released v2.1.0.
% 0.03/0.13 % Command : run_iprover %s %d SAT
% 0.13/0.35 % Computer : n008.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu May 2 21:02:58 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.47 Running model finding
% 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --no_cores 8 --heuristic_context fnt --schedule fnt_schedule /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.92/1.15 % SZS status Started for theBenchmark.p
% 2.92/1.15 % SZS status CounterSatisfiable for theBenchmark.p
% 2.92/1.15
% 2.92/1.15 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.92/1.15
% 2.92/1.15 ------ iProver source info
% 2.92/1.15
% 2.92/1.15 git: date: 2024-05-02 19:28:25 +0000
% 2.92/1.15 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.92/1.15 git: non_committed_changes: false
% 2.92/1.15
% 2.92/1.15 ------ Parsing...
% 2.92/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.92/1.15 ------ Proving...
% 2.92/1.15 ------ Problem Properties
% 2.92/1.15
% 2.92/1.15
% 2.92/1.15 clauses 682
% 2.92/1.15 conjectures 479
% 2.92/1.15 EPR 682
% 2.92/1.15 Horn 329
% 2.92/1.15 unary 2
% 2.92/1.15 binary 291
% 2.92/1.15 lits 2754
% 2.92/1.15 lits eq 0
% 2.92/1.15 fd_pure 0
% 2.92/1.15 fd_pseudo 0
% 2.92/1.15 fd_cond 0
% 2.92/1.15 fd_pseudo_cond 0
% 2.92/1.15 AC symbols 0
% 2.92/1.15
% 2.92/1.15 ------ Input Options Time Limit: Unbounded
% 2.92/1.15
% 2.92/1.15
% 2.92/1.15 ------ Finite Models:
% 2.92/1.15
% 2.92/1.15 ------ lit_activity_flag true
% 2.92/1.15
% 2.92/1.15 ------
% 2.92/1.15 Current options:
% 2.92/1.15 ------
% 2.92/1.15
% 2.92/1.15 ------ Input Options
% 2.92/1.15
% 2.92/1.15 --out_options all
% 2.92/1.15 --tptp_safe_out true
% 2.92/1.15 --problem_path ""
% 2.92/1.15 --include_path ""
% 2.92/1.15 --clausifier res/vclausify_rel
% 2.92/1.15 --clausifier_options --mode clausify -t 300.00 -updr off
% 2.92/1.15 --stdin false
% 2.92/1.15 --proof_out true
% 2.92/1.15 --proof_dot_file ""
% 2.92/1.15 --proof_reduce_dot []
% 2.92/1.15 --suppress_sat_res false
% 2.92/1.15 --suppress_unsat_res true
% 2.92/1.15 --stats_out none
% 2.92/1.15 --stats_mem false
% 2.92/1.15 --theory_stats_out false
% 2.92/1.15
% 2.92/1.15 ------ General Options
% 2.92/1.15
% 2.92/1.15 --fof false
% 2.92/1.15 --time_out_real 300.
% 2.92/1.15 --time_out_virtual -1.
% 2.92/1.15 --rnd_seed 13
% 2.92/1.15 --symbol_type_check false
% 2.92/1.15 --clausify_out false
% 2.92/1.15 --sig_cnt_out false
% 2.92/1.15 --trig_cnt_out false
% 2.92/1.15 --trig_cnt_out_tolerance 1.
% 2.92/1.15 --trig_cnt_out_sk_spl false
% 2.92/1.15 --abstr_cl_out false
% 2.92/1.15
% 2.92/1.15 ------ Interactive Mode
% 2.92/1.15
% 2.92/1.15 --interactive_mode false
% 2.92/1.15 --external_ip_address ""
% 2.92/1.15 --external_port 0
% 2.92/1.15
% 2.92/1.15 ------ Global Options
% 2.92/1.15
% 2.92/1.15 --schedule none
% 2.92/1.15 --add_important_lit false
% 2.92/1.15 --prop_solver_per_cl 500
% 2.92/1.15 --subs_bck_mult 8
% 2.92/1.15 --min_unsat_core false
% 2.92/1.15 --soft_assumptions false
% 2.92/1.15 --soft_lemma_size 3
% 2.92/1.15 --prop_impl_unit_size 0
% 2.92/1.15 --prop_impl_unit []
% 2.92/1.15 --share_sel_clauses true
% 2.92/1.15 --reset_solvers false
% 2.92/1.15 --bc_imp_inh [conj_cone]
% 2.92/1.15 --conj_cone_tolerance 3.
% 2.92/1.15 --extra_neg_conj all_pos_neg
% 2.92/1.15 --large_theory_mode true
% 2.92/1.15 --prolific_symb_bound 500
% 2.92/1.15 --lt_threshold 2000
% 2.92/1.15 --clause_weak_htbl true
% 2.92/1.15 --gc_record_bc_elim false
% 2.92/1.15
% 2.92/1.15 ------ Preprocessing Options
% 2.92/1.15
% 2.92/1.15 --preprocessing_flag false
% 2.92/1.15 --time_out_prep_mult 0.2
% 2.92/1.15 --splitting_mode input
% 2.92/1.15 --splitting_grd false
% 2.92/1.15 --splitting_cvd true
% 2.92/1.15 --splitting_cvd_svl true
% 2.92/1.15 --splitting_nvd 256
% 2.92/1.15 --sub_typing false
% 2.92/1.15 --prep_eq_flat_conj false
% 2.92/1.15 --prep_eq_flat_all_gr false
% 2.92/1.15 --prep_gs_sim false
% 2.92/1.15 --prep_unflatten true
% 2.92/1.15 --prep_res_sim true
% 2.92/1.15 --prep_sup_sim_all true
% 2.92/1.15 --prep_sup_sim_sup false
% 2.92/1.15 --prep_upred true
% 2.92/1.15 --prep_well_definedness true
% 2.92/1.15 --prep_sem_filter none
% 2.92/1.15 --prep_sem_filter_out false
% 2.92/1.15 --pred_elim true
% 2.92/1.15 --res_sim_input false
% 2.92/1.15 --eq_ax_congr_red true
% 2.92/1.15 --pure_diseq_elim false
% 2.92/1.15 --brand_transform false
% 2.92/1.15 --non_eq_to_eq false
% 2.92/1.15 --prep_def_merge false
% 2.92/1.15 --prep_def_merge_prop_impl false
% 2.92/1.15 --prep_def_merge_mbd true
% 2.92/1.15 --prep_def_merge_tr_red false
% 2.92/1.15 --prep_def_merge_tr_cl false
% 2.92/1.15 --smt_preprocessing false
% 2.92/1.15 --smt_ac_axioms fast
% 2.92/1.15 --preprocessed_out false
% 2.92/1.15 --preprocessed_stats false
% 2.92/1.15
% 2.92/1.15 ------ Abstraction refinement Options
% 2.92/1.15
% 2.92/1.15 --abstr_ref []
% 2.92/1.15 --abstr_ref_prep false
% 2.92/1.15 --abstr_ref_until_sat false
% 2.92/1.15 --abstr_ref_sig_restrict funpre
% 2.92/1.15 --abstr_ref_af_restrict_to_split_sk false
% 2.92/1.15 --abstr_ref_under []
% 2.92/1.15
% 2.92/1.15 ------ SAT Options
% 2.92/1.15
% 2.92/1.15 --sat_mode true
% 2.92/1.15 --sat_fm_restart_options ""
% 2.92/1.15 --sat_gr_def false
% 2.92/1.15 --sat_epr_types false
% 2.92/1.15 --sat_non_cyclic_types true
% 2.92/1.15 --sat_finite_models true
% 2.92/1.15 --sat_fm_lemmas false
% 2.92/1.15 --sat_fm_prep false
% 2.92/1.15 --sat_fm_uc_incr true
% 2.92/1.15 --sat_out_model pos
% 2.92/1.15 --sat_out_clauses false
% 2.92/1.15
% 2.92/1.15 ------ QBF Options
% 2.92/1.15
% 2.92/1.15 --qbf_mode false
% 2.92/1.15 --qbf_elim_univ false
% 2.92/1.15 --qbf_dom_inst none
% 2.92/1.15 --qbf_dom_pre_inst false
% 2.92/1.15 --qbf_sk_in false
% 2.92/1.15 --qbf_pred_elim true
% 2.92/1.15 --qbf_split 512
% 2.92/1.15
% 2.92/1.15 ------ BMC1 Options
% 2.92/1.15
% 2.92/1.15 --bmc1_incremental false
% 2.92/1.15 --bmc1_axioms reachable_all
% 2.92/1.15 --bmc1_min_bound 0
% 2.92/1.15 --bmc1_max_bound -1
% 2.92/1.15 --bmc1_max_bound_default -1
% 2.92/1.15 --bmc1_symbol_reachability false
% 2.92/1.15 --bmc1_property_lemmas false
% 2.92/1.15 --bmc1_k_induction false
% 2.92/1.15 --bmc1_non_equiv_states false
% 2.92/1.15 --bmc1_deadlock false
% 2.92/1.15 --bmc1_ucm false
% 2.92/1.15 --bmc1_add_unsat_core none
% 2.92/1.15 --bmc1_unsat_core_children false
% 2.92/1.15 --bmc1_unsat_core_extrapolate_axioms false
% 2.92/1.15 --bmc1_out_stat full
% 2.92/1.15 --bmc1_ground_init false
% 2.92/1.15 --bmc1_pre_inst_next_state false
% 2.92/1.15 --bmc1_pre_inst_state false
% 2.92/1.15 --bmc1_pre_inst_reach_state false
% 2.92/1.15 --bmc1_out_unsat_core false
% 2.92/1.15 --bmc1_aig_witness_out false
% 2.92/1.15 --bmc1_verbose false
% 2.92/1.15 --bmc1_dump_clauses_tptp false
% 2.92/1.15 --bmc1_dump_unsat_core_tptp false
% 2.92/1.15 --bmc1_dump_file -
% 2.92/1.15 --bmc1_ucm_expand_uc_limit 128
% 2.92/1.15 --bmc1_ucm_n_expand_iterations 6
% 2.92/1.15 --bmc1_ucm_extend_mode 1
% 2.92/1.15 --bmc1_ucm_init_mode 2
% 2.92/1.15 --bmc1_ucm_cone_mode none
% 2.92/1.15 --bmc1_ucm_reduced_relation_type 0
% 2.92/1.15 --bmc1_ucm_relax_model 4
% 2.92/1.15 --bmc1_ucm_full_tr_after_sat true
% 2.92/1.15 --bmc1_ucm_expand_neg_assumptions false
% 2.92/1.15 --bmc1_ucm_layered_model none
% 2.92/1.15 --bmc1_ucm_max_lemma_size 10
% 2.92/1.15
% 2.92/1.15 ------ AIG Options
% 2.92/1.15
% 2.92/1.15 --aig_mode false
% 2.92/1.15
% 2.92/1.15 ------ Instantiation Options
% 2.92/1.15
% 2.92/1.15 --instantiation_flag true
% 2.92/1.15 --inst_sos_flag false
% 2.92/1.15 --inst_sos_phase true
% 2.92/1.15 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb]
% 2.92/1.15 --inst_lit_sel [-sign;+num_symb;+non_prol_conj_symb]
% 2.92/1.15 --inst_lit_sel_side num_lit
% 2.92/1.15 --inst_solver_per_active 1400
% 2.92/1.15 --inst_solver_calls_frac 0.01
% 2.92/1.15 --inst_to_smt_solver true
% 2.92/1.15 --inst_passive_queue_type priority_queues
% 2.92/1.15 --inst_passive_queues [[+conj_dist;+num_lits;-age];[-conj_symb;-min_def_symb;+bc_imp_inh]]
% 2.92/1.15 --inst_passive_queues_freq [512;64]
% 2.92/1.15 --inst_dismatching true
% 2.92/1.15 --inst_eager_unprocessed_to_passive false
% 2.92/1.15 --inst_unprocessed_bound 1000
% 2.92/1.15 --inst_prop_sim_given true
% 2.92/1.15 --inst_prop_sim_new true
% 2.92/1.15 --inst_subs_new false
% 2.92/1.15 --inst_eq_res_simp false
% 2.92/1.15 --inst_subs_given true
% 2.92/1.15 --inst_orphan_elimination false
% 2.92/1.15 --inst_learning_loop_flag true
% 2.92/1.15 --inst_learning_start 5
% 2.92/1.15 --inst_learning_factor 8
% 2.92/1.15 --inst_start_prop_sim_after_learn 0
% 2.92/1.15 --inst_sel_renew solver
% 2.92/1.15 --inst_lit_activity_flag true
% 2.92/1.15 --inst_restr_to_given false
% 2.92/1.15 --inst_activity_threshold 10000
% 2.92/1.15
% 2.92/1.15 ------ Resolution Options
% 2.92/1.15
% 2.92/1.15 --resolution_flag false
% 2.92/1.15 --res_lit_sel neg_max
% 2.92/1.15 --res_lit_sel_side num_lit
% 2.92/1.15 --res_ordering kbo
% 2.92/1.15 --res_to_prop_solver passive
% 2.92/1.15 --res_prop_simpl_new true
% 2.92/1.15 --res_prop_simpl_given true
% 2.92/1.15 --res_to_smt_solver true
% 2.92/1.15 --res_passive_queue_type priority_queues
% 2.92/1.15 --res_passive_queues [[-has_eq;-conj_non_prolific_symb;+ground];[-bc_imp_inh;-conj_symb]]
% 2.92/1.15 --res_passive_queues_freq [1024;32]
% 2.92/1.15 --res_forward_subs subset_subsumption
% 2.92/1.15 --res_backward_subs subset_subsumption
% 2.92/1.15 --res_forward_subs_resolution true
% 2.92/1.15 --res_backward_subs_resolution false
% 2.92/1.15 --res_orphan_elimination false
% 2.92/1.15 --res_time_limit 10.
% 2.92/1.15
% 2.92/1.15 ------ Superposition Options
% 2.92/1.15
% 2.92/1.15 --superposition_flag false
% 2.92/1.15 --sup_passive_queue_type priority_queues
% 2.92/1.15 --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.92/1.15 --sup_passive_queues_freq [8;1;4;4]
% 2.92/1.15 --demod_completeness_check fast
% 2.92/1.15 --demod_use_ground true
% 2.92/1.15 --sup_unprocessed_bound 0
% 2.92/1.15 --sup_to_prop_solver passive
% 2.92/1.15 --sup_prop_simpl_new true
% 2.92/1.15 --sup_prop_simpl_given true
% 2.92/1.15 --sup_fun_splitting false
% 2.92/1.15 --sup_iter_deepening 2
% 2.92/1.15 --sup_restarts_mult 12
% 2.92/1.15 --sup_score sim_d_gen
% 2.92/1.15 --sup_share_score_frac 0.2
% 2.92/1.15 --sup_share_max_num_cl 500
% 2.92/1.15 --sup_ordering kbo
% 2.92/1.15 --sup_symb_ordering invfreq
% 2.92/1.15 --sup_term_weight default
% 2.92/1.15
% 2.92/1.15 ------ Superposition Simplification Setup
% 2.92/1.15
% 2.92/1.15 --sup_indices_passive [LightNormIndex;FwDemodIndex]
% 2.92/1.15 --sup_full_triv [SMTSimplify;PropSubs]
% 2.92/1.15 --sup_full_fw [ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 2.92/1.15 --sup_full_bw [BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 2.92/1.15 --sup_immed_triv []
% 2.92/1.15 --sup_immed_fw_main [ACNormalisation;FwLightNorm;FwUnitSubsAndRes]
% 2.92/1.15 --sup_immed_fw_immed [ACNormalisation;FwUnitSubsAndRes]
% 2.92/1.15 --sup_immed_bw_main [BwUnitSubsAndRes;BwDemod]
% 2.92/1.15 --sup_immed_bw_immed [BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 2.92/1.15 --sup_input_triv [Unflattening;SMTSimplify]
% 2.92/1.15 --sup_input_fw [FwACDemod;ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 2.92/1.15 --sup_input_bw [BwACDemod;BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 2.92/1.15 --sup_full_fixpoint true
% 2.92/1.15 --sup_main_fixpoint true
% 2.92/1.15 --sup_immed_fixpoint false
% 2.92/1.15 --sup_input_fixpoint true
% 2.92/1.15 --sup_cache_sim none
% 2.92/1.15 --sup_smt_interval 500
% 2.92/1.15 --sup_bw_gjoin_interval 0
% 2.92/1.15
% 2.92/1.15 ------ Combination Options
% 2.92/1.15
% 2.92/1.15 --comb_mode clause_based
% 2.92/1.15 --comb_inst_mult 1000
% 2.92/1.15 --comb_res_mult 10
% 2.92/1.15 --comb_sup_mult 8
% 2.92/1.15 --comb_sup_deep_mult 2
% 2.92/1.15
% 2.92/1.15 ------ Debug Options
% 2.92/1.15
% 2.92/1.15 --dbg_backtrace false
% 2.92/1.15 --dbg_dump_prop_clauses false
% 2.92/1.15 --dbg_dump_prop_clauses_file -
% 2.92/1.15 --dbg_out_stat false
% 2.92/1.15 --dbg_just_parse false
% 2.92/1.15
% 2.92/1.15
% 2.92/1.15
% 2.92/1.15
% 2.92/1.15 ------ Proving...
% 2.92/1.15
% 2.92/1.15
% 2.92/1.15 % SZS status CounterSatisfiable for theBenchmark.p
% 2.92/1.15
% 2.92/1.15 ------ Building Model...Done
% 2.92/1.15
% 2.92/1.15 %------ The model is defined over ground terms (initial term algebra).
% 2.92/1.15 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 2.92/1.15 %------ where \phi is a formula over the term algebra.
% 2.92/1.15 %------ If we have equality in the problem then it is also defined as a predicate above,
% 2.92/1.15 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 2.92/1.15 %------ See help for --sat_out_model for different model outputs.
% 2.92/1.15 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 2.92/1.15 %------ where the first argument stands for the sort ($i in the unsorted case)
% 2.92/1.15 % SZS output start Model for theBenchmark.p
% See solution above
% 2.92/1.16
%------------------------------------------------------------------------------