%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : CAT019-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n027.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 : 600s
% DateTime : Fri Jul 15 00:01:34 EDT 2022
% Result : Unsatisfiable 0.20s 0.54s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named input)
% Comments :
%------------------------------------------------------------------------------
% Axioms transformation by autotheo
% Orienting (remaining) axiom formulas using strategy Equiv(ClausalAll)
% Orienting axioms whose shape is orientable
cnf(codomain_composition,axiom,
compose(X,codomain(X)) = X,
input ).
fof(codomain_composition_0,plain,
! [X] :
( compose(X,codomain(X)) = X
| $false ),
inference(orientation,[status(thm)],[codomain_composition]) ).
cnf(domain_composition,axiom,
compose(domain(X),X) = X,
input ).
fof(domain_composition_0,plain,
! [X] :
( compose(domain(X),X) = X
| $false ),
inference(orientation,[status(thm)],[domain_composition]) ).
cnf(domain_of_codomain_is_codomain,axiom,
domain(codomain(X)) = codomain(X),
input ).
fof(domain_of_codomain_is_codomain_0,plain,
! [X] :
( domain(codomain(X)) = codomain(X)
| $false ),
inference(orientation,[status(thm)],[domain_of_codomain_is_codomain]) ).
cnf(codomain_of_domain_is_domain,axiom,
codomain(domain(X)) = domain(X),
input ).
fof(codomain_of_domain_is_domain_0,plain,
! [X] :
( codomain(domain(X)) = domain(X)
| $false ),
inference(orientation,[status(thm)],[codomain_of_domain_is_domain]) ).
fof(def_lhs_atom1,axiom,
! [X] :
( lhs_atom1(X)
<=> codomain(domain(X)) = domain(X) ),
inference(definition,[],[]) ).
fof(to_be_clausified_0,plain,
! [X] :
( lhs_atom1(X)
| $false ),
inference(fold_definition,[status(thm)],[codomain_of_domain_is_domain_0,def_lhs_atom1]) ).
fof(def_lhs_atom2,axiom,
! [X] :
( lhs_atom2(X)
<=> domain(codomain(X)) = codomain(X) ),
inference(definition,[],[]) ).
fof(to_be_clausified_1,plain,
! [X] :
( lhs_atom2(X)
| $false ),
inference(fold_definition,[status(thm)],[domain_of_codomain_is_codomain_0,def_lhs_atom2]) ).
fof(def_lhs_atom3,axiom,
! [X] :
( lhs_atom3(X)
<=> compose(domain(X),X) = X ),
inference(definition,[],[]) ).
fof(to_be_clausified_2,plain,
! [X] :
( lhs_atom3(X)
| $false ),
inference(fold_definition,[status(thm)],[domain_composition_0,def_lhs_atom3]) ).
fof(def_lhs_atom4,axiom,
! [X] :
( lhs_atom4(X)
<=> compose(X,codomain(X)) = X ),
inference(definition,[],[]) ).
fof(to_be_clausified_3,plain,
! [X] :
( lhs_atom4(X)
| $false ),
inference(fold_definition,[status(thm)],[codomain_composition_0,def_lhs_atom4]) ).
% Start CNF derivation
fof(c_0_0,axiom,
! [X1] :
( lhs_atom4(X1)
| ~ $true ),
file('<stdin>',to_be_clausified_3) ).
fof(c_0_1,axiom,
! [X1] :
( lhs_atom3(X1)
| ~ $true ),
file('<stdin>',to_be_clausified_2) ).
fof(c_0_2,axiom,
! [X1] :
( lhs_atom2(X1)
| ~ $true ),
file('<stdin>',to_be_clausified_1) ).
fof(c_0_3,axiom,
! [X1] :
( lhs_atom1(X1)
| ~ $true ),
file('<stdin>',to_be_clausified_0) ).
fof(c_0_4,plain,
! [X1] : lhs_atom4(X1),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_5,plain,
! [X1] : lhs_atom3(X1),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_6,plain,
! [X1] : lhs_atom2(X1),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_7,plain,
! [X1] : lhs_atom1(X1),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_8,plain,
! [X2] : lhs_atom4(X2),
inference(variable_rename,[status(thm)],[c_0_4]) ).
fof(c_0_9,plain,
! [X2] : lhs_atom3(X2),
inference(variable_rename,[status(thm)],[c_0_5]) ).
fof(c_0_10,plain,
! [X2] : lhs_atom2(X2),
inference(variable_rename,[status(thm)],[c_0_6]) ).
fof(c_0_11,plain,
! [X2] : lhs_atom1(X2),
inference(variable_rename,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
lhs_atom4(X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
lhs_atom3(X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
lhs_atom2(X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
lhs_atom1(X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
lhs_atom4(X1),
c_0_12,
[final] ).
cnf(c_0_17,plain,
lhs_atom3(X1),
c_0_13,
[final] ).
cnf(c_0_18,plain,
lhs_atom2(X1),
c_0_14,
[final] ).
cnf(c_0_19,plain,
lhs_atom1(X1),
c_0_15,
[final] ).
% End CNF derivation
cnf(c_0_16_0,axiom,
compose(X1,codomain(X1)) = X1,
inference(unfold_definition,[status(thm)],[c_0_16,def_lhs_atom4]) ).
cnf(c_0_17_0,axiom,
compose(domain(X1),X1) = X1,
inference(unfold_definition,[status(thm)],[c_0_17,def_lhs_atom3]) ).
cnf(c_0_18_0,axiom,
domain(codomain(X1)) = codomain(X1),
inference(unfold_definition,[status(thm)],[c_0_18,def_lhs_atom2]) ).
cnf(c_0_19_0,axiom,
codomain(domain(X1)) = domain(X1),
inference(unfold_definition,[status(thm)],[c_0_19,def_lhs_atom1]) ).
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
fof(c_0_0_001,axiom,
! [X1,X2,X3] :
( codomain(X3) != domain(X2)
| codomain(X2) != domain(X1)
| compose(X3,compose(X2,X1)) = compose(compose(X3,X2),X1) ),
file('<stdin>',star_property) ).
fof(c_0_1_002,axiom,
! [X2,X3] :
( codomain(X3) != domain(X2)
| domain(compose(X3,X2)) = domain(X3) ),
file('<stdin>',codomain_domain1) ).
fof(c_0_2_003,axiom,
! [X2,X3] :
( codomain(X3) != domain(X2)
| codomain(compose(X3,X2)) = codomain(X2) ),
file('<stdin>',codomain_domain2) ).
fof(c_0_3_004,axiom,
! [X1,X2,X3] :
( codomain(X3) != domain(X2)
| codomain(X2) != domain(X1)
| compose(X3,compose(X2,X1)) = compose(compose(X3,X2),X1) ),
c_0_0 ).
fof(c_0_4_005,axiom,
! [X2,X3] :
( codomain(X3) != domain(X2)
| domain(compose(X3,X2)) = domain(X3) ),
c_0_1 ).
fof(c_0_5_006,axiom,
! [X2,X3] :
( codomain(X3) != domain(X2)
| codomain(compose(X3,X2)) = codomain(X2) ),
c_0_2 ).
fof(c_0_6_007,plain,
! [X4,X5,X6] :
( codomain(X6) != domain(X5)
| codomain(X5) != domain(X4)
| compose(X6,compose(X5,X4)) = compose(compose(X6,X5),X4) ),
inference(variable_rename,[status(thm)],[c_0_3]) ).
fof(c_0_7_008,plain,
! [X4,X5] :
( codomain(X5) != domain(X4)
| domain(compose(X5,X4)) = domain(X5) ),
inference(variable_rename,[status(thm)],[c_0_4]) ).
fof(c_0_8_009,plain,
! [X4,X5] :
( codomain(X5) != domain(X4)
| codomain(compose(X5,X4)) = codomain(X4) ),
inference(variable_rename,[status(thm)],[c_0_5]) ).
cnf(c_0_9_010,plain,
( compose(X1,compose(X2,X3)) = compose(compose(X1,X2),X3)
| codomain(X2) != domain(X3)
| codomain(X1) != domain(X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10_011,plain,
( domain(compose(X1,X2)) = domain(X1)
| codomain(X1) != domain(X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11_012,plain,
( codomain(compose(X1,X2)) = codomain(X2)
| codomain(X1) != domain(X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12_013,plain,
( compose(compose(X1,X2),X3) = compose(X1,compose(X2,X3))
| codomain(X2) != domain(X3)
| codomain(X1) != domain(X2) ),
c_0_9,
[final] ).
cnf(c_0_13_014,plain,
( domain(compose(X1,X2)) = domain(X1)
| codomain(X1) != domain(X2) ),
c_0_10,
[final] ).
cnf(c_0_14_015,plain,
( codomain(compose(X1,X2)) = codomain(X2)
| codomain(X1) != domain(X2) ),
c_0_11,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_12_0,axiom,
( compose(compose(X1,X2),X3) = compose(X1,compose(X2,X3))
| codomain(X2) != domain(X3)
| codomain(X1) != domain(X2) ),
inference(literals_permutation,[status(thm)],[c_0_12]) ).
cnf(c_0_12_1,axiom,
( codomain(X2) != domain(X3)
| compose(compose(X1,X2),X3) = compose(X1,compose(X2,X3))
| codomain(X1) != domain(X2) ),
inference(literals_permutation,[status(thm)],[c_0_12]) ).
cnf(c_0_12_2,axiom,
( codomain(X1) != domain(X2)
| codomain(X2) != domain(X3)
| compose(compose(X1,X2),X3) = compose(X1,compose(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_12]) ).
cnf(c_0_13_0,axiom,
( domain(compose(X1,X2)) = domain(X1)
| codomain(X1) != domain(X2) ),
inference(literals_permutation,[status(thm)],[c_0_13]) ).
cnf(c_0_13_1,axiom,
( codomain(X1) != domain(X2)
| domain(compose(X1,X2)) = domain(X1) ),
inference(literals_permutation,[status(thm)],[c_0_13]) ).
cnf(c_0_14_0,axiom,
( codomain(compose(X1,X2)) = codomain(X2)
| codomain(X1) != domain(X2) ),
inference(literals_permutation,[status(thm)],[c_0_14]) ).
cnf(c_0_14_1,axiom,
( codomain(X1) != domain(X2)
| codomain(compose(X1,X2)) = codomain(X2) ),
inference(literals_permutation,[status(thm)],[c_0_14]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_016,hypothesis,
! [X1] :
( c2 = X1
| c1 != X1 ),
file('<stdin>',equality_to_c1_and_c2_2) ).
fof(c_0_1_017,hypothesis,
! [X1] :
( c2 != X1
| c1 = X1 ),
file('<stdin>',equality_to_c1_and_c2_1) ).
fof(c_0_2_018,negated_conjecture,
c2 != c1,
file('<stdin>',prove_c1_equals_c2) ).
fof(c_0_3_019,hypothesis,
! [X1] :
( c2 = X1
| c1 != X1 ),
c_0_0 ).
fof(c_0_4_020,hypothesis,
! [X1] :
( c2 != X1
| c1 = X1 ),
c_0_1 ).
fof(c_0_5_021,negated_conjecture,
c2 != c1,
c_0_2 ).
fof(c_0_6_022,hypothesis,
! [X2] :
( c2 = X2
| c1 != X2 ),
inference(variable_rename,[status(thm)],[c_0_3]) ).
fof(c_0_7_023,hypothesis,
! [X2] :
( c2 != X2
| c1 = X2 ),
inference(variable_rename,[status(thm)],[c_0_4]) ).
fof(c_0_8_024,negated_conjecture,
c2 != c1,
c_0_5 ).
cnf(c_0_9_025,hypothesis,
( c2 = X1
| c1 != X1 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10_026,hypothesis,
( c1 = X1
| c2 != X1 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11_027,negated_conjecture,
c2 != c1,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12_028,hypothesis,
( c2 = X1
| c1 != X1 ),
c_0_9,
[final] ).
cnf(c_0_13_029,hypothesis,
( c1 = X1
| c2 != X1 ),
c_0_10,
[final] ).
cnf(c_0_14_030,negated_conjecture,
c1 != c2,
c_0_11,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_12,plain,
( c2 != X0
| c1 = X0 ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_08af88.p',c_0_13) ).
cnf(c_25,plain,
( c2 != X0
| c1 = X0 ),
inference(copy,[status(esa)],[c_12]) ).
cnf(c_32,plain,
( c2 != X0
| c1 = X0 ),
inference(copy,[status(esa)],[c_25]) ).
cnf(c_35,plain,
( c2 != X0
| c1 = X0 ),
inference(copy,[status(esa)],[c_32]) ).
cnf(c_38,plain,
( c2 != X0
| c1 = X0 ),
inference(copy,[status(esa)],[c_35]) ).
cnf(c_74,plain,
( c2 != X0
| c1 = X0 ),
inference(copy,[status(esa)],[c_38]) ).
cnf(c_13,negated_conjecture,
c1 != c2,
file('/export/starexec/sandbox2/tmp/iprover_modulo_08af88.p',c_0_14) ).
cnf(c_27,negated_conjecture,
c1 != c2,
inference(copy,[status(esa)],[c_13]) ).
cnf(c_33,negated_conjecture,
c1 != c2,
inference(copy,[status(esa)],[c_27]) ).
cnf(c_34,negated_conjecture,
c1 != c2,
inference(copy,[status(esa)],[c_33]) ).
cnf(c_39,negated_conjecture,
c1 != c2,
inference(copy,[status(esa)],[c_34]) ).
cnf(c_76,negated_conjecture,
c1 != c2,
inference(copy,[status(esa)],[c_39]) ).
cnf(c_90,plain,
c2 != c2,
inference(resolution,[status(thm)],[c_74,c_76]) ).
cnf(c_91,plain,
c2 != c2,
inference(rewriting,[status(thm)],[c_90]) ).
cnf(c_92,plain,
$false,
inference(equality_resolution_simp,[status(esa)],[c_91]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : CAT019-2 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : iprover_modulo %s %d
% 0.12/0.34 % Computer : n027.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun May 29 20:36:46 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.35 % Running in mono-core mode
% 0.20/0.40 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.40 % Orientation found
% 0.20/0.40 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_6d6ef8.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_08af88.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_cc8d42 | grep -v "SZS"
% 0.20/0.43
% 0.20/0.43 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.43
% 0.20/0.43 %
% 0.20/0.43 % ------ iProver source info
% 0.20/0.43
% 0.20/0.43 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.43 % git: non_committed_changes: true
% 0.20/0.43 % git: last_make_outside_of_git: true
% 0.20/0.43
% 0.20/0.43 %
% 0.20/0.43 % ------ Input Options
% 0.20/0.43
% 0.20/0.43 % --out_options all
% 0.20/0.43 % --tptp_safe_out true
% 0.20/0.43 % --problem_path ""
% 0.20/0.43 % --include_path ""
% 0.20/0.43 % --clausifier .//eprover
% 0.20/0.43 % --clausifier_options --tstp-format
% 0.20/0.43 % --stdin false
% 0.20/0.43 % --dbg_backtrace false
% 0.20/0.43 % --dbg_dump_prop_clauses false
% 0.20/0.43 % --dbg_dump_prop_clauses_file -
% 0.20/0.43 % --dbg_out_stat false
% 0.20/0.43
% 0.20/0.43 % ------ General Options
% 0.20/0.43
% 0.20/0.43 % --fof false
% 0.20/0.43 % --time_out_real 150.
% 0.20/0.43 % --time_out_prep_mult 0.2
% 0.20/0.43 % --time_out_virtual -1.
% 0.20/0.43 % --schedule none
% 0.20/0.43 % --ground_splitting input
% 0.20/0.43 % --splitting_nvd 16
% 0.20/0.43 % --non_eq_to_eq false
% 0.20/0.43 % --prep_gs_sim true
% 0.20/0.43 % --prep_unflatten false
% 0.20/0.43 % --prep_res_sim true
% 0.20/0.43 % --prep_upred true
% 0.20/0.43 % --res_sim_input true
% 0.20/0.43 % --clause_weak_htbl true
% 0.20/0.43 % --gc_record_bc_elim false
% 0.20/0.43 % --symbol_type_check false
% 0.20/0.43 % --clausify_out false
% 0.20/0.43 % --large_theory_mode false
% 0.20/0.43 % --prep_sem_filter none
% 0.20/0.43 % --prep_sem_filter_out false
% 0.20/0.43 % --preprocessed_out false
% 0.20/0.43 % --sub_typing false
% 0.20/0.43 % --brand_transform false
% 0.20/0.43 % --pure_diseq_elim true
% 0.20/0.43 % --min_unsat_core false
% 0.20/0.43 % --pred_elim true
% 0.20/0.43 % --add_important_lit false
% 0.20/0.43 % --soft_assumptions false
% 0.20/0.43 % --reset_solvers false
% 0.20/0.43 % --bc_imp_inh []
% 0.20/0.43 % --conj_cone_tolerance 1.5
% 0.20/0.43 % --prolific_symb_bound 500
% 0.20/0.43 % --lt_threshold 2000
% 0.20/0.43
% 0.20/0.43 % ------ SAT Options
% 0.20/0.43
% 0.20/0.43 % --sat_mode false
% 0.20/0.43 % --sat_fm_restart_options ""
% 0.20/0.43 % --sat_gr_def false
% 0.20/0.43 % --sat_epr_types true
% 0.20/0.43 % --sat_non_cyclic_types false
% 0.20/0.43 % --sat_finite_models false
% 0.20/0.43 % --sat_fm_lemmas false
% 0.20/0.43 % --sat_fm_prep false
% 0.20/0.43 % --sat_fm_uc_incr true
% 0.20/0.43 % --sat_out_model small
% 0.20/0.43 % --sat_out_clauses false
% 0.20/0.43
% 0.20/0.43 % ------ QBF Options
% 0.20/0.43
% 0.20/0.43 % --qbf_mode false
% 0.20/0.43 % --qbf_elim_univ true
% 0.20/0.43 % --qbf_sk_in true
% 0.20/0.43 % --qbf_pred_elim true
% 0.20/0.43 % --qbf_split 32
% 0.20/0.43
% 0.20/0.43 % ------ BMC1 Options
% 0.20/0.43
% 0.20/0.43 % --bmc1_incremental false
% 0.20/0.43 % --bmc1_axioms reachable_all
% 0.20/0.43 % --bmc1_min_bound 0
% 0.20/0.43 % --bmc1_max_bound -1
% 0.20/0.43 % --bmc1_max_bound_default -1
% 0.20/0.43 % --bmc1_symbol_reachability true
% 0.20/0.43 % --bmc1_property_lemmas false
% 0.20/0.43 % --bmc1_k_induction false
% 0.20/0.43 % --bmc1_non_equiv_states false
% 0.20/0.43 % --bmc1_deadlock false
% 0.20/0.43 % --bmc1_ucm false
% 0.20/0.43 % --bmc1_add_unsat_core none
% 0.20/0.43 % --bmc1_unsat_core_children false
% 0.20/0.43 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.43 % --bmc1_out_stat full
% 0.20/0.43 % --bmc1_ground_init false
% 0.20/0.43 % --bmc1_pre_inst_next_state false
% 0.20/0.43 % --bmc1_pre_inst_state false
% 0.20/0.43 % --bmc1_pre_inst_reach_state false
% 0.20/0.43 % --bmc1_out_unsat_core false
% 0.20/0.43 % --bmc1_aig_witness_out false
% 0.20/0.43 % --bmc1_verbose false
% 0.20/0.43 % --bmc1_dump_clauses_tptp false
% 0.20/0.53 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.53 % --bmc1_dump_file -
% 0.20/0.53 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.53 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.53 % --bmc1_ucm_extend_mode 1
% 0.20/0.53 % --bmc1_ucm_init_mode 2
% 0.20/0.53 % --bmc1_ucm_cone_mode none
% 0.20/0.53 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.53 % --bmc1_ucm_relax_model 4
% 0.20/0.53 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.53 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.53 % --bmc1_ucm_layered_model none
% 0.20/0.53 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.53
% 0.20/0.53 % ------ AIG Options
% 0.20/0.53
% 0.20/0.53 % --aig_mode false
% 0.20/0.53
% 0.20/0.53 % ------ Instantiation Options
% 0.20/0.53
% 0.20/0.53 % --instantiation_flag true
% 0.20/0.53 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.53 % --inst_solver_per_active 750
% 0.20/0.53 % --inst_solver_calls_frac 0.5
% 0.20/0.53 % --inst_passive_queue_type priority_queues
% 0.20/0.53 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.53 % --inst_passive_queues_freq [25;2]
% 0.20/0.53 % --inst_dismatching true
% 0.20/0.53 % --inst_eager_unprocessed_to_passive true
% 0.20/0.53 % --inst_prop_sim_given true
% 0.20/0.53 % --inst_prop_sim_new false
% 0.20/0.53 % --inst_orphan_elimination true
% 0.20/0.53 % --inst_learning_loop_flag true
% 0.20/0.53 % --inst_learning_start 3000
% 0.20/0.53 % --inst_learning_factor 2
% 0.20/0.53 % --inst_start_prop_sim_after_learn 3
% 0.20/0.53 % --inst_sel_renew solver
% 0.20/0.53 % --inst_lit_activity_flag true
% 0.20/0.53 % --inst_out_proof true
% 0.20/0.53
% 0.20/0.53 % ------ Resolution Options
% 0.20/0.53
% 0.20/0.53 % --resolution_flag true
% 0.20/0.53 % --res_lit_sel kbo_max
% 0.20/0.53 % --res_to_prop_solver none
% 0.20/0.53 % --res_prop_simpl_new false
% 0.20/0.53 % --res_prop_simpl_given false
% 0.20/0.53 % --res_passive_queue_type priority_queues
% 0.20/0.53 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.53 % --res_passive_queues_freq [15;5]
% 0.20/0.53 % --res_forward_subs full
% 0.20/0.53 % --res_backward_subs full
% 0.20/0.53 % --res_forward_subs_resolution true
% 0.20/0.53 % --res_backward_subs_resolution true
% 0.20/0.53 % --res_orphan_elimination false
% 0.20/0.53 % --res_time_limit 1000.
% 0.20/0.53 % --res_out_proof true
% 0.20/0.53 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_6d6ef8.s
% 0.20/0.53 % --modulo true
% 0.20/0.53
% 0.20/0.53 % ------ Combination Options
% 0.20/0.53
% 0.20/0.53 % --comb_res_mult 1000
% 0.20/0.53 % --comb_inst_mult 300
% 0.20/0.53 % ------
% 0.20/0.53
% 0.20/0.53 % ------ Parsing...% successful
% 0.20/0.53
% 0.20/0.53 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 0.20/0.53
% 0.20/0.53 % ------ Proving...
% 0.20/0.53 % ------ Problem Properties
% 0.20/0.53
% 0.20/0.53 %
% 0.20/0.53 % EPR false
% 0.20/0.53 % Horn true
% 0.20/0.53 % Has equality true
% 0.20/0.53
% 0.20/0.53 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.53
% 0.20/0.53
% 0.20/0.53 Compiling...
% 0.20/0.53 Loading plugin: done.
% 0.20/0.53 % % ------ Current options:
% 0.20/0.53
% 0.20/0.53 % ------ Input Options
% 0.20/0.53
% 0.20/0.53 % --out_options all
% 0.20/0.53 % --tptp_safe_out true
% 0.20/0.53 % --problem_path ""
% 0.20/0.53 % --include_path ""
% 0.20/0.53 % --clausifier .//eprover
% 0.20/0.53 % --clausifier_options --tstp-format
% 0.20/0.53 % --stdin false
% 0.20/0.53 % --dbg_backtrace false
% 0.20/0.53 % --dbg_dump_prop_clauses false
% 0.20/0.53 % --dbg_dump_prop_clauses_file -
% 0.20/0.53 % --dbg_out_stat false
% 0.20/0.53
% 0.20/0.53 % ------ General Options
% 0.20/0.53
% 0.20/0.53 % --fof false
% 0.20/0.53 % --time_out_real 150.
% 0.20/0.53 % --time_out_prep_mult 0.2
% 0.20/0.53 % --time_out_virtual -1.
% 0.20/0.53 % --schedule none
% 0.20/0.53 % --ground_splitting input
% 0.20/0.53 % --splitting_nvd 16
% 0.20/0.53 % --non_eq_to_eq false
% 0.20/0.53 % --prep_gs_sim true
% 0.20/0.53 % --prep_unflatten false
% 0.20/0.53 % --prep_res_sim true
% 0.20/0.53 % --prep_upred true
% 0.20/0.53 % --res_sim_input true
% 0.20/0.53 % --clause_weak_htbl true
% 0.20/0.53 % --gc_record_bc_elim false
% 0.20/0.53 % --symbol_type_check false
% 0.20/0.53 % --clausify_out false
% 0.20/0.53 % --large_theory_mode false
% 0.20/0.53 % --prep_sem_filter none
% 0.20/0.53 % --prep_sem_filter_out false
% 0.20/0.53 % --preprocessed_out false
% 0.20/0.53 % --sub_typing false
% 0.20/0.53 % --brand_transform false
% 0.20/0.53 % --pure_diseq_elim true
% 0.20/0.53 % --min_unsat_core false
% 0.20/0.53 % --pred_elim true
% 0.20/0.53 % --add_important_lit false
% 0.20/0.53 % --soft_assumptions false
% 0.20/0.53 % --reset_solvers false
% 0.20/0.53 % --bc_imp_inh []
% 0.20/0.53 % --conj_cone_tolerance 1.5
% 0.20/0.53 % --prolific_symb_bound 500
% 0.20/0.53 % --lt_threshold 2000
% 0.20/0.53
% 0.20/0.53 % ------ SAT Options
% 0.20/0.53
% 0.20/0.53 % --sat_mode false
% 0.20/0.53 % --sat_fm_restart_options ""
% 0.20/0.53 % --sat_gr_def false
% 0.20/0.53 % --sat_epr_types true
% 0.20/0.53 % --sat_non_cyclic_types false
% 0.20/0.53 % --sat_finite_models false
% 0.20/0.53 % --sat_fm_lemmas false
% 0.20/0.53 % --sat_fm_prep false
% 0.20/0.53 % --sat_fm_uc_incr true
% 0.20/0.53 % --sat_out_model small
% 0.20/0.53 % --sat_out_clauses false
% 0.20/0.53
% 0.20/0.53 % ------ QBF Options
% 0.20/0.53
% 0.20/0.53 % --qbf_mode false
% 0.20/0.53 % --qbf_elim_univ true
% 0.20/0.53 % --qbf_sk_in true
% 0.20/0.53 % --qbf_pred_elim true
% 0.20/0.53 % --qbf_split 32
% 0.20/0.53
% 0.20/0.53 % ------ BMC1 Options
% 0.20/0.53
% 0.20/0.53 % --bmc1_incremental false
% 0.20/0.53 % --bmc1_axioms reachable_all
% 0.20/0.53 % --bmc1_min_bound 0
% 0.20/0.53 % --bmc1_max_bound -1
% 0.20/0.53 % --bmc1_max_bound_default -1
% 0.20/0.53 % --bmc1_symbol_reachability true
% 0.20/0.53 % --bmc1_property_lemmas false
% 0.20/0.53 % --bmc1_k_induction false
% 0.20/0.53 % --bmc1_non_equiv_states false
% 0.20/0.53 % --bmc1_deadlock false
% 0.20/0.53 % --bmc1_ucm false
% 0.20/0.53 % --bmc1_add_unsat_core none
% 0.20/0.53 % --bmc1_unsat_core_children false
% 0.20/0.53 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.53 % --bmc1_out_stat full
% 0.20/0.53 % --bmc1_ground_init false
% 0.20/0.53 % --bmc1_pre_inst_next_state false
% 0.20/0.53 % --bmc1_pre_inst_state false
% 0.20/0.53 % --bmc1_pre_inst_reach_state false
% 0.20/0.53 % --bmc1_out_unsat_core false
% 0.20/0.53 % --bmc1_aig_witness_out false
% 0.20/0.53 % --bmc1_verbose false
% 0.20/0.53 % --bmc1_dump_clauses_tptp false
% 0.20/0.53 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.53 % --bmc1_dump_file -
% 0.20/0.53 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.53 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.53 % --bmc1_ucm_extend_mode 1
% 0.20/0.53 % --bmc1_ucm_init_mode 2
% 0.20/0.53 % --bmc1_ucm_cone_mode none
% 0.20/0.53 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.53 % --bmc1_ucm_relax_model 4
% 0.20/0.53 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.53 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.53 % --bmc1_ucm_layered_model none
% 0.20/0.53 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.53
% 0.20/0.53 % ------ AIG Options
% 0.20/0.53
% 0.20/0.53 % --aig_mode false
% 0.20/0.53
% 0.20/0.53 % ------ Instantiation Options
% 0.20/0.53
% 0.20/0.53 % --instantiation_flag true
% 0.20/0.53 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.53 % --inst_solver_per_active 750
% 0.20/0.53 % --inst_solver_calls_frac 0.5
% 0.20/0.53 % --inst_passive_queue_type priority_queues
% 0.20/0.53 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.53 % --inst_passive_queues_freq [25;2]
% 0.20/0.53 % --inst_dismatching true
% 0.20/0.53 % --inst_eager_unprocessed_to_passive true
% 0.20/0.53 % --inst_prop_sim_given true
% 0.20/0.53 % --inst_prop_sim_new false
% 0.20/0.53 % --inst_orphan_elimination true
% 0.20/0.53 % --inst_learning_loop_flag true
% 0.20/0.53 % --inst_learning_start 3000
% 0.20/0.53 % --inst_learning_factor 2
% 0.20/0.53 % --inst_start_prop_sim_after_learn 3
% 0.20/0.53 % --inst_sel_renew solver
% 0.20/0.53 % --inst_lit_activity_flag true
% 0.20/0.53 % --inst_out_proof true
% 0.20/0.53
% 0.20/0.53 % ------ Resolution Options
% 0.20/0.53
% 0.20/0.53 % --resolution_flag true
% 0.20/0.53 % --res_lit_sel kbo_max
% 0.20/0.53 % --res_to_prop_solver none
% 0.20/0.53 % --res_prop_simpl_new false
% 0.20/0.53 % --res_prop_simpl_given false
% 0.20/0.53 % --res_passive_queue_type priority_queues
% 0.20/0.53 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.53 % --res_passive_queues_freq [15;5]
% 0.20/0.53 % --res_forward_subs full
% 0.20/0.53 % --res_backward_subs full
% 0.20/0.53 % --res_forward_subs_resolution true
% 0.20/0.53 % --res_backward_subs_resolution true
% 0.20/0.53 % --res_orphan_elimination false
% 0.20/0.53 % --res_time_limit 1000.
% 0.20/0.53 % --res_out_proof true
% 0.20/0.53 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_6d6ef8.s
% 0.20/0.53 % --modulo true
% 0.20/0.53
% 0.20/0.53 % ------ Combination Options
% 0.20/0.53
% 0.20/0.53 % --comb_res_mult 1000
% 0.20/0.53 % --comb_inst_mult 300
% 0.20/0.53 % ------
% 0.20/0.53
% 0.20/0.53
% 0.20/0.53
% 0.20/0.53 % ------ Proving...
% 0.20/0.53 %
% 0.20/0.53
% 0.20/0.53
% 0.20/0.53 % Resolution empty clause
% 0.20/0.53
% 0.20/0.53 % ------ Statistics
% 0.20/0.53
% 0.20/0.53 % ------ General
% 0.20/0.53
% 0.20/0.53 % num_of_input_clauses: 14
% 0.20/0.53 % num_of_input_neg_conjectures: 1
% 0.20/0.53 % num_of_splits: 0
% 0.20/0.53 % num_of_split_atoms: 0
% 0.20/0.53 % num_of_sem_filtered_clauses: 0
% 0.20/0.53 % num_of_subtypes: 0
% 0.20/0.53 % monotx_restored_types: 0
% 0.20/0.53 % sat_num_of_epr_types: 0
% 0.20/0.53 % sat_num_of_non_cyclic_types: 0
% 0.20/0.53 % sat_guarded_non_collapsed_types: 0
% 0.20/0.53 % is_epr: 0
% 0.20/0.53 % is_horn: 1
% 0.20/0.53 % has_eq: 1
% 0.20/0.53 % num_pure_diseq_elim: 0
% 0.20/0.53 % simp_replaced_by: 0
% 0.20/0.53 % res_preprocessed: 4
% 0.20/0.53 % prep_upred: 0
% 0.20/0.53 % prep_unflattend: 0
% 0.20/0.53 % pred_elim_cands: 0
% 0.20/0.53 % pred_elim: 0
% 0.20/0.53 % pred_elim_cl: 0
% 0.20/0.53 % pred_elim_cycles: 0
% 0.20/0.53 % forced_gc_time: 0
% 0.20/0.53 % gc_basic_clause_elim: 0
% 0.20/0.53 % parsing_time: 0.
% 0.20/0.53 % sem_filter_time: 0.
% 0.20/0.53 % pred_elim_time: 0.
% 0.20/0.53 % out_proof_time: 0.
% 0.20/0.53 % monotx_time: 0.
% 0.20/0.53 % subtype_inf_time: 0.
% 0.20/0.53 % unif_index_cands_time: 0.
% 0.20/0.53 % unif_index_add_time: 0.
% 0.20/0.53 % total_time: 0.125
% 0.20/0.53 % num_of_symbols: 30
% 0.20/0.53 % num_of_terms: 71
% 0.20/0.53
% 0.20/0.53 % ------ Propositional Solver
% 0.20/0.53
% 0.20/0.53 % prop_solver_calls: 1
% 0.20/0.53 % prop_fast_solver_calls: 11
% 0.20/0.53 % prop_num_of_clauses: 19
% 0.20/0.53 % prop_preprocess_simplified: 63
% 0.20/0.53 % prop_fo_subsumed: 0
% 0.20/0.53 % prop_solver_time: 0.
% 0.20/0.53 % prop_fast_solver_time: 0.
% 0.20/0.53 % prop_unsat_core_time: 0.
% 0.20/0.53
% 0.20/0.53 % ------ QBF
% 0.20/0.53
% 0.20/0.53 % qbf_q_res: 0
% 0.20/0.53 % qbf_num_tautologies: 0
% 0.20/0.53 % qbf_prep_cycles: 0
% 0.20/0.53
% 0.20/0.53 % ------ BMC1
% 0.20/0.53
% 0.20/0.53 % bmc1_current_bound: -1
% 0.20/0.53 % bmc1_last_solved_bound: -1
% 0.20/0.53 % bmc1_unsat_core_size: -1
% 0.20/0.53 % bmc1_unsat_core_parents_size: -1
% 0.20/0.53 % bmc1_merge_next_fun: 0
% 0.20/0.53 % bmc1_unsat_core_clauses_time: 0.
% 0.20/0.53
% 0.20/0.53 % ------ Instantiation
% 0.20/0.53
% 0.20/0.53 % inst_num_of_clauses: 14
% 0.20/0.53 % inst_num_in_passive: 0
% 0.20/0.53 % inst_num_in_active: 0
% 0.20/0.53 % inst_num_in_unprocessed: 14
% 0.20/0.53 % inst_num_of_loops: 0
% 0.20/0.54 % inst_num_of_learning_restarts: 0
% 0.20/0.54 % inst_num_moves_active_passive: 0
% 0.20/0.54 % inst_lit_activity: 0
% 0.20/0.54 % inst_lit_activity_moves: 0
% 0.20/0.54 % inst_num_tautologies: 0
% 0.20/0.54 % inst_num_prop_implied: 0
% 0.20/0.54 % inst_num_existing_simplified: 0
% 0.20/0.54 % inst_num_eq_res_simplified: 0
% 0.20/0.54 % inst_num_child_elim: 0
% 0.20/0.54 % inst_num_of_dismatching_blockings: 0
% 0.20/0.54 % inst_num_of_non_proper_insts: 0
% 0.20/0.54 % inst_num_of_duplicates: 0
% 0.20/0.54 % inst_inst_num_from_inst_to_res: 0
% 0.20/0.54 % inst_dismatching_checking_time: 0.
% 0.20/0.54
% 0.20/0.54 % ------ Resolution
% 0.20/0.54
% 0.20/0.54 % res_num_of_clauses: 15
% 0.20/0.54 % res_num_in_passive: 0
% 0.20/0.54 % res_num_in_active: 6
% 0.20/0.54 % res_num_of_loops: 3
% 0.20/0.54 % res_forward_subset_subsumed: 3
% 0.20/0.54 % res_backward_subset_subsumed: 0
% 0.20/0.54 % res_forward_subsumed: 0
% 0.20/0.54 % res_backward_subsumed: 0
% 0.20/0.54 % res_forward_subsumption_resolution: 0
% 0.20/0.54 % res_backward_subsumption_resolution: 0
% 0.20/0.54 % res_clause_to_clause_subsumption: 2
% 0.20/0.54 % res_orphan_elimination: 0
% 0.20/0.54 % res_tautology_del: 1
% 0.20/0.54 % res_num_eq_res_simplified: 0
% 0.20/0.54 % res_num_sel_changes: 0
% 0.20/0.54 % res_moves_from_active_to_pass: 0
% 0.20/0.54
% 0.20/0.54 % Status Unsatisfiable
% 0.20/0.54 % SZS status Unsatisfiable
% 0.20/0.54 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------