TSTP Solution File: NLP018+1 by iProver-SAT---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver-SAT---3.9
% Problem : NLP018+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d SAT
% Computer : n032.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri May 3 02:45:49 EDT 2024
% Result : CounterSatisfiable 2.13s 1.11s
% Output : Model 2.13s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
%------ Positive definition of equality_sorted
fof(lit_def,axiom,
! [X0_12,X0,X1] :
( equality_sorted(X0_12,X0,X1)
<=> $false ) ).
%------ Positive definition of man
fof(lit_def_001,axiom,
! [X0] :
( man(X0)
<=> ( X0 = iProver_Domain_i_2
| X0 = iProver_Domain_i_4 ) ) ).
%------ Positive definition of fellow
fof(lit_def_002,axiom,
! [X0] :
( fellow(X0)
<=> ( X0 = iProver_Domain_i_2
| X0 = iProver_Domain_i_4 ) ) ).
%------ Positive definition of human
fof(lit_def_003,axiom,
! [X0] :
( human(X0)
<=> ( X0 = iProver_Domain_i_2
| X0 = iProver_Domain_i_4 ) ) ).
%------ Positive definition of organism
fof(lit_def_004,axiom,
! [X0] :
( organism(X0)
<=> ( X0 = iProver_Domain_i_2
| X0 = iProver_Domain_i_4 ) ) ).
%------ Positive definition of entity
fof(lit_def_005,axiom,
! [X0] :
( entity(X0)
<=> ( X0 != iProver_Domain_i_6
| X0 = iProver_Domain_i_2
| X0 = iProver_Domain_i_3
| X0 = iProver_Domain_i_4 ) ) ).
%------ Positive definition of object
fof(lit_def_006,axiom,
! [X0] :
( object(X0)
<=> ( ( X0 != iProver_Domain_i_2
& X0 != iProver_Domain_i_4
& X0 != iProver_Domain_i_6 )
| X0 = iProver_Domain_i_1
| X0 = iProver_Domain_i_3
| X0 = iProver_Domain_i_5 ) ) ).
%------ Positive definition of nonhuman
fof(lit_def_007,axiom,
! [X0] :
( nonhuman(X0)
<=> X0 = iProver_Domain_i_3 ) ).
%------ Positive definition of front
fof(lit_def_008,axiom,
! [X0] :
( front(X0)
<=> X0 = iProver_Domain_i_3 ) ).
%------ Positive definition of furniture
fof(lit_def_009,axiom,
! [X0] :
( furniture(X0)
<=> X0 = iProver_Domain_i_3 ) ).
%------ Positive definition of seat
fof(lit_def_010,axiom,
! [X0] :
( seat(X0)
<=> X0 = iProver_Domain_i_3 ) ).
%------ Positive definition of instrumentality
fof(lit_def_011,axiom,
! [X0] :
( instrumentality(X0)
<=> ( X0 = iProver_Domain_i_1
| X0 = iProver_Domain_i_3 ) ) ).
%------ Positive definition of transport
fof(lit_def_012,axiom,
! [X0] :
( transport(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of way
fof(lit_def_013,axiom,
! [X0] :
( way(X0)
<=> X0 = iProver_Domain_i_5 ) ).
%------ Positive definition of street
fof(lit_def_014,axiom,
! [X0] :
( street(X0)
<=> X0 = iProver_Domain_i_5 ) ).
%------ Positive definition of artifact
fof(lit_def_015,axiom,
! [X0] :
( artifact(X0)
<=> ( X0 = iProver_Domain_i_1
| X0 = iProver_Domain_i_3
| X0 = iProver_Domain_i_5 ) ) ).
%------ Positive definition of car
fof(lit_def_016,axiom,
! [X0] :
( car(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of chevy
fof(lit_def_017,axiom,
! [X0] :
( chevy(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of vehicle
fof(lit_def_018,axiom,
! [X0] :
( vehicle(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of location
fof(lit_def_019,axiom,
! [X0] :
( location(X0)
<=> ( X0 != iProver_Domain_i_1
& X0 != iProver_Domain_i_2
& X0 != iProver_Domain_i_3
& X0 != iProver_Domain_i_4
& X0 != iProver_Domain_i_5
& X0 != iProver_Domain_i_6 ) ) ).
%------ Positive definition of eventuality
fof(lit_def_020,axiom,
! [X0] :
( eventuality(X0)
<=> X0 = iProver_Domain_i_6 ) ).
%------ Positive definition of event
fof(lit_def_021,axiom,
! [X0] :
( event(X0)
<=> X0 = iProver_Domain_i_6 ) ).
%------ Positive definition of city
fof(lit_def_022,axiom,
! [X0] :
( city(X0)
<=> ( X0 != iProver_Domain_i_1
& X0 != iProver_Domain_i_2
& X0 != iProver_Domain_i_3
& X0 != iProver_Domain_i_4
& X0 != iProver_Domain_i_5
& X0 != iProver_Domain_i_6 ) ) ).
%------ Positive definition of hollywood
fof(lit_def_023,axiom,
! [X0] :
( hollywood(X0)
<=> ( X0 != iProver_Domain_i_1
& X0 != iProver_Domain_i_2
& X0 != iProver_Domain_i_3
& X0 != iProver_Domain_i_4
& X0 != iProver_Domain_i_5
& X0 != iProver_Domain_i_6 ) ) ).
%------ Positive definition of new
fof(lit_def_024,axiom,
! [X0] :
( new(X0)
<=> $false ) ).
%------ Positive definition of old
fof(lit_def_025,axiom,
! [X0] :
( old(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of abstraction
fof(lit_def_026,axiom,
! [X0] :
( abstraction(X0)
<=> $false ) ).
%------ Positive definition of female
fof(lit_def_027,axiom,
! [X0] :
( female(X0)
<=> $false ) ).
%------ Positive definition of male
fof(lit_def_028,axiom,
! [X0] :
( male(X0)
<=> ( X0 = iProver_Domain_i_2
| X0 = iProver_Domain_i_4 ) ) ).
%------ Positive definition of woman
fof(lit_def_029,axiom,
! [X0] :
( woman(X0)
<=> $false ) ).
%------ Positive definition of drs
fof(lit_def_030,axiom,
! [X0] :
( drs(X0)
<=> $false ) ).
%------ Positive definition of proposition
fof(lit_def_031,axiom,
! [X0] :
( proposition(X0)
<=> $false ) ).
%------ Positive definition of of
fof(lit_def_032,axiom,
! [X0,X1] :
( of(X0,X1)
<=> $false ) ).
%------ Positive definition of have
fof(lit_def_033,axiom,
! [X0,X1,X2] :
( have(X0,X1,X2)
<=> $false ) ).
%------ Positive definition of partof
fof(lit_def_034,axiom,
! [X0,X1] :
( partof(X0,X1)
<=> $false ) ).
%------ Positive definition of in
fof(lit_def_035,axiom,
! [X0,X1] :
( in(X0,X1)
<=> ( ( X0 = iProver_Domain_i_2
& X1 = iProver_Domain_i_3 )
| ( X0 = iProver_Domain_i_4
& X1 = iProver_Domain_i_3 )
| X0 = iProver_Domain_i_6 ) ) ).
%------ Positive definition of young
fof(lit_def_036,axiom,
! [X0] :
( young(X0)
<=> ( X0 = iProver_Domain_i_2
| X0 = iProver_Domain_i_4 ) ) ).
%------ Positive definition of down
fof(lit_def_037,axiom,
! [X0,X1] :
( down(X0,X1)
<=> ( X0 = iProver_Domain_i_6
& X1 = iProver_Domain_i_5 ) ) ).
%------ Positive definition of barrel
fof(lit_def_038,axiom,
! [X0,X1] :
( barrel(X0,X1)
<=> ( X0 = iProver_Domain_i_6
& X1 = iProver_Domain_i_1 ) ) ).
%------ Positive definition of lonely
fof(lit_def_039,axiom,
! [X0] :
( lonely(X0)
<=> X0 = iProver_Domain_i_5 ) ).
%------ Positive definition of dirty
fof(lit_def_040,axiom,
! [X0] :
( dirty(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of white
fof(lit_def_041,axiom,
! [X0] :
( white(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK0
fof(lit_def_042,axiom,
! [X0,X1,X2] :
( iProver_Flat_sK0(X0,X1,X2)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK9
fof(lit_def_043,axiom,
! [X0] :
( iProver_Flat_sK9(X0)
<=> X0 = iProver_Domain_i_4 ) ).
%------ Positive definition of iProver_Flat_sK7
fof(lit_def_044,axiom,
! [X0] :
( iProver_Flat_sK7(X0)
<=> X0 = iProver_Domain_i_3 ) ).
%------ Positive definition of iProver_Flat_sK8
fof(lit_def_045,axiom,
! [X0] :
( iProver_Flat_sK8(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_sK2
fof(lit_def_046,axiom,
! [X0] :
( iProver_Flat_sK2(X0)
<=> X0 = iProver_Domain_i_6 ) ).
%------ Positive definition of iProver_Flat_sK1
fof(lit_def_047,axiom,
! [X0] :
( iProver_Flat_sK1(X0)
<=> X0 = iProver_Domain_i_7 ) ).
%------ Positive definition of iProver_Flat_sK4
fof(lit_def_048,axiom,
! [X0] :
( iProver_Flat_sK4(X0)
<=> X0 = iProver_Domain_i_5 ) ).
%------ Positive definition of iProver_Flat_sK3
fof(lit_def_049,axiom,
! [X0] :
( iProver_Flat_sK3(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : NLP018+1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.12 % Command : run_iprover %s %d SAT
% 0.11/0.32 % Computer : n032.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Thu May 2 18:45:23 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.17/0.44 Running model finding
% 0.17/0.44 Running: /export/starexec/sandbox/solver/bin/run_problem --no_cores 8 --heuristic_context fnt --schedule fnt_schedule /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 2.13/1.11 % SZS status Started for theBenchmark.p
% 2.13/1.11 % SZS status CounterSatisfiable for theBenchmark.p
% 2.13/1.11
% 2.13/1.11 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.13/1.11
% 2.13/1.11 ------ iProver source info
% 2.13/1.11
% 2.13/1.11 git: date: 2024-05-02 19:28:25 +0000
% 2.13/1.11 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.13/1.11 git: non_committed_changes: false
% 2.13/1.11
% 2.13/1.11 ------ Parsing...
% 2.13/1.11 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.13/1.11 ------ Proving...
% 2.13/1.11 ------ Problem Properties
% 2.13/1.11
% 2.13/1.11
% 2.13/1.11 clauses 73
% 2.13/1.11 conjectures 37
% 2.13/1.11 EPR 71
% 2.13/1.11 Horn 73
% 2.13/1.11 unary 26
% 2.13/1.11 binary 40
% 2.13/1.11 lits 128
% 2.13/1.11 lits eq 2
% 2.13/1.11 fd_pure 0
% 2.13/1.11 fd_pseudo 0
% 2.13/1.11 fd_cond 0
% 2.13/1.11 fd_pseudo_cond 1
% 2.13/1.11 AC symbols 0
% 2.13/1.11
% 2.13/1.11 ------ Input Options Time Limit: Unbounded
% 2.13/1.11
% 2.13/1.11
% 2.13/1.11 ------ Finite Models:
% 2.13/1.11
% 2.13/1.11 ------ lit_activity_flag true
% 2.13/1.11
% 2.13/1.11
% 2.13/1.11 ------ Trying domains of size >= : 1
% 2.13/1.11
% 2.13/1.11 ------ Trying domains of size >= : 2
% 2.13/1.11
% 2.13/1.11 ------ Trying domains of size >= : 2
% 2.13/1.11
% 2.13/1.11 ------ Trying domains of size >= : 2
% 2.13/1.11
% 2.13/1.11 ------ Trying domains of size >= : 2
% 2.13/1.11
% 2.13/1.11 ------ Trying domains of size >= : 2
% 2.13/1.11
% 2.13/1.11 ------ Trying domains of size >= : 2
% 2.13/1.11 ------
% 2.13/1.11 Current options:
% 2.13/1.11 ------
% 2.13/1.11
% 2.13/1.11 ------ Input Options
% 2.13/1.11
% 2.13/1.11 --out_options all
% 2.13/1.11 --tptp_safe_out true
% 2.13/1.11 --problem_path ""
% 2.13/1.11 --include_path ""
% 2.13/1.11 --clausifier res/vclausify_rel
% 2.13/1.11 --clausifier_options --mode clausify -t 300.00 -updr off
% 2.13/1.11 --stdin false
% 2.13/1.11 --proof_out true
% 2.13/1.11 --proof_dot_file ""
% 2.13/1.11 --proof_reduce_dot []
% 2.13/1.11 --suppress_sat_res false
% 2.13/1.11 --suppress_unsat_res true
% 2.13/1.11 --stats_out none
% 2.13/1.11 --stats_mem false
% 2.13/1.11 --theory_stats_out false
% 2.13/1.11
% 2.13/1.11 ------ General Options
% 2.13/1.11
% 2.13/1.11 --fof false
% 2.13/1.11 --time_out_real 300.
% 2.13/1.11 --time_out_virtual -1.
% 2.13/1.11 --rnd_seed 13
% 2.13/1.11 --symbol_type_check false
% 2.13/1.11 --clausify_out false
% 2.13/1.11 --sig_cnt_out false
% 2.13/1.11 --trig_cnt_out false
% 2.13/1.11 --trig_cnt_out_tolerance 1.
% 2.13/1.11 --trig_cnt_out_sk_spl false
% 2.13/1.11 --abstr_cl_out false
% 2.13/1.11
% 2.13/1.11 ------ Interactive Mode
% 2.13/1.11
% 2.13/1.11 --interactive_mode false
% 2.13/1.11 --external_ip_address ""
% 2.13/1.11 --external_port 0
% 2.13/1.11
% 2.13/1.11 ------ Global Options
% 2.13/1.11
% 2.13/1.11 --schedule none
% 2.13/1.11 --add_important_lit false
% 2.13/1.11 --prop_solver_per_cl 500
% 2.13/1.11 --subs_bck_mult 8
% 2.13/1.11 --min_unsat_core false
% 2.13/1.11 --soft_assumptions false
% 2.13/1.11 --soft_lemma_size 3
% 2.13/1.11 --prop_impl_unit_size 0
% 2.13/1.11 --prop_impl_unit []
% 2.13/1.11 --share_sel_clauses true
% 2.13/1.11 --reset_solvers false
% 2.13/1.11 --bc_imp_inh [conj_cone]
% 2.13/1.11 --conj_cone_tolerance 3.
% 2.13/1.11 --extra_neg_conj all_pos_neg
% 2.13/1.11 --large_theory_mode true
% 2.13/1.11 --prolific_symb_bound 500
% 2.13/1.11 --lt_threshold 2000
% 2.13/1.11 --clause_weak_htbl true
% 2.13/1.11 --gc_record_bc_elim false
% 2.13/1.11
% 2.13/1.11 ------ Preprocessing Options
% 2.13/1.11
% 2.13/1.11 --preprocessing_flag false
% 2.13/1.11 --time_out_prep_mult 0.2
% 2.13/1.11 --splitting_mode input
% 2.13/1.11 --splitting_grd false
% 2.13/1.11 --splitting_cvd true
% 2.13/1.11 --splitting_cvd_svl true
% 2.13/1.11 --splitting_nvd 256
% 2.13/1.11 --sub_typing false
% 2.13/1.11 --prep_eq_flat_conj false
% 2.13/1.11 --prep_eq_flat_all_gr false
% 2.13/1.11 --prep_gs_sim false
% 2.13/1.11 --prep_unflatten true
% 2.13/1.11 --prep_res_sim true
% 2.13/1.11 --prep_sup_sim_all true
% 2.13/1.11 --prep_sup_sim_sup false
% 2.13/1.11 --prep_upred true
% 2.13/1.11 --prep_well_definedness true
% 2.13/1.11 --prep_sem_filter none
% 2.13/1.11 --prep_sem_filter_out false
% 2.13/1.11 --pred_elim true
% 2.13/1.11 --res_sim_input false
% 2.13/1.11 --eq_ax_congr_red true
% 2.13/1.11 --pure_diseq_elim false
% 2.13/1.11 --brand_transform false
% 2.13/1.11 --non_eq_to_eq false
% 2.13/1.11 --prep_def_merge false
% 2.13/1.11 --prep_def_merge_prop_impl false
% 2.13/1.11 --prep_def_merge_mbd true
% 2.13/1.11 --prep_def_merge_tr_red false
% 2.13/1.11 --prep_def_merge_tr_cl false
% 2.13/1.11 --smt_preprocessing false
% 2.13/1.11 --smt_ac_axioms fast
% 2.13/1.11 --preprocessed_out false
% 2.13/1.11 --preprocessed_stats false
% 2.13/1.11
% 2.13/1.11 ------ Abstraction refinement Options
% 2.13/1.11
% 2.13/1.11 --abstr_ref []
% 2.13/1.11 --abstr_ref_prep false
% 2.13/1.11 --abstr_ref_until_sat false
% 2.13/1.11 --abstr_ref_sig_restrict funpre
% 2.13/1.11 --abstr_ref_af_restrict_to_split_sk false
% 2.13/1.11 --abstr_ref_under []
% 2.13/1.11
% 2.13/1.11 ------ SAT Options
% 2.13/1.11
% 2.13/1.11 --sat_mode true
% 2.13/1.11 --sat_fm_restart_options ""
% 2.13/1.11 --sat_gr_def false
% 2.13/1.11 --sat_epr_types false
% 2.13/1.11 --sat_non_cyclic_types true
% 2.13/1.11 --sat_finite_models true
% 2.13/1.11 --sat_fm_lemmas false
% 2.13/1.11 --sat_fm_prep false
% 2.13/1.11 --sat_fm_uc_incr true
% 2.13/1.11 --sat_out_model pos
% 2.13/1.11 --sat_out_clauses false
% 2.13/1.11
% 2.13/1.11 ------ QBF Options
% 2.13/1.11
% 2.13/1.11 --qbf_mode false
% 2.13/1.11 --qbf_elim_univ false
% 2.13/1.11 --qbf_dom_inst none
% 2.13/1.11 --qbf_dom_pre_inst false
% 2.13/1.11 --qbf_sk_in false
% 2.13/1.11 --qbf_pred_elim true
% 2.13/1.11 --qbf_split 512
% 2.13/1.11
% 2.13/1.11 ------ BMC1 Options
% 2.13/1.11
% 2.13/1.11 --bmc1_incremental false
% 2.13/1.11 --bmc1_axioms reachable_all
% 2.13/1.11 --bmc1_min_bound 0
% 2.13/1.11 --bmc1_max_bound -1
% 2.13/1.11 --bmc1_max_bound_default -1
% 2.13/1.11 --bmc1_symbol_reachability false
% 2.13/1.11 --bmc1_property_lemmas false
% 2.13/1.11 --bmc1_k_induction false
% 2.13/1.11 --bmc1_non_equiv_states false
% 2.13/1.11 --bmc1_deadlock false
% 2.13/1.11 --bmc1_ucm false
% 2.13/1.11 --bmc1_add_unsat_core none
% 2.13/1.11 --bmc1_unsat_core_children false
% 2.13/1.11 --bmc1_unsat_core_extrapolate_axioms false
% 2.13/1.11 --bmc1_out_stat full
% 2.13/1.11 --bmc1_ground_init false
% 2.13/1.11 --bmc1_pre_inst_next_state false
% 2.13/1.11 --bmc1_pre_inst_state false
% 2.13/1.11 --bmc1_pre_inst_reach_state false
% 2.13/1.11 --bmc1_out_unsat_core false
% 2.13/1.11 --bmc1_aig_witness_out false
% 2.13/1.11 --bmc1_verbose false
% 2.13/1.11 --bmc1_dump_clauses_tptp false
% 2.13/1.11 --bmc1_dump_unsat_core_tptp false
% 2.13/1.11 --bmc1_dump_file -
% 2.13/1.11 --bmc1_ucm_expand_uc_limit 128
% 2.13/1.11 --bmc1_ucm_n_expand_iterations 6
% 2.13/1.11 --bmc1_ucm_extend_mode 1
% 2.13/1.11 --bmc1_ucm_init_mode 2
% 2.13/1.11 --bmc1_ucm_cone_mode none
% 2.13/1.11 --bmc1_ucm_reduced_relation_type 0
% 2.13/1.11 --bmc1_ucm_relax_model 4
% 2.13/1.11 --bmc1_ucm_full_tr_after_sat true
% 2.13/1.11 --bmc1_ucm_expand_neg_assumptions false
% 2.13/1.11 --bmc1_ucm_layered_model none
% 2.13/1.11 --bmc1_ucm_max_lemma_size 10
% 2.13/1.11
% 2.13/1.11 ------ AIG Options
% 2.13/1.11
% 2.13/1.11 --aig_mode false
% 2.13/1.11
% 2.13/1.11 ------ Instantiation Options
% 2.13/1.11
% 2.13/1.11 --instantiation_flag true
% 2.13/1.11 --inst_sos_flag false
% 2.13/1.11 --inst_sos_phase true
% 2.13/1.11 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb]
% 2.13/1.11 --inst_lit_sel [-sign;+num_symb;+non_prol_conj_symb]
% 2.13/1.11 --inst_lit_sel_side num_lit
% 2.13/1.11 --inst_solver_per_active 1400
% 2.13/1.11 --inst_solver_calls_frac 0.01
% 2.13/1.11 --inst_to_smt_solver true
% 2.13/1.11 --inst_passive_queue_type priority_queues
% 2.13/1.11 --inst_passive_queues [[+conj_dist;+num_lits;-age];[-conj_symb;-min_def_symb;+bc_imp_inh]]
% 2.13/1.11 --inst_passive_queues_freq [512;64]
% 2.13/1.11 --inst_dismatching true
% 2.13/1.11 --inst_eager_unprocessed_to_passive false
% 2.13/1.11 --inst_unprocessed_bound 1000
% 2.13/1.11 --inst_prop_sim_given true
% 2.13/1.11 --inst_prop_sim_new true
% 2.13/1.11 --inst_subs_new false
% 2.13/1.11 --inst_eq_res_simp false
% 2.13/1.11 --inst_subs_given true
% 2.13/1.11 --inst_orphan_elimination false
% 2.13/1.11 --inst_learning_loop_flag true
% 2.13/1.11 --inst_learning_start 5
% 2.13/1.11 --inst_learning_factor 8
% 2.13/1.11 --inst_start_prop_sim_after_learn 0
% 2.13/1.11 --inst_sel_renew solver
% 2.13/1.11 --inst_lit_activity_flag true
% 2.13/1.11 --inst_restr_to_given false
% 2.13/1.11 --inst_activity_threshold 10000
% 2.13/1.11
% 2.13/1.11 ------ Resolution Options
% 2.13/1.11
% 2.13/1.11 --resolution_flag false
% 2.13/1.11 --res_lit_sel neg_max
% 2.13/1.11 --res_lit_sel_side num_lit
% 2.13/1.11 --res_ordering kbo
% 2.13/1.11 --res_to_prop_solver passive
% 2.13/1.11 --res_prop_simpl_new true
% 2.13/1.11 --res_prop_simpl_given true
% 2.13/1.11 --res_to_smt_solver true
% 2.13/1.11 --res_passive_queue_type priority_queues
% 2.13/1.11 --res_passive_queues [[-has_eq;-conj_non_prolific_symb;+ground];[-bc_imp_inh;-conj_symb]]
% 2.13/1.11 --res_passive_queues_freq [1024;32]
% 2.13/1.11 --res_forward_subs subset_subsumption
% 2.13/1.11 --res_backward_subs subset_subsumption
% 2.13/1.11 --res_forward_subs_resolution true
% 2.13/1.11 --res_backward_subs_resolution false
% 2.13/1.11 --res_orphan_elimination false
% 2.13/1.11 --res_time_limit 10.
% 2.13/1.11
% 2.13/1.11 ------ Superposition Options
% 2.13/1.11
% 2.13/1.11 --superposition_flag false
% 2.13/1.11 --sup_passive_queue_type priority_queues
% 2.13/1.11 --sup_passive_queues [[-conj_dist;-num_symb];[+score;+min_def_symb;-max_atom_input_occur;+conj_non_prolific_symb];[+age;-num_symb];[+score;-num_symb]]
% 2.13/1.11 --sup_passive_queues_freq [8;1;4;4]
% 2.13/1.11 --demod_completeness_check fast
% 2.13/1.11 --demod_use_ground true
% 2.13/1.11 --sup_unprocessed_bound 0
% 2.13/1.11 --sup_to_prop_solver passive
% 2.13/1.11 --sup_prop_simpl_new true
% 2.13/1.11 --sup_prop_simpl_given true
% 2.13/1.11 --sup_fun_splitting false
% 2.13/1.11 --sup_iter_deepening 2
% 2.13/1.11 --sup_restarts_mult 12
% 2.13/1.11 --sup_score sim_d_gen
% 2.13/1.11 --sup_share_score_frac 0.2
% 2.13/1.11 --sup_share_max_num_cl 500
% 2.13/1.11 --sup_ordering kbo
% 2.13/1.11 --sup_symb_ordering invfreq
% 2.13/1.11 --sup_term_weight default
% 2.13/1.11
% 2.13/1.11 ------ Superposition Simplification Setup
% 2.13/1.11
% 2.13/1.11 --sup_indices_passive [LightNormIndex;FwDemodIndex]
% 2.13/1.11 --sup_full_triv [SMTSimplify;PropSubs]
% 2.13/1.11 --sup_full_fw [ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 2.13/1.11 --sup_full_bw [BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 2.13/1.11 --sup_immed_triv []
% 2.13/1.11 --sup_immed_fw_main [ACNormalisation;FwLightNorm;FwUnitSubsAndRes]
% 2.13/1.11 --sup_immed_fw_immed [ACNormalisation;FwUnitSubsAndRes]
% 2.13/1.11 --sup_immed_bw_main [BwUnitSubsAndRes;BwDemod]
% 2.13/1.11 --sup_immed_bw_immed [BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 2.13/1.11 --sup_input_triv [Unflattening;SMTSimplify]
% 2.13/1.11 --sup_input_fw [FwACDemod;ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 2.13/1.11 --sup_input_bw [BwACDemod;BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 2.13/1.11 --sup_full_fixpoint true
% 2.13/1.11 --sup_main_fixpoint true
% 2.13/1.11 --sup_immed_fixpoint false
% 2.13/1.11 --sup_input_fixpoint true
% 2.13/1.11 --sup_cache_sim none
% 2.13/1.11 --sup_smt_interval 500
% 2.13/1.11 --sup_bw_gjoin_interval 0
% 2.13/1.11
% 2.13/1.11 ------ Combination Options
% 2.13/1.11
% 2.13/1.11 --comb_mode clause_based
% 2.13/1.11 --comb_inst_mult 1000
% 2.13/1.11 --comb_res_mult 10
% 2.13/1.11 --comb_sup_mult 8
% 2.13/1.11 --comb_sup_deep_mult 2
% 2.13/1.11
% 2.13/1.11 ------ Debug Options
% 2.13/1.11
% 2.13/1.11 --dbg_backtrace false
% 2.13/1.11 --dbg_dump_prop_clauses false
% 2.13/1.11 --dbg_dump_prop_clauses_file -
% 2.13/1.11 --dbg_out_stat false
% 2.13/1.11 --dbg_just_parse false
% 2.13/1.11
% 2.13/1.11
% 2.13/1.11
% 2.13/1.11
% 2.13/1.11 ------ Proving...
% 2.13/1.11
% 2.13/1.11 ------ Trying domains of size >= : 3
% 2.13/1.11
% 2.13/1.11 ------ Trying domains of size >= : 3
% 2.13/1.11
% 2.13/1.11 ------ Trying domains of size >= : 3
% 2.13/1.11
% 2.13/1.11 ------ Trying domains of size >= : 3
% 2.13/1.11
% 2.13/1.11
% 2.13/1.11 ------ Proving...
% 2.13/1.11
% 2.13/1.11 ------ Trying domains of size >= : 4
% 2.13/1.11
% 2.13/1.11 ------ Trying domains of size >= : 4
% 2.13/1.11
% 2.13/1.11 ------ Trying domains of size >= : 4
% 2.13/1.11
% 2.13/1.11
% 2.13/1.11 ------ Proving...
% 2.13/1.11
% 2.13/1.11 ------ Trying domains of size >= : 5
% 2.13/1.11
% 2.13/1.11 ------ Trying domains of size >= : 5
% 2.13/1.11
% 2.13/1.11
% 2.13/1.11 ------ Proving...
% 2.13/1.11
% 2.13/1.11 ------ Trying domains of size >= : 6
% 2.13/1.11
% 2.13/1.11 ------ Trying domains of size >= : 6
% 2.13/1.11
% 2.13/1.11
% 2.13/1.11 ------ Proving...
% 2.13/1.11
% 2.13/1.11 ------ Trying domains of size >= : 7
% 2.13/1.11
% 2.13/1.11
% 2.13/1.11 ------ Proving...
% 2.13/1.11
% 2.13/1.11
% 2.13/1.11 % SZS status CounterSatisfiable for theBenchmark.p
% 2.13/1.11
% 2.13/1.11 ------ Building Model...Done
% 2.13/1.11
% 2.13/1.11 %------ The model is defined over ground terms (initial term algebra).
% 2.13/1.11 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 2.13/1.11 %------ where \phi is a formula over the term algebra.
% 2.13/1.11 %------ If we have equality in the problem then it is also defined as a predicate above,
% 2.13/1.11 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 2.13/1.11 %------ See help for --sat_out_model for different model outputs.
% 2.13/1.11 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 2.13/1.11 %------ where the first argument stands for the sort ($i in the unsorted case)
% 2.13/1.11 % SZS output start Model for theBenchmark.p
% See solution above
% 2.13/1.11
%------------------------------------------------------------------------------