TSTP Solution File: SYN547-1 by iProver-SAT---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver-SAT---3.8
% Problem : SYN547-1 : TPTP v8.1.2. Released v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d SAT
% Computer : n001.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 Sep 1 03:17:41 EDT 2023
% Result : Satisfiable 3.59s 1.12s
% Output : Model 3.59s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
%------ Positive definition of ssSkC26
fof(lit_def,axiom,
( ssSkC26
<=> $true ) ).
%------ Positive definition of ssSkC23
fof(lit_def_001,axiom,
( ssSkC23
<=> $false ) ).
%------ Positive definition of ssSkC20
fof(lit_def_002,axiom,
( ssSkC20
<=> $true ) ).
%------ Positive definition of ssSkC19
fof(lit_def_003,axiom,
( ssSkC19
<=> $false ) ).
%------ Positive definition of ssSkC18
fof(lit_def_004,axiom,
( ssSkC18
<=> $false ) ).
%------ Positive definition of ssSkC17
fof(lit_def_005,axiom,
( ssSkC17
<=> $true ) ).
%------ Positive definition of ssSkC16
fof(lit_def_006,axiom,
( ssSkC16
<=> $true ) ).
%------ Positive definition of ssSkC15
fof(lit_def_007,axiom,
( ssSkC15
<=> $true ) ).
%------ Positive definition of ssSkC14
fof(lit_def_008,axiom,
( ssSkC14
<=> $false ) ).
%------ Positive definition of ssSkC13
fof(lit_def_009,axiom,
( ssSkC13
<=> $true ) ).
%------ Positive definition of ssSkC10
fof(lit_def_010,axiom,
( ssSkC10
<=> $true ) ).
%------ Positive definition of ssSkC9
fof(lit_def_011,axiom,
( ssSkC9
<=> $true ) ).
%------ Negative definition of c7_1
fof(lit_def_012,axiom,
! [X0] :
( ~ c7_1(X0)
<=> X0 = a536 ) ).
%------ Negative definition of c5_1
fof(lit_def_013,axiom,
! [X0] :
( ~ c5_1(X0)
<=> ( X0 = a520
| X0 = a491
| X0 = a531 ) ) ).
%------ Positive definition of c3_1
fof(lit_def_014,axiom,
! [X0] :
( c3_1(X0)
<=> X0 = a587 ) ).
%------ Positive definition of c2_0
fof(lit_def_015,axiom,
( c2_0
<=> $false ) ).
%------ Positive definition of ndr1_1
fof(lit_def_016,axiom,
! [X0] :
( ndr1_1(X0)
<=> ( X0 = a570
| X0 = a520
| X0 = a498
| X0 = a559 ) ) ).
%------ Positive definition of c4_1
fof(lit_def_017,axiom,
! [X0] :
( c4_1(X0)
<=> ( X0 = a570
| X0 = a488
| X0 = a531 ) ) ).
%------ Positive definition of c7_0
fof(lit_def_018,axiom,
( c7_0
<=> $false ) ).
%------ Positive definition of ssSkC7
fof(lit_def_019,axiom,
( ssSkC7
<=> $false ) ).
%------ Positive definition of ssSkP8
fof(lit_def_020,axiom,
! [X0] :
( ssSkP8(X0)
<=> $true ) ).
%------ Positive definition of c6_1
fof(lit_def_021,axiom,
! [X0] :
( c6_1(X0)
<=> X0 = a552 ) ).
%------ Positive definition of c2_1
fof(lit_def_022,axiom,
! [X0] :
( c2_1(X0)
<=> $false ) ).
%------ Positive definition of c1_1
fof(lit_def_023,axiom,
! [X0] :
( c1_1(X0)
<=> $false ) ).
%------ Positive definition of ssSkP5
fof(lit_def_024,axiom,
! [X0] :
( ssSkP5(X0)
<=> $true ) ).
%------ Positive definition of ssSkP2
fof(lit_def_025,axiom,
! [X0] :
( ssSkP2(X0)
<=> $true ) ).
%------ Positive definition of c8_1
fof(lit_def_026,axiom,
! [X0] :
( c8_1(X0)
<=> $false ) ).
%------ Negative definition of c2_2
fof(lit_def_027,axiom,
! [X0,X1] :
( ~ c2_2(X0,X1)
<=> ( ( X1 = a553
& X0 != a570 )
| ( X1 = a516
& X0 != a570 )
| ( X1 = a493
& X0 != a570 )
| ( X1 = a557
& X0 != a570 )
| ( X1 = a525
& X0 != a570 ) ) ) ).
%------ Positive definition of c1_2
fof(lit_def_028,axiom,
! [X0,X1] :
( c1_2(X0,X1)
<=> ( X0 = a570
& X1 = a571 ) ) ).
%------ Positive definition of c3_2
fof(lit_def_029,axiom,
! [X0,X1] :
( c3_2(X0,X1)
<=> ( ( X0 = a570
& X1 = a571 )
| ( X0 = a498
& X1 = a499 ) ) ) ).
%------ Positive definition of ssSkC4
fof(lit_def_030,axiom,
( ssSkC4
<=> $false ) ).
%------ Positive definition of c5_2
fof(lit_def_031,axiom,
! [X0,X1] :
( c5_2(X0,X1)
<=> $false ) ).
%------ Positive definition of c7_2
fof(lit_def_032,axiom,
! [X0,X1] :
( c7_2(X0,X1)
<=> ( ( X0 = a498
& X1 = a499 )
| ( X0 = a559
& X1 = a560 ) ) ) ).
%------ Positive definition of c8_2
fof(lit_def_033,axiom,
! [X0,X1] :
( c8_2(X0,X1)
<=> ( X0 = a498
& X1 = a500 ) ) ).
%------ Positive definition of c4_2
fof(lit_def_034,axiom,
! [X0,X1] :
( c4_2(X0,X1)
<=> ( ( X0 = a498
& X1 = a500 )
| ( X0 = a498
& X1 = a499 )
| ( X0 = a559
& X1 = a560 ) ) ) ).
%------ Positive definition of c6_2
fof(lit_def_035,axiom,
! [X0,X1] :
( c6_2(X0,X1)
<=> $false ) ).
%------ Positive definition of ssSkC0
fof(lit_def_036,axiom,
( ssSkC0
<=> $false ) ).
%------ Positive definition of ssSkC3
fof(lit_def_037,axiom,
( ssSkC3
<=> $false ) ).
%------ Positive definition of sP1_iProver_split
fof(lit_def_038,axiom,
( sP1_iProver_split
<=> $true ) ).
%------ Positive definition of sP6_iProver_split
fof(lit_def_039,axiom,
! [X0] :
( sP6_iProver_split(X0)
<=> $false ) ).
%------ Positive definition of sP8_iProver_split
fof(lit_def_040,axiom,
( sP8_iProver_split
<=> $false ) ).
%------ Positive definition of sP9_iProver_split
fof(lit_def_041,axiom,
( sP9_iProver_split
<=> $false ) ).
%------ Positive definition of sP11_iProver_split
fof(lit_def_042,axiom,
( sP11_iProver_split
<=> $false ) ).
%------ Positive definition of sP12_iProver_split
fof(lit_def_043,axiom,
( sP12_iProver_split
<=> $false ) ).
%------ Positive definition of sP13_iProver_split
fof(lit_def_044,axiom,
( sP13_iProver_split
<=> $false ) ).
%------ Positive definition of sP14_iProver_split
fof(lit_def_045,axiom,
! [X0] :
( sP14_iProver_split(X0)
<=> $false ) ).
%------ Positive definition of sP15_iProver_split
fof(lit_def_046,axiom,
( sP15_iProver_split
<=> $false ) ).
%------ Positive definition of sP17_iProver_split
fof(lit_def_047,axiom,
( sP17_iProver_split
<=> $true ) ).
%------ Positive definition of sP18_iProver_split
fof(lit_def_048,axiom,
! [X0] :
( sP18_iProver_split(X0)
<=> $false ) ).
%------ Positive definition of sP19_iProver_split
fof(lit_def_049,axiom,
! [X0] :
( sP19_iProver_split(X0)
<=> $false ) ).
%------ Positive definition of sP20_iProver_split
fof(lit_def_050,axiom,
! [X0] :
( sP20_iProver_split(X0)
<=> $false ) ).
%------ Positive definition of sP25_iProver_split
fof(lit_def_051,axiom,
( sP25_iProver_split
<=> $true ) ).
%------ Positive definition of sP26_iProver_split
fof(lit_def_052,axiom,
( sP26_iProver_split
<=> $false ) ).
%------ Positive definition of sP29_iProver_split
fof(lit_def_053,axiom,
( sP29_iProver_split
<=> $false ) ).
%------ Positive definition of sP32_iProver_split
fof(lit_def_054,axiom,
( sP32_iProver_split
<=> $false ) ).
%------ Positive definition of sP33_iProver_split
fof(lit_def_055,axiom,
( sP33_iProver_split
<=> $false ) ).
%------ Positive definition of sP34_iProver_split
fof(lit_def_056,axiom,
( sP34_iProver_split
<=> $false ) ).
%------ Positive definition of sP35_iProver_split
fof(lit_def_057,axiom,
( sP35_iProver_split
<=> $false ) ).
%------ Positive definition of sP36_iProver_split
fof(lit_def_058,axiom,
( sP36_iProver_split
<=> $false ) ).
%------ Positive definition of sP37_iProver_split
fof(lit_def_059,axiom,
( sP37_iProver_split
<=> $true ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN547-1 : TPTP v8.1.2. Released v2.1.0.
% 0.00/0.13 % Command : run_iprover %s %d SAT
% 0.13/0.34 % Computer : n001.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sat Aug 26 22:17:01 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running model finding
% 0.19/0.46 Running: /export/starexec/sandbox2/solver/bin/run_problem --no_cores 8 --heuristic_context fnt --schedule fnt_schedule /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.59/1.12 % SZS status Started for theBenchmark.p
% 3.59/1.12 % SZS status Satisfiable for theBenchmark.p
% 3.59/1.12
% 3.59/1.12 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.59/1.12
% 3.59/1.12 ------ iProver source info
% 3.59/1.12
% 3.59/1.12 git: date: 2023-05-31 18:12:56 +0000
% 3.59/1.12 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.59/1.12 git: non_committed_changes: false
% 3.59/1.12 git: last_make_outside_of_git: false
% 3.59/1.12
% 3.59/1.12 ------ Parsing...successful
% 3.59/1.12
% 3.59/1.12
% 3.59/1.12
% 3.59/1.12 ------ Preprocessing... pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe:16:0s pe_e pe_s pe_e
% 3.59/1.12
% 3.59/1.12 ------ Preprocessing... scvd_s sp: 79 0s scvd_e snvd_s sp: 0 0s snvd_e
% 3.59/1.12 ------ Proving...
% 3.59/1.12 ------ Problem Properties
% 3.59/1.12
% 3.59/1.12
% 3.59/1.12 clauses 295
% 3.59/1.12 conjectures 293
% 3.59/1.12 EPR 295
% 3.59/1.12 Horn 111
% 3.59/1.12 unary 12
% 3.59/1.12 binary 77
% 3.59/1.12 lits 1229
% 3.59/1.12 lits eq 0
% 3.59/1.12 fd_pure 0
% 3.59/1.12 fd_pseudo 0
% 3.59/1.12 fd_cond 0
% 3.59/1.12 fd_pseudo_cond 0
% 3.59/1.12 AC symbols 0
% 3.59/1.12
% 3.59/1.12 ------ Input Options Time Limit: Unbounded
% 3.59/1.12
% 3.59/1.12
% 3.59/1.12 ------ Finite Models:
% 3.59/1.12
% 3.59/1.12 ------ lit_activity_flag true
% 3.59/1.12
% 3.59/1.12 ------
% 3.59/1.12 Current options:
% 3.59/1.12 ------
% 3.59/1.12
% 3.59/1.12 ------ Input Options
% 3.59/1.12
% 3.59/1.12 --out_options all
% 3.59/1.12 --tptp_safe_out true
% 3.59/1.12 --problem_path ""
% 3.59/1.12 --include_path ""
% 3.59/1.12 --clausifier res/vclausify_rel
% 3.59/1.12 --clausifier_options --mode clausify -t 300.00
% 3.59/1.12 --stdin false
% 3.59/1.12 --proof_out true
% 3.59/1.12 --proof_dot_file ""
% 3.59/1.12 --proof_reduce_dot []
% 3.59/1.12 --suppress_sat_res false
% 3.59/1.12 --suppress_unsat_res true
% 3.59/1.12 --stats_out all
% 3.59/1.12 --stats_mem false
% 3.59/1.12 --theory_stats_out false
% 3.59/1.12
% 3.59/1.12 ------ General Options
% 3.59/1.12
% 3.59/1.12 --fof false
% 3.59/1.12 --time_out_real 300.
% 3.59/1.12 --time_out_virtual -1.
% 3.59/1.12 --rnd_seed 13
% 3.59/1.12 --symbol_type_check false
% 3.59/1.12 --clausify_out false
% 3.59/1.12 --sig_cnt_out false
% 3.59/1.12 --trig_cnt_out false
% 3.59/1.12 --trig_cnt_out_tolerance 1.
% 3.59/1.12 --trig_cnt_out_sk_spl false
% 3.59/1.12 --abstr_cl_out false
% 3.59/1.12
% 3.59/1.12 ------ Interactive Mode
% 3.59/1.12
% 3.59/1.12 --interactive_mode false
% 3.59/1.12 --external_ip_address ""
% 3.59/1.12 --external_port 0
% 3.59/1.12
% 3.59/1.12 ------ Global Options
% 3.59/1.12
% 3.59/1.12 --schedule none
% 3.59/1.12 --add_important_lit false
% 3.59/1.12 --prop_solver_per_cl 500
% 3.59/1.12 --subs_bck_mult 8
% 3.59/1.12 --min_unsat_core false
% 3.59/1.12 --soft_assumptions false
% 3.59/1.12 --soft_lemma_size 3
% 3.59/1.12 --prop_impl_unit_size 0
% 3.59/1.12 --prop_impl_unit []
% 3.59/1.12 --share_sel_clauses true
% 3.59/1.12 --reset_solvers false
% 3.59/1.12 --bc_imp_inh [conj_cone]
% 3.59/1.12 --conj_cone_tolerance 3.
% 3.59/1.12 --extra_neg_conj all_pos_neg
% 3.59/1.12 --large_theory_mode true
% 3.59/1.12 --prolific_symb_bound 500
% 3.59/1.12 --lt_threshold 2000
% 3.59/1.12 --clause_weak_htbl true
% 3.59/1.12 --gc_record_bc_elim false
% 3.59/1.12
% 3.59/1.12 ------ Preprocessing Options
% 3.59/1.12
% 3.59/1.12 --preprocessing_flag true
% 3.59/1.12 --time_out_prep_mult 0.2
% 3.59/1.12 --splitting_mode input
% 3.59/1.12 --splitting_grd false
% 3.59/1.12 --splitting_cvd true
% 3.59/1.12 --splitting_cvd_svl true
% 3.59/1.12 --splitting_nvd 256
% 3.59/1.12 --sub_typing false
% 3.59/1.12 --prep_gs_sim false
% 3.59/1.12 --prep_unflatten true
% 3.59/1.12 --prep_res_sim true
% 3.59/1.12 --prep_sup_sim_all true
% 3.59/1.12 --prep_sup_sim_sup false
% 3.59/1.12 --prep_upred true
% 3.59/1.12 --prep_well_definedness true
% 3.59/1.12 --prep_sem_filter none
% 3.59/1.12 --prep_sem_filter_out false
% 3.59/1.12 --pred_elim true
% 3.59/1.12 --res_sim_input false
% 3.59/1.12 --eq_ax_congr_red true
% 3.59/1.12 --pure_diseq_elim false
% 3.59/1.12 --brand_transform false
% 3.59/1.12 --non_eq_to_eq false
% 3.59/1.12 --prep_def_merge false
% 3.59/1.12 --prep_def_merge_prop_impl false
% 3.59/1.12 --prep_def_merge_mbd true
% 3.59/1.12 --prep_def_merge_tr_red false
% 3.59/1.12 --prep_def_merge_tr_cl false
% 3.59/1.12 --smt_preprocessing false
% 3.59/1.12 --smt_ac_axioms fast
% 3.59/1.12 --preprocessed_out false
% 3.59/1.12 --preprocessed_stats false
% 3.59/1.12
% 3.59/1.12 ------ Abstraction refinement Options
% 3.59/1.12
% 3.59/1.12 --abstr_ref []
% 3.59/1.12 --abstr_ref_prep false
% 3.59/1.12 --abstr_ref_until_sat false
% 3.59/1.12 --abstr_ref_sig_restrict funpre
% 3.59/1.12 --abstr_ref_af_restrict_to_split_sk false
% 3.59/1.12 --abstr_ref_under []
% 3.59/1.12
% 3.59/1.12 ------ SAT Options
% 3.59/1.12
% 3.59/1.12 --sat_mode true
% 3.59/1.12 --sat_fm_restart_options ""
% 3.59/1.12 --sat_gr_def false
% 3.59/1.12 --sat_epr_types false
% 3.59/1.12 --sat_non_cyclic_types true
% 3.59/1.12 --sat_finite_models true
% 3.59/1.12 --sat_fm_lemmas false
% 3.59/1.12 --sat_fm_prep false
% 3.59/1.12 --sat_fm_uc_incr true
% 3.59/1.12 --sat_out_model small
% 3.59/1.12 --sat_out_clauses false
% 3.59/1.12
% 3.59/1.12 ------ QBF Options
% 3.59/1.12
% 3.59/1.12 --qbf_mode false
% 3.59/1.12 --qbf_elim_univ false
% 3.59/1.12 --qbf_dom_inst none
% 3.59/1.12 --qbf_dom_pre_inst false
% 3.59/1.12 --qbf_sk_in false
% 3.59/1.12 --qbf_pred_elim true
% 3.59/1.12 --qbf_split 512
% 3.59/1.12
% 3.59/1.12 ------ BMC1 Options
% 3.59/1.12
% 3.59/1.12 --bmc1_incremental false
% 3.59/1.12 --bmc1_axioms reachable_all
% 3.59/1.12 --bmc1_min_bound 0
% 3.59/1.12 --bmc1_max_bound -1
% 3.59/1.12 --bmc1_max_bound_default -1
% 3.59/1.12 --bmc1_symbol_reachability false
% 3.59/1.12 --bmc1_property_lemmas false
% 3.59/1.12 --bmc1_k_induction false
% 3.59/1.12 --bmc1_non_equiv_states false
% 3.59/1.12 --bmc1_deadlock false
% 3.59/1.12 --bmc1_ucm false
% 3.59/1.12 --bmc1_add_unsat_core none
% 3.59/1.12 --bmc1_unsat_core_children false
% 3.59/1.12 --bmc1_unsat_core_extrapolate_axioms false
% 3.59/1.12 --bmc1_out_stat full
% 3.59/1.12 --bmc1_ground_init false
% 3.59/1.12 --bmc1_pre_inst_next_state false
% 3.59/1.12 --bmc1_pre_inst_state false
% 3.59/1.12 --bmc1_pre_inst_reach_state false
% 3.59/1.12 --bmc1_out_unsat_core false
% 3.59/1.12 --bmc1_aig_witness_out false
% 3.59/1.12 --bmc1_verbose false
% 3.59/1.12 --bmc1_dump_clauses_tptp false
% 3.59/1.12 --bmc1_dump_unsat_core_tptp false
% 3.59/1.12 --bmc1_dump_file -
% 3.59/1.12 --bmc1_ucm_expand_uc_limit 128
% 3.59/1.12 --bmc1_ucm_n_expand_iterations 6
% 3.59/1.12 --bmc1_ucm_extend_mode 1
% 3.59/1.12 --bmc1_ucm_init_mode 2
% 3.59/1.12 --bmc1_ucm_cone_mode none
% 3.59/1.12 --bmc1_ucm_reduced_relation_type 0
% 3.59/1.12 --bmc1_ucm_relax_model 4
% 3.59/1.12 --bmc1_ucm_full_tr_after_sat true
% 3.59/1.12 --bmc1_ucm_expand_neg_assumptions false
% 3.59/1.12 --bmc1_ucm_layered_model none
% 3.59/1.12 --bmc1_ucm_max_lemma_size 10
% 3.59/1.12
% 3.59/1.12 ------ AIG Options
% 3.59/1.12
% 3.59/1.12 --aig_mode false
% 3.59/1.12
% 3.59/1.12 ------ Instantiation Options
% 3.59/1.12
% 3.59/1.12 --instantiation_flag true
% 3.59/1.12 --inst_sos_flag false
% 3.59/1.12 --inst_sos_phase true
% 3.59/1.12 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb]
% 3.59/1.12 --inst_lit_sel [-sign;+num_symb;+non_prol_conj_symb]
% 3.59/1.12 --inst_lit_sel_side num_lit
% 3.59/1.12 --inst_solver_per_active 1400
% 3.59/1.12 --inst_solver_calls_frac 0.01
% 3.59/1.12 --inst_to_smt_solver true
% 3.59/1.12 --inst_passive_queue_type priority_queues
% 3.59/1.12 --inst_passive_queues [[+conj_dist;+num_lits;-age];[-conj_symb;-min_def_symb;+bc_imp_inh]]
% 3.59/1.12 --inst_passive_queues_freq [512;64]
% 3.59/1.12 --inst_dismatching true
% 3.59/1.12 --inst_eager_unprocessed_to_passive false
% 3.59/1.12 --inst_unprocessed_bound 1000
% 3.59/1.12 --inst_prop_sim_given true
% 3.59/1.12 --inst_prop_sim_new true
% 3.59/1.12 --inst_subs_new false
% 3.59/1.12 --inst_eq_res_simp false
% 3.59/1.12 --inst_subs_given true
% 3.59/1.12 --inst_orphan_elimination false
% 3.59/1.12 --inst_learning_loop_flag true
% 3.59/1.12 --inst_learning_start 5
% 3.59/1.12 --inst_learning_factor 8
% 3.59/1.12 --inst_start_prop_sim_after_learn 0
% 3.59/1.12 --inst_sel_renew solver
% 3.59/1.12 --inst_lit_activity_flag true
% 3.59/1.12 --inst_restr_to_given false
% 3.59/1.12 --inst_activity_threshold 10000
% 3.59/1.12
% 3.59/1.12 ------ Resolution Options
% 3.59/1.12
% 3.59/1.12 --resolution_flag false
% 3.59/1.12 --res_lit_sel neg_max
% 3.59/1.12 --res_lit_sel_side num_lit
% 3.59/1.12 --res_ordering kbo
% 3.59/1.12 --res_to_prop_solver passive
% 3.59/1.12 --res_prop_simpl_new true
% 3.59/1.12 --res_prop_simpl_given true
% 3.59/1.12 --res_to_smt_solver true
% 3.59/1.12 --res_passive_queue_type priority_queues
% 3.59/1.12 --res_passive_queues [[-has_eq;-conj_non_prolific_symb;+ground];[-bc_imp_inh;-conj_symb]]
% 3.59/1.12 --res_passive_queues_freq [1024;32]
% 3.59/1.12 --res_forward_subs subset_subsumption
% 3.59/1.12 --res_backward_subs subset_subsumption
% 3.59/1.12 --res_forward_subs_resolution true
% 3.59/1.12 --res_backward_subs_resolution false
% 3.59/1.12 --res_orphan_elimination false
% 3.59/1.12 --res_time_limit 10.
% 3.59/1.12
% 3.59/1.12 ------ Superposition Options
% 3.59/1.12
% 3.59/1.12 --superposition_flag false
% 3.59/1.12 --sup_passive_queue_type priority_queues
% 3.59/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.59/1.12 --sup_passive_queues_freq [8;1;4;4]
% 3.59/1.12 --demod_completeness_check fast
% 3.59/1.12 --demod_use_ground true
% 3.59/1.12 --sup_unprocessed_bound 0
% 3.59/1.12 --sup_to_prop_solver passive
% 3.59/1.12 --sup_prop_simpl_new true
% 3.59/1.12 --sup_prop_simpl_given true
% 3.59/1.12 --sup_fun_splitting false
% 3.59/1.12 --sup_iter_deepening 2
% 3.59/1.12 --sup_restarts_mult 12
% 3.59/1.12 --sup_score sim_d_gen
% 3.59/1.12 --sup_share_score_frac 0.2
% 3.59/1.12 --sup_share_max_num_cl 500
% 3.59/1.12 --sup_ordering kbo
% 3.59/1.12 --sup_symb_ordering invfreq
% 3.59/1.12 --sup_term_weight default
% 3.59/1.12
% 3.59/1.12 ------ Superposition Simplification Setup
% 3.59/1.12
% 3.59/1.12 --sup_indices_passive [LightNormIndex;FwDemodIndex]
% 3.59/1.12 --sup_full_triv [SMTSimplify;PropSubs]
% 3.59/1.12 --sup_full_fw [ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 3.59/1.12 --sup_full_bw [BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 3.59/1.12 --sup_immed_triv []
% 3.59/1.12 --sup_immed_fw_main [ACNormalisation;FwLightNorm;FwUnitSubsAndRes]
% 3.59/1.12 --sup_immed_fw_immed [ACNormalisation;FwUnitSubsAndRes]
% 3.59/1.12 --sup_immed_bw_main [BwUnitSubsAndRes;BwDemod]
% 3.59/1.12 --sup_immed_bw_immed [BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 3.59/1.12 --sup_input_triv [Unflattening;SMTSimplify]
% 3.59/1.12 --sup_input_fw [FwACDemod;ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 3.59/1.12 --sup_input_bw [BwACDemod;BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 3.59/1.12 --sup_full_fixpoint true
% 3.59/1.12 --sup_main_fixpoint true
% 3.59/1.12 --sup_immed_fixpoint false
% 3.59/1.12 --sup_input_fixpoint true
% 3.59/1.12 --sup_cache_sim none
% 3.59/1.12 --sup_smt_interval 500
% 3.59/1.12 --sup_bw_gjoin_interval 0
% 3.59/1.12
% 3.59/1.12 ------ Combination Options
% 3.59/1.12
% 3.59/1.12 --comb_mode clause_based
% 3.59/1.12 --comb_inst_mult 1000
% 3.59/1.12 --comb_res_mult 10
% 3.59/1.12 --comb_sup_mult 8
% 3.59/1.12 --comb_sup_deep_mult 2
% 3.59/1.12
% 3.59/1.12 ------ Debug Options
% 3.59/1.12
% 3.59/1.12 --dbg_backtrace false
% 3.59/1.12 --dbg_dump_prop_clauses false
% 3.59/1.12 --dbg_dump_prop_clauses_file -
% 3.59/1.12 --dbg_out_stat false
% 3.59/1.12 --dbg_just_parse false
% 3.59/1.12
% 3.59/1.12
% 3.59/1.12
% 3.59/1.12
% 3.59/1.12 ------ Proving...
% 3.59/1.12
% 3.59/1.12
% 3.59/1.12 % SZS status Satisfiable for theBenchmark.p
% 3.59/1.12
% 3.59/1.12 ------ Building Model...Done
% 3.59/1.12
% 3.59/1.12 %------ The model is defined over ground terms (initial term algebra).
% 3.59/1.12 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 3.59/1.12 %------ where \phi is a formula over the term algebra.
% 3.59/1.12 %------ If we have equality in the problem then it is also defined as a predicate above,
% 3.59/1.12 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 3.59/1.12 %------ See help for --sat_out_model for different model outputs.
% 3.59/1.12 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 3.59/1.12 %------ where the first argument stands for the sort ($i in the unsorted case)
% 3.59/1.12 % SZS output start Model for theBenchmark.p
% See solution above
% 3.59/1.12 ------ Statistics
% 3.59/1.12
% 3.59/1.12 ------ Problem properties
% 3.59/1.12
% 3.59/1.12 clauses: 295
% 3.59/1.12 conjectures: 293
% 3.59/1.12 epr: 295
% 3.59/1.12 horn: 111
% 3.59/1.12 ground: 94
% 3.59/1.12 unary: 12
% 3.59/1.12 binary: 77
% 3.59/1.12 lits: 1229
% 3.59/1.12 lits_eq: 0
% 3.59/1.12 fd_pure: 0
% 3.59/1.12 fd_pseudo: 0
% 3.59/1.12 fd_cond: 0
% 3.59/1.12 fd_pseudo_cond: 0
% 3.59/1.12 ac_symbols: 0
% 3.59/1.12
% 3.59/1.12 ------ General
% 3.59/1.12
% 3.59/1.12 abstr_ref_over_cycles: 0
% 3.59/1.12 abstr_ref_under_cycles: 0
% 3.59/1.12 gc_basic_clause_elim: 0
% 3.59/1.12 num_of_symbols: 342
% 3.59/1.12 num_of_terms: 3055
% 3.59/1.12
% 3.59/1.12 parsing_time: 0.019
% 3.59/1.12 unif_index_cands_time: 0.
% 3.59/1.12 unif_index_add_time: 0.
% 3.59/1.12 orderings_time: 0.
% 3.59/1.12 out_proof_time: 0.
% 3.59/1.12 total_time: 0.49
% 3.59/1.12
% 3.59/1.12 ------ Preprocessing
% 3.59/1.12
% 3.59/1.12 num_of_splits: 79
% 3.59/1.12 num_of_split_atoms: 38
% 3.59/1.12 num_of_reused_defs: 41
% 3.59/1.12 num_eq_ax_congr_red: 0
% 3.59/1.12 num_of_sem_filtered_clauses: 0
% 3.59/1.12 num_of_subtypes: 0
% 3.59/1.12 monotx_restored_types: 0
% 3.59/1.12 sat_num_of_epr_types: 1
% 3.59/1.12 sat_num_of_non_cyclic_types: 1
% 3.59/1.12 sat_guarded_non_collapsed_types: 0
% 3.59/1.12 num_pure_diseq_elim: 0
% 3.59/1.12 simp_replaced_by: 0
% 3.59/1.12 res_preprocessed: 0
% 3.59/1.12 sup_preprocessed: 0
% 3.59/1.12 prep_upred: 0
% 3.59/1.12 prep_unflattend: 0
% 3.59/1.12 prep_well_definedness: 0
% 3.59/1.12 smt_new_axioms: 0
% 3.59/1.12 pred_elim_cands: 43
% 3.59/1.12 pred_elim: 19
% 3.59/1.12 pred_elim_cl: 88
% 3.59/1.12 pred_elim_cycles: 75
% 3.59/1.12 merged_defs: 0
% 3.59/1.12 merged_defs_ncl: 0
% 3.59/1.12 bin_hyper_res: 0
% 3.59/1.12 prep_cycles: 2
% 3.59/1.12
% 3.59/1.12 splitting_time: 0.005
% 3.59/1.12 sem_filter_time: 0.
% 3.59/1.12 monotx_time: 0.
% 3.59/1.12 subtype_inf_time: 0.
% 3.59/1.12 res_prep_time: 0.145
% 3.59/1.12 sup_prep_time: 0.
% 3.59/1.12 pred_elim_time: 0.185
% 3.59/1.12 bin_hyper_res_time: 0.
% 3.59/1.12 prep_time_total: 0.356
% 3.59/1.12
% 3.59/1.12 ------ Propositional Solver
% 3.59/1.12
% 3.59/1.12 prop_solver_calls: 53
% 3.59/1.12 prop_fast_solver_calls: 22931
% 3.59/1.12 smt_solver_calls: 0
% 3.59/1.12 smt_fast_solver_calls: 0
% 3.59/1.12 prop_num_of_clauses: 2054
% 3.59/1.12 prop_preprocess_simplified: 17089
% 3.59/1.12 prop_fo_subsumed: 339
% 3.59/1.12
% 3.59/1.12 prop_solver_time: 0.004
% 3.59/1.12 prop_fast_solver_time: 0.025
% 3.59/1.12 prop_unsat_core_time: 0.
% 3.59/1.12 smt_solver_time: 0.
% 3.59/1.12 smt_fast_solver_time: 0.
% 3.59/1.12
% 3.59/1.12 ------ QBF
% 3.59/1.12
% 3.59/1.12 qbf_q_res: 0
% 3.59/1.12 qbf_num_tautologies: 0
% 3.59/1.12 qbf_prep_cycles: 0
% 3.59/1.12
% 3.59/1.12 ------ BMC1
% 3.59/1.12
% 3.59/1.12 bmc1_current_bound: -1
% 3.59/1.12 bmc1_last_solved_bound: -1
% 3.59/1.12 bmc1_unsat_core_size: -1
% 3.59/1.12 bmc1_unsat_core_parents_size: -1
% 3.59/1.12 bmc1_merge_next_fun: 0
% 3.59/1.12
% 3.59/1.12 bmc1_unsat_core_clauses_time: 0.
% 3.59/1.12
% 3.59/1.12 ------ Instantiation
% 3.59/1.12
% 3.59/1.12 inst_num_of_clauses: 443
% 3.59/1.12 inst_num_in_passive: 0
% 3.59/1.12 inst_num_in_active: 804
% 3.59/1.12 inst_num_of_loops: 815
% 3.59/1.12 inst_num_in_unprocessed: 0
% 3.59/1.12 inst_num_of_learning_restarts: 3
% 3.59/1.12 inst_num_moves_active_passive: 2
% 3.59/1.12 inst_lit_activity: 0
% 3.59/1.12 inst_lit_activity_moves: 0
% 3.59/1.12 inst_num_tautologies: 0
% 3.59/1.12 inst_num_prop_implied: 0
% 3.59/1.12 inst_num_existing_simplified: 0
% 3.59/1.12 inst_num_eq_res_simplified: 0
% 3.59/1.12 inst_num_child_elim: 0
% 3.59/1.12 inst_num_of_dismatching_blockings: 0
% 3.59/1.12 inst_num_of_non_proper_insts: 96
% 3.59/1.12 inst_num_of_duplicates: 0
% 3.59/1.12 inst_inst_num_from_inst_to_res: 0
% 3.59/1.12
% 3.59/1.12 inst_time_sim_new: 0.039
% 3.59/1.12 inst_time_sim_given: 0.015
% 3.59/1.12 inst_time_dismatching_checking: 0.
% 3.59/1.12 inst_time_total: 0.07
% 3.59/1.12
% 3.59/1.12 ------ Resolution
% 3.59/1.12
% 3.59/1.12 res_num_of_clauses: 257
% 3.59/1.12 res_num_in_passive: 0
% 3.59/1.12 res_num_in_active: 0
% 3.59/1.12 res_num_of_loops: 604
% 3.59/1.12 res_forward_subset_subsumed: 155
% 3.59/1.12 res_backward_subset_subsumed: 0
% 3.59/1.12 res_forward_subsumed: 0
% 3.59/1.12 res_backward_subsumed: 0
% 3.59/1.12 res_forward_subsumption_resolution: 0
% 3.59/1.12 res_backward_subsumption_resolution: 2
% 3.59/1.12 res_clause_to_clause_subsumption: 914
% 3.59/1.12 res_subs_bck_cnt: 2
% 3.59/1.12 res_orphan_elimination: 0
% 3.59/1.12 res_tautology_del: 16
% 3.59/1.12 res_num_eq_res_simplified: 0
% 3.59/1.12 res_num_sel_changes: 0
% 3.59/1.12 res_moves_from_active_to_pass: 0
% 3.59/1.12
% 3.59/1.12 res_time_sim_new: 0.029
% 3.59/1.12 res_time_sim_fw_given: 0.094
% 3.59/1.12 res_time_sim_bw_given: 0.016
% 3.59/1.12 res_time_total: 0.03
% 3.59/1.13
% 3.59/1.13 ------ Superposition
% 3.59/1.13
% 3.59/1.13 sup_num_of_clauses: undef
% 3.59/1.13 sup_num_in_active: undef
% 3.59/1.13 sup_num_in_passive: undef
% 3.59/1.13 sup_num_of_loops: 0
% 3.59/1.13 sup_fw_superposition: 0
% 3.59/1.13 sup_bw_superposition: 0
% 3.59/1.13 sup_eq_factoring: 0
% 3.59/1.13 sup_eq_resolution: 0
% 3.59/1.13 sup_immediate_simplified: 0
% 3.59/1.13 sup_given_eliminated: 0
% 3.59/1.13 comparisons_done: 0
% 3.59/1.13 comparisons_avoided: 0
% 3.59/1.13 comparisons_inc_criteria: 0
% 3.59/1.13 sup_deep_cl_discarded: 0
% 3.59/1.13 sup_num_of_deepenings: 0
% 3.59/1.13 sup_num_of_restarts: 0
% 3.59/1.13
% 3.59/1.13 sup_time_generating: 0.
% 3.59/1.13 sup_time_sim_fw_full: 0.
% 3.59/1.13 sup_time_sim_bw_full: 0.
% 3.59/1.13 sup_time_sim_fw_immed: 0.
% 3.59/1.13 sup_time_sim_bw_immed: 0.
% 3.59/1.13 sup_time_prep_sim_fw_input: 0.
% 3.59/1.13 sup_time_prep_sim_bw_input: 0.
% 3.59/1.13 sup_time_total: 0.
% 3.59/1.13
% 3.59/1.13 ------ Simplifications
% 3.59/1.13
% 3.59/1.13 sim_repeated: 0
% 3.59/1.13 sim_fw_subset_subsumed: 0
% 3.59/1.13 sim_bw_subset_subsumed: 0
% 3.59/1.13 sim_fw_subsumed: 0
% 3.59/1.13 sim_bw_subsumed: 0
% 3.59/1.13 sim_fw_subsumption_res: 0
% 3.59/1.13 sim_bw_subsumption_res: 0
% 3.59/1.13 sim_fw_unit_subs: 0
% 3.59/1.13 sim_bw_unit_subs: 0
% 3.59/1.13 sim_tautology_del: 0
% 3.59/1.13 sim_eq_tautology_del: 0
% 3.59/1.13 sim_eq_res_simp: 0
% 3.59/1.13 sim_fw_demodulated: 0
% 3.59/1.13 sim_bw_demodulated: 0
% 3.59/1.13 sim_encompassment_demod: 0
% 3.59/1.13 sim_light_normalised: 0
% 3.59/1.13 sim_ac_normalised: 0
% 3.59/1.13 sim_joinable_taut: 0
% 3.59/1.13 sim_joinable_simp: 0
% 3.59/1.13 sim_fw_ac_demod: 0
% 3.59/1.13 sim_bw_ac_demod: 0
% 3.59/1.13 sim_smt_subsumption: 0
% 3.59/1.13 sim_smt_simplified: 0
% 3.59/1.13 sim_ground_joinable: 0
% 3.59/1.13 sim_bw_ground_joinable: 0
% 3.59/1.13 sim_connectedness: 0
% 3.59/1.13
% 3.59/1.13 sim_time_fw_subset_subs: 0.
% 3.59/1.13 sim_time_bw_subset_subs: 0.
% 3.59/1.13 sim_time_fw_subs: 0.
% 3.59/1.13 sim_time_bw_subs: 0.
% 3.59/1.13 sim_time_fw_subs_res: 0.
% 3.59/1.13 sim_time_bw_subs_res: 0.
% 3.59/1.13 sim_time_fw_unit_subs: 0.
% 3.59/1.13 sim_time_bw_unit_subs: 0.
% 3.59/1.13 sim_time_tautology_del: 0.
% 3.59/1.13 sim_time_eq_tautology_del: 0.
% 3.59/1.13 sim_time_eq_res_simp: 0.
% 3.59/1.13 sim_time_fw_demod: 0.
% 3.59/1.13 sim_time_bw_demod: 0.
% 3.59/1.13 sim_time_light_norm: 0.
% 3.59/1.13 sim_time_joinable: 0.
% 3.59/1.13 sim_time_ac_norm: 0.
% 3.59/1.13 sim_time_fw_ac_demod: 0.
% 3.59/1.13 sim_time_bw_ac_demod: 0.
% 3.59/1.13 sim_time_smt_subs: 0.
% 3.59/1.13 sim_time_fw_gjoin: 0.
% 3.59/1.13 sim_time_fw_connected: 0.
% 3.59/1.13
% 3.59/1.13
%------------------------------------------------------------------------------