%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN424-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 : n005.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.00s 1.12s
% Output : Model 3.00s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
%------ Positive definition of ndr1_0
fof(lit_def,axiom,
( ndr1_0
<=> $true ) ).
%------ Positive definition of c2_0
fof(lit_def_001,axiom,
( c2_0
<=> $true ) ).
%------ Positive definition of ssSkC27
fof(lit_def_002,axiom,
( ssSkC27
<=> $false ) ).
%------ Positive definition of ssSkC47
fof(lit_def_003,axiom,
( ssSkC47
<=> $true ) ).
%------ Positive definition of ssSkC45
fof(lit_def_004,axiom,
( ssSkC45
<=> $true ) ).
%------ Positive definition of ssSkC44
fof(lit_def_005,axiom,
( ssSkC44
<=> $false ) ).
%------ Positive definition of ssSkC43
fof(lit_def_006,axiom,
( ssSkC43
<=> $true ) ).
%------ Positive definition of ssSkC41
fof(lit_def_007,axiom,
( ssSkC41
<=> $false ) ).
%------ Positive definition of ssSkC40
fof(lit_def_008,axiom,
( ssSkC40
<=> $false ) ).
%------ Positive definition of ssSkC39
fof(lit_def_009,axiom,
( ssSkC39
<=> $true ) ).
%------ Positive definition of ssSkC36
fof(lit_def_010,axiom,
( ssSkC36
<=> $true ) ).
%------ Positive definition of ssSkC35
fof(lit_def_011,axiom,
( ssSkC35
<=> $true ) ).
%------ Positive definition of ssSkC30
fof(lit_def_012,axiom,
( ssSkC30
<=> $true ) ).
%------ Positive definition of ssSkC28
fof(lit_def_013,axiom,
( ssSkC28
<=> $true ) ).
%------ Positive definition of ssSkC25
fof(lit_def_014,axiom,
( ssSkC25
<=> $true ) ).
%------ Positive definition of ssSkC24
fof(lit_def_015,axiom,
( ssSkC24
<=> $false ) ).
%------ Positive definition of ssSkC23
fof(lit_def_016,axiom,
( ssSkC23
<=> $true ) ).
%------ Positive definition of ssSkC22
fof(lit_def_017,axiom,
( ssSkC22
<=> $false ) ).
%------ Positive definition of ssSkC20
fof(lit_def_018,axiom,
( ssSkC20
<=> $true ) ).
%------ Positive definition of ssSkC18
fof(lit_def_019,axiom,
( ssSkC18
<=> $true ) ).
%------ Positive definition of ssSkC17
fof(lit_def_020,axiom,
( ssSkC17
<=> $true ) ).
%------ Positive definition of ssSkC16
fof(lit_def_021,axiom,
( ssSkC16
<=> $false ) ).
%------ Positive definition of ssSkC15
fof(lit_def_022,axiom,
( ssSkC15
<=> $true ) ).
%------ Positive definition of ssSkC14
fof(lit_def_023,axiom,
( ssSkC14
<=> $true ) ).
%------ Positive definition of ssSkC13
fof(lit_def_024,axiom,
( ssSkC13
<=> $false ) ).
%------ Positive definition of ssSkC11
fof(lit_def_025,axiom,
( ssSkC11
<=> $true ) ).
%------ Positive definition of ssSkC10
fof(lit_def_026,axiom,
( ssSkC10
<=> $true ) ).
%------ Positive definition of ssSkC8
fof(lit_def_027,axiom,
( ssSkC8
<=> $true ) ).
%------ Positive definition of ssSkC7
fof(lit_def_028,axiom,
( ssSkC7
<=> $true ) ).
%------ Positive definition of ssSkC6
fof(lit_def_029,axiom,
( ssSkC6
<=> $true ) ).
%------ Positive definition of ssSkC3
fof(lit_def_030,axiom,
( ssSkC3
<=> $true ) ).
%------ Positive definition of ssSkC2
fof(lit_def_031,axiom,
( ssSkC2
<=> $true ) ).
%------ Positive definition of ssSkC1
fof(lit_def_032,axiom,
( ssSkC1
<=> $true ) ).
%------ Positive definition of ssSkC0
fof(lit_def_033,axiom,
( ssSkC0
<=> $true ) ).
%------ Positive definition of ndr1_1
fof(lit_def_034,axiom,
! [X0] :
( ndr1_1(X0)
<=> ( X0 = a1053
| X0 = a1133
| X0 = a963
| X0 = a967
| X0 = a1087
| X0 = a1120
| X0 = a966
| X0 = a1003
| X0 = a1013
| X0 = a1028
| X0 = a1066
| X0 = a1118
| ( X0 != a1026
& X0 != a1125
& X0 != a1144 ) ) ) ).
%------ Positive definition of c3_1
fof(lit_def_035,axiom,
! [X0] :
( c3_1(X0)
<=> $false ) ).
%------ Positive definition of c8_0
fof(lit_def_036,axiom,
( c8_0
<=> $false ) ).
%------ Positive definition of c4_0
fof(lit_def_037,axiom,
( c4_0
<=> $true ) ).
%------ Positive definition of c7_0
fof(lit_def_038,axiom,
( c7_0
<=> $false ) ).
%------ Positive definition of ssSkC42
fof(lit_def_039,axiom,
( ssSkC42
<=> $false ) ).
%------ Positive definition of c6_0
fof(lit_def_040,axiom,
( c6_0
<=> $false ) ).
%------ Positive definition of ssSkC38
fof(lit_def_041,axiom,
( ssSkC38
<=> $false ) ).
%------ Positive definition of c10_0
fof(lit_def_042,axiom,
( c10_0
<=> $false ) ).
%------ Positive definition of c5_0
fof(lit_def_043,axiom,
( c5_0
<=> $false ) ).
%------ Positive definition of ssSkC26
fof(lit_def_044,axiom,
( ssSkC26
<=> $false ) ).
%------ Positive definition of c1_0
fof(lit_def_045,axiom,
( c1_0
<=> $true ) ).
%------ Positive definition of ssSkC21
fof(lit_def_046,axiom,
( ssSkC21
<=> $false ) ).
%------ Positive definition of ssSkC19
fof(lit_def_047,axiom,
( ssSkC19
<=> $false ) ).
%------ Positive definition of c9_0
fof(lit_def_048,axiom,
( c9_0
<=> $true ) ).
%------ Positive definition of ssSkC12
fof(lit_def_049,axiom,
( ssSkC12
<=> $true ) ).
%------ Positive definition of c3_0
fof(lit_def_050,axiom,
( c3_0
<=> $false ) ).
%------ Positive definition of ssSkP11
fof(lit_def_051,axiom,
! [X0] :
( ssSkP11(X0)
<=> ( X0 = a1125
| ( X0 != a1125
& X0 != a1013 ) ) ) ).
%------ Positive definition of ssSkP10
fof(lit_def_052,axiom,
! [X0] :
( ssSkP10(X0)
<=> $true ) ).
%------ Positive definition of ssSkP9
fof(lit_def_053,axiom,
! [X0] :
( ssSkP9(X0)
<=> $true ) ).
%------ Positive definition of c10_1
fof(lit_def_054,axiom,
! [X0] :
( c10_1(X0)
<=> ( X0 = a1133
| X0 = a1007
| X0 = a1120
| X0 = a1003
| X0 = a1062
| X0 = a1066
| X0 = a1118 ) ) ).
%------ Positive definition of ssSkP8
fof(lit_def_055,axiom,
! [X0] :
( ssSkP8(X0)
<=> $true ) ).
%------ Positive definition of ssSkP7
fof(lit_def_056,axiom,
! [X0] :
( ssSkP7(X0)
<=> $true ) ).
%------ Positive definition of c6_1
fof(lit_def_057,axiom,
! [X0] :
( c6_1(X0)
<=> X0 = a1013 ) ).
%------ Positive definition of c4_1
fof(lit_def_058,axiom,
! [X0] :
( c4_1(X0)
<=> ( X0 = a1026
| X0 = a1133
| X0 = a967
| X0 = a1120
| X0 = a1066
| X0 = a1118
| X0 = a1135
| X0 = a1153 ) ) ).
%------ Positive definition of ssSkP6
fof(lit_def_059,axiom,
! [X0] :
( ssSkP6(X0)
<=> $true ) ).
%------ Positive definition of c9_1
fof(lit_def_060,axiom,
! [X0] :
( c9_1(X0)
<=> X0 = a1135 ) ).
%------ Positive definition of ssSkP5
fof(lit_def_061,axiom,
! [X0] :
( ssSkP5(X0)
<=> $true ) ).
%------ Positive definition of c7_1
fof(lit_def_062,axiom,
! [X0] :
( c7_1(X0)
<=> X0 = a1133 ) ).
%------ Positive definition of ssSkP4
fof(lit_def_063,axiom,
! [X0] :
( ssSkP4(X0)
<=> ( X0 = a966
| X0 = a1013
| X0 = a1118
| ( X0 != a966
& X0 != a1013
& X0 != a1118 ) ) ) ).
%------ Positive definition of c5_1
fof(lit_def_064,axiom,
! [X0] :
( c5_1(X0)
<=> ( X0 = a1026
| X0 = a1133
| X0 = a963
| X0 = a1028
| X0 = a1118 ) ) ).
%------ Positive definition of ssSkP3
fof(lit_def_065,axiom,
! [X0] :
( ssSkP3(X0)
<=> $true ) ).
%------ Positive definition of c1_1
fof(lit_def_066,axiom,
! [X0] :
( c1_1(X0)
<=> $false ) ).
%------ Positive definition of ssSkP2
fof(lit_def_067,axiom,
! [X0] :
( ssSkP2(X0)
<=> $true ) ).
%------ Positive definition of ssSkP1
fof(lit_def_068,axiom,
! [X0] :
( ssSkP1(X0)
<=> ( X0 = a1026
| X0 = a1125
| X0 = a1144 ) ) ).
%------ Positive definition of c2_1
fof(lit_def_069,axiom,
! [X0] :
( c2_1(X0)
<=> $false ) ).
%------ Positive definition of ssSkP0
fof(lit_def_070,axiom,
! [X0] :
( ssSkP0(X0)
<=> $true ) ).
%------ Positive definition of c3_2
fof(lit_def_071,axiom,
! [X0,X1] :
( c3_2(X0,X1)
<=> ( ( X0 != a1053
& X0 != a1042
& X0 != a1028
& X1 = a1011 )
| ( X1 = a1054
& X0 = a1053 )
| ( X1 = a1011
& X0 = a1053 )
| ( X1 = a1011
& X0 = a1042 )
| ( X1 = a1181
& X0 = a1125 )
| ( X1 = a1113
& X0 = a1133 )
| ( X1 = a1145
& X0 = a1144 )
| ( X1 = a1104
& X0 = a963 )
| ( X1 != a1104
& X1 != a964
& X1 != a1111
& X1 != a1151
& X0 = a963 )
| ( X1 = a1181
& X0 = a1013 )
| ( X1 = a1011
& X0 = a1028 ) ) ) ).
%------ Positive definition of ssSkC46
fof(lit_def_072,axiom,
( ssSkC46
<=> $false ) ).
%------ Positive definition of c8_1
fof(lit_def_073,axiom,
! [X0] :
( c8_1(X0)
<=> $false ) ).
%------ Positive definition of ssSkC37
fof(lit_def_074,axiom,
( ssSkC37
<=> $true ) ).
%------ Positive definition of ssSkC5
fof(lit_def_075,axiom,
( ssSkC5
<=> $true ) ).
%------ Positive definition of c9_2
fof(lit_def_076,axiom,
! [X0,X1] :
( c9_2(X0,X1)
<=> ( ( X1 = a1181
& X0 = a1125 )
| ( X1 = a1149
& X0 = a1133 )
| ( X1 = a1134
& X0 = a1133 )
| ( X1 = a1149
& X0 = a963 )
| ( X1 = a964
& X0 = a963 )
| ( X1 = a1111
& X0 = a963 )
| ( X1 = a1151
& X0 = a963 )
| ( X1 != a1063
& X1 != a1112
& X1 != a1076
& X1 != a1085
& X1 != a1156
& X0 = a1087 )
| ( X1 = a1121
& X0 = a1120 )
| ( X1 = a989
& X0 = a966 )
| ( X1 = a1104
& X0 = a1003 )
| ( X1 = a989
& X0 = a1013 )
| ( X1 = a1181
& X0 = a1013 )
| ( X1 = a1149
& X0 = a1028 )
| ( X1 = a1011
& X0 = a1028 )
| ( X1 = a1149
& X0 = a1118 )
| ( X1 = a989
& X0 = a1118 ) ) ) ).
%------ Positive definition of c8_2
fof(lit_def_077,axiom,
! [X0,X1] :
( c8_2(X0,X1)
<=> ( ( X1 = a1100
& X0 = a1026 )
| ( X1 = a1126
& X0 = a1125 )
| ( X1 = a1014
& X0 = a1013 ) ) ) ).
%------ Positive definition of c6_2
fof(lit_def_078,axiom,
! [X0,X1] :
( c6_2(X0,X1)
<=> ( ( X1 = a1011
& X0 = a1042 )
| ( X1 = a1012
& X0 = a1125 )
| ( X1 = a1039
& X0 = a1133 )
| ( X1 = a1113
& X0 = a1133 )
| ( X1 = a968
& X0 = a967 )
| ( X1 = a1063
& X0 = a1087 )
| ( X1 = a1112
& X0 = a1087 )
| ( X1 = a1085
& X0 = a1087 )
| ( X1 = a1156
& X0 = a1087 )
| ( X1 = a1121
& X0 = a1120 )
| ( X1 = a1067
& X0 = a1066 ) ) ) ).
%------ Positive definition of c4_2
fof(lit_def_079,axiom,
! [X0,X1] :
( c4_2(X0,X1)
<=> ( ( X1 = a1127
& X0 = a1125 )
| ( X1 = a1145
& X0 = a1144 )
| ( X1 = a964
& X0 = a963 )
| ( X1 = a1030
& X0 = a1028 )
| ( X1 = a1119
& X0 = a1118 ) ) ) ).
%------ Positive definition of c2_2
fof(lit_def_080,axiom,
! [X0,X1] :
( c2_2(X0,X1)
<=> ( X1 = a1121
& X0 = a1120 ) ) ).
%------ Positive definition of c10_2
fof(lit_def_081,axiom,
! [X0,X1] :
( c10_2(X0,X1)
<=> ( ( X1 = a1054
& X0 = a1053 )
| ( X1 = a1159
& X0 = a1133 )
| ( X1 = a1172
& X0 = a1133 )
| ( X1 = a1121
& X0 = a1120 )
| ( X1 = a1172
& X0 = a1066 )
| ( X1 = a1172
& X0 = a1118 ) ) ) ).
%------ Positive definition of c1_2
fof(lit_def_082,axiom,
! [X0,X1] :
( c1_2(X0,X1)
<=> ( ( X1 = a1113
& X0 = a1133 )
| ( X1 = a964
& X0 = a963 )
| ( X1 = a968
& X0 = a967 )
| ( X1 = a1121
& X0 = a1120 )
| ( X1 = a1004
& X0 = a1003 )
| ( X1 = a1067
& X0 = a1066 ) ) ) ).
%------ Positive definition of c7_2
fof(lit_def_083,axiom,
! [X0,X1] :
( c7_2(X0,X1)
<=> ( X1 = a1012
& X0 = a1125 ) ) ).
%------ Positive definition of c5_2
fof(lit_def_084,axiom,
! [X0,X1] :
( c5_2(X0,X1)
<=> ( ( X1 = a1127
& X0 = a1125 )
| ( X1 = a1134
& X0 = a1133 )
| ( X1 = a1076
& X0 = a1087 ) ) ) ).
%------ Positive definition of ssSkC48
fof(lit_def_085,axiom,
( ssSkC48
<=> $false ) ).
%------ Positive definition of ssSkC33
fof(lit_def_086,axiom,
( ssSkC33
<=> $true ) ).
%------ Positive definition of ssSkC32
fof(lit_def_087,axiom,
( ssSkC32
<=> $false ) ).
%------ Positive definition of ssSkC34
fof(lit_def_088,axiom,
( ssSkC34
<=> $true ) ).
%------ Positive definition of ssSkC31
fof(lit_def_089,axiom,
( ssSkC31
<=> $true ) ).
%------ Positive definition of ssSkC4
fof(lit_def_090,axiom,
( ssSkC4
<=> $true ) ).
%------ Positive definition of ssSkC49
fof(lit_def_091,axiom,
( ssSkC49
<=> $true ) ).
%------ Positive definition of ssSkC50
fof(lit_def_092,axiom,
( ssSkC50
<=> $false ) ).
%------ Positive definition of ssSkC29
fof(lit_def_093,axiom,
( ssSkC29
<=> $false ) ).
%------ Positive definition of ssSkC51
fof(lit_def_094,axiom,
( ssSkC51
<=> $false ) ).
%------ Positive definition of ssSkC9
fof(lit_def_095,axiom,
( ssSkC9
<=> $false ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN424-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/0.35 % Computer : n005.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Fri Sep 25 01:08:32 UTC 2026
% 0.13/0.36 % CPUTime :
% 0.13/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/0.39 Running EPR theorem proving
% 0.13/0.39 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/0.40
% 0.13/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.40
% 0.13/0.41 % Detected problem language: tptp
% 0.13/0.42 % Proving...
% 3.00/1.12 % SZS status Started for theBenchmark.p
% 3.00/1.12 % SZS status Satisfiable for theBenchmark.p
% 3.00/1.12
% 3.00/1.12 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.00/1.12
% 3.00/1.12 ------ iProver source info
% 3.00/1.12
% 3.00/1.12 git: date: 2026-07-19 20:42:38 +0200
% 3.00/1.12 git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.00/1.12 git: non_committed_changes: false
% 3.00/1.12
% 3.00/1.12 ------ Parsing...successful
% 3.00/1.12
% 3.00/1.12
% 3.00/1.12 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Option_epr_non_horn_non_eq
% 3.00/1.12
% 3.00/1.12 ------ Proving...
% 3.00/1.12 ------ Problem Properties
% 3.00/1.12
% 3.00/1.12
% 3.00/1.12 clauses 767
% 3.00/1.12 conjectures 767
% 3.00/1.12 EPR 767
% 3.00/1.12 Horn 274
% 3.00/1.12 unary 0
% 3.00/1.12 binary 238
% 3.00/1.12 lits 3438
% 3.00/1.12 lits eq 0
% 3.00/1.12 fd_pure 0
% 3.00/1.12 fd_pseudo 0
% 3.00/1.12 fd_cond 0
% 3.00/1.12 fd_pseudo_cond 0
% 3.00/1.12 AC symbols 0
% 3.00/1.12
% 3.00/1.12 ------ Schedule EPR non Horn non eq is on
% 3.00/1.12
% 3.00/1.12 ------ no equalities: superposition off
% 3.00/1.12
% 3.00/1.12 ------ Input Options "--resolution_flag false" Time Limit: 70.
% 3.00/1.12
% 3.00/1.12
% 3.00/1.12 ------
% 3.00/1.12 Current options:
% 3.00/1.12 ------
% 3.00/1.12
% 3.00/1.12 ------ Input Options
% 3.00/1.12
% 3.00/1.12 --out_options all
% 3.00/1.12 --tptp_safe_out true
% 3.00/1.12 --problem_path ""
% 3.00/1.12 --include_path ""
% 3.00/1.12 --clausifier res/vclausify_rel
% 3.00/1.12 --clausifier_options --mode clausify -t 101.67 -updr off
% 3.00/1.12 --stdin false
% 3.00/1.12 --proof_out true
% 3.00/1.12 --proof_dot_file ""
% 3.00/1.12 --proof_reduce_dot []
% 3.00/1.12 --suppress_sat_res false
% 3.00/1.12 --suppress_unsat_res true
% 3.00/1.12 --stats_out none
% 3.00/1.12 --stats_mem false
% 3.00/1.12 --theory_stats_out false
% 3.00/1.12
% 3.00/1.12 ------ General Options
% 3.00/1.12
% 3.00/1.12 --fof false
% 3.00/1.12 --time_out_real 305.
% 3.00/1.12 --time_out_virtual -1.
% 3.00/1.12 --rnd_seed 13
% 3.00/1.12 --symbol_type_check false
% 3.00/1.12 --clausify_out false
% 3.00/1.12 --sig_cnt_out false
% 3.00/1.12 --trig_cnt_out false
% 3.00/1.12 --trig_cnt_out_tolerance 1.
% 3.00/1.12 --trig_cnt_out_sk_spl false
% 3.00/1.12 --abstr_cl_out false
% 3.00/1.12
% 3.00/1.12 ------ Interactive Mode
% 3.00/1.12
% 3.00/1.12 --interactive_mode false
% 3.00/1.12 --external_ip_address ""
% 3.00/1.12 --external_port 0
% 3.00/1.12
% 3.00/1.12 ------ Global Options
% 3.00/1.12
% 3.00/1.12 --schedule sat
% 3.00/1.12 --add_important_lit false
% 3.00/1.12 --prop_solver_per_cl 500
% 3.00/1.12 --subs_bck_mult 8
% 3.00/1.12 --min_unsat_core false
% 3.00/1.12 --soft_assumptions false
% 3.00/1.12 --soft_lemma_size 3
% 3.00/1.12 --prop_impl_unit_size 0
% 3.00/1.12 --prop_impl_unit []
% 3.00/1.12 --share_sel_clauses true
% 3.00/1.12 --reset_solvers false
% 3.00/1.12 --bc_imp_inh [conj_cone]
% 3.00/1.12 --conj_cone_tolerance 3.
% 3.00/1.12 --extra_neg_conj none
% 3.00/1.12 --large_theory_mode true
% 3.00/1.12 --prolific_symb_bound 200
% 3.00/1.12 --lt_threshold 2000
% 3.00/1.12 --clause_weak_htbl true
% 3.00/1.12 --gc_record_bc_elim false
% 3.00/1.12
% 3.00/1.12 ------ Preprocessing Options
% 3.00/1.12
% 3.00/1.12 --preprocessing_flag false
% 3.00/1.12 --time_out_prep_mult 0.1
% 3.00/1.12 --splitting_mode input
% 3.00/1.12 --splitting_grd true
% 3.00/1.12 --splitting_cvd false
% 3.00/1.12 --splitting_cvd_svl false
% 3.00/1.12 --splitting_nvd 32
% 3.00/1.12 --sub_typing false
% 3.00/1.12 --prep_eq_flat_conj false
% 3.00/1.12 --prep_ineq_split false
% 3.00/1.12 --prep_eq_flat_all_gr false
% 3.00/1.12 --prep_gs_sim true
% 3.00/1.12 --prep_unflatten true
% 3.00/1.12 --prep_res_sim true
% 3.00/1.12 --prep_sup_sim_all true
% 3.00/1.12 --prep_sup_sim_sup false
% 3.00/1.12 --prep_upred true
% 3.00/1.12 --prep_well_definedness true
% 3.00/1.12 --prep_sem_filter exhaustive
% 3.00/1.12 --prep_sem_filter_out false
% 3.00/1.12 --pred_elim true
% 3.00/1.12 --res_sim_input true
% 3.00/1.12 --eq_ax_congr_red true
% 3.00/1.12 --pure_diseq_elim true
% 3.00/1.12 --brand_transform false
% 3.00/1.12 --non_eq_to_eq false
% 3.00/1.12 --prep_eq_proxy false
% 3.00/1.12 --prep_def_merge true
% 3.00/1.12 --prep_def_merge_prop_impl false
% 3.00/1.12 --prep_def_merge_mbd true
% 3.00/1.12 --prep_def_merge_tr_red false
% 3.00/1.12 --prep_def_merge_tr_cl false
% 3.00/1.12 --smt_preprocessing false
% 3.00/1.12 --smt_ac_axioms fast
% 3.00/1.12 --preprocessed_out false
% 3.00/1.12 --preprocessed_stats false
% 3.00/1.12
% 3.00/1.12 ------ Abstraction refinement Options
% 3.00/1.12
% 3.00/1.12 --abstr_ref []
% 3.00/1.12 --abstr_ref_prep false
% 3.00/1.12 --abstr_ref_until_sat false
% 3.00/1.12 --abstr_ref_sig_restrict funpre
% 3.00/1.12 --abstr_ref_af_restrict_to_split_sk false
% 3.00/1.12 --abstr_ref_under []
% 3.00/1.12
% 3.00/1.12 ------ SAT Options
% 3.00/1.12
% 3.00/1.12 --sat_mode false
% 3.00/1.12 --sat_fm_restart_options ""
% 3.00/1.12 --sat_gr_def false
% 3.00/1.12 --sat_epr_types true
% 3.00/1.12 --sat_non_cyclic_types false
% 3.00/1.12 --sat_finite_models false
% 3.00/1.12 --sat_fm_lemmas false
% 3.00/1.12 --sat_fm_prep false
% 3.00/1.12 --sat_fm_uc_incr true
% 3.00/1.12 --sat_out_model pos
% 3.00/1.12 --sat_out_clauses false
% 3.00/1.12
% 3.00/1.12 ------ QBF Options
% 3.00/1.12
% 3.00/1.12 --qbf_mode false
% 3.00/1.12 --qbf_elim_univ false
% 3.00/1.12 --qbf_dom_inst none
% 3.00/1.12 --qbf_dom_pre_inst false
% 3.00/1.12 --qbf_sk_in false
% 3.00/1.12 --qbf_pred_elim true
% 3.00/1.12 --qbf_split 512
% 3.00/1.12
% 3.00/1.12 ------ BMC1 Options
% 3.00/1.12
% 3.00/1.12 --bmc1_incremental false
% 3.00/1.12 --bmc1_axioms reachable_all
% 3.00/1.12 --bmc1_min_bound 0
% 3.00/1.12 --bmc1_max_bound -1
% 3.00/1.12 --bmc1_max_bound_default -1
% 3.00/1.12 --bmc1_symbol_reachability true
% 3.00/1.12 --bmc1_property_lemmas false
% 3.00/1.12 --bmc1_k_induction false
% 3.00/1.12 --bmc1_non_equiv_states false
% 3.00/1.12 --bmc1_deadlock false
% 3.00/1.12 --bmc1_ucm false
% 3.00/1.12 --bmc1_add_unsat_core none
% 3.00/1.12 --bmc1_unsat_core_children false
% 3.00/1.12 --bmc1_unsat_core_extrapolate_axioms false
% 3.00/1.12 --bmc1_out_stat full
% 3.00/1.12 --bmc1_ground_init false
% 3.00/1.12 --bmc1_pre_inst_next_state false
% 3.00/1.12 --bmc1_pre_inst_state false
% 3.00/1.12 --bmc1_pre_inst_reach_state false
% 3.00/1.12 --bmc1_out_unsat_core false
% 3.00/1.12 --bmc1_aig_witness_out false
% 3.00/1.12 --bmc1_verbose false
% 3.00/1.12 --bmc1_dump_clauses_tptp false
% 3.00/1.12 --bmc1_dump_unsat_core_tptp false
% 3.00/1.12 --bmc1_dump_file -
% 3.00/1.12 --bmc1_ucm_expand_uc_limit 128
% 3.00/1.12 --bmc1_ucm_n_expand_iterations 6
% 3.00/1.12 --bmc1_ucm_extend_mode 1
% 3.00/1.12 --bmc1_ucm_init_mode 2
% 3.00/1.12 --bmc1_ucm_cone_mode none
% 3.00/1.12 --bmc1_ucm_reduced_relation_type 0
% 3.00/1.12 --bmc1_ucm_relax_model 4
% 3.00/1.12 --bmc1_ucm_full_tr_after_sat true
% 3.00/1.12 --bmc1_ucm_expand_neg_assumptions false
% 3.00/1.12 --bmc1_ucm_layered_model none
% 3.00/1.12 --bmc1_ucm_max_lemma_size 10
% 3.00/1.12
% 3.00/1.12 ------ AIG Options
% 3.00/1.12
% 3.00/1.12 --aig_mode false
% 3.00/1.12
% 3.00/1.12 ------ Instantiation Options
% 3.00/1.12
% 3.00/1.12 --instantiation_flag true
% 3.00/1.12 --inst_sos_flag false
% 3.00/1.12 --inst_sos_phase true
% 3.00/1.12 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb]
% 3.00/1.12 --inst_lit_sel [+prop;+num_symb;-sign;+num_var]
% 3.00/1.12 --inst_lit_sel_side num_symb
% 3.00/1.12 --inst_solver_per_active 1400
% 3.00/1.12 --inst_solver_calls_frac 1.
% 3.00/1.12 --inst_to_smt_solver true
% 3.00/1.12 --inst_passive_queue_type priority_queues
% 3.00/1.12 --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 3.00/1.12 --inst_passive_queues_freq [25;2]
% 3.00/1.12 --inst_dismatching true
% 3.00/1.12 --inst_eager_unprocessed_to_passive true
% 3.00/1.12 --inst_unprocessed_bound 1000
% 3.00/1.12 --inst_prop_sim_given false
% 3.00/1.12 --inst_prop_sim_new false
% 3.00/1.12 --inst_subs_new false
% 3.00/1.12 --inst_eq_res_simp false
% 3.00/1.12 --inst_subs_given false
% 3.00/1.12 --inst_orphan_elimination true
% 3.00/1.12 --inst_learning_loop_flag true
% 3.00/1.12 --inst_learning_start 3000
% 3.00/1.12 --inst_learning_factor 2
% 3.00/1.12 --inst_start_prop_sim_after_learn 3
% 3.00/1.12 --inst_sel_renew solver
% 3.00/1.12 --inst_lit_activity_flag true
% 3.00/1.12 --inst_restr_to_given false
% 3.00/1.12 --inst_activity_threshold 500
% 3.00/1.12
% 3.00/1.12 ------ Resolution Options
% 3.00/1.12
% 3.00/1.12 --resolution_flag false
% 3.00/1.12 --res_lit_sel adaptive
% 3.00/1.12 --res_lit_sel_side none
% 3.00/1.12 --res_ordering kbo
% 3.00/1.12 --res_to_prop_solver active
% 3.00/1.12 --res_prop_simpl_new false
% 3.00/1.12 --res_prop_simpl_given true
% 3.00/1.12 --res_to_smt_solver true
% 3.00/1.12 --res_passive_queue_type priority_queues
% 3.00/1.12 --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 3.00/1.12 --res_passive_queues_freq [15;5]
% 3.00/1.12 --res_forward_subs full
% 3.00/1.12 --res_backward_subs full
% 3.00/1.12 --res_forward_subs_resolution true
% 3.00/1.12 --res_backward_subs_resolution true
% 3.00/1.12 --res_orphan_elimination true
% 3.00/1.12 --res_time_limit 300.
% 3.00/1.12
% 3.00/1.12 ------ Superposition Options
% 3.00/1.12
% 3.00/1.12 --superposition_flag true
% 3.00/1.12 --sup_passive_queue_type priority_queues
% 3.00/1.12 --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.00/1.12 --sup_passive_queues_freq [8;1;4;4]
% 3.00/1.12 --twee_lhs_weight 4
% 3.00/1.12 --sup_set_join false
% 3.00/1.12 --sup_set_join_goals true
% 3.00/1.12 --sup_set_join_limit 1000
% 3.00/1.12 --demod_completeness_check fast
% 3.00/1.12 --demod_use_ground true
% 3.00/1.12 --sup_unprocessed_bound 0
% 3.00/1.12 --sup_to_prop_solver passive
% 3.00/1.12 --sup_prop_simpl_new true
% 3.00/1.12 --sup_prop_simpl_given true
% 3.00/1.12 --sup_fun_splitting false
% 3.00/1.12 --sup_iter_deepening 2
% 3.00/1.12 --sup_restarts_mult 12
% 3.00/1.12 --sup_score sim_d_gen
% 3.00/1.12 --sup_share_score_frac 0.2
% 3.00/1.12 --sup_share_max_num_cl 500
% 3.00/1.12 --sup_ordering kbo
% 3.00/1.12 --sup_symb_ordering invfreq
% 3.00/1.12 --sup_term_weight default
% 3.00/1.12
% 3.00/1.12 ------ Superposition Simplification Setup
% 3.00/1.12
% 3.00/1.12 --sup_indices_passive [LightNormIndex;FwDemodIndex]
% 3.00/1.12 --sup_full_triv [SMTSimplify;PropSubs]
% 3.00/1.12 --sup_full_fw [ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 3.00/1.12 --sup_full_bw [BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 3.00/1.12 --sup_immed_triv []
% 3.00/1.12 --sup_immed_fw_main [ACNormalisation;FwLightNorm;FwUnitSubsAndRes]
% 3.00/1.12 --sup_immed_fw_immed [ACNormalisation;FwUnitSubsAndRes]
% 3.00/1.12 --sup_immed_bw_main [BwUnitSubsAndRes;BwDemod]
% 3.00/1.12 --sup_immed_bw_immed [BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 3.00/1.12 --sup_input_triv [Unflattening;SMTSimplify]
% 3.00/1.12 --sup_input_fw [FwACDemod;ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 3.00/1.12 --sup_input_bw [BwACDemod;BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 3.00/1.12 --sup_full_fixpoint true
% 3.00/1.12 --sup_main_fixpoint true
% 3.00/1.12 --sup_immed_fixpoint false
% 3.00/1.12 --sup_input_fixpoint true
% 3.00/1.12 --sup_cache_sim none
% 3.00/1.12 --sup_smt_interval 500
% 3.00/1.12 --sup_bw_gjoin_interval 0
% 3.00/1.12
% 3.00/1.12 ------ Combination Options
% 3.00/1.12
% 3.00/1.12 --comb_mode clause_based
% 3.00/1.12 --comb_inst_mult 5
% 3.00/1.12 --comb_res_mult 1
% 3.00/1.12 --comb_sup_mult 1
% 3.00/1.12 --comb_sup_deep_mult 1
% 3.00/1.12
% 3.00/1.12 ------ Debug Options
% 3.00/1.12
% 3.00/1.12 --dbg_backtrace false
% 3.00/1.12 --dbg_dump_prop_clauses false
% 3.00/1.12 --dbg_dump_prop_clauses_file -
% 3.00/1.12 --dbg_out_stat false
% 3.00/1.12 --dbg_just_parse false
% 3.00/1.12
% 3.00/1.12
% 3.00/1.12
% 3.00/1.12
% 3.00/1.12 ------ Proving...
% 3.00/1.12
% 3.00/1.12
% 3.00/1.12 % SZS status Satisfiable for theBenchmark.p
% 3.00/1.12
% 3.00/1.12 ------ Building Model...Done
% 3.00/1.12
% 3.00/1.12 %------ The model is defined over ground terms (initial term algebra).
% 3.00/1.12 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 3.00/1.12 %------ where \phi is a formula over the term algebra.
% 3.00/1.12 %------ If we have equality in the problem then it is also defined as a predicate above,
% 3.00/1.12 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 3.00/1.12 %------ See help for --sat_out_model for different model outputs.
% 3.00/1.12 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 3.00/1.12 %------ where the first argument stands for the sort ($i in the unsorted case)
% 3.00/1.12 % SZS output start Model for theBenchmark.p
% See solution above
% 3.00/1.13
%------------------------------------------------------------------------------