TSTP Solution File: ALG002-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : ALG002-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n028.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Thu Jul 14 17:06:59 EDT 2022
% Result : Unsatisfiable 1.07s 1.30s
% Output : CNFRefutation 1.07s
% 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(not_abelian,axiom,
~ product(multiplicative_identity,multiplicative_identity,additive_identity),
input ).
fof(not_abelian_0,plain,
( ~ product(multiplicative_identity,multiplicative_identity,additive_identity)
| $false ),
inference(orientation,[status(thm)],[not_abelian]) ).
cnf(right_identity,axiom,
product(X,multiplicative_identity,X),
input ).
fof(right_identity_0,plain,
! [X] :
( product(X,multiplicative_identity,X)
| $false ),
inference(orientation,[status(thm)],[right_identity]) ).
fof(def_lhs_atom1,axiom,
! [X] :
( lhs_atom1(X)
<=> product(X,multiplicative_identity,X) ),
inference(definition,[],]) ).
fof(to_be_clausified_0,plain,
! [X] :
( lhs_atom1(X)
| $false ),
inference(fold_definition,[status(thm)],[right_identity_0,def_lhs_atom1]) ).
fof(def_lhs_atom2,axiom,
( lhs_atom2
<=> ~ product(multiplicative_identity,multiplicative_identity,additive_identity) ),
inference(definition,[],]) ).
fof(to_be_clausified_1,plain,
( lhs_atom2
| $false ),
inference(fold_definition,[status(thm)],[not_abelian_0,def_lhs_atom2]) ).
% Start CNF derivation
fof(c_0_0,axiom,
! [X1] :
( lhs_atom1(X1)
| ~ $true ),
file('<stdin>',to_be_clausified_0) ).
fof(c_0_1,axiom,
( lhs_atom2
| ~ $true ),
file('<stdin>',to_be_clausified_1) ).
fof(c_0_2,plain,
! [X1] : lhs_atom1(X1),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_3,plain,
lhs_atom2,
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_4,plain,
! [X2] : lhs_atom1(X2),
inference(variable_rename,[status(thm)],[c_0_2]) ).
fof(c_0_5,plain,
lhs_atom2,
c_0_3 ).
cnf(c_0_6,plain,
lhs_atom1(X1),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
lhs_atom2,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
lhs_atom1(X1),
c_0_6,
[final] ).
cnf(c_0_9,plain,
lhs_atom2,
c_0_7,
[final] ).
% End CNF derivation
cnf(c_0_8_0,axiom,
product(X1,multiplicative_identity,X1),
inference(unfold_definition,[status(thm)],[c_0_8,def_lhs_atom1]) ).
cnf(c_0_9_0,axiom,
~ product(multiplicative_identity,multiplicative_identity,additive_identity),
inference(unfold_definition,[status(thm)],[c_0_9,def_lhs_atom2]) ).
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
fof(c_0_0_001,axiom,
! [X1,X2,X3] :
( ~ product(X2,X1,X3)
| ~ product(X2,X2,additive_identity)
| product(X3,X3,additive_identity) ),
file('<stdin>',square_to_0) ).
fof(c_0_1_002,axiom,
! [X1,X2,X3] :
( product(X3,X2,X1)
| ~ product(additive_inverse(X3),additive_inverse(X2),X1) ),
file('<stdin>',product_of_inverses2) ).
fof(c_0_2_003,axiom,
! [X1,X2,X3] :
( ~ product(X3,X2,X1)
| product(additive_inverse(X3),additive_inverse(X2),X1) ),
file('<stdin>',product_of_inverses1) ).
fof(c_0_3_004,axiom,
! [X1,X2,X3] :
( ~ product(X3,X2,X1)
| product(X3,additive_inverse(X2),additive_inverse(X1)) ),
file('<stdin>',product_to_inverse) ).
fof(c_0_4_005,axiom,
! [X1,X2,X3] :
( ~ product(X3,X2,X1)
| product(X2,X3,X1) ),
file('<stdin>',commutativity_of_product) ).
fof(c_0_5_006,axiom,
! [X3] :
( product(X3,multiplicative_inverse(X3),multiplicative_identity)
| product(X3,X3,additive_identity) ),
file('<stdin>',inverse_and_identity) ).
fof(c_0_6_007,axiom,
! [X1,X2,X3] :
( ~ product(X2,X1,X3)
| ~ greater_than_0(X2)
| ~ greater_than_0(X1)
| greater_than_0(X3) ),
file('<stdin>',product_and_greater_than_0) ).
fof(c_0_7_008,axiom,
! [X3] :
( ~ greater_than_0(X3)
| ~ product(X3,X3,additive_identity) ),
file('<stdin>',greater_than_0_square) ).
fof(c_0_8_009,axiom,
! [X3] :
( greater_than_0(X3)
| product(X3,X3,additive_identity)
| greater_than_0(additive_inverse(X3)) ),
file('<stdin>',product_and_inverse) ).
fof(c_0_9_010,axiom,
! [X3] :
( ~ greater_than_0(X3)
| ~ greater_than_0(additive_inverse(X3)) ),
file('<stdin>',inverse_greater_than_0) ).
fof(c_0_10,plain,
! [X1,X2,X3] :
( ~ product(X2,X1,X3)
| ~ product(X2,X2,additive_identity)
| product(X3,X3,additive_identity) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_11,plain,
! [X1,X2,X3] :
( product(X3,X2,X1)
| ~ product(additive_inverse(X3),additive_inverse(X2),X1) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_12,plain,
! [X1,X2,X3] :
( ~ product(X3,X2,X1)
| product(additive_inverse(X3),additive_inverse(X2),X1) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_13,plain,
! [X1,X2,X3] :
( ~ product(X3,X2,X1)
| product(X3,additive_inverse(X2),additive_inverse(X1)) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_14,plain,
! [X1,X2,X3] :
( ~ product(X3,X2,X1)
| product(X2,X3,X1) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_15,axiom,
! [X3] :
( product(X3,multiplicative_inverse(X3),multiplicative_identity)
| product(X3,X3,additive_identity) ),
c_0_5 ).
fof(c_0_16,plain,
! [X1,X2,X3] :
( ~ product(X2,X1,X3)
| ~ greater_than_0(X2)
| ~ greater_than_0(X1)
| greater_than_0(X3) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_17,plain,
! [X3] :
( ~ greater_than_0(X3)
| ~ product(X3,X3,additive_identity) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_18,axiom,
! [X3] :
( greater_than_0(X3)
| product(X3,X3,additive_identity)
| greater_than_0(additive_inverse(X3)) ),
c_0_8 ).
fof(c_0_19,plain,
! [X3] :
( ~ greater_than_0(X3)
| ~ greater_than_0(additive_inverse(X3)) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_20,plain,
! [X4,X5,X6] :
( ~ product(X5,X4,X6)
| ~ product(X5,X5,additive_identity)
| product(X6,X6,additive_identity) ),
inference(variable_rename,[status(thm)],[c_0_10]) ).
fof(c_0_21,plain,
! [X4,X5,X6] :
( product(X6,X5,X4)
| ~ product(additive_inverse(X6),additive_inverse(X5),X4) ),
inference(variable_rename,[status(thm)],[c_0_11]) ).
fof(c_0_22,plain,
! [X4,X5,X6] :
( ~ product(X6,X5,X4)
| product(additive_inverse(X6),additive_inverse(X5),X4) ),
inference(variable_rename,[status(thm)],[c_0_12]) ).
fof(c_0_23,plain,
! [X4,X5,X6] :
( ~ product(X6,X5,X4)
| product(X6,additive_inverse(X5),additive_inverse(X4)) ),
inference(variable_rename,[status(thm)],[c_0_13]) ).
fof(c_0_24,plain,
! [X4,X5,X6] :
( ~ product(X6,X5,X4)
| product(X5,X6,X4) ),
inference(variable_rename,[status(thm)],[c_0_14]) ).
fof(c_0_25,plain,
! [X4] :
( product(X4,multiplicative_inverse(X4),multiplicative_identity)
| product(X4,X4,additive_identity) ),
inference(variable_rename,[status(thm)],[c_0_15]) ).
fof(c_0_26,plain,
! [X4,X5,X6] :
( ~ product(X5,X4,X6)
| ~ greater_than_0(X5)
| ~ greater_than_0(X4)
| greater_than_0(X6) ),
inference(variable_rename,[status(thm)],[c_0_16]) ).
fof(c_0_27,plain,
! [X4] :
( ~ greater_than_0(X4)
| ~ product(X4,X4,additive_identity) ),
inference(variable_rename,[status(thm)],[c_0_17]) ).
fof(c_0_28,plain,
! [X4] :
( greater_than_0(X4)
| product(X4,X4,additive_identity)
| greater_than_0(additive_inverse(X4)) ),
inference(variable_rename,[status(thm)],[c_0_18]) ).
fof(c_0_29,plain,
! [X4] :
( ~ greater_than_0(X4)
| ~ greater_than_0(additive_inverse(X4)) ),
inference(variable_rename,[status(thm)],[c_0_19]) ).
cnf(c_0_30,plain,
( product(X1,X1,additive_identity)
| ~ product(X2,X2,additive_identity)
| ~ product(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_31,plain,
( product(X1,X2,X3)
| ~ product(additive_inverse(X1),additive_inverse(X2),X3) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_32,plain,
( product(additive_inverse(X1),additive_inverse(X2),X3)
| ~ product(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_33,plain,
( product(X1,additive_inverse(X2),additive_inverse(X3))
| ~ product(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_34,plain,
( product(X1,X2,X3)
| ~ product(X2,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_35,plain,
( product(X1,X1,additive_identity)
| product(X1,multiplicative_inverse(X1),multiplicative_identity) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_36,plain,
( greater_than_0(X1)
| ~ greater_than_0(X2)
| ~ greater_than_0(X3)
| ~ product(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_37,plain,
( ~ product(X1,X1,additive_identity)
| ~ greater_than_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_38,plain,
( greater_than_0(additive_inverse(X1))
| product(X1,X1,additive_identity)
| greater_than_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_39,plain,
( ~ greater_than_0(additive_inverse(X1))
| ~ greater_than_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_40,plain,
( product(X1,X1,additive_identity)
| ~ product(X2,X2,additive_identity)
| ~ product(X2,X3,X1) ),
c_0_30,
[final] ).
cnf(c_0_41,plain,
( product(X1,X2,X3)
| ~ product(additive_inverse(X1),additive_inverse(X2),X3) ),
c_0_31,
[final] ).
cnf(c_0_42,plain,
( product(additive_inverse(X1),additive_inverse(X2),X3)
| ~ product(X1,X2,X3) ),
c_0_32,
[final] ).
cnf(c_0_43,plain,
( product(X1,additive_inverse(X2),additive_inverse(X3))
| ~ product(X1,X2,X3) ),
c_0_33,
[final] ).
cnf(c_0_44,plain,
( product(X1,X2,X3)
| ~ product(X2,X1,X3) ),
c_0_34,
[final] ).
cnf(c_0_45,plain,
( product(X1,X1,additive_identity)
| product(X1,multiplicative_inverse(X1),multiplicative_identity) ),
c_0_35,
[final] ).
cnf(c_0_46,plain,
( greater_than_0(X1)
| ~ greater_than_0(X2)
| ~ greater_than_0(X3)
| ~ product(X3,X2,X1) ),
c_0_36,
[final] ).
cnf(c_0_47,plain,
( ~ product(X1,X1,additive_identity)
| ~ greater_than_0(X1) ),
c_0_37,
[final] ).
cnf(c_0_48,plain,
( greater_than_0(additive_inverse(X1))
| product(X1,X1,additive_identity)
| greater_than_0(X1) ),
c_0_38,
[final] ).
cnf(c_0_49,plain,
( ~ greater_than_0(additive_inverse(X1))
| ~ greater_than_0(X1) ),
c_0_39,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_40_0,axiom,
( product(X1,X1,additive_identity)
| ~ product(X2,X2,additive_identity)
| ~ product(X2,X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_40]) ).
cnf(c_0_40_1,axiom,
( ~ product(X2,X2,additive_identity)
| product(X1,X1,additive_identity)
| ~ product(X2,X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_40]) ).
cnf(c_0_40_2,axiom,
( ~ product(X2,X3,X1)
| ~ product(X2,X2,additive_identity)
| product(X1,X1,additive_identity) ),
inference(literals_permutation,[status(thm)],[c_0_40]) ).
cnf(c_0_41_0,axiom,
( product(X1,X2,X3)
| ~ product(additive_inverse(X1),additive_inverse(X2),X3) ),
inference(literals_permutation,[status(thm)],[c_0_41]) ).
cnf(c_0_41_1,axiom,
( ~ product(additive_inverse(X1),additive_inverse(X2),X3)
| product(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_41]) ).
cnf(c_0_42_0,axiom,
( product(additive_inverse(X1),additive_inverse(X2),X3)
| ~ product(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_42]) ).
cnf(c_0_42_1,axiom,
( ~ product(X1,X2,X3)
| product(additive_inverse(X1),additive_inverse(X2),X3) ),
inference(literals_permutation,[status(thm)],[c_0_42]) ).
cnf(c_0_43_0,axiom,
( product(X1,additive_inverse(X2),additive_inverse(X3))
| ~ product(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_43]) ).
cnf(c_0_43_1,axiom,
( ~ product(X1,X2,X3)
| product(X1,additive_inverse(X2),additive_inverse(X3)) ),
inference(literals_permutation,[status(thm)],[c_0_43]) ).
cnf(c_0_44_0,axiom,
( product(X1,X2,X3)
| ~ product(X2,X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_44]) ).
cnf(c_0_44_1,axiom,
( ~ product(X2,X1,X3)
| product(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_44]) ).
cnf(c_0_45_0,axiom,
( product(X1,X1,additive_identity)
| product(X1,multiplicative_inverse(X1),multiplicative_identity) ),
inference(literals_permutation,[status(thm)],[c_0_45]) ).
cnf(c_0_45_1,axiom,
( product(X1,multiplicative_inverse(X1),multiplicative_identity)
| product(X1,X1,additive_identity) ),
inference(literals_permutation,[status(thm)],[c_0_45]) ).
cnf(c_0_46_0,axiom,
( greater_than_0(X1)
| ~ greater_than_0(X2)
| ~ greater_than_0(X3)
| ~ product(X3,X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_46]) ).
cnf(c_0_46_1,axiom,
( ~ greater_than_0(X2)
| greater_than_0(X1)
| ~ greater_than_0(X3)
| ~ product(X3,X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_46]) ).
cnf(c_0_46_2,axiom,
( ~ greater_than_0(X3)
| ~ greater_than_0(X2)
| greater_than_0(X1)
| ~ product(X3,X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_46]) ).
cnf(c_0_46_3,axiom,
( ~ product(X3,X2,X1)
| ~ greater_than_0(X3)
| ~ greater_than_0(X2)
| greater_than_0(X1) ),
inference(literals_permutation,[status(thm)],[c_0_46]) ).
cnf(c_0_47_0,axiom,
( ~ product(X1,X1,additive_identity)
| ~ greater_than_0(X1) ),
inference(literals_permutation,[status(thm)],[c_0_47]) ).
cnf(c_0_47_1,axiom,
( ~ greater_than_0(X1)
| ~ product(X1,X1,additive_identity) ),
inference(literals_permutation,[status(thm)],[c_0_47]) ).
cnf(c_0_48_0,axiom,
( greater_than_0(additive_inverse(X1))
| product(X1,X1,additive_identity)
| greater_than_0(X1) ),
inference(literals_permutation,[status(thm)],[c_0_48]) ).
cnf(c_0_48_1,axiom,
( product(X1,X1,additive_identity)
| greater_than_0(additive_inverse(X1))
| greater_than_0(X1) ),
inference(literals_permutation,[status(thm)],[c_0_48]) ).
cnf(c_0_48_2,axiom,
( greater_than_0(X1)
| product(X1,X1,additive_identity)
| greater_than_0(additive_inverse(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_48]) ).
cnf(c_0_49_0,axiom,
( ~ greater_than_0(additive_inverse(X1))
| ~ greater_than_0(X1) ),
inference(literals_permutation,[status(thm)],[c_0_49]) ).
cnf(c_0_49_1,axiom,
( ~ greater_than_0(X1)
| ~ greater_than_0(additive_inverse(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_49]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_011,negated_conjecture,
~ greater_than_0(multiplicative_inverse(a)),
file('<stdin>',prove_a_inverse_greater_than_0) ).
fof(c_0_1_012,hypothesis,
greater_than_0(a),
file('<stdin>',a_greater_than_0) ).
fof(c_0_2_013,negated_conjecture,
~ greater_than_0(multiplicative_inverse(a)),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_3_014,hypothesis,
greater_than_0(a),
c_0_1 ).
fof(c_0_4_015,negated_conjecture,
~ greater_than_0(multiplicative_inverse(a)),
c_0_2 ).
fof(c_0_5_016,hypothesis,
greater_than_0(a),
c_0_3 ).
cnf(c_0_6_017,negated_conjecture,
~ greater_than_0(multiplicative_inverse(a)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7_018,hypothesis,
greater_than_0(a),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8_019,negated_conjecture,
~ greater_than_0(multiplicative_inverse(a)),
c_0_6,
[final] ).
cnf(c_0_9_020,hypothesis,
greater_than_0(a),
c_0_7,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_27,plain,
greater_than_0(a),
file('/export/starexec/sandbox2/tmp/iprover_modulo_999c7c.p',c_0_9) ).
cnf(c_36,plain,
greater_than_0(a),
inference(copy,[status(esa)],[c_27]) ).
cnf(c_43,plain,
greater_than_0(a),
inference(copy,[status(esa)],[c_36]) ).
cnf(c_44,plain,
greater_than_0(a),
inference(copy,[status(esa)],[c_43]) ).
cnf(c_47,plain,
greater_than_0(a),
inference(copy,[status(esa)],[c_44]) ).
cnf(c_130,plain,
greater_than_0(a),
inference(copy,[status(esa)],[c_47]) ).
cnf(c_15,plain,
( ~ product(X0,X1,X2)
| greater_than_0(X2)
| ~ greater_than_0(X1)
| ~ greater_than_0(X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_999c7c.p',c_0_46_2) ).
cnf(c_106,plain,
( ~ product(X0,X1,X2)
| greater_than_0(X2)
| ~ greater_than_0(X1)
| ~ greater_than_0(X0) ),
inference(copy,[status(esa)],[c_15]) ).
cnf(c_235,plain,
( ~ product(a,X0,X1)
| greater_than_0(X1)
| ~ greater_than_0(X0) ),
inference(resolution,[status(thm)],[c_130,c_106]) ).
cnf(c_236,plain,
( ~ product(a,X0,X1)
| greater_than_0(X1)
| ~ greater_than_0(X0) ),
inference(rewriting,[status(thm)],[c_235]) ).
cnf(c_7,plain,
( ~ product(X0,X1,X2)
| product(X0,additive_inverse(X1),additive_inverse(X2)) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_999c7c.p',c_0_43_0) ).
cnf(c_90,plain,
( ~ product(X0,X1,X2)
| product(X0,additive_inverse(X1),additive_inverse(X2)) ),
inference(copy,[status(esa)],[c_7]) ).
cnf(c_91,plain,
( product(X0,additive_inverse(X1),additive_inverse(X2))
| ~ product(X0,X1,X2) ),
inference(rewriting,[status(thm)],[c_90]) ).
cnf(c_263,plain,
( ~ product(a,X0,X1)
| greater_than_0(additive_inverse(X1))
| ~ greater_than_0(additive_inverse(X0)) ),
inference(resolution,[status(thm)],[c_236,c_91]) ).
cnf(c_264,plain,
( ~ product(a,X0,X1)
| greater_than_0(additive_inverse(X1))
| ~ greater_than_0(additive_inverse(X0)) ),
inference(rewriting,[status(thm)],[c_263]) ).
cnf(c_494,plain,
( ~ product(a,X0,X1)
| greater_than_0(additive_inverse(additive_inverse(X1)))
| ~ greater_than_0(additive_inverse(additive_inverse(X0))) ),
inference(resolution,[status(thm)],[c_264,c_91]) ).
cnf(c_495,plain,
( ~ product(a,X0,X1)
| greater_than_0(additive_inverse(additive_inverse(X1)))
| ~ greater_than_0(additive_inverse(additive_inverse(X0))) ),
inference(rewriting,[status(thm)],[c_494]) ).
cnf(c_19,plain,
( greater_than_0(X0)
| product(X0,X0,additive_identity)
| greater_than_0(additive_inverse(X0)) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_999c7c.p',c_0_48_0) ).
cnf(c_114,plain,
( greater_than_0(X0)
| product(X0,X0,additive_identity)
| greater_than_0(additive_inverse(X0)) ),
inference(copy,[status(esa)],[c_19]) ).
cnf(c_115,plain,
( product(X0,X0,additive_identity)
| greater_than_0(additive_inverse(X0))
| greater_than_0(X0) ),
inference(rewriting,[status(thm)],[c_114]) ).
cnf(c_1065,plain,
( product(additive_inverse(X0),additive_inverse(X0),additive_identity)
| ~ product(a,X0,X1)
| greater_than_0(additive_inverse(additive_inverse(X1)))
| greater_than_0(additive_inverse(X0)) ),
inference(resolution,[status(thm)],[c_495,c_115]) ).
cnf(c_1066,plain,
( product(additive_inverse(X0),additive_inverse(X0),additive_identity)
| ~ product(a,X0,X1)
| greater_than_0(additive_inverse(additive_inverse(X1)))
| greater_than_0(additive_inverse(X0)) ),
inference(rewriting,[status(thm)],[c_1065]) ).
cnf(c_0,plain,
( ~ product(X0,X1,X2)
| ~ product(X0,X0,additive_identity)
| product(X2,X2,additive_identity) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_999c7c.p',c_0_40_0) ).
cnf(c_76,plain,
( ~ product(X0,X1,X2)
| ~ product(X0,X0,additive_identity)
| product(X2,X2,additive_identity) ),
inference(copy,[status(esa)],[c_0]) ).
cnf(c_77,plain,
( ~ product(X0,X0,additive_identity)
| product(X1,X1,additive_identity)
| ~ product(X0,X2,X1) ),
inference(rewriting,[status(thm)],[c_76]) ).
cnf(c_9922,plain,
( product(additive_inverse(a),additive_inverse(a),additive_identity)
| ~ product(X0,a,X1)
| ~ product(X0,X0,additive_identity)
| product(X1,X1,additive_identity)
| greater_than_0(additive_inverse(additive_inverse(additive_identity)))
| greater_than_0(additive_inverse(a)) ),
inference(resolution,[status(thm)],[c_1066,c_77]) ).
cnf(c_9923,plain,
( product(additive_inverse(a),additive_inverse(a),additive_identity)
| ~ product(X0,a,X1)
| ~ product(X0,X0,additive_identity)
| product(X1,X1,additive_identity)
| greater_than_0(additive_inverse(additive_inverse(additive_identity)))
| greater_than_0(additive_inverse(a)) ),
inference(rewriting,[status(thm)],[c_9922]) ).
cnf(c_3,plain,
( ~ product(additive_inverse(X0),additive_inverse(X1),X2)
| product(X0,X1,X2) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_999c7c.p',c_0_41_0) ).
cnf(c_82,plain,
( ~ product(additive_inverse(X0),additive_inverse(X1),X2)
| product(X0,X1,X2) ),
inference(copy,[status(esa)],[c_3]) ).
cnf(c_257,plain,
( ~ product(additive_inverse(a),additive_inverse(X0),X1)
| greater_than_0(X1)
| ~ greater_than_0(X0) ),
inference(resolution,[status(thm)],[c_236,c_82]) ).
cnf(c_258,plain,
( ~ product(additive_inverse(a),additive_inverse(X0),X1)
| greater_than_0(X1)
| ~ greater_than_0(X0) ),
inference(rewriting,[status(thm)],[c_257]) ).
cnf(c_478,plain,
( ~ product(additive_inverse(a),X0,X1)
| greater_than_0(additive_inverse(X1))
| ~ greater_than_0(X0) ),
inference(resolution,[status(thm)],[c_258,c_91]) ).
cnf(c_479,plain,
( ~ product(additive_inverse(a),X0,X1)
| greater_than_0(additive_inverse(X1))
| ~ greater_than_0(X0) ),
inference(rewriting,[status(thm)],[c_478]) ).
cnf(c_25,plain,
product(X0,multiplicative_identity,X0),
file('/export/starexec/sandbox2/tmp/iprover_modulo_999c7c.p',c_0_8_0) ).
cnf(c_126,plain,
product(X0,multiplicative_identity,X0),
inference(copy,[status(esa)],[c_25]) ).
cnf(c_873,plain,
( greater_than_0(additive_inverse(additive_inverse(a)))
| ~ greater_than_0(multiplicative_identity) ),
inference(resolution,[status(thm)],[c_479,c_126]) ).
cnf(c_874,plain,
( greater_than_0(additive_inverse(additive_inverse(a)))
| ~ greater_than_0(multiplicative_identity) ),
inference(rewriting,[status(thm)],[c_873]) ).
cnf(c_498,plain,
( ~ greater_than_0(additive_inverse(multiplicative_identity))
| greater_than_0(additive_inverse(a)) ),
inference(resolution,[status(thm)],[c_264,c_126]) ).
cnf(c_499,plain,
( ~ greater_than_0(additive_inverse(multiplicative_identity))
| greater_than_0(additive_inverse(a)) ),
inference(rewriting,[status(thm)],[c_498]) ).
cnf(c_22,plain,
( ~ greater_than_0(X0)
| ~ greater_than_0(additive_inverse(X0)) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_999c7c.p',c_0_49_0) ).
cnf(c_120,plain,
( ~ greater_than_0(X0)
| ~ greater_than_0(additive_inverse(X0)) ),
inference(copy,[status(esa)],[c_22]) ).
cnf(c_121,plain,
( ~ greater_than_0(additive_inverse(X0))
| ~ greater_than_0(X0) ),
inference(rewriting,[status(thm)],[c_120]) ).
cnf(c_650,plain,
( ~ greater_than_0(additive_inverse(multiplicative_identity))
| ~ greater_than_0(a) ),
inference(resolution,[status(thm)],[c_499,c_121]) ).
cnf(c_651,plain,
( ~ greater_than_0(additive_inverse(multiplicative_identity))
| ~ greater_than_0(a) ),
inference(rewriting,[status(thm)],[c_650]) ).
cnf(c_1311,plain,
~ greater_than_0(additive_inverse(multiplicative_identity)),
inference(forward_subsumption_resolution,[status(thm)],[c_651,c_130]) ).
cnf(c_1312,plain,
~ greater_than_0(additive_inverse(multiplicative_identity)),
inference(rewriting,[status(thm)],[c_1311]) ).
cnf(c_1316,plain,
( product(multiplicative_identity,multiplicative_identity,additive_identity)
| greater_than_0(multiplicative_identity) ),
inference(resolution,[status(thm)],[c_1312,c_115]) ).
cnf(c_1317,plain,
( product(multiplicative_identity,multiplicative_identity,additive_identity)
| greater_than_0(multiplicative_identity) ),
inference(rewriting,[status(thm)],[c_1316]) ).
cnf(c_24,plain,
~ product(multiplicative_identity,multiplicative_identity,additive_identity),
file('/export/starexec/sandbox2/tmp/iprover_modulo_999c7c.p',c_0_9_0) ).
cnf(c_124,plain,
~ product(multiplicative_identity,multiplicative_identity,additive_identity),
inference(copy,[status(esa)],[c_24]) ).
cnf(c_1320,plain,
greater_than_0(multiplicative_identity),
inference(forward_subsumption_resolution,[status(thm)],[c_1317,c_124]) ).
cnf(c_1321,plain,
greater_than_0(multiplicative_identity),
inference(rewriting,[status(thm)],[c_1320]) ).
cnf(c_2039,plain,
greater_than_0(additive_inverse(additive_inverse(a))),
inference(forward_subsumption_resolution,[status(thm)],[c_874,c_1321]) ).
cnf(c_2040,plain,
greater_than_0(additive_inverse(additive_inverse(a))),
inference(rewriting,[status(thm)],[c_2039]) ).
cnf(c_2046,plain,
~ greater_than_0(additive_inverse(a)),
inference(resolution,[status(thm)],[c_2040,c_121]) ).
cnf(c_2047,plain,
~ greater_than_0(additive_inverse(a)),
inference(rewriting,[status(thm)],[c_2046]) ).
cnf(c_11576,plain,
( ~ product(X0,a,X1)
| ~ product(X0,X0,additive_identity)
| product(X1,X1,additive_identity) ),
inference(forward_subsumption_resolution,[status(thm)],[c_9923,c_2047,c_77,c_77]) ).
cnf(c_11577,plain,
( ~ product(X0,a,X1)
| ~ product(X0,X0,additive_identity)
| product(X1,X1,additive_identity) ),
inference(rewriting,[status(thm)],[c_11576]) ).
cnf(c_11,plain,
( product(X0,multiplicative_inverse(X0),multiplicative_identity)
| product(X0,X0,additive_identity) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_999c7c.p',c_0_45_0) ).
cnf(c_98,plain,
( product(X0,multiplicative_inverse(X0),multiplicative_identity)
| product(X0,X0,additive_identity) ),
inference(copy,[status(esa)],[c_11]) ).
cnf(c_11583,plain,
( product(X0,multiplicative_inverse(X0),multiplicative_identity)
| ~ product(X0,a,X1)
| product(X1,X1,additive_identity) ),
inference(resolution,[status(thm)],[c_11577,c_98]) ).
cnf(c_11584,plain,
( product(X0,multiplicative_inverse(X0),multiplicative_identity)
| ~ product(X0,a,X1)
| product(X1,X1,additive_identity) ),
inference(rewriting,[status(thm)],[c_11583]) ).
cnf(c_11830,plain,
( product(additive_identity,additive_identity,additive_identity)
| product(a,multiplicative_inverse(a),multiplicative_identity) ),
inference(resolution,[status(thm)],[c_11584,c_98]) ).
cnf(c_11831,plain,
( product(additive_identity,additive_identity,additive_identity)
| product(a,multiplicative_inverse(a),multiplicative_identity) ),
inference(rewriting,[status(thm)],[c_11830]) ).
cnf(c_13,plain,
( ~ product(X0,X1,X2)
| ~ greater_than_0(X0)
| ~ greater_than_0(X1)
| greater_than_0(X2) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_999c7c.p',c_0_46_0) ).
cnf(c_102,plain,
( ~ product(X0,X1,X2)
| ~ greater_than_0(X0)
| ~ greater_than_0(X1)
| greater_than_0(X2) ),
inference(copy,[status(esa)],[c_13]) ).
cnf(c_1314,plain,
( ~ product(X0,X1,additive_inverse(multiplicative_identity))
| ~ greater_than_0(X0)
| ~ greater_than_0(X1) ),
inference(resolution,[status(thm)],[c_1312,c_102]) ).
cnf(c_1315,plain,
( ~ product(X0,X1,additive_inverse(multiplicative_identity))
| ~ greater_than_0(X0)
| ~ greater_than_0(X1) ),
inference(rewriting,[status(thm)],[c_1314]) ).
cnf(c_1371,plain,
( ~ product(X0,X1,multiplicative_identity)
| ~ greater_than_0(additive_inverse(X1))
| ~ greater_than_0(X0) ),
inference(resolution,[status(thm)],[c_1315,c_91]) ).
cnf(c_1372,plain,
( ~ product(X0,X1,multiplicative_identity)
| ~ greater_than_0(additive_inverse(X1))
| ~ greater_than_0(X0) ),
inference(rewriting,[status(thm)],[c_1371]) ).
cnf(c_13663,plain,
( product(additive_identity,additive_identity,additive_identity)
| ~ greater_than_0(additive_inverse(multiplicative_inverse(a)))
| ~ greater_than_0(a) ),
inference(resolution,[status(thm)],[c_11831,c_1372]) ).
cnf(c_13664,plain,
( product(additive_identity,additive_identity,additive_identity)
| ~ greater_than_0(additive_inverse(multiplicative_inverse(a)))
| ~ greater_than_0(a) ),
inference(rewriting,[status(thm)],[c_13663]) ).
cnf(c_14752,plain,
( product(additive_identity,additive_identity,additive_identity)
| ~ greater_than_0(additive_inverse(multiplicative_inverse(a))) ),
inference(forward_subsumption_resolution,[status(thm)],[c_13664,c_130]) ).
cnf(c_14753,plain,
( product(additive_identity,additive_identity,additive_identity)
| ~ greater_than_0(additive_inverse(multiplicative_inverse(a))) ),
inference(rewriting,[status(thm)],[c_14752]) ).
cnf(c_14758,plain,
( product(additive_identity,additive_identity,additive_identity)
| product(multiplicative_inverse(a),multiplicative_inverse(a),additive_identity)
| greater_than_0(multiplicative_inverse(a)) ),
inference(resolution,[status(thm)],[c_14753,c_115]) ).
cnf(c_14759,plain,
( product(additive_identity,additive_identity,additive_identity)
| product(multiplicative_inverse(a),multiplicative_inverse(a),additive_identity)
| greater_than_0(multiplicative_inverse(a)) ),
inference(rewriting,[status(thm)],[c_14758]) ).
cnf(c_26,negated_conjecture,
~ greater_than_0(multiplicative_inverse(a)),
file('/export/starexec/sandbox2/tmp/iprover_modulo_999c7c.p',c_0_8) ).
cnf(c_38,negated_conjecture,
~ greater_than_0(multiplicative_inverse(a)),
inference(copy,[status(esa)],[c_26]) ).
cnf(c_42,negated_conjecture,
~ greater_than_0(multiplicative_inverse(a)),
inference(copy,[status(esa)],[c_38]) ).
cnf(c_45,negated_conjecture,
~ greater_than_0(multiplicative_inverse(a)),
inference(copy,[status(esa)],[c_42]) ).
cnf(c_46,negated_conjecture,
~ greater_than_0(multiplicative_inverse(a)),
inference(copy,[status(esa)],[c_45]) ).
cnf(c_128,plain,
~ greater_than_0(multiplicative_inverse(a)),
inference(copy,[status(esa)],[c_46]) ).
cnf(c_14868,plain,
( product(additive_identity,additive_identity,additive_identity)
| product(multiplicative_inverse(a),multiplicative_inverse(a),additive_identity) ),
inference(forward_subsumption_resolution,[status(thm)],[c_14759,c_128]) ).
cnf(c_14869,plain,
( product(additive_identity,additive_identity,additive_identity)
| product(multiplicative_inverse(a),multiplicative_inverse(a),additive_identity) ),
inference(rewriting,[status(thm)],[c_14868]) ).
cnf(c_14874,plain,
( product(additive_identity,additive_identity,additive_identity)
| ~ product(multiplicative_inverse(a),a,X0)
| product(X0,X0,additive_identity) ),
inference(resolution,[status(thm)],[c_14869,c_11577]) ).
cnf(c_14879,plain,
( product(additive_identity,additive_identity,additive_identity)
| ~ product(multiplicative_inverse(a),a,X0)
| product(X0,X0,additive_identity) ),
inference(rewriting,[status(thm)],[c_14874]) ).
cnf(c_9,plain,
( ~ product(X0,X1,X2)
| product(X1,X0,X2) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_999c7c.p',c_0_44_0) ).
cnf(c_94,plain,
( ~ product(X0,X1,X2)
| product(X1,X0,X2) ),
inference(copy,[status(esa)],[c_9]) ).
cnf(c_14912,plain,
( product(additive_identity,additive_identity,additive_identity)
| ~ product(a,multiplicative_inverse(a),X0)
| product(X0,X0,additive_identity) ),
inference(resolution,[status(thm)],[c_14879,c_94]) ).
cnf(c_14913,plain,
( product(additive_identity,additive_identity,additive_identity)
| ~ product(a,multiplicative_inverse(a),X0)
| product(X0,X0,additive_identity) ),
inference(rewriting,[status(thm)],[c_14912]) ).
cnf(c_17029,plain,
( product(additive_identity,additive_identity,additive_identity)
| product(multiplicative_identity,multiplicative_identity,additive_identity) ),
inference(resolution,[status(thm)],[c_14913,c_11831]) ).
cnf(c_17030,plain,
( product(additive_identity,additive_identity,additive_identity)
| product(multiplicative_identity,multiplicative_identity,additive_identity) ),
inference(rewriting,[status(thm)],[c_17029]) ).
cnf(c_28866,plain,
product(additive_identity,additive_identity,additive_identity),
inference(forward_subsumption_resolution,[status(thm)],[c_17030,c_124]) ).
cnf(c_28867,plain,
product(additive_identity,additive_identity,additive_identity),
inference(rewriting,[status(thm)],[c_28866]) ).
cnf(c_17,plain,
( ~ greater_than_0(X0)
| ~ product(X0,X0,additive_identity) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_999c7c.p',c_0_47_0) ).
cnf(c_110,plain,
( ~ greater_than_0(X0)
| ~ product(X0,X0,additive_identity) ),
inference(copy,[status(esa)],[c_17]) ).
cnf(c_111,plain,
( ~ product(X0,X0,additive_identity)
| ~ greater_than_0(X0) ),
inference(rewriting,[status(thm)],[c_110]) ).
cnf(c_28872,plain,
~ greater_than_0(additive_identity),
inference(resolution,[status(thm)],[c_28867,c_111]) ).
cnf(c_28875,plain,
~ greater_than_0(additive_identity),
inference(rewriting,[status(thm)],[c_28872]) ).
cnf(c_1325,plain,
( ~ product(multiplicative_identity,X0,X1)
| greater_than_0(X1)
| ~ greater_than_0(X0) ),
inference(resolution,[status(thm)],[c_1321,c_106]) ).
cnf(c_1326,plain,
( ~ product(multiplicative_identity,X0,X1)
| greater_than_0(X1)
| ~ greater_than_0(X0) ),
inference(rewriting,[status(thm)],[c_1325]) ).
cnf(c_1349,plain,
( ~ product(additive_inverse(multiplicative_identity),additive_inverse(X0),X1)
| greater_than_0(X1)
| ~ greater_than_0(X0) ),
inference(resolution,[status(thm)],[c_1326,c_82]) ).
cnf(c_1350,plain,
( ~ product(additive_inverse(multiplicative_identity),additive_inverse(X0),X1)
| greater_than_0(X1)
| ~ greater_than_0(X0) ),
inference(rewriting,[status(thm)],[c_1349]) ).
cnf(c_1627,plain,
( ~ product(additive_inverse(multiplicative_identity),X0,X1)
| greater_than_0(additive_inverse(X1))
| ~ greater_than_0(X0) ),
inference(resolution,[status(thm)],[c_1350,c_91]) ).
cnf(c_1628,plain,
( ~ product(additive_inverse(multiplicative_identity),X0,X1)
| greater_than_0(additive_inverse(X1))
| ~ greater_than_0(X0) ),
inference(rewriting,[status(thm)],[c_1627]) ).
cnf(c_3392,plain,
( greater_than_0(additive_inverse(additive_inverse(multiplicative_identity)))
| ~ greater_than_0(multiplicative_identity) ),
inference(resolution,[status(thm)],[c_1628,c_126]) ).
cnf(c_3393,plain,
( greater_than_0(additive_inverse(additive_inverse(multiplicative_identity)))
| ~ greater_than_0(multiplicative_identity) ),
inference(rewriting,[status(thm)],[c_3392]) ).
cnf(c_5303,plain,
greater_than_0(additive_inverse(additive_inverse(multiplicative_identity))),
inference(forward_subsumption_resolution,[status(thm)],[c_3393,c_1321]) ).
cnf(c_5304,plain,
greater_than_0(additive_inverse(additive_inverse(multiplicative_identity))),
inference(rewriting,[status(thm)],[c_5303]) ).
cnf(c_134,plain,
( ~ product(X0,X1,multiplicative_inverse(a))
| ~ greater_than_0(X0)
| ~ greater_than_0(X1) ),
inference(resolution,[status(thm)],[c_128,c_102]) ).
cnf(c_135,plain,
( ~ product(X0,X1,multiplicative_inverse(a))
| ~ greater_than_0(X0)
| ~ greater_than_0(X1) ),
inference(rewriting,[status(thm)],[c_134]) ).
cnf(c_5,plain,
( ~ product(X0,X1,X2)
| product(additive_inverse(X0),additive_inverse(X1),X2) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_999c7c.p',c_0_42_0) ).
cnf(c_86,plain,
( ~ product(X0,X1,X2)
| product(additive_inverse(X0),additive_inverse(X1),X2) ),
inference(copy,[status(esa)],[c_5]) ).
cnf(c_87,plain,
( product(additive_inverse(X0),additive_inverse(X1),X2)
| ~ product(X0,X1,X2) ),
inference(rewriting,[status(thm)],[c_86]) ).
cnf(c_144,plain,
( ~ product(X0,X1,multiplicative_inverse(a))
| ~ greater_than_0(additive_inverse(X0))
| ~ greater_than_0(additive_inverse(X1)) ),
inference(resolution,[status(thm)],[c_135,c_87]) ).
cnf(c_145,plain,
( ~ product(X0,X1,multiplicative_inverse(a))
| ~ greater_than_0(additive_inverse(X0))
| ~ greater_than_0(additive_inverse(X1)) ),
inference(rewriting,[status(thm)],[c_144]) ).
cnf(c_170,plain,
( ~ product(X0,X1,multiplicative_inverse(a))
| ~ greater_than_0(additive_inverse(additive_inverse(X0)))
| ~ greater_than_0(additive_inverse(additive_inverse(X1))) ),
inference(resolution,[status(thm)],[c_145,c_87]) ).
cnf(c_171,plain,
( ~ product(X0,X1,multiplicative_inverse(a))
| ~ greater_than_0(additive_inverse(additive_inverse(X0)))
| ~ greater_than_0(additive_inverse(additive_inverse(X1))) ),
inference(rewriting,[status(thm)],[c_170]) ).
cnf(c_208,plain,
( ~ greater_than_0(additive_inverse(additive_inverse(multiplicative_inverse(a))))
| ~ greater_than_0(additive_inverse(additive_inverse(multiplicative_identity))) ),
inference(resolution,[status(thm)],[c_171,c_126]) ).
cnf(c_209,plain,
( ~ greater_than_0(additive_inverse(additive_inverse(multiplicative_inverse(a))))
| ~ greater_than_0(additive_inverse(additive_inverse(multiplicative_identity))) ),
inference(rewriting,[status(thm)],[c_208]) ).
cnf(c_216,plain,
( product(additive_inverse(multiplicative_inverse(a)),additive_inverse(multiplicative_inverse(a)),additive_identity)
| ~ greater_than_0(additive_inverse(additive_inverse(multiplicative_identity)))
| greater_than_0(additive_inverse(multiplicative_inverse(a))) ),
inference(resolution,[status(thm)],[c_209,c_115]) ).
cnf(c_217,plain,
( product(additive_inverse(multiplicative_inverse(a)),additive_inverse(multiplicative_inverse(a)),additive_identity)
| ~ greater_than_0(additive_inverse(additive_inverse(multiplicative_identity)))
| greater_than_0(additive_inverse(multiplicative_inverse(a))) ),
inference(rewriting,[status(thm)],[c_216]) ).
cnf(c_5308,plain,
( product(additive_inverse(multiplicative_inverse(a)),additive_inverse(multiplicative_inverse(a)),additive_identity)
| greater_than_0(additive_inverse(multiplicative_inverse(a))) ),
inference(backward_subsumption_resolution,[status(thm)],[c_5304,c_217]) ).
cnf(c_5381,plain,
( product(additive_inverse(multiplicative_inverse(a)),additive_inverse(multiplicative_inverse(a)),additive_identity)
| greater_than_0(additive_inverse(multiplicative_inverse(a))) ),
inference(rewriting,[status(thm)],[c_5308]) ).
cnf(c_11591,plain,
( ~ product(additive_inverse(multiplicative_inverse(a)),a,X0)
| product(X0,X0,additive_identity)
| greater_than_0(additive_inverse(multiplicative_inverse(a))) ),
inference(resolution,[status(thm)],[c_11577,c_5381]) ).
cnf(c_11592,plain,
( ~ product(additive_inverse(multiplicative_inverse(a)),a,X0)
| product(X0,X0,additive_identity)
| greater_than_0(additive_inverse(multiplicative_inverse(a))) ),
inference(rewriting,[status(thm)],[c_11591]) ).
cnf(c_11627,plain,
( ~ product(a,additive_inverse(multiplicative_inverse(a)),X0)
| product(X0,X0,additive_identity)
| greater_than_0(additive_inverse(multiplicative_inverse(a))) ),
inference(resolution,[status(thm)],[c_11592,c_94]) ).
cnf(c_11628,plain,
( ~ product(a,additive_inverse(multiplicative_inverse(a)),X0)
| product(X0,X0,additive_identity)
| greater_than_0(additive_inverse(multiplicative_inverse(a))) ),
inference(rewriting,[status(thm)],[c_11627]) ).
cnf(c_11637,plain,
( product(additive_inverse(X0),additive_inverse(X0),additive_identity)
| ~ product(a,multiplicative_inverse(a),X0)
| greater_than_0(additive_inverse(multiplicative_inverse(a))) ),
inference(resolution,[status(thm)],[c_11628,c_91]) ).
cnf(c_11638,plain,
( product(additive_inverse(X0),additive_inverse(X0),additive_identity)
| ~ product(a,multiplicative_inverse(a),X0)
| greater_than_0(additive_inverse(multiplicative_inverse(a))) ),
inference(rewriting,[status(thm)],[c_11637]) ).
cnf(c_14,plain,
( ~ product(X0,X1,X2)
| ~ greater_than_0(X0)
| greater_than_0(X2)
| ~ greater_than_0(X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_999c7c.p',c_0_46_1) ).
cnf(c_104,plain,
( ~ product(X0,X1,X2)
| ~ greater_than_0(X0)
| greater_than_0(X2)
| ~ greater_than_0(X1) ),
inference(copy,[status(esa)],[c_14]) ).
cnf(c_1323,plain,
( ~ product(X0,multiplicative_identity,X1)
| ~ greater_than_0(X0)
| greater_than_0(X1) ),
inference(resolution,[status(thm)],[c_1321,c_104]) ).
cnf(c_1324,plain,
( ~ product(X0,multiplicative_identity,X1)
| ~ greater_than_0(X0)
| greater_than_0(X1) ),
inference(rewriting,[status(thm)],[c_1323]) ).
cnf(c_1333,plain,
( ~ product(additive_inverse(X0),additive_inverse(multiplicative_identity),X1)
| ~ greater_than_0(X0)
| greater_than_0(X1) ),
inference(resolution,[status(thm)],[c_1324,c_82]) ).
cnf(c_1334,plain,
( ~ product(additive_inverse(X0),additive_inverse(multiplicative_identity),X1)
| ~ greater_than_0(X0)
| greater_than_0(X1) ),
inference(rewriting,[status(thm)],[c_1333]) ).
cnf(c_11695,plain,
( ~ product(a,multiplicative_inverse(a),multiplicative_identity)
| greater_than_0(additive_identity)
| greater_than_0(additive_inverse(multiplicative_inverse(a)))
| ~ greater_than_0(multiplicative_identity) ),
inference(resolution,[status(thm)],[c_11638,c_1334]) ).
cnf(c_11696,plain,
( ~ product(a,multiplicative_inverse(a),multiplicative_identity)
| greater_than_0(additive_identity)
| greater_than_0(additive_inverse(multiplicative_inverse(a)))
| ~ greater_than_0(multiplicative_identity) ),
inference(rewriting,[status(thm)],[c_11695]) ).
cnf(c_233,plain,
( ~ product(X0,a,X1)
| ~ greater_than_0(X0)
| greater_than_0(X1) ),
inference(resolution,[status(thm)],[c_130,c_104]) ).
cnf(c_234,plain,
( ~ product(X0,a,X1)
| ~ greater_than_0(X0)
| greater_than_0(X1) ),
inference(rewriting,[status(thm)],[c_233]) ).
cnf(c_245,plain,
( product(a,multiplicative_inverse(a),multiplicative_identity)
| greater_than_0(additive_identity)
| ~ greater_than_0(a) ),
inference(resolution,[status(thm)],[c_234,c_98]) ).
cnf(c_246,plain,
( product(a,multiplicative_inverse(a),multiplicative_identity)
| greater_than_0(additive_identity)
| ~ greater_than_0(a) ),
inference(rewriting,[status(thm)],[c_245]) ).
cnf(c_272,plain,
( product(a,multiplicative_inverse(a),multiplicative_identity)
| greater_than_0(additive_identity) ),
inference(forward_subsumption_resolution,[status(thm)],[c_246,c_130]) ).
cnf(c_273,plain,
( product(a,multiplicative_inverse(a),multiplicative_identity)
| greater_than_0(additive_identity) ),
inference(rewriting,[status(thm)],[c_272]) ).
cnf(c_500,plain,
( greater_than_0(additive_identity)
| ~ greater_than_0(additive_inverse(multiplicative_inverse(a)))
| greater_than_0(additive_inverse(multiplicative_identity)) ),
inference(resolution,[status(thm)],[c_264,c_273]) ).
cnf(c_501,plain,
( greater_than_0(additive_identity)
| ~ greater_than_0(additive_inverse(multiplicative_inverse(a)))
| greater_than_0(additive_inverse(multiplicative_identity)) ),
inference(rewriting,[status(thm)],[c_500]) ).
cnf(c_174,plain,
( ~ greater_than_0(additive_inverse(multiplicative_inverse(a)))
| ~ greater_than_0(additive_inverse(multiplicative_identity)) ),
inference(resolution,[status(thm)],[c_145,c_126]) ).
cnf(c_175,plain,
( ~ greater_than_0(additive_inverse(multiplicative_inverse(a)))
| ~ greater_than_0(additive_inverse(multiplicative_identity)) ),
inference(rewriting,[status(thm)],[c_174]) ).
cnf(c_655,plain,
( greater_than_0(additive_identity)
| ~ greater_than_0(additive_inverse(multiplicative_inverse(a))) ),
inference(forward_subsumption_resolution,[status(thm)],[c_501,c_175]) ).
cnf(c_656,plain,
( greater_than_0(additive_identity)
| ~ greater_than_0(additive_inverse(multiplicative_inverse(a))) ),
inference(rewriting,[status(thm)],[c_655]) ).
cnf(c_11815,plain,
greater_than_0(additive_identity),
inference(forward_subsumption_resolution,[status(thm)],[c_11696,c_1321,c_656,c_273]) ).
cnf(c_11816,plain,
greater_than_0(additive_identity),
inference(rewriting,[status(thm)],[c_11815]) ).
cnf(c_28894,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_28875,c_11816]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ALG002-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : iprover_modulo %s %d
% 0.12/0.34 % Computer : n028.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Wed Jun 8 11:25:16 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.35 % Running in mono-core mode
% 0.20/0.40 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.40 % Orientation found
% 0.20/0.40 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_b81d37.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_999c7c.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_c6c87f | 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.43 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.43 % --bmc1_dump_file -
% 0.20/0.43 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.43 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.43 % --bmc1_ucm_extend_mode 1
% 0.20/0.43 % --bmc1_ucm_init_mode 2
% 0.20/0.43 % --bmc1_ucm_cone_mode none
% 0.20/0.43 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.43 % --bmc1_ucm_relax_model 4
% 0.20/0.43 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.43 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.43 % --bmc1_ucm_layered_model none
% 0.20/0.43 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.43
% 0.20/0.43 % ------ AIG Options
% 0.20/0.43
% 0.20/0.43 % --aig_mode false
% 0.20/0.43
% 0.20/0.43 % ------ Instantiation Options
% 0.20/0.43
% 0.20/0.43 % --instantiation_flag true
% 0.20/0.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.43 % --inst_solver_per_active 750
% 0.20/0.43 % --inst_solver_calls_frac 0.5
% 0.20/0.43 % --inst_passive_queue_type priority_queues
% 0.20/0.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.43 % --inst_passive_queues_freq [25;2]
% 0.20/0.43 % --inst_dismatching true
% 0.20/0.43 % --inst_eager_unprocessed_to_passive true
% 0.20/0.43 % --inst_prop_sim_given true
% 0.20/0.43 % --inst_prop_sim_new false
% 0.20/0.43 % --inst_orphan_elimination true
% 0.20/0.43 % --inst_learning_loop_flag true
% 0.20/0.43 % --inst_learning_start 3000
% 0.20/0.43 % --inst_learning_factor 2
% 0.20/0.43 % --inst_start_prop_sim_after_learn 3
% 0.20/0.43 % --inst_sel_renew solver
% 0.20/0.43 % --inst_lit_activity_flag true
% 0.20/0.43 % --inst_out_proof true
% 0.20/0.43
% 0.20/0.43 % ------ Resolution Options
% 0.20/0.43
% 0.20/0.43 % --resolution_flag true
% 0.20/0.43 % --res_lit_sel kbo_max
% 0.20/0.43 % --res_to_prop_solver none
% 0.20/0.43 % --res_prop_simpl_new false
% 0.20/0.43 % --res_prop_simpl_given false
% 0.20/0.43 % --res_passive_queue_type priority_queues
% 0.20/0.43 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.43 % --res_passive_queues_freq [15;5]
% 0.20/0.43 % --res_forward_subs full
% 0.20/0.43 % --res_backward_subs full
% 0.20/0.43 % --res_forward_subs_resolution true
% 0.20/0.43 % --res_backward_subs_resolution true
% 0.20/0.43 % --res_orphan_elimination false
% 0.20/0.43 % --res_time_limit 1000.
% 0.20/0.43 % --res_out_proof true
% 0.20/0.43 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_b81d37.s
% 0.20/0.43 % --modulo true
% 0.20/0.43
% 0.20/0.43 % ------ Combination Options
% 0.20/0.43
% 0.20/0.43 % --comb_res_mult 1000
% 0.20/0.43 % --comb_inst_mult 300
% 0.20/0.43 % ------
% 0.20/0.43
% 0.20/0.43 % ------ Parsing...% successful
% 0.20/0.43
% 0.20/0.43 % ------ 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.43
% 0.20/0.43 % ------ Proving...
% 0.20/0.43 % ------ Problem Properties
% 0.20/0.43
% 0.20/0.43 %
% 0.20/0.43 % EPR false
% 0.20/0.43 % Horn false
% 0.20/0.43 % Has equality false
% 0.20/0.43
% 0.20/0.43 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 % % ------ Current options:
% 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.20/0.43 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.43 % --bmc1_dump_file -
% 0.20/0.43 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.43 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.43 % --bmc1_ucm_extend_mode 1
% 0.20/0.43 % --bmc1_ucm_init_mode 2
% 0.20/0.43 % --bmc1_ucm_cone_mode none
% 0.20/0.43 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.43 % --bmc1_ucm_relax_model 4
% 0.20/0.43 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.43 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.43 % --bmc1_ucm_layered_model none
% 0.20/0.43 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.43
% 0.20/0.43 % ------ AIG Options
% 0.20/0.43
% 0.20/0.43 % --aig_mode false
% 0.20/0.43
% 0.20/0.43 % ------ Instantiation Options
% 0.20/0.43
% 0.20/0.43 % --instantiation_flag true
% 0.20/0.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.43 % --inst_solver_per_active 750
% 0.20/0.43 % --inst_solver_calls_frac 0.5
% 0.20/0.43 % --inst_passive_queue_type priority_queues
% 0.20/0.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.43 % --inst_passive_queues_freq [25;2]
% 0.20/0.43 % --inst_dismatching true
% 0.20/0.43 % --inst_eager_unprocessed_to_passive true
% 0.20/0.43 % --inst_prop_sim_given true
% 1.07/1.30 % --inst_prop_sim_new false
% 1.07/1.30 % --inst_orphan_elimination true
% 1.07/1.30 % --inst_learning_loop_flag true
% 1.07/1.30 % --inst_learning_start 3000
% 1.07/1.30 % --inst_learning_factor 2
% 1.07/1.30 % --inst_start_prop_sim_after_learn 3
% 1.07/1.30 % --inst_sel_renew solver
% 1.07/1.30 % --inst_lit_activity_flag true
% 1.07/1.30 % --inst_out_proof true
% 1.07/1.30
% 1.07/1.30 % ------ Resolution Options
% 1.07/1.30
% 1.07/1.30 % --resolution_flag true
% 1.07/1.30 % --res_lit_sel kbo_max
% 1.07/1.30 % --res_to_prop_solver none
% 1.07/1.30 % --res_prop_simpl_new false
% 1.07/1.30 % --res_prop_simpl_given false
% 1.07/1.30 % --res_passive_queue_type priority_queues
% 1.07/1.30 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.07/1.30 % --res_passive_queues_freq [15;5]
% 1.07/1.30 % --res_forward_subs full
% 1.07/1.30 % --res_backward_subs full
% 1.07/1.30 % --res_forward_subs_resolution true
% 1.07/1.30 % --res_backward_subs_resolution true
% 1.07/1.30 % --res_orphan_elimination false
% 1.07/1.30 % --res_time_limit 1000.
% 1.07/1.30 % --res_out_proof true
% 1.07/1.30 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_b81d37.s
% 1.07/1.30 % --modulo true
% 1.07/1.30
% 1.07/1.30 % ------ Combination Options
% 1.07/1.30
% 1.07/1.30 % --comb_res_mult 1000
% 1.07/1.30 % --comb_inst_mult 300
% 1.07/1.30 % ------
% 1.07/1.30
% 1.07/1.30
% 1.07/1.30
% 1.07/1.30 % ------ Proving...
% 1.07/1.30 %
% 1.07/1.30
% 1.07/1.30
% 1.07/1.30 % Resolution empty clause
% 1.07/1.30
% 1.07/1.30 % ------ Statistics
% 1.07/1.30
% 1.07/1.30 % ------ General
% 1.07/1.30
% 1.07/1.30 % num_of_input_clauses: 28
% 1.07/1.30 % num_of_input_neg_conjectures: 1
% 1.07/1.30 % num_of_splits: 0
% 1.07/1.30 % num_of_split_atoms: 0
% 1.07/1.30 % num_of_sem_filtered_clauses: 0
% 1.07/1.30 % num_of_subtypes: 0
% 1.07/1.30 % monotx_restored_types: 0
% 1.07/1.30 % sat_num_of_epr_types: 0
% 1.07/1.30 % sat_num_of_non_cyclic_types: 0
% 1.07/1.30 % sat_guarded_non_collapsed_types: 0
% 1.07/1.30 % is_epr: 0
% 1.07/1.30 % is_horn: 0
% 1.07/1.30 % has_eq: 0
% 1.07/1.30 % num_pure_diseq_elim: 0
% 1.07/1.30 % simp_replaced_by: 0
% 1.07/1.30 % res_preprocessed: 3
% 1.07/1.30 % prep_upred: 0
% 1.07/1.30 % prep_unflattend: 0
% 1.07/1.30 % pred_elim_cands: 0
% 1.07/1.30 % pred_elim: 0
% 1.07/1.30 % pred_elim_cl: 0
% 1.07/1.30 % pred_elim_cycles: 0
% 1.07/1.30 % forced_gc_time: 0
% 1.07/1.30 % gc_basic_clause_elim: 0
% 1.07/1.30 % parsing_time: 0.001
% 1.07/1.30 % sem_filter_time: 0.
% 1.07/1.30 % pred_elim_time: 0.
% 1.07/1.30 % out_proof_time: 0.002
% 1.07/1.30 % monotx_time: 0.
% 1.07/1.30 % subtype_inf_time: 0.
% 1.07/1.30 % unif_index_cands_time: 0.007
% 1.07/1.30 % unif_index_add_time: 0.003
% 1.07/1.30 % total_time: 0.895
% 1.07/1.30 % num_of_symbols: 32
% 1.07/1.30 % num_of_terms: 3792
% 1.07/1.30
% 1.07/1.30 % ------ Propositional Solver
% 1.07/1.30
% 1.07/1.30 % prop_solver_calls: 11
% 1.07/1.30 % prop_fast_solver_calls: 5
% 1.07/1.30 % prop_num_of_clauses: 1444
% 1.07/1.30 % prop_preprocess_simplified: 1562
% 1.07/1.30 % prop_fo_subsumed: 0
% 1.07/1.30 % prop_solver_time: 0.
% 1.07/1.30 % prop_fast_solver_time: 0.
% 1.07/1.30 % prop_unsat_core_time: 0.
% 1.07/1.30
% 1.07/1.30 % ------ QBF
% 1.07/1.30
% 1.07/1.30 % qbf_q_res: 0
% 1.07/1.30 % qbf_num_tautologies: 0
% 1.07/1.30 % qbf_prep_cycles: 0
% 1.07/1.30
% 1.07/1.30 % ------ BMC1
% 1.07/1.30
% 1.07/1.30 % bmc1_current_bound: -1
% 1.07/1.30 % bmc1_last_solved_bound: -1
% 1.07/1.30 % bmc1_unsat_core_size: -1
% 1.07/1.30 % bmc1_unsat_core_parents_size: -1
% 1.07/1.30 % bmc1_merge_next_fun: 0
% 1.07/1.30 % bmc1_unsat_core_clauses_time: 0.
% 1.07/1.30
% 1.07/1.30 % ------ Instantiation
% 1.07/1.30
% 1.07/1.30 % inst_num_of_clauses: 1120
% 1.07/1.30 % inst_num_in_passive: 262
% 1.07/1.30 % inst_num_in_active: 512
% 1.07/1.30 % inst_num_in_unprocessed: 284
% 1.07/1.30 % inst_num_of_loops: 600
% 1.07/1.30 % inst_num_of_learning_restarts: 0
% 1.07/1.30 % inst_num_moves_active_passive: 24
% 1.07/1.30 % inst_lit_activity: 298
% 1.07/1.30 % inst_lit_activity_moves: 0
% 1.07/1.30 % inst_num_tautologies: 62
% 1.07/1.30 % inst_num_prop_implied: 0
% 1.07/1.30 % inst_num_existing_simplified: 0
% 1.07/1.30 % inst_num_eq_res_simplified: 0
% 1.07/1.30 % inst_num_child_elim: 0
% 1.07/1.30 % inst_num_of_dismatching_blockings: 429
% 1.07/1.30 % inst_num_of_non_proper_insts: 2475
% 1.07/1.30 % inst_num_of_duplicates: 1050
% 1.07/1.30 % inst_inst_num_from_inst_to_res: 0
% 1.07/1.30 % inst_dismatching_checking_time: 0.002
% 1.07/1.30
% 1.07/1.30 % ------ Resolution
% 1.07/1.30
% 1.07/1.30 % res_num_of_clauses: 3408
% 1.07/1.30 % res_num_in_passive: 2180
% 1.07/1.30 % res_num_in_active: 1264
% 1.07/1.30 % res_num_of_loops: 2122
% 1.07/1.30 % res_forward_subset_subsumed: 2539
% 1.07/1.30 % res_backward_subset_subsumed: 117
% 1.07/1.30 % res_forward_subsumed: 650
% 1.07/1.30 % res_backward_subsumed: 107
% 1.07/1.30 % res_forward_subsumption_resolution: 129
% 1.07/1.30 % res_backward_subsumption_resolution: 59
% 1.07/1.30 % res_clause_to_clause_subsumption: 101930
% 1.07/1.30 % res_orphan_elimination: 0
% 1.07/1.30 % res_tautology_del: 181
% 1.07/1.30 % res_num_eq_res_simplified: 0
% 1.07/1.30 % res_num_sel_changes: 0
% 1.07/1.30 % res_moves_from_active_to_pass: 0
% 1.07/1.30
% 1.07/1.30 % Status Unsatisfiable
% 1.07/1.30 % SZS status Unsatisfiable
% 1.07/1.30 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------