TSTP Solution File: HEN007-4 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : HEN007-4 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n005.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:18 EDT 2022
% Result : Unsatisfiable 0.66s 0.90s
% Output : CNFRefutation 0.66s
% 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(X2,X1)
| less_equal(X3,X1) ),
file('<stdin>',transitivity_of_less_equal) ).
fof(c_0_2_003,axiom,
! [X2,X3] :
( ~ less_equal(X3,X2)
| ~ less_equal(X2,X3)
| X3 = X2 ),
file('<stdin>',less_equal_and_equal) ).
fof(c_0_3_004,axiom,
! [X2,X3] :
( ~ less_equal(X3,X2)
| divide(X3,X2) = zero ),
file('<stdin>',quotient_less_equal1) ).
fof(c_0_4_005,axiom,
! [X2,X3] :
( divide(X3,X2) != zero
| less_equal(X3,X2) ),
file('<stdin>',quotient_less_equal2) ).
fof(c_0_5_006,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_6_007,plain,
! [X1,X2,X3] :
( ~ less_equal(X3,X2)
| ~ less_equal(X2,X1)
| less_equal(X3,X1) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_7_008,plain,
! [X2,X3] :
( ~ less_equal(X3,X2)
| ~ less_equal(X2,X3)
| X3 = X2 ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_8_009,plain,
! [X2,X3] :
( ~ less_equal(X3,X2)
| divide(X3,X2) = zero ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_9_010,axiom,
! [X2,X3] :
( divide(X3,X2) != zero
| less_equal(X3,X2) ),
c_0_4 ).
fof(c_0_10_011,plain,
! [X4,X5,X6] :
( ~ less_equal(divide(X6,X5),X4)
| less_equal(divide(X6,X4),X5) ),
inference(variable_rename,[status(thm)],[c_0_5]) ).
fof(c_0_11_012,plain,
! [X4,X5,X6] :
( ~ less_equal(X6,X5)
| ~ less_equal(X5,X4)
| less_equal(X6,X4) ),
inference(variable_rename,[status(thm)],[c_0_6]) ).
fof(c_0_12_013,plain,
! [X4,X5] :
( ~ less_equal(X5,X4)
| ~ less_equal(X4,X5)
| X5 = X4 ),
inference(variable_rename,[status(thm)],[c_0_7]) ).
fof(c_0_13_014,plain,
! [X4,X5] :
( ~ less_equal(X5,X4)
| divide(X5,X4) = zero ),
inference(variable_rename,[status(thm)],[c_0_8]) ).
fof(c_0_14_015,plain,
! [X4,X5] :
( divide(X5,X4) != zero
| less_equal(X5,X4) ),
inference(variable_rename,[status(thm)],[c_0_9]) ).
cnf(c_0_15_016,plain,
( less_equal(divide(X1,X2),X3)
| ~ less_equal(divide(X1,X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16_017,plain,
( less_equal(X1,X2)
| ~ less_equal(X3,X2)
| ~ less_equal(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17_018,plain,
( X1 = X2
| ~ less_equal(X2,X1)
| ~ less_equal(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18_019,plain,
( divide(X1,X2) = zero
| ~ less_equal(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19_020,plain,
( less_equal(X1,X2)
| divide(X1,X2) != zero ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20_021,plain,
( less_equal(divide(X1,X2),X3)
| ~ less_equal(divide(X1,X3),X2) ),
c_0_15,
[final] ).
cnf(c_0_21_022,plain,
( less_equal(X1,X2)
| ~ less_equal(X3,X2)
| ~ less_equal(X1,X3) ),
c_0_16,
[final] ).
cnf(c_0_22_023,plain,
( X1 = X2
| ~ less_equal(X2,X1)
| ~ less_equal(X1,X2) ),
c_0_17,
[final] ).
cnf(c_0_23_024,plain,
( divide(X1,X2) = zero
| ~ less_equal(X1,X2) ),
c_0_18,
[final] ).
cnf(c_0_24_025,plain,
( less_equal(X1,X2)
| divide(X1,X2) != zero ),
c_0_19,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_20_0,axiom,
( less_equal(divide(X1,X2),X3)
| ~ less_equal(divide(X1,X3),X2) ),
inference(literals_permutation,[status(thm)],[c_0_20]) ).
cnf(c_0_20_1,axiom,
( ~ less_equal(divide(X1,X3),X2)
| less_equal(divide(X1,X2),X3) ),
inference(literals_permutation,[status(thm)],[c_0_20]) ).
cnf(c_0_21_0,axiom,
( less_equal(X1,X2)
| ~ less_equal(X3,X2)
| ~ less_equal(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_21]) ).
cnf(c_0_21_1,axiom,
( ~ less_equal(X3,X2)
| less_equal(X1,X2)
| ~ less_equal(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_21]) ).
cnf(c_0_21_2,axiom,
( ~ less_equal(X1,X3)
| ~ less_equal(X3,X2)
| less_equal(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_21]) ).
cnf(c_0_22_0,axiom,
( X1 = X2
| ~ less_equal(X2,X1)
| ~ less_equal(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_22]) ).
cnf(c_0_22_1,axiom,
( ~ less_equal(X2,X1)
| X1 = X2
| ~ less_equal(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_22]) ).
cnf(c_0_22_2,axiom,
( ~ less_equal(X1,X2)
| ~ less_equal(X2,X1)
| X1 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_22]) ).
cnf(c_0_23_0,axiom,
( divide(X1,X2) = zero
| ~ less_equal(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_23]) ).
cnf(c_0_23_1,axiom,
( ~ less_equal(X1,X2)
| divide(X1,X2) = zero ),
inference(literals_permutation,[status(thm)],[c_0_23]) ).
cnf(c_0_24_0,axiom,
( less_equal(X1,X2)
| divide(X1,X2) != zero ),
inference(literals_permutation,[status(thm)],[c_0_24]) ).
cnf(c_0_24_1,axiom,
( divide(X1,X2) != zero
| less_equal(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_24]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_026,negated_conjecture,
~ less_equal(divide(c,b),divide(c,a)),
file('<stdin>',prove_c_divide_b_LE_c_divide_a) ).
fof(c_0_1_027,hypothesis,
less_equal(a,b),
file('<stdin>',a_LE_b) ).
fof(c_0_2_028,negated_conjecture,
~ less_equal(divide(c,b),divide(c,a)),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_3_029,hypothesis,
less_equal(a,b),
c_0_1 ).
fof(c_0_4_030,negated_conjecture,
~ less_equal(divide(c,b),divide(c,a)),
c_0_2 ).
fof(c_0_5_031,hypothesis,
less_equal(a,b),
c_0_3 ).
cnf(c_0_6_032,negated_conjecture,
~ less_equal(divide(c,b),divide(c,a)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7_033,hypothesis,
less_equal(a,b),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8_034,negated_conjecture,
~ less_equal(divide(c,b),divide(c,a)),
c_0_6,
[final] ).
cnf(c_0_9_035,hypothesis,
less_equal(a,b),
c_0_7,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_20,negated_conjecture,
~ less_equal(divide(c,b),divide(c,a)),
file('/export/starexec/sandbox/tmp/iprover_modulo_34d20c.p',c_0_8) ).
cnf(c_31,negated_conjecture,
~ less_equal(divide(c,b),divide(c,a)),
inference(copy,[status(esa)],[c_20]) ).
cnf(c_35,negated_conjecture,
~ less_equal(divide(c,b),divide(c,a)),
inference(copy,[status(esa)],[c_31]) ).
cnf(c_38,negated_conjecture,
~ less_equal(divide(c,b),divide(c,a)),
inference(copy,[status(esa)],[c_35]) ).
cnf(c_39,negated_conjecture,
~ less_equal(divide(c,b),divide(c,a)),
inference(copy,[status(esa)],[c_38]) ).
cnf(c_99,plain,
~ less_equal(divide(c,b),divide(c,a)),
inference(copy,[status(esa)],[c_39]) ).
cnf(c_0,plain,
( ~ less_equal(divide(X0,X1),X2)
| less_equal(divide(X0,X2),X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_34d20c.p',c_0_20_0) ).
cnf(c_63,plain,
( ~ less_equal(divide(X0,X1),X2)
| less_equal(divide(X0,X2),X1) ),
inference(copy,[status(esa)],[c_0]) ).
cnf(c_105,plain,
~ less_equal(divide(c,divide(c,a)),b),
inference(resolution,[status(thm)],[c_99,c_63]) ).
cnf(c_106,plain,
~ less_equal(divide(c,divide(c,a)),b),
inference(rewriting,[status(thm)],[c_105]) ).
cnf(c_2,plain,
( ~ less_equal(X0,X1)
| ~ less_equal(X1,X2)
| less_equal(X0,X2) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_34d20c.p',c_0_21_0) ).
cnf(c_67,plain,
( ~ less_equal(X0,X1)
| ~ less_equal(X1,X2)
| less_equal(X0,X2) ),
inference(copy,[status(esa)],[c_2]) ).
cnf(c_115,plain,
( ~ less_equal(divide(c,divide(c,a)),X0)
| ~ less_equal(X0,b) ),
inference(resolution,[status(thm)],[c_106,c_67]) ).
cnf(c_116,plain,
( ~ less_equal(divide(c,divide(c,a)),X0)
| ~ less_equal(X0,b) ),
inference(rewriting,[status(thm)],[c_115]) ).
cnf(c_165,plain,
( ~ less_equal(divide(c,X0),divide(c,a))
| ~ less_equal(X0,b) ),
inference(resolution,[status(thm)],[c_116,c_63]) ).
cnf(c_166,plain,
( ~ less_equal(divide(c,X0),divide(c,a))
| ~ less_equal(X0,b) ),
inference(rewriting,[status(thm)],[c_165]) ).
cnf(c_10,plain,
( divide(X0,X1) != zero
| less_equal(X0,X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_34d20c.p',c_0_24_0) ).
cnf(c_83,plain,
( divide(X0,X1) != zero
| less_equal(X0,X1) ),
inference(copy,[status(esa)],[c_10]) ).
cnf(c_84,plain,
( less_equal(X0,X1)
| divide(X0,X1) != zero ),
inference(rewriting,[status(thm)],[c_83]) ).
cnf(c_366,plain,
( ~ less_equal(X0,b)
| divide(divide(c,X0),divide(c,a)) != zero ),
inference(resolution,[status(thm)],[c_166,c_84]) ).
cnf(c_367,plain,
( ~ less_equal(X0,b)
| divide(divide(c,X0),divide(c,a)) != zero ),
inference(rewriting,[status(thm)],[c_366]) ).
cnf(c_5,plain,
( ~ less_equal(X0,X1)
| ~ less_equal(X1,X0)
| X0 = X1 ),
file('/export/starexec/sandbox/tmp/iprover_modulo_34d20c.p',c_0_22_0) ).
cnf(c_73,plain,
( ~ less_equal(X0,X1)
| ~ less_equal(X1,X0)
| X0 = X1 ),
inference(copy,[status(esa)],[c_5]) ).
cnf(c_1474,plain,
( ~ less_equal(divide(divide(c,X0),divide(c,a)),zero)
| ~ less_equal(zero,divide(divide(c,X0),divide(c,a)))
| ~ less_equal(X0,b) ),
inference(resolution,[status(thm)],[c_367,c_73]) ).
cnf(c_1475,plain,
( ~ less_equal(divide(divide(c,X0),divide(c,a)),zero)
| ~ less_equal(zero,divide(divide(c,X0),divide(c,a)))
| ~ less_equal(X0,b) ),
inference(rewriting,[status(thm)],[c_1474]) ).
cnf(c_13,plain,
less_equal(zero,X0),
file('/export/starexec/sandbox/tmp/iprover_modulo_34d20c.p',c_0_38_0) ).
cnf(c_88,plain,
less_equal(zero,X0),
inference(copy,[status(esa)],[c_13]) ).
cnf(c_9347,plain,
( ~ less_equal(divide(divide(c,X0),divide(c,a)),zero)
| ~ less_equal(X0,b) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1475,c_88]) ).
cnf(c_9348,plain,
( ~ less_equal(divide(divide(c,X0),divide(c,a)),zero)
| ~ less_equal(X0,b) ),
inference(rewriting,[status(thm)],[c_9347]) ).
cnf(c_9351,plain,
( ~ less_equal(divide(divide(c,X0),zero),divide(c,a))
| ~ less_equal(X0,b) ),
inference(resolution,[status(thm)],[c_9348,c_63]) ).
cnf(c_9352,plain,
( ~ less_equal(divide(divide(c,X0),zero),divide(c,a))
| ~ less_equal(X0,b) ),
inference(rewriting,[status(thm)],[c_9351]) ).
cnf(c_18,plain,
less_equal(divide(X0,X1),X0),
file('/export/starexec/sandbox/tmp/iprover_modulo_34d20c.p',c_0_33_0) ).
cnf(c_95,plain,
less_equal(divide(X0,X1),X0),
inference(copy,[status(esa)],[c_18]) ).
cnf(c_9765,plain,
~ less_equal(a,b),
inference(resolution,[status(thm)],[c_9352,c_95]) ).
cnf(c_9766,plain,
~ less_equal(a,b),
inference(rewriting,[status(thm)],[c_9765]) ).
cnf(c_21,plain,
less_equal(a,b),
file('/export/starexec/sandbox/tmp/iprover_modulo_34d20c.p',c_0_9) ).
cnf(c_29,plain,
less_equal(a,b),
inference(copy,[status(esa)],[c_21]) ).
cnf(c_36,plain,
less_equal(a,b),
inference(copy,[status(esa)],[c_29]) ).
cnf(c_37,plain,
less_equal(a,b),
inference(copy,[status(esa)],[c_36]) ).
cnf(c_40,plain,
less_equal(a,b),
inference(copy,[status(esa)],[c_37]) ).
cnf(c_101,plain,
less_equal(a,b),
inference(copy,[status(esa)],[c_40]) ).
cnf(c_10072,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_9766,c_101]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : HEN007-4 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.13 % Command : iprover_modulo %s %d
% 0.14/0.34 % Computer : n005.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Fri Jul 1 13:02:07 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.35 % Running in mono-core mode
% 0.14/0.40 % Orienting using strategy Equiv(ClausalAll)
% 0.14/0.40 % Orientation found
% 0.14/0.40 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_d60c5a.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_34d20c.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_3addfe | grep -v "SZS"
% 0.20/0.43
% 0.20/0.43 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.43
% 0.20/0.43 %
% 0.20/0.43 % ------ iProver source info
% 0.20/0.43
% 0.20/0.43 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.43 % git: non_committed_changes: true
% 0.20/0.43 % git: last_make_outside_of_git: true
% 0.20/0.43
% 0.20/0.43 %
% 0.20/0.43 % ------ Input Options
% 0.20/0.43
% 0.20/0.43 % --out_options all
% 0.20/0.43 % --tptp_safe_out true
% 0.20/0.43 % --problem_path ""
% 0.20/0.43 % --include_path ""
% 0.20/0.43 % --clausifier .//eprover
% 0.20/0.43 % --clausifier_options --tstp-format
% 0.20/0.43 % --stdin false
% 0.20/0.43 % --dbg_backtrace false
% 0.20/0.43 % --dbg_dump_prop_clauses false
% 0.20/0.43 % --dbg_dump_prop_clauses_file -
% 0.20/0.43 % --dbg_out_stat false
% 0.20/0.43
% 0.20/0.43 % ------ General Options
% 0.20/0.43
% 0.20/0.43 % --fof false
% 0.20/0.43 % --time_out_real 150.
% 0.20/0.43 % --time_out_prep_mult 0.2
% 0.20/0.43 % --time_out_virtual -1.
% 0.20/0.43 % --schedule none
% 0.20/0.43 % --ground_splitting input
% 0.20/0.43 % --splitting_nvd 16
% 0.20/0.43 % --non_eq_to_eq false
% 0.20/0.43 % --prep_gs_sim true
% 0.20/0.43 % --prep_unflatten false
% 0.20/0.43 % --prep_res_sim true
% 0.20/0.43 % --prep_upred true
% 0.20/0.43 % --res_sim_input true
% 0.20/0.43 % --clause_weak_htbl true
% 0.20/0.43 % --gc_record_bc_elim false
% 0.20/0.43 % --symbol_type_check false
% 0.20/0.43 % --clausify_out false
% 0.20/0.43 % --large_theory_mode false
% 0.20/0.43 % --prep_sem_filter none
% 0.20/0.43 % --prep_sem_filter_out false
% 0.20/0.43 % --preprocessed_out false
% 0.20/0.43 % --sub_typing false
% 0.20/0.43 % --brand_transform false
% 0.20/0.43 % --pure_diseq_elim true
% 0.20/0.43 % --min_unsat_core false
% 0.20/0.43 % --pred_elim true
% 0.20/0.43 % --add_important_lit false
% 0.20/0.43 % --soft_assumptions false
% 0.20/0.43 % --reset_solvers false
% 0.20/0.43 % --bc_imp_inh []
% 0.20/0.43 % --conj_cone_tolerance 1.5
% 0.20/0.43 % --prolific_symb_bound 500
% 0.20/0.43 % --lt_threshold 2000
% 0.20/0.43
% 0.20/0.43 % ------ SAT Options
% 0.20/0.43
% 0.20/0.43 % --sat_mode false
% 0.20/0.43 % --sat_fm_restart_options ""
% 0.20/0.43 % --sat_gr_def false
% 0.20/0.43 % --sat_epr_types true
% 0.20/0.43 % --sat_non_cyclic_types false
% 0.20/0.43 % --sat_finite_models false
% 0.20/0.43 % --sat_fm_lemmas false
% 0.20/0.43 % --sat_fm_prep false
% 0.20/0.43 % --sat_fm_uc_incr true
% 0.20/0.43 % --sat_out_model small
% 0.20/0.43 % --sat_out_clauses false
% 0.20/0.43
% 0.20/0.43 % ------ QBF Options
% 0.20/0.43
% 0.20/0.43 % --qbf_mode false
% 0.20/0.43 % --qbf_elim_univ true
% 0.20/0.43 % --qbf_sk_in true
% 0.20/0.43 % --qbf_pred_elim true
% 0.20/0.43 % --qbf_split 32
% 0.20/0.43
% 0.20/0.43 % ------ BMC1 Options
% 0.20/0.43
% 0.20/0.43 % --bmc1_incremental false
% 0.20/0.43 % --bmc1_axioms reachable_all
% 0.20/0.43 % --bmc1_min_bound 0
% 0.20/0.43 % --bmc1_max_bound -1
% 0.20/0.43 % --bmc1_max_bound_default -1
% 0.20/0.43 % --bmc1_symbol_reachability true
% 0.20/0.43 % --bmc1_property_lemmas false
% 0.20/0.43 % --bmc1_k_induction false
% 0.20/0.43 % --bmc1_non_equiv_states false
% 0.20/0.43 % --bmc1_deadlock false
% 0.20/0.43 % --bmc1_ucm false
% 0.20/0.43 % --bmc1_add_unsat_core none
% 0.20/0.43 % --bmc1_unsat_core_children false
% 0.20/0.43 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.43 % --bmc1_out_stat full
% 0.20/0.43 % --bmc1_ground_init false
% 0.20/0.43 % --bmc1_pre_inst_next_state false
% 0.20/0.43 % --bmc1_pre_inst_state false
% 0.20/0.43 % --bmc1_pre_inst_reach_state false
% 0.20/0.43 % --bmc1_out_unsat_core false
% 0.20/0.43 % --bmc1_aig_witness_out false
% 0.20/0.43 % --bmc1_verbose false
% 0.20/0.43 % --bmc1_dump_clauses_tptp false
% 0.37/0.65 % --bmc1_dump_unsat_core_tptp false
% 0.37/0.65 % --bmc1_dump_file -
% 0.37/0.65 % --bmc1_ucm_expand_uc_limit 128
% 0.37/0.65 % --bmc1_ucm_n_expand_iterations 6
% 0.37/0.65 % --bmc1_ucm_extend_mode 1
% 0.37/0.65 % --bmc1_ucm_init_mode 2
% 0.37/0.65 % --bmc1_ucm_cone_mode none
% 0.37/0.65 % --bmc1_ucm_reduced_relation_type 0
% 0.37/0.65 % --bmc1_ucm_relax_model 4
% 0.37/0.65 % --bmc1_ucm_full_tr_after_sat true
% 0.37/0.65 % --bmc1_ucm_expand_neg_assumptions false
% 0.37/0.65 % --bmc1_ucm_layered_model none
% 0.37/0.65 % --bmc1_ucm_max_lemma_size 10
% 0.37/0.65
% 0.37/0.65 % ------ AIG Options
% 0.37/0.65
% 0.37/0.65 % --aig_mode false
% 0.37/0.65
% 0.37/0.65 % ------ Instantiation Options
% 0.37/0.65
% 0.37/0.65 % --instantiation_flag true
% 0.37/0.65 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.37/0.65 % --inst_solver_per_active 750
% 0.37/0.65 % --inst_solver_calls_frac 0.5
% 0.37/0.65 % --inst_passive_queue_type priority_queues
% 0.37/0.65 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.37/0.65 % --inst_passive_queues_freq [25;2]
% 0.37/0.65 % --inst_dismatching true
% 0.37/0.65 % --inst_eager_unprocessed_to_passive true
% 0.37/0.65 % --inst_prop_sim_given true
% 0.37/0.65 % --inst_prop_sim_new false
% 0.37/0.65 % --inst_orphan_elimination true
% 0.37/0.65 % --inst_learning_loop_flag true
% 0.37/0.65 % --inst_learning_start 3000
% 0.37/0.65 % --inst_learning_factor 2
% 0.37/0.65 % --inst_start_prop_sim_after_learn 3
% 0.37/0.65 % --inst_sel_renew solver
% 0.37/0.65 % --inst_lit_activity_flag true
% 0.37/0.65 % --inst_out_proof true
% 0.37/0.65
% 0.37/0.65 % ------ Resolution Options
% 0.37/0.65
% 0.37/0.65 % --resolution_flag true
% 0.37/0.65 % --res_lit_sel kbo_max
% 0.37/0.65 % --res_to_prop_solver none
% 0.37/0.65 % --res_prop_simpl_new false
% 0.37/0.65 % --res_prop_simpl_given false
% 0.37/0.65 % --res_passive_queue_type priority_queues
% 0.37/0.65 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.37/0.65 % --res_passive_queues_freq [15;5]
% 0.37/0.65 % --res_forward_subs full
% 0.37/0.65 % --res_backward_subs full
% 0.37/0.65 % --res_forward_subs_resolution true
% 0.37/0.65 % --res_backward_subs_resolution true
% 0.37/0.65 % --res_orphan_elimination false
% 0.37/0.65 % --res_time_limit 1000.
% 0.37/0.65 % --res_out_proof true
% 0.37/0.65 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_d60c5a.s
% 0.37/0.65 % --modulo true
% 0.37/0.65
% 0.37/0.65 % ------ Combination Options
% 0.37/0.65
% 0.37/0.65 % --comb_res_mult 1000
% 0.37/0.65 % --comb_inst_mult 300
% 0.37/0.65 % ------
% 0.37/0.65
% 0.37/0.65 % ------ Parsing...% successful
% 0.37/0.65
% 0.37/0.65 % ------ 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.37/0.65
% 0.37/0.65 % ------ Proving...
% 0.37/0.65 % ------ Problem Properties
% 0.37/0.65
% 0.37/0.65 %
% 0.37/0.65 % EPR false
% 0.37/0.65 % Horn true
% 0.37/0.65 % Has equality true
% 0.37/0.65
% 0.37/0.65 % % ------ Input Options Time Limit: Unbounded
% 0.37/0.65
% 0.37/0.65
% 0.37/0.65 Compiling...
% 0.37/0.65 Loading plugin: done.
% 0.37/0.65 Compiling...
% 0.37/0.65 Loading plugin: done.
% 0.37/0.65 % % ------ Current options:
% 0.37/0.65
% 0.37/0.65 % ------ Input Options
% 0.37/0.65
% 0.37/0.65 % --out_options all
% 0.37/0.65 % --tptp_safe_out true
% 0.37/0.65 % --problem_path ""
% 0.37/0.65 % --include_path ""
% 0.37/0.65 % --clausifier .//eprover
% 0.37/0.65 % --clausifier_options --tstp-format
% 0.37/0.65 % --stdin false
% 0.37/0.65 % --dbg_backtrace false
% 0.37/0.65 % --dbg_dump_prop_clauses false
% 0.37/0.65 % --dbg_dump_prop_clauses_file -
% 0.37/0.65 % --dbg_out_stat false
% 0.37/0.65
% 0.37/0.65 % ------ General Options
% 0.37/0.65
% 0.37/0.65 % --fof false
% 0.37/0.65 % --time_out_real 150.
% 0.37/0.65 % --time_out_prep_mult 0.2
% 0.37/0.65 % --time_out_virtual -1.
% 0.37/0.65 % --schedule none
% 0.37/0.65 % --ground_splitting input
% 0.37/0.65 % --splitting_nvd 16
% 0.37/0.65 % --non_eq_to_eq false
% 0.37/0.65 % --prep_gs_sim true
% 0.37/0.65 % --prep_unflatten false
% 0.37/0.65 % --prep_res_sim true
% 0.37/0.65 % --prep_upred true
% 0.37/0.65 % --res_sim_input true
% 0.37/0.65 % --clause_weak_htbl true
% 0.37/0.65 % --gc_record_bc_elim false
% 0.37/0.65 % --symbol_type_check false
% 0.37/0.65 % --clausify_out false
% 0.37/0.65 % --large_theory_mode false
% 0.37/0.65 % --prep_sem_filter none
% 0.37/0.65 % --prep_sem_filter_out false
% 0.37/0.65 % --preprocessed_out false
% 0.37/0.65 % --sub_typing false
% 0.37/0.65 % --brand_transform false
% 0.37/0.65 % --pure_diseq_elim true
% 0.37/0.65 % --min_unsat_core false
% 0.37/0.65 % --pred_elim true
% 0.37/0.65 % --add_important_lit false
% 0.37/0.65 % --soft_assumptions false
% 0.37/0.65 % --reset_solvers false
% 0.37/0.65 % --bc_imp_inh []
% 0.37/0.65 % --conj_cone_tolerance 1.5
% 0.37/0.65 % --prolific_symb_bound 500
% 0.37/0.65 % --lt_threshold 2000
% 0.37/0.65
% 0.37/0.65 % ------ SAT Options
% 0.37/0.65
% 0.37/0.65 % --sat_mode false
% 0.37/0.65 % --sat_fm_restart_options ""
% 0.37/0.65 % --sat_gr_def false
% 0.37/0.65 % --sat_epr_types true
% 0.37/0.65 % --sat_non_cyclic_types false
% 0.37/0.65 % --sat_finite_models false
% 0.37/0.65 % --sat_fm_lemmas false
% 0.37/0.65 % --sat_fm_prep false
% 0.37/0.65 % --sat_fm_uc_incr true
% 0.37/0.65 % --sat_out_model small
% 0.37/0.65 % --sat_out_clauses false
% 0.37/0.65
% 0.37/0.65 % ------ QBF Options
% 0.37/0.65
% 0.37/0.65 % --qbf_mode false
% 0.37/0.65 % --qbf_elim_univ true
% 0.37/0.65 % --qbf_sk_in true
% 0.37/0.65 % --qbf_pred_elim true
% 0.37/0.65 % --qbf_split 32
% 0.37/0.65
% 0.37/0.65 % ------ BMC1 Options
% 0.37/0.65
% 0.37/0.65 % --bmc1_incremental false
% 0.37/0.65 % --bmc1_axioms reachable_all
% 0.37/0.65 % --bmc1_min_bound 0
% 0.37/0.65 % --bmc1_max_bound -1
% 0.37/0.65 % --bmc1_max_bound_default -1
% 0.37/0.65 % --bmc1_symbol_reachability true
% 0.37/0.65 % --bmc1_property_lemmas false
% 0.37/0.65 % --bmc1_k_induction false
% 0.37/0.65 % --bmc1_non_equiv_states false
% 0.37/0.65 % --bmc1_deadlock false
% 0.37/0.65 % --bmc1_ucm false
% 0.37/0.65 % --bmc1_add_unsat_core none
% 0.37/0.65 % --bmc1_unsat_core_children false
% 0.37/0.65 % --bmc1_unsat_core_extrapolate_axioms false
% 0.37/0.65 % --bmc1_out_stat full
% 0.37/0.65 % --bmc1_ground_init false
% 0.37/0.65 % --bmc1_pre_inst_next_state false
% 0.37/0.65 % --bmc1_pre_inst_state false
% 0.37/0.65 % --bmc1_pre_inst_reach_state false
% 0.37/0.65 % --bmc1_out_unsat_core false
% 0.37/0.65 % --bmc1_aig_witness_out false
% 0.37/0.65 % --bmc1_verbose false
% 0.37/0.65 % --bmc1_dump_clauses_tptp false
% 0.37/0.65 % --bmc1_dump_unsat_core_tptp false
% 0.37/0.65 % --bmc1_dump_file -
% 0.37/0.65 % --bmc1_ucm_expand_uc_limit 128
% 0.37/0.65 % --bmc1_ucm_n_expand_iterations 6
% 0.37/0.65 % --bmc1_ucm_extend_mode 1
% 0.37/0.65 % --bmc1_ucm_init_mode 2
% 0.37/0.65 % --bmc1_ucm_cone_mode none
% 0.37/0.65 % --bmc1_ucm_reduced_relation_type 0
% 0.37/0.65 % --bmc1_ucm_relax_model 4
% 0.37/0.65 % --bmc1_ucm_full_tr_after_sat true
% 0.37/0.65 % --bmc1_ucm_expand_neg_assumptions false
% 0.37/0.65 % --bmc1_ucm_layered_model none
% 0.37/0.65 % --bmc1_ucm_max_lemma_size 10
% 0.37/0.65
% 0.37/0.65 % ------ AIG Options
% 0.37/0.65
% 0.37/0.65 % --aig_mode false
% 0.37/0.65
% 0.37/0.65 % ------ Instantiation Options
% 0.37/0.65
% 0.37/0.65 % --instantiation_flag true
% 0.37/0.65 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.37/0.65 % --inst_solver_per_active 750
% 0.37/0.65 % --inst_solver_calls_frac 0.5
% 0.37/0.65 % --inst_passive_queue_type priority_queues
% 0.37/0.65 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.37/0.65 % --inst_passive_queues_freq [25;2]
% 0.37/0.65 % --inst_dismatching true
% 0.66/0.90 % --inst_eager_unprocessed_to_passive true
% 0.66/0.90 % --inst_prop_sim_given true
% 0.66/0.90 % --inst_prop_sim_new false
% 0.66/0.90 % --inst_orphan_elimination true
% 0.66/0.90 % --inst_learning_loop_flag true
% 0.66/0.90 % --inst_learning_start 3000
% 0.66/0.90 % --inst_learning_factor 2
% 0.66/0.90 % --inst_start_prop_sim_after_learn 3
% 0.66/0.90 % --inst_sel_renew solver
% 0.66/0.90 % --inst_lit_activity_flag true
% 0.66/0.90 % --inst_out_proof true
% 0.66/0.90
% 0.66/0.90 % ------ Resolution Options
% 0.66/0.90
% 0.66/0.90 % --resolution_flag true
% 0.66/0.90 % --res_lit_sel kbo_max
% 0.66/0.90 % --res_to_prop_solver none
% 0.66/0.90 % --res_prop_simpl_new false
% 0.66/0.90 % --res_prop_simpl_given false
% 0.66/0.90 % --res_passive_queue_type priority_queues
% 0.66/0.90 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.66/0.90 % --res_passive_queues_freq [15;5]
% 0.66/0.90 % --res_forward_subs full
% 0.66/0.90 % --res_backward_subs full
% 0.66/0.90 % --res_forward_subs_resolution true
% 0.66/0.90 % --res_backward_subs_resolution true
% 0.66/0.90 % --res_orphan_elimination false
% 0.66/0.90 % --res_time_limit 1000.
% 0.66/0.90 % --res_out_proof true
% 0.66/0.90 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_d60c5a.s
% 0.66/0.90 % --modulo true
% 0.66/0.90
% 0.66/0.90 % ------ Combination Options
% 0.66/0.90
% 0.66/0.90 % --comb_res_mult 1000
% 0.66/0.90 % --comb_inst_mult 300
% 0.66/0.90 % ------
% 0.66/0.90
% 0.66/0.90
% 0.66/0.90
% 0.66/0.90 % ------ Proving...
% 0.66/0.90 %
% 0.66/0.90
% 0.66/0.90
% 0.66/0.90 % Resolution empty clause
% 0.66/0.90
% 0.66/0.90 % ------ Statistics
% 0.66/0.90
% 0.66/0.90 % ------ General
% 0.66/0.90
% 0.66/0.90 % num_of_input_clauses: 22
% 0.66/0.90 % num_of_input_neg_conjectures: 1
% 0.66/0.90 % num_of_splits: 0
% 0.66/0.90 % num_of_split_atoms: 0
% 0.66/0.90 % num_of_sem_filtered_clauses: 0
% 0.66/0.90 % num_of_subtypes: 0
% 0.66/0.90 % monotx_restored_types: 0
% 0.66/0.90 % sat_num_of_epr_types: 0
% 0.66/0.90 % sat_num_of_non_cyclic_types: 0
% 0.66/0.90 % sat_guarded_non_collapsed_types: 0
% 0.66/0.90 % is_epr: 0
% 0.66/0.90 % is_horn: 1
% 0.66/0.90 % has_eq: 1
% 0.66/0.90 % num_pure_diseq_elim: 0
% 0.66/0.90 % simp_replaced_by: 0
% 0.66/0.90 % res_preprocessed: 3
% 0.66/0.90 % prep_upred: 0
% 0.66/0.90 % prep_unflattend: 0
% 0.66/0.90 % pred_elim_cands: 0
% 0.66/0.90 % pred_elim: 0
% 0.66/0.90 % pred_elim_cl: 0
% 0.66/0.90 % pred_elim_cycles: 0
% 0.66/0.90 % forced_gc_time: 0
% 0.66/0.90 % gc_basic_clause_elim: 0
% 0.66/0.90 % parsing_time: 0.
% 0.66/0.90 % sem_filter_time: 0.
% 0.66/0.90 % pred_elim_time: 0.
% 0.66/0.90 % out_proof_time: 0.001
% 0.66/0.90 % monotx_time: 0.
% 0.66/0.90 % subtype_inf_time: 0.
% 0.66/0.90 % unif_index_cands_time: 0.001
% 0.66/0.90 % unif_index_add_time: 0.001
% 0.66/0.90 % total_time: 0.491
% 0.66/0.90 % num_of_symbols: 32
% 0.66/0.90 % num_of_terms: 3448
% 0.66/0.90
% 0.66/0.90 % ------ Propositional Solver
% 0.66/0.90
% 0.66/0.90 % prop_solver_calls: 1
% 0.66/0.90 % prop_fast_solver_calls: 5
% 0.66/0.90 % prop_num_of_clauses: 24
% 0.66/0.90 % prop_preprocess_simplified: 71
% 0.66/0.90 % prop_fo_subsumed: 0
% 0.66/0.90 % prop_solver_time: 0.
% 0.66/0.90 % prop_fast_solver_time: 0.
% 0.66/0.90 % prop_unsat_core_time: 0.
% 0.66/0.90
% 0.66/0.90 % ------ QBF
% 0.66/0.90
% 0.66/0.90 % qbf_q_res: 0
% 0.66/0.90 % qbf_num_tautologies: 0
% 0.66/0.90 % qbf_prep_cycles: 0
% 0.66/0.90
% 0.66/0.90 % ------ BMC1
% 0.66/0.90
% 0.66/0.90 % bmc1_current_bound: -1
% 0.66/0.90 % bmc1_last_solved_bound: -1
% 0.66/0.90 % bmc1_unsat_core_size: -1
% 0.66/0.90 % bmc1_unsat_core_parents_size: -1
% 0.66/0.90 % bmc1_merge_next_fun: 0
% 0.66/0.90 % bmc1_unsat_core_clauses_time: 0.
% 0.66/0.90
% 0.66/0.90 % ------ Instantiation
% 0.66/0.90
% 0.66/0.90 % inst_num_of_clauses: 22
% 0.66/0.90 % inst_num_in_passive: 0
% 0.66/0.90 % inst_num_in_active: 0
% 0.66/0.90 % inst_num_in_unprocessed: 22
% 0.66/0.90 % inst_num_of_loops: 0
% 0.66/0.90 % inst_num_of_learning_restarts: 0
% 0.66/0.90 % inst_num_moves_active_passive: 0
% 0.66/0.90 % inst_lit_activity: 0
% 0.66/0.90 % inst_lit_activity_moves: 0
% 0.66/0.90 % inst_num_tautologies: 0
% 0.66/0.90 % inst_num_prop_implied: 0
% 0.66/0.90 % inst_num_existing_simplified: 0
% 0.66/0.90 % inst_num_eq_res_simplified: 0
% 0.66/0.90 % inst_num_child_elim: 0
% 0.66/0.90 % inst_num_of_dismatching_blockings: 0
% 0.66/0.90 % inst_num_of_non_proper_insts: 0
% 0.66/0.90 % inst_num_of_duplicates: 0
% 0.66/0.90 % inst_inst_num_from_inst_to_res: 0
% 0.66/0.90 % inst_dismatching_checking_time: 0.
% 0.66/0.90
% 0.66/0.90 % ------ Resolution
% 0.66/0.90
% 0.66/0.90 % res_num_of_clauses: 2259
% 0.66/0.90 % res_num_in_passive: 1620
% 0.66/0.90 % res_num_in_active: 652
% 0.66/0.90 % res_num_of_loops: 690
% 0.66/0.90 % res_forward_subset_subsumed: 1191
% 0.66/0.90 % res_backward_subset_subsumed: 39
% 0.66/0.90 % res_forward_subsumed: 35
% 0.66/0.90 % res_backward_subsumed: 7
% 0.66/0.90 % res_forward_subsumption_resolution: 29
% 0.66/0.90 % res_backward_subsumption_resolution: 0
% 0.66/0.90 % res_clause_to_clause_subsumption: 14732
% 0.66/0.90 % res_orphan_elimination: 0
% 0.66/0.90 % res_tautology_del: 0
% 0.66/0.90 % res_num_eq_res_simplified: 0
% 0.66/0.90 % res_num_sel_changes: 0
% 0.66/0.90 % res_moves_from_active_to_pass: 0
% 0.66/0.90
% 0.66/0.90 % Status Unsatisfiable
% 0.66/0.90 % SZS status Unsatisfiable
% 0.66/0.90 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------