TSTP Solution File: NLP164-1 by iProver-SAT---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver-SAT---3.9
% Problem : NLP164-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d SAT
% Computer : n011.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:46:55 EDT 2024
% Result : Satisfiable 3.83s 1.20s
% Output : Model 3.83s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
%------ Positive definition of actual_world
fof(lit_def,axiom,
! [X0] :
( actual_world(X0)
<=> ( X0 = skc63
| X0 = skc19 ) ) ).
%------ Positive definition of ssSkC0
fof(lit_def_001,axiom,
( ssSkC0
<=> $false ) ).
%------ Positive definition of frontseat
fof(lit_def_002,axiom,
! [X0,X1] :
( frontseat(X0,X1)
<=> ( X0 = skc63
& X1 = skc72 ) ) ).
%------ Positive definition of two
fof(lit_def_003,axiom,
! [X0,X1] :
( two(X0,X1)
<=> ( X0 = skc63
& X1 = skc71 ) ) ).
%------ Positive definition of group
fof(lit_def_004,axiom,
! [X0,X1] :
( group(X0,X1)
<=> ( ( X0 = skc63
& X1 = skc71 )
| ( X0 = skc63
& X1 = skc65 )
| ( X0 = skc63
& X1 = skc64 ) ) ) ).
%------ Positive definition of ssSkP0
fof(lit_def_005,axiom,
! [X0,X1] :
( ssSkP0(X0,X1)
<=> ( ( X0 = skc71
& X1 = skc63 )
| ( X0 = skc64
& X1 = skc63 ) ) ) ).
%------ Positive definition of old
fof(lit_def_006,axiom,
! [X0,X1] :
( old(X0,X1)
<=> ( X0 = skc63
& X1 = skc70 ) ) ).
%------ Positive definition of dirty
fof(lit_def_007,axiom,
! [X0,X1] :
( dirty(X0,X1)
<=> ( X0 = skc63
& X1 = skc70 ) ) ).
%------ Positive definition of white
fof(lit_def_008,axiom,
! [X0,X1] :
( white(X0,X1)
<=> ( X0 = skc63
& X1 = skc70 ) ) ).
%------ Positive definition of chevy
fof(lit_def_009,axiom,
! [X0,X1] :
( chevy(X0,X1)
<=> ( X0 = skc63
& X1 = skc70 ) ) ).
%------ Positive definition of barrel
fof(lit_def_010,axiom,
! [X0,X1] :
( barrel(X0,X1)
<=> ( X0 = skc63
& X1 = skc66 ) ) ).
%------ Positive definition of present
fof(lit_def_011,axiom,
! [X0,X1] :
( present(X0,X1)
<=> ( X0 = skc63
& X1 = skc66 ) ) ).
%------ Positive definition of event
fof(lit_def_012,axiom,
! [X0,X1] :
( event(X0,X1)
<=> ( X0 = skc63
& X1 = skc66 ) ) ).
%------ Positive definition of hollywood_placename
fof(lit_def_013,axiom,
! [X0,X1] :
( hollywood_placename(X0,X1)
<=> ( X0 = skc63
& X1 = skc68 ) ) ).
%------ Positive definition of placename
fof(lit_def_014,axiom,
! [X0,X1] :
( placename(X0,X1)
<=> ( X0 = skc63
& X1 = skc68 ) ) ).
%------ Positive definition of city
fof(lit_def_015,axiom,
! [X0,X1] :
( city(X0,X1)
<=> ( X0 = skc63
& X1 = skc69 ) ) ).
%------ Positive definition of street
fof(lit_def_016,axiom,
! [X0,X1] :
( street(X0,X1)
<=> ( X0 = skc63
& X1 = skc67 ) ) ).
%------ Positive definition of lonely
fof(lit_def_017,axiom,
! [X0,X1] :
( lonely(X0,X1)
<=> ( X0 = skc63
& X1 = skc67 ) ) ).
%------ Positive definition of ssSkP1
fof(lit_def_018,axiom,
! [X0,X1,X2] :
( ssSkP1(X0,X1,X2)
<=> ( ( X0 = skc72
& X1 = skc71
& X2 = skc63 )
| ( X1 = skc71
& X2 = skc63 )
| ( X1 = skc64
& X2 = skc63 ) ) ) ).
%------ Positive definition of agent
fof(lit_def_019,axiom,
! [X0,X1,X2] :
( agent(X0,X1,X2)
<=> ( ( X0 = skc63
& X1 = skc66
& X2 = skc70 )
| ? [X3] :
( X0 = skc63
& X1 = skf17(skc63,skf23(skc63,skc65),X3)
& X2 = skf23(skc63,skc65) )
| ? [X3,X4] :
( X0 = skc63
& X1 = skf17(skc63,skf21(skc65,skc63,X3),X4)
& X2 = skf21(skc65,skc63,X3) )
| ? [X3,X4] :
( X0 = skc63
& X1 = skf17(skc63,skf21(skc64,skc63,X3),X4)
& X2 = skf21(skc64,skc63,X3) )
| ? [X3,X4] :
( X0 = skc63
& X1 = skf17(skc63,skf21(skc71,skc63,X3),X4)
& X2 = skf21(skc71,skc63,X3) )
| ? [X3,X4,X5] :
( X0 = skc63
& X1 = skf17(skc63,skf21(X3,skc63,X4),X5)
& X2 = skf21(X3,skc63,X4) )
| ? [X3,X4] :
( X0 = skc63
& X1 = skf17(skc63,skf19(X3,skc63,skc65),X4)
& X2 = skf19(X3,skc63,skc65) )
| ? [X3,X4] :
( X0 = skc63
& X1 = skf17(skc63,skf19(X3,skc63,skc64),X4)
& X2 = skf19(X3,skc63,skc64) )
| ? [X3,X4] :
( X0 = skc63
& X1 = skf17(skc63,skf19(X3,skc63,skc71),X4)
& X2 = skf19(X3,skc63,skc71) )
| ? [X3,X4,X5] :
( X0 = skc63
& X1 = skf17(skc63,skf19(X3,skc63,X4),X5)
& X2 = skf19(X3,skc63,X4) )
| ? [X3,X4] :
( X1 = skf17(X0,skf11(X0,X3),X4)
& X2 = skf11(X0,X3) )
| ? [X3,X4,X5] :
( X1 = skf17(X0,skf16(X3,X0,X4),X5)
& X2 = skf16(X3,X0,X4) ) ) ) ).
%------ Positive definition of in
fof(lit_def_020,axiom,
! [X0,X1,X2] :
( in(X0,X1,X2)
<=> ( X0 = skc63
& X1 = skc66
& X2 = skc69 ) ) ).
%------ Positive definition of of
fof(lit_def_021,axiom,
! [X0,X1,X2] :
( of(X0,X1,X2)
<=> ( X0 = skc63
& X1 = skc68
& X2 = skc69 ) ) ).
%------ Positive definition of down
fof(lit_def_022,axiom,
! [X0,X1,X2] :
( down(X0,X1,X2)
<=> ( X0 = skc63
& X1 = skc66
& X2 = skc67 ) ) ).
%------ Positive definition of ssSkP2
fof(lit_def_023,axiom,
! [X0,X1,X2] :
( ssSkP2(X0,X1,X2)
<=> ( ( X0 = skc71
& X2 = skc63 )
| ( X0 = skc65
& X1 = skc64
& X2 = skc63 )
| ( X0 = skc64
& X2 = skc63 )
| ( X1 = skc71
& X2 = skc63 )
| ( X1 = skc64
& X2 = skc63 ) ) ) ).
%------ Positive definition of member
fof(lit_def_024,axiom,
! [X0,X1,X2] :
( member(X0,X1,X2)
<=> ( ( X0 = skc63
& X1 = skf11(skc63,skc65)
& X2 = skc65 )
| ? [X3] :
( X0 = skc63
& X1 = skf16(X3,skc63,skc65)
& X2 = skc65 )
| ? [X3] :
( X1 = skf21(X2,X0,X3)
& ( X0 != skc63
| X2 != skc71 )
& ( X0 != skc63
| X2 != skc64 ) )
| ( X1 = skf11(X0,X2)
& ( X0 != skc63
| X2 != skc71 )
& ( X0 != skc63
| X2 != skc65 )
& ( X0 != skc63
| X2 != skc64 ) )
| ? [X3] :
( X1 = skf16(X3,X0,X2)
& ( X0 != skc63
| X2 != skc71 )
& ( X0 != skc63
| X2 != skc65 )
& ( X0 != skc63
| X2 != skc64 ) )
| ? [X3] :
( X1 = skf19(X3,X0,X2)
& ( X0 != skc63
| X2 != skc71 )
& ( X0 != skc63
| X2 != skc64 ) ) ) ) ).
%------ Positive definition of coat
fof(lit_def_025,axiom,
! [X0,X1] :
( coat(X0,X1)
<=> ( ( X0 = skc63
& X1 = skf11(skc63,skc64) )
| ? [X2] :
( X0 = skc63
& X1 = skf16(X2,skc63,skc64) )
| ? [X2] :
( X0 = skc63
& X1 = skf19(X2,skc63,skc64) ) ) ) ).
%------ Positive definition of black
fof(lit_def_026,axiom,
! [X0,X1] :
( black(X0,X1)
<=> ( ( X0 = skc63
& X1 = skf11(skc63,skc64) )
| ? [X2] :
( X0 = skc63
& X1 = skf16(X2,skc63,skc64) )
| ? [X2] :
( X0 = skc63
& X1 = skf19(X2,skc63,skc64) ) ) ) ).
%------ Positive definition of cheap
fof(lit_def_027,axiom,
! [X0,X1] :
( cheap(X0,X1)
<=> ( ? [X2] :
( X0 = skc63
& X1 = skf16(X2,skc63,skc64) )
| ? [X2] :
( X0 = skc63
& X1 = skf19(X2,skc63,skc64) ) ) ) ).
%------ Positive definition of fellow
fof(lit_def_028,axiom,
! [X0,X1] :
( fellow(X0,X1)
<=> ( ? [X2] :
( X0 = skc63
& X1 = skf16(X2,skc63,skc71) )
| ? [X2] :
( X0 = skc63
& X1 = skf19(X2,skc63,skc64) )
| ? [X2] :
( X0 = skc63
& X1 = skf19(X2,skc63,skc71) ) ) ) ).
%------ Positive definition of young
fof(lit_def_029,axiom,
! [X0,X1] :
( young(X0,X1)
<=> ( X0 = skc63
| ? [X2] :
( X0 = skc63
& X1 = skf19(X2,skc63,skc64) ) ) ) ).
%------ Positive definition of state
fof(lit_def_030,axiom,
! [X0,X1] :
( state(X0,X1)
<=> $false ) ).
%------ Positive definition of be
fof(lit_def_031,axiom,
! [X0,X1,X2,X3] :
( be(X0,X1,X2,X3)
<=> ? [X4] :
( X0 = skc63
& X1 = skf13(skc63,X4,X2)
& X3 = skf12(X2,skc63,X4) ) ) ).
%------ Positive definition of wear
fof(lit_def_032,axiom,
! [X0,X1] :
( wear(X0,X1)
<=> $false ) ).
%------ Positive definition of patient
fof(lit_def_033,axiom,
! [X0,X1,X2] :
( patient(X0,X1,X2)
<=> ( ( X0 = skc63
& X1 = skf17(skc63,skf23(skc63,skc65),X2) )
| ? [X3] :
( X0 = skc63
& X1 = skf17(skc63,skf21(skc65,skc63,X3),X2) )
| ? [X3] :
( X0 = skc63
& X1 = skf17(skc63,skf21(skc64,skc63,X3),X2) )
| ? [X3] :
( X0 = skc63
& X1 = skf17(skc63,skf21(skc71,skc63,X3),X2) )
| ? [X3,X4] :
( X0 = skc63
& X1 = skf17(skc63,skf21(X3,skc63,X4),X2) )
| ? [X3] :
( X0 = skc63
& X1 = skf17(skc63,skf19(X3,skc63,skc65),X2) )
| ? [X3] :
( X0 = skc63
& X1 = skf17(skc63,skf19(X3,skc63,skc64),X2) )
| ? [X3] :
( X0 = skc63
& X1 = skf17(skc63,skf19(X3,skc63,skc71),X2) )
| ? [X3,X4] :
( X0 = skc63
& X1 = skf17(skc63,skf19(X3,skc63,X4),X2) )
| ? [X3] : X1 = skf17(X0,skf11(X0,X3),X2)
| ? [X3,X4] : X1 = skf17(X0,skf16(X3,X0,X4),X2) ) ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : NLP164-1 : TPTP v8.1.2. Released v2.4.0.
% 0.13/0.15 % Command : run_iprover %s %d SAT
% 0.15/0.36 % Computer : n011.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Thu May 2 18:40:48 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.23/0.50 Running model finding
% 0.23/0.50 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.83/1.20 % SZS status Started for theBenchmark.p
% 3.83/1.20 % SZS status Satisfiable for theBenchmark.p
% 3.83/1.20
% 3.83/1.20 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.83/1.20
% 3.83/1.20 ------ iProver source info
% 3.83/1.20
% 3.83/1.20 git: date: 2024-05-02 19:28:25 +0000
% 3.83/1.20 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.83/1.20 git: non_committed_changes: false
% 3.83/1.20
% 3.83/1.20 ------ Parsing...successful
% 3.83/1.20
% 3.83/1.20
% 3.83/1.20 ------ Proving...
% 3.83/1.20 ------ Problem Properties
% 3.83/1.20
% 3.83/1.20
% 3.83/1.20 clauses 78
% 3.83/1.20 conjectures 78
% 3.83/1.20 EPR 58
% 3.83/1.20 Horn 46
% 3.83/1.20 unary 2
% 3.83/1.20 binary 52
% 3.83/1.20 lits 289
% 3.83/1.20 lits eq 0
% 3.83/1.20 fd_pure 0
% 3.83/1.20 fd_pseudo 0
% 3.83/1.20 fd_cond 0
% 3.83/1.20 fd_pseudo_cond 0
% 3.83/1.20 AC symbols 0
% 3.83/1.20
% 3.83/1.20 ------ Schedule dynamic 5 is on
% 3.83/1.20
% 3.83/1.20 ------ no equalities: superposition off
% 3.83/1.20
% 3.83/1.20 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.83/1.20
% 3.83/1.20
% 3.83/1.20 ------
% 3.83/1.20 Current options:
% 3.83/1.20 ------
% 3.83/1.20
% 3.83/1.20 ------ Input Options
% 3.83/1.20
% 3.83/1.20 --out_options all
% 3.83/1.20 --tptp_safe_out true
% 3.83/1.20 --problem_path ""
% 3.83/1.20 --include_path ""
% 3.83/1.20 --clausifier res/vclausify_rel
% 3.83/1.20 --clausifier_options --mode clausify -t 300.00 -updr off
% 3.83/1.20 --stdin false
% 3.83/1.20 --proof_out true
% 3.83/1.20 --proof_dot_file ""
% 3.83/1.20 --proof_reduce_dot []
% 3.83/1.20 --suppress_sat_res false
% 3.83/1.20 --suppress_unsat_res true
% 3.83/1.20 --stats_out none
% 3.83/1.20 --stats_mem false
% 3.83/1.20 --theory_stats_out false
% 3.83/1.20
% 3.83/1.20 ------ General Options
% 3.83/1.20
% 3.83/1.20 --fof false
% 3.83/1.20 --time_out_real 300.
% 3.83/1.20 --time_out_virtual -1.
% 3.83/1.20 --rnd_seed 13
% 3.83/1.20 --symbol_type_check false
% 3.83/1.20 --clausify_out false
% 3.83/1.20 --sig_cnt_out false
% 3.83/1.20 --trig_cnt_out false
% 3.83/1.20 --trig_cnt_out_tolerance 1.
% 3.83/1.20 --trig_cnt_out_sk_spl false
% 3.83/1.20 --abstr_cl_out false
% 3.83/1.20
% 3.83/1.20 ------ Interactive Mode
% 3.83/1.20
% 3.83/1.20 --interactive_mode false
% 3.83/1.20 --external_ip_address ""
% 3.83/1.20 --external_port 0
% 3.83/1.20
% 3.83/1.20 ------ Global Options
% 3.83/1.20
% 3.83/1.20 --schedule default
% 3.83/1.20 --add_important_lit false
% 3.83/1.20 --prop_solver_per_cl 500
% 3.83/1.20 --subs_bck_mult 8
% 3.83/1.20 --min_unsat_core false
% 3.83/1.20 --soft_assumptions false
% 3.83/1.20 --soft_lemma_size 3
% 3.83/1.20 --prop_impl_unit_size 0
% 3.83/1.20 --prop_impl_unit []
% 3.83/1.20 --share_sel_clauses true
% 3.83/1.20 --reset_solvers false
% 3.83/1.20 --bc_imp_inh [conj_cone]
% 3.83/1.20 --conj_cone_tolerance 3.
% 3.83/1.20 --extra_neg_conj none
% 3.83/1.20 --large_theory_mode true
% 3.83/1.20 --prolific_symb_bound 200
% 3.83/1.20 --lt_threshold 2000
% 3.83/1.20 --clause_weak_htbl true
% 3.83/1.20 --gc_record_bc_elim false
% 3.83/1.20
% 3.83/1.20 ------ Preprocessing Options
% 3.83/1.20
% 3.83/1.20 --preprocessing_flag false
% 3.83/1.20 --time_out_prep_mult 0.1
% 3.83/1.20 --splitting_mode input
% 3.83/1.20 --splitting_grd true
% 3.83/1.20 --splitting_cvd false
% 3.83/1.20 --splitting_cvd_svl false
% 3.83/1.20 --splitting_nvd 32
% 3.83/1.20 --sub_typing false
% 3.83/1.20 --prep_eq_flat_conj false
% 3.83/1.20 --prep_eq_flat_all_gr false
% 3.83/1.20 --prep_gs_sim true
% 3.83/1.20 --prep_unflatten true
% 3.83/1.20 --prep_res_sim true
% 3.83/1.20 --prep_sup_sim_all true
% 3.83/1.20 --prep_sup_sim_sup false
% 3.83/1.20 --prep_upred true
% 3.83/1.20 --prep_well_definedness true
% 3.83/1.20 --prep_sem_filter exhaustive
% 3.83/1.20 --prep_sem_filter_out false
% 3.83/1.20 --pred_elim true
% 3.83/1.20 --res_sim_input true
% 3.83/1.20 --eq_ax_congr_red true
% 3.83/1.20 --pure_diseq_elim true
% 3.83/1.20 --brand_transform false
% 3.83/1.20 --non_eq_to_eq false
% 3.83/1.20 --prep_def_merge true
% 3.83/1.20 --prep_def_merge_prop_impl false
% 3.83/1.20 --prep_def_merge_mbd true
% 3.83/1.20 --prep_def_merge_tr_red false
% 3.83/1.20 --prep_def_merge_tr_cl false
% 3.83/1.20 --smt_preprocessing false
% 3.83/1.20 --smt_ac_axioms fast
% 3.83/1.20 --preprocessed_out false
% 3.83/1.20 --preprocessed_stats false
% 3.83/1.20
% 3.83/1.20 ------ Abstraction refinement Options
% 3.83/1.20
% 3.83/1.20 --abstr_ref []
% 3.83/1.20 --abstr_ref_prep false
% 3.83/1.20 --abstr_ref_until_sat false
% 3.83/1.20 --abstr_ref_sig_restrict funpre
% 3.83/1.20 --abstr_ref_af_restrict_to_split_sk false
% 3.83/1.20 --abstr_ref_under []
% 3.83/1.20
% 3.83/1.20 ------ SAT Options
% 3.83/1.20
% 3.83/1.20 --sat_mode false
% 3.83/1.20 --sat_fm_restart_options ""
% 3.83/1.20 --sat_gr_def false
% 3.83/1.20 --sat_epr_types true
% 3.83/1.20 --sat_non_cyclic_types false
% 3.83/1.20 --sat_finite_models false
% 3.83/1.20 --sat_fm_lemmas false
% 3.83/1.20 --sat_fm_prep false
% 3.83/1.20 --sat_fm_uc_incr true
% 3.83/1.20 --sat_out_model pos
% 3.83/1.20 --sat_out_clauses false
% 3.83/1.20
% 3.83/1.20 ------ QBF Options
% 3.83/1.20
% 3.83/1.20 --qbf_mode false
% 3.83/1.20 --qbf_elim_univ false
% 3.83/1.20 --qbf_dom_inst none
% 3.83/1.20 --qbf_dom_pre_inst false
% 3.83/1.20 --qbf_sk_in false
% 3.83/1.20 --qbf_pred_elim true
% 3.83/1.20 --qbf_split 512
% 3.83/1.20
% 3.83/1.20 ------ BMC1 Options
% 3.83/1.20
% 3.83/1.20 --bmc1_incremental false
% 3.83/1.20 --bmc1_axioms reachable_all
% 3.83/1.20 --bmc1_min_bound 0
% 3.83/1.20 --bmc1_max_bound -1
% 3.83/1.20 --bmc1_max_bound_default -1
% 3.83/1.20 --bmc1_symbol_reachability true
% 3.83/1.20 --bmc1_property_lemmas false
% 3.83/1.20 --bmc1_k_induction false
% 3.83/1.20 --bmc1_non_equiv_states false
% 3.83/1.20 --bmc1_deadlock false
% 3.83/1.20 --bmc1_ucm false
% 3.83/1.20 --bmc1_add_unsat_core none
% 3.83/1.20 --bmc1_unsat_core_children false
% 3.83/1.20 --bmc1_unsat_core_extrapolate_axioms false
% 3.83/1.20 --bmc1_out_stat full
% 3.83/1.20 --bmc1_ground_init false
% 3.83/1.20 --bmc1_pre_inst_next_state false
% 3.83/1.20 --bmc1_pre_inst_state false
% 3.83/1.20 --bmc1_pre_inst_reach_state false
% 3.83/1.20 --bmc1_out_unsat_core false
% 3.83/1.20 --bmc1_aig_witness_out false
% 3.83/1.20 --bmc1_verbose false
% 3.83/1.20 --bmc1_dump_clauses_tptp false
% 3.83/1.20 --bmc1_dump_unsat_core_tptp false
% 3.83/1.20 --bmc1_dump_file -
% 3.83/1.20 --bmc1_ucm_expand_uc_limit 128
% 3.83/1.20 --bmc1_ucm_n_expand_iterations 6
% 3.83/1.20 --bmc1_ucm_extend_mode 1
% 3.83/1.20 --bmc1_ucm_init_mode 2
% 3.83/1.20 --bmc1_ucm_cone_mode none
% 3.83/1.20 --bmc1_ucm_reduced_relation_type 0
% 3.83/1.20 --bmc1_ucm_relax_model 4
% 3.83/1.20 --bmc1_ucm_full_tr_after_sat true
% 3.83/1.20 --bmc1_ucm_expand_neg_assumptions false
% 3.83/1.20 --bmc1_ucm_layered_model none
% 3.83/1.20 --bmc1_ucm_max_lemma_size 10
% 3.83/1.20
% 3.83/1.20 ------ AIG Options
% 3.83/1.20
% 3.83/1.20 --aig_mode false
% 3.83/1.20
% 3.83/1.20 ------ Instantiation Options
% 3.83/1.20
% 3.83/1.20 --instantiation_flag true
% 3.83/1.20 --inst_sos_flag false
% 3.83/1.20 --inst_sos_phase true
% 3.83/1.20 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb]
% 3.83/1.20 --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 3.83/1.20 --inst_lit_sel_side none
% 3.83/1.20 --inst_solver_per_active 1400
% 3.83/1.20 --inst_solver_calls_frac 1.
% 3.83/1.20 --inst_to_smt_solver true
% 3.83/1.20 --inst_passive_queue_type priority_queues
% 3.83/1.20 --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 3.83/1.20 --inst_passive_queues_freq [25;2]
% 3.83/1.20 --inst_dismatching true
% 3.83/1.20 --inst_eager_unprocessed_to_passive true
% 3.83/1.20 --inst_unprocessed_bound 1000
% 3.83/1.20 --inst_prop_sim_given true
% 3.83/1.20 --inst_prop_sim_new false
% 3.83/1.20 --inst_subs_new false
% 3.83/1.20 --inst_eq_res_simp false
% 3.83/1.20 --inst_subs_given false
% 3.83/1.20 --inst_orphan_elimination true
% 3.83/1.20 --inst_learning_loop_flag true
% 3.83/1.20 --inst_learning_start 3000
% 3.83/1.20 --inst_learning_factor 2
% 3.83/1.20 --inst_start_prop_sim_after_learn 3
% 3.83/1.20 --inst_sel_renew solver
% 3.83/1.20 --inst_lit_activity_flag true
% 3.83/1.20 --inst_restr_to_given false
% 3.83/1.20 --inst_activity_threshold 500
% 3.83/1.20
% 3.83/1.20 ------ Resolution Options
% 3.83/1.20
% 3.83/1.20 --resolution_flag false
% 3.83/1.20 --res_lit_sel adaptive
% 3.83/1.20 --res_lit_sel_side none
% 3.83/1.20 --res_ordering kbo
% 3.83/1.20 --res_to_prop_solver active
% 3.83/1.20 --res_prop_simpl_new false
% 3.83/1.20 --res_prop_simpl_given true
% 3.83/1.20 --res_to_smt_solver true
% 3.83/1.20 --res_passive_queue_type priority_queues
% 3.83/1.20 --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 3.83/1.20 --res_passive_queues_freq [15;5]
% 3.83/1.20 --res_forward_subs full
% 3.83/1.20 --res_backward_subs full
% 3.83/1.20 --res_forward_subs_resolution true
% 3.83/1.20 --res_backward_subs_resolution true
% 3.83/1.20 --res_orphan_elimination true
% 3.83/1.20 --res_time_limit 300.
% 3.83/1.20
% 3.83/1.20 ------ Superposition Options
% 3.83/1.20
% 3.83/1.20 --superposition_flag true
% 3.83/1.20 --sup_passive_queue_type priority_queues
% 3.83/1.20 --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.83/1.20 --sup_passive_queues_freq [8;1;4;4]
% 3.83/1.20 --demod_completeness_check fast
% 3.83/1.20 --demod_use_ground true
% 3.83/1.20 --sup_unprocessed_bound 0
% 3.83/1.20 --sup_to_prop_solver passive
% 3.83/1.20 --sup_prop_simpl_new true
% 3.83/1.20 --sup_prop_simpl_given true
% 3.83/1.20 --sup_fun_splitting false
% 3.83/1.20 --sup_iter_deepening 2
% 3.83/1.20 --sup_restarts_mult 12
% 3.83/1.20 --sup_score sim_d_gen
% 3.83/1.20 --sup_share_score_frac 0.2
% 3.83/1.20 --sup_share_max_num_cl 500
% 3.83/1.20 --sup_ordering kbo
% 3.83/1.20 --sup_symb_ordering invfreq
% 3.83/1.20 --sup_term_weight default
% 3.83/1.20
% 3.83/1.20 ------ Superposition Simplification Setup
% 3.83/1.20
% 3.83/1.20 --sup_indices_passive [LightNormIndex;FwDemodIndex]
% 3.83/1.20 --sup_full_triv [SMTSimplify;PropSubs]
% 3.83/1.20 --sup_full_fw [ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 3.83/1.20 --sup_full_bw [BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 3.83/1.20 --sup_immed_triv []
% 3.83/1.20 --sup_immed_fw_main [ACNormalisation;FwLightNorm;FwUnitSubsAndRes]
% 3.83/1.20 --sup_immed_fw_immed [ACNormalisation;FwUnitSubsAndRes]
% 3.83/1.20 --sup_immed_bw_main [BwUnitSubsAndRes;BwDemod]
% 3.83/1.20 --sup_immed_bw_immed [BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 3.83/1.20 --sup_input_triv [Unflattening;SMTSimplify]
% 3.83/1.20 --sup_input_fw [FwACDemod;ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 3.83/1.20 --sup_input_bw [BwACDemod;BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 3.83/1.20 --sup_full_fixpoint true
% 3.83/1.20 --sup_main_fixpoint true
% 3.83/1.20 --sup_immed_fixpoint false
% 3.83/1.20 --sup_input_fixpoint true
% 3.83/1.20 --sup_cache_sim none
% 3.83/1.20 --sup_smt_interval 500
% 3.83/1.20 --sup_bw_gjoin_interval 0
% 3.83/1.20
% 3.83/1.20 ------ Combination Options
% 3.83/1.20
% 3.83/1.20 --comb_mode clause_based
% 3.83/1.20 --comb_inst_mult 5
% 3.83/1.20 --comb_res_mult 1
% 3.83/1.20 --comb_sup_mult 1
% 3.83/1.20 --comb_sup_deep_mult 1
% 3.83/1.20
% 3.83/1.20 ------ Debug Options
% 3.83/1.20
% 3.83/1.20 --dbg_backtrace false
% 3.83/1.20 --dbg_dump_prop_clauses false
% 3.83/1.20 --dbg_dump_prop_clauses_file -
% 3.83/1.20 --dbg_out_stat false
% 3.83/1.20 --dbg_just_parse false
% 3.83/1.20
% 3.83/1.20
% 3.83/1.20
% 3.83/1.20
% 3.83/1.20 ------ Proving...
% 3.83/1.20
% 3.83/1.20
% 3.83/1.20 % SZS status Satisfiable for theBenchmark.p
% 3.83/1.20
% 3.83/1.20 ------ Building Model...Done
% 3.83/1.20
% 3.83/1.20 %------ The model is defined over ground terms (initial term algebra).
% 3.83/1.20 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 3.83/1.20 %------ where \phi is a formula over the term algebra.
% 3.83/1.20 %------ If we have equality in the problem then it is also defined as a predicate above,
% 3.83/1.20 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 3.83/1.20 %------ See help for --sat_out_model for different model outputs.
% 3.83/1.20 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 3.83/1.20 %------ where the first argument stands for the sort ($i in the unsorted case)
% 3.83/1.20 % SZS output start Model for theBenchmark.p
% See solution above
% 3.83/1.20
%------------------------------------------------------------------------------