TSTP Solution File: SYN386+1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SYN386+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n015.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 : Thu Jul 21 07:27:20 EDT 2022
% Result : Theorem 0.20s 0.43s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 60 ( 37 unt; 0 def)
% Number of atoms : 125 ( 0 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 117 ( 52 ~; 42 |; 11 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 2 con; 0-2 aty)
% Number of variables : 180 ( 20 sgn 32 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
% Axioms transformation by autotheo
% Orienting (remaining) axiom formulas using strategy Equiv(ClausalAll)
% Orienting axioms whose shape is orientable
% Start CNF derivation
% End CNF derivation
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0,conjecture,
( ( ! [X1] :
? [X2] : big_f(X1,X2)
& ? [X1] :
! [X3] :
? [X4] :
! [X5] :
( big_s(X4,X5)
=> big_d(X5,X1,X3) )
& ! [X3] :
? [X6] :
! [X7,X8] :
( big_d(X7,X8,X6)
=> ! [X2,X9] :
( ( big_f(X7,X2)
& big_f(X8,X9) )
=> big_d(X2,X9,X3) ) ) )
=> ? [X2] :
! [X3] :
? [X10] :
! [X5] :
( big_s(X10,X5)
=> ! [X9] :
( big_f(X5,X9)
=> big_d(X9,X2,X3) ) ) ),
file('<stdin>',x2138) ).
fof(c_0_1,negated_conjecture,
~ ( ( ! [X1] :
? [X2] : big_f(X1,X2)
& ? [X1] :
! [X3] :
? [X4] :
! [X5] :
( big_s(X4,X5)
=> big_d(X5,X1,X3) )
& ! [X3] :
? [X6] :
! [X7,X8] :
( big_d(X7,X8,X6)
=> ! [X2,X9] :
( ( big_f(X7,X2)
& big_f(X8,X9) )
=> big_d(X2,X9,X3) ) ) )
=> ? [X2] :
! [X3] :
? [X10] :
! [X5] :
( big_s(X10,X5)
=> ! [X9] :
( big_f(X5,X9)
=> big_d(X9,X2,X3) ) ) ),
inference(assume_negation,[status(cth)],[c_0_0]) ).
fof(c_0_2,negated_conjecture,
! [X11,X14,X16,X17,X19,X20,X21,X22,X23,X25] :
( big_f(X11,esk1_1(X11))
& ( ~ big_s(esk3_1(X14),X16)
| big_d(X16,esk2_0,X14) )
& ( ~ big_d(X19,X20,esk4_1(X17))
| ~ big_f(X19,X21)
| ~ big_f(X20,X22)
| big_d(X21,X22,X17) )
& big_s(X25,esk6_2(X23,X25))
& big_f(esk6_2(X23,X25),esk7_2(X23,X25))
& ~ big_d(esk7_2(X23,X25),X23,esk5_1(X23)) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])]) ).
cnf(c_0_3,negated_conjecture,
( big_d(X1,X2,X3)
| ~ big_f(X4,X2)
| ~ big_f(X5,X1)
| ~ big_d(X5,X4,esk4_1(X3)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
~ big_d(esk7_2(X1,X2),X1,esk5_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
( big_d(X1,esk2_0,X2)
| ~ big_s(esk3_1(X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
big_f(esk6_2(X1,X2),esk7_2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7,negated_conjecture,
big_s(X1,esk6_2(X2,X1)),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_8,negated_conjecture,
big_f(X1,esk1_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_9,negated_conjecture,
( big_d(X1,X2,X3)
| ~ big_f(X4,X2)
| ~ big_f(X5,X1)
| ~ big_d(X5,X4,esk4_1(X3)) ),
c_0_3,
[final] ).
cnf(c_0_10,negated_conjecture,
~ big_d(esk7_2(X1,X2),X1,esk5_1(X1)),
c_0_4,
[final] ).
cnf(c_0_11,negated_conjecture,
( big_d(X1,esk2_0,X2)
| ~ big_s(esk3_1(X2),X1) ),
c_0_5,
[final] ).
cnf(c_0_12,negated_conjecture,
big_f(esk6_2(X1,X2),esk7_2(X1,X2)),
c_0_6,
[final] ).
cnf(c_0_13,negated_conjecture,
big_s(X1,esk6_2(X2,X1)),
c_0_7,
[final] ).
cnf(c_0_14,negated_conjecture,
big_f(X1,esk1_1(X1)),
c_0_8,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_0,negated_conjecture,
( ~ big_d(X0,X1,sk3_esk4_1(X2))
| big_d(X3,X4,X2)
| ~ big_f(X0,X3)
| ~ big_f(X1,X4) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_83aff8.p',c_0_9) ).
cnf(c_12,negated_conjecture,
( ~ big_d(X0,X1,sk3_esk4_1(X2))
| big_d(X3,X4,X2)
| ~ big_f(X0,X3)
| ~ big_f(X1,X4) ),
inference(copy,[status(esa)],[c_0]) ).
cnf(c_36,negated_conjecture,
( ~ big_d(X0,X1,sk3_esk4_1(X2))
| big_d(X3,X4,X2)
| ~ big_f(X0,X3)
| ~ big_f(X1,X4) ),
inference(copy,[status(esa)],[c_12]) ).
cnf(c_47,negated_conjecture,
( ~ big_d(X0,X1,sk3_esk4_1(X2))
| big_d(X3,X4,X2)
| ~ big_f(X0,X3)
| ~ big_f(X1,X4) ),
inference(copy,[status(esa)],[c_36]) ).
cnf(c_48,negated_conjecture,
( ~ big_d(X0,X1,sk3_esk4_1(X2))
| big_d(X3,X4,X2)
| ~ big_f(X0,X3)
| ~ big_f(X1,X4) ),
inference(copy,[status(esa)],[c_47]) ).
cnf(c_60,negated_conjecture,
( ~ big_d(X0,X1,sk3_esk4_1(X2))
| big_d(X3,X4,X2)
| ~ big_f(X0,X3)
| ~ big_f(X1,X4) ),
inference(copy,[status(esa)],[c_48]) ).
cnf(c_5,negated_conjecture,
big_f(X0,sk3_esk1_1(X0)),
file('/export/starexec/sandbox/tmp/iprover_modulo_83aff8.p',c_0_14) ).
cnf(c_22,negated_conjecture,
big_f(X0,sk3_esk1_1(X0)),
inference(copy,[status(esa)],[c_5]) ).
cnf(c_41,negated_conjecture,
big_f(X0,sk3_esk1_1(X0)),
inference(copy,[status(esa)],[c_22]) ).
cnf(c_42,negated_conjecture,
big_f(X0,sk3_esk1_1(X0)),
inference(copy,[status(esa)],[c_41]) ).
cnf(c_53,negated_conjecture,
big_f(X0,sk3_esk1_1(X0)),
inference(copy,[status(esa)],[c_42]) ).
cnf(c_70,negated_conjecture,
big_f(X0,sk3_esk1_1(X0)),
inference(copy,[status(esa)],[c_53]) ).
cnf(c_96,plain,
( big_d(X0,sk3_esk1_1(X1),X2)
| ~ big_d(X3,X1,sk3_esk4_1(X2))
| ~ big_f(X3,X0) ),
inference(resolution,[status(thm)],[c_60,c_70]) ).
cnf(c_97,plain,
( big_d(X0,sk3_esk1_1(X1),X2)
| ~ big_d(X3,X1,sk3_esk4_1(X2))
| ~ big_f(X3,X0) ),
inference(rewriting,[status(thm)],[c_96]) ).
cnf(c_3,negated_conjecture,
big_f(sk3_esk6_2(X0,X1),sk3_esk7_2(X0,X1)),
file('/export/starexec/sandbox/tmp/iprover_modulo_83aff8.p',c_0_12) ).
cnf(c_18,negated_conjecture,
big_f(sk3_esk6_2(X0,X1),sk3_esk7_2(X0,X1)),
inference(copy,[status(esa)],[c_3]) ).
cnf(c_39,negated_conjecture,
big_f(sk3_esk6_2(X0,X1),sk3_esk7_2(X0,X1)),
inference(copy,[status(esa)],[c_18]) ).
cnf(c_44,negated_conjecture,
big_f(sk3_esk6_2(X0,X1),sk3_esk7_2(X0,X1)),
inference(copy,[status(esa)],[c_39]) ).
cnf(c_51,negated_conjecture,
big_f(sk3_esk6_2(X0,X1),sk3_esk7_2(X0,X1)),
inference(copy,[status(esa)],[c_44]) ).
cnf(c_66,negated_conjecture,
big_f(sk3_esk6_2(X0,X1),sk3_esk7_2(X0,X1)),
inference(copy,[status(esa)],[c_51]) ).
cnf(c_106,plain,
( big_d(sk3_esk7_2(X0,X1),sk3_esk1_1(X2),X3)
| ~ big_d(sk3_esk6_2(X0,X1),X2,sk3_esk4_1(X3)) ),
inference(resolution,[status(thm)],[c_97,c_66]) ).
cnf(c_107,plain,
( big_d(sk3_esk7_2(X0,X1),sk3_esk1_1(X2),X3)
| ~ big_d(sk3_esk6_2(X0,X1),X2,sk3_esk4_1(X3)) ),
inference(rewriting,[status(thm)],[c_106]) ).
cnf(c_1,negated_conjecture,
( big_d(X0,sk3_esk2_0,X1)
| ~ big_s(sk3_esk3_1(X1),X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_83aff8.p',c_0_11) ).
cnf(c_14,negated_conjecture,
( big_d(X0,sk3_esk2_0,X1)
| ~ big_s(sk3_esk3_1(X1),X0) ),
inference(copy,[status(esa)],[c_1]) ).
cnf(c_37,negated_conjecture,
( big_d(X0,sk3_esk2_0,X1)
| ~ big_s(sk3_esk3_1(X1),X0) ),
inference(copy,[status(esa)],[c_14]) ).
cnf(c_46,negated_conjecture,
( big_d(X0,sk3_esk2_0,X1)
| ~ big_s(sk3_esk3_1(X1),X0) ),
inference(copy,[status(esa)],[c_37]) ).
cnf(c_49,negated_conjecture,
( big_d(X0,sk3_esk2_0,X1)
| ~ big_s(sk3_esk3_1(X1),X0) ),
inference(copy,[status(esa)],[c_46]) ).
cnf(c_62,negated_conjecture,
( big_d(X0,sk3_esk2_0,X1)
| ~ big_s(sk3_esk3_1(X1),X0) ),
inference(copy,[status(esa)],[c_49]) ).
cnf(c_4,negated_conjecture,
big_s(X0,sk3_esk6_2(X1,X0)),
file('/export/starexec/sandbox/tmp/iprover_modulo_83aff8.p',c_0_13) ).
cnf(c_20,negated_conjecture,
big_s(X0,sk3_esk6_2(X1,X0)),
inference(copy,[status(esa)],[c_4]) ).
cnf(c_40,negated_conjecture,
big_s(X0,sk3_esk6_2(X1,X0)),
inference(copy,[status(esa)],[c_20]) ).
cnf(c_43,negated_conjecture,
big_s(X0,sk3_esk6_2(X1,X0)),
inference(copy,[status(esa)],[c_40]) ).
cnf(c_52,negated_conjecture,
big_s(X0,sk3_esk6_2(X1,X0)),
inference(copy,[status(esa)],[c_43]) ).
cnf(c_68,negated_conjecture,
big_s(X0,sk3_esk6_2(X1,X0)),
inference(copy,[status(esa)],[c_52]) ).
cnf(c_84,plain,
big_d(sk3_esk6_2(X0,sk3_esk3_1(X1)),sk3_esk2_0,X1),
inference(resolution,[status(thm)],[c_62,c_68]) ).
cnf(c_85,plain,
big_d(sk3_esk6_2(X0,sk3_esk3_1(X1)),sk3_esk2_0,X1),
inference(rewriting,[status(thm)],[c_84]) ).
cnf(c_118,plain,
big_d(sk3_esk7_2(X0,sk3_esk3_1(sk3_esk4_1(X1))),sk3_esk1_1(sk3_esk2_0),X1),
inference(resolution,[status(thm)],[c_107,c_85]) ).
cnf(c_119,plain,
big_d(sk3_esk7_2(X0,sk3_esk3_1(sk3_esk4_1(X1))),sk3_esk1_1(sk3_esk2_0),X1),
inference(rewriting,[status(thm)],[c_118]) ).
cnf(c_2,negated_conjecture,
~ big_d(sk3_esk7_2(X0,X1),X0,sk3_esk5_1(X0)),
file('/export/starexec/sandbox/tmp/iprover_modulo_83aff8.p',c_0_10) ).
cnf(c_16,negated_conjecture,
~ big_d(sk3_esk7_2(X0,X1),X0,sk3_esk5_1(X0)),
inference(copy,[status(esa)],[c_2]) ).
cnf(c_38,negated_conjecture,
~ big_d(sk3_esk7_2(X0,X1),X0,sk3_esk5_1(X0)),
inference(copy,[status(esa)],[c_16]) ).
cnf(c_45,negated_conjecture,
~ big_d(sk3_esk7_2(X0,X1),X0,sk3_esk5_1(X0)),
inference(copy,[status(esa)],[c_38]) ).
cnf(c_50,negated_conjecture,
~ big_d(sk3_esk7_2(X0,X1),X0,sk3_esk5_1(X0)),
inference(copy,[status(esa)],[c_45]) ).
cnf(c_64,negated_conjecture,
~ big_d(sk3_esk7_2(X0,X1),X0,sk3_esk5_1(X0)),
inference(copy,[status(esa)],[c_50]) ).
cnf(c_140,plain,
$false,
inference(resolution,[status(thm)],[c_119,c_64]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN386+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.13 % Command : iprover_modulo %s %d
% 0.13/0.34 % Computer : n015.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jul 11 13:26:09 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.34 % Running in mono-core mode
% 0.20/0.40 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.40 % FOF problem with conjecture
% 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/sandbox/tmp/iprover_proof_aa5724.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_83aff8.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_dc358f | grep -v "SZS"
% 0.20/0.42
% 0.20/0.42 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % ------ iProver source info
% 0.20/0.42
% 0.20/0.42 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.42 % git: non_committed_changes: true
% 0.20/0.42 % git: last_make_outside_of_git: true
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % ------ Input Options
% 0.20/0.42
% 0.20/0.42 % --out_options all
% 0.20/0.42 % --tptp_safe_out true
% 0.20/0.42 % --problem_path ""
% 0.20/0.42 % --include_path ""
% 0.20/0.42 % --clausifier .//eprover
% 0.20/0.42 % --clausifier_options --tstp-format
% 0.20/0.42 % --stdin false
% 0.20/0.42 % --dbg_backtrace false
% 0.20/0.42 % --dbg_dump_prop_clauses false
% 0.20/0.42 % --dbg_dump_prop_clauses_file -
% 0.20/0.42 % --dbg_out_stat false
% 0.20/0.42
% 0.20/0.42 % ------ General Options
% 0.20/0.42
% 0.20/0.42 % --fof false
% 0.20/0.42 % --time_out_real 150.
% 0.20/0.42 % --time_out_prep_mult 0.2
% 0.20/0.42 % --time_out_virtual -1.
% 0.20/0.42 % --schedule none
% 0.20/0.42 % --ground_splitting input
% 0.20/0.42 % --splitting_nvd 16
% 0.20/0.42 % --non_eq_to_eq false
% 0.20/0.42 % --prep_gs_sim true
% 0.20/0.42 % --prep_unflatten false
% 0.20/0.42 % --prep_res_sim true
% 0.20/0.42 % --prep_upred true
% 0.20/0.42 % --res_sim_input true
% 0.20/0.42 % --clause_weak_htbl true
% 0.20/0.42 % --gc_record_bc_elim false
% 0.20/0.42 % --symbol_type_check false
% 0.20/0.42 % --clausify_out false
% 0.20/0.42 % --large_theory_mode false
% 0.20/0.42 % --prep_sem_filter none
% 0.20/0.42 % --prep_sem_filter_out false
% 0.20/0.42 % --preprocessed_out false
% 0.20/0.42 % --sub_typing false
% 0.20/0.42 % --brand_transform false
% 0.20/0.42 % --pure_diseq_elim true
% 0.20/0.42 % --min_unsat_core false
% 0.20/0.42 % --pred_elim true
% 0.20/0.42 % --add_important_lit false
% 0.20/0.42 % --soft_assumptions false
% 0.20/0.42 % --reset_solvers false
% 0.20/0.42 % --bc_imp_inh []
% 0.20/0.42 % --conj_cone_tolerance 1.5
% 0.20/0.42 % --prolific_symb_bound 500
% 0.20/0.42 % --lt_threshold 2000
% 0.20/0.42
% 0.20/0.42 % ------ SAT Options
% 0.20/0.42
% 0.20/0.42 % --sat_mode false
% 0.20/0.42 % --sat_fm_restart_options ""
% 0.20/0.42 % --sat_gr_def false
% 0.20/0.42 % --sat_epr_types true
% 0.20/0.42 % --sat_non_cyclic_types false
% 0.20/0.42 % --sat_finite_models false
% 0.20/0.42 % --sat_fm_lemmas false
% 0.20/0.42 % --sat_fm_prep false
% 0.20/0.42 % --sat_fm_uc_incr true
% 0.20/0.42 % --sat_out_model small
% 0.20/0.42 % --sat_out_clauses false
% 0.20/0.42
% 0.20/0.42 % ------ QBF Options
% 0.20/0.42
% 0.20/0.42 % --qbf_mode false
% 0.20/0.42 % --qbf_elim_univ true
% 0.20/0.42 % --qbf_sk_in true
% 0.20/0.42 % --qbf_pred_elim true
% 0.20/0.42 % --qbf_split 32
% 0.20/0.42
% 0.20/0.42 % ------ BMC1 Options
% 0.20/0.42
% 0.20/0.42 % --bmc1_incremental false
% 0.20/0.42 % --bmc1_axioms reachable_all
% 0.20/0.42 % --bmc1_min_bound 0
% 0.20/0.42 % --bmc1_max_bound -1
% 0.20/0.42 % --bmc1_max_bound_default -1
% 0.20/0.42 % --bmc1_symbol_reachability true
% 0.20/0.42 % --bmc1_property_lemmas false
% 0.20/0.42 % --bmc1_k_induction false
% 0.20/0.42 % --bmc1_non_equiv_states false
% 0.20/0.42 % --bmc1_deadlock false
% 0.20/0.42 % --bmc1_ucm false
% 0.20/0.42 % --bmc1_add_unsat_core none
% 0.20/0.42 % --bmc1_unsat_core_children false
% 0.20/0.42 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.42 % --bmc1_out_stat full
% 0.20/0.42 % --bmc1_ground_init false
% 0.20/0.42 % --bmc1_pre_inst_next_state false
% 0.20/0.42 % --bmc1_pre_inst_state false
% 0.20/0.42 % --bmc1_pre_inst_reach_state false
% 0.20/0.42 % --bmc1_out_unsat_core false
% 0.20/0.42 % --bmc1_aig_witness_out false
% 0.20/0.42 % --bmc1_verbose false
% 0.20/0.42 % --bmc1_dump_clauses_tptp false
% 0.20/0.42 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.42 % --bmc1_dump_file -
% 0.20/0.42 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.42 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.42 % --bmc1_ucm_extend_mode 1
% 0.20/0.42 % --bmc1_ucm_init_mode 2
% 0.20/0.42 % --bmc1_ucm_cone_mode none
% 0.20/0.42 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.42 % --bmc1_ucm_relax_model 4
% 0.20/0.42 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.42 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.42 % --bmc1_ucm_layered_model none
% 0.20/0.42 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.42
% 0.20/0.42 % ------ AIG Options
% 0.20/0.42
% 0.20/0.42 % --aig_mode false
% 0.20/0.42
% 0.20/0.42 % ------ Instantiation Options
% 0.20/0.42
% 0.20/0.42 % --instantiation_flag true
% 0.20/0.42 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.42 % --inst_solver_per_active 750
% 0.20/0.42 % --inst_solver_calls_frac 0.5
% 0.20/0.42 % --inst_passive_queue_type priority_queues
% 0.20/0.42 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.42 % --inst_passive_queues_freq [25;2]
% 0.20/0.42 % --inst_dismatching true
% 0.20/0.42 % --inst_eager_unprocessed_to_passive true
% 0.20/0.42 % --inst_prop_sim_given true
% 0.20/0.42 % --inst_prop_sim_new false
% 0.20/0.42 % --inst_orphan_elimination true
% 0.20/0.42 % --inst_learning_loop_flag true
% 0.20/0.42 % --inst_learning_start 3000
% 0.20/0.42 % --inst_learning_factor 2
% 0.20/0.42 % --inst_start_prop_sim_after_learn 3
% 0.20/0.42 % --inst_sel_renew solver
% 0.20/0.42 % --inst_lit_activity_flag true
% 0.20/0.42 % --inst_out_proof true
% 0.20/0.42
% 0.20/0.42 % ------ Resolution Options
% 0.20/0.42
% 0.20/0.42 % --resolution_flag true
% 0.20/0.42 % --res_lit_sel kbo_max
% 0.20/0.42 % --res_to_prop_solver none
% 0.20/0.42 % --res_prop_simpl_new false
% 0.20/0.42 % --res_prop_simpl_given false
% 0.20/0.42 % --res_passive_queue_type priority_queues
% 0.20/0.42 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.42 % --res_passive_queues_freq [15;5]
% 0.20/0.42 % --res_forward_subs full
% 0.20/0.42 % --res_backward_subs full
% 0.20/0.42 % --res_forward_subs_resolution true
% 0.20/0.42 % --res_backward_subs_resolution true
% 0.20/0.42 % --res_orphan_elimination false
% 0.20/0.42 % --res_time_limit 1000.
% 0.20/0.42 % --res_out_proof true
% 0.20/0.42 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_aa5724.s
% 0.20/0.42 % --modulo true
% 0.20/0.42
% 0.20/0.42 % ------ Combination Options
% 0.20/0.42
% 0.20/0.42 % --comb_res_mult 1000
% 0.20/0.42 % --comb_inst_mult 300
% 0.20/0.42 % ------
% 0.20/0.42
% 0.20/0.42 % ------ Parsing...% successful
% 0.20/0.42
% 0.20/0.42 % ------ 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.42
% 0.20/0.42 % ------ Proving...
% 0.20/0.42 % ------ Problem Properties
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % EPR false
% 0.20/0.42 % Horn true
% 0.20/0.42 % Has equality false
% 0.20/0.42
% 0.20/0.42 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 % % ------ Current options:
% 0.20/0.42
% 0.20/0.42 % ------ Input Options
% 0.20/0.42
% 0.20/0.42 % --out_options all
% 0.20/0.42 % --tptp_safe_out true
% 0.20/0.42 % --problem_path ""
% 0.20/0.42 % --include_path ""
% 0.20/0.42 % --clausifier .//eprover
% 0.20/0.42 % --clausifier_options --tstp-format
% 0.20/0.42 % --stdin false
% 0.20/0.42 % --dbg_backtrace false
% 0.20/0.42 % --dbg_dump_prop_clauses false
% 0.20/0.42 % --dbg_dump_prop_clauses_file -
% 0.20/0.42 % --dbg_out_stat false
% 0.20/0.42
% 0.20/0.42 % ------ General Options
% 0.20/0.42
% 0.20/0.42 % --fof false
% 0.20/0.42 % --time_out_real 150.
% 0.20/0.42 % --time_out_prep_mult 0.2
% 0.20/0.42 % --time_out_virtual -1.
% 0.20/0.42 % --schedule none
% 0.20/0.42 % --ground_splitting input
% 0.20/0.42 % --splitting_nvd 16
% 0.20/0.42 % --non_eq_to_eq false
% 0.20/0.42 % --prep_gs_sim true
% 0.20/0.42 % --prep_unflatten false
% 0.20/0.42 % --prep_res_sim true
% 0.20/0.42 % --prep_upred true
% 0.20/0.42 % --res_sim_input true
% 0.20/0.42 % --clause_weak_htbl true
% 0.20/0.42 % --gc_record_bc_elim false
% 0.20/0.42 % --symbol_type_check false
% 0.20/0.42 % --clausify_out false
% 0.20/0.42 % --large_theory_mode false
% 0.20/0.42 % --prep_sem_filter none
% 0.20/0.42 % --prep_sem_filter_out false
% 0.20/0.42 % --preprocessed_out false
% 0.20/0.42 % --sub_typing false
% 0.20/0.42 % --brand_transform false
% 0.20/0.42 % --pure_diseq_elim true
% 0.20/0.42 % --min_unsat_core false
% 0.20/0.42 % --pred_elim true
% 0.20/0.42 % --add_important_lit false
% 0.20/0.42 % --soft_assumptions false
% 0.20/0.42 % --reset_solvers false
% 0.20/0.42 % --bc_imp_inh []
% 0.20/0.42 % --conj_cone_tolerance 1.5
% 0.20/0.42 % --prolific_symb_bound 500
% 0.20/0.42 % --lt_threshold 2000
% 0.20/0.42
% 0.20/0.42 % ------ SAT Options
% 0.20/0.42
% 0.20/0.42 % --sat_mode false
% 0.20/0.42 % --sat_fm_restart_options ""
% 0.20/0.42 % --sat_gr_def false
% 0.20/0.42 % --sat_epr_types true
% 0.20/0.42 % --sat_non_cyclic_types false
% 0.20/0.42 % --sat_finite_models false
% 0.20/0.42 % --sat_fm_lemmas false
% 0.20/0.42 % --sat_fm_prep false
% 0.20/0.42 % --sat_fm_uc_incr true
% 0.20/0.42 % --sat_out_model small
% 0.20/0.42 % --sat_out_clauses false
% 0.20/0.42
% 0.20/0.42 % ------ QBF Options
% 0.20/0.42
% 0.20/0.42 % --qbf_mode false
% 0.20/0.42 % --qbf_elim_univ true
% 0.20/0.42 % --qbf_sk_in true
% 0.20/0.42 % --qbf_pred_elim true
% 0.20/0.42 % --qbf_split 32
% 0.20/0.42
% 0.20/0.42 % ------ BMC1 Options
% 0.20/0.42
% 0.20/0.42 % --bmc1_incremental false
% 0.20/0.42 % --bmc1_axioms reachable_all
% 0.20/0.42 % --bmc1_min_bound 0
% 0.20/0.42 % --bmc1_max_bound -1
% 0.20/0.42 % --bmc1_max_bound_default -1
% 0.20/0.42 % --bmc1_symbol_reachability true
% 0.20/0.42 % --bmc1_property_lemmas false
% 0.20/0.42 % --bmc1_k_induction false
% 0.20/0.42 % --bmc1_non_equiv_states false
% 0.20/0.42 % --bmc1_deadlock false
% 0.20/0.42 % --bmc1_ucm false
% 0.20/0.42 % --bmc1_add_unsat_core none
% 0.20/0.42 % --bmc1_unsat_core_children false
% 0.20/0.42 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.42 % --bmc1_out_stat full
% 0.20/0.42 % --bmc1_ground_init false
% 0.20/0.42 % --bmc1_pre_inst_next_state false
% 0.20/0.42 % --bmc1_pre_inst_state false
% 0.20/0.42 % --bmc1_pre_inst_reach_state false
% 0.20/0.42 % --bmc1_out_unsat_core false
% 0.20/0.42 % --bmc1_aig_witness_out false
% 0.20/0.42 % --bmc1_verbose false
% 0.20/0.42 % --bmc1_dump_clauses_tptp false
% 0.20/0.42 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.42 % --bmc1_dump_file -
% 0.20/0.42 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.42 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.42 % --bmc1_ucm_extend_mode 1
% 0.20/0.42 % --bmc1_ucm_init_mode 2
% 0.20/0.42 % --bmc1_ucm_cone_mode none
% 0.20/0.42 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.42 % --bmc1_ucm_relax_model 4
% 0.20/0.42 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.42 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.42 % --bmc1_ucm_layered_model none
% 0.20/0.42 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.42
% 0.20/0.42 % ------ AIG Options
% 0.20/0.42
% 0.20/0.42 % --aig_mode false
% 0.20/0.42
% 0.20/0.42 % ------ Instantiation Options
% 0.20/0.42
% 0.20/0.42 % --instantiation_flag true
% 0.20/0.42 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.42 % --inst_solver_per_active 750
% 0.20/0.42 % --inst_solver_calls_frac 0.5
% 0.20/0.42 % --inst_passive_queue_type priority_queues
% 0.20/0.42 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.42 % --inst_passive_queues_freq [25;2]
% 0.20/0.42 % --inst_dismatching true
% 0.20/0.42 % --inst_eager_unprocessed_to_passive true
% 0.20/0.42 % --inst_prop_sim_given true
% 0.20/0.43 % --inst_prop_sim_new false
% 0.20/0.43 % --inst_orphan_elimination true
% 0.20/0.43 % --inst_learning_loop_flag true
% 0.20/0.43 % --inst_learning_start 3000
% 0.20/0.43 % --inst_learning_factor 2
% 0.20/0.43 % --inst_start_prop_sim_after_learn 3
% 0.20/0.43 % --inst_sel_renew solver
% 0.20/0.43 % --inst_lit_activity_flag true
% 0.20/0.43 % --inst_out_proof true
% 0.20/0.43
% 0.20/0.43 % ------ Resolution Options
% 0.20/0.43
% 0.20/0.43 % --resolution_flag true
% 0.20/0.43 % --res_lit_sel kbo_max
% 0.20/0.43 % --res_to_prop_solver none
% 0.20/0.43 % --res_prop_simpl_new false
% 0.20/0.43 % --res_prop_simpl_given false
% 0.20/0.43 % --res_passive_queue_type priority_queues
% 0.20/0.43 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.43 % --res_passive_queues_freq [15;5]
% 0.20/0.43 % --res_forward_subs full
% 0.20/0.43 % --res_backward_subs full
% 0.20/0.43 % --res_forward_subs_resolution true
% 0.20/0.43 % --res_backward_subs_resolution true
% 0.20/0.43 % --res_orphan_elimination false
% 0.20/0.43 % --res_time_limit 1000.
% 0.20/0.43 % --res_out_proof true
% 0.20/0.43 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_aa5724.s
% 0.20/0.43 % --modulo true
% 0.20/0.43
% 0.20/0.43 % ------ Combination Options
% 0.20/0.43
% 0.20/0.43 % --comb_res_mult 1000
% 0.20/0.43 % --comb_inst_mult 300
% 0.20/0.43 % ------
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 % ------ Proving...
% 0.20/0.43 %
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 % Resolution empty clause
% 0.20/0.43
% 0.20/0.43 % ------ Statistics
% 0.20/0.43
% 0.20/0.43 % ------ General
% 0.20/0.43
% 0.20/0.43 % num_of_input_clauses: 6
% 0.20/0.43 % num_of_input_neg_conjectures: 6
% 0.20/0.43 % num_of_splits: 0
% 0.20/0.43 % num_of_split_atoms: 0
% 0.20/0.43 % num_of_sem_filtered_clauses: 0
% 0.20/0.43 % num_of_subtypes: 0
% 0.20/0.43 % monotx_restored_types: 0
% 0.20/0.43 % sat_num_of_epr_types: 0
% 0.20/0.43 % sat_num_of_non_cyclic_types: 0
% 0.20/0.43 % sat_guarded_non_collapsed_types: 0
% 0.20/0.43 % is_epr: 0
% 0.20/0.43 % is_horn: 1
% 0.20/0.43 % has_eq: 0
% 0.20/0.43 % num_pure_diseq_elim: 0
% 0.20/0.43 % simp_replaced_by: 0
% 0.20/0.43 % res_preprocessed: 12
% 0.20/0.43 % prep_upred: 0
% 0.20/0.43 % prep_unflattend: 0
% 0.20/0.43 % pred_elim_cands: 0
% 0.20/0.43 % pred_elim: 0
% 0.20/0.43 % pred_elim_cl: 0
% 0.20/0.43 % pred_elim_cycles: 0
% 0.20/0.43 % forced_gc_time: 0
% 0.20/0.43 % gc_basic_clause_elim: 0
% 0.20/0.43 % parsing_time: 0.
% 0.20/0.43 % sem_filter_time: 0.
% 0.20/0.43 % pred_elim_time: 0.
% 0.20/0.43 % out_proof_time: 0.001
% 0.20/0.43 % monotx_time: 0.
% 0.20/0.43 % subtype_inf_time: 0.
% 0.20/0.43 % unif_index_cands_time: 0.
% 0.20/0.43 % unif_index_add_time: 0.
% 0.20/0.43 % total_time: 0.023
% 0.20/0.43 % num_of_symbols: 35
% 0.20/0.43 % num_of_terms: 106
% 0.20/0.43
% 0.20/0.43 % ------ Propositional Solver
% 0.20/0.43
% 0.20/0.43 % prop_solver_calls: 1
% 0.20/0.43 % prop_fast_solver_calls: 30
% 0.20/0.43 % prop_num_of_clauses: 12
% 0.20/0.43 % prop_preprocess_simplified: 108
% 0.20/0.43 % prop_fo_subsumed: 0
% 0.20/0.43 % prop_solver_time: 0.
% 0.20/0.43 % prop_fast_solver_time: 0.
% 0.20/0.43 % prop_unsat_core_time: 0.
% 0.20/0.43
% 0.20/0.43 % ------ QBF
% 0.20/0.43
% 0.20/0.43 % qbf_q_res: 0
% 0.20/0.43 % qbf_num_tautologies: 0
% 0.20/0.43 % qbf_prep_cycles: 0
% 0.20/0.43
% 0.20/0.43 % ------ BMC1
% 0.20/0.43
% 0.20/0.43 % bmc1_current_bound: -1
% 0.20/0.43 % bmc1_last_solved_bound: -1
% 0.20/0.43 % bmc1_unsat_core_size: -1
% 0.20/0.43 % bmc1_unsat_core_parents_size: -1
% 0.20/0.43 % bmc1_merge_next_fun: 0
% 0.20/0.43 % bmc1_unsat_core_clauses_time: 0.
% 0.20/0.43
% 0.20/0.43 % ------ Instantiation
% 0.20/0.43
% 0.20/0.43 % inst_num_of_clauses: 6
% 0.20/0.43 % inst_num_in_passive: 0
% 0.20/0.43 % inst_num_in_active: 0
% 0.20/0.43 % inst_num_in_unprocessed: 6
% 0.20/0.43 % inst_num_of_loops: 0
% 0.20/0.43 % inst_num_of_learning_restarts: 0
% 0.20/0.43 % inst_num_moves_active_passive: 0
% 0.20/0.43 % inst_lit_activity: 0
% 0.20/0.43 % inst_lit_activity_moves: 0
% 0.20/0.43 % inst_num_tautologies: 0
% 0.20/0.43 % inst_num_prop_implied: 0
% 0.20/0.43 % inst_num_existing_simplified: 0
% 0.20/0.43 % inst_num_eq_res_simplified: 0
% 0.20/0.43 % inst_num_child_elim: 0
% 0.20/0.43 % inst_num_of_dismatching_blockings: 0
% 0.20/0.43 % inst_num_of_non_proper_insts: 0
% 0.20/0.43 % inst_num_of_duplicates: 0
% 0.20/0.43 % inst_inst_num_from_inst_to_res: 0
% 0.20/0.43 % inst_dismatching_checking_time: 0.
% 0.20/0.43
% 0.20/0.43 % ------ Resolution
% 0.20/0.43
% 0.20/0.43 % res_num_of_clauses: 14
% 0.20/0.43 % res_num_in_passive: 0
% 0.20/0.43 % res_num_in_active: 13
% 0.20/0.43 % res_num_of_loops: 14
% 0.20/0.43 % res_forward_subset_subsumed: 0
% 0.20/0.43 % res_backward_subset_subsumed: 0
% 0.20/0.43 % res_forward_subsumed: 0
% 0.20/0.43 % res_backward_subsumed: 0
% 0.20/0.43 % res_forward_subsumption_resolution: 0
% 0.20/0.43 % res_backward_subsumption_resolution: 0
% 0.20/0.43 % res_clause_to_clause_subsumption: 3
% 0.20/0.43 % res_orphan_elimination: 0
% 0.20/0.43 % res_tautology_del: 0
% 0.20/0.43 % res_num_eq_res_simplified: 0
% 0.20/0.43 % res_num_sel_changes: 0
% 0.20/0.43 % res_moves_from_active_to_pass: 0
% 0.20/0.43
% 0.20/0.43 % Status Unsatisfiable
% 0.20/0.43 % SZS status Theorem
% 0.20/0.43 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------