%------------------------------------------------------------------------------
% File : iProver-SAT---3.9.4
% Problem : MGT019+2 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p SAT
% Computer : n017.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 25 02:13:09 PM UTC 2026
% Result : CounterSatisfiable 1.25s 1.29s
% Output : Saturation 1.25s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
~ ! [X0,X1] :
( ( subpopulations(first_movers,efficient_producers,X0,X1)
& environment(X0) )
=> greater(disbanding_rate(first_movers,X1),disbanding_rate(efficient_producers,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l2) ).
fof(f2,axiom,
! [X0] :
( ( greater_or_equal(founding_rate(efficient_producers,X0),founding_rate(first_movers,X0))
& greater(disbanding_rate(first_movers,X0),disbanding_rate(efficient_producers,X0)) )
=> greater(growth_rate(efficient_producers,X0),growth_rate(first_movers,X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_EP_lower_disbanding_rate) ).
fof(f3,axiom,
! [X0,X1] :
( greater_or_equal(X0,X1)
=> ( X0 = X1
| greater(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_greater_or_equal) ).
fof(f4,axiom,
! [X0] :
( ( stable(X0)
& environment(X0) )
=> ? [X1] :
( ! [X2] :
( ( greater_or_equal(X2,X1)
& subpopulations(first_movers,efficient_producers,X0,X2) )
=> greater_or_equal(founding_rate(efficient_producers,X2),founding_rate(first_movers,X2)) )
& in_environment(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a8) ).
fof(f5,conjecture,
! [X0] :
( ( stable(X0)
& environment(X0) )
=> ? [X1] :
( ! [X2] :
( ( greater_or_equal(X2,X1)
& subpopulations(first_movers,efficient_producers,X0,X2) )
=> greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2)) )
& in_environment(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l1) ).
fof(f6,negated_conjecture,
~ ! [X0] :
( ( stable(X0)
& environment(X0) )
=> ? [X1] :
( ! [X2] :
( ( greater_or_equal(X2,X1)
& subpopulations(first_movers,efficient_producers,X0,X2) )
=> greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2)) )
& in_environment(X0,X1) ) ),
inference(negated_conjecture,[status(cth)],[f5]) ).
fof(f7,plain,
? [X0,X1] :
( subpopulations(first_movers,efficient_producers,X0,X1)
& environment(X0)
& ~ greater(disbanding_rate(first_movers,X1),disbanding_rate(efficient_producers,X1)) ),
inference(ennf_transformation,[],[f1]) ).
fof(f8,plain,
? [X0,X1] :
( subpopulations(first_movers,efficient_producers,X0,X1)
& environment(X0)
& ~ greater(disbanding_rate(first_movers,X1),disbanding_rate(efficient_producers,X1)) ),
inference(flattening,[],[f7]) ).
fof(f9,plain,
! [X0] :
( ~ greater_or_equal(founding_rate(efficient_producers,X0),founding_rate(first_movers,X0))
| ~ greater(disbanding_rate(first_movers,X0),disbanding_rate(efficient_producers,X0))
| greater(growth_rate(efficient_producers,X0),growth_rate(first_movers,X0)) ),
inference(ennf_transformation,[],[f2]) ).
fof(f10,plain,
! [X0] :
( ~ greater_or_equal(founding_rate(efficient_producers,X0),founding_rate(first_movers,X0))
| ~ greater(disbanding_rate(first_movers,X0),disbanding_rate(efficient_producers,X0))
| greater(growth_rate(efficient_producers,X0),growth_rate(first_movers,X0)) ),
inference(flattening,[],[f9]) ).
fof(f11,plain,
! [X0,X1] :
( ~ greater_or_equal(X0,X1)
| X0 = X1
| greater(X0,X1) ),
inference(ennf_transformation,[],[f3]) ).
fof(f12,plain,
! [X0,X1] :
( ~ greater_or_equal(X0,X1)
| X0 = X1
| greater(X0,X1) ),
inference(flattening,[],[f11]) ).
fof(f13,plain,
! [X0] :
( ~ stable(X0)
| ~ environment(X0)
| ? [X1] :
( ! [X2] :
( ~ greater_or_equal(X2,X1)
| ~ subpopulations(first_movers,efficient_producers,X0,X2)
| greater_or_equal(founding_rate(efficient_producers,X2),founding_rate(first_movers,X2)) )
& in_environment(X0,X1) ) ),
inference(ennf_transformation,[],[f4]) ).
fof(f14,plain,
! [X0] :
( ~ stable(X0)
| ~ environment(X0)
| ? [X1] :
( ! [X2] :
( ~ greater_or_equal(X2,X1)
| ~ subpopulations(first_movers,efficient_producers,X0,X2)
| greater_or_equal(founding_rate(efficient_producers,X2),founding_rate(first_movers,X2)) )
& in_environment(X0,X1) ) ),
inference(flattening,[],[f13]) ).
fof(f15,plain,
? [X0] :
( stable(X0)
& environment(X0)
& ! [X1] :
( ? [X2] :
( greater_or_equal(X2,X1)
& subpopulations(first_movers,efficient_producers,X0,X2)
& ~ greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2)) )
| ~ in_environment(X0,X1) ) ),
inference(ennf_transformation,[],[f6]) ).
fof(f16,plain,
? [X0] :
( stable(X0)
& environment(X0)
& ! [X1] :
( ? [X2] :
( greater_or_equal(X2,X1)
& subpopulations(first_movers,efficient_producers,X0,X2)
& ~ greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2)) )
| ~ in_environment(X0,X1) ) ),
inference(flattening,[],[f15]) ).
fof(f17,plain,
( subpopulations(first_movers,efficient_producers,sK0,sK1)
& environment(sK0)
& ~ greater(disbanding_rate(first_movers,sK1),disbanding_rate(efficient_producers,sK1)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f8]) ).
fof(f18,plain,
! [X0] :
( ~ stable(X0)
| ~ environment(X0)
| ( ! [X2] :
( ~ greater_or_equal(X2,sK2(X0))
| ~ subpopulations(first_movers,efficient_producers,X0,X2)
| greater_or_equal(founding_rate(efficient_producers,X2),founding_rate(first_movers,X2)) )
& in_environment(X0,sK2(X0)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X1,sK2(X0))],[f14]) ).
fof(f19,plain,
( stable(sK3)
& environment(sK3)
& ! [X1] :
( ( greater_or_equal(sK4(X1),X1)
& subpopulations(first_movers,efficient_producers,sK3,sK4(X1))
& ~ greater(growth_rate(efficient_producers,sK4(X1)),growth_rate(first_movers,sK4(X1))) )
| ~ in_environment(sK3,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4]),skolemize(X0,sK3),skolemize(X2,sK4(X1))],[f16]) ).
fof(f20,plain,
subpopulations(first_movers,efficient_producers,sK0,sK1),
inference(cnf_transformation,[],[f17]) ).
fof(f21,plain,
environment(sK0),
inference(cnf_transformation,[],[f17]) ).
fof(f22,plain,
~ greater(disbanding_rate(first_movers,sK1),disbanding_rate(efficient_producers,sK1)),
inference(cnf_transformation,[],[f17]) ).
fof(f23,plain,
! [X0] :
( ~ greater_or_equal(founding_rate(efficient_producers,X0),founding_rate(first_movers,X0))
| ~ greater(disbanding_rate(first_movers,X0),disbanding_rate(efficient_producers,X0))
| greater(growth_rate(efficient_producers,X0),growth_rate(first_movers,X0)) ),
inference(cnf_transformation,[],[f10]) ).
fof(f24,plain,
! [X0,X1] :
( ~ greater_or_equal(X0,X1)
| X0 = X1
| greater(X0,X1) ),
inference(cnf_transformation,[],[f12]) ).
fof(f25,plain,
! [X2,X0] :
( ~ stable(X0)
| ~ environment(X0)
| ~ greater_or_equal(X2,sK2(X0))
| ~ subpopulations(first_movers,efficient_producers,X0,X2)
| greater_or_equal(founding_rate(efficient_producers,X2),founding_rate(first_movers,X2)) ),
inference(cnf_transformation,[],[f18]) ).
fof(f26,plain,
! [X0] :
( ~ stable(X0)
| ~ environment(X0)
| in_environment(X0,sK2(X0)) ),
inference(cnf_transformation,[],[f18]) ).
fof(f27,plain,
stable(sK3),
inference(cnf_transformation,[],[f19]) ).
fof(f28,plain,
environment(sK3),
inference(cnf_transformation,[],[f19]) ).
fof(f29,plain,
! [X1] :
( greater_or_equal(sK4(X1),X1)
| ~ in_environment(sK3,X1) ),
inference(cnf_transformation,[],[f19]) ).
fof(f30,plain,
! [X1] :
( subpopulations(first_movers,efficient_producers,sK3,sK4(X1))
| ~ in_environment(sK3,X1) ),
inference(cnf_transformation,[],[f19]) ).
fof(f31,plain,
! [X1] :
( ~ greater(growth_rate(efficient_producers,sK4(X1)),growth_rate(first_movers,sK4(X1)))
| ~ in_environment(sK3,X1) ),
inference(cnf_transformation,[],[f19]) ).
tcf(c_49,plain,
~ greater(disbanding_rate(first_movers,sK1),disbanding_rate(efficient_producers,sK1)),
inference(cnf_transformation,[],[f22]) ).
tcf(c_50,plain,
environment(sK0),
inference(cnf_transformation,[],[f21]) ).
tcf(c_51,plain,
subpopulations(first_movers,efficient_producers,sK0,sK1),
inference(cnf_transformation,[],[f20]) ).
tcf(c_52,plain,
! [X0: $i] :
( greater(growth_rate(efficient_producers,X0),growth_rate(first_movers,X0))
| ~ greater_or_equal(founding_rate(efficient_producers,X0),founding_rate(first_movers,X0))
| ~ greater(disbanding_rate(first_movers,X0),disbanding_rate(efficient_producers,X0)) ),
inference(cnf_transformation,[],[f23]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i] :
( greater(X0,X1)
| ( X0 = X1 )
| ~ greater_or_equal(X0,X1) ),
inference(cnf_transformation,[],[f24]) ).
tcf(c_54,plain,
! [X0: $i] :
( in_environment(X0,sK2(X0))
| ~ stable(X0)
| ~ environment(X0) ),
inference(cnf_transformation,[],[f26]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i] :
( greater_or_equal(founding_rate(efficient_producers,X1),founding_rate(first_movers,X1))
| ~ stable(X0)
| ~ environment(X0)
| ~ greater_or_equal(X1,sK2(X0))
| ~ subpopulations(first_movers,efficient_producers,X0,X1) ),
inference(cnf_transformation,[],[f25]) ).
tcf(c_56,negated_conjecture,
! [X0: $i] :
( ~ in_environment(sK3,X0)
| ~ greater(growth_rate(efficient_producers,sK4(X0)),growth_rate(first_movers,sK4(X0))) ),
inference(cnf_transformation,[],[f31]) ).
tcf(c_57,negated_conjecture,
! [X0: $i] :
( subpopulations(first_movers,efficient_producers,sK3,sK4(X0))
| ~ in_environment(sK3,X0) ),
inference(cnf_transformation,[],[f30]) ).
tcf(c_58,negated_conjecture,
! [X0: $i] :
( greater_or_equal(sK4(X0),X0)
| ~ in_environment(sK3,X0) ),
inference(cnf_transformation,[],[f29]) ).
tcf(c_59,negated_conjecture,
environment(sK3),
inference(cnf_transformation,[],[f28]) ).
tcf(c_60,negated_conjecture,
stable(sK3),
inference(cnf_transformation,[],[f27]) ).
tcf(c_112,plain,
! [X0: $i] :
( greater(sK4(X0),X0)
| ( sK4(X0) = X0 )
| ~ in_environment(sK3,X0) ),
inference(superposition,[status(thm)],[c_58,c_53]) ).
tcf(c_127,plain,
( greater_or_equal(founding_rate(efficient_producers,sK1),founding_rate(first_movers,sK1))
| ~ stable(sK0)
| ~ environment(sK0)
| ~ greater_or_equal(sK1,sK2(sK0)) ),
inference(superposition,[status(thm)],[c_51,c_55]) ).
tcf(c_128,plain,
! [X0: $i] :
( greater_or_equal(founding_rate(efficient_producers,sK4(X0)),founding_rate(first_movers,sK4(X0)))
| ~ stable(sK3)
| ~ environment(sK3)
| ~ in_environment(sK3,X0)
| ~ greater_or_equal(sK4(X0),sK2(sK3)) ),
inference(superposition,[status(thm)],[c_57,c_55]) ).
tcf(c_129,plain,
( greater_or_equal(founding_rate(efficient_producers,sK1),founding_rate(first_movers,sK1))
| ~ stable(sK0)
| ~ greater_or_equal(sK1,sK2(sK0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_127,c_50]) ).
tcf(c_133,plain,
! [X0: $i] :
( greater_or_equal(founding_rate(efficient_producers,sK4(X0)),founding_rate(first_movers,sK4(X0)))
| ~ in_environment(sK3,X0)
| ~ greater_or_equal(sK4(X0),sK2(sK3)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_128,c_60,c_59]) ).
tcf(c_150,plain,
( greater(founding_rate(efficient_producers,sK1),founding_rate(first_movers,sK1))
| ( founding_rate(first_movers,sK1) = founding_rate(efficient_producers,sK1) )
| ~ stable(sK0)
| ~ greater_or_equal(sK1,sK2(sK0)) ),
inference(superposition,[status(thm)],[c_129,c_53]) ).
tcf(c_161,plain,
! [X0: $i] :
( greater(founding_rate(efficient_producers,sK4(X0)),founding_rate(first_movers,sK4(X0)))
| ( founding_rate(first_movers,sK4(X0)) = founding_rate(efficient_producers,sK4(X0)) )
| ~ in_environment(sK3,X0)
| ~ greater_or_equal(sK4(X0),sK2(sK3)) ),
inference(superposition,[status(thm)],[c_133,c_53]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT019+2 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p SAT
% 0.10/0.38 % Computer : n017.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Thu Sep 24 00:56:47 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p SAT
% 0.11/0.41 Running model finding
% 0.11/0.41 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fnt_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.43
% 0.11/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.43
% 0.11/0.43 % Detected problem language: tptp
% 0.11/0.44 % Proving...
% 1.25/1.29 % SZS status Started for theBenchmark.p
% 1.25/1.29 % SZS status CounterSatisfiable for theBenchmark.p
% 1.25/1.29
% 1.25/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.25/1.29
% 1.25/1.29 ------ iProver source info
% 1.25/1.29
% 1.25/1.29 git: date: 2026-07-19 20:42:38 +0200
% 1.25/1.29 git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.25/1.29 git: non_committed_changes: false
% 1.25/1.29
% 1.25/1.29 ------ Parsing...
% 1.25/1.29 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.25/1.29 ------ Proving...
% 1.25/1.29 ------ Problem Properties
% 1.25/1.29
% 1.25/1.29
% 1.25/1.29 clauses 12
% 1.25/1.29 conjectures 5
% 1.25/1.29 EPR 5
% 1.25/1.29 Horn 11
% 1.25/1.29 unary 5
% 1.25/1.29 binary 3
% 1.25/1.29 lits 25
% 1.25/1.29 lits eq 1
% 1.25/1.29 fd_pure 0
% 1.25/1.29 fd_pseudo 0
% 1.25/1.29 fd_cond 0
% 1.25/1.29 fd_pseudo_cond 1
% 1.25/1.29 AC symbols 0
% 1.25/1.29
% 1.25/1.29 ------ Schedule dynamic 5 is on
% 1.25/1.29
% 1.25/1.29 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.25/1.29
% 1.25/1.29
% 1.25/1.29 ------
% 1.25/1.29 Current options:
% 1.25/1.29 ------
% 1.25/1.29
% 1.25/1.29 ------ Input Options
% 1.25/1.29
% 1.25/1.29 --out_options all
% 1.25/1.29 --tptp_safe_out true
% 1.25/1.29 --problem_path ""
% 1.25/1.29 --include_path ""
% 1.25/1.29 --clausifier res/vclausify_rel
% 1.25/1.29 --clausifier_options --mode clausify -t 101.67 -updr off
% 1.25/1.29 --stdin false
% 1.25/1.29 --proof_out true
% 1.25/1.29 --proof_dot_file ""
% 1.25/1.29 --proof_reduce_dot []
% 1.25/1.29 --suppress_sat_res false
% 1.25/1.29 --suppress_unsat_res true
% 1.25/1.29 --stats_out none
% 1.25/1.29 --stats_mem false
% 1.25/1.29 --theory_stats_out false
% 1.25/1.29
% 1.25/1.29 ------ General Options
% 1.25/1.29
% 1.25/1.29 --fof false
% 1.25/1.29 --time_out_real 305.
% 1.25/1.29 --time_out_virtual -1.
% 1.25/1.29 --rnd_seed 13
% 1.25/1.29 --symbol_type_check false
% 1.25/1.29 --clausify_out false
% 1.25/1.29 --sig_cnt_out false
% 1.25/1.29 --trig_cnt_out false
% 1.25/1.29 --trig_cnt_out_tolerance 1.
% 1.25/1.29 --trig_cnt_out_sk_spl false
% 1.25/1.29 --abstr_cl_out false
% 1.25/1.29
% 1.25/1.29 ------ Interactive Mode
% 1.25/1.29
% 1.25/1.29 --interactive_mode false
% 1.25/1.29 --external_ip_address ""
% 1.25/1.29 --external_port 0
% 1.25/1.29
% 1.25/1.29 ------ Global Options
% 1.25/1.29
% 1.25/1.29 --schedule default
% 1.25/1.29 --add_important_lit false
% 1.25/1.29 --prop_solver_per_cl 500
% 1.25/1.29 --subs_bck_mult 8
% 1.25/1.29 --min_unsat_core false
% 1.25/1.29 --soft_assumptions false
% 1.25/1.29 --soft_lemma_size 3
% 1.25/1.29 --prop_impl_unit_size 0
% 1.25/1.29 --prop_impl_unit []
% 1.25/1.29 --share_sel_clauses true
% 1.25/1.29 --reset_solvers false
% 1.25/1.29 --bc_imp_inh [conj_cone]
% 1.25/1.29 --conj_cone_tolerance 3.
% 1.25/1.29 --extra_neg_conj none
% 1.25/1.29 --large_theory_mode true
% 1.25/1.29 --prolific_symb_bound 200
% 1.25/1.29 --lt_threshold 2000
% 1.25/1.29 --clause_weak_htbl true
% 1.25/1.29 --gc_record_bc_elim false
% 1.25/1.29
% 1.25/1.29 ------ Preprocessing Options
% 1.25/1.29
% 1.25/1.29 --preprocessing_flag false
% 1.25/1.29 --time_out_prep_mult 0.1
% 1.25/1.29 --splitting_mode input
% 1.25/1.29 --splitting_grd true
% 1.25/1.29 --splitting_cvd false
% 1.25/1.29 --splitting_cvd_svl false
% 1.25/1.29 --splitting_nvd 32
% 1.25/1.29 --sub_typing false
% 1.25/1.29 --prep_eq_flat_conj false
% 1.25/1.29 --prep_ineq_split false
% 1.25/1.29 --prep_eq_flat_all_gr false
% 1.25/1.29 --prep_gs_sim true
% 1.25/1.29 --prep_unflatten true
% 1.25/1.29 --prep_res_sim true
% 1.25/1.29 --prep_sup_sim_all true
% 1.25/1.29 --prep_sup_sim_sup false
% 1.25/1.29 --prep_upred true
% 1.25/1.29 --prep_well_definedness true
% 1.25/1.29 --prep_sem_filter exhaustive
% 1.25/1.29 --prep_sem_filter_out false
% 1.25/1.29 --pred_elim true
% 1.25/1.29 --res_sim_input true
% 1.25/1.29 --eq_ax_congr_red true
% 1.25/1.29 --pure_diseq_elim true
% 1.25/1.29 --brand_transform false
% 1.25/1.29 --non_eq_to_eq false
% 1.25/1.29 --prep_eq_proxy false
% 1.25/1.29 --prep_def_merge true
% 1.25/1.29 --prep_def_merge_prop_impl false
% 1.25/1.29 --prep_def_merge_mbd true
% 1.25/1.29 --prep_def_merge_tr_red false
% 1.25/1.29 --prep_def_merge_tr_cl false
% 1.25/1.29 --smt_preprocessing false
% 1.25/1.29 --smt_ac_axioms fast
% 1.25/1.29 --preprocessed_out false
% 1.25/1.29 --preprocessed_stats false
% 1.25/1.29
% 1.25/1.29 ------ Abstraction refinement Options
% 1.25/1.29
% 1.25/1.29 --abstr_ref []
% 1.25/1.29 --abstr_ref_prep false
% 1.25/1.29 --abstr_ref_until_sat false
% 1.25/1.29 --abstr_ref_sig_restrict funpre
% 1.25/1.29 --abstr_ref_af_restrict_to_split_sk false
% 1.25/1.29 --abstr_ref_under []
% 1.25/1.29
% 1.25/1.29 ------ SAT Options
% 1.25/1.29
% 1.25/1.29 --sat_mode false
% 1.25/1.29 --sat_fm_restart_options ""
% 1.25/1.29 --sat_gr_def false
% 1.25/1.29 --sat_epr_types true
% 1.25/1.29 --sat_non_cyclic_types false
% 1.25/1.29 --sat_finite_models false
% 1.25/1.29 --sat_fm_lemmas false
% 1.25/1.29 --sat_fm_prep false
% 1.25/1.29 --sat_fm_uc_incr true
% 1.25/1.29 --sat_out_model pos
% 1.25/1.29 --sat_out_clauses false
% 1.25/1.29
% 1.25/1.29 ------ QBF Options
% 1.25/1.29
% 1.25/1.29 --qbf_mode false
% 1.25/1.29 --qbf_elim_univ false
% 1.25/1.29 --qbf_dom_inst none
% 1.25/1.29 --qbf_dom_pre_inst false
% 1.25/1.29 --qbf_sk_in false
% 1.25/1.29 --qbf_pred_elim true
% 1.25/1.29 --qbf_split 512
% 1.25/1.29
% 1.25/1.29 ------ BMC1 Options
% 1.25/1.29
% 1.25/1.29 --bmc1_incremental false
% 1.25/1.29 --bmc1_axioms reachable_all
% 1.25/1.29 --bmc1_min_bound 0
% 1.25/1.29 --bmc1_max_bound -1
% 1.25/1.29 --bmc1_max_bound_default -1
% 1.25/1.29 --bmc1_symbol_reachability true
% 1.25/1.29 --bmc1_property_lemmas false
% 1.25/1.29 --bmc1_k_induction false
% 1.25/1.29 --bmc1_non_equiv_states false
% 1.25/1.29 --bmc1_deadlock false
% 1.25/1.29 --bmc1_ucm false
% 1.25/1.29 --bmc1_add_unsat_core none
% 1.25/1.29 --bmc1_unsat_core_children false
% 1.25/1.29 --bmc1_unsat_core_extrapolate_axioms false
% 1.25/1.29 --bmc1_out_stat full
% 1.25/1.29 --bmc1_ground_init false
% 1.25/1.29 --bmc1_pre_inst_next_state false
% 1.25/1.29 --bmc1_pre_inst_state false
% 1.25/1.29 --bmc1_pre_inst_reach_state false
% 1.25/1.29 --bmc1_out_unsat_core false
% 1.25/1.29 --bmc1_aig_witness_out false
% 1.25/1.29 --bmc1_verbose false
% 1.25/1.29 --bmc1_dump_clauses_tptp false
% 1.25/1.29 --bmc1_dump_unsat_core_tptp false
% 1.25/1.29 --bmc1_dump_file -
% 1.25/1.29 --bmc1_ucm_expand_uc_limit 128
% 1.25/1.29 --bmc1_ucm_n_expand_iterations 6
% 1.25/1.29 --bmc1_ucm_extend_mode 1
% 1.25/1.29 --bmc1_ucm_init_mode 2
% 1.25/1.29 --bmc1_ucm_cone_mode none
% 1.25/1.29 --bmc1_ucm_reduced_relation_type 0
% 1.25/1.29 --bmc1_ucm_relax_model 4
% 1.25/1.29 --bmc1_ucm_full_tr_after_sat true
% 1.25/1.29 --bmc1_ucm_expand_neg_assumptions false
% 1.25/1.29 --bmc1_ucm_layered_model none
% 1.25/1.29 --bmc1_ucm_max_lemma_size 10
% 1.25/1.29
% 1.25/1.29 ------ AIG Options
% 1.25/1.29
% 1.25/1.29 --aig_mode false
% 1.25/1.29
% 1.25/1.29 ------ Instantiation Options
% 1.25/1.29
% 1.25/1.29 --instantiation_flag true
% 1.25/1.29 --inst_sos_flag false
% 1.25/1.29 --inst_sos_phase true
% 1.25/1.29 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb]
% 1.25/1.29 --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 1.25/1.29 --inst_lit_sel_side none
% 1.25/1.29 --inst_solver_per_active 1400
% 1.25/1.29 --inst_solver_calls_frac 1.
% 1.25/1.29 --inst_to_smt_solver true
% 1.25/1.29 --inst_passive_queue_type priority_queues
% 1.25/1.29 --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 1.25/1.29 --inst_passive_queues_freq [25;2]
% 1.25/1.29 --inst_dismatching true
% 1.25/1.29 --inst_eager_unprocessed_to_passive true
% 1.25/1.29 --inst_unprocessed_bound 1000
% 1.25/1.29 --inst_prop_sim_given true
% 1.25/1.29 --inst_prop_sim_new false
% 1.25/1.29 --inst_subs_new false
% 1.25/1.29 --inst_eq_res_simp false
% 1.25/1.29 --inst_subs_given false
% 1.25/1.29 --inst_orphan_elimination true
% 1.25/1.29 --inst_learning_loop_flag true
% 1.25/1.29 --inst_learning_start 3000
% 1.25/1.29 --inst_learning_factor 2
% 1.25/1.29 --inst_start_prop_sim_after_learn 3
% 1.25/1.29 --inst_sel_renew solver
% 1.25/1.29 --inst_lit_activity_flag true
% 1.25/1.29 --inst_restr_to_given false
% 1.25/1.29 --inst_activity_threshold 500
% 1.25/1.29
% 1.25/1.29 ------ Resolution Options
% 1.25/1.29
% 1.25/1.29 --resolution_flag false
% 1.25/1.29 --res_lit_sel adaptive
% 1.25/1.29 --res_lit_sel_side none
% 1.25/1.29 --res_ordering kbo
% 1.25/1.29 --res_to_prop_solver active
% 1.25/1.29 --res_prop_simpl_new false
% 1.25/1.29 --res_prop_simpl_given true
% 1.25/1.29 --res_to_smt_solver true
% 1.25/1.29 --res_passive_queue_type priority_queues
% 1.25/1.29 --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.25/1.29 --res_passive_queues_freq [15;5]
% 1.25/1.29 --res_forward_subs full
% 1.25/1.29 --res_backward_subs full
% 1.25/1.29 --res_forward_subs_resolution true
% 1.25/1.29 --res_backward_subs_resolution true
% 1.25/1.29 --res_orphan_elimination true
% 1.25/1.29 --res_time_limit 300.
% 1.25/1.29
% 1.25/1.29 ------ Superposition Options
% 1.25/1.29
% 1.25/1.29 --superposition_flag true
% 1.25/1.29 --sup_passive_queue_type priority_queues
% 1.25/1.29 --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]]
% 1.25/1.29 --sup_passive_queues_freq [8;1;4;4]
% 1.25/1.29 --twee_lhs_weight 4
% 1.25/1.29 --sup_set_join false
% 1.25/1.29 --sup_set_join_goals true
% 1.25/1.29 --sup_set_join_limit 1000
% 1.25/1.29 --demod_completeness_check fast
% 1.25/1.29 --demod_use_ground true
% 1.25/1.29 --sup_unprocessed_bound 0
% 1.25/1.29 --sup_to_prop_solver passive
% 1.25/1.29 --sup_prop_simpl_new true
% 1.25/1.29 --sup_prop_simpl_given true
% 1.25/1.29 --sup_fun_splitting false
% 1.25/1.29 --sup_iter_deepening 2
% 1.25/1.29 --sup_restarts_mult 12
% 1.25/1.29 --sup_score sim_d_gen
% 1.25/1.29 --sup_share_score_frac 0.2
% 1.25/1.29 --sup_share_max_num_cl 500
% 1.25/1.29 --sup_ordering kbo
% 1.25/1.29 --sup_symb_ordering invfreq
% 1.25/1.29 --sup_term_weight default
% 1.25/1.29
% 1.25/1.29 ------ Superposition Simplification Setup
% 1.25/1.29
% 1.25/1.29 --sup_indices_passive [LightNormIndex;FwDemodIndex]
% 1.25/1.29 --sup_full_triv [SMTSimplify;PropSubs]
% 1.25/1.29 --sup_full_fw [ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 1.25/1.29 --sup_full_bw [BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 1.25/1.29 --sup_immed_triv []
% 1.25/1.29 --sup_immed_fw_main [ACNormalisation;FwLightNorm;FwUnitSubsAndRes]
% 1.25/1.29 --sup_immed_fw_immed [ACNormalisation;FwUnitSubsAndRes]
% 1.25/1.29 --sup_immed_bw_main [BwUnitSubsAndRes;BwDemod]
% 1.25/1.29 --sup_immed_bw_immed [BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 1.25/1.29 --sup_input_triv [Unflattening;SMTSimplify]
% 1.25/1.29 --sup_input_fw [FwACDemod;ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 1.25/1.29 --sup_input_bw [BwACDemod;BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 1.25/1.29 --sup_full_fixpoint true
% 1.25/1.29 --sup_main_fixpoint true
% 1.25/1.29 --sup_immed_fixpoint false
% 1.25/1.29 --sup_input_fixpoint true
% 1.25/1.29 --sup_cache_sim none
% 1.25/1.29 --sup_smt_interval 500
% 1.25/1.29 --sup_bw_gjoin_interval 0
% 1.25/1.29
% 1.25/1.29 ------ Combination Options
% 1.25/1.29
% 1.25/1.29 --comb_mode clause_based
% 1.25/1.29 --comb_inst_mult 5
% 1.25/1.29 --comb_res_mult 1
% 1.25/1.29 --comb_sup_mult 8
% 1.25/1.29 --comb_sup_deep_mult 2
% 1.25/1.29
% 1.25/1.29 ------ Debug Options
% 1.25/1.29
% 1.25/1.29 --dbg_backtrace false
% 1.25/1.29 --dbg_dump_prop_clauses false
% 1.25/1.29 --dbg_dump_prop_clauses_file -
% 1.25/1.29 --dbg_out_stat false
% 1.25/1.29 --dbg_just_parse false
% 1.25/1.29
% 1.25/1.29
% 1.25/1.29
% 1.25/1.29
% 1.25/1.29 ------ Proving...
% 1.25/1.29
% 1.25/1.29
% 1.25/1.29 % SZS status CounterSatisfiable for theBenchmark.p
% 1.25/1.29
% 1.25/1.29 % SZS output start Saturation for theBenchmark.p
% See solution above
% 1.25/1.30
% 1.25/1.30
%------------------------------------------------------------------------------