TSTP Solution File: NLP148-1 by iProver-SAT---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver-SAT---3.8
% Problem : NLP148-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d SAT
% Computer : n005.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 : Thu Aug 31 09:58:15 EDT 2023
% Result : Satisfiable 0.41s 1.12s
% Output : Model 0.65s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
%------ Negative definition of equality_sorted
fof(lit_def,axiom,
! [X0_12,X0,X1] :
( ~ equality_sorted(X0_12,X0,X1)
<=> ( ( X0_12 = $i
& X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_2 )
| ( X0_12 = $i
& X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_3 )
| ( X0_12 = $i
& X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_4 )
| ( X0_12 = $i
& X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_5 )
| ( X0_12 = $i
& X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_6 )
| ( X0_12 = $i
& X0 = iProver_Domain_i_2
& X1 = iProver_Domain_i_1 )
| ( X0_12 = $i
& X0 = iProver_Domain_i_2
& X1 = iProver_Domain_i_3 )
| ( X0_12 = $i
& X0 = iProver_Domain_i_2
& X1 = iProver_Domain_i_4 )
| ( X0_12 = $i
& X0 = iProver_Domain_i_2
& X1 = iProver_Domain_i_5 )
| ( X0_12 = $i
& X0 = iProver_Domain_i_2
& X1 = iProver_Domain_i_6 )
| ( X0_12 = $i
& X0 = iProver_Domain_i_3
& X1 = iProver_Domain_i_1 )
| ( X0_12 = $i
& X0 = iProver_Domain_i_3
& X1 = iProver_Domain_i_2 )
| ( X0_12 = $i
& X0 = iProver_Domain_i_3
& X1 = iProver_Domain_i_4 )
| ( X0_12 = $i
& X0 = iProver_Domain_i_3
& X1 = iProver_Domain_i_5 )
| ( X0_12 = $i
& X0 = iProver_Domain_i_3
& X1 = iProver_Domain_i_6 )
| ( X0_12 = $i
& X0 = iProver_Domain_i_4
& X1 = iProver_Domain_i_1 )
| ( X0_12 = $i
& X0 = iProver_Domain_i_4
& X1 = iProver_Domain_i_2 )
| ( X0_12 = $i
& X0 = iProver_Domain_i_4
& X1 = iProver_Domain_i_3 )
| ( X0_12 = $i
& X0 = iProver_Domain_i_4
& X1 = iProver_Domain_i_5 )
| ( X0_12 = $i
& X0 = iProver_Domain_i_4
& X1 = iProver_Domain_i_6 )
| ( X0_12 = $i
& X0 = iProver_Domain_i_5
& X1 = iProver_Domain_i_1 )
| ( X0_12 = $i
& X0 = iProver_Domain_i_5
& X1 = iProver_Domain_i_2 )
| ( X0_12 = $i
& X0 = iProver_Domain_i_5
& X1 = iProver_Domain_i_3 )
| ( X0_12 = $i
& X0 = iProver_Domain_i_5
& X1 = iProver_Domain_i_4 )
| ( X0_12 = $i
& X0 = iProver_Domain_i_5
& X1 = iProver_Domain_i_6 )
| ( X0_12 = $i
& X0 = iProver_Domain_i_6
& X1 = iProver_Domain_i_1 )
| ( X0_12 = $i
& X0 = iProver_Domain_i_6
& X1 = iProver_Domain_i_2 )
| ( X0_12 = $i
& X0 = iProver_Domain_i_6
& X1 = iProver_Domain_i_3 )
| ( X0_12 = $i
& X0 = iProver_Domain_i_6
& X1 = iProver_Domain_i_4 )
| ( X0_12 = $i
& X0 = iProver_Domain_i_6
& X1 = iProver_Domain_i_5 ) ) ) ).
%------ Positive definition of member
fof(lit_def_001,axiom,
! [X0,X1,X2] :
( member(X0,X1,X2)
<=> ( ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_2
& X2 = iProver_Domain_i_1 )
| ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_5
& X2 = iProver_Domain_i_1 ) ) ) ).
%------ Positive definition of two
fof(lit_def_002,axiom,
! [X0,X1] :
( two(X0,X1)
<=> ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_1 ) ) ).
%------ Positive definition of placename
fof(lit_def_003,axiom,
! [X0,X1] :
( placename(X0,X1)
<=> ( X0 = iProver_Domain_i_1
& X1 != iProver_Domain_i_1
& X1 != iProver_Domain_i_2
& X1 != iProver_Domain_i_3
& X1 != iProver_Domain_i_4
& X1 != iProver_Domain_i_5 ) ) ).
%------ Positive definition of of
fof(lit_def_004,axiom,
! [X0,X1,X2] :
( of(X0,X1,X2)
<=> ( X0 = iProver_Domain_i_1
& X2 = iProver_Domain_i_3 ) ) ).
%------ Positive definition of sP0_iProver_split
fof(lit_def_005,axiom,
! [X0] :
( sP0_iProver_split(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of sP1_iProver_split
fof(lit_def_006,axiom,
! [X0,X1] :
( sP1_iProver_split(X0,X1)
<=> ( X0 = iProver_Domain_i_2
& X1 = iProver_Domain_i_2 ) ) ).
%------ Positive definition of iProver_Flat_skf10
fof(lit_def_007,axiom,
! [X0,X1,X2] :
( iProver_Flat_skf10(X0,X1,X2)
<=> ( ( X0 = iProver_Domain_i_2
& ( X1 != iProver_Domain_i_1
| X2 != iProver_Domain_i_1 ) )
| ( X0 = iProver_Domain_i_5
& X1 = iProver_Domain_i_1
& X2 = iProver_Domain_i_1 ) ) ) ).
%------ Negative definition of iProver_Flat_skf8
fof(lit_def_008,axiom,
! [X0,X1,X2] :
( ~ iProver_Flat_skf8(X0,X1,X2)
<=> ( X1 = iProver_Domain_i_1
& X2 = iProver_Domain_i_1
& X0 != iProver_Domain_i_2 ) ) ).
%------ Positive definition of iProver_Flat_skf11
fof(lit_def_009,axiom,
! [X0,X1,X2,X3,X4] :
( iProver_Flat_skf11(X0,X1,X2,X3,X4)
<=> ( ( X0 = iProver_Domain_i_1
& X1 != iProver_Domain_i_1
& ( X1 != iProver_Domain_i_5
| X2 != iProver_Domain_i_2
| X3 != iProver_Domain_i_1
| X4 != iProver_Domain_i_1 )
& X2 != iProver_Domain_i_1
& ( X2 != iProver_Domain_i_5
| X3 != iProver_Domain_i_1
| X4 != iProver_Domain_i_1 ) )
| ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_1 )
| ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_5
& X2 = iProver_Domain_i_2
& X3 = iProver_Domain_i_1
& X4 = iProver_Domain_i_1 )
| ( X0 = iProver_Domain_i_1
& X2 = iProver_Domain_i_1 )
| ( X0 = iProver_Domain_i_1
& X2 = iProver_Domain_i_5
& X3 = iProver_Domain_i_1
& X4 = iProver_Domain_i_1 ) ) ) ).
%------ Positive definition of iProver_Flat_skc6
fof(lit_def_010,axiom,
! [X0] :
( iProver_Flat_skc6(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_skc14
fof(lit_def_011,axiom,
! [X0] :
( iProver_Flat_skc14(X0)
<=> X0 = iProver_Domain_i_6 ) ).
%------ Positive definition of iProver_Flat_skc12
fof(lit_def_012,axiom,
! [X0] :
( iProver_Flat_skc12(X0)
<=> X0 = iProver_Domain_i_3 ) ).
%------ Positive definition of iProver_Flat_skc7
fof(lit_def_013,axiom,
! [X0] :
( iProver_Flat_skc7(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_skc11
fof(lit_def_014,axiom,
! [X0] :
( iProver_Flat_skc11(X0)
<=> X0 = iProver_Domain_i_4 ) ).
%------ Positive definition of iProver_Flat_skc13
fof(lit_def_015,axiom,
! [X0] :
( iProver_Flat_skc13(X0)
<=> X0 = iProver_Domain_i_3 ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.13 % Problem : NLP148-1 : TPTP v8.1.2. Released v2.4.0.
% 0.09/0.14 % Command : run_iprover %s %d SAT
% 0.10/0.34 % Computer : n005.cluster.edu
% 0.10/0.34 % Model : x86_64 x86_64
% 0.10/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.34 % Memory : 8042.1875MB
% 0.10/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.34 % CPULimit : 300
% 0.10/0.34 % WCLimit : 300
% 0.10/0.34 % DateTime : Thu Aug 24 11:42:08 EDT 2023
% 0.10/0.34 % CPUTime :
% 0.16/0.45 Running model finding
% 0.16/0.45 Running: /export/starexec/sandbox2/solver/bin/run_problem --no_cores 8 --heuristic_context fnt --schedule fnt_schedule /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.41/1.12 % SZS status Started for theBenchmark.p
% 0.41/1.12 % SZS status Satisfiable for theBenchmark.p
% 0.41/1.12
% 0.41/1.12 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.41/1.12
% 0.41/1.12 ------ iProver source info
% 0.41/1.12
% 0.41/1.12 git: date: 2023-05-31 18:12:56 +0000
% 0.41/1.12 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.41/1.12 git: non_committed_changes: false
% 0.41/1.12 git: last_make_outside_of_git: false
% 0.41/1.12
% 0.41/1.12 ------ Parsing...successful
% 0.41/1.12
% 0.41/1.12
% 0.41/1.12
% 0.41/1.12 ------ Preprocessing... sup_sim: 0 pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe:16:0s pe:32:0s pe_e sup_sim: 0 pe_s pe_e
% 0.41/1.12
% 0.41/1.12 ------ Preprocessing... scvd_s sp: 2 0s scvd_e snvd_s sp: 0 0s snvd_e
% 0.41/1.12
% 0.41/1.12 ------ Preprocessing...
% 0.41/1.12 ------ Proving...
% 0.41/1.12 ------ Problem Properties
% 0.41/1.12
% 0.41/1.12
% 0.41/1.12 clauses 34
% 0.41/1.12 conjectures 5
% 0.41/1.12 EPR 27
% 0.41/1.12 Horn 30
% 0.41/1.12 unary 19
% 0.41/1.12 binary 7
% 0.41/1.12 lits 70
% 0.41/1.12 lits eq 16
% 0.41/1.12 fd_pure 0
% 0.41/1.12 fd_pseudo 0
% 0.41/1.12 fd_cond 0
% 0.41/1.12 fd_pseudo_cond 7
% 0.41/1.12 AC symbols 0
% 0.41/1.12
% 0.41/1.12 ------ Input Options Time Limit: Unbounded
% 0.41/1.12
% 0.41/1.12
% 0.41/1.12 ------ Finite Models:
% 0.41/1.12
% 0.41/1.12 ------ lit_activity_flag true
% 0.41/1.12
% 0.41/1.12
% 0.41/1.12 ------ Trying domains of size >= : 1
% 0.41/1.12
% 0.41/1.12 ------ Trying domains of size >= : 2
% 0.41/1.12
% 0.41/1.12 ------ Trying domains of size >= : 2
% 0.41/1.12 ------
% 0.41/1.12 Current options:
% 0.41/1.12 ------
% 0.41/1.12
% 0.41/1.12 ------ Input Options
% 0.41/1.12
% 0.41/1.12 --out_options all
% 0.41/1.12 --tptp_safe_out true
% 0.41/1.12 --problem_path ""
% 0.41/1.12 --include_path ""
% 0.41/1.12 --clausifier res/vclausify_rel
% 0.41/1.12 --clausifier_options --mode clausify -t 300.00
% 0.41/1.12 --stdin false
% 0.41/1.12 --proof_out true
% 0.41/1.12 --proof_dot_file ""
% 0.41/1.12 --proof_reduce_dot []
% 0.41/1.12 --suppress_sat_res false
% 0.41/1.12 --suppress_unsat_res true
% 0.41/1.12 --stats_out all
% 0.41/1.12 --stats_mem false
% 0.41/1.12 --theory_stats_out false
% 0.41/1.12
% 0.41/1.12 ------ General Options
% 0.41/1.12
% 0.41/1.12 --fof false
% 0.41/1.12 --time_out_real 300.
% 0.41/1.12 --time_out_virtual -1.
% 0.41/1.12 --rnd_seed 13
% 0.41/1.12 --symbol_type_check false
% 0.41/1.12 --clausify_out false
% 0.41/1.12 --sig_cnt_out false
% 0.41/1.12 --trig_cnt_out false
% 0.41/1.12 --trig_cnt_out_tolerance 1.
% 0.41/1.12 --trig_cnt_out_sk_spl false
% 0.41/1.12 --abstr_cl_out false
% 0.41/1.12
% 0.41/1.12 ------ Interactive Mode
% 0.41/1.12
% 0.41/1.12 --interactive_mode false
% 0.41/1.12 --external_ip_address ""
% 0.41/1.12 --external_port 0
% 0.41/1.12
% 0.41/1.12 ------ Global Options
% 0.41/1.12
% 0.41/1.12 --schedule none
% 0.41/1.12 --add_important_lit false
% 0.41/1.12 --prop_solver_per_cl 500
% 0.41/1.12 --subs_bck_mult 8
% 0.41/1.12 --min_unsat_core false
% 0.41/1.12 --soft_assumptions false
% 0.41/1.12 --soft_lemma_size 3
% 0.41/1.12 --prop_impl_unit_size 0
% 0.41/1.12 --prop_impl_unit []
% 0.41/1.12 --share_sel_clauses true
% 0.41/1.12 --reset_solvers false
% 0.41/1.12 --bc_imp_inh [conj_cone]
% 0.41/1.12 --conj_cone_tolerance 3.
% 0.41/1.12 --extra_neg_conj all_pos_neg
% 0.41/1.12 --large_theory_mode true
% 0.41/1.12 --prolific_symb_bound 500
% 0.41/1.12 --lt_threshold 2000
% 0.41/1.12 --clause_weak_htbl true
% 0.41/1.12 --gc_record_bc_elim false
% 0.41/1.12
% 0.41/1.12 ------ Preprocessing Options
% 0.41/1.12
% 0.41/1.12 --preprocessing_flag true
% 0.41/1.12 --time_out_prep_mult 0.2
% 0.41/1.12 --splitting_mode input
% 0.41/1.12 --splitting_grd false
% 0.41/1.12 --splitting_cvd true
% 0.41/1.12 --splitting_cvd_svl true
% 0.41/1.12 --splitting_nvd 256
% 0.41/1.12 --sub_typing false
% 0.41/1.12 --prep_gs_sim false
% 0.41/1.12 --prep_unflatten true
% 0.41/1.12 --prep_res_sim true
% 0.41/1.12 --prep_sup_sim_all true
% 0.41/1.12 --prep_sup_sim_sup false
% 0.41/1.12 --prep_upred true
% 0.41/1.12 --prep_well_definedness true
% 0.41/1.12 --prep_sem_filter none
% 0.41/1.12 --prep_sem_filter_out false
% 0.41/1.12 --pred_elim true
% 0.41/1.12 --res_sim_input false
% 0.41/1.12 --eq_ax_congr_red true
% 0.41/1.12 --pure_diseq_elim false
% 0.41/1.12 --brand_transform false
% 0.41/1.12 --non_eq_to_eq false
% 0.41/1.12 --prep_def_merge false
% 0.41/1.12 --prep_def_merge_prop_impl false
% 0.41/1.12 --prep_def_merge_mbd true
% 0.41/1.12 --prep_def_merge_tr_red false
% 0.41/1.12 --prep_def_merge_tr_cl false
% 0.41/1.12 --smt_preprocessing false
% 0.41/1.12 --smt_ac_axioms fast
% 0.41/1.12 --preprocessed_out false
% 0.41/1.12 --preprocessed_stats false
% 0.41/1.12
% 0.41/1.12 ------ Abstraction refinement Options
% 0.41/1.12
% 0.41/1.12 --abstr_ref []
% 0.41/1.12 --abstr_ref_prep false
% 0.41/1.12 --abstr_ref_until_sat false
% 0.41/1.12 --abstr_ref_sig_restrict funpre
% 0.41/1.12 --abstr_ref_af_restrict_to_split_sk false
% 0.41/1.12 --abstr_ref_under []
% 0.41/1.12
% 0.41/1.12 ------ SAT Options
% 0.41/1.12
% 0.41/1.12 --sat_mode true
% 0.41/1.12 --sat_fm_restart_options ""
% 0.41/1.12 --sat_gr_def false
% 0.41/1.12 --sat_epr_types false
% 0.41/1.12 --sat_non_cyclic_types true
% 0.41/1.12 --sat_finite_models true
% 0.41/1.12 --sat_fm_lemmas false
% 0.41/1.12 --sat_fm_prep false
% 0.41/1.12 --sat_fm_uc_incr true
% 0.41/1.12 --sat_out_model small
% 0.41/1.12 --sat_out_clauses false
% 0.41/1.12
% 0.41/1.12 ------ QBF Options
% 0.41/1.12
% 0.41/1.12 --qbf_mode false
% 0.41/1.12 --qbf_elim_univ false
% 0.41/1.12 --qbf_dom_inst none
% 0.41/1.12 --qbf_dom_pre_inst false
% 0.41/1.12 --qbf_sk_in false
% 0.41/1.12 --qbf_pred_elim true
% 0.41/1.12 --qbf_split 512
% 0.41/1.12
% 0.41/1.12 ------ BMC1 Options
% 0.41/1.12
% 0.41/1.12 --bmc1_incremental false
% 0.41/1.12 --bmc1_axioms reachable_all
% 0.41/1.12 --bmc1_min_bound 0
% 0.41/1.12 --bmc1_max_bound -1
% 0.41/1.12 --bmc1_max_bound_default -1
% 0.41/1.12 --bmc1_symbol_reachability false
% 0.41/1.12 --bmc1_property_lemmas false
% 0.41/1.12 --bmc1_k_induction false
% 0.41/1.12 --bmc1_non_equiv_states false
% 0.41/1.12 --bmc1_deadlock false
% 0.41/1.12 --bmc1_ucm false
% 0.41/1.12 --bmc1_add_unsat_core none
% 0.41/1.12 --bmc1_unsat_core_children false
% 0.41/1.12 --bmc1_unsat_core_extrapolate_axioms false
% 0.41/1.12 --bmc1_out_stat full
% 0.41/1.12 --bmc1_ground_init false
% 0.41/1.12 --bmc1_pre_inst_next_state false
% 0.41/1.12 --bmc1_pre_inst_state false
% 0.41/1.12 --bmc1_pre_inst_reach_state false
% 0.41/1.12 --bmc1_out_unsat_core false
% 0.41/1.12 --bmc1_aig_witness_out false
% 0.41/1.12 --bmc1_verbose false
% 0.41/1.12 --bmc1_dump_clauses_tptp false
% 0.41/1.12 --bmc1_dump_unsat_core_tptp false
% 0.41/1.12 --bmc1_dump_file -
% 0.41/1.12 --bmc1_ucm_expand_uc_limit 128
% 0.41/1.12 --bmc1_ucm_n_expand_iterations 6
% 0.41/1.12 --bmc1_ucm_extend_mode 1
% 0.41/1.12 --bmc1_ucm_init_mode 2
% 0.41/1.12 --bmc1_ucm_cone_mode none
% 0.41/1.12 --bmc1_ucm_reduced_relation_type 0
% 0.41/1.12 --bmc1_ucm_relax_model 4
% 0.41/1.12 --bmc1_ucm_full_tr_after_sat true
% 0.41/1.12 --bmc1_ucm_expand_neg_assumptions false
% 0.41/1.12 --bmc1_ucm_layered_model none
% 0.41/1.12 --bmc1_ucm_max_lemma_size 10
% 0.41/1.12
% 0.41/1.12 ------ AIG Options
% 0.41/1.12
% 0.41/1.12 --aig_mode false
% 0.41/1.12
% 0.41/1.12 ------ Instantiation Options
% 0.41/1.12
% 0.41/1.12 --instantiation_flag true
% 0.41/1.12 --inst_sos_flag false
% 0.41/1.12 --inst_sos_phase true
% 0.41/1.12 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb]
% 0.41/1.12 --inst_lit_sel [-sign;+num_symb;+non_prol_conj_symb]
% 0.41/1.12 --inst_lit_sel_side num_lit
% 0.41/1.12 --inst_solver_per_active 1400
% 0.41/1.12 --inst_solver_calls_frac 0.01
% 0.41/1.12 --inst_to_smt_solver true
% 0.41/1.12 --inst_passive_queue_type priority_queues
% 0.41/1.12 --inst_passive_queues [[+conj_dist;+num_lits;-age];[-conj_symb;-min_def_symb;+bc_imp_inh]]
% 0.41/1.12 --inst_passive_queues_freq [512;64]
% 0.41/1.12 --inst_dismatching true
% 0.41/1.12 --inst_eager_unprocessed_to_passive false
% 0.41/1.12 --inst_unprocessed_bound 1000
% 0.41/1.12 --inst_prop_sim_given true
% 0.41/1.12 --inst_prop_sim_new true
% 0.41/1.12 --inst_subs_new false
% 0.41/1.12 --inst_eq_res_simp false
% 0.41/1.12 --inst_subs_given true
% 0.41/1.12 --inst_orphan_elimination false
% 0.41/1.12 --inst_learning_loop_flag true
% 0.41/1.12 --inst_learning_start 5
% 0.41/1.12 --inst_learning_factor 8
% 0.41/1.12 --inst_start_prop_sim_after_learn 0
% 0.41/1.12 --inst_sel_renew solver
% 0.41/1.12 --inst_lit_activity_flag true
% 0.41/1.12 --inst_restr_to_given false
% 0.41/1.12 --inst_activity_threshold 10000
% 0.41/1.12
% 0.41/1.12 ------ Resolution Options
% 0.41/1.12
% 0.41/1.12 --resolution_flag false
% 0.41/1.12 --res_lit_sel neg_max
% 0.41/1.12 --res_lit_sel_side num_lit
% 0.41/1.12 --res_ordering kbo
% 0.41/1.12 --res_to_prop_solver passive
% 0.41/1.12 --res_prop_simpl_new true
% 0.41/1.12 --res_prop_simpl_given true
% 0.41/1.12 --res_to_smt_solver true
% 0.41/1.12 --res_passive_queue_type priority_queues
% 0.41/1.12 --res_passive_queues [[-has_eq;-conj_non_prolific_symb;+ground];[-bc_imp_inh;-conj_symb]]
% 0.41/1.12 --res_passive_queues_freq [1024;32]
% 0.41/1.12 --res_forward_subs subset_subsumption
% 0.41/1.12 --res_backward_subs subset_subsumption
% 0.41/1.12 --res_forward_subs_resolution true
% 0.41/1.12 --res_backward_subs_resolution false
% 0.41/1.12 --res_orphan_elimination false
% 0.41/1.12 --res_time_limit 10.
% 0.41/1.12
% 0.41/1.12 ------ Superposition Options
% 0.41/1.12
% 0.41/1.12 --superposition_flag false
% 0.41/1.12 --sup_passive_queue_type priority_queues
% 0.41/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]]
% 0.41/1.12 --sup_passive_queues_freq [8;1;4;4]
% 0.41/1.12 --demod_completeness_check fast
% 0.41/1.12 --demod_use_ground true
% 0.41/1.12 --sup_unprocessed_bound 0
% 0.41/1.12 --sup_to_prop_solver passive
% 0.41/1.12 --sup_prop_simpl_new true
% 0.41/1.12 --sup_prop_simpl_given true
% 0.41/1.12 --sup_fun_splitting false
% 0.41/1.12 --sup_iter_deepening 2
% 0.41/1.12 --sup_restarts_mult 12
% 0.41/1.12 --sup_score sim_d_gen
% 0.41/1.12 --sup_share_score_frac 0.2
% 0.41/1.12 --sup_share_max_num_cl 500
% 0.41/1.12 --sup_ordering kbo
% 0.41/1.12 --sup_symb_ordering invfreq
% 0.41/1.12 --sup_term_weight default
% 0.41/1.12
% 0.41/1.12 ------ Superposition Simplification Setup
% 0.41/1.12
% 0.41/1.12 --sup_indices_passive [LightNormIndex;FwDemodIndex]
% 0.41/1.12 --sup_full_triv [SMTSimplify;PropSubs]
% 0.41/1.12 --sup_full_fw [ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 0.41/1.12 --sup_full_bw [BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 0.41/1.12 --sup_immed_triv []
% 0.41/1.12 --sup_immed_fw_main [ACNormalisation;FwLightNorm;FwUnitSubsAndRes]
% 0.41/1.12 --sup_immed_fw_immed [ACNormalisation;FwUnitSubsAndRes]
% 0.41/1.12 --sup_immed_bw_main [BwUnitSubsAndRes;BwDemod]
% 0.41/1.12 --sup_immed_bw_immed [BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 0.41/1.12 --sup_input_triv [Unflattening;SMTSimplify]
% 0.41/1.12 --sup_input_fw [FwACDemod;ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 0.41/1.12 --sup_input_bw [BwACDemod;BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 0.41/1.12 --sup_full_fixpoint true
% 0.41/1.12 --sup_main_fixpoint true
% 0.41/1.12 --sup_immed_fixpoint false
% 0.41/1.12 --sup_input_fixpoint true
% 0.41/1.12 --sup_cache_sim none
% 0.41/1.12 --sup_smt_interval 500
% 0.41/1.12 --sup_bw_gjoin_interval 0
% 0.41/1.12
% 0.41/1.12 ------ Combination Options
% 0.41/1.12
% 0.41/1.12 --comb_mode clause_based
% 0.41/1.12 --comb_inst_mult 1000
% 0.41/1.12 --comb_res_mult 10
% 0.41/1.12 --comb_sup_mult 8
% 0.41/1.12 --comb_sup_deep_mult 2
% 0.41/1.12
% 0.41/1.12 ------ Debug Options
% 0.41/1.12
% 0.41/1.12 --dbg_backtrace false
% 0.41/1.12 --dbg_dump_prop_clauses false
% 0.41/1.12 --dbg_dump_prop_clauses_file -
% 0.41/1.12 --dbg_out_stat false
% 0.41/1.12 --dbg_just_parse false
% 0.41/1.12
% 0.41/1.12
% 0.41/1.12
% 0.41/1.12
% 0.41/1.12 ------ Proving...
% 0.41/1.12
% 0.41/1.12 ------ Trying domains of size >= : 2
% 0.41/1.12
% 0.41/1.12 ------ Trying domains of size >= : 2
% 0.41/1.12
% 0.41/1.12 ------ Trying domains of size >= : 2
% 0.41/1.12
% 0.41/1.12 ------ Trying domains of size >= : 3
% 0.41/1.12
% 0.41/1.12
% 0.41/1.12 ------ Proving...
% 0.41/1.12
% 0.41/1.12 ------ Trying domains of size >= : 3
% 0.41/1.12
% 0.41/1.12
% 0.41/1.12 ------ Proving...
% 0.41/1.12
% 0.41/1.12 ------ Trying domains of size >= : 4
% 0.41/1.12
% 0.41/1.12
% 0.41/1.12 ------ Proving...
% 0.41/1.12
% 0.41/1.12 ------ Trying domains of size >= : 4
% 0.41/1.12
% 0.41/1.12
% 0.41/1.12 ------ Proving...
% 0.41/1.12
% 0.41/1.12 ------ Trying domains of size >= : 4
% 0.41/1.12
% 0.41/1.12
% 0.41/1.12 ------ Proving...
% 0.41/1.12
% 0.41/1.12 ------ Trying domains of size >= : 5
% 0.41/1.12
% 0.41/1.12
% 0.41/1.12 ------ Proving...
% 0.41/1.12
% 0.41/1.12 ------ Trying domains of size >= : 5
% 0.41/1.12
% 0.41/1.12
% 0.41/1.12 ------ Proving...
% 0.41/1.12
% 0.41/1.12 ------ Trying domains of size >= : 6
% 0.41/1.12
% 0.41/1.12
% 0.41/1.12 ------ Proving...
% 0.41/1.12
% 0.41/1.12
% 0.41/1.12 % SZS status Satisfiable for theBenchmark.p
% 0.41/1.12
% 0.41/1.12 ------ Building Model...Done
% 0.41/1.12
% 0.41/1.12 %------ The model is defined over ground terms (initial term algebra).
% 0.41/1.12 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 0.41/1.12 %------ where \phi is a formula over the term algebra.
% 0.41/1.12 %------ If we have equality in the problem then it is also defined as a predicate above,
% 0.41/1.12 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 0.41/1.12 %------ See help for --sat_out_model for different model outputs.
% 0.41/1.12 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 0.41/1.12 %------ where the first argument stands for the sort ($i in the unsorted case)
% 0.41/1.12 % SZS output start Model for theBenchmark.p
% See solution above
% 0.65/1.13 ------ Statistics
% 0.65/1.13
% 0.65/1.13 ------ Problem properties
% 0.65/1.13
% 0.65/1.13 clauses: 34
% 0.65/1.13 conjectures: 5
% 0.65/1.13 epr: 27
% 0.65/1.13 horn: 30
% 0.65/1.13 ground: 18
% 0.65/1.13 unary: 19
% 0.65/1.13 binary: 7
% 0.65/1.13 lits: 70
% 0.65/1.13 lits_eq: 16
% 0.65/1.13 fd_pure: 0
% 0.65/1.13 fd_pseudo: 0
% 0.65/1.13 fd_cond: 0
% 0.65/1.13 fd_pseudo_cond: 7
% 0.65/1.13 ac_symbols: 0
% 0.65/1.13
% 0.65/1.13 ------ General
% 0.65/1.13
% 0.65/1.13 abstr_ref_over_cycles: 0
% 0.65/1.13 abstr_ref_under_cycles: 0
% 0.65/1.13 gc_basic_clause_elim: 0
% 0.65/1.13 num_of_symbols: 215
% 0.65/1.13 num_of_terms: 2210
% 0.65/1.13
% 0.65/1.13 parsing_time: 0.002
% 0.65/1.13 unif_index_cands_time: 0.004
% 0.65/1.13 unif_index_add_time: 0.002
% 0.65/1.13 orderings_time: 0.
% 0.65/1.13 out_proof_time: 0.
% 0.65/1.13 total_time: 0.245
% 0.65/1.13
% 0.65/1.13 ------ Preprocessing
% 0.65/1.13
% 0.65/1.13 num_of_splits: 2
% 0.65/1.13 num_of_split_atoms: 2
% 0.65/1.13 num_of_reused_defs: 0
% 0.65/1.13 num_eq_ax_congr_red: 11
% 0.65/1.13 num_of_sem_filtered_clauses: 0
% 0.65/1.13 num_of_subtypes: 0
% 0.65/1.13 monotx_restored_types: 0
% 0.65/1.13 sat_num_of_epr_types: 0
% 0.65/1.13 sat_num_of_non_cyclic_types: 0
% 0.65/1.13 sat_guarded_non_collapsed_types: 0
% 0.65/1.13 num_pure_diseq_elim: 0
% 0.65/1.13 simp_replaced_by: 0
% 0.65/1.13 res_preprocessed: 0
% 0.65/1.13 sup_preprocessed: 0
% 0.65/1.13 prep_upred: 0
% 0.65/1.13 prep_unflattend: 272
% 0.65/1.13 prep_well_definedness: 0
% 0.65/1.13 smt_new_axioms: 0
% 0.65/1.13 pred_elim_cands: 4
% 0.65/1.13 pred_elim: 55
% 0.65/1.13 pred_elim_cl: 59
% 0.65/1.13 pred_elim_cycles: 57
% 0.65/1.13 merged_defs: 0
% 0.65/1.13 merged_defs_ncl: 0
% 0.65/1.13 bin_hyper_res: 0
% 0.65/1.13 prep_cycles: 3
% 0.65/1.13
% 0.65/1.13 splitting_time: 0.
% 0.65/1.13 sem_filter_time: 0.
% 0.65/1.13 monotx_time: 0.
% 0.65/1.13 subtype_inf_time: 0.
% 0.65/1.13 res_prep_time: 0.011
% 0.65/1.13 sup_prep_time: 0.005
% 0.65/1.13 pred_elim_time: 0.026
% 0.65/1.13 bin_hyper_res_time: 0.
% 0.65/1.13 prep_time_total: 0.048
% 0.65/1.13
% 0.65/1.13 ------ Propositional Solver
% 0.65/1.13
% 0.65/1.13 prop_solver_calls: 246
% 0.65/1.13 prop_fast_solver_calls: 1074
% 0.65/1.13 smt_solver_calls: 0
% 0.65/1.13 smt_fast_solver_calls: 0
% 0.65/1.13 prop_num_of_clauses: 974
% 0.65/1.13 prop_preprocess_simplified: 14282
% 0.65/1.13 prop_fo_subsumed: 0
% 0.65/1.13
% 0.65/1.13 prop_solver_time: 0.015
% 0.65/1.13 prop_fast_solver_time: 0.001
% 0.65/1.13 prop_unsat_core_time: 0.001
% 0.65/1.13 smt_solver_time: 0.
% 0.65/1.13 smt_fast_solver_time: 0.
% 0.65/1.13
% 0.65/1.13 ------ QBF
% 0.65/1.13
% 0.65/1.13 qbf_q_res: 0
% 0.65/1.13 qbf_num_tautologies: 0
% 0.65/1.13 qbf_prep_cycles: 0
% 0.65/1.13
% 0.65/1.13 ------ BMC1
% 0.65/1.13
% 0.65/1.13 bmc1_current_bound: -1
% 0.65/1.13 bmc1_last_solved_bound: -1
% 0.65/1.13 bmc1_unsat_core_size: -1
% 0.65/1.13 bmc1_unsat_core_parents_size: -1
% 0.65/1.13 bmc1_merge_next_fun: 0
% 0.65/1.13
% 0.65/1.13 bmc1_unsat_core_clauses_time: 0.
% 0.65/1.13
% 0.65/1.13 ------ Instantiation
% 0.65/1.13
% 0.65/1.13 inst_num_of_clauses: 193
% 0.65/1.13 inst_num_in_passive: 0
% 0.65/1.13 inst_num_in_active: 1444
% 0.65/1.13 inst_num_of_loops: 1586
% 0.65/1.13 inst_num_in_unprocessed: 0
% 0.65/1.13 inst_num_of_learning_restarts: 16
% 0.65/1.13 inst_num_moves_active_passive: 56
% 0.65/1.13 inst_lit_activity: 0
% 0.65/1.13 inst_lit_activity_moves: 0
% 0.65/1.13 inst_num_tautologies: 0
% 0.65/1.13 inst_num_prop_implied: 0
% 0.65/1.13 inst_num_existing_simplified: 0
% 0.65/1.13 inst_num_eq_res_simplified: 0
% 0.65/1.13 inst_num_child_elim: 0
% 0.65/1.13 inst_num_of_dismatching_blockings: 34
% 0.65/1.13 inst_num_of_non_proper_insts: 784
% 0.65/1.13 inst_num_of_duplicates: 0
% 0.65/1.13 inst_inst_num_from_inst_to_res: 0
% 0.65/1.13
% 0.65/1.13 inst_time_sim_new: 0.05
% 0.65/1.13 inst_time_sim_given: 0.029
% 0.65/1.13 inst_time_dismatching_checking: 0.001
% 0.65/1.13 inst_time_total: 0.145
% 0.65/1.13
% 0.65/1.13 ------ Resolution
% 0.65/1.13
% 0.65/1.13 res_num_of_clauses: 41
% 0.65/1.13 res_num_in_passive: 0
% 0.65/1.13 res_num_in_active: 0
% 0.65/1.13 res_num_of_loops: 167
% 0.65/1.13 res_forward_subset_subsumed: 80
% 0.65/1.13 res_backward_subset_subsumed: 0
% 0.65/1.13 res_forward_subsumed: 66
% 0.65/1.13 res_backward_subsumed: 0
% 0.65/1.13 res_forward_subsumption_resolution: 0
% 0.65/1.13 res_backward_subsumption_resolution: 0
% 0.65/1.13 res_clause_to_clause_subsumption: 2796
% 0.65/1.13 res_subs_bck_cnt: 4
% 0.65/1.13 res_orphan_elimination: 0
% 0.65/1.13 res_tautology_del: 37
% 0.65/1.13 res_num_eq_res_simplified: 5
% 0.65/1.13 res_num_sel_changes: 0
% 0.65/1.13 res_moves_from_active_to_pass: 0
% 0.65/1.13
% 0.65/1.13 res_time_sim_new: 0.002
% 0.65/1.13 res_time_sim_fw_given: 0.005
% 0.65/1.13 res_time_sim_bw_given: 0.001
% 0.65/1.13 res_time_total: 0.002
% 0.65/1.13
% 0.65/1.13 ------ Superposition
% 0.65/1.13
% 0.65/1.13 sup_num_of_clauses: undef
% 0.65/1.13 sup_num_in_active: undef
% 0.65/1.13 sup_num_in_passive: undef
% 0.65/1.13 sup_num_of_loops: 0
% 0.65/1.13 sup_fw_superposition: 0
% 0.65/1.13 sup_bw_superposition: 0
% 0.65/1.13 sup_eq_factoring: 0
% 0.65/1.13 sup_eq_resolution: 0
% 0.65/1.13 sup_immediate_simplified: 0
% 0.65/1.13 sup_given_eliminated: 0
% 0.65/1.13 comparisons_done: 44
% 0.65/1.13 comparisons_avoided: 0
% 0.65/1.13 comparisons_inc_criteria: 0
% 0.65/1.13 sup_deep_cl_discarded: 0
% 0.65/1.13 sup_num_of_deepenings: 0
% 0.65/1.13 sup_num_of_restarts: 0
% 0.65/1.13
% 0.65/1.13 sup_time_generating: 0.
% 0.65/1.13 sup_time_sim_fw_full: 0.
% 0.65/1.13 sup_time_sim_bw_full: 0.
% 0.65/1.13 sup_time_sim_fw_immed: 0.
% 0.65/1.13 sup_time_sim_bw_immed: 0.
% 0.65/1.13 sup_time_prep_sim_fw_input: 0.002
% 0.65/1.13 sup_time_prep_sim_bw_input: 0.002
% 0.65/1.13 sup_time_total: 0.
% 0.65/1.13
% 0.65/1.13 ------ Simplifications
% 0.65/1.13
% 0.65/1.13 sim_repeated: 0
% 0.65/1.13 sim_fw_subset_subsumed: 0
% 0.65/1.13 sim_bw_subset_subsumed: 0
% 0.65/1.13 sim_fw_subsumed: 0
% 0.65/1.13 sim_bw_subsumed: 0
% 0.65/1.13 sim_fw_subsumption_res: 0
% 0.65/1.13 sim_bw_subsumption_res: 0
% 0.65/1.13 sim_fw_unit_subs: 0
% 0.65/1.13 sim_bw_unit_subs: 0
% 0.65/1.13 sim_tautology_del: 0
% 0.65/1.13 sim_eq_tautology_del: 0
% 0.65/1.13 sim_eq_res_simp: 0
% 0.65/1.13 sim_fw_demodulated: 0
% 0.65/1.13 sim_bw_demodulated: 0
% 0.65/1.13 sim_encompassment_demod: 0
% 0.65/1.13 sim_light_normalised: 0
% 0.65/1.13 sim_ac_normalised: 0
% 0.65/1.13 sim_joinable_taut: 0
% 0.65/1.13 sim_joinable_simp: 0
% 0.65/1.13 sim_fw_ac_demod: 0
% 0.65/1.13 sim_bw_ac_demod: 0
% 0.65/1.13 sim_smt_subsumption: 0
% 0.65/1.13 sim_smt_simplified: 0
% 0.65/1.13 sim_ground_joinable: 0
% 0.65/1.13 sim_bw_ground_joinable: 0
% 0.65/1.13 sim_connectedness: 0
% 0.65/1.13
% 0.65/1.13 sim_time_fw_subset_subs: 0.
% 0.65/1.13 sim_time_bw_subset_subs: 0.
% 0.65/1.13 sim_time_fw_subs: 0.
% 0.65/1.13 sim_time_bw_subs: 0.
% 0.65/1.13 sim_time_fw_subs_res: 0.001
% 0.65/1.13 sim_time_bw_subs_res: 0.
% 0.65/1.13 sim_time_fw_unit_subs: 0.
% 0.65/1.13 sim_time_bw_unit_subs: 0.
% 0.65/1.13 sim_time_tautology_del: 0.
% 0.65/1.13 sim_time_eq_tautology_del: 0.
% 0.65/1.13 sim_time_eq_res_simp: 0.
% 0.65/1.13 sim_time_fw_demod: 0.
% 0.65/1.13 sim_time_bw_demod: 0.
% 0.65/1.13 sim_time_light_norm: 0.
% 0.65/1.13 sim_time_joinable: 0.
% 0.65/1.13 sim_time_ac_norm: 0.
% 0.65/1.13 sim_time_fw_ac_demod: 0.
% 0.65/1.13 sim_time_bw_ac_demod: 0.
% 0.65/1.13 sim_time_smt_subs: 0.
% 0.65/1.13 sim_time_fw_gjoin: 0.
% 0.65/1.13 sim_time_fw_connected: 0.
% 0.65/1.13
% 0.65/1.13
%------------------------------------------------------------------------------