TSTP Solution File: PUZ035-5 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : PUZ035-5 : TPTP v8.1.0. Released v2.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 : Mon Jul 18 18:13:49 EDT 2022
% Result : Unsatisfiable 0.18s 0.42s
% Output : CNFRefutation 0.18s
% 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(says_yes,axiom,
says(asked,or(isa(asked,knight),isa(other,knight))),
input ).
fof(says_yes_0,plain,
( says(asked,or(isa(asked,knight),isa(other,knight)))
| $false ),
inference(orientation,[status(thm)],[says_yes]) ).
fof(def_lhs_atom1,axiom,
( lhs_atom1
<=> says(asked,or(isa(asked,knight),isa(other,knight))) ),
inference(definition,[],]) ).
fof(to_be_clausified_0,plain,
( lhs_atom1
| $false ),
inference(fold_definition,[status(thm)],[says_yes_0,def_lhs_atom1]) ).
% Start CNF derivation
fof(c_0_0,axiom,
( lhs_atom1
| ~ $true ),
file('<stdin>',to_be_clausified_0) ).
fof(c_0_1,plain,
lhs_atom1,
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_2,plain,
lhs_atom1,
c_0_1 ).
cnf(c_0_3,plain,
lhs_atom1,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,plain,
lhs_atom1,
c_0_3,
[final] ).
% End CNF derivation
cnf(c_0_4_0,axiom,
says(asked,or(isa(asked,knight),isa(other,knight))),
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,
! [X4] :
( ~ truth(isa(X4,knight))
| ~ truth(isa(X4,knave)) ),
file('<stdin>',not_both_a_knight_and_knave) ).
fof(c_0_1_002,axiom,
! [X3,X4] :
( truth(X3)
| ~ truth(isa(X4,knight))
| ~ says(X4,X3) ),
file('<stdin>',knights_make_true_statements1) ).
fof(c_0_2_003,axiom,
! [X3,X4] :
( truth(isa(X4,knight))
| ~ truth(X3)
| ~ says(X4,X3) ),
file('<stdin>',knights_make_true_statements2) ).
fof(c_0_3_004,axiom,
! [X1,X2] :
( truth(X2)
| truth(X1)
| ~ truth(or(X2,X1)) ),
file('<stdin>',or1) ).
fof(c_0_4_005,axiom,
! [X4] :
( truth(isa(X4,knight))
| truth(isa(X4,knave)) ),
file('<stdin>',everyone_a_knight_or_knave) ).
fof(c_0_5,axiom,
! [X1,X2] :
( truth(or(X2,X1))
| ~ truth(X2) ),
file('<stdin>',or2) ).
fof(c_0_6,axiom,
! [X1,X2] :
( truth(or(X2,X1))
| ~ truth(X1) ),
file('<stdin>',or3) ).
fof(c_0_7,plain,
! [X4] :
( ~ truth(isa(X4,knight))
| ~ truth(isa(X4,knave)) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_8,plain,
! [X3,X4] :
( truth(X3)
| ~ truth(isa(X4,knight))
| ~ says(X4,X3) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_9,plain,
! [X3,X4] :
( truth(isa(X4,knight))
| ~ truth(X3)
| ~ says(X4,X3) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_10,plain,
! [X1,X2] :
( truth(X2)
| truth(X1)
| ~ truth(or(X2,X1)) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_11,axiom,
! [X4] :
( truth(isa(X4,knight))
| truth(isa(X4,knave)) ),
c_0_4 ).
fof(c_0_12,plain,
! [X1,X2] :
( truth(or(X2,X1))
| ~ truth(X2) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_13,plain,
! [X1,X2] :
( truth(or(X2,X1))
| ~ truth(X1) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_14,plain,
! [X5] :
( ~ truth(isa(X5,knight))
| ~ truth(isa(X5,knave)) ),
inference(variable_rename,[status(thm)],[c_0_7]) ).
fof(c_0_15,plain,
! [X5,X6] :
( truth(X5)
| ~ truth(isa(X6,knight))
| ~ says(X6,X5) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_8])])]) ).
fof(c_0_16,plain,
! [X5,X6] :
( truth(isa(X6,knight))
| ~ truth(X5)
| ~ says(X6,X5) ),
inference(variable_rename,[status(thm)],[c_0_9]) ).
fof(c_0_17,plain,
! [X3,X4] :
( truth(X4)
| truth(X3)
| ~ truth(or(X4,X3)) ),
inference(variable_rename,[status(thm)],[c_0_10]) ).
fof(c_0_18,plain,
! [X5] :
( truth(isa(X5,knight))
| truth(isa(X5,knave)) ),
inference(variable_rename,[status(thm)],[c_0_11]) ).
fof(c_0_19,plain,
! [X3,X4] :
( truth(or(X4,X3))
| ~ truth(X4) ),
inference(variable_rename,[status(thm)],[c_0_12]) ).
fof(c_0_20,plain,
! [X3,X4] :
( truth(or(X4,X3))
| ~ truth(X3) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_13])])]) ).
cnf(c_0_21,plain,
( ~ truth(isa(X1,knave))
| ~ truth(isa(X1,knight)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,plain,
( truth(X2)
| ~ says(X1,X2)
| ~ truth(isa(X1,knight)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,plain,
( truth(isa(X1,knight))
| ~ says(X1,X2)
| ~ truth(X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
( truth(X2)
| truth(X1)
| ~ truth(or(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,plain,
( truth(isa(X1,knave))
| truth(isa(X1,knight)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,plain,
( truth(or(X1,X2))
| ~ truth(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,plain,
( truth(or(X2,X1))
| ~ truth(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,plain,
( ~ truth(isa(X1,knave))
| ~ truth(isa(X1,knight)) ),
c_0_21,
[final] ).
cnf(c_0_29,plain,
( truth(X2)
| ~ says(X1,X2)
| ~ truth(isa(X1,knight)) ),
c_0_22,
[final] ).
cnf(c_0_30,plain,
( truth(isa(X1,knight))
| ~ says(X1,X2)
| ~ truth(X2) ),
c_0_23,
[final] ).
cnf(c_0_31,plain,
( truth(X2)
| truth(X1)
| ~ truth(or(X1,X2)) ),
c_0_24,
[final] ).
cnf(c_0_32,plain,
( truth(isa(X1,knave))
| truth(isa(X1,knight)) ),
c_0_25,
[final] ).
cnf(c_0_33,plain,
( truth(or(X1,X2))
| ~ truth(X1) ),
c_0_26,
[final] ).
cnf(c_0_34,plain,
( truth(or(X2,X1))
| ~ truth(X1) ),
c_0_27,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_28_0,axiom,
( ~ truth(isa(X1,knave))
| ~ truth(isa(X1,knight)) ),
inference(literals_permutation,[status(thm)],[c_0_28]) ).
cnf(c_0_28_1,axiom,
( ~ truth(isa(X1,knight))
| ~ truth(isa(X1,knave)) ),
inference(literals_permutation,[status(thm)],[c_0_28]) ).
cnf(c_0_29_0,axiom,
( truth(X2)
| ~ says(X1,X2)
| ~ truth(isa(X1,knight)) ),
inference(literals_permutation,[status(thm)],[c_0_29]) ).
cnf(c_0_29_1,axiom,
( ~ says(X1,X2)
| truth(X2)
| ~ truth(isa(X1,knight)) ),
inference(literals_permutation,[status(thm)],[c_0_29]) ).
cnf(c_0_29_2,axiom,
( ~ truth(isa(X1,knight))
| ~ says(X1,X2)
| truth(X2) ),
inference(literals_permutation,[status(thm)],[c_0_29]) ).
cnf(c_0_30_0,axiom,
( truth(isa(X1,knight))
| ~ says(X1,X2)
| ~ truth(X2) ),
inference(literals_permutation,[status(thm)],[c_0_30]) ).
cnf(c_0_30_1,axiom,
( ~ says(X1,X2)
| truth(isa(X1,knight))
| ~ truth(X2) ),
inference(literals_permutation,[status(thm)],[c_0_30]) ).
cnf(c_0_30_2,axiom,
( ~ truth(X2)
| ~ says(X1,X2)
| truth(isa(X1,knight)) ),
inference(literals_permutation,[status(thm)],[c_0_30]) ).
cnf(c_0_31_0,axiom,
( truth(X2)
| truth(X1)
| ~ truth(or(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_31]) ).
cnf(c_0_31_1,axiom,
( truth(X1)
| truth(X2)
| ~ truth(or(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_31]) ).
cnf(c_0_31_2,axiom,
( ~ truth(or(X1,X2))
| truth(X1)
| truth(X2) ),
inference(literals_permutation,[status(thm)],[c_0_31]) ).
cnf(c_0_32_0,axiom,
( truth(isa(X1,knave))
| truth(isa(X1,knight)) ),
inference(literals_permutation,[status(thm)],[c_0_32]) ).
cnf(c_0_32_1,axiom,
( truth(isa(X1,knight))
| truth(isa(X1,knave)) ),
inference(literals_permutation,[status(thm)],[c_0_32]) ).
cnf(c_0_33_0,axiom,
( truth(or(X1,X2))
| ~ truth(X1) ),
inference(literals_permutation,[status(thm)],[c_0_33]) ).
cnf(c_0_33_1,axiom,
( ~ truth(X1)
| truth(or(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_33]) ).
cnf(c_0_34_0,axiom,
( truth(or(X2,X1))
| ~ truth(X1) ),
inference(literals_permutation,[status(thm)],[c_0_34]) ).
cnf(c_0_34_1,axiom,
( ~ truth(X1)
| truth(or(X2,X1)) ),
inference(literals_permutation,[status(thm)],[c_0_34]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_006,negated_conjecture,
! [X1,X2] :
( ~ truth(isa(asked,X2))
| ~ truth(isa(other,X1)) ),
file('<stdin>',query) ).
fof(c_0_1_007,negated_conjecture,
! [X1,X2] :
( ~ truth(isa(asked,X2))
| ~ truth(isa(other,X1)) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_2_008,negated_conjecture,
! [X3,X4] :
( ~ truth(isa(asked,X3))
| ~ truth(isa(other,X4)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_1])])]) ).
cnf(c_0_3_009,negated_conjecture,
( ~ truth(isa(other,X1))
| ~ truth(isa(asked,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4_010,negated_conjecture,
( ~ truth(isa(other,X1))
| ~ truth(isa(asked,X2)) ),
c_0_3,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_18,negated_conjecture,
( ~ truth(isa(asked,X0))
| ~ truth(isa(other,X1)) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_f577cd.p',c_0_4) ).
cnf(c_26,negated_conjecture,
( ~ truth(isa(other,X0))
| ~ sP0_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP0_iProver_split])],[c_18]) ).
cnf(c_29,negated_conjecture,
( ~ truth(isa(other,X0))
| ~ sP0_iProver_split ),
inference(copy,[status(esa)],[c_26]) ).
cnf(c_34,negated_conjecture,
( ~ truth(isa(other,X0))
| ~ sP0_iProver_split ),
inference(copy,[status(esa)],[c_29]) ).
cnf(c_46,negated_conjecture,
( ~ truth(isa(other,X0))
| ~ sP0_iProver_split ),
inference(copy,[status(esa)],[c_34]) ).
cnf(c_51,negated_conjecture,
( ~ truth(isa(other,X0))
| ~ sP0_iProver_split ),
inference(copy,[status(esa)],[c_46]) ).
cnf(c_74,negated_conjecture,
( ~ truth(isa(other,X0))
| ~ sP0_iProver_split ),
inference(copy,[status(esa)],[c_51]) ).
cnf(c_132,negated_conjecture,
( ~ truth(isa(other,X0))
| ~ sP0_iProver_split ),
inference(copy,[status(esa)],[c_74]) ).
cnf(c_11,plain,
( truth(isa(X0,knight))
| truth(isa(X0,knave)) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_f577cd.p',c_0_32_0) ).
cnf(c_118,plain,
( truth(isa(X0,knight))
| truth(isa(X0,knave)) ),
inference(copy,[status(esa)],[c_11]) ).
cnf(c_119,plain,
( truth(isa(X0,knave))
| truth(isa(X0,knight)) ),
inference(rewriting,[status(thm)],[c_118]) ).
cnf(c_140,plain,
( truth(isa(other,knight))
| ~ sP0_iProver_split ),
inference(resolution,[status(thm)],[c_132,c_119]) ).
cnf(c_141,plain,
( truth(isa(other,knight))
| ~ sP0_iProver_split ),
inference(rewriting,[status(thm)],[c_140]) ).
cnf(c_166,plain,
~ sP0_iProver_split,
inference(forward_subsumption_resolution,[status(thm)],[c_141,c_132]) ).
cnf(c_167,plain,
~ sP0_iProver_split,
inference(rewriting,[status(thm)],[c_166]) ).
cnf(c_31,negated_conjecture,
( sP0_iProver_split
| sP1_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP1_iProver_split,sP0_iProver_split])],[c_18]) ).
cnf(c_38,negated_conjecture,
( sP0_iProver_split
| sP1_iProver_split ),
inference(copy,[status(esa)],[c_31]) ).
cnf(c_48,negated_conjecture,
( sP0_iProver_split
| sP1_iProver_split ),
inference(copy,[status(esa)],[c_38]) ).
cnf(c_49,negated_conjecture,
( sP0_iProver_split
| sP1_iProver_split ),
inference(copy,[status(esa)],[c_48]) ).
cnf(c_27,negated_conjecture,
( ~ truth(isa(asked,X0))
| ~ sP1_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP1_iProver_split])],[c_18]) ).
cnf(c_30,negated_conjecture,
( ~ truth(isa(asked,X0))
| ~ sP1_iProver_split ),
inference(copy,[status(esa)],[c_27]) ).
cnf(c_36,negated_conjecture,
( ~ truth(isa(asked,X0))
| ~ sP1_iProver_split ),
inference(copy,[status(esa)],[c_30]) ).
cnf(c_47,negated_conjecture,
( ~ truth(isa(asked,X0))
| ~ sP1_iProver_split ),
inference(copy,[status(esa)],[c_36]) ).
cnf(c_50,negated_conjecture,
( ~ truth(isa(asked,X0))
| ~ sP1_iProver_split ),
inference(copy,[status(esa)],[c_47]) ).
cnf(c_52,plain,
( ~ truth(isa(asked,X0))
| sP0_iProver_split ),
inference(resolution,[status(thm)],[c_49,c_50]) ).
cnf(c_60,plain,
( ~ truth(isa(asked,X0))
| sP0_iProver_split ),
inference(copy,[status(esa)],[c_52]) ).
cnf(c_63,plain,
( ~ truth(isa(asked,X0))
| sP0_iProver_split ),
inference(copy,[status(esa)],[c_60]) ).
cnf(c_75,plain,
( ~ truth(isa(asked,X0))
| sP0_iProver_split ),
inference(copy,[status(esa)],[c_63]) ).
cnf(c_134,plain,
( ~ truth(isa(asked,X0))
| sP0_iProver_split ),
inference(copy,[status(esa)],[c_75]) ).
cnf(c_169,plain,
~ truth(isa(asked,X0)),
inference(backward_subsumption_resolution,[status(thm)],[c_167,c_134]) ).
cnf(c_170,plain,
~ truth(isa(asked,X0)),
inference(rewriting,[status(thm)],[c_169]) ).
cnf(c_173,plain,
truth(isa(asked,knight)),
inference(resolution,[status(thm)],[c_170,c_119]) ).
cnf(c_174,plain,
truth(isa(asked,knight)),
inference(rewriting,[status(thm)],[c_173]) ).
cnf(c_184,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_174,c_170]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : PUZ035-5 : TPTP v8.1.0. Released v2.0.0.
% 0.06/0.12 % Command : iprover_modulo %s %d
% 0.12/0.33 % Computer : n024.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat May 28 20:18:52 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 % Running in mono-core mode
% 0.18/0.39 % Orienting using strategy Equiv(ClausalAll)
% 0.18/0.39 % Orientation found
% 0.18/0.39 % 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_3a38f9.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_f577cd.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_281464 | grep -v "SZS"
% 0.18/0.41
% 0.18/0.41 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.18/0.41
% 0.18/0.41 %
% 0.18/0.41 % ------ iProver source info
% 0.18/0.41
% 0.18/0.41 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.18/0.41 % git: non_committed_changes: true
% 0.18/0.41 % git: last_make_outside_of_git: true
% 0.18/0.41
% 0.18/0.41 %
% 0.18/0.41 % ------ Input Options
% 0.18/0.41
% 0.18/0.41 % --out_options all
% 0.18/0.41 % --tptp_safe_out true
% 0.18/0.41 % --problem_path ""
% 0.18/0.41 % --include_path ""
% 0.18/0.41 % --clausifier .//eprover
% 0.18/0.41 % --clausifier_options --tstp-format
% 0.18/0.41 % --stdin false
% 0.18/0.41 % --dbg_backtrace false
% 0.18/0.41 % --dbg_dump_prop_clauses false
% 0.18/0.41 % --dbg_dump_prop_clauses_file -
% 0.18/0.41 % --dbg_out_stat false
% 0.18/0.41
% 0.18/0.41 % ------ General Options
% 0.18/0.41
% 0.18/0.41 % --fof false
% 0.18/0.41 % --time_out_real 150.
% 0.18/0.41 % --time_out_prep_mult 0.2
% 0.18/0.41 % --time_out_virtual -1.
% 0.18/0.41 % --schedule none
% 0.18/0.41 % --ground_splitting input
% 0.18/0.41 % --splitting_nvd 16
% 0.18/0.41 % --non_eq_to_eq false
% 0.18/0.41 % --prep_gs_sim true
% 0.18/0.41 % --prep_unflatten false
% 0.18/0.41 % --prep_res_sim true
% 0.18/0.41 % --prep_upred true
% 0.18/0.41 % --res_sim_input true
% 0.18/0.41 % --clause_weak_htbl true
% 0.18/0.41 % --gc_record_bc_elim false
% 0.18/0.41 % --symbol_type_check false
% 0.18/0.41 % --clausify_out false
% 0.18/0.41 % --large_theory_mode false
% 0.18/0.41 % --prep_sem_filter none
% 0.18/0.41 % --prep_sem_filter_out false
% 0.18/0.41 % --preprocessed_out false
% 0.18/0.41 % --sub_typing false
% 0.18/0.41 % --brand_transform false
% 0.18/0.41 % --pure_diseq_elim true
% 0.18/0.41 % --min_unsat_core false
% 0.18/0.41 % --pred_elim true
% 0.18/0.41 % --add_important_lit false
% 0.18/0.41 % --soft_assumptions false
% 0.18/0.41 % --reset_solvers false
% 0.18/0.41 % --bc_imp_inh []
% 0.18/0.41 % --conj_cone_tolerance 1.5
% 0.18/0.41 % --prolific_symb_bound 500
% 0.18/0.41 % --lt_threshold 2000
% 0.18/0.41
% 0.18/0.41 % ------ SAT Options
% 0.18/0.41
% 0.18/0.41 % --sat_mode false
% 0.18/0.41 % --sat_fm_restart_options ""
% 0.18/0.41 % --sat_gr_def false
% 0.18/0.41 % --sat_epr_types true
% 0.18/0.41 % --sat_non_cyclic_types false
% 0.18/0.41 % --sat_finite_models false
% 0.18/0.41 % --sat_fm_lemmas false
% 0.18/0.41 % --sat_fm_prep false
% 0.18/0.41 % --sat_fm_uc_incr true
% 0.18/0.41 % --sat_out_model small
% 0.18/0.41 % --sat_out_clauses false
% 0.18/0.41
% 0.18/0.41 % ------ QBF Options
% 0.18/0.41
% 0.18/0.41 % --qbf_mode false
% 0.18/0.41 % --qbf_elim_univ true
% 0.18/0.41 % --qbf_sk_in true
% 0.18/0.41 % --qbf_pred_elim true
% 0.18/0.41 % --qbf_split 32
% 0.18/0.41
% 0.18/0.41 % ------ BMC1 Options
% 0.18/0.41
% 0.18/0.41 % --bmc1_incremental false
% 0.18/0.41 % --bmc1_axioms reachable_all
% 0.18/0.41 % --bmc1_min_bound 0
% 0.18/0.41 % --bmc1_max_bound -1
% 0.18/0.41 % --bmc1_max_bound_default -1
% 0.18/0.41 % --bmc1_symbol_reachability true
% 0.18/0.41 % --bmc1_property_lemmas false
% 0.18/0.41 % --bmc1_k_induction false
% 0.18/0.41 % --bmc1_non_equiv_states false
% 0.18/0.41 % --bmc1_deadlock false
% 0.18/0.41 % --bmc1_ucm false
% 0.18/0.41 % --bmc1_add_unsat_core none
% 0.18/0.41 % --bmc1_unsat_core_children false
% 0.18/0.41 % --bmc1_unsat_core_extrapolate_axioms false
% 0.18/0.41 % --bmc1_out_stat full
% 0.18/0.41 % --bmc1_ground_init false
% 0.18/0.41 % --bmc1_pre_inst_next_state false
% 0.18/0.41 % --bmc1_pre_inst_state false
% 0.18/0.41 % --bmc1_pre_inst_reach_state false
% 0.18/0.41 % --bmc1_out_unsat_core false
% 0.18/0.41 % --bmc1_aig_witness_out false
% 0.18/0.41 % --bmc1_verbose false
% 0.18/0.41 % --bmc1_dump_clauses_tptp false
% 0.18/0.42 % --bmc1_dump_unsat_core_tptp false
% 0.18/0.42 % --bmc1_dump_file -
% 0.18/0.42 % --bmc1_ucm_expand_uc_limit 128
% 0.18/0.42 % --bmc1_ucm_n_expand_iterations 6
% 0.18/0.42 % --bmc1_ucm_extend_mode 1
% 0.18/0.42 % --bmc1_ucm_init_mode 2
% 0.18/0.42 % --bmc1_ucm_cone_mode none
% 0.18/0.42 % --bmc1_ucm_reduced_relation_type 0
% 0.18/0.42 % --bmc1_ucm_relax_model 4
% 0.18/0.42 % --bmc1_ucm_full_tr_after_sat true
% 0.18/0.42 % --bmc1_ucm_expand_neg_assumptions false
% 0.18/0.42 % --bmc1_ucm_layered_model none
% 0.18/0.42 % --bmc1_ucm_max_lemma_size 10
% 0.18/0.42
% 0.18/0.42 % ------ AIG Options
% 0.18/0.42
% 0.18/0.42 % --aig_mode false
% 0.18/0.42
% 0.18/0.42 % ------ Instantiation Options
% 0.18/0.42
% 0.18/0.42 % --instantiation_flag true
% 0.18/0.42 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.18/0.42 % --inst_solver_per_active 750
% 0.18/0.42 % --inst_solver_calls_frac 0.5
% 0.18/0.42 % --inst_passive_queue_type priority_queues
% 0.18/0.42 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.18/0.42 % --inst_passive_queues_freq [25;2]
% 0.18/0.42 % --inst_dismatching true
% 0.18/0.42 % --inst_eager_unprocessed_to_passive true
% 0.18/0.42 % --inst_prop_sim_given true
% 0.18/0.42 % --inst_prop_sim_new false
% 0.18/0.42 % --inst_orphan_elimination true
% 0.18/0.42 % --inst_learning_loop_flag true
% 0.18/0.42 % --inst_learning_start 3000
% 0.18/0.42 % --inst_learning_factor 2
% 0.18/0.42 % --inst_start_prop_sim_after_learn 3
% 0.18/0.42 % --inst_sel_renew solver
% 0.18/0.42 % --inst_lit_activity_flag true
% 0.18/0.42 % --inst_out_proof true
% 0.18/0.42
% 0.18/0.42 % ------ Resolution Options
% 0.18/0.42
% 0.18/0.42 % --resolution_flag true
% 0.18/0.42 % --res_lit_sel kbo_max
% 0.18/0.42 % --res_to_prop_solver none
% 0.18/0.42 % --res_prop_simpl_new false
% 0.18/0.42 % --res_prop_simpl_given false
% 0.18/0.42 % --res_passive_queue_type priority_queues
% 0.18/0.42 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.18/0.42 % --res_passive_queues_freq [15;5]
% 0.18/0.42 % --res_forward_subs full
% 0.18/0.42 % --res_backward_subs full
% 0.18/0.42 % --res_forward_subs_resolution true
% 0.18/0.42 % --res_backward_subs_resolution true
% 0.18/0.42 % --res_orphan_elimination false
% 0.18/0.42 % --res_time_limit 1000.
% 0.18/0.42 % --res_out_proof true
% 0.18/0.42 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_3a38f9.s
% 0.18/0.42 % --modulo true
% 0.18/0.42
% 0.18/0.42 % ------ Combination Options
% 0.18/0.42
% 0.18/0.42 % --comb_res_mult 1000
% 0.18/0.42 % --comb_inst_mult 300
% 0.18/0.42 % ------
% 0.18/0.42
% 0.18/0.42 % ------ Parsing...% successful
% 0.18/0.42
% 0.18/0.42 % ------ Preprocessing... gs_s sp: 4 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.18/0.42
% 0.18/0.42 % ------ Proving...
% 0.18/0.42 % ------ Problem Properties
% 0.18/0.42
% 0.18/0.42 %
% 0.18/0.42 % EPR false
% 0.18/0.42 % Horn false
% 0.18/0.42 % Has equality false
% 0.18/0.42
% 0.18/0.42 % % ------ Input Options Time Limit: Unbounded
% 0.18/0.42
% 0.18/0.42
% 0.18/0.42 % % ------ Current options:
% 0.18/0.42
% 0.18/0.42 % ------ Input Options
% 0.18/0.42
% 0.18/0.42 % --out_options all
% 0.18/0.42 % --tptp_safe_out true
% 0.18/0.42 % --problem_path ""
% 0.18/0.42 % --include_path ""
% 0.18/0.42 % --clausifier .//eprover
% 0.18/0.42 % --clausifier_options --tstp-format
% 0.18/0.42 % --stdin false
% 0.18/0.42 % --dbg_backtrace false
% 0.18/0.42 % --dbg_dump_prop_clauses false
% 0.18/0.42 % --dbg_dump_prop_clauses_file -
% 0.18/0.42 % --dbg_out_stat false
% 0.18/0.42
% 0.18/0.42 % ------ General Options
% 0.18/0.42
% 0.18/0.42 % --fof false
% 0.18/0.42 % --time_out_real 150.
% 0.18/0.42 % --time_out_prep_mult 0.2
% 0.18/0.42 % --time_out_virtual -1.
% 0.18/0.42 % --schedule none
% 0.18/0.42 % --ground_splitting input
% 0.18/0.42 % --splitting_nvd 16
% 0.18/0.42 % --non_eq_to_eq false
% 0.18/0.42 % --prep_gs_sim true
% 0.18/0.42 % --prep_unflatten false
% 0.18/0.42 % --prep_res_sim true
% 0.18/0.42 % --prep_upred true
% 0.18/0.42 % --res_sim_input true
% 0.18/0.42 % --clause_weak_htbl true
% 0.18/0.42 % --gc_record_bc_elim false
% 0.18/0.42 % --symbol_type_check false
% 0.18/0.42 % --clausify_out false
% 0.18/0.42 % --large_theory_mode false
% 0.18/0.42 % --prep_sem_filter none
% 0.18/0.42 % --prep_sem_filter_out false
% 0.18/0.42 % --preprocessed_out false
% 0.18/0.42 % --sub_typing false
% 0.18/0.42 % --brand_transform false
% 0.18/0.42 % --pure_diseq_elim true
% 0.18/0.42 % --min_unsat_core false
% 0.18/0.42 % --pred_elim true
% 0.18/0.42 % --add_important_lit false
% 0.18/0.42 % --soft_assumptions false
% 0.18/0.42 % --reset_solvers false
% 0.18/0.42 % --bc_imp_inh []
% 0.18/0.42 % --conj_cone_tolerance 1.5
% 0.18/0.42 % --prolific_symb_bound 500
% 0.18/0.42 % --lt_threshold 2000
% 0.18/0.42
% 0.18/0.42 % ------ SAT Options
% 0.18/0.42
% 0.18/0.42 % --sat_mode false
% 0.18/0.42 % --sat_fm_restart_options ""
% 0.18/0.42 % --sat_gr_def false
% 0.18/0.42 % --sat_epr_types true
% 0.18/0.42 % --sat_non_cyclic_types false
% 0.18/0.42 % --sat_finite_models false
% 0.18/0.42 % --sat_fm_lemmas false
% 0.18/0.42 % --sat_fm_prep false
% 0.18/0.42 % --sat_fm_uc_incr true
% 0.18/0.42 % --sat_out_model small
% 0.18/0.42 % --sat_out_clauses false
% 0.18/0.42
% 0.18/0.42 % ------ QBF Options
% 0.18/0.42
% 0.18/0.42 % --qbf_mode false
% 0.18/0.42 % --qbf_elim_univ true
% 0.18/0.42 % --qbf_sk_in true
% 0.18/0.42 % --qbf_pred_elim true
% 0.18/0.42 % --qbf_split 32
% 0.18/0.42
% 0.18/0.42 % ------ BMC1 Options
% 0.18/0.42
% 0.18/0.42 % --bmc1_incremental false
% 0.18/0.42 % --bmc1_axioms reachable_all
% 0.18/0.42 % --bmc1_min_bound 0
% 0.18/0.42 % --bmc1_max_bound -1
% 0.18/0.42 % --bmc1_max_bound_default -1
% 0.18/0.42 % --bmc1_symbol_reachability true
% 0.18/0.42 % --bmc1_property_lemmas false
% 0.18/0.42 % --bmc1_k_induction false
% 0.18/0.42 % --bmc1_non_equiv_states false
% 0.18/0.42 % --bmc1_deadlock false
% 0.18/0.42 % --bmc1_ucm false
% 0.18/0.42 % --bmc1_add_unsat_core none
% 0.18/0.42 % --bmc1_unsat_core_children false
% 0.18/0.42 % --bmc1_unsat_core_extrapolate_axioms false
% 0.18/0.42 % --bmc1_out_stat full
% 0.18/0.42 % --bmc1_ground_init false
% 0.18/0.42 % --bmc1_pre_inst_next_state false
% 0.18/0.42 % --bmc1_pre_inst_state false
% 0.18/0.42 % --bmc1_pre_inst_reach_state false
% 0.18/0.42 % --bmc1_out_unsat_core false
% 0.18/0.42 % --bmc1_aig_witness_out false
% 0.18/0.42 % --bmc1_verbose false
% 0.18/0.42 % --bmc1_dump_clauses_tptp false
% 0.18/0.42 % --bmc1_dump_unsat_core_tptp false
% 0.18/0.42 % --bmc1_dump_file -
% 0.18/0.42 % --bmc1_ucm_expand_uc_limit 128
% 0.18/0.42 % --bmc1_ucm_n_expand_iterations 6
% 0.18/0.42 % --bmc1_ucm_extend_mode 1
% 0.18/0.42 % --bmc1_ucm_init_mode 2
% 0.18/0.42 % --bmc1_ucm_cone_mode none
% 0.18/0.42 % --bmc1_ucm_reduced_relation_type 0
% 0.18/0.42 % --bmc1_ucm_relax_model 4
% 0.18/0.42 % --bmc1_ucm_full_tr_after_sat true
% 0.18/0.42 % --bmc1_ucm_expand_neg_assumptions false
% 0.18/0.42 % --bmc1_ucm_layered_model none
% 0.18/0.42 % --bmc1_ucm_max_lemma_size 10
% 0.18/0.42
% 0.18/0.42 % ------ AIG Options
% 0.18/0.42
% 0.18/0.42 % --aig_mode false
% 0.18/0.42
% 0.18/0.42 % ------ Instantiation Options
% 0.18/0.42
% 0.18/0.42 % --instantiation_flag true
% 0.18/0.42 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.18/0.42 % --inst_solver_per_active 750
% 0.18/0.42 % --inst_solver_calls_frac 0.5
% 0.18/0.42 % --inst_passive_queue_type priority_queues
% 0.18/0.42 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.18/0.42 % --inst_passive_queues_freq [25;2]
% 0.18/0.42 % --inst_dismatching true
% 0.18/0.42 % --inst_eager_unprocessed_to_passive true
% 0.18/0.42 % --inst_prop_sim_given true
% 0.18/0.42 % --inst_prop_sim_new false
% 0.18/0.42 % --inst_orphan_elimination true
% 0.18/0.42 % --inst_learning_loop_flag true
% 0.18/0.42 % --inst_learning_start 3000
% 0.18/0.42 % --inst_learning_factor 2
% 0.18/0.42 % --inst_start_prop_sim_after_learn 3
% 0.18/0.42 % --inst_sel_renew solver
% 0.18/0.42 % --inst_lit_activity_flag true
% 0.18/0.42 % --inst_out_proof true
% 0.18/0.42
% 0.18/0.42 % ------ Resolution Options
% 0.18/0.42
% 0.18/0.42 % --resolution_flag true
% 0.18/0.42 % --res_lit_sel kbo_max
% 0.18/0.42 % --res_to_prop_solver none
% 0.18/0.42 % --res_prop_simpl_new false
% 0.18/0.42 % --res_prop_simpl_given false
% 0.18/0.42 % --res_passive_queue_type priority_queues
% 0.18/0.42 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.18/0.42 % --res_passive_queues_freq [15;5]
% 0.18/0.42 % --res_forward_subs full
% 0.18/0.42 % --res_backward_subs full
% 0.18/0.42 % --res_forward_subs_resolution true
% 0.18/0.42 % --res_backward_subs_resolution true
% 0.18/0.42 % --res_orphan_elimination false
% 0.18/0.42 % --res_time_limit 1000.
% 0.18/0.42 % --res_out_proof true
% 0.18/0.42 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_3a38f9.s
% 0.18/0.42 % --modulo true
% 0.18/0.42
% 0.18/0.42 % ------ Combination Options
% 0.18/0.42
% 0.18/0.42 % --comb_res_mult 1000
% 0.18/0.42 % --comb_inst_mult 300
% 0.18/0.42 % ------
% 0.18/0.42
% 0.18/0.42
% 0.18/0.42
% 0.18/0.42 % ------ Proving...
% 0.18/0.42 %
% 0.18/0.42
% 0.18/0.42
% 0.18/0.42 % Resolution empty clause
% 0.18/0.42
% 0.18/0.42 % ------ Statistics
% 0.18/0.42
% 0.18/0.42 % ------ General
% 0.18/0.42
% 0.18/0.42 % num_of_input_clauses: 19
% 0.18/0.42 % num_of_input_neg_conjectures: 1
% 0.18/0.42 % num_of_splits: 4
% 0.18/0.42 % num_of_split_atoms: 2
% 0.18/0.42 % num_of_sem_filtered_clauses: 0
% 0.18/0.42 % num_of_subtypes: 0
% 0.18/0.42 % monotx_restored_types: 0
% 0.18/0.42 % sat_num_of_epr_types: 0
% 0.18/0.42 % sat_num_of_non_cyclic_types: 0
% 0.18/0.42 % sat_guarded_non_collapsed_types: 0
% 0.18/0.42 % is_epr: 0
% 0.18/0.42 % is_horn: 0
% 0.18/0.42 % has_eq: 0
% 0.18/0.42 % num_pure_diseq_elim: 0
% 0.18/0.42 % simp_replaced_by: 0
% 0.18/0.42 % res_preprocessed: 6
% 0.18/0.42 % prep_upred: 0
% 0.18/0.42 % prep_unflattend: 0
% 0.18/0.42 % pred_elim_cands: 2
% 0.18/0.42 % pred_elim: 1
% 0.18/0.42 % pred_elim_cl: 1
% 0.18/0.42 % pred_elim_cycles: 2
% 0.18/0.42 % forced_gc_time: 0
% 0.18/0.42 % gc_basic_clause_elim: 0
% 0.18/0.42 % parsing_time: 0.
% 0.18/0.42 % sem_filter_time: 0.
% 0.18/0.42 % pred_elim_time: 0.
% 0.18/0.42 % out_proof_time: 0.001
% 0.18/0.42 % monotx_time: 0.
% 0.18/0.42 % subtype_inf_time: 0.
% 0.18/0.42 % unif_index_cands_time: 0.
% 0.18/0.42 % unif_index_add_time: 0.
% 0.18/0.42 % total_time: 0.023
% 0.18/0.42 % num_of_symbols: 35
% 0.18/0.42 % num_of_terms: 99
% 0.18/0.42
% 0.18/0.42 % ------ Propositional Solver
% 0.18/0.42
% 0.18/0.42 % prop_solver_calls: 1
% 0.18/0.42 % prop_fast_solver_calls: 22
% 0.18/0.42 % prop_num_of_clauses: 27
% 0.18/0.42 % prop_preprocess_simplified: 100
% 0.18/0.42 % prop_fo_subsumed: 0
% 0.18/0.42 % prop_solver_time: 0.
% 0.18/0.42 % prop_fast_solver_time: 0.
% 0.18/0.42 % prop_unsat_core_time: 0.
% 0.18/0.42
% 0.18/0.42 % ------ QBF
% 0.18/0.42
% 0.18/0.42 % qbf_q_res: 0
% 0.18/0.42 % qbf_num_tautologies: 0
% 0.18/0.42 % qbf_prep_cycles: 0
% 0.18/0.42
% 0.18/0.42 % ------ BMC1
% 0.18/0.42
% 0.18/0.42 % bmc1_current_bound: -1
% 0.18/0.42 % bmc1_last_solved_bound: -1
% 0.18/0.42 % bmc1_unsat_core_size: -1
% 0.18/0.42 % bmc1_unsat_core_parents_size: -1
% 0.18/0.42 % bmc1_merge_next_fun: 0
% 0.18/0.42 % bmc1_unsat_core_clauses_time: 0.
% 0.18/0.42
% 0.18/0.42 % ------ Instantiation
% 0.18/0.42
% 0.18/0.42 % inst_num_of_clauses: 20
% 0.18/0.42 % inst_num_in_passive: 0
% 0.18/0.42 % inst_num_in_active: 0
% 0.18/0.42 % inst_num_in_unprocessed: 20
% 0.18/0.42 % inst_num_of_loops: 0
% 0.18/0.42 % inst_num_of_learning_restarts: 0
% 0.18/0.42 % inst_num_moves_active_passive: 0
% 0.18/0.42 % inst_lit_activity: 0
% 0.18/0.42 % inst_lit_activity_moves: 0
% 0.18/0.42 % inst_num_tautologies: 0
% 0.18/0.42 % inst_num_prop_implied: 0
% 0.18/0.42 % inst_num_existing_simplified: 0
% 0.18/0.42 % inst_num_eq_res_simplified: 0
% 0.18/0.42 % inst_num_child_elim: 0
% 0.18/0.42 % inst_num_of_dismatching_blockings: 0
% 0.18/0.42 % inst_num_of_non_proper_insts: 0
% 0.18/0.42 % inst_num_of_duplicates: 0
% 0.18/0.42 % inst_inst_num_from_inst_to_res: 0
% 0.18/0.42 % inst_dismatching_checking_time: 0.
% 0.18/0.42
% 0.18/0.42 % ------ Resolution
% 0.18/0.42
% 0.18/0.42 % res_num_of_clauses: 26
% 0.18/0.42 % res_num_in_passive: 9
% 0.18/0.42 % res_num_in_active: 11
% 0.18/0.42 % res_num_of_loops: 9
% 0.18/0.42 % res_forward_subset_subsumed: 9
% 0.18/0.42 % res_backward_subset_subsumed: 5
% 0.18/0.42 % res_forward_subsumed: 4
% 0.18/0.42 % res_backward_subsumed: 1
% 0.18/0.42 % res_forward_subsumption_resolution: 2
% 0.18/0.42 % res_backward_subsumption_resolution: 1
% 0.18/0.42 % res_clause_to_clause_subsumption: 8
% 0.18/0.42 % res_orphan_elimination: 0
% 0.18/0.42 % res_tautology_del: 0
% 0.18/0.42 % res_num_eq_res_simplified: 0
% 0.18/0.42 % res_num_sel_changes: 0
% 0.18/0.42 % res_moves_from_active_to_pass: 0
% 0.18/0.42
% 0.18/0.42 % Status Unsatisfiable
% 0.18/0.42 % SZS status Unsatisfiable
% 0.18/0.42 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------