TSTP Solution File: HEN009-5 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : HEN009-5 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n004.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 : Sat Jul 16 12:55:22 EDT 2022
% Result : Unsatisfiable 2.17s 2.39s
% Output : CNFRefutation 2.17s
% 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(identity_is_largest,axiom,
divide(X,identity) = zero,
input ).
fof(identity_is_largest_0,plain,
! [X] :
( divide(X,identity) = zero
| $false ),
inference(orientation,[status(thm)],[identity_is_largest]) ).
cnf(zero_is_smallest,axiom,
divide(zero,X) = zero,
input ).
fof(zero_is_smallest_0,plain,
! [X] :
( divide(zero,X) = zero
| $false ),
inference(orientation,[status(thm)],[zero_is_smallest]) ).
cnf(quotient_property,axiom,
divide(divide(divide(X,Z),divide(Y,Z)),divide(divide(X,Y),Z)) = zero,
input ).
fof(quotient_property_0,plain,
! [X,Y,Z] :
( divide(divide(divide(X,Z),divide(Y,Z)),divide(divide(X,Y),Z)) = zero
| $false ),
inference(orientation,[status(thm)],[quotient_property]) ).
cnf(quotient_smaller_than_numerator,axiom,
divide(divide(X,Y),X) = zero,
input ).
fof(quotient_smaller_than_numerator_0,plain,
! [X,Y] :
( divide(divide(X,Y),X) = zero
| $false ),
inference(orientation,[status(thm)],[quotient_smaller_than_numerator]) ).
fof(def_lhs_atom1,axiom,
! [Y,X] :
( lhs_atom1(Y,X)
<=> divide(divide(X,Y),X) = zero ),
inference(definition,[],]) ).
fof(to_be_clausified_0,plain,
! [X,Y] :
( lhs_atom1(Y,X)
| $false ),
inference(fold_definition,[status(thm)],[quotient_smaller_than_numerator_0,def_lhs_atom1]) ).
fof(def_lhs_atom2,axiom,
! [Z,Y,X] :
( lhs_atom2(Z,Y,X)
<=> divide(divide(divide(X,Z),divide(Y,Z)),divide(divide(X,Y),Z)) = zero ),
inference(definition,[],]) ).
fof(to_be_clausified_1,plain,
! [X,Y,Z] :
( lhs_atom2(Z,Y,X)
| $false ),
inference(fold_definition,[status(thm)],[quotient_property_0,def_lhs_atom2]) ).
fof(def_lhs_atom3,axiom,
! [X] :
( lhs_atom3(X)
<=> divide(zero,X) = zero ),
inference(definition,[],]) ).
fof(to_be_clausified_2,plain,
! [X] :
( lhs_atom3(X)
| $false ),
inference(fold_definition,[status(thm)],[zero_is_smallest_0,def_lhs_atom3]) ).
fof(def_lhs_atom4,axiom,
! [X] :
( lhs_atom4(X)
<=> divide(X,identity) = zero ),
inference(definition,[],]) ).
fof(to_be_clausified_3,plain,
! [X] :
( lhs_atom4(X)
| $false ),
inference(fold_definition,[status(thm)],[identity_is_largest_0,def_lhs_atom4]) ).
% Start CNF derivation
fof(c_0_0,axiom,
! [X3,X1,X2] :
( lhs_atom2(X3,X1,X2)
| ~ $true ),
file('<stdin>',to_be_clausified_1) ).
fof(c_0_1,axiom,
! [X1,X2] :
( lhs_atom1(X1,X2)
| ~ $true ),
file('<stdin>',to_be_clausified_0) ).
fof(c_0_2,axiom,
! [X2] :
( lhs_atom4(X2)
| ~ $true ),
file('<stdin>',to_be_clausified_3) ).
fof(c_0_3,axiom,
! [X2] :
( lhs_atom3(X2)
| ~ $true ),
file('<stdin>',to_be_clausified_2) ).
fof(c_0_4,plain,
! [X3,X1,X2] : lhs_atom2(X3,X1,X2),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_5,plain,
! [X1,X2] : lhs_atom1(X1,X2),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_6,plain,
! [X2] : lhs_atom4(X2),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_7,plain,
! [X2] : lhs_atom3(X2),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_8,plain,
! [X4,X5,X6] : lhs_atom2(X4,X5,X6),
inference(variable_rename,[status(thm)],[c_0_4]) ).
fof(c_0_9,plain,
! [X3,X4] : lhs_atom1(X3,X4),
inference(variable_rename,[status(thm)],[c_0_5]) ).
fof(c_0_10,plain,
! [X3] : lhs_atom4(X3),
inference(variable_rename,[status(thm)],[c_0_6]) ).
fof(c_0_11,plain,
! [X3] : lhs_atom3(X3),
inference(variable_rename,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
lhs_atom2(X1,X2,X3),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
lhs_atom1(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
lhs_atom4(X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
lhs_atom3(X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
lhs_atom2(X1,X2,X3),
c_0_12,
[final] ).
cnf(c_0_17,plain,
lhs_atom1(X1,X2),
c_0_13,
[final] ).
cnf(c_0_18,plain,
lhs_atom4(X1),
c_0_14,
[final] ).
cnf(c_0_19,plain,
lhs_atom3(X1),
c_0_15,
[final] ).
% End CNF derivation
cnf(c_0_16_0,axiom,
divide(divide(divide(X3,X1),divide(X2,X1)),divide(divide(X3,X2),X1)) = zero,
inference(unfold_definition,[status(thm)],[c_0_16,def_lhs_atom2]) ).
cnf(c_0_17_0,axiom,
divide(divide(X2,X1),X2) = zero,
inference(unfold_definition,[status(thm)],[c_0_17,def_lhs_atom1]) ).
cnf(c_0_18_0,axiom,
divide(X1,identity) = zero,
inference(unfold_definition,[status(thm)],[c_0_18,def_lhs_atom4]) ).
cnf(c_0_19_0,axiom,
divide(zero,X1) = zero,
inference(unfold_definition,[status(thm)],[c_0_19,def_lhs_atom3]) ).
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
fof(c_0_0_001,axiom,
! [X1,X2,X3] :
( divide(divide(X3,X2),X1) != zero
| divide(divide(X3,X1),X2) = zero ),
file('<stdin>',property_of_divide1) ).
fof(c_0_1_002,axiom,
! [X1,X2,X3] :
( divide(X3,X2) != zero
| divide(divide(X1,X2),divide(X1,X3)) = zero ),
file('<stdin>',property_of_divide2) ).
fof(c_0_2_003,axiom,
! [X1,X2,X3] :
( divide(X3,X2) != zero
| divide(X2,X1) != zero
| divide(X3,X1) = zero ),
file('<stdin>',transitivity_of_divide_to_zero) ).
fof(c_0_3_004,axiom,
! [X2,X3] :
( divide(X3,X2) != zero
| divide(X2,X3) != zero
| X3 = X2 ),
file('<stdin>',divide_and_equal) ).
fof(c_0_4_005,axiom,
! [X1,X2,X3] :
( divide(divide(X3,X2),X1) != zero
| divide(divide(X3,X1),X2) = zero ),
c_0_0 ).
fof(c_0_5_006,axiom,
! [X1,X2,X3] :
( divide(X3,X2) != zero
| divide(divide(X1,X2),divide(X1,X3)) = zero ),
c_0_1 ).
fof(c_0_6_007,axiom,
! [X1,X2,X3] :
( divide(X3,X2) != zero
| divide(X2,X1) != zero
| divide(X3,X1) = zero ),
c_0_2 ).
fof(c_0_7_008,axiom,
! [X2,X3] :
( divide(X3,X2) != zero
| divide(X2,X3) != zero
| X3 = X2 ),
c_0_3 ).
fof(c_0_8_009,plain,
! [X4,X5,X6] :
( divide(divide(X6,X5),X4) != zero
| divide(divide(X6,X4),X5) = zero ),
inference(variable_rename,[status(thm)],[c_0_4]) ).
fof(c_0_9_010,plain,
! [X4,X5,X6] :
( divide(X6,X5) != zero
| divide(divide(X4,X5),divide(X4,X6)) = zero ),
inference(variable_rename,[status(thm)],[c_0_5]) ).
fof(c_0_10_011,plain,
! [X4,X5,X6] :
( divide(X6,X5) != zero
| divide(X5,X4) != zero
| divide(X6,X4) = zero ),
inference(variable_rename,[status(thm)],[c_0_6]) ).
fof(c_0_11_012,plain,
! [X4,X5] :
( divide(X5,X4) != zero
| divide(X4,X5) != zero
| X5 = X4 ),
inference(variable_rename,[status(thm)],[c_0_7]) ).
cnf(c_0_12_013,plain,
( divide(divide(X1,X2),X3) = zero
| divide(divide(X1,X3),X2) != zero ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13_014,plain,
( divide(divide(X1,X2),divide(X1,X3)) = zero
| divide(X3,X2) != zero ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14_015,plain,
( divide(X1,X2) = zero
| divide(X3,X2) != zero
| divide(X1,X3) != zero ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15_016,plain,
( X1 = X2
| divide(X2,X1) != zero
| divide(X1,X2) != zero ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16_017,plain,
( divide(divide(X1,X2),X3) = zero
| divide(divide(X1,X3),X2) != zero ),
c_0_12,
[final] ).
cnf(c_0_17_018,plain,
( divide(divide(X1,X2),divide(X1,X3)) = zero
| divide(X3,X2) != zero ),
c_0_13,
[final] ).
cnf(c_0_18_019,plain,
( divide(X1,X2) = zero
| divide(X3,X2) != zero
| divide(X1,X3) != zero ),
c_0_14,
[final] ).
cnf(c_0_19_020,plain,
( X1 = X2
| divide(X2,X1) != zero
| divide(X1,X2) != zero ),
c_0_15,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_16_1,axiom,
( divide(divide(X1,X2),X3) = zero
| divide(divide(X1,X3),X2) != zero ),
inference(literals_permutation,[status(thm)],[c_0_16]) ).
cnf(c_0_16_2,axiom,
( divide(divide(X1,X3),X2) != zero
| divide(divide(X1,X2),X3) = zero ),
inference(literals_permutation,[status(thm)],[c_0_16]) ).
cnf(c_0_17_1,axiom,
( divide(divide(X1,X2),divide(X1,X3)) = zero
| divide(X3,X2) != zero ),
inference(literals_permutation,[status(thm)],[c_0_17]) ).
cnf(c_0_17_2,axiom,
( divide(X3,X2) != zero
| divide(divide(X1,X2),divide(X1,X3)) = zero ),
inference(literals_permutation,[status(thm)],[c_0_17]) ).
cnf(c_0_18_1,axiom,
( divide(X1,X2) = zero
| divide(X3,X2) != zero
| divide(X1,X3) != zero ),
inference(literals_permutation,[status(thm)],[c_0_18]) ).
cnf(c_0_18_2,axiom,
( divide(X3,X2) != zero
| divide(X1,X2) = zero
| divide(X1,X3) != zero ),
inference(literals_permutation,[status(thm)],[c_0_18]) ).
cnf(c_0_18_3,axiom,
( divide(X1,X3) != zero
| divide(X3,X2) != zero
| divide(X1,X2) = zero ),
inference(literals_permutation,[status(thm)],[c_0_18]) ).
cnf(c_0_19_1,axiom,
( X1 = X2
| divide(X2,X1) != zero
| divide(X1,X2) != zero ),
inference(literals_permutation,[status(thm)],[c_0_19]) ).
cnf(c_0_19_2,axiom,
( divide(X2,X1) != zero
| X1 = X2
| divide(X1,X2) != zero ),
inference(literals_permutation,[status(thm)],[c_0_19]) ).
cnf(c_0_19_3,axiom,
( divide(X1,X2) != zero
| divide(X2,X1) != zero
| X1 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_19]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_021,negated_conjecture,
divide(identity,a) != divide(identity,divide(identity,divide(identity,a))),
file('<stdin>',prove_this) ).
fof(c_0_1_022,negated_conjecture,
divide(identity,a) != divide(identity,divide(identity,divide(identity,a))),
c_0_0 ).
fof(c_0_2_023,negated_conjecture,
divide(identity,a) != divide(identity,divide(identity,divide(identity,a))),
c_0_1 ).
cnf(c_0_3_024,negated_conjecture,
divide(identity,a) != divide(identity,divide(identity,divide(identity,a))),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4_025,negated_conjecture,
divide(identity,divide(identity,divide(identity,a))) != divide(identity,a),
c_0_3,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_1,plain,
( divide(divide(X0,X1),X2) = zero
| divide(divide(X0,X2),X1) != zero ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_0ba077.p',c_0_16_2) ).
cnf(c_29,plain,
( divide(divide(X0,X1),X2) = zero
| divide(divide(X0,X2),X1) != zero ),
inference(copy,[status(esa)],[c_1]) ).
cnf(c_24743,plain,
( divide(divide(identity,divide(identity,a)),X0) = zero
| divide(divide(identity,X0),divide(identity,a)) != zero ),
inference(instantiation,[status(thm)],[c_29]) ).
cnf(c_51338,plain,
( divide(divide(identity,divide(identity,a)),a) = zero
| divide(divide(identity,a),divide(identity,a)) != zero ),
inference(instantiation,[status(thm)],[c_24743]) ).
cnf(c_10,plain,
divide(zero,X0) = zero,
file('/export/starexec/sandbox2/tmp/iprover_modulo_0ba077.p',c_0_19_0) ).
cnf(c_38,plain,
divide(zero,X0) = zero,
inference(copy,[status(esa)],[c_10]) ).
cnf(c_26053,plain,
divide(zero,divide(divide(identity,a),divide(identity,a))) = zero,
inference(instantiation,[status(thm)],[c_38]) ).
cnf(c_24847,plain,
( divide(divide(X0,divide(identity,a)),X1) = zero
| divide(divide(X0,X1),divide(identity,a)) != zero ),
inference(instantiation,[status(thm)],[c_29]) ).
cnf(c_25635,plain,
( divide(divide(divide(identity,a),divide(identity,a)),zero) = zero
| divide(divide(divide(identity,a),zero),divide(identity,a)) != zero ),
inference(instantiation,[status(thm)],[c_24847]) ).
cnf(c_2,plain,
( divide(X0,X1) != zero
| divide(divide(X2,X1),divide(X2,X0)) = zero ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_0ba077.p',c_0_17_1) ).
cnf(c_30,plain,
( divide(X0,X1) != zero
| divide(divide(X2,X1),divide(X2,X0)) = zero ),
inference(copy,[status(esa)],[c_2]) ).
cnf(c_25453,plain,
( divide(divide(identity,divide(identity,a)),a) != zero
| divide(divide(identity,a),divide(identity,divide(identity,divide(identity,a)))) = zero ),
inference(instantiation,[status(thm)],[c_30]) ).
cnf(c_25185,plain,
divide(zero,divide(divide(identity,divide(identity,a)),divide(identity,divide(identity,a)))) = zero,
inference(instantiation,[status(thm)],[c_38]) ).
cnf(c_12,plain,
divide(divide(X0,X1),X0) = zero,
file('/export/starexec/sandbox2/tmp/iprover_modulo_0ba077.p',c_0_17_0) ).
cnf(c_40,plain,
divide(divide(X0,X1),X0) = zero,
inference(copy,[status(esa)],[c_12]) ).
cnf(c_24952,plain,
divide(divide(divide(identity,divide(identity,a)),zero),divide(identity,divide(identity,a))) = zero,
inference(instantiation,[status(thm)],[c_40]) ).
cnf(c_24842,plain,
divide(divide(divide(identity,a),X0),divide(identity,a)) = zero,
inference(instantiation,[status(thm)],[c_40]) ).
cnf(c_24844,plain,
divide(divide(divide(identity,a),zero),divide(identity,a)) = zero,
inference(instantiation,[status(thm)],[c_24842]) ).
cnf(c_9,plain,
( X0 = X1
| divide(X1,X0) != zero
| divide(X0,X1) != zero ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_0ba077.p',c_0_19_3) ).
cnf(c_37,plain,
( X0 = X1
| divide(X1,X0) != zero
| divide(X0,X1) != zero ),
inference(copy,[status(esa)],[c_9]) ).
cnf(c_24673,plain,
( divide(divide(X0,divide(identity,a)),zero) != zero
| divide(zero,divide(X0,divide(identity,a))) != zero
| divide(X0,divide(identity,a)) = zero ),
inference(instantiation,[status(thm)],[c_37]) ).
cnf(c_24818,plain,
( divide(divide(divide(identity,a),divide(identity,a)),zero) != zero
| divide(divide(identity,a),divide(identity,a)) = zero
| divide(zero,divide(divide(identity,a),divide(identity,a))) != zero ),
inference(instantiation,[status(thm)],[c_24673]) ).
cnf(c_24690,plain,
( divide(divide(divide(identity,divide(identity,a)),divide(identity,divide(identity,a))),zero) = zero
| divide(divide(divide(identity,divide(identity,a)),zero),divide(identity,divide(identity,a))) != zero ),
inference(instantiation,[status(thm)],[c_29]) ).
cnf(c_24645,plain,
( divide(divide(divide(identity,divide(identity,a)),divide(identity,divide(identity,a))),zero) != zero
| divide(divide(identity,divide(identity,a)),divide(identity,divide(identity,a))) = zero
| divide(zero,divide(divide(identity,divide(identity,a)),divide(identity,divide(identity,a)))) != zero ),
inference(instantiation,[status(thm)],[c_37]) ).
cnf(c_24626,plain,
( divide(divide(identity,divide(identity,divide(identity,a))),divide(identity,a)) = zero
| divide(divide(identity,divide(identity,a)),divide(identity,divide(identity,a))) != zero ),
inference(instantiation,[status(thm)],[c_29]) ).
cnf(c_7,plain,
( divide(X0,X1) != zero
| divide(X1,X0) != zero
| X0 = X1 ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_0ba077.p',c_0_19_1) ).
cnf(c_35,plain,
( divide(X0,X1) != zero
| divide(X1,X0) != zero
| X0 = X1 ),
inference(copy,[status(esa)],[c_7]) ).
cnf(c_24623,plain,
( divide(divide(identity,divide(identity,divide(identity,a))),divide(identity,a)) != zero
| divide(divide(identity,a),divide(identity,divide(identity,divide(identity,a)))) != zero
| divide(identity,divide(identity,divide(identity,a))) = divide(identity,a) ),
inference(instantiation,[status(thm)],[c_35]) ).
cnf(c_14,negated_conjecture,
divide(identity,divide(identity,divide(identity,a))) != divide(identity,a),
file('/export/starexec/sandbox2/tmp/iprover_modulo_0ba077.p',c_0_4) ).
cnf(contradiction,plain,
$false,
inference(minisat,[status(thm)],[c_51338,c_26053,c_25635,c_25453,c_25185,c_24952,c_24844,c_24818,c_24690,c_24645,c_24626,c_24623,c_14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : HEN009-5 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.13 % Command : iprover_modulo %s %d
% 0.13/0.33 % Computer : n004.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Fri Jul 1 13:09:38 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.34 % Running in mono-core mode
% 0.20/0.39 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.39 % Orientation found
% 0.20/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_a304a0.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_0ba077.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_4ee64f | 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.52 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.52 % --bmc1_dump_file -
% 0.20/0.52 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.52 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.52 % --bmc1_ucm_extend_mode 1
% 0.20/0.52 % --bmc1_ucm_init_mode 2
% 0.20/0.52 % --bmc1_ucm_cone_mode none
% 0.20/0.52 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.52 % --bmc1_ucm_relax_model 4
% 0.20/0.52 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.52 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.52 % --bmc1_ucm_layered_model none
% 0.20/0.52 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.52
% 0.20/0.52 % ------ AIG Options
% 0.20/0.52
% 0.20/0.52 % --aig_mode false
% 0.20/0.52
% 0.20/0.52 % ------ Instantiation Options
% 0.20/0.52
% 0.20/0.52 % --instantiation_flag true
% 0.20/0.52 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.52 % --inst_solver_per_active 750
% 0.20/0.52 % --inst_solver_calls_frac 0.5
% 0.20/0.52 % --inst_passive_queue_type priority_queues
% 0.20/0.52 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.52 % --inst_passive_queues_freq [25;2]
% 0.20/0.52 % --inst_dismatching true
% 0.20/0.52 % --inst_eager_unprocessed_to_passive true
% 0.20/0.52 % --inst_prop_sim_given true
% 0.20/0.52 % --inst_prop_sim_new false
% 0.20/0.52 % --inst_orphan_elimination true
% 0.20/0.52 % --inst_learning_loop_flag true
% 0.20/0.52 % --inst_learning_start 3000
% 0.20/0.52 % --inst_learning_factor 2
% 0.20/0.52 % --inst_start_prop_sim_after_learn 3
% 0.20/0.52 % --inst_sel_renew solver
% 0.20/0.52 % --inst_lit_activity_flag true
% 0.20/0.52 % --inst_out_proof true
% 0.20/0.52
% 0.20/0.52 % ------ Resolution Options
% 0.20/0.52
% 0.20/0.52 % --resolution_flag true
% 0.20/0.52 % --res_lit_sel kbo_max
% 0.20/0.52 % --res_to_prop_solver none
% 0.20/0.52 % --res_prop_simpl_new false
% 0.20/0.52 % --res_prop_simpl_given false
% 0.20/0.52 % --res_passive_queue_type priority_queues
% 0.20/0.52 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.52 % --res_passive_queues_freq [15;5]
% 0.20/0.52 % --res_forward_subs full
% 0.20/0.52 % --res_backward_subs full
% 0.20/0.52 % --res_forward_subs_resolution true
% 0.20/0.52 % --res_backward_subs_resolution true
% 0.20/0.52 % --res_orphan_elimination false
% 0.20/0.52 % --res_time_limit 1000.
% 0.20/0.52 % --res_out_proof true
% 0.20/0.52 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_a304a0.s
% 0.20/0.52 % --modulo true
% 0.20/0.52
% 0.20/0.52 % ------ Combination Options
% 0.20/0.52
% 0.20/0.52 % --comb_res_mult 1000
% 0.20/0.52 % --comb_inst_mult 300
% 0.20/0.52 % ------
% 0.20/0.52
% 0.20/0.52 % ------ Parsing...% successful
% 0.20/0.52
% 0.20/0.52 % ------ 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.52
% 0.20/0.52 % ------ Proving...
% 0.20/0.52 % ------ Problem Properties
% 0.20/0.52
% 0.20/0.52 %
% 0.20/0.52 % EPR false
% 0.20/0.52 % Horn true
% 0.20/0.52 % Has equality true
% 0.20/0.52
% 0.20/0.52 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.52
% 0.20/0.52
% 0.20/0.52 Compiling...
% 0.20/0.52 Loading plugin: done.
% 0.20/0.52 % % ------ Current options:
% 0.20/0.52
% 0.20/0.52 % ------ Input Options
% 0.20/0.52
% 0.20/0.52 % --out_options all
% 0.20/0.52 % --tptp_safe_out true
% 0.20/0.52 % --problem_path ""
% 0.20/0.52 % --include_path ""
% 0.20/0.52 % --clausifier .//eprover
% 0.20/0.52 % --clausifier_options --tstp-format
% 0.20/0.52 % --stdin false
% 0.20/0.52 % --dbg_backtrace false
% 0.20/0.52 % --dbg_dump_prop_clauses false
% 0.20/0.52 % --dbg_dump_prop_clauses_file -
% 0.20/0.52 % --dbg_out_stat false
% 0.20/0.52
% 0.20/0.52 % ------ General Options
% 0.20/0.52
% 0.20/0.52 % --fof false
% 0.20/0.52 % --time_out_real 150.
% 0.20/0.52 % --time_out_prep_mult 0.2
% 0.20/0.52 % --time_out_virtual -1.
% 0.20/0.52 % --schedule none
% 0.20/0.52 % --ground_splitting input
% 0.20/0.52 % --splitting_nvd 16
% 0.20/0.52 % --non_eq_to_eq false
% 0.20/0.52 % --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
% 2.17/2.39 % --inst_prop_sim_given true
% 2.17/2.39 % --inst_prop_sim_new false
% 2.17/2.39 % --inst_orphan_elimination true
% 2.17/2.39 % --inst_learning_loop_flag true
% 2.17/2.39 % --inst_learning_start 3000
% 2.17/2.39 % --inst_learning_factor 2
% 2.17/2.39 % --inst_start_prop_sim_after_learn 3
% 2.17/2.39 % --inst_sel_renew solver
% 2.17/2.39 % --inst_lit_activity_flag true
% 2.17/2.39 % --inst_out_proof true
% 2.17/2.39
% 2.17/2.39 % ------ Resolution Options
% 2.17/2.39
% 2.17/2.39 % --resolution_flag true
% 2.17/2.39 % --res_lit_sel kbo_max
% 2.17/2.39 % --res_to_prop_solver none
% 2.17/2.39 % --res_prop_simpl_new false
% 2.17/2.39 % --res_prop_simpl_given false
% 2.17/2.39 % --res_passive_queue_type priority_queues
% 2.17/2.39 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 2.17/2.39 % --res_passive_queues_freq [15;5]
% 2.17/2.39 % --res_forward_subs full
% 2.17/2.39 % --res_backward_subs full
% 2.17/2.39 % --res_forward_subs_resolution true
% 2.17/2.39 % --res_backward_subs_resolution true
% 2.17/2.39 % --res_orphan_elimination false
% 2.17/2.39 % --res_time_limit 1000.
% 2.17/2.39 % --res_out_proof true
% 2.17/2.39 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_a304a0.s
% 2.17/2.39 % --modulo true
% 2.17/2.39
% 2.17/2.39 % ------ Combination Options
% 2.17/2.39
% 2.17/2.39 % --comb_res_mult 1000
% 2.17/2.39 % --comb_inst_mult 300
% 2.17/2.39 % ------
% 2.17/2.39
% 2.17/2.39
% 2.17/2.39
% 2.17/2.39 % ------ Proving...
% 2.17/2.39 %
% 2.17/2.39
% 2.17/2.39
% 2.17/2.39 % ------ Statistics
% 2.17/2.39
% 2.17/2.39 % ------ General
% 2.17/2.39
% 2.17/2.39 % num_of_input_clauses: 15
% 2.17/2.39 % num_of_input_neg_conjectures: 1
% 2.17/2.39 % num_of_splits: 0
% 2.17/2.39 % num_of_split_atoms: 0
% 2.17/2.39 % num_of_sem_filtered_clauses: 0
% 2.17/2.39 % num_of_subtypes: 0
% 2.17/2.39 % monotx_restored_types: 0
% 2.17/2.39 % sat_num_of_epr_types: 0
% 2.17/2.39 % sat_num_of_non_cyclic_types: 0
% 2.17/2.39 % sat_guarded_non_collapsed_types: 0
% 2.17/2.39 % is_epr: 0
% 2.17/2.39 % is_horn: 1
% 2.17/2.39 % has_eq: 1
% 2.17/2.39 % num_pure_diseq_elim: 0
% 2.17/2.39 % simp_replaced_by: 0
% 2.17/2.39 % res_preprocessed: 2
% 2.17/2.39 % prep_upred: 0
% 2.17/2.39 % prep_unflattend: 0
% 2.17/2.39 % pred_elim_cands: 0
% 2.17/2.39 % pred_elim: 0
% 2.17/2.39 % pred_elim_cl: 0
% 2.17/2.39 % pred_elim_cycles: 0
% 2.17/2.39 % forced_gc_time: 0
% 2.17/2.39 % gc_basic_clause_elim: 0
% 2.17/2.39 % parsing_time: 0.
% 2.17/2.39 % sem_filter_time: 0.
% 2.17/2.39 % pred_elim_time: 0.
% 2.17/2.39 % out_proof_time: 0.
% 2.17/2.39 % monotx_time: 0.
% 2.17/2.39 % subtype_inf_time: 0.
% 2.17/2.39 % unif_index_cands_time: 0.006
% 2.17/2.39 % unif_index_add_time: 0.003
% 2.17/2.39 % total_time: 1.987
% 2.17/2.39 % num_of_symbols: 29
% 2.17/2.39 % num_of_terms: 9860
% 2.17/2.39
% 2.17/2.39 % ------ Propositional Solver
% 2.17/2.39
% 2.17/2.39 % prop_solver_calls: 10
% 2.17/2.39 % prop_fast_solver_calls: 3
% 2.17/2.39 % prop_num_of_clauses: 679
% 2.17/2.39 % prop_preprocess_simplified: 1212
% 2.17/2.39 % prop_fo_subsumed: 0
% 2.17/2.39 % prop_solver_time: 0.
% 2.17/2.39 % prop_fast_solver_time: 0.
% 2.17/2.39 % prop_unsat_core_time: 0.
% 2.17/2.39
% 2.17/2.39 % ------ QBF
% 2.17/2.39
% 2.17/2.39 % qbf_q_res: 0
% 2.17/2.39 % qbf_num_tautologies: 0
% 2.17/2.39 % qbf_prep_cycles: 0
% 2.17/2.39
% 2.17/2.39 % ------ BMC1
% 2.17/2.39
% 2.17/2.39 % bmc1_current_bound: -1
% 2.17/2.39 % bmc1_last_solved_bound: -1
% 2.17/2.39 % bmc1_unsat_core_size: -1
% 2.17/2.39 % bmc1_unsat_core_parents_size: -1
% 2.17/2.39 % bmc1_merge_next_fun: 0
% 2.17/2.39 % bmc1_unsat_core_clauses_time: 0.
% 2.17/2.39
% 2.17/2.39 % ------ Instantiation
% 2.17/2.39
% 2.17/2.39 % inst_num_of_clauses: 617
% 2.17/2.39 % inst_num_in_passive: 296
% 2.17/2.39 % inst_num_in_active: 288
% 2.17/2.39 % inst_num_in_unprocessed: 6
% 2.17/2.39 % inst_num_of_loops: 343
% 2.17/2.39 % inst_num_of_learning_restarts: 0
% 2.17/2.39 % inst_num_moves_active_passive: 28
% 2.17/2.39 % inst_lit_activity: 110
% 2.17/2.39 % inst_lit_activity_moves: 0
% 2.17/2.39 % inst_num_tautologies: 23
% 2.17/2.39 % inst_num_prop_implied: 0
% 2.17/2.39 % inst_num_existing_simplified: 0
% 2.17/2.39 % inst_num_eq_res_simplified: 0
% 2.17/2.39 % inst_num_child_elim: 0
% 2.17/2.39 % inst_num_of_dismatching_blockings: 529
% 2.17/2.39 % inst_num_of_non_proper_insts: 1494
% 2.17/2.39 % inst_num_of_duplicates: 840
% 2.17/2.39 % inst_inst_num_from_inst_to_res: 0
% 2.17/2.39 % inst_dismatching_checking_time: 0.001
% 2.17/2.39
% 2.17/2.39 % ------ Resolution
% 2.17/2.39
% 2.17/2.39 % res_num_of_clauses: 9942
% 2.17/2.39 % res_num_in_passive: 8971
% 2.17/2.39 % res_num_in_active: 1093
% 2.17/2.39 % res_num_of_loops: 2000
% 2.17/2.39 % res_forward_subset_subsumed: 6830
% 2.17/2.39 % res_backward_subset_subsumed: 198
% 2.17/2.39 % res_forward_subsumed: 652
% 2.17/2.39 % res_backward_subsumed: 224
% 2.17/2.39 % res_forward_subsumption_resolution: 50
% 2.17/2.39 % res_backward_subsumption_resolution: 1
% 2.17/2.39 % res_clause_to_clause_subsumption: 80615
% 2.17/2.39 % res_orphan_elimination: 0
% 2.17/2.39 % res_tautology_del: 13
% 2.17/2.39 % res_num_eq_res_simplified: 2937
% 2.17/2.39 % res_num_sel_changes: 0
% 2.17/2.39 % res_moves_from_active_to_pass: 0
% 2.17/2.39
% 2.17/2.39 % Status Unsatisfiable
% 2.17/2.39 % SZS status Unsatisfiable
% 2.17/2.39 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------