TSTP Solution File: CAT007-3 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : CAT007-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n024.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:29 EDT 2022
% Result : Unsatisfiable 6.48s 6.68s
% Output : CNFRefutation 6.48s
% 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(reflexivity,axiom,
equalish(X,X),
input ).
fof(reflexivity_0,plain,
! [X] :
( equalish(X,X)
| $false ),
inference(orientation,[status(thm)],[reflexivity]) ).
fof(def_lhs_atom1,axiom,
! [X] :
( lhs_atom1(X)
<=> equalish(X,X) ),
inference(definition,[],]) ).
fof(to_be_clausified_0,plain,
! [X] :
( lhs_atom1(X)
| $false ),
inference(fold_definition,[status(thm)],[reflexivity_0,def_lhs_atom1]) ).
% Start CNF derivation
fof(c_0_0,axiom,
! [X1] :
( lhs_atom1(X1)
| ~ $true ),
file('<stdin>',to_be_clausified_0) ).
fof(c_0_1,plain,
! [X1] : lhs_atom1(X1),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_2,plain,
! [X2] : lhs_atom1(X2),
inference(variable_rename,[status(thm)],[c_0_1]) ).
cnf(c_0_3,plain,
lhs_atom1(X1),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,plain,
lhs_atom1(X1),
c_0_3,
[final] ).
% End CNF derivation
cnf(c_0_4_0,axiom,
equalish(X1,X1),
inference(unfold_definition,[status(thm)],[c_0_4,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] :
( ~ equalish(X2,f1(X2,X1))
| ~ equalish(X1,f1(X2,X1))
| equalish(X2,X1) ),
file('<stdin>',indiscernibles3) ).
fof(c_0_1_002,axiom,
! [X1,X2] :
( equalish(X2,f1(X2,X1))
| equalish(X1,f1(X2,X1))
| equalish(X2,X1) ),
file('<stdin>',indiscernibles2) ).
fof(c_0_2_003,axiom,
! [X1,X2] :
( ~ there_exists(domain(X2))
| ~ equalish(domain(X2),codomain(X1))
| there_exists(compose(X2,X1)) ),
file('<stdin>',domain_codomain_composition2) ).
fof(c_0_3_004,axiom,
! [X3,X1,X2] :
( ~ equalish(X2,X1)
| ~ equalish(X1,X3)
| equalish(X2,X3) ),
file('<stdin>',transitivity) ).
fof(c_0_4_005,axiom,
! [X1,X2] :
( there_exists(f1(X2,X1))
| equalish(X2,X1) ),
file('<stdin>',indiscernibles1) ).
fof(c_0_5,axiom,
! [X1,X2] :
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
file('<stdin>',symmetry) ).
fof(c_0_6,axiom,
! [X2] :
( ~ there_exists(domain(X2))
| there_exists(X2) ),
file('<stdin>',domain_has_elements) ).
fof(c_0_7,plain,
! [X1,X2] :
( ~ equalish(X2,f1(X2,X1))
| ~ equalish(X1,f1(X2,X1))
| equalish(X2,X1) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_8,axiom,
! [X1,X2] :
( equalish(X2,f1(X2,X1))
| equalish(X1,f1(X2,X1))
| equalish(X2,X1) ),
c_0_1 ).
fof(c_0_9,plain,
! [X1,X2] :
( ~ there_exists(domain(X2))
| ~ equalish(domain(X2),codomain(X1))
| there_exists(compose(X2,X1)) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_10,plain,
! [X3,X1,X2] :
( ~ equalish(X2,X1)
| ~ equalish(X1,X3)
| equalish(X2,X3) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_11,axiom,
! [X1,X2] :
( there_exists(f1(X2,X1))
| equalish(X2,X1) ),
c_0_4 ).
fof(c_0_12,plain,
! [X1,X2] :
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_13,plain,
! [X2] :
( ~ there_exists(domain(X2))
| there_exists(X2) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_14,plain,
! [X3,X4] :
( ~ equalish(X4,f1(X4,X3))
| ~ equalish(X3,f1(X4,X3))
| equalish(X4,X3) ),
inference(variable_rename,[status(thm)],[c_0_7]) ).
fof(c_0_15,plain,
! [X3,X4] :
( equalish(X4,f1(X4,X3))
| equalish(X3,f1(X4,X3))
| equalish(X4,X3) ),
inference(variable_rename,[status(thm)],[c_0_8]) ).
fof(c_0_16,plain,
! [X3,X4] :
( ~ there_exists(domain(X4))
| ~ equalish(domain(X4),codomain(X3))
| there_exists(compose(X4,X3)) ),
inference(variable_rename,[status(thm)],[c_0_9]) ).
fof(c_0_17,plain,
! [X4,X5,X6] :
( ~ equalish(X6,X5)
| ~ equalish(X5,X4)
| equalish(X6,X4) ),
inference(variable_rename,[status(thm)],[c_0_10]) ).
fof(c_0_18,plain,
! [X3,X4] :
( there_exists(f1(X4,X3))
| equalish(X4,X3) ),
inference(variable_rename,[status(thm)],[c_0_11]) ).
fof(c_0_19,plain,
! [X3,X4] :
( ~ equalish(X4,X3)
| equalish(X3,X4) ),
inference(variable_rename,[status(thm)],[c_0_12]) ).
fof(c_0_20,plain,
! [X3] :
( ~ there_exists(domain(X3))
| there_exists(X3) ),
inference(variable_rename,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
( equalish(X1,X2)
| ~ equalish(X2,f1(X1,X2))
| ~ equalish(X1,f1(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,plain,
( equalish(X1,X2)
| equalish(X2,f1(X1,X2))
| equalish(X1,f1(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,plain,
( there_exists(compose(X1,X2))
| ~ equalish(domain(X1),codomain(X2))
| ~ there_exists(domain(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
( equalish(X1,X2)
| ~ equalish(X3,X2)
| ~ equalish(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,plain,
( equalish(X1,X2)
| there_exists(f1(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,plain,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,plain,
( there_exists(X1)
| ~ there_exists(domain(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,plain,
( equalish(X1,X2)
| ~ equalish(X2,f1(X1,X2))
| ~ equalish(X1,f1(X1,X2)) ),
c_0_21,
[final] ).
cnf(c_0_29,plain,
( equalish(X1,X2)
| equalish(X2,f1(X1,X2))
| equalish(X1,f1(X1,X2)) ),
c_0_22,
[final] ).
cnf(c_0_30,plain,
( there_exists(compose(X1,X2))
| ~ equalish(domain(X1),codomain(X2))
| ~ there_exists(domain(X1)) ),
c_0_23,
[final] ).
cnf(c_0_31,plain,
( equalish(X1,X2)
| ~ equalish(X3,X2)
| ~ equalish(X1,X3) ),
c_0_24,
[final] ).
cnf(c_0_32,plain,
( equalish(X1,X2)
| there_exists(f1(X1,X2)) ),
c_0_25,
[final] ).
cnf(c_0_33,plain,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
c_0_26,
[final] ).
cnf(c_0_34,plain,
( there_exists(X1)
| ~ there_exists(domain(X1)) ),
c_0_27,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_28_0,axiom,
( equalish(X1,X2)
| ~ equalish(X2,f1(X1,X2))
| ~ equalish(X1,f1(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_28]) ).
cnf(c_0_28_1,axiom,
( ~ equalish(X2,f1(X1,X2))
| equalish(X1,X2)
| ~ equalish(X1,f1(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_28]) ).
cnf(c_0_28_2,axiom,
( ~ equalish(X1,f1(X1,X2))
| ~ equalish(X2,f1(X1,X2))
| equalish(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_28]) ).
cnf(c_0_29_0,axiom,
( equalish(X1,X2)
| equalish(X2,f1(X1,X2))
| equalish(X1,f1(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_29]) ).
cnf(c_0_29_1,axiom,
( equalish(X2,f1(X1,X2))
| equalish(X1,X2)
| equalish(X1,f1(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_29]) ).
cnf(c_0_29_2,axiom,
( equalish(X1,f1(X1,X2))
| equalish(X2,f1(X1,X2))
| equalish(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_29]) ).
cnf(c_0_30_0,axiom,
( there_exists(compose(X1,X2))
| ~ equalish(domain(X1),codomain(X2))
| ~ there_exists(domain(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_30]) ).
cnf(c_0_30_1,axiom,
( ~ equalish(domain(X1),codomain(X2))
| there_exists(compose(X1,X2))
| ~ there_exists(domain(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_30]) ).
cnf(c_0_30_2,axiom,
( ~ there_exists(domain(X1))
| ~ equalish(domain(X1),codomain(X2))
| there_exists(compose(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_30]) ).
cnf(c_0_31_0,axiom,
( equalish(X1,X2)
| ~ equalish(X3,X2)
| ~ equalish(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_31]) ).
cnf(c_0_31_1,axiom,
( ~ equalish(X3,X2)
| equalish(X1,X2)
| ~ equalish(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_31]) ).
cnf(c_0_31_2,axiom,
( ~ equalish(X1,X3)
| ~ equalish(X3,X2)
| equalish(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_31]) ).
cnf(c_0_32_0,axiom,
( equalish(X1,X2)
| there_exists(f1(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_32]) ).
cnf(c_0_32_1,axiom,
( there_exists(f1(X1,X2))
| equalish(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_32]) ).
cnf(c_0_33_0,axiom,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_33]) ).
cnf(c_0_33_1,axiom,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_33]) ).
cnf(c_0_34_0,axiom,
( there_exists(X1)
| ~ there_exists(domain(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_34]) ).
cnf(c_0_34_1,axiom,
( ~ there_exists(domain(X1))
| there_exists(X1) ),
inference(literals_permutation,[status(thm)],[c_0_34]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_006,negated_conjecture,
~ there_exists(compose(c2,c1)),
file('<stdin>',prove_c1_c2_is_defined) ).
fof(c_0_1_007,hypothesis,
equalish(domain(c2),codomain(c1)),
file('<stdin>',domain_of_c2_equals_codomain_of_c1) ).
fof(c_0_2_008,hypothesis,
there_exists(domain(c1)),
file('<stdin>',domain_of_c1_exists) ).
fof(c_0_3_009,hypothesis,
there_exists(domain(c2)),
file('<stdin>',domain_of_c2_exists) ).
fof(c_0_4_010,negated_conjecture,
~ there_exists(compose(c2,c1)),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_5_011,hypothesis,
equalish(domain(c2),codomain(c1)),
c_0_1 ).
fof(c_0_6_012,hypothesis,
there_exists(domain(c1)),
c_0_2 ).
fof(c_0_7_013,hypothesis,
there_exists(domain(c2)),
c_0_3 ).
fof(c_0_8_014,negated_conjecture,
~ there_exists(compose(c2,c1)),
c_0_4 ).
fof(c_0_9_015,hypothesis,
equalish(domain(c2),codomain(c1)),
c_0_5 ).
fof(c_0_10_016,hypothesis,
there_exists(domain(c1)),
c_0_6 ).
fof(c_0_11_017,hypothesis,
there_exists(domain(c2)),
c_0_7 ).
cnf(c_0_12_018,negated_conjecture,
~ there_exists(compose(c2,c1)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13_019,hypothesis,
equalish(domain(c2),codomain(c1)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14_020,hypothesis,
there_exists(domain(c1)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15_021,hypothesis,
there_exists(domain(c2)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16_022,negated_conjecture,
~ there_exists(compose(c2,c1)),
c_0_12,
[final] ).
cnf(c_0_17_023,hypothesis,
equalish(domain(c2),codomain(c1)),
c_0_13,
[final] ).
cnf(c_0_18_024,hypothesis,
there_exists(domain(c1)),
c_0_14,
[final] ).
cnf(c_0_19_025,hypothesis,
there_exists(domain(c2)),
c_0_15,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_6,plain,
( ~ there_exists(domain(X0))
| ~ equalish(domain(X0),codomain(X1))
| there_exists(compose(X0,X1)) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_c410e8.p',c_0_30_0) ).
cnf(c_53,plain,
( ~ there_exists(domain(X0))
| ~ equalish(domain(X0),codomain(X1))
| there_exists(compose(X0,X1)) ),
inference(copy,[status(esa)],[c_6]) ).
cnf(c_189164,plain,
( ~ equalish(domain(c2),codomain(c1))
| there_exists(compose(c2,c1))
| ~ there_exists(domain(c2)) ),
inference(instantiation,[status(thm)],[c_53]) ).
cnf(c_20,plain,
equalish(domain(c2),codomain(c1)),
file('/export/starexec/sandbox/tmp/iprover_modulo_c410e8.p',c_0_17) ).
cnf(c_22,plain,
there_exists(domain(c2)),
file('/export/starexec/sandbox/tmp/iprover_modulo_c410e8.p',c_0_19) ).
cnf(c_19,negated_conjecture,
~ there_exists(compose(c2,c1)),
file('/export/starexec/sandbox/tmp/iprover_modulo_c410e8.p',c_0_16) ).
cnf(contradiction,plain,
$false,
inference(minisat,[status(thm)],[c_189164,c_20,c_22,c_19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : CAT007-3 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : iprover_modulo %s %d
% 0.14/0.34 % Computer : n024.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sun May 29 16:07:51 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.35 % Running in mono-core mode
% 0.21/0.41 % Orienting using strategy Equiv(ClausalAll)
% 0.21/0.41 % Orientation found
% 0.21/0.41 % 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/sandbox/tmp/iprover_proof_808803.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_c410e8.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_58bf6b | grep -v "SZS"
% 0.21/0.44
% 0.21/0.44 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.21/0.44
% 0.21/0.44 %
% 0.21/0.44 % ------ iProver source info
% 0.21/0.44
% 0.21/0.44 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.21/0.44 % git: non_committed_changes: true
% 0.21/0.44 % git: last_make_outside_of_git: true
% 0.21/0.44
% 0.21/0.44 %
% 0.21/0.44 % ------ Input Options
% 0.21/0.44
% 0.21/0.44 % --out_options all
% 0.21/0.44 % --tptp_safe_out true
% 0.21/0.44 % --problem_path ""
% 0.21/0.44 % --include_path ""
% 0.21/0.44 % --clausifier .//eprover
% 0.21/0.44 % --clausifier_options --tstp-format
% 0.21/0.44 % --stdin false
% 0.21/0.44 % --dbg_backtrace false
% 0.21/0.44 % --dbg_dump_prop_clauses false
% 0.21/0.44 % --dbg_dump_prop_clauses_file -
% 0.21/0.44 % --dbg_out_stat false
% 0.21/0.44
% 0.21/0.44 % ------ General Options
% 0.21/0.44
% 0.21/0.44 % --fof false
% 0.21/0.44 % --time_out_real 150.
% 0.21/0.44 % --time_out_prep_mult 0.2
% 0.21/0.44 % --time_out_virtual -1.
% 0.21/0.44 % --schedule none
% 0.21/0.44 % --ground_splitting input
% 0.21/0.44 % --splitting_nvd 16
% 0.21/0.44 % --non_eq_to_eq false
% 0.21/0.44 % --prep_gs_sim true
% 0.21/0.44 % --prep_unflatten false
% 0.21/0.44 % --prep_res_sim true
% 0.21/0.44 % --prep_upred true
% 0.21/0.44 % --res_sim_input true
% 0.21/0.44 % --clause_weak_htbl true
% 0.21/0.44 % --gc_record_bc_elim false
% 0.21/0.44 % --symbol_type_check false
% 0.21/0.44 % --clausify_out false
% 0.21/0.44 % --large_theory_mode false
% 0.21/0.44 % --prep_sem_filter none
% 0.21/0.44 % --prep_sem_filter_out false
% 0.21/0.44 % --preprocessed_out false
% 0.21/0.44 % --sub_typing false
% 0.21/0.44 % --brand_transform false
% 0.21/0.44 % --pure_diseq_elim true
% 0.21/0.44 % --min_unsat_core false
% 0.21/0.44 % --pred_elim true
% 0.21/0.44 % --add_important_lit false
% 0.21/0.44 % --soft_assumptions false
% 0.21/0.44 % --reset_solvers false
% 0.21/0.44 % --bc_imp_inh []
% 0.21/0.44 % --conj_cone_tolerance 1.5
% 0.21/0.44 % --prolific_symb_bound 500
% 0.21/0.44 % --lt_threshold 2000
% 0.21/0.44
% 0.21/0.44 % ------ SAT Options
% 0.21/0.44
% 0.21/0.44 % --sat_mode false
% 0.21/0.44 % --sat_fm_restart_options ""
% 0.21/0.44 % --sat_gr_def false
% 0.21/0.44 % --sat_epr_types true
% 0.21/0.44 % --sat_non_cyclic_types false
% 0.21/0.44 % --sat_finite_models false
% 0.21/0.44 % --sat_fm_lemmas false
% 0.21/0.44 % --sat_fm_prep false
% 0.21/0.44 % --sat_fm_uc_incr true
% 0.21/0.44 % --sat_out_model small
% 0.21/0.44 % --sat_out_clauses false
% 0.21/0.44
% 0.21/0.44 % ------ QBF Options
% 0.21/0.44
% 0.21/0.44 % --qbf_mode false
% 0.21/0.44 % --qbf_elim_univ true
% 0.21/0.44 % --qbf_sk_in true
% 0.21/0.44 % --qbf_pred_elim true
% 0.21/0.44 % --qbf_split 32
% 0.21/0.44
% 0.21/0.44 % ------ BMC1 Options
% 0.21/0.44
% 0.21/0.44 % --bmc1_incremental false
% 0.21/0.44 % --bmc1_axioms reachable_all
% 0.21/0.44 % --bmc1_min_bound 0
% 0.21/0.44 % --bmc1_max_bound -1
% 0.21/0.44 % --bmc1_max_bound_default -1
% 0.21/0.44 % --bmc1_symbol_reachability true
% 0.21/0.44 % --bmc1_property_lemmas false
% 0.21/0.44 % --bmc1_k_induction false
% 0.21/0.44 % --bmc1_non_equiv_states false
% 0.21/0.44 % --bmc1_deadlock false
% 0.21/0.44 % --bmc1_ucm false
% 0.21/0.44 % --bmc1_add_unsat_core none
% 0.21/0.44 % --bmc1_unsat_core_children false
% 0.21/0.44 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.44 % --bmc1_out_stat full
% 0.21/0.44 % --bmc1_ground_init false
% 0.21/0.44 % --bmc1_pre_inst_next_state false
% 0.21/0.44 % --bmc1_pre_inst_state false
% 0.21/0.44 % --bmc1_pre_inst_reach_state false
% 0.21/0.44 % --bmc1_out_unsat_core false
% 0.21/0.44 % --bmc1_aig_witness_out false
% 0.21/0.44 % --bmc1_verbose false
% 0.21/0.44 % --bmc1_dump_clauses_tptp false
% 0.21/0.44 % --bmc1_dump_unsat_core_tptp false
% 0.21/0.44 % --bmc1_dump_file -
% 0.21/0.44 % --bmc1_ucm_expand_uc_limit 128
% 0.21/0.44 % --bmc1_ucm_n_expand_iterations 6
% 0.21/0.44 % --bmc1_ucm_extend_mode 1
% 0.21/0.44 % --bmc1_ucm_init_mode 2
% 0.21/0.44 % --bmc1_ucm_cone_mode none
% 0.21/0.44 % --bmc1_ucm_reduced_relation_type 0
% 0.21/0.44 % --bmc1_ucm_relax_model 4
% 0.21/0.44 % --bmc1_ucm_full_tr_after_sat true
% 0.21/0.44 % --bmc1_ucm_expand_neg_assumptions false
% 0.21/0.44 % --bmc1_ucm_layered_model none
% 0.21/0.44 % --bmc1_ucm_max_lemma_size 10
% 0.21/0.44
% 0.21/0.44 % ------ AIG Options
% 0.21/0.44
% 0.21/0.44 % --aig_mode false
% 0.21/0.44
% 0.21/0.44 % ------ Instantiation Options
% 0.21/0.44
% 0.21/0.44 % --instantiation_flag true
% 0.21/0.44 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.44 % --inst_solver_per_active 750
% 0.21/0.44 % --inst_solver_calls_frac 0.5
% 0.21/0.44 % --inst_passive_queue_type priority_queues
% 0.21/0.44 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.44 % --inst_passive_queues_freq [25;2]
% 0.21/0.44 % --inst_dismatching true
% 0.21/0.44 % --inst_eager_unprocessed_to_passive true
% 0.21/0.44 % --inst_prop_sim_given true
% 0.21/0.44 % --inst_prop_sim_new false
% 0.21/0.44 % --inst_orphan_elimination true
% 0.21/0.44 % --inst_learning_loop_flag true
% 0.21/0.44 % --inst_learning_start 3000
% 0.21/0.44 % --inst_learning_factor 2
% 0.21/0.44 % --inst_start_prop_sim_after_learn 3
% 0.21/0.44 % --inst_sel_renew solver
% 0.21/0.44 % --inst_lit_activity_flag true
% 0.21/0.44 % --inst_out_proof true
% 0.21/0.44
% 0.21/0.44 % ------ Resolution Options
% 0.21/0.44
% 0.21/0.44 % --resolution_flag true
% 0.21/0.44 % --res_lit_sel kbo_max
% 0.21/0.44 % --res_to_prop_solver none
% 0.21/0.44 % --res_prop_simpl_new false
% 0.21/0.44 % --res_prop_simpl_given false
% 0.21/0.44 % --res_passive_queue_type priority_queues
% 0.21/0.44 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.21/0.44 % --res_passive_queues_freq [15;5]
% 0.21/0.44 % --res_forward_subs full
% 0.21/0.44 % --res_backward_subs full
% 0.21/0.44 % --res_forward_subs_resolution true
% 0.21/0.44 % --res_backward_subs_resolution true
% 0.21/0.44 % --res_orphan_elimination false
% 0.21/0.44 % --res_time_limit 1000.
% 0.21/0.44 % --res_out_proof true
% 0.21/0.44 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_808803.s
% 0.21/0.44 % --modulo true
% 0.21/0.44
% 0.21/0.44 % ------ Combination Options
% 0.21/0.44
% 0.21/0.44 % --comb_res_mult 1000
% 0.21/0.44 % --comb_inst_mult 300
% 0.21/0.44 % ------
% 0.21/0.44
% 0.21/0.44 % ------ Parsing...% successful
% 0.21/0.44
% 0.21/0.44 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe:1:0s pe_e snvd_s sp: 0 0s snvd_e %
% 0.21/0.44
% 0.21/0.44 % ------ Proving...
% 0.21/0.44 % ------ Problem Properties
% 0.21/0.44
% 0.21/0.44 %
% 0.21/0.44 % EPR false
% 0.21/0.44 % Horn false
% 0.21/0.44 % Has equality false
% 0.21/0.44
% 0.21/0.44 % % ------ Input Options Time Limit: Unbounded
% 0.21/0.44
% 0.21/0.44
% 0.21/0.44 % % ------ Current options:
% 0.21/0.44
% 0.21/0.44 % ------ Input Options
% 0.21/0.44
% 0.21/0.44 % --out_options all
% 0.21/0.44 % --tptp_safe_out true
% 0.21/0.44 % --problem_path ""
% 0.21/0.44 % --include_path ""
% 0.21/0.44 % --clausifier .//eprover
% 0.21/0.44 % --clausifier_options --tstp-format
% 0.21/0.44 % --stdin false
% 0.21/0.44 % --dbg_backtrace false
% 0.21/0.44 % --dbg_dump_prop_clauses false
% 0.21/0.44 % --dbg_dump_prop_clauses_file -
% 0.21/0.44 % --dbg_out_stat false
% 0.21/0.44
% 0.21/0.44 % ------ General Options
% 0.21/0.44
% 0.21/0.44 % --fof false
% 0.21/0.44 % --time_out_real 150.
% 0.21/0.44 % --time_out_prep_mult 0.2
% 0.21/0.44 % --time_out_virtual -1.
% 0.21/0.44 % --schedule none
% 0.21/0.44 % --ground_splitting input
% 0.21/0.44 % --splitting_nvd 16
% 0.21/0.44 % --non_eq_to_eq false
% 0.21/0.44 % --prep_gs_sim true
% 0.21/0.44 % --prep_unflatten false
% 0.21/0.44 % --prep_res_sim true
% 0.21/0.44 % --prep_upred true
% 0.21/0.44 % --res_sim_input true
% 0.21/0.44 % --clause_weak_htbl true
% 0.21/0.44 % --gc_record_bc_elim false
% 0.21/0.44 % --symbol_type_check false
% 0.21/0.44 % --clausify_out false
% 0.21/0.44 % --large_theory_mode false
% 0.21/0.44 % --prep_sem_filter none
% 0.21/0.44 % --prep_sem_filter_out false
% 0.21/0.44 % --preprocessed_out false
% 0.21/0.44 % --sub_typing false
% 0.21/0.44 % --brand_transform false
% 0.21/0.44 % --pure_diseq_elim true
% 0.21/0.44 % --min_unsat_core false
% 0.21/0.44 % --pred_elim true
% 0.21/0.44 % --add_important_lit false
% 0.21/0.44 % --soft_assumptions false
% 0.21/0.44 % --reset_solvers false
% 0.21/0.44 % --bc_imp_inh []
% 0.21/0.44 % --conj_cone_tolerance 1.5
% 0.21/0.44 % --prolific_symb_bound 500
% 0.21/0.44 % --lt_threshold 2000
% 0.21/0.44
% 0.21/0.44 % ------ SAT Options
% 0.21/0.44
% 0.21/0.44 % --sat_mode false
% 0.21/0.44 % --sat_fm_restart_options ""
% 0.21/0.44 % --sat_gr_def false
% 0.21/0.44 % --sat_epr_types true
% 0.21/0.44 % --sat_non_cyclic_types false
% 0.21/0.44 % --sat_finite_models false
% 0.21/0.44 % --sat_fm_lemmas false
% 0.21/0.44 % --sat_fm_prep false
% 0.21/0.44 % --sat_fm_uc_incr true
% 0.21/0.44 % --sat_out_model small
% 0.21/0.44 % --sat_out_clauses false
% 0.21/0.44
% 0.21/0.44 % ------ QBF Options
% 0.21/0.44
% 0.21/0.44 % --qbf_mode false
% 0.21/0.44 % --qbf_elim_univ true
% 0.21/0.44 % --qbf_sk_in true
% 0.21/0.44 % --qbf_pred_elim true
% 0.21/0.44 % --qbf_split 32
% 0.21/0.44
% 0.21/0.44 % ------ BMC1 Options
% 0.21/0.44
% 0.21/0.44 % --bmc1_incremental false
% 0.21/0.44 % --bmc1_axioms reachable_all
% 0.21/0.44 % --bmc1_min_bound 0
% 0.21/0.44 % --bmc1_max_bound -1
% 0.21/0.44 % --bmc1_max_bound_default -1
% 0.21/0.44 % --bmc1_symbol_reachability true
% 0.21/0.44 % --bmc1_property_lemmas false
% 0.21/0.44 % --bmc1_k_induction false
% 0.21/0.44 % --bmc1_non_equiv_states false
% 0.21/0.44 % --bmc1_deadlock false
% 0.21/0.44 % --bmc1_ucm false
% 0.21/0.44 % --bmc1_add_unsat_core none
% 0.21/0.44 % --bmc1_unsat_core_children false
% 0.21/0.44 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.44 % --bmc1_out_stat full
% 0.21/0.44 % --bmc1_ground_init false
% 0.21/0.44 % --bmc1_pre_inst_next_state false
% 0.21/0.44 % --bmc1_pre_inst_state false
% 0.21/0.44 % --bmc1_pre_inst_reach_state false
% 0.21/0.44 % --bmc1_out_unsat_core false
% 0.21/0.44 % --bmc1_aig_witness_out false
% 0.21/0.44 % --bmc1_verbose false
% 0.21/0.44 % --bmc1_dump_clauses_tptp false
% 0.21/0.44 % --bmc1_dump_unsat_core_tptp false
% 0.21/0.44 % --bmc1_dump_file -
% 0.21/0.44 % --bmc1_ucm_expand_uc_limit 128
% 0.21/0.44 % --bmc1_ucm_n_expand_iterations 6
% 0.21/0.44 % --bmc1_ucm_extend_mode 1
% 0.21/0.44 % --bmc1_ucm_init_mode 2
% 0.21/0.44 % --bmc1_ucm_cone_mode none
% 0.21/0.44 % --bmc1_ucm_reduced_relation_type 0
% 0.21/0.44 % --bmc1_ucm_relax_model 4
% 0.21/0.44 % --bmc1_ucm_full_tr_after_sat true
% 0.21/0.44 % --bmc1_ucm_expand_neg_assumptions false
% 0.21/0.44 % --bmc1_ucm_layered_model none
% 0.21/0.44 % --bmc1_ucm_max_lemma_size 10
% 0.21/0.44
% 0.21/0.44 % ------ AIG Options
% 0.21/0.44
% 0.21/0.44 % --aig_mode false
% 0.21/0.44
% 0.21/0.44 % ------ Instantiation Options
% 0.21/0.44
% 0.21/0.44 % --instantiation_flag true
% 0.21/0.44 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.44 % --inst_solver_per_active 750
% 0.21/0.44 % --inst_solver_calls_frac 0.5
% 0.21/0.44 % --inst_passive_queue_type priority_queues
% 0.21/0.44 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.44 % --inst_passive_queues_freq [25;2]
% 0.21/0.44 % --inst_dismatching true
% 0.21/0.44 % --inst_eager_unprocessed_to_passive true
% 0.21/0.44 % --inst_prop_sim_given true
% 6.48/6.67 % --inst_prop_sim_new false
% 6.48/6.67 % --inst_orphan_elimination true
% 6.48/6.67 % --inst_learning_loop_flag true
% 6.48/6.67 % --inst_learning_start 3000
% 6.48/6.67 % --inst_learning_factor 2
% 6.48/6.67 % --inst_start_prop_sim_after_learn 3
% 6.48/6.67 % --inst_sel_renew solver
% 6.48/6.67 % --inst_lit_activity_flag true
% 6.48/6.67 % --inst_out_proof true
% 6.48/6.67
% 6.48/6.67 % ------ Resolution Options
% 6.48/6.67
% 6.48/6.67 % --resolution_flag true
% 6.48/6.67 % --res_lit_sel kbo_max
% 6.48/6.67 % --res_to_prop_solver none
% 6.48/6.67 % --res_prop_simpl_new false
% 6.48/6.67 % --res_prop_simpl_given false
% 6.48/6.67 % --res_passive_queue_type priority_queues
% 6.48/6.67 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 6.48/6.67 % --res_passive_queues_freq [15;5]
% 6.48/6.67 % --res_forward_subs full
% 6.48/6.67 % --res_backward_subs full
% 6.48/6.67 % --res_forward_subs_resolution true
% 6.48/6.67 % --res_backward_subs_resolution true
% 6.48/6.67 % --res_orphan_elimination false
% 6.48/6.67 % --res_time_limit 1000.
% 6.48/6.67 % --res_out_proof true
% 6.48/6.67 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_808803.s
% 6.48/6.67 % --modulo true
% 6.48/6.67
% 6.48/6.67 % ------ Combination Options
% 6.48/6.67
% 6.48/6.67 % --comb_res_mult 1000
% 6.48/6.67 % --comb_inst_mult 300
% 6.48/6.67 % ------
% 6.48/6.67
% 6.48/6.67
% 6.48/6.67
% 6.48/6.67 % ------ Proving...
% 6.48/6.67 %
% 6.48/6.67
% 6.48/6.67
% 6.48/6.67 % ------ Statistics
% 6.48/6.67
% 6.48/6.67 % ------ General
% 6.48/6.67
% 6.48/6.67 % num_of_input_clauses: 23
% 6.48/6.67 % num_of_input_neg_conjectures: 1
% 6.48/6.67 % num_of_splits: 0
% 6.48/6.67 % num_of_split_atoms: 0
% 6.48/6.67 % num_of_sem_filtered_clauses: 0
% 6.48/6.67 % num_of_subtypes: 0
% 6.48/6.67 % monotx_restored_types: 0
% 6.48/6.67 % sat_num_of_epr_types: 0
% 6.48/6.67 % sat_num_of_non_cyclic_types: 0
% 6.48/6.67 % sat_guarded_non_collapsed_types: 0
% 6.48/6.67 % is_epr: 0
% 6.48/6.67 % is_horn: 0
% 6.48/6.67 % has_eq: 0
% 6.48/6.67 % num_pure_diseq_elim: 0
% 6.48/6.67 % simp_replaced_by: 0
% 6.48/6.67 % res_preprocessed: 5
% 6.48/6.67 % prep_upred: 0
% 6.48/6.67 % prep_unflattend: 0
% 6.48/6.67 % pred_elim_cands: 1
% 6.48/6.67 % pred_elim: 1
% 6.48/6.67 % pred_elim_cl: 1
% 6.48/6.67 % pred_elim_cycles: 2
% 6.48/6.67 % forced_gc_time: 0
% 6.48/6.67 % gc_basic_clause_elim: 0
% 6.48/6.67 % parsing_time: 0.
% 6.48/6.67 % sem_filter_time: 0.
% 6.48/6.67 % pred_elim_time: 0.
% 6.48/6.67 % out_proof_time: 0.
% 6.48/6.67 % monotx_time: 0.
% 6.48/6.67 % subtype_inf_time: 0.
% 6.48/6.67 % unif_index_cands_time: 0.016
% 6.48/6.67 % unif_index_add_time: 0.002
% 6.48/6.67 % total_time: 6.254
% 6.48/6.67 % num_of_symbols: 33
% 6.48/6.67 % num_of_terms: 7125
% 6.48/6.67
% 6.48/6.67 % ------ Propositional Solver
% 6.48/6.67
% 6.48/6.67 % prop_solver_calls: 3
% 6.48/6.67 % prop_fast_solver_calls: 9
% 6.48/6.67 % prop_num_of_clauses: 29
% 6.48/6.67 % prop_preprocess_simplified: 141
% 6.48/6.67 % prop_fo_subsumed: 0
% 6.48/6.67 % prop_solver_time: 0.
% 6.48/6.67 % prop_fast_solver_time: 0.
% 6.48/6.67 % prop_unsat_core_time: 0.
% 6.48/6.67
% 6.48/6.67 % ------ QBF
% 6.48/6.67
% 6.48/6.67 % qbf_q_res: 0
% 6.48/6.67 % qbf_num_tautologies: 0
% 6.48/6.67 % qbf_prep_cycles: 0
% 6.48/6.67
% 6.48/6.67 % ------ BMC1
% 6.48/6.67
% 6.48/6.67 % bmc1_current_bound: -1
% 6.48/6.67 % bmc1_last_solved_bound: -1
% 6.48/6.67 % bmc1_unsat_core_size: -1
% 6.48/6.67 % bmc1_unsat_core_parents_size: -1
% 6.48/6.67 % bmc1_merge_next_fun: 0
% 6.48/6.67 % bmc1_unsat_core_clauses_time: 0.
% 6.48/6.67
% 6.48/6.67 % ------ Instantiation
% 6.48/6.67
% 6.48/6.67 % inst_num_of_clauses: 30
% 6.48/6.67 % inst_num_in_passive: 6
% 6.48/6.67 % inst_num_in_active: 21
% 6.48/6.67 % inst_num_in_unprocessed: 1
% 6.48/6.67 % inst_num_of_loops: 27
% 6.48/6.67 % inst_num_of_learning_restarts: 0
% 6.48/6.68 % inst_num_moves_active_passive: 3
% 6.48/6.68 % inst_lit_activity: 15
% 6.48/6.68 % inst_lit_activity_moves: 0
% 6.48/6.68 % inst_num_tautologies: 0
% 6.48/6.68 % inst_num_prop_implied: 0
% 6.48/6.68 % inst_num_existing_simplified: 0
% 6.48/6.68 % inst_num_eq_res_simplified: 0
% 6.48/6.68 % inst_num_child_elim: 0
% 6.48/6.68 % inst_num_of_dismatching_blockings: 0
% 6.48/6.68 % inst_num_of_non_proper_insts: 12
% 6.48/6.68 % inst_num_of_duplicates: 10
% 6.48/6.68 % inst_inst_num_from_inst_to_res: 0
% 6.48/6.68 % inst_dismatching_checking_time: 0.
% 6.48/6.68
% 6.48/6.68 % ------ Resolution
% 6.48/6.68
% 6.48/6.68 % res_num_of_clauses: 62333
% 6.48/6.68 % res_num_in_passive: 62071
% 6.48/6.68 % res_num_in_active: 584
% 6.48/6.68 % res_num_of_loops: 1000
% 6.48/6.68 % res_forward_subset_subsumed: 19306
% 6.48/6.68 % res_backward_subset_subsumed: 374
% 6.48/6.68 % res_forward_subsumed: 387
% 6.48/6.68 % res_backward_subsumed: 15
% 6.48/6.68 % res_forward_subsumption_resolution: 93
% 6.48/6.68 % res_backward_subsumption_resolution: 10
% 6.48/6.68 % res_clause_to_clause_subsumption: 78429
% 6.48/6.68 % res_orphan_elimination: 0
% 6.48/6.68 % res_tautology_del: 9331
% 6.48/6.68 % res_num_eq_res_simplified: 0
% 6.48/6.68 % res_num_sel_changes: 0
% 6.48/6.68 % res_moves_from_active_to_pass: 0
% 6.48/6.68
% 6.48/6.68 % Status Unsatisfiable
% 6.48/6.68 % SZS status Unsatisfiable
% 6.48/6.68 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------