TSTP Solution File: HEN008-4 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : HEN008-4 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n013.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:20 EDT 2022
% Result : Unsatisfiable 1.34s 1.62s
% Output : CNFRefutation 1.34s
% 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(x_divide_zero_is_x,axiom,
divide(a,zero) = a,
input ).
fof(x_divide_zero_is_x_0,plain,
( divide(a,zero) = a
| $false ),
inference(orientation,[status(thm)],[x_divide_zero_is_x]) ).
cnf(x_divide_x_is_zero,axiom,
divide(X,X) = zero,
input ).
fof(x_divide_x_is_zero_0,plain,
! [X] :
( divide(X,X) = zero
| $false ),
inference(orientation,[status(thm)],[x_divide_x_is_zero]) ).
cnf(zero_divide_anything_is_zero,axiom,
divide(zero,X) = zero,
input ).
fof(zero_divide_anything_is_zero_0,plain,
! [X] :
( divide(zero,X) = zero
| $false ),
inference(orientation,[status(thm)],[zero_divide_anything_is_zero]) ).
cnf(everything_divide_id_is_zero,axiom,
divide(X,identity) = zero,
input ).
fof(everything_divide_id_is_zero_0,plain,
! [X] :
( divide(X,identity) = zero
| $false ),
inference(orientation,[status(thm)],[everything_divide_id_is_zero]) ).
cnf(identity_is_largest,axiom,
less_equal(X,identity),
input ).
fof(identity_is_largest_0,plain,
! [X] :
( less_equal(X,identity)
| $false ),
inference(orientation,[status(thm)],[identity_is_largest]) ).
cnf(zero_is_smallest,axiom,
less_equal(zero,X),
input ).
fof(zero_is_smallest_0,plain,
! [X] :
( less_equal(zero,X)
| $false ),
inference(orientation,[status(thm)],[zero_is_smallest]) ).
cnf(quotient_property,axiom,
less_equal(divide(divide(X,Z),divide(Y,Z)),divide(divide(X,Y),Z)),
input ).
fof(quotient_property_0,plain,
! [X,Y,Z] :
( less_equal(divide(divide(X,Z),divide(Y,Z)),divide(divide(X,Y),Z))
| $false ),
inference(orientation,[status(thm)],[quotient_property]) ).
cnf(quotient_smaller_than_numerator,axiom,
less_equal(divide(X,Y),X),
input ).
fof(quotient_smaller_than_numerator_0,plain,
! [X,Y] :
( less_equal(divide(X,Y),X)
| $false ),
inference(orientation,[status(thm)],[quotient_smaller_than_numerator]) ).
fof(def_lhs_atom1,axiom,
! [Y,X] :
( lhs_atom1(Y,X)
<=> less_equal(divide(X,Y),X) ),
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)
<=> less_equal(divide(divide(X,Z),divide(Y,Z)),divide(divide(X,Y),Z)) ),
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)
<=> less_equal(zero,X) ),
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)
<=> less_equal(X,identity) ),
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]) ).
fof(def_lhs_atom5,axiom,
! [X] :
( lhs_atom5(X)
<=> divide(X,identity) = zero ),
inference(definition,[],]) ).
fof(to_be_clausified_4,plain,
! [X] :
( lhs_atom5(X)
| $false ),
inference(fold_definition,[status(thm)],[everything_divide_id_is_zero_0,def_lhs_atom5]) ).
fof(def_lhs_atom6,axiom,
! [X] :
( lhs_atom6(X)
<=> divide(zero,X) = zero ),
inference(definition,[],]) ).
fof(to_be_clausified_5,plain,
! [X] :
( lhs_atom6(X)
| $false ),
inference(fold_definition,[status(thm)],[zero_divide_anything_is_zero_0,def_lhs_atom6]) ).
fof(def_lhs_atom7,axiom,
! [X] :
( lhs_atom7(X)
<=> divide(X,X) = zero ),
inference(definition,[],]) ).
fof(to_be_clausified_6,plain,
! [X] :
( lhs_atom7(X)
| $false ),
inference(fold_definition,[status(thm)],[x_divide_x_is_zero_0,def_lhs_atom7]) ).
fof(def_lhs_atom8,axiom,
( lhs_atom8
<=> divide(a,zero) = a ),
inference(definition,[],]) ).
fof(to_be_clausified_7,plain,
( lhs_atom8
| $false ),
inference(fold_definition,[status(thm)],[x_divide_zero_is_x_0,def_lhs_atom8]) ).
% 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_atom7(X2)
| ~ $true ),
file('<stdin>',to_be_clausified_6) ).
fof(c_0_3,axiom,
! [X2] :
( lhs_atom6(X2)
| ~ $true ),
file('<stdin>',to_be_clausified_5) ).
fof(c_0_4,axiom,
! [X2] :
( lhs_atom5(X2)
| ~ $true ),
file('<stdin>',to_be_clausified_4) ).
fof(c_0_5,axiom,
! [X2] :
( lhs_atom4(X2)
| ~ $true ),
file('<stdin>',to_be_clausified_3) ).
fof(c_0_6,axiom,
! [X2] :
( lhs_atom3(X2)
| ~ $true ),
file('<stdin>',to_be_clausified_2) ).
fof(c_0_7,axiom,
( lhs_atom8
| ~ $true ),
file('<stdin>',to_be_clausified_7) ).
fof(c_0_8,plain,
! [X3,X1,X2] : lhs_atom2(X3,X1,X2),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_9,plain,
! [X1,X2] : lhs_atom1(X1,X2),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_10,plain,
! [X2] : lhs_atom7(X2),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_11,plain,
! [X2] : lhs_atom6(X2),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_12,plain,
! [X2] : lhs_atom5(X2),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_13,plain,
! [X2] : lhs_atom4(X2),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_14,plain,
! [X2] : lhs_atom3(X2),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_15,plain,
lhs_atom8,
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_16,plain,
! [X4,X5,X6] : lhs_atom2(X4,X5,X6),
inference(variable_rename,[status(thm)],[c_0_8]) ).
fof(c_0_17,plain,
! [X3,X4] : lhs_atom1(X3,X4),
inference(variable_rename,[status(thm)],[c_0_9]) ).
fof(c_0_18,plain,
! [X3] : lhs_atom7(X3),
inference(variable_rename,[status(thm)],[c_0_10]) ).
fof(c_0_19,plain,
! [X3] : lhs_atom6(X3),
inference(variable_rename,[status(thm)],[c_0_11]) ).
fof(c_0_20,plain,
! [X3] : lhs_atom5(X3),
inference(variable_rename,[status(thm)],[c_0_12]) ).
fof(c_0_21,plain,
! [X3] : lhs_atom4(X3),
inference(variable_rename,[status(thm)],[c_0_13]) ).
fof(c_0_22,plain,
! [X3] : lhs_atom3(X3),
inference(variable_rename,[status(thm)],[c_0_14]) ).
fof(c_0_23,plain,
lhs_atom8,
c_0_15 ).
cnf(c_0_24,plain,
lhs_atom2(X1,X2,X3),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_25,plain,
lhs_atom1(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_26,plain,
lhs_atom7(X1),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_27,plain,
lhs_atom6(X1),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_28,plain,
lhs_atom5(X1),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_29,plain,
lhs_atom4(X1),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_30,plain,
lhs_atom3(X1),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_31,plain,
lhs_atom8,
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_32,plain,
lhs_atom2(X1,X2,X3),
c_0_24,
[final] ).
cnf(c_0_33,plain,
lhs_atom1(X1,X2),
c_0_25,
[final] ).
cnf(c_0_34,plain,
lhs_atom7(X1),
c_0_26,
[final] ).
cnf(c_0_35,plain,
lhs_atom6(X1),
c_0_27,
[final] ).
cnf(c_0_36,plain,
lhs_atom5(X1),
c_0_28,
[final] ).
cnf(c_0_37,plain,
lhs_atom4(X1),
c_0_29,
[final] ).
cnf(c_0_38,plain,
lhs_atom3(X1),
c_0_30,
[final] ).
cnf(c_0_39,plain,
lhs_atom8,
c_0_31,
[final] ).
% End CNF derivation
cnf(c_0_32_0,axiom,
less_equal(divide(divide(X3,X1),divide(X2,X1)),divide(divide(X3,X2),X1)),
inference(unfold_definition,[status(thm)],[c_0_32,def_lhs_atom2]) ).
cnf(c_0_33_0,axiom,
less_equal(divide(X2,X1),X2),
inference(unfold_definition,[status(thm)],[c_0_33,def_lhs_atom1]) ).
cnf(c_0_34_0,axiom,
divide(X1,X1) = zero,
inference(unfold_definition,[status(thm)],[c_0_34,def_lhs_atom7]) ).
cnf(c_0_35_0,axiom,
divide(zero,X1) = zero,
inference(unfold_definition,[status(thm)],[c_0_35,def_lhs_atom6]) ).
cnf(c_0_36_0,axiom,
divide(X1,identity) = zero,
inference(unfold_definition,[status(thm)],[c_0_36,def_lhs_atom5]) ).
cnf(c_0_37_0,axiom,
less_equal(X1,identity),
inference(unfold_definition,[status(thm)],[c_0_37,def_lhs_atom4]) ).
cnf(c_0_38_0,axiom,
less_equal(zero,X1),
inference(unfold_definition,[status(thm)],[c_0_38,def_lhs_atom3]) ).
cnf(c_0_39_0,axiom,
divide(a,zero) = a,
inference(unfold_definition,[status(thm)],[c_0_39,def_lhs_atom8]) ).
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
fof(c_0_0_001,axiom,
! [X1,X2,X3] :
( ~ less_equal(divide(X3,X2),X1)
| less_equal(divide(X3,X1),X2) ),
file('<stdin>',property_of_divide1) ).
fof(c_0_1_002,axiom,
! [X1,X2,X3] :
( ~ less_equal(X3,X2)
| less_equal(divide(X1,X2),divide(X1,X3)) ),
file('<stdin>',property_of_divide2) ).
fof(c_0_2_003,axiom,
! [X1,X2,X3] :
( ~ less_equal(X3,X2)
| ~ less_equal(X2,X1)
| less_equal(X3,X1) ),
file('<stdin>',transitivity_of_less_equal) ).
fof(c_0_3_004,axiom,
! [X2,X3] :
( ~ less_equal(X3,X2)
| ~ less_equal(X2,X3)
| X3 = X2 ),
file('<stdin>',less_equal_and_equal) ).
fof(c_0_4_005,axiom,
! [X2,X3] :
( ~ less_equal(X3,X2)
| divide(X3,X2) = zero ),
file('<stdin>',quotient_less_equal1) ).
fof(c_0_5_006,axiom,
! [X2,X3] :
( divide(X3,X2) != zero
| less_equal(X3,X2) ),
file('<stdin>',quotient_less_equal2) ).
fof(c_0_6_007,plain,
! [X1,X2,X3] :
( ~ less_equal(divide(X3,X2),X1)
| less_equal(divide(X3,X1),X2) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_7_008,plain,
! [X1,X2,X3] :
( ~ less_equal(X3,X2)
| less_equal(divide(X1,X2),divide(X1,X3)) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_8_009,plain,
! [X1,X2,X3] :
( ~ less_equal(X3,X2)
| ~ less_equal(X2,X1)
| less_equal(X3,X1) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_9_010,plain,
! [X2,X3] :
( ~ less_equal(X3,X2)
| ~ less_equal(X2,X3)
| X3 = X2 ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_10_011,plain,
! [X2,X3] :
( ~ less_equal(X3,X2)
| divide(X3,X2) = zero ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_11_012,axiom,
! [X2,X3] :
( divide(X3,X2) != zero
| less_equal(X3,X2) ),
c_0_5 ).
fof(c_0_12_013,plain,
! [X4,X5,X6] :
( ~ less_equal(divide(X6,X5),X4)
| less_equal(divide(X6,X4),X5) ),
inference(variable_rename,[status(thm)],[c_0_6]) ).
fof(c_0_13_014,plain,
! [X4,X5,X6] :
( ~ less_equal(X6,X5)
| less_equal(divide(X4,X5),divide(X4,X6)) ),
inference(variable_rename,[status(thm)],[c_0_7]) ).
fof(c_0_14_015,plain,
! [X4,X5,X6] :
( ~ less_equal(X6,X5)
| ~ less_equal(X5,X4)
| less_equal(X6,X4) ),
inference(variable_rename,[status(thm)],[c_0_8]) ).
fof(c_0_15_016,plain,
! [X4,X5] :
( ~ less_equal(X5,X4)
| ~ less_equal(X4,X5)
| X5 = X4 ),
inference(variable_rename,[status(thm)],[c_0_9]) ).
fof(c_0_16_017,plain,
! [X4,X5] :
( ~ less_equal(X5,X4)
| divide(X5,X4) = zero ),
inference(variable_rename,[status(thm)],[c_0_10]) ).
fof(c_0_17_018,plain,
! [X4,X5] :
( divide(X5,X4) != zero
| less_equal(X5,X4) ),
inference(variable_rename,[status(thm)],[c_0_11]) ).
cnf(c_0_18_019,plain,
( less_equal(divide(X1,X2),X3)
| ~ less_equal(divide(X1,X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19_020,plain,
( less_equal(divide(X1,X2),divide(X1,X3))
| ~ less_equal(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20_021,plain,
( less_equal(X1,X2)
| ~ less_equal(X3,X2)
| ~ less_equal(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21_022,plain,
( X1 = X2
| ~ less_equal(X2,X1)
| ~ less_equal(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22_023,plain,
( divide(X1,X2) = zero
| ~ less_equal(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23_024,plain,
( less_equal(X1,X2)
| divide(X1,X2) != zero ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24_025,plain,
( less_equal(divide(X1,X2),X3)
| ~ less_equal(divide(X1,X3),X2) ),
c_0_18,
[final] ).
cnf(c_0_25_026,plain,
( less_equal(divide(X1,X2),divide(X1,X3))
| ~ less_equal(X3,X2) ),
c_0_19,
[final] ).
cnf(c_0_26_027,plain,
( less_equal(X1,X2)
| ~ less_equal(X3,X2)
| ~ less_equal(X1,X3) ),
c_0_20,
[final] ).
cnf(c_0_27_028,plain,
( X1 = X2
| ~ less_equal(X2,X1)
| ~ less_equal(X1,X2) ),
c_0_21,
[final] ).
cnf(c_0_28_029,plain,
( divide(X1,X2) = zero
| ~ less_equal(X1,X2) ),
c_0_22,
[final] ).
cnf(c_0_29_030,plain,
( less_equal(X1,X2)
| divide(X1,X2) != zero ),
c_0_23,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_24_0,axiom,
( less_equal(divide(X1,X2),X3)
| ~ less_equal(divide(X1,X3),X2) ),
inference(literals_permutation,[status(thm)],[c_0_24]) ).
cnf(c_0_24_1,axiom,
( ~ less_equal(divide(X1,X3),X2)
| less_equal(divide(X1,X2),X3) ),
inference(literals_permutation,[status(thm)],[c_0_24]) ).
cnf(c_0_25_0,axiom,
( less_equal(divide(X1,X2),divide(X1,X3))
| ~ less_equal(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_25]) ).
cnf(c_0_25_1,axiom,
( ~ less_equal(X3,X2)
| less_equal(divide(X1,X2),divide(X1,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_25]) ).
cnf(c_0_26_0,axiom,
( less_equal(X1,X2)
| ~ less_equal(X3,X2)
| ~ less_equal(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_26]) ).
cnf(c_0_26_1,axiom,
( ~ less_equal(X3,X2)
| less_equal(X1,X2)
| ~ less_equal(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_26]) ).
cnf(c_0_26_2,axiom,
( ~ less_equal(X1,X3)
| ~ less_equal(X3,X2)
| less_equal(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_26]) ).
cnf(c_0_27_0,axiom,
( X1 = X2
| ~ less_equal(X2,X1)
| ~ less_equal(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_27]) ).
cnf(c_0_27_1,axiom,
( ~ less_equal(X2,X1)
| X1 = X2
| ~ less_equal(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_27]) ).
cnf(c_0_27_2,axiom,
( ~ less_equal(X1,X2)
| ~ less_equal(X2,X1)
| X1 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_27]) ).
cnf(c_0_28_0,axiom,
( divide(X1,X2) = zero
| ~ less_equal(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_28]) ).
cnf(c_0_28_1,axiom,
( ~ less_equal(X1,X2)
| divide(X1,X2) = zero ),
inference(literals_permutation,[status(thm)],[c_0_28]) ).
cnf(c_0_29_0,axiom,
( less_equal(X1,X2)
| divide(X1,X2) != zero ),
inference(literals_permutation,[status(thm)],[c_0_29]) ).
cnf(c_0_29_1,axiom,
( divide(X1,X2) != zero
| less_equal(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_29]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_031,negated_conjecture,
~ less_equal(divide(a,c),divide(b,c)),
file('<stdin>',prove_a_divide_c_LE_b_divide_c) ).
fof(c_0_1_032,hypothesis,
less_equal(a,b),
file('<stdin>',a_LE_b) ).
fof(c_0_2_033,negated_conjecture,
~ less_equal(divide(a,c),divide(b,c)),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_3_034,hypothesis,
less_equal(a,b),
c_0_1 ).
fof(c_0_4_035,negated_conjecture,
~ less_equal(divide(a,c),divide(b,c)),
c_0_2 ).
fof(c_0_5_036,hypothesis,
less_equal(a,b),
c_0_3 ).
cnf(c_0_6_037,negated_conjecture,
~ less_equal(divide(a,c),divide(b,c)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7_038,hypothesis,
less_equal(a,b),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8_039,negated_conjecture,
~ less_equal(divide(a,c),divide(b,c)),
c_0_6,
[final] ).
cnf(c_0_9_040,hypothesis,
less_equal(a,b),
c_0_7,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_22,negated_conjecture,
~ less_equal(divide(a,c),divide(b,c)),
file('/export/starexec/sandbox2/tmp/iprover_modulo_6892b3.p',c_0_8) ).
cnf(c_34,negated_conjecture,
~ less_equal(divide(a,c),divide(b,c)),
inference(copy,[status(esa)],[c_22]) ).
cnf(c_38,negated_conjecture,
~ less_equal(divide(a,c),divide(b,c)),
inference(copy,[status(esa)],[c_34]) ).
cnf(c_41,negated_conjecture,
~ less_equal(divide(a,c),divide(b,c)),
inference(copy,[status(esa)],[c_38]) ).
cnf(c_42,negated_conjecture,
~ less_equal(divide(a,c),divide(b,c)),
inference(copy,[status(esa)],[c_41]) ).
cnf(c_108,plain,
~ less_equal(divide(a,c),divide(b,c)),
inference(copy,[status(esa)],[c_42]) ).
cnf(c_12,plain,
( divide(X0,X1) != zero
| less_equal(X0,X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_6892b3.p',c_0_29_0) ).
cnf(c_92,plain,
( divide(X0,X1) != zero
| less_equal(X0,X1) ),
inference(copy,[status(esa)],[c_12]) ).
cnf(c_93,plain,
( less_equal(X0,X1)
| divide(X0,X1) != zero ),
inference(rewriting,[status(thm)],[c_92]) ).
cnf(c_116,plain,
divide(divide(a,c),divide(b,c)) != zero,
inference(resolution,[status(thm)],[c_108,c_93]) ).
cnf(c_117,plain,
divide(divide(a,c),divide(b,c)) != zero,
inference(rewriting,[status(thm)],[c_116]) ).
cnf(c_7,plain,
( ~ less_equal(X0,X1)
| ~ less_equal(X1,X0)
| X0 = X1 ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_6892b3.p',c_0_27_0) ).
cnf(c_82,plain,
( ~ less_equal(X0,X1)
| ~ less_equal(X1,X0)
| X0 = X1 ),
inference(copy,[status(esa)],[c_7]) ).
cnf(c_130,plain,
( ~ less_equal(divide(divide(a,c),divide(b,c)),zero)
| ~ less_equal(zero,divide(divide(a,c),divide(b,c))) ),
inference(resolution,[status(thm)],[c_117,c_82]) ).
cnf(c_131,plain,
( ~ less_equal(divide(divide(a,c),divide(b,c)),zero)
| ~ less_equal(zero,divide(divide(a,c),divide(b,c))) ),
inference(rewriting,[status(thm)],[c_130]) ).
cnf(c_15,plain,
less_equal(zero,X0),
file('/export/starexec/sandbox2/tmp/iprover_modulo_6892b3.p',c_0_38_0) ).
cnf(c_97,plain,
less_equal(zero,X0),
inference(copy,[status(esa)],[c_15]) ).
cnf(c_238,plain,
~ less_equal(divide(divide(a,c),divide(b,c)),zero),
inference(forward_subsumption_resolution,[status(thm)],[c_131,c_97]) ).
cnf(c_239,plain,
~ less_equal(divide(divide(a,c),divide(b,c)),zero),
inference(rewriting,[status(thm)],[c_238]) ).
cnf(c_4,plain,
( ~ less_equal(X0,X1)
| ~ less_equal(X1,X2)
| less_equal(X0,X2) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_6892b3.p',c_0_26_0) ).
cnf(c_76,plain,
( ~ less_equal(X0,X1)
| ~ less_equal(X1,X2)
| less_equal(X0,X2) ),
inference(copy,[status(esa)],[c_4]) ).
cnf(c_245,plain,
( ~ less_equal(divide(divide(a,c),divide(b,c)),X0)
| ~ less_equal(X0,zero) ),
inference(resolution,[status(thm)],[c_239,c_76]) ).
cnf(c_246,plain,
( ~ less_equal(divide(divide(a,c),divide(b,c)),X0)
| ~ less_equal(X0,zero) ),
inference(rewriting,[status(thm)],[c_245]) ).
cnf(c_21,plain,
less_equal(divide(divide(X0,X1),divide(X2,X1)),divide(divide(X0,X2),X1)),
file('/export/starexec/sandbox2/tmp/iprover_modulo_6892b3.p',c_0_32_0) ).
cnf(c_106,plain,
less_equal(divide(divide(X0,X1),divide(X2,X1)),divide(divide(X0,X2),X1)),
inference(copy,[status(esa)],[c_21]) ).
cnf(c_759,plain,
~ less_equal(divide(divide(a,b),c),zero),
inference(resolution,[status(thm)],[c_246,c_106]) ).
cnf(c_760,plain,
~ less_equal(divide(divide(a,b),c),zero),
inference(rewriting,[status(thm)],[c_759]) ).
cnf(c_1556,plain,
( ~ less_equal(divide(divide(a,b),c),X0)
| ~ less_equal(X0,zero) ),
inference(resolution,[status(thm)],[c_760,c_76]) ).
cnf(c_1557,plain,
( ~ less_equal(divide(divide(a,b),c),X0)
| ~ less_equal(X0,zero) ),
inference(rewriting,[status(thm)],[c_1556]) ).
cnf(c_20,plain,
less_equal(divide(X0,X1),X0),
file('/export/starexec/sandbox2/tmp/iprover_modulo_6892b3.p',c_0_33_0) ).
cnf(c_104,plain,
less_equal(divide(X0,X1),X0),
inference(copy,[status(esa)],[c_20]) ).
cnf(c_8591,plain,
~ less_equal(divide(a,b),zero),
inference(resolution,[status(thm)],[c_1557,c_104]) ).
cnf(c_8592,plain,
~ less_equal(divide(a,b),zero),
inference(rewriting,[status(thm)],[c_8591]) ).
cnf(c_23,plain,
less_equal(a,b),
file('/export/starexec/sandbox2/tmp/iprover_modulo_6892b3.p',c_0_9) ).
cnf(c_32,plain,
less_equal(a,b),
inference(copy,[status(esa)],[c_23]) ).
cnf(c_39,plain,
less_equal(a,b),
inference(copy,[status(esa)],[c_32]) ).
cnf(c_40,plain,
less_equal(a,b),
inference(copy,[status(esa)],[c_39]) ).
cnf(c_43,plain,
less_equal(a,b),
inference(copy,[status(esa)],[c_40]) ).
cnf(c_110,plain,
less_equal(a,b),
inference(copy,[status(esa)],[c_43]) ).
cnf(c_5,plain,
( ~ less_equal(X0,X1)
| less_equal(X0,X2)
| ~ less_equal(X1,X2) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_6892b3.p',c_0_26_1) ).
cnf(c_78,plain,
( ~ less_equal(X0,X1)
| less_equal(X0,X2)
| ~ less_equal(X1,X2) ),
inference(copy,[status(esa)],[c_5]) ).
cnf(c_267,plain,
( ~ less_equal(X0,a)
| less_equal(X0,b) ),
inference(resolution,[status(thm)],[c_110,c_78]) ).
cnf(c_268,plain,
( ~ less_equal(X0,a)
| less_equal(X0,b) ),
inference(rewriting,[status(thm)],[c_267]) ).
cnf(c_1,plain,
( less_equal(divide(X0,X1),X2)
| ~ less_equal(divide(X0,X2),X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_6892b3.p',c_0_24_1) ).
cnf(c_70,plain,
( less_equal(divide(X0,X1),X2)
| ~ less_equal(divide(X0,X2),X1) ),
inference(copy,[status(esa)],[c_1]) ).
cnf(c_283,plain,
( less_equal(divide(X0,b),X1)
| ~ less_equal(divide(X0,X1),a) ),
inference(resolution,[status(thm)],[c_268,c_70]) ).
cnf(c_284,plain,
( less_equal(divide(X0,b),X1)
| ~ less_equal(divide(X0,X1),a) ),
inference(rewriting,[status(thm)],[c_283]) ).
cnf(c_719,plain,
less_equal(divide(a,b),X0),
inference(resolution,[status(thm)],[c_284,c_104]) ).
cnf(c_720,plain,
less_equal(divide(a,b),X0),
inference(rewriting,[status(thm)],[c_719]) ).
cnf(c_30893,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_8592,c_720]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : HEN008-4 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : iprover_modulo %s %d
% 0.13/0.34 % Computer : n013.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.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Fri Jul 1 13:16:59 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.35 % Running in mono-core mode
% 0.21/0.41 % Orienting using strategy Equiv(ClausalAll)
% 0.21/0.41 % Orientation found
% 0.21/0.41 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_90622a.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_6892b3.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_50b2d8 | grep -v "SZS"
% 0.21/0.44
% 0.21/0.44 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.21/0.44
% 0.21/0.44 %
% 0.21/0.44 % ------ iProver source info
% 0.21/0.44
% 0.21/0.44 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.21/0.44 % git: non_committed_changes: true
% 0.21/0.44 % git: last_make_outside_of_git: true
% 0.21/0.44
% 0.21/0.44 %
% 0.21/0.44 % ------ Input Options
% 0.21/0.44
% 0.21/0.44 % --out_options all
% 0.21/0.44 % --tptp_safe_out true
% 0.21/0.44 % --problem_path ""
% 0.21/0.44 % --include_path ""
% 0.21/0.44 % --clausifier .//eprover
% 0.21/0.44 % --clausifier_options --tstp-format
% 0.21/0.44 % --stdin false
% 0.21/0.44 % --dbg_backtrace false
% 0.21/0.44 % --dbg_dump_prop_clauses false
% 0.21/0.44 % --dbg_dump_prop_clauses_file -
% 0.21/0.44 % --dbg_out_stat false
% 0.21/0.44
% 0.21/0.44 % ------ General Options
% 0.21/0.44
% 0.21/0.44 % --fof false
% 0.21/0.44 % --time_out_real 150.
% 0.21/0.44 % --time_out_prep_mult 0.2
% 0.21/0.44 % --time_out_virtual -1.
% 0.21/0.44 % --schedule none
% 0.21/0.44 % --ground_splitting input
% 0.21/0.44 % --splitting_nvd 16
% 0.21/0.44 % --non_eq_to_eq false
% 0.21/0.44 % --prep_gs_sim true
% 0.21/0.44 % --prep_unflatten false
% 0.21/0.44 % --prep_res_sim true
% 0.21/0.44 % --prep_upred true
% 0.21/0.44 % --res_sim_input true
% 0.21/0.44 % --clause_weak_htbl true
% 0.21/0.44 % --gc_record_bc_elim false
% 0.21/0.44 % --symbol_type_check false
% 0.21/0.44 % --clausify_out false
% 0.21/0.44 % --large_theory_mode false
% 0.21/0.44 % --prep_sem_filter none
% 0.21/0.44 % --prep_sem_filter_out false
% 0.21/0.44 % --preprocessed_out false
% 0.21/0.44 % --sub_typing false
% 0.21/0.44 % --brand_transform false
% 0.21/0.44 % --pure_diseq_elim true
% 0.21/0.44 % --min_unsat_core false
% 0.21/0.44 % --pred_elim true
% 0.21/0.44 % --add_important_lit false
% 0.21/0.44 % --soft_assumptions false
% 0.21/0.44 % --reset_solvers false
% 0.21/0.44 % --bc_imp_inh []
% 0.21/0.44 % --conj_cone_tolerance 1.5
% 0.21/0.44 % --prolific_symb_bound 500
% 0.21/0.44 % --lt_threshold 2000
% 0.21/0.44
% 0.21/0.44 % ------ SAT Options
% 0.21/0.44
% 0.21/0.44 % --sat_mode false
% 0.21/0.44 % --sat_fm_restart_options ""
% 0.21/0.44 % --sat_gr_def false
% 0.21/0.44 % --sat_epr_types true
% 0.21/0.44 % --sat_non_cyclic_types false
% 0.21/0.44 % --sat_finite_models false
% 0.21/0.44 % --sat_fm_lemmas false
% 0.21/0.44 % --sat_fm_prep false
% 0.21/0.44 % --sat_fm_uc_incr true
% 0.21/0.44 % --sat_out_model small
% 0.21/0.44 % --sat_out_clauses false
% 0.21/0.44
% 0.21/0.44 % ------ QBF Options
% 0.21/0.44
% 0.21/0.44 % --qbf_mode false
% 0.21/0.44 % --qbf_elim_univ true
% 0.21/0.44 % --qbf_sk_in true
% 0.21/0.44 % --qbf_pred_elim true
% 0.21/0.44 % --qbf_split 32
% 0.21/0.44
% 0.21/0.44 % ------ BMC1 Options
% 0.21/0.44
% 0.21/0.44 % --bmc1_incremental false
% 0.21/0.44 % --bmc1_axioms reachable_all
% 0.21/0.44 % --bmc1_min_bound 0
% 0.21/0.44 % --bmc1_max_bound -1
% 0.21/0.44 % --bmc1_max_bound_default -1
% 0.21/0.44 % --bmc1_symbol_reachability true
% 0.21/0.44 % --bmc1_property_lemmas false
% 0.21/0.44 % --bmc1_k_induction false
% 0.21/0.44 % --bmc1_non_equiv_states false
% 0.21/0.44 % --bmc1_deadlock false
% 0.21/0.44 % --bmc1_ucm false
% 0.21/0.44 % --bmc1_add_unsat_core none
% 0.21/0.44 % --bmc1_unsat_core_children false
% 0.21/0.44 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.44 % --bmc1_out_stat full
% 0.21/0.44 % --bmc1_ground_init false
% 0.21/0.44 % --bmc1_pre_inst_next_state false
% 0.21/0.44 % --bmc1_pre_inst_state false
% 0.21/0.44 % --bmc1_pre_inst_reach_state false
% 0.21/0.44 % --bmc1_out_unsat_core false
% 0.21/0.44 % --bmc1_aig_witness_out false
% 0.21/0.44 % --bmc1_verbose false
% 0.21/0.44 % --bmc1_dump_clauses_tptp false
% 0.40/0.67 % --bmc1_dump_unsat_core_tptp false
% 0.40/0.67 % --bmc1_dump_file -
% 0.40/0.67 % --bmc1_ucm_expand_uc_limit 128
% 0.40/0.67 % --bmc1_ucm_n_expand_iterations 6
% 0.40/0.67 % --bmc1_ucm_extend_mode 1
% 0.40/0.67 % --bmc1_ucm_init_mode 2
% 0.40/0.67 % --bmc1_ucm_cone_mode none
% 0.40/0.67 % --bmc1_ucm_reduced_relation_type 0
% 0.40/0.67 % --bmc1_ucm_relax_model 4
% 0.40/0.67 % --bmc1_ucm_full_tr_after_sat true
% 0.40/0.67 % --bmc1_ucm_expand_neg_assumptions false
% 0.40/0.67 % --bmc1_ucm_layered_model none
% 0.40/0.67 % --bmc1_ucm_max_lemma_size 10
% 0.40/0.67
% 0.40/0.67 % ------ AIG Options
% 0.40/0.67
% 0.40/0.67 % --aig_mode false
% 0.40/0.67
% 0.40/0.67 % ------ Instantiation Options
% 0.40/0.67
% 0.40/0.67 % --instantiation_flag true
% 0.40/0.67 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.40/0.67 % --inst_solver_per_active 750
% 0.40/0.67 % --inst_solver_calls_frac 0.5
% 0.40/0.67 % --inst_passive_queue_type priority_queues
% 0.40/0.67 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.40/0.67 % --inst_passive_queues_freq [25;2]
% 0.40/0.67 % --inst_dismatching true
% 0.40/0.67 % --inst_eager_unprocessed_to_passive true
% 0.40/0.67 % --inst_prop_sim_given true
% 0.40/0.67 % --inst_prop_sim_new false
% 0.40/0.67 % --inst_orphan_elimination true
% 0.40/0.67 % --inst_learning_loop_flag true
% 0.40/0.67 % --inst_learning_start 3000
% 0.40/0.67 % --inst_learning_factor 2
% 0.40/0.67 % --inst_start_prop_sim_after_learn 3
% 0.40/0.67 % --inst_sel_renew solver
% 0.40/0.67 % --inst_lit_activity_flag true
% 0.40/0.67 % --inst_out_proof true
% 0.40/0.67
% 0.40/0.67 % ------ Resolution Options
% 0.40/0.67
% 0.40/0.67 % --resolution_flag true
% 0.40/0.67 % --res_lit_sel kbo_max
% 0.40/0.67 % --res_to_prop_solver none
% 0.40/0.67 % --res_prop_simpl_new false
% 0.40/0.67 % --res_prop_simpl_given false
% 0.40/0.67 % --res_passive_queue_type priority_queues
% 0.40/0.67 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.40/0.67 % --res_passive_queues_freq [15;5]
% 0.40/0.67 % --res_forward_subs full
% 0.40/0.67 % --res_backward_subs full
% 0.40/0.67 % --res_forward_subs_resolution true
% 0.40/0.67 % --res_backward_subs_resolution true
% 0.40/0.67 % --res_orphan_elimination false
% 0.40/0.67 % --res_time_limit 1000.
% 0.40/0.67 % --res_out_proof true
% 0.40/0.67 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_90622a.s
% 0.40/0.67 % --modulo true
% 0.40/0.67
% 0.40/0.67 % ------ Combination Options
% 0.40/0.67
% 0.40/0.67 % --comb_res_mult 1000
% 0.40/0.67 % --comb_inst_mult 300
% 0.40/0.67 % ------
% 0.40/0.67
% 0.40/0.67 % ------ Parsing...% successful
% 0.40/0.67
% 0.40/0.67 % ------ 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.40/0.67
% 0.40/0.67 % ------ Proving...
% 0.40/0.67 % ------ Problem Properties
% 0.40/0.67
% 0.40/0.67 %
% 0.40/0.67 % EPR false
% 0.40/0.67 % Horn true
% 0.40/0.67 % Has equality true
% 0.40/0.67
% 0.40/0.67 % % ------ Input Options Time Limit: Unbounded
% 0.40/0.67
% 0.40/0.67
% 0.40/0.67 Compiling...
% 0.40/0.67 Loading plugin: done.
% 0.40/0.67 Compiling...
% 0.40/0.67 Loading plugin: done.
% 0.40/0.67 % % ------ Current options:
% 0.40/0.67
% 0.40/0.67 % ------ Input Options
% 0.40/0.67
% 0.40/0.67 % --out_options all
% 0.40/0.67 % --tptp_safe_out true
% 0.40/0.67 % --problem_path ""
% 0.40/0.67 % --include_path ""
% 0.40/0.67 % --clausifier .//eprover
% 0.40/0.67 % --clausifier_options --tstp-format
% 0.40/0.67 % --stdin false
% 0.40/0.67 % --dbg_backtrace false
% 0.40/0.67 % --dbg_dump_prop_clauses false
% 0.40/0.67 % --dbg_dump_prop_clauses_file -
% 0.40/0.67 % --dbg_out_stat false
% 0.40/0.67
% 0.40/0.67 % ------ General Options
% 0.40/0.67
% 0.40/0.67 % --fof false
% 0.40/0.67 % --time_out_real 150.
% 0.40/0.67 % --time_out_prep_mult 0.2
% 0.40/0.67 % --time_out_virtual -1.
% 0.40/0.67 % --schedule none
% 0.40/0.67 % --ground_splitting input
% 0.40/0.67 % --splitting_nvd 16
% 0.40/0.67 % --non_eq_to_eq false
% 0.40/0.67 % --prep_gs_sim true
% 0.40/0.67 % --prep_unflatten false
% 0.40/0.67 % --prep_res_sim true
% 0.40/0.67 % --prep_upred true
% 0.40/0.67 % --res_sim_input true
% 0.40/0.67 % --clause_weak_htbl true
% 0.40/0.67 % --gc_record_bc_elim false
% 0.40/0.67 % --symbol_type_check false
% 0.40/0.67 % --clausify_out false
% 0.40/0.67 % --large_theory_mode false
% 0.40/0.67 % --prep_sem_filter none
% 0.40/0.67 % --prep_sem_filter_out false
% 0.40/0.67 % --preprocessed_out false
% 0.40/0.67 % --sub_typing false
% 0.40/0.67 % --brand_transform false
% 0.40/0.67 % --pure_diseq_elim true
% 0.40/0.67 % --min_unsat_core false
% 0.40/0.67 % --pred_elim true
% 0.40/0.67 % --add_important_lit false
% 0.40/0.67 % --soft_assumptions false
% 0.40/0.67 % --reset_solvers false
% 0.40/0.67 % --bc_imp_inh []
% 0.40/0.67 % --conj_cone_tolerance 1.5
% 0.40/0.67 % --prolific_symb_bound 500
% 0.40/0.67 % --lt_threshold 2000
% 0.40/0.67
% 0.40/0.67 % ------ SAT Options
% 0.40/0.67
% 0.40/0.67 % --sat_mode false
% 0.40/0.67 % --sat_fm_restart_options ""
% 0.40/0.67 % --sat_gr_def false
% 0.40/0.67 % --sat_epr_types true
% 0.40/0.67 % --sat_non_cyclic_types false
% 0.40/0.67 % --sat_finite_models false
% 0.40/0.67 % --sat_fm_lemmas false
% 0.40/0.67 % --sat_fm_prep false
% 0.40/0.67 % --sat_fm_uc_incr true
% 0.40/0.67 % --sat_out_model small
% 0.40/0.67 % --sat_out_clauses false
% 0.40/0.67
% 0.40/0.67 % ------ QBF Options
% 0.40/0.67
% 0.40/0.67 % --qbf_mode false
% 0.40/0.67 % --qbf_elim_univ true
% 0.40/0.67 % --qbf_sk_in true
% 0.40/0.67 % --qbf_pred_elim true
% 0.40/0.67 % --qbf_split 32
% 0.40/0.67
% 0.40/0.67 % ------ BMC1 Options
% 0.40/0.67
% 0.40/0.67 % --bmc1_incremental false
% 0.40/0.67 % --bmc1_axioms reachable_all
% 0.40/0.67 % --bmc1_min_bound 0
% 0.40/0.67 % --bmc1_max_bound -1
% 0.40/0.67 % --bmc1_max_bound_default -1
% 0.40/0.67 % --bmc1_symbol_reachability true
% 0.40/0.67 % --bmc1_property_lemmas false
% 0.40/0.67 % --bmc1_k_induction false
% 0.40/0.67 % --bmc1_non_equiv_states false
% 0.40/0.67 % --bmc1_deadlock false
% 0.40/0.67 % --bmc1_ucm false
% 0.40/0.67 % --bmc1_add_unsat_core none
% 0.40/0.67 % --bmc1_unsat_core_children false
% 0.40/0.67 % --bmc1_unsat_core_extrapolate_axioms false
% 0.40/0.67 % --bmc1_out_stat full
% 0.40/0.67 % --bmc1_ground_init false
% 0.40/0.67 % --bmc1_pre_inst_next_state false
% 0.40/0.67 % --bmc1_pre_inst_state false
% 0.40/0.67 % --bmc1_pre_inst_reach_state false
% 0.40/0.67 % --bmc1_out_unsat_core false
% 0.40/0.67 % --bmc1_aig_witness_out false
% 0.40/0.67 % --bmc1_verbose false
% 0.40/0.67 % --bmc1_dump_clauses_tptp false
% 0.40/0.67 % --bmc1_dump_unsat_core_tptp false
% 0.40/0.67 % --bmc1_dump_file -
% 0.40/0.67 % --bmc1_ucm_expand_uc_limit 128
% 0.40/0.67 % --bmc1_ucm_n_expand_iterations 6
% 0.40/0.67 % --bmc1_ucm_extend_mode 1
% 0.40/0.67 % --bmc1_ucm_init_mode 2
% 0.40/0.67 % --bmc1_ucm_cone_mode none
% 0.40/0.67 % --bmc1_ucm_reduced_relation_type 0
% 0.40/0.67 % --bmc1_ucm_relax_model 4
% 0.40/0.67 % --bmc1_ucm_full_tr_after_sat true
% 0.40/0.67 % --bmc1_ucm_expand_neg_assumptions false
% 0.40/0.67 % --bmc1_ucm_layered_model none
% 0.40/0.67 % --bmc1_ucm_max_lemma_size 10
% 0.40/0.67
% 0.40/0.67 % ------ AIG Options
% 0.40/0.67
% 0.40/0.67 % --aig_mode false
% 0.40/0.67
% 0.40/0.67 % ------ Instantiation Options
% 0.40/0.67
% 0.40/0.67 % --instantiation_flag true
% 0.40/0.67 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.40/0.67 % --inst_solver_per_active 750
% 0.40/0.67 % --inst_solver_calls_frac 0.5
% 0.40/0.67 % --inst_passive_queue_type priority_queues
% 0.40/0.67 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.40/0.67 % --inst_passive_queues_freq [25;2]
% 0.40/0.67 % --inst_dismatching true
% 1.34/1.62 % --inst_eager_unprocessed_to_passive true
% 1.34/1.62 % --inst_prop_sim_given true
% 1.34/1.62 % --inst_prop_sim_new false
% 1.34/1.62 % --inst_orphan_elimination true
% 1.34/1.62 % --inst_learning_loop_flag true
% 1.34/1.62 % --inst_learning_start 3000
% 1.34/1.62 % --inst_learning_factor 2
% 1.34/1.62 % --inst_start_prop_sim_after_learn 3
% 1.34/1.62 % --inst_sel_renew solver
% 1.34/1.62 % --inst_lit_activity_flag true
% 1.34/1.62 % --inst_out_proof true
% 1.34/1.62
% 1.34/1.62 % ------ Resolution Options
% 1.34/1.62
% 1.34/1.62 % --resolution_flag true
% 1.34/1.62 % --res_lit_sel kbo_max
% 1.34/1.62 % --res_to_prop_solver none
% 1.34/1.62 % --res_prop_simpl_new false
% 1.34/1.62 % --res_prop_simpl_given false
% 1.34/1.62 % --res_passive_queue_type priority_queues
% 1.34/1.62 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.34/1.62 % --res_passive_queues_freq [15;5]
% 1.34/1.62 % --res_forward_subs full
% 1.34/1.62 % --res_backward_subs full
% 1.34/1.62 % --res_forward_subs_resolution true
% 1.34/1.62 % --res_backward_subs_resolution true
% 1.34/1.62 % --res_orphan_elimination false
% 1.34/1.62 % --res_time_limit 1000.
% 1.34/1.62 % --res_out_proof true
% 1.34/1.62 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_90622a.s
% 1.34/1.62 % --modulo true
% 1.34/1.62
% 1.34/1.62 % ------ Combination Options
% 1.34/1.62
% 1.34/1.62 % --comb_res_mult 1000
% 1.34/1.62 % --comb_inst_mult 300
% 1.34/1.62 % ------
% 1.34/1.62
% 1.34/1.62
% 1.34/1.62
% 1.34/1.62 % ------ Proving...
% 1.34/1.62 %
% 1.34/1.62
% 1.34/1.62
% 1.34/1.62 % Resolution empty clause
% 1.34/1.62
% 1.34/1.62 % ------ Statistics
% 1.34/1.62
% 1.34/1.62 % ------ General
% 1.34/1.62
% 1.34/1.62 % num_of_input_clauses: 24
% 1.34/1.62 % num_of_input_neg_conjectures: 1
% 1.34/1.62 % num_of_splits: 0
% 1.34/1.62 % num_of_split_atoms: 0
% 1.34/1.62 % num_of_sem_filtered_clauses: 0
% 1.34/1.62 % num_of_subtypes: 0
% 1.34/1.62 % monotx_restored_types: 0
% 1.34/1.62 % sat_num_of_epr_types: 0
% 1.34/1.62 % sat_num_of_non_cyclic_types: 0
% 1.34/1.62 % sat_guarded_non_collapsed_types: 0
% 1.34/1.62 % is_epr: 0
% 1.34/1.62 % is_horn: 1
% 1.34/1.62 % has_eq: 1
% 1.34/1.62 % num_pure_diseq_elim: 0
% 1.34/1.62 % simp_replaced_by: 0
% 1.34/1.62 % res_preprocessed: 3
% 1.34/1.62 % prep_upred: 0
% 1.34/1.62 % prep_unflattend: 0
% 1.34/1.62 % pred_elim_cands: 0
% 1.34/1.62 % pred_elim: 0
% 1.34/1.62 % pred_elim_cl: 0
% 1.34/1.62 % pred_elim_cycles: 0
% 1.34/1.62 % forced_gc_time: 0
% 1.34/1.62 % gc_basic_clause_elim: 0
% 1.34/1.62 % parsing_time: 0.
% 1.34/1.62 % sem_filter_time: 0.
% 1.34/1.62 % pred_elim_time: 0.
% 1.34/1.62 % out_proof_time: 0.
% 1.34/1.62 % monotx_time: 0.
% 1.34/1.62 % subtype_inf_time: 0.
% 1.34/1.62 % unif_index_cands_time: 0.004
% 1.34/1.62 % unif_index_add_time: 0.004
% 1.34/1.62 % total_time: 1.2
% 1.34/1.62 % num_of_symbols: 32
% 1.34/1.62 % num_of_terms: 10134
% 1.34/1.62
% 1.34/1.62 % ------ Propositional Solver
% 1.34/1.62
% 1.34/1.62 % prop_solver_calls: 8
% 1.34/1.62 % prop_fast_solver_calls: 5
% 1.34/1.62 % prop_num_of_clauses: 682
% 1.34/1.62 % prop_preprocess_simplified: 842
% 1.34/1.62 % prop_fo_subsumed: 0
% 1.34/1.62 % prop_solver_time: 0.
% 1.34/1.62 % prop_fast_solver_time: 0.
% 1.34/1.62 % prop_unsat_core_time: 0.
% 1.34/1.62
% 1.34/1.62 % ------ QBF
% 1.34/1.62
% 1.34/1.62 % qbf_q_res: 0
% 1.34/1.62 % qbf_num_tautologies: 0
% 1.34/1.62 % qbf_prep_cycles: 0
% 1.34/1.62
% 1.34/1.62 % ------ BMC1
% 1.34/1.62
% 1.34/1.62 % bmc1_current_bound: -1
% 1.34/1.62 % bmc1_last_solved_bound: -1
% 1.34/1.62 % bmc1_unsat_core_size: -1
% 1.34/1.62 % bmc1_unsat_core_parents_size: -1
% 1.34/1.62 % bmc1_merge_next_fun: 0
% 1.34/1.62 % bmc1_unsat_core_clauses_time: 0.
% 1.34/1.62
% 1.34/1.62 % ------ Instantiation
% 1.34/1.62
% 1.34/1.62 % inst_num_of_clauses: 543
% 1.34/1.62 % inst_num_in_passive: 115
% 1.34/1.62 % inst_num_in_active: 277
% 1.34/1.62 % inst_num_in_unprocessed: 136
% 1.34/1.62 % inst_num_of_loops: 300
% 1.34/1.62 % inst_num_of_learning_restarts: 0
% 1.34/1.62 % inst_num_moves_active_passive: 5
% 1.34/1.62 % inst_lit_activity: 79
% 1.34/1.62 % inst_lit_activity_moves: 0
% 1.34/1.62 % inst_num_tautologies: 15
% 1.34/1.62 % inst_num_prop_implied: 0
% 1.34/1.62 % inst_num_existing_simplified: 0
% 1.34/1.62 % inst_num_eq_res_simplified: 0
% 1.34/1.62 % inst_num_child_elim: 0
% 1.34/1.62 % inst_num_of_dismatching_blockings: 427
% 1.34/1.62 % inst_num_of_non_proper_insts: 1321
% 1.34/1.62 % inst_num_of_duplicates: 888
% 1.34/1.62 % inst_inst_num_from_inst_to_res: 0
% 1.34/1.62 % inst_dismatching_checking_time: 0.001
% 1.34/1.62
% 1.34/1.62 % ------ Resolution
% 1.34/1.62
% 1.34/1.62 % res_num_of_clauses: 5980
% 1.34/1.62 % res_num_in_passive: 4403
% 1.34/1.62 % res_num_in_active: 1593
% 1.34/1.62 % res_num_of_loops: 1967
% 1.34/1.62 % res_forward_subset_subsumed: 3715
% 1.34/1.62 % res_backward_subset_subsumed: 62
% 1.34/1.62 % res_forward_subsumed: 353
% 1.34/1.62 % res_backward_subsumed: 12
% 1.34/1.62 % res_forward_subsumption_resolution: 114
% 1.34/1.62 % res_backward_subsumption_resolution: 0
% 1.34/1.62 % res_clause_to_clause_subsumption: 79159
% 1.34/1.62 % res_orphan_elimination: 0
% 1.34/1.62 % res_tautology_del: 0
% 1.34/1.62 % res_num_eq_res_simplified: 0
% 1.34/1.62 % res_num_sel_changes: 0
% 1.34/1.62 % res_moves_from_active_to_pass: 0
% 1.34/1.62
% 1.34/1.62 % Status Unsatisfiable
% 1.34/1.62 % SZS status Unsatisfiable
% 1.34/1.62 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------