%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN423-1 : TPTP v9.3.1. Released v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n001.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:40:09 PM UTC 2026
% Result : Satisfiable 3.52s 11.40s
% Output : Model 4.09s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
%------ Positive definition of c6_0
fof(lit_def,axiom,
( c6_0
<=> $true ) ).
%------ Positive definition of ssSkC39
fof(lit_def_001,axiom,
( ssSkC39
<=> $true ) ).
%------ Positive definition of ndr1_0
fof(lit_def_002,axiom,
( ndr1_0
<=> $true ) ).
%------ Positive definition of ssSkC38
fof(lit_def_003,axiom,
( ssSkC38
<=> $false ) ).
%------ Positive definition of ssSkC30
fof(lit_def_004,axiom,
( ssSkC30
<=> $false ) ).
%------ Positive definition of ssSkC25
fof(lit_def_005,axiom,
( ssSkC25
<=> $true ) ).
%------ Positive definition of ssSkC12
fof(lit_def_006,axiom,
( ssSkC12
<=> $false ) ).
%------ Positive definition of ssSkC11
fof(lit_def_007,axiom,
( ssSkC11
<=> $false ) ).
%------ Positive definition of ssSkC10
fof(lit_def_008,axiom,
( ssSkC10
<=> $true ) ).
%------ Positive definition of c7_0
fof(lit_def_009,axiom,
( c7_0
<=> $true ) ).
%------ Positive definition of c5_0
fof(lit_def_010,axiom,
( c5_0
<=> $true ) ).
%------ Positive definition of c4_0
fof(lit_def_011,axiom,
( c4_0
<=> $false ) ).
%------ Positive definition of c3_0
fof(lit_def_012,axiom,
( c3_0
<=> $true ) ).
%------ Positive definition of c10_0
fof(lit_def_013,axiom,
( c10_0
<=> $false ) ).
%------ Positive definition of c8_0
fof(lit_def_014,axiom,
( c8_0
<=> $false ) ).
%------ Positive definition of ssSkC41
fof(lit_def_015,axiom,
( ssSkC41
<=> $false ) ).
%------ Positive definition of ssSkC40
fof(lit_def_016,axiom,
( ssSkC40
<=> $true ) ).
%------ Positive definition of ssSkC37
fof(lit_def_017,axiom,
( ssSkC37
<=> $true ) ).
%------ Positive definition of ssSkC35
fof(lit_def_018,axiom,
( ssSkC35
<=> $false ) ).
%------ Positive definition of ssSkC29
fof(lit_def_019,axiom,
( ssSkC29
<=> $true ) ).
%------ Positive definition of ssSkC27
fof(lit_def_020,axiom,
( ssSkC27
<=> $true ) ).
%------ Positive definition of ssSkC24
fof(lit_def_021,axiom,
( ssSkC24
<=> $false ) ).
%------ Positive definition of ssSkC20
fof(lit_def_022,axiom,
( ssSkC20
<=> $false ) ).
%------ Positive definition of ssSkC18
fof(lit_def_023,axiom,
( ssSkC18
<=> $true ) ).
%------ Positive definition of ssSkC17
fof(lit_def_024,axiom,
( ssSkC17
<=> $false ) ).
%------ Positive definition of ssSkC8
fof(lit_def_025,axiom,
( ssSkC8
<=> $true ) ).
%------ Positive definition of ssSkC6
fof(lit_def_026,axiom,
( ssSkC6
<=> $true ) ).
%------ Positive definition of ssSkC2
fof(lit_def_027,axiom,
( ssSkC2
<=> $true ) ).
%------ Positive definition of ssSkC0
fof(lit_def_028,axiom,
( ssSkC0
<=> $true ) ).
%------ Positive definition of c7_1
fof(lit_def_029,axiom,
! [X0] :
( c7_1(X0)
<=> ( X0 = a562
| X0 = a436
| X0 = a571
| X0 = a516
| X0 = a615 ) ) ).
%------ Positive definition of ndr1_1
fof(lit_def_030,axiom,
! [X0] :
( ndr1_1(X0)
<=> ( X0 = a575
| X0 = a553
| X0 = a443
| X0 = a448
| X0 = a461
| X0 = a544
| X0 = a437
| X0 = a451
| X0 = a524
| X0 = a564
| X0 = a574
| X0 = a619
| X0 = a434
| X0 = a566
| X0 = a610
| X0 = a613
| X0 = a617
| X0 = a453
| X0 = a455
| X0 = a457
| X0 = a465
| X0 = a470
| X0 = a508
| X0 = a572
| X0 = a611
| ( X0 != a575
& X0 != a448
& X0 != a528
& X0 != a574
& X0 != a619
& X0 != a515
& X0 != a610
& X0 != a613 ) ) ) ).
%------ Positive definition of c6_1
fof(lit_def_031,axiom,
! [X0] :
( c6_1(X0)
<=> X0 = a617 ) ).
%------ Positive definition of ssSkC36
fof(lit_def_032,axiom,
( ssSkC36
<=> $false ) ).
%------ Positive definition of ssSkC34
fof(lit_def_033,axiom,
( ssSkC34
<=> $true ) ).
%------ Positive definition of c9_1
fof(lit_def_034,axiom,
! [X0] :
( c9_1(X0)
<=> ( X0 = a574
| X0 = a515
| X0 = a610
| ( X0 != a575
& X0 != a588
& X0 != a443
& X0 != a448
& X0 != a544
& X0 != a558
& X0 != a547
& X0 != a436
& X0 != a437
& X0 != a451
& X0 != a524
& X0 != a528
& X0 != a564
& X0 != a574
& X0 != a515
& X0 != a571
& X0 != a610
& X0 != a613
& X0 != a616
& X0 != a617
& X0 != a470
& X0 != a572
& X0 != a615 ) ) ) ).
%------ Positive definition of c9_0
fof(lit_def_035,axiom,
( c9_0
<=> $false ) ).
%------ Positive definition of c1_0
fof(lit_def_036,axiom,
( c1_0
<=> $false ) ).
%------ Positive definition of ssSkC14
fof(lit_def_037,axiom,
( ssSkC14
<=> $true ) ).
%------ Positive definition of ssSkC13
fof(lit_def_038,axiom,
( ssSkC13
<=> $false ) ).
%------ Positive definition of c2_1
fof(lit_def_039,axiom,
! [X0] :
( c2_1(X0)
<=> ( X0 = a544
| X0 = a524
| X0 = a617 ) ) ).
%------ Positive definition of c10_1
fof(lit_def_040,axiom,
! [X0] :
( c10_1(X0)
<=> ( X0 = a514
| X0 = a528
| X0 = a564
| X0 = a515 ) ) ).
%------ Positive definition of c3_1
fof(lit_def_041,axiom,
! [X0] :
( c3_1(X0)
<=> ( X0 = a524
| X0 = a617 ) ) ).
%------ Positive definition of c8_1
fof(lit_def_042,axiom,
! [X0] :
( c8_1(X0)
<=> ( X0 = a528
| X0 = a515
| X0 = a453
| X0 = a470 ) ) ).
%------ Positive definition of c1_1
fof(lit_def_043,axiom,
! [X0] :
( c1_1(X0)
<=> ( X0 = a574
| X0 = a515
| X0 = a610
| ( X0 != a575
& X0 != a588
& X0 != a443
& X0 != a448
& X0 != a544
& X0 != a558
& X0 != a547
& X0 != a436
& X0 != a437
& X0 != a451
& X0 != a524
& X0 != a528
& X0 != a564
& X0 != a574
& X0 != a515
& X0 != a571
& X0 != a610
& X0 != a613
& X0 != a616
& X0 != a617
& X0 != a470
& X0 != a572
& X0 != a615 ) ) ) ).
%------ Positive definition of c4_1
fof(lit_def_044,axiom,
! [X0] :
( c4_1(X0)
<=> ( X0 = a443
| X0 = a558
| X0 = a566 ) ) ).
%------ Positive definition of ssSkP11
fof(lit_def_045,axiom,
! [X0] :
( ssSkP11(X0)
<=> ( X0 = a443
| X0 = a566
| ( X0 != a443
& X0 != a566 ) ) ) ).
%------ Positive definition of ssSkP10
fof(lit_def_046,axiom,
! [X0] :
( ssSkP10(X0)
<=> ( X0 = a528
| X0 != a528 ) ) ).
%------ Positive definition of ssSkP9
fof(lit_def_047,axiom,
! [X0] :
( ssSkP9(X0)
<=> ( X0 = a575
| X0 = a528
| X0 = a515
| X0 != a575 ) ) ).
%------ Positive definition of ssSkP8
fof(lit_def_048,axiom,
! [X0] :
( ssSkP8(X0)
<=> ( X0 = a528
| X0 != a528 ) ) ).
%------ Positive definition of ssSkP7
fof(lit_def_049,axiom,
! [X0] :
( ssSkP7(X0)
<=> ( X0 = a574
| X0 = a515
| X0 = a610
| X0 = a465
| ( X0 != a553
& X0 != a574
& X0 != a515
& X0 != a610
& X0 != a613
& X0 != a465 ) ) ) ).
%------ Positive definition of ssSkP6
fof(lit_def_050,axiom,
! [X0] :
( ssSkP6(X0)
<=> $true ) ).
%------ Positive definition of ssSkP5
fof(lit_def_051,axiom,
! [X0] :
( ssSkP5(X0)
<=> $true ) ).
%------ Positive definition of ssSkP4
fof(lit_def_052,axiom,
! [X0] :
( ssSkP4(X0)
<=> $true ) ).
%------ Positive definition of ssSkP3
fof(lit_def_053,axiom,
! [X0] :
( ssSkP3(X0)
<=> $true ) ).
%------ Positive definition of ssSkP2
fof(lit_def_054,axiom,
! [X0] :
( ssSkP2(X0)
<=> ( X0 = a528
| ( X0 != a553
& X0 != a528 ) ) ) ).
%------ Positive definition of ssSkP1
fof(lit_def_055,axiom,
! [X0] :
( ssSkP1(X0)
<=> ( X0 = a528
| X0 = a515
| X0 = a610
| X0 = a453
| X0 = a470
| ( X0 != a528
& X0 != a515
& X0 != a610
& X0 != a453
& X0 != a470 ) ) ) ).
%------ Positive definition of ssSkP0
fof(lit_def_056,axiom,
! [X0] :
( ssSkP0(X0)
<=> $true ) ).
%------ Positive definition of c1_2
fof(lit_def_057,axiom,
! [X0,X1] :
( c1_2(X0,X1)
<=> ( ( X1 = a554
& X0 = a553 )
| ( X1 = a551
& X0 = a553 )
| ( X1 = a444
& X0 = a443 )
| ( X1 = a551
& X0 = a610 )
| ( X1 = a551
& X0 = a613 )
| ( X1 = a458
& X0 = a457 )
| ( X1 = a612
& X0 = a611 )
| ( X1 = a555
& X0 = a615 ) ) ) ).
%------ Positive definition of c4_2
fof(lit_def_058,axiom,
! [X0,X1] :
( c4_2(X0,X1)
<=> ( ( X1 = a529
& X0 = a528 )
| ( X1 = a565
& X0 = a564 ) ) ) ).
%------ Positive definition of c8_2
fof(lit_def_059,axiom,
! [X0,X1] :
( c8_2(X0,X1)
<=> ( ( X0 != a448
& X0 != a437
& X1 = a494 )
| ( X1 = a530
& X0 = a514 )
| ( X1 = a559
& X0 = a443 )
| ( X1 = a494
& X0 = a437 )
| ( X1 = a559
& X0 = a524 )
| ( X1 = a530
& X0 = a528 )
| ( X1 = a565
& X0 = a564 )
| ( X1 = a567
& X0 = a566 )
| ( X1 != a545
& X0 = a613 )
| X0 = a453
| ( X1 = a456
& X0 = a455 )
| ( X1 = a471
& X0 = a470 )
| ( X1 = a573
& X0 = a572 ) ) ) ).
%------ Positive definition of ssSkC19
fof(lit_def_060,axiom,
( ssSkC19
<=> $false ) ).
%------ Positive definition of c2_0
fof(lit_def_061,axiom,
( c2_0
<=> $false ) ).
%------ Positive definition of c5_1
fof(lit_def_062,axiom,
! [X0] :
( c5_1(X0)
<=> X0 = a553 ) ).
%------ Positive definition of c3_2
fof(lit_def_063,axiom,
! [X0,X1] :
( c3_2(X0,X1)
<=> ( ( X1 = a445
& X0 = a443 )
| ( X1 = a452
& X0 = a451 )
| ( X1 = a525
& X0 = a524 )
| ( X1 = a504
& X0 = a613 )
| ( X1 != a607
& X1 != a519
& X1 != a447
& X1 != a597
& X1 != a472
& X1 != a494
& X1 != a593
& X0 = a470 ) ) ) ).
%------ Positive definition of c9_2
fof(lit_def_064,axiom,
! [X0,X1] :
( c9_2(X0,X1)
<=> ( ( X1 = a523
& X0 = a514 )
| ( X1 = a472
& X0 = a553 )
| ( X1 = a602
& X0 = a443 )
| ( X1 = a602
& X0 = a558 )
| ( X1 = a438
& X0 = a437 )
| ( X1 = a529
& X0 = a528 )
| ( X1 = a523
& X0 = a564 )
| ( X1 = a602
& X0 = a566 ) ) ) ).
%------ Positive definition of ssSkC5
fof(lit_def_065,axiom,
( ssSkC5
<=> $false ) ).
%------ Positive definition of ssSkC4
fof(lit_def_066,axiom,
( ssSkC4
<=> $true ) ).
%------ Positive definition of c5_2
fof(lit_def_067,axiom,
! [X0,X1] :
( c5_2(X0,X1)
<=> ( ( X1 = a445
& X0 = a443 )
| ( X1 = a452
& X0 = a451 )
| ( X1 = a525
& X0 = a524 )
| ( X1 = a538
& X0 = a515 ) ) ) ).
%------ Positive definition of c10_2
fof(lit_def_068,axiom,
! [X0,X1] :
( c10_2(X0,X1)
<=> ( X1 = a593
| ( X1 = a444
& X0 = a443 )
| ( X1 = a452
& X0 = a451 )
| ( X1 = a442
& X0 = a528 )
| ( X1 = a565
& X0 = a564 )
| ( X1 = a557
& X0 = a515 )
| ( X1 = a583
& X0 = a613 )
| ( X1 = a557
& X0 = a613 )
| ( X1 = a618
& X0 = a617 )
| ( X1 = a557
& X0 = a453 )
| ( X1 != a552
& X1 != a530
& X1 != a447
& X1 != a599
& X1 != a594
& X1 != a523
& X1 != a431
& X1 != a494
& X1 != a598
& X0 = a453 )
| ( X1 = a458
& X0 = a457 )
| ( X1 = a459
& X0 = a457 )
| ( X1 = a557
& X0 = a470 ) ) ) ).
%------ Positive definition of ssSkC3
fof(lit_def_069,axiom,
( ssSkC3
<=> $false ) ).
%------ Positive definition of c7_2
fof(lit_def_070,axiom,
! [X0,X1] :
( c7_2(X0,X1)
<=> ( ( X1 = a602
& X0 = a558 )
| ( X1 = a525
& X0 = a524 )
| ( X1 = a529
& X0 = a528 )
| ( X1 = a454
& X0 = a453 )
| ( X1 = a471
& X0 = a470 )
| ( X1 != a497
& X1 != a576
& X1 != a442
& X1 != a475
& X1 != a496
& X1 != a551
& X1 != a593
& X0 = a470 ) ) ) ).
%------ Positive definition of c2_2
fof(lit_def_071,axiom,
! [X0,X1] :
( c2_2(X0,X1)
<=> ( ( X1 = a554
& X0 = a553 )
| ( X1 = a472
& X0 = a553 )
| ( X1 = a551
& X0 = a553 )
| ( X1 = a519
& X0 = a515 )
| ( X1 = a494
& X0 = a613 )
| ( X1 = a551
& X0 = a613 ) ) ) ).
%------ Positive definition of c6_2
fof(lit_def_072,axiom,
! [X0,X1] :
( c6_2(X0,X1)
<=> ( ( X1 = a599
& X0 = a514 )
| ( X1 = a602
& X0 = a443 )
| ( X1 = a602
& X0 = a558 )
| ( X1 = a559
& X0 = a524 )
| ( X1 = a599
& X0 = a528 )
| ( X1 = a560
& X0 = a528 )
| ( X1 = a599
& X0 = a564 )
| ( X1 = a602
& X0 = a566 )
| ( X1 = a466
& X0 = a465 ) ) ) ).
%------ Positive definition of ssSkC22
fof(lit_def_073,axiom,
( ssSkC22
<=> $true ) ).
%------ Positive definition of ssSkC16
fof(lit_def_074,axiom,
( ssSkC16
<=> $true ) ).
%------ Positive definition of ssSkC15
fof(lit_def_075,axiom,
( ssSkC15
<=> $true ) ).
%------ Positive definition of ssSkC7
fof(lit_def_076,axiom,
( ssSkC7
<=> $true ) ).
%------ Positive definition of ssSkC1
fof(lit_def_077,axiom,
( ssSkC1
<=> $false ) ).
%------ Positive definition of ssSkC32
fof(lit_def_078,axiom,
( ssSkC32
<=> $false ) ).
%------ Positive definition of ssSkC31
fof(lit_def_079,axiom,
( ssSkC31
<=> $true ) ).
%------ Positive definition of ssSkC33
fof(lit_def_080,axiom,
( ssSkC33
<=> $true ) ).
%------ Positive definition of ssSkC26
fof(lit_def_081,axiom,
( ssSkC26
<=> $true ) ).
%------ Positive definition of ssSkC21
fof(lit_def_082,axiom,
( ssSkC21
<=> $true ) ).
%------ Positive definition of ssSkC23
fof(lit_def_083,axiom,
( ssSkC23
<=> $true ) ).
%------ Positive definition of ssSkC28
fof(lit_def_084,axiom,
( ssSkC28
<=> $false ) ).
%------ Positive definition of ssSkC9
fof(lit_def_085,axiom,
( ssSkC9
<=> $false ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN423-1 : TPTP v9.3.1. Released v2.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/10.59 % Computer : n001.cluster.edu
% 0.09/10.59 % Model : x86_64 x86_64
% 0.09/10.59 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/10.59 % Memory : 8046.5625MB
% 0.09/10.59 % OS : Linux 6.8.0-71-generic
% 0.09/10.59 % CPULimit : 300
% 0.09/10.59 % WCLimit : 300
% 0.09/10.59 % DateTime : Fri Sep 25 01:14:05 UTC 2026
% 0.13/10.60 % CPUTime :
% 0.13/10.60 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/10.63 Running EPR theorem proving
% 0.13/10.64 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s epr_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/10.65
% 0.13/10.65 % ======== iProver multi-core TPTP/SMT =========
% 0.13/10.65
% 0.13/10.65 % Detected problem language: tptp
% 0.13/10.66 % Proving...
% 3.52/11.40 % SZS status Started for theBenchmark.p
% 3.52/11.40 % SZS status Satisfiable for theBenchmark.p
% 3.52/11.40
% 3.52/11.40 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.52/11.40
% 3.52/11.40 ------ iProver source info
% 3.52/11.40
% 3.52/11.40 git: date: 2026-07-19 20:42:38 +0200
% 3.52/11.40 git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.52/11.40 git: non_committed_changes: false
% 3.52/11.40
% 3.52/11.40 ------ Parsing...successful
% 3.52/11.40
% 3.52/11.40
% 3.52/11.40 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Option_epr_non_horn_non_eq
% 3.52/11.40
% 3.52/11.40 ------ Proving...
% 3.52/11.40 ------ Problem Properties
% 3.52/11.40
% 3.52/11.40
% 3.52/11.40 clauses 629
% 3.52/11.40 conjectures 629
% 3.52/11.40 EPR 629
% 3.52/11.40 Horn 261
% 3.52/11.40 unary 2
% 3.52/11.40 binary 224
% 3.52/11.40 lits 2605
% 3.52/11.40 lits eq 0
% 3.52/11.40 fd_pure 0
% 3.52/11.40 fd_pseudo 0
% 3.52/11.40 fd_cond 0
% 3.52/11.40 fd_pseudo_cond 0
% 3.52/11.40 AC symbols 0
% 3.52/11.40
% 3.52/11.40 ------ Schedule EPR non Horn non eq is on
% 3.52/11.40
% 3.52/11.40 ------ no equalities: superposition off
% 3.52/11.40
% 3.52/11.40 ------ Input Options "--resolution_flag false" Time Limit: 70.
% 3.52/11.40
% 3.52/11.40
% 3.52/11.40 ------
% 3.52/11.40 Current options:
% 3.52/11.40 ------
% 3.52/11.40
% 3.52/11.40 ------ Input Options
% 3.52/11.40
% 3.52/11.40 --out_options all
% 3.52/11.40 --tptp_safe_out true
% 3.52/11.40 --problem_path ""
% 3.52/11.40 --include_path ""
% 3.52/11.40 --clausifier res/vclausify_rel
% 3.52/11.40 --clausifier_options --mode clausify -t 101.67 -updr off
% 3.52/11.40 --stdin false
% 3.52/11.40 --proof_out true
% 3.52/11.40 --proof_dot_file ""
% 3.52/11.40 --proof_reduce_dot []
% 3.52/11.40 --suppress_sat_res false
% 3.52/11.40 --suppress_unsat_res true
% 3.52/11.40 --stats_out none
% 3.52/11.40 --stats_mem false
% 3.52/11.40 --theory_stats_out false
% 3.52/11.40
% 3.52/11.40 ------ General Options
% 3.52/11.40
% 3.52/11.40 --fof false
% 3.52/11.40 --time_out_real 305.
% 3.52/11.40 --time_out_virtual -1.
% 3.52/11.40 --rnd_seed 13
% 3.52/11.40 --symbol_type_check false
% 3.52/11.40 --clausify_out false
% 3.52/11.40 --sig_cnt_out false
% 3.52/11.40 --trig_cnt_out false
% 3.52/11.40 --trig_cnt_out_tolerance 1.
% 3.52/11.40 --trig_cnt_out_sk_spl false
% 3.52/11.40 --abstr_cl_out false
% 3.52/11.40
% 3.52/11.40 ------ Interactive Mode
% 3.52/11.40
% 3.52/11.40 --interactive_mode false
% 3.52/11.40 --external_ip_address ""
% 3.52/11.40 --external_port 0
% 3.52/11.40
% 3.52/11.40 ------ Global Options
% 3.52/11.40
% 3.52/11.40 --schedule sat
% 3.52/11.40 --add_important_lit false
% 3.52/11.40 --prop_solver_per_cl 500
% 3.52/11.40 --subs_bck_mult 8
% 3.52/11.40 --min_unsat_core false
% 3.52/11.40 --soft_assumptions false
% 3.52/11.40 --soft_lemma_size 3
% 3.52/11.40 --prop_impl_unit_size 0
% 3.52/11.40 --prop_impl_unit []
% 3.52/11.40 --share_sel_clauses true
% 3.52/11.40 --reset_solvers false
% 3.52/11.40 --bc_imp_inh [conj_cone]
% 3.52/11.40 --conj_cone_tolerance 3.
% 3.52/11.40 --extra_neg_conj none
% 3.52/11.40 --large_theory_mode true
% 3.52/11.40 --prolific_symb_bound 200
% 3.52/11.40 --lt_threshold 2000
% 3.52/11.40 --clause_weak_htbl true
% 3.52/11.40 --gc_record_bc_elim false
% 3.52/11.40
% 3.52/11.40 ------ Preprocessing Options
% 3.52/11.40
% 3.52/11.40 --preprocessing_flag false
% 3.52/11.40 --time_out_prep_mult 0.1
% 3.52/11.40 --splitting_mode input
% 3.52/11.40 --splitting_grd true
% 3.52/11.40 --splitting_cvd false
% 3.52/11.40 --splitting_cvd_svl false
% 3.52/11.40 --splitting_nvd 32
% 3.52/11.40 --sub_typing false
% 3.52/11.40 --prep_eq_flat_conj false
% 3.52/11.40 --prep_ineq_split false
% 3.52/11.40 --prep_eq_flat_all_gr false
% 3.52/11.40 --prep_gs_sim true
% 3.52/11.40 --prep_unflatten true
% 3.52/11.40 --prep_res_sim true
% 3.52/11.40 --prep_sup_sim_all true
% 3.52/11.40 --prep_sup_sim_sup false
% 3.52/11.40 --prep_upred true
% 3.52/11.40 --prep_well_definedness true
% 3.52/11.40 --prep_sem_filter exhaustive
% 3.52/11.40 --prep_sem_filter_out false
% 3.52/11.40 --pred_elim true
% 3.52/11.40 --res_sim_input true
% 3.52/11.40 --eq_ax_congr_red true
% 3.52/11.40 --pure_diseq_elim true
% 3.52/11.40 --brand_transform false
% 3.52/11.40 --non_eq_to_eq false
% 3.52/11.40 --prep_eq_proxy false
% 3.52/11.40 --prep_def_merge true
% 3.52/11.40 --prep_def_merge_prop_impl false
% 3.52/11.40 --prep_def_merge_mbd true
% 3.52/11.40 --prep_def_merge_tr_red false
% 3.52/11.40 --prep_def_merge_tr_cl false
% 3.52/11.40 --smt_preprocessing false
% 3.52/11.40 --smt_ac_axioms fast
% 3.52/11.40 --preprocessed_out false
% 3.52/11.40 --preprocessed_stats false
% 3.52/11.40
% 3.52/11.40 ------ Abstraction refinement Options
% 3.52/11.40
% 3.52/11.40 --abstr_ref []
% 3.52/11.40 --abstr_ref_prep false
% 3.52/11.40 --abstr_ref_until_sat false
% 3.52/11.40 --abstr_ref_sig_restrict funpre
% 3.52/11.40 --abstr_ref_af_restrict_to_split_sk false
% 3.52/11.40 --abstr_ref_under []
% 3.52/11.40
% 3.52/11.40 ------ SAT Options
% 3.52/11.40
% 3.52/11.40 --sat_mode false
% 3.52/11.40 --sat_fm_restart_options ""
% 3.52/11.40 --sat_gr_def false
% 3.52/11.40 --sat_epr_types true
% 3.52/11.40 --sat_non_cyclic_types false
% 3.52/11.40 --sat_finite_models false
% 3.52/11.40 --sat_fm_lemmas false
% 3.52/11.40 --sat_fm_prep false
% 3.52/11.40 --sat_fm_uc_incr true
% 3.52/11.40 --sat_out_model pos
% 3.52/11.40 --sat_out_clauses false
% 3.52/11.40
% 3.52/11.40 ------ QBF Options
% 3.52/11.40
% 3.52/11.40 --qbf_mode false
% 3.52/11.40 --qbf_elim_univ false
% 3.52/11.40 --qbf_dom_inst none
% 3.52/11.40 --qbf_dom_pre_inst false
% 3.52/11.40 --qbf_sk_in false
% 3.52/11.40 --qbf_pred_elim true
% 3.52/11.40 --qbf_split 512
% 3.52/11.40
% 3.52/11.40 ------ BMC1 Options
% 3.52/11.40
% 3.52/11.40 --bmc1_incremental false
% 3.52/11.40 --bmc1_axioms reachable_all
% 3.52/11.40 --bmc1_min_bound 0
% 3.52/11.40 --bmc1_max_bound -1
% 3.52/11.40 --bmc1_max_bound_default -1
% 3.52/11.40 --bmc1_symbol_reachability true
% 3.52/11.40 --bmc1_property_lemmas false
% 3.52/11.40 --bmc1_k_induction false
% 3.52/11.40 --bmc1_non_equiv_states false
% 3.52/11.40 --bmc1_deadlock false
% 3.52/11.40 --bmc1_ucm false
% 3.52/11.40 --bmc1_add_unsat_core none
% 3.52/11.40 --bmc1_unsat_core_children false
% 3.52/11.40 --bmc1_unsat_core_extrapolate_axioms false
% 3.52/11.40 --bmc1_out_stat full
% 3.52/11.40 --bmc1_ground_init false
% 3.52/11.40 --bmc1_pre_inst_next_state false
% 3.52/11.40 --bmc1_pre_inst_state false
% 3.52/11.40 --bmc1_pre_inst_reach_state false
% 3.52/11.40 --bmc1_out_unsat_core false
% 3.52/11.40 --bmc1_aig_witness_out false
% 3.52/11.40 --bmc1_verbose false
% 3.52/11.40 --bmc1_dump_clauses_tptp false
% 3.52/11.40 --bmc1_dump_unsat_core_tptp false
% 3.52/11.40 --bmc1_dump_file -
% 3.52/11.40 --bmc1_ucm_expand_uc_limit 128
% 3.52/11.40 --bmc1_ucm_n_expand_iterations 6
% 3.52/11.40 --bmc1_ucm_extend_mode 1
% 3.52/11.40 --bmc1_ucm_init_mode 2
% 3.52/11.40 --bmc1_ucm_cone_mode none
% 3.52/11.40 --bmc1_ucm_reduced_relation_type 0
% 3.52/11.40 --bmc1_ucm_relax_model 4
% 3.52/11.40 --bmc1_ucm_full_tr_after_sat true
% 3.52/11.40 --bmc1_ucm_expand_neg_assumptions false
% 3.52/11.40 --bmc1_ucm_layered_model none
% 3.52/11.40 --bmc1_ucm_max_lemma_size 10
% 3.52/11.40
% 3.52/11.40 ------ AIG Options
% 3.52/11.40
% 3.52/11.40 --aig_mode false
% 3.52/11.40
% 3.52/11.40 ------ Instantiation Options
% 3.52/11.40
% 3.52/11.40 --instantiation_flag true
% 3.52/11.40 --inst_sos_flag false
% 4.09/11.40 --inst_sos_phase true
% 4.09/11.40 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb]
% 4.09/11.40 --inst_lit_sel [+prop;+num_symb;-sign;+num_var]
% 4.09/11.40 --inst_lit_sel_side num_symb
% 4.09/11.40 --inst_solver_per_active 1400
% 4.09/11.40 --inst_solver_calls_frac 1.
% 4.09/11.40 --inst_to_smt_solver true
% 4.09/11.40 --inst_passive_queue_type priority_queues
% 4.09/11.40 --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 4.09/11.40 --inst_passive_queues_freq [25;2]
% 4.09/11.40 --inst_dismatching true
% 4.09/11.40 --inst_eager_unprocessed_to_passive true
% 4.09/11.40 --inst_unprocessed_bound 1000
% 4.09/11.40 --inst_prop_sim_given false
% 4.09/11.40 --inst_prop_sim_new false
% 4.09/11.40 --inst_subs_new false
% 4.09/11.40 --inst_eq_res_simp false
% 4.09/11.40 --inst_subs_given false
% 4.09/11.40 --inst_orphan_elimination true
% 4.09/11.40 --inst_learning_loop_flag true
% 4.09/11.40 --inst_learning_start 3000
% 4.09/11.40 --inst_learning_factor 2
% 4.09/11.40 --inst_start_prop_sim_after_learn 3
% 4.09/11.40 --inst_sel_renew solver
% 4.09/11.40 --inst_lit_activity_flag true
% 4.09/11.40 --inst_restr_to_given false
% 4.09/11.40 --inst_activity_threshold 500
% 4.09/11.40
% 4.09/11.40 ------ Resolution Options
% 4.09/11.40
% 4.09/11.40 --resolution_flag false
% 4.09/11.40 --res_lit_sel adaptive
% 4.09/11.40 --res_lit_sel_side none
% 4.09/11.40 --res_ordering kbo
% 4.09/11.40 --res_to_prop_solver active
% 4.09/11.40 --res_prop_simpl_new false
% 4.09/11.40 --res_prop_simpl_given true
% 4.09/11.40 --res_to_smt_solver true
% 4.09/11.40 --res_passive_queue_type priority_queues
% 4.09/11.40 --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 4.09/11.40 --res_passive_queues_freq [15;5]
% 4.09/11.40 --res_forward_subs full
% 4.09/11.40 --res_backward_subs full
% 4.09/11.40 --res_forward_subs_resolution true
% 4.09/11.40 --res_backward_subs_resolution true
% 4.09/11.40 --res_orphan_elimination true
% 4.09/11.40 --res_time_limit 300.
% 4.09/11.40
% 4.09/11.40 ------ Superposition Options
% 4.09/11.40
% 4.09/11.40 --superposition_flag true
% 4.09/11.40 --sup_passive_queue_type priority_queues
% 4.09/11.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]]
% 4.09/11.40 --sup_passive_queues_freq [8;1;4;4]
% 4.09/11.40 --twee_lhs_weight 4
% 4.09/11.40 --sup_set_join false
% 4.09/11.40 --sup_set_join_goals true
% 4.09/11.40 --sup_set_join_limit 1000
% 4.09/11.40 --demod_completeness_check fast
% 4.09/11.40 --demod_use_ground true
% 4.09/11.40 --sup_unprocessed_bound 0
% 4.09/11.40 --sup_to_prop_solver passive
% 4.09/11.40 --sup_prop_simpl_new true
% 4.09/11.40 --sup_prop_simpl_given true
% 4.09/11.40 --sup_fun_splitting false
% 4.09/11.40 --sup_iter_deepening 2
% 4.09/11.40 --sup_restarts_mult 12
% 4.09/11.40 --sup_score sim_d_gen
% 4.09/11.40 --sup_share_score_frac 0.2
% 4.09/11.40 --sup_share_max_num_cl 500
% 4.09/11.40 --sup_ordering kbo
% 4.09/11.40 --sup_symb_ordering invfreq
% 4.09/11.40 --sup_term_weight default
% 4.09/11.40
% 4.09/11.40 ------ Superposition Simplification Setup
% 4.09/11.40
% 4.09/11.40 --sup_indices_passive [LightNormIndex;FwDemodIndex]
% 4.09/11.40 --sup_full_triv [SMTSimplify;PropSubs]
% 4.09/11.40 --sup_full_fw [ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 4.09/11.40 --sup_full_bw [BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 4.09/11.40 --sup_immed_triv []
% 4.09/11.40 --sup_immed_fw_main [ACNormalisation;FwLightNorm;FwUnitSubsAndRes]
% 4.09/11.40 --sup_immed_fw_immed [ACNormalisation;FwUnitSubsAndRes]
% 4.09/11.40 --sup_immed_bw_main [BwUnitSubsAndRes;BwDemod]
% 4.09/11.40 --sup_immed_bw_immed [BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 4.09/11.40 --sup_input_triv [Unflattening;SMTSimplify]
% 4.09/11.40 --sup_input_fw [FwACDemod;ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 4.09/11.40 --sup_input_bw [BwACDemod;BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 4.09/11.40 --sup_full_fixpoint true
% 4.09/11.40 --sup_main_fixpoint true
% 4.09/11.40 --sup_immed_fixpoint false
% 4.09/11.40 --sup_input_fixpoint true
% 4.09/11.40 --sup_cache_sim none
% 4.09/11.40 --sup_smt_interval 500
% 4.09/11.40 --sup_bw_gjoin_interval 0
% 4.09/11.40
% 4.09/11.40 ------ Combination Options
% 4.09/11.40
% 4.09/11.40 --comb_mode clause_based
% 4.09/11.40 --comb_inst_mult 5
% 4.09/11.40 --comb_res_mult 1
% 4.09/11.40 --comb_sup_mult 1
% 4.09/11.40 --comb_sup_deep_mult 1
% 4.09/11.40
% 4.09/11.40 ------ Debug Options
% 4.09/11.40
% 4.09/11.40 --dbg_backtrace false
% 4.09/11.40 --dbg_dump_prop_clauses false
% 4.09/11.40 --dbg_dump_prop_clauses_file -
% 4.09/11.40 --dbg_out_stat false
% 4.09/11.40 --dbg_just_parse false
% 4.09/11.40
% 4.09/11.40
% 4.09/11.40
% 4.09/11.40
% 4.09/11.40 ------ Proving...
% 4.09/11.40
% 4.09/11.40
% 4.09/11.40 % SZS status Satisfiable for theBenchmark.p
% 4.09/11.40
% 4.09/11.40 ------ Building Model...Done
% 4.09/11.40
% 4.09/11.40 %------ The model is defined over ground terms (initial term algebra).
% 4.09/11.40 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 4.09/11.40 %------ where \phi is a formula over the term algebra.
% 4.09/11.40 %------ If we have equality in the problem then it is also defined as a predicate above,
% 4.09/11.40 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 4.09/11.40 %------ See help for --sat_out_model for different model outputs.
% 4.09/11.40 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 4.09/11.40 %------ where the first argument stands for the sort ($i in the unsorted case)
% 4.09/11.40 % SZS output start Model for theBenchmark.p
% See solution above
% 4.09/11.40
%------------------------------------------------------------------------------