TSTP Solution File: FLD031-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : FLD031-1 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n023.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 02:11:14 EDT 2022
% Result : Unsatisfiable 5.58s 5.77s
% Output : CNFRefutation 5.58s
% 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(different_identities,axiom,
~ equalish(additive_identity,multiplicative_identity),
input ).
fof(different_identities_0,plain,
( ~ equalish(additive_identity,multiplicative_identity)
| $false ),
inference(orientation,[status(thm)],[different_identities]) ).
cnf(well_definedness_of_multiplicative_identity,axiom,
defined(multiplicative_identity),
input ).
fof(well_definedness_of_multiplicative_identity_0,plain,
( defined(multiplicative_identity)
| $false ),
inference(orientation,[status(thm)],[well_definedness_of_multiplicative_identity]) ).
cnf(well_definedness_of_additive_identity,axiom,
defined(additive_identity),
input ).
fof(well_definedness_of_additive_identity_0,plain,
( defined(additive_identity)
| $false ),
inference(orientation,[status(thm)],[well_definedness_of_additive_identity]) ).
fof(def_lhs_atom1,axiom,
( lhs_atom1
<=> defined(additive_identity) ),
inference(definition,[],]) ).
fof(to_be_clausified_0,plain,
( lhs_atom1
| $false ),
inference(fold_definition,[status(thm)],[well_definedness_of_additive_identity_0,def_lhs_atom1]) ).
fof(def_lhs_atom2,axiom,
( lhs_atom2
<=> defined(multiplicative_identity) ),
inference(definition,[],]) ).
fof(to_be_clausified_1,plain,
( lhs_atom2
| $false ),
inference(fold_definition,[status(thm)],[well_definedness_of_multiplicative_identity_0,def_lhs_atom2]) ).
fof(def_lhs_atom3,axiom,
( lhs_atom3
<=> ~ equalish(additive_identity,multiplicative_identity) ),
inference(definition,[],]) ).
fof(to_be_clausified_2,plain,
( lhs_atom3
| $false ),
inference(fold_definition,[status(thm)],[different_identities_0,def_lhs_atom3]) ).
% Start CNF derivation
fof(c_0_0,axiom,
( lhs_atom3
| ~ $true ),
file('<stdin>',to_be_clausified_2) ).
fof(c_0_1,axiom,
( lhs_atom2
| ~ $true ),
file('<stdin>',to_be_clausified_1) ).
fof(c_0_2,axiom,
( lhs_atom1
| ~ $true ),
file('<stdin>',to_be_clausified_0) ).
fof(c_0_3,plain,
lhs_atom3,
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_4,plain,
lhs_atom2,
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_5,plain,
lhs_atom1,
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_6,plain,
lhs_atom3,
c_0_3 ).
fof(c_0_7,plain,
lhs_atom2,
c_0_4 ).
fof(c_0_8,plain,
lhs_atom1,
c_0_5 ).
cnf(c_0_9,plain,
lhs_atom3,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
lhs_atom2,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
lhs_atom1,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
lhs_atom3,
c_0_9,
[final] ).
cnf(c_0_13,plain,
lhs_atom2,
c_0_10,
[final] ).
cnf(c_0_14,plain,
lhs_atom1,
c_0_11,
[final] ).
% End CNF derivation
cnf(c_0_12_0,axiom,
~ equalish(additive_identity,multiplicative_identity),
inference(unfold_definition,[status(thm)],[c_0_12,def_lhs_atom3]) ).
cnf(c_0_13_0,axiom,
defined(multiplicative_identity),
inference(unfold_definition,[status(thm)],[c_0_13,def_lhs_atom2]) ).
cnf(c_0_14_0,axiom,
defined(additive_identity),
inference(unfold_definition,[status(thm)],[c_0_14,def_lhs_atom1]) ).
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
fof(c_0_0_001,axiom,
! [X1,X2,X3] :
( equalish(add(multiply(X3,X1),multiply(X2,X1)),multiply(add(X3,X2),X1))
| ~ defined(X3)
| ~ defined(X2)
| ~ defined(X1) ),
file('<stdin>',distributivity) ).
fof(c_0_1_002,axiom,
! [X1,X2,X3] :
( equalish(add(X3,add(X2,X1)),add(add(X3,X2),X1))
| ~ defined(X3)
| ~ defined(X2)
| ~ defined(X1) ),
file('<stdin>',associativity_addition) ).
fof(c_0_2_003,axiom,
! [X1,X2,X3] :
( equalish(multiply(X3,multiply(X2,X1)),multiply(multiply(X3,X2),X1))
| ~ defined(X3)
| ~ defined(X2)
| ~ defined(X1) ),
file('<stdin>',associativity_multiplication) ).
fof(c_0_3_004,axiom,
! [X1,X2,X3] :
( less_or_equal(add(X3,X1),add(X2,X1))
| ~ defined(X1)
| ~ less_or_equal(X3,X2) ),
file('<stdin>',compatibility_of_order_relation_and_addition) ).
fof(c_0_4_005,axiom,
! [X1,X2,X3] :
( equalish(add(X3,X1),add(X2,X1))
| ~ defined(X1)
| ~ equalish(X3,X2) ),
file('<stdin>',compatibility_of_equality_and_addition) ).
fof(c_0_5_006,axiom,
! [X1,X2,X3] :
( equalish(multiply(X3,X1),multiply(X2,X1))
| ~ defined(X1)
| ~ equalish(X3,X2) ),
file('<stdin>',compatibility_of_equality_and_multiplication) ).
fof(c_0_6_007,axiom,
! [X2,X3] :
( equalish(add(X3,X2),add(X2,X3))
| ~ defined(X3)
| ~ defined(X2) ),
file('<stdin>',commutativity_addition) ).
fof(c_0_7_008,axiom,
! [X2,X3] :
( equalish(multiply(X3,X2),multiply(X2,X3))
| ~ defined(X3)
| ~ defined(X2) ),
file('<stdin>',commutativity_multiplication) ).
fof(c_0_8_009,axiom,
! [X1,X2] :
( less_or_equal(additive_identity,multiply(X2,X1))
| ~ less_or_equal(additive_identity,X2)
| ~ less_or_equal(additive_identity,X1) ),
file('<stdin>',compatibility_of_order_relation_and_multiplication) ).
fof(c_0_9_010,axiom,
! [X3] :
( equalish(multiply(X3,multiplicative_inverse(X3)),multiplicative_identity)
| ~ defined(X3)
| equalish(X3,additive_identity) ),
file('<stdin>',existence_of_inverse_multiplication) ).
fof(c_0_10_011,axiom,
! [X2,X3] :
( equalish(X3,X2)
| ~ less_or_equal(X3,X2)
| ~ less_or_equal(X2,X3) ),
file('<stdin>',antisymmetry_of_order_relation) ).
fof(c_0_11_012,axiom,
! [X1,X2,X3] :
( less_or_equal(X3,X1)
| ~ less_or_equal(X3,X2)
| ~ less_or_equal(X2,X1) ),
file('<stdin>',transitivity_of_order_relation) ).
fof(c_0_12_013,axiom,
! [X1,X2,X3] :
( equalish(X3,X1)
| ~ equalish(X3,X2)
| ~ equalish(X2,X1) ),
file('<stdin>',transitivity_of_equality) ).
fof(c_0_13_014,axiom,
! [X1,X2,X3] :
( less_or_equal(X2,X1)
| ~ less_or_equal(X3,X1)
| ~ equalish(X3,X2) ),
file('<stdin>',compatibility_of_equality_and_order_relation) ).
fof(c_0_14_015,axiom,
! [X3] :
( equalish(add(X3,additive_inverse(X3)),additive_identity)
| ~ defined(X3) ),
file('<stdin>',existence_of_inverse_addition) ).
fof(c_0_15,axiom,
! [X2,X3] :
( defined(add(X3,X2))
| ~ defined(X3)
| ~ defined(X2) ),
file('<stdin>',well_definedness_of_addition) ).
fof(c_0_16,axiom,
! [X2,X3] :
( defined(multiply(X3,X2))
| ~ defined(X3)
| ~ defined(X2) ),
file('<stdin>',well_definedness_of_multiplication) ).
fof(c_0_17,axiom,
! [X3] :
( equalish(add(additive_identity,X3),X3)
| ~ defined(X3) ),
file('<stdin>',existence_of_identity_addition) ).
fof(c_0_18,axiom,
! [X3] :
( equalish(multiply(multiplicative_identity,X3),X3)
| ~ defined(X3) ),
file('<stdin>',existence_of_identity_multiplication) ).
fof(c_0_19,axiom,
! [X2,X3] :
( less_or_equal(X3,X2)
| less_or_equal(X2,X3)
| ~ defined(X3)
| ~ defined(X2) ),
file('<stdin>',totality_of_order_relation) ).
fof(c_0_20,axiom,
! [X2,X3] :
( equalish(X3,X2)
| ~ equalish(X2,X3) ),
file('<stdin>',symmetry_of_equality) ).
fof(c_0_21,axiom,
! [X3] :
( defined(multiplicative_inverse(X3))
| ~ defined(X3)
| equalish(X3,additive_identity) ),
file('<stdin>',well_definedness_of_multiplicative_inverse) ).
fof(c_0_22,axiom,
! [X3] :
( equalish(X3,X3)
| ~ defined(X3) ),
file('<stdin>',reflexivity_of_equality) ).
fof(c_0_23,axiom,
! [X3] :
( defined(additive_inverse(X3))
| ~ defined(X3) ),
file('<stdin>',well_definedness_of_additive_inverse) ).
fof(c_0_24,plain,
! [X1,X2,X3] :
( equalish(add(multiply(X3,X1),multiply(X2,X1)),multiply(add(X3,X2),X1))
| ~ defined(X3)
| ~ defined(X2)
| ~ defined(X1) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_25,plain,
! [X1,X2,X3] :
( equalish(add(X3,add(X2,X1)),add(add(X3,X2),X1))
| ~ defined(X3)
| ~ defined(X2)
| ~ defined(X1) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_26,plain,
! [X1,X2,X3] :
( equalish(multiply(X3,multiply(X2,X1)),multiply(multiply(X3,X2),X1))
| ~ defined(X3)
| ~ defined(X2)
| ~ defined(X1) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_27,plain,
! [X1,X2,X3] :
( less_or_equal(add(X3,X1),add(X2,X1))
| ~ defined(X1)
| ~ less_or_equal(X3,X2) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_28,plain,
! [X1,X2,X3] :
( equalish(add(X3,X1),add(X2,X1))
| ~ defined(X1)
| ~ equalish(X3,X2) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_29,plain,
! [X1,X2,X3] :
( equalish(multiply(X3,X1),multiply(X2,X1))
| ~ defined(X1)
| ~ equalish(X3,X2) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_30,plain,
! [X2,X3] :
( equalish(add(X3,X2),add(X2,X3))
| ~ defined(X3)
| ~ defined(X2) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_31,plain,
! [X2,X3] :
( equalish(multiply(X3,X2),multiply(X2,X3))
| ~ defined(X3)
| ~ defined(X2) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_32,plain,
! [X1,X2] :
( less_or_equal(additive_identity,multiply(X2,X1))
| ~ less_or_equal(additive_identity,X2)
| ~ less_or_equal(additive_identity,X1) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_33,plain,
! [X3] :
( equalish(multiply(X3,multiplicative_inverse(X3)),multiplicative_identity)
| ~ defined(X3)
| equalish(X3,additive_identity) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_34,plain,
! [X2,X3] :
( equalish(X3,X2)
| ~ less_or_equal(X3,X2)
| ~ less_or_equal(X2,X3) ),
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_35,plain,
! [X1,X2,X3] :
( less_or_equal(X3,X1)
| ~ less_or_equal(X3,X2)
| ~ less_or_equal(X2,X1) ),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_36,plain,
! [X1,X2,X3] :
( equalish(X3,X1)
| ~ equalish(X3,X2)
| ~ equalish(X2,X1) ),
inference(fof_simplification,[status(thm)],[c_0_12]) ).
fof(c_0_37,plain,
! [X1,X2,X3] :
( less_or_equal(X2,X1)
| ~ less_or_equal(X3,X1)
| ~ equalish(X3,X2) ),
inference(fof_simplification,[status(thm)],[c_0_13]) ).
fof(c_0_38,plain,
! [X3] :
( equalish(add(X3,additive_inverse(X3)),additive_identity)
| ~ defined(X3) ),
inference(fof_simplification,[status(thm)],[c_0_14]) ).
fof(c_0_39,plain,
! [X2,X3] :
( defined(add(X3,X2))
| ~ defined(X3)
| ~ defined(X2) ),
inference(fof_simplification,[status(thm)],[c_0_15]) ).
fof(c_0_40,plain,
! [X2,X3] :
( defined(multiply(X3,X2))
| ~ defined(X3)
| ~ defined(X2) ),
inference(fof_simplification,[status(thm)],[c_0_16]) ).
fof(c_0_41,plain,
! [X3] :
( equalish(add(additive_identity,X3),X3)
| ~ defined(X3) ),
inference(fof_simplification,[status(thm)],[c_0_17]) ).
fof(c_0_42,plain,
! [X3] :
( equalish(multiply(multiplicative_identity,X3),X3)
| ~ defined(X3) ),
inference(fof_simplification,[status(thm)],[c_0_18]) ).
fof(c_0_43,plain,
! [X2,X3] :
( less_or_equal(X3,X2)
| less_or_equal(X2,X3)
| ~ defined(X3)
| ~ defined(X2) ),
inference(fof_simplification,[status(thm)],[c_0_19]) ).
fof(c_0_44,plain,
! [X2,X3] :
( equalish(X3,X2)
| ~ equalish(X2,X3) ),
inference(fof_simplification,[status(thm)],[c_0_20]) ).
fof(c_0_45,plain,
! [X3] :
( defined(multiplicative_inverse(X3))
| ~ defined(X3)
| equalish(X3,additive_identity) ),
inference(fof_simplification,[status(thm)],[c_0_21]) ).
fof(c_0_46,plain,
! [X3] :
( equalish(X3,X3)
| ~ defined(X3) ),
inference(fof_simplification,[status(thm)],[c_0_22]) ).
fof(c_0_47,plain,
! [X3] :
( defined(additive_inverse(X3))
| ~ defined(X3) ),
inference(fof_simplification,[status(thm)],[c_0_23]) ).
fof(c_0_48,plain,
! [X4,X5,X6] :
( equalish(add(multiply(X6,X4),multiply(X5,X4)),multiply(add(X6,X5),X4))
| ~ defined(X6)
| ~ defined(X5)
| ~ defined(X4) ),
inference(variable_rename,[status(thm)],[c_0_24]) ).
fof(c_0_49,plain,
! [X4,X5,X6] :
( equalish(add(X6,add(X5,X4)),add(add(X6,X5),X4))
| ~ defined(X6)
| ~ defined(X5)
| ~ defined(X4) ),
inference(variable_rename,[status(thm)],[c_0_25]) ).
fof(c_0_50,plain,
! [X4,X5,X6] :
( equalish(multiply(X6,multiply(X5,X4)),multiply(multiply(X6,X5),X4))
| ~ defined(X6)
| ~ defined(X5)
| ~ defined(X4) ),
inference(variable_rename,[status(thm)],[c_0_26]) ).
fof(c_0_51,plain,
! [X4,X5,X6] :
( less_or_equal(add(X6,X4),add(X5,X4))
| ~ defined(X4)
| ~ less_or_equal(X6,X5) ),
inference(variable_rename,[status(thm)],[c_0_27]) ).
fof(c_0_52,plain,
! [X4,X5,X6] :
( equalish(add(X6,X4),add(X5,X4))
| ~ defined(X4)
| ~ equalish(X6,X5) ),
inference(variable_rename,[status(thm)],[c_0_28]) ).
fof(c_0_53,plain,
! [X4,X5,X6] :
( equalish(multiply(X6,X4),multiply(X5,X4))
| ~ defined(X4)
| ~ equalish(X6,X5) ),
inference(variable_rename,[status(thm)],[c_0_29]) ).
fof(c_0_54,plain,
! [X4,X5] :
( equalish(add(X5,X4),add(X4,X5))
| ~ defined(X5)
| ~ defined(X4) ),
inference(variable_rename,[status(thm)],[c_0_30]) ).
fof(c_0_55,plain,
! [X4,X5] :
( equalish(multiply(X5,X4),multiply(X4,X5))
| ~ defined(X5)
| ~ defined(X4) ),
inference(variable_rename,[status(thm)],[c_0_31]) ).
fof(c_0_56,plain,
! [X3,X4] :
( less_or_equal(additive_identity,multiply(X4,X3))
| ~ less_or_equal(additive_identity,X4)
| ~ less_or_equal(additive_identity,X3) ),
inference(variable_rename,[status(thm)],[c_0_32]) ).
fof(c_0_57,plain,
! [X4] :
( equalish(multiply(X4,multiplicative_inverse(X4)),multiplicative_identity)
| ~ defined(X4)
| equalish(X4,additive_identity) ),
inference(variable_rename,[status(thm)],[c_0_33]) ).
fof(c_0_58,plain,
! [X4,X5] :
( equalish(X5,X4)
| ~ less_or_equal(X5,X4)
| ~ less_or_equal(X4,X5) ),
inference(variable_rename,[status(thm)],[c_0_34]) ).
fof(c_0_59,plain,
! [X4,X5,X6] :
( less_or_equal(X6,X4)
| ~ less_or_equal(X6,X5)
| ~ less_or_equal(X5,X4) ),
inference(variable_rename,[status(thm)],[c_0_35]) ).
fof(c_0_60,plain,
! [X4,X5,X6] :
( equalish(X6,X4)
| ~ equalish(X6,X5)
| ~ equalish(X5,X4) ),
inference(variable_rename,[status(thm)],[c_0_36]) ).
fof(c_0_61,plain,
! [X4,X5,X6] :
( less_or_equal(X5,X4)
| ~ less_or_equal(X6,X4)
| ~ equalish(X6,X5) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_37])])]) ).
fof(c_0_62,plain,
! [X4] :
( equalish(add(X4,additive_inverse(X4)),additive_identity)
| ~ defined(X4) ),
inference(variable_rename,[status(thm)],[c_0_38]) ).
fof(c_0_63,plain,
! [X4,X5] :
( defined(add(X5,X4))
| ~ defined(X5)
| ~ defined(X4) ),
inference(variable_rename,[status(thm)],[c_0_39]) ).
fof(c_0_64,plain,
! [X4,X5] :
( defined(multiply(X5,X4))
| ~ defined(X5)
| ~ defined(X4) ),
inference(variable_rename,[status(thm)],[c_0_40]) ).
fof(c_0_65,plain,
! [X4] :
( equalish(add(additive_identity,X4),X4)
| ~ defined(X4) ),
inference(variable_rename,[status(thm)],[c_0_41]) ).
fof(c_0_66,plain,
! [X4] :
( equalish(multiply(multiplicative_identity,X4),X4)
| ~ defined(X4) ),
inference(variable_rename,[status(thm)],[c_0_42]) ).
fof(c_0_67,plain,
! [X4,X5] :
( less_or_equal(X5,X4)
| less_or_equal(X4,X5)
| ~ defined(X5)
| ~ defined(X4) ),
inference(variable_rename,[status(thm)],[c_0_43]) ).
fof(c_0_68,plain,
! [X4,X5] :
( equalish(X5,X4)
| ~ equalish(X4,X5) ),
inference(variable_rename,[status(thm)],[c_0_44]) ).
fof(c_0_69,plain,
! [X4] :
( defined(multiplicative_inverse(X4))
| ~ defined(X4)
| equalish(X4,additive_identity) ),
inference(variable_rename,[status(thm)],[c_0_45]) ).
fof(c_0_70,plain,
! [X4] :
( equalish(X4,X4)
| ~ defined(X4) ),
inference(variable_rename,[status(thm)],[c_0_46]) ).
fof(c_0_71,plain,
! [X4] :
( defined(additive_inverse(X4))
| ~ defined(X4) ),
inference(variable_rename,[status(thm)],[c_0_47]) ).
cnf(c_0_72,plain,
( equalish(add(multiply(X3,X1),multiply(X2,X1)),multiply(add(X3,X2),X1))
| ~ defined(X1)
| ~ defined(X2)
| ~ defined(X3) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_73,plain,
( equalish(add(X3,add(X2,X1)),add(add(X3,X2),X1))
| ~ defined(X1)
| ~ defined(X2)
| ~ defined(X3) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_74,plain,
( equalish(multiply(X3,multiply(X2,X1)),multiply(multiply(X3,X2),X1))
| ~ defined(X1)
| ~ defined(X2)
| ~ defined(X3) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_75,plain,
( less_or_equal(add(X1,X3),add(X2,X3))
| ~ less_or_equal(X1,X2)
| ~ defined(X3) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_76,plain,
( equalish(add(X1,X3),add(X2,X3))
| ~ equalish(X1,X2)
| ~ defined(X3) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_77,plain,
( equalish(multiply(X1,X3),multiply(X2,X3))
| ~ equalish(X1,X2)
| ~ defined(X3) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_78,plain,
( equalish(add(X2,X1),add(X1,X2))
| ~ defined(X1)
| ~ defined(X2) ),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_79,plain,
( equalish(multiply(X2,X1),multiply(X1,X2))
| ~ defined(X1)
| ~ defined(X2) ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_80,plain,
( less_or_equal(additive_identity,multiply(X2,X1))
| ~ less_or_equal(additive_identity,X1)
| ~ less_or_equal(additive_identity,X2) ),
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_81,plain,
( equalish(X1,additive_identity)
| equalish(multiply(X1,multiplicative_inverse(X1)),multiplicative_identity)
| ~ defined(X1) ),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_82,plain,
( equalish(X2,X1)
| ~ less_or_equal(X1,X2)
| ~ less_or_equal(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_83,plain,
( less_or_equal(X3,X2)
| ~ less_or_equal(X1,X2)
| ~ less_or_equal(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_84,plain,
( equalish(X3,X2)
| ~ equalish(X1,X2)
| ~ equalish(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_85,plain,
( less_or_equal(X2,X3)
| ~ equalish(X1,X2)
| ~ less_or_equal(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
cnf(c_0_86,plain,
( equalish(add(X1,additive_inverse(X1)),additive_identity)
| ~ defined(X1) ),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_87,plain,
( defined(add(X2,X1))
| ~ defined(X1)
| ~ defined(X2) ),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_88,plain,
( defined(multiply(X2,X1))
| ~ defined(X1)
| ~ defined(X2) ),
inference(split_conjunct,[status(thm)],[c_0_64]) ).
cnf(c_0_89,plain,
( equalish(add(additive_identity,X1),X1)
| ~ defined(X1) ),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_90,plain,
( equalish(multiply(multiplicative_identity,X1),X1)
| ~ defined(X1) ),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
cnf(c_0_91,plain,
( less_or_equal(X1,X2)
| less_or_equal(X2,X1)
| ~ defined(X1)
| ~ defined(X2) ),
inference(split_conjunct,[status(thm)],[c_0_67]) ).
cnf(c_0_92,plain,
( equalish(X2,X1)
| ~ equalish(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_68]) ).
cnf(c_0_93,plain,
( equalish(X1,additive_identity)
| defined(multiplicative_inverse(X1))
| ~ defined(X1) ),
inference(split_conjunct,[status(thm)],[c_0_69]) ).
cnf(c_0_94,plain,
( equalish(X1,X1)
| ~ defined(X1) ),
inference(split_conjunct,[status(thm)],[c_0_70]) ).
cnf(c_0_95,plain,
( defined(additive_inverse(X1))
| ~ defined(X1) ),
inference(split_conjunct,[status(thm)],[c_0_71]) ).
cnf(c_0_96,plain,
( equalish(add(multiply(X3,X1),multiply(X2,X1)),multiply(add(X3,X2),X1))
| ~ defined(X1)
| ~ defined(X2)
| ~ defined(X3) ),
c_0_72,
[final] ).
cnf(c_0_97,plain,
( equalish(add(X3,add(X2,X1)),add(add(X3,X2),X1))
| ~ defined(X1)
| ~ defined(X2)
| ~ defined(X3) ),
c_0_73,
[final] ).
cnf(c_0_98,plain,
( equalish(multiply(X3,multiply(X2,X1)),multiply(multiply(X3,X2),X1))
| ~ defined(X1)
| ~ defined(X2)
| ~ defined(X3) ),
c_0_74,
[final] ).
cnf(c_0_99,plain,
( less_or_equal(add(X1,X3),add(X2,X3))
| ~ less_or_equal(X1,X2)
| ~ defined(X3) ),
c_0_75,
[final] ).
cnf(c_0_100,plain,
( equalish(add(X1,X3),add(X2,X3))
| ~ equalish(X1,X2)
| ~ defined(X3) ),
c_0_76,
[final] ).
cnf(c_0_101,plain,
( equalish(multiply(X1,X3),multiply(X2,X3))
| ~ equalish(X1,X2)
| ~ defined(X3) ),
c_0_77,
[final] ).
cnf(c_0_102,plain,
( equalish(add(X2,X1),add(X1,X2))
| ~ defined(X1)
| ~ defined(X2) ),
c_0_78,
[final] ).
cnf(c_0_103,plain,
( equalish(multiply(X2,X1),multiply(X1,X2))
| ~ defined(X1)
| ~ defined(X2) ),
c_0_79,
[final] ).
cnf(c_0_104,plain,
( less_or_equal(additive_identity,multiply(X2,X1))
| ~ less_or_equal(additive_identity,X1)
| ~ less_or_equal(additive_identity,X2) ),
c_0_80,
[final] ).
cnf(c_0_105,plain,
( equalish(X1,additive_identity)
| equalish(multiply(X1,multiplicative_inverse(X1)),multiplicative_identity)
| ~ defined(X1) ),
c_0_81,
[final] ).
cnf(c_0_106,plain,
( equalish(X2,X1)
| ~ less_or_equal(X1,X2)
| ~ less_or_equal(X2,X1) ),
c_0_82,
[final] ).
cnf(c_0_107,plain,
( less_or_equal(X3,X2)
| ~ less_or_equal(X1,X2)
| ~ less_or_equal(X3,X1) ),
c_0_83,
[final] ).
cnf(c_0_108,plain,
( equalish(X3,X2)
| ~ equalish(X1,X2)
| ~ equalish(X3,X1) ),
c_0_84,
[final] ).
cnf(c_0_109,plain,
( less_or_equal(X2,X3)
| ~ equalish(X1,X2)
| ~ less_or_equal(X1,X3) ),
c_0_85,
[final] ).
cnf(c_0_110,plain,
( equalish(add(X1,additive_inverse(X1)),additive_identity)
| ~ defined(X1) ),
c_0_86,
[final] ).
cnf(c_0_111,plain,
( defined(add(X2,X1))
| ~ defined(X1)
| ~ defined(X2) ),
c_0_87,
[final] ).
cnf(c_0_112,plain,
( defined(multiply(X2,X1))
| ~ defined(X1)
| ~ defined(X2) ),
c_0_88,
[final] ).
cnf(c_0_113,plain,
( equalish(add(additive_identity,X1),X1)
| ~ defined(X1) ),
c_0_89,
[final] ).
cnf(c_0_114,plain,
( equalish(multiply(multiplicative_identity,X1),X1)
| ~ defined(X1) ),
c_0_90,
[final] ).
cnf(c_0_115,plain,
( less_or_equal(X1,X2)
| less_or_equal(X2,X1)
| ~ defined(X1)
| ~ defined(X2) ),
c_0_91,
[final] ).
cnf(c_0_116,plain,
( equalish(X2,X1)
| ~ equalish(X1,X2) ),
c_0_92,
[final] ).
cnf(c_0_117,plain,
( equalish(X1,additive_identity)
| defined(multiplicative_inverse(X1))
| ~ defined(X1) ),
c_0_93,
[final] ).
cnf(c_0_118,plain,
( equalish(X1,X1)
| ~ defined(X1) ),
c_0_94,
[final] ).
cnf(c_0_119,plain,
( defined(additive_inverse(X1))
| ~ defined(X1) ),
c_0_95,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_96_0,axiom,
( equalish(add(multiply(X3,X1),multiply(X2,X1)),multiply(add(X3,X2),X1))
| ~ defined(X1)
| ~ defined(X2)
| ~ defined(X3) ),
inference(literals_permutation,[status(thm)],[c_0_96]) ).
cnf(c_0_96_1,axiom,
( ~ defined(X1)
| equalish(add(multiply(X3,X1),multiply(X2,X1)),multiply(add(X3,X2),X1))
| ~ defined(X2)
| ~ defined(X3) ),
inference(literals_permutation,[status(thm)],[c_0_96]) ).
cnf(c_0_96_2,axiom,
( ~ defined(X2)
| ~ defined(X1)
| equalish(add(multiply(X3,X1),multiply(X2,X1)),multiply(add(X3,X2),X1))
| ~ defined(X3) ),
inference(literals_permutation,[status(thm)],[c_0_96]) ).
cnf(c_0_96_3,axiom,
( ~ defined(X3)
| ~ defined(X2)
| ~ defined(X1)
| equalish(add(multiply(X3,X1),multiply(X2,X1)),multiply(add(X3,X2),X1)) ),
inference(literals_permutation,[status(thm)],[c_0_96]) ).
cnf(c_0_97_0,axiom,
( equalish(add(X3,add(X2,X1)),add(add(X3,X2),X1))
| ~ defined(X1)
| ~ defined(X2)
| ~ defined(X3) ),
inference(literals_permutation,[status(thm)],[c_0_97]) ).
cnf(c_0_97_1,axiom,
( ~ defined(X1)
| equalish(add(X3,add(X2,X1)),add(add(X3,X2),X1))
| ~ defined(X2)
| ~ defined(X3) ),
inference(literals_permutation,[status(thm)],[c_0_97]) ).
cnf(c_0_97_2,axiom,
( ~ defined(X2)
| ~ defined(X1)
| equalish(add(X3,add(X2,X1)),add(add(X3,X2),X1))
| ~ defined(X3) ),
inference(literals_permutation,[status(thm)],[c_0_97]) ).
cnf(c_0_97_3,axiom,
( ~ defined(X3)
| ~ defined(X2)
| ~ defined(X1)
| equalish(add(X3,add(X2,X1)),add(add(X3,X2),X1)) ),
inference(literals_permutation,[status(thm)],[c_0_97]) ).
cnf(c_0_98_0,axiom,
( equalish(multiply(X3,multiply(X2,X1)),multiply(multiply(X3,X2),X1))
| ~ defined(X1)
| ~ defined(X2)
| ~ defined(X3) ),
inference(literals_permutation,[status(thm)],[c_0_98]) ).
cnf(c_0_98_1,axiom,
( ~ defined(X1)
| equalish(multiply(X3,multiply(X2,X1)),multiply(multiply(X3,X2),X1))
| ~ defined(X2)
| ~ defined(X3) ),
inference(literals_permutation,[status(thm)],[c_0_98]) ).
cnf(c_0_98_2,axiom,
( ~ defined(X2)
| ~ defined(X1)
| equalish(multiply(X3,multiply(X2,X1)),multiply(multiply(X3,X2),X1))
| ~ defined(X3) ),
inference(literals_permutation,[status(thm)],[c_0_98]) ).
cnf(c_0_98_3,axiom,
( ~ defined(X3)
| ~ defined(X2)
| ~ defined(X1)
| equalish(multiply(X3,multiply(X2,X1)),multiply(multiply(X3,X2),X1)) ),
inference(literals_permutation,[status(thm)],[c_0_98]) ).
cnf(c_0_99_0,axiom,
( less_or_equal(add(X1,X3),add(X2,X3))
| ~ less_or_equal(X1,X2)
| ~ defined(X3) ),
inference(literals_permutation,[status(thm)],[c_0_99]) ).
cnf(c_0_99_1,axiom,
( ~ less_or_equal(X1,X2)
| less_or_equal(add(X1,X3),add(X2,X3))
| ~ defined(X3) ),
inference(literals_permutation,[status(thm)],[c_0_99]) ).
cnf(c_0_99_2,axiom,
( ~ defined(X3)
| ~ less_or_equal(X1,X2)
| less_or_equal(add(X1,X3),add(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_99]) ).
cnf(c_0_100_0,axiom,
( equalish(add(X1,X3),add(X2,X3))
| ~ equalish(X1,X2)
| ~ defined(X3) ),
inference(literals_permutation,[status(thm)],[c_0_100]) ).
cnf(c_0_100_1,axiom,
( ~ equalish(X1,X2)
| equalish(add(X1,X3),add(X2,X3))
| ~ defined(X3) ),
inference(literals_permutation,[status(thm)],[c_0_100]) ).
cnf(c_0_100_2,axiom,
( ~ defined(X3)
| ~ equalish(X1,X2)
| equalish(add(X1,X3),add(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_100]) ).
cnf(c_0_101_0,axiom,
( equalish(multiply(X1,X3),multiply(X2,X3))
| ~ equalish(X1,X2)
| ~ defined(X3) ),
inference(literals_permutation,[status(thm)],[c_0_101]) ).
cnf(c_0_101_1,axiom,
( ~ equalish(X1,X2)
| equalish(multiply(X1,X3),multiply(X2,X3))
| ~ defined(X3) ),
inference(literals_permutation,[status(thm)],[c_0_101]) ).
cnf(c_0_101_2,axiom,
( ~ defined(X3)
| ~ equalish(X1,X2)
| equalish(multiply(X1,X3),multiply(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_101]) ).
cnf(c_0_102_0,axiom,
( equalish(add(X2,X1),add(X1,X2))
| ~ defined(X1)
| ~ defined(X2) ),
inference(literals_permutation,[status(thm)],[c_0_102]) ).
cnf(c_0_102_1,axiom,
( ~ defined(X1)
| equalish(add(X2,X1),add(X1,X2))
| ~ defined(X2) ),
inference(literals_permutation,[status(thm)],[c_0_102]) ).
cnf(c_0_102_2,axiom,
( ~ defined(X2)
| ~ defined(X1)
| equalish(add(X2,X1),add(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_102]) ).
cnf(c_0_103_0,axiom,
( equalish(multiply(X2,X1),multiply(X1,X2))
| ~ defined(X1)
| ~ defined(X2) ),
inference(literals_permutation,[status(thm)],[c_0_103]) ).
cnf(c_0_103_1,axiom,
( ~ defined(X1)
| equalish(multiply(X2,X1),multiply(X1,X2))
| ~ defined(X2) ),
inference(literals_permutation,[status(thm)],[c_0_103]) ).
cnf(c_0_103_2,axiom,
( ~ defined(X2)
| ~ defined(X1)
| equalish(multiply(X2,X1),multiply(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_103]) ).
cnf(c_0_104_0,axiom,
( less_or_equal(additive_identity,multiply(X2,X1))
| ~ less_or_equal(additive_identity,X1)
| ~ less_or_equal(additive_identity,X2) ),
inference(literals_permutation,[status(thm)],[c_0_104]) ).
cnf(c_0_104_1,axiom,
( ~ less_or_equal(additive_identity,X1)
| less_or_equal(additive_identity,multiply(X2,X1))
| ~ less_or_equal(additive_identity,X2) ),
inference(literals_permutation,[status(thm)],[c_0_104]) ).
cnf(c_0_104_2,axiom,
( ~ less_or_equal(additive_identity,X2)
| ~ less_or_equal(additive_identity,X1)
| less_or_equal(additive_identity,multiply(X2,X1)) ),
inference(literals_permutation,[status(thm)],[c_0_104]) ).
cnf(c_0_105_0,axiom,
( equalish(X1,additive_identity)
| equalish(multiply(X1,multiplicative_inverse(X1)),multiplicative_identity)
| ~ defined(X1) ),
inference(literals_permutation,[status(thm)],[c_0_105]) ).
cnf(c_0_105_1,axiom,
( equalish(multiply(X1,multiplicative_inverse(X1)),multiplicative_identity)
| equalish(X1,additive_identity)
| ~ defined(X1) ),
inference(literals_permutation,[status(thm)],[c_0_105]) ).
cnf(c_0_105_2,axiom,
( ~ defined(X1)
| equalish(multiply(X1,multiplicative_inverse(X1)),multiplicative_identity)
| equalish(X1,additive_identity) ),
inference(literals_permutation,[status(thm)],[c_0_105]) ).
cnf(c_0_106_0,axiom,
( equalish(X2,X1)
| ~ less_or_equal(X1,X2)
| ~ less_or_equal(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_106]) ).
cnf(c_0_106_1,axiom,
( ~ less_or_equal(X1,X2)
| equalish(X2,X1)
| ~ less_or_equal(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_106]) ).
cnf(c_0_106_2,axiom,
( ~ less_or_equal(X2,X1)
| ~ less_or_equal(X1,X2)
| equalish(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_106]) ).
cnf(c_0_107_0,axiom,
( less_or_equal(X3,X2)
| ~ less_or_equal(X1,X2)
| ~ less_or_equal(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_107]) ).
cnf(c_0_107_1,axiom,
( ~ less_or_equal(X1,X2)
| less_or_equal(X3,X2)
| ~ less_or_equal(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_107]) ).
cnf(c_0_107_2,axiom,
( ~ less_or_equal(X3,X1)
| ~ less_or_equal(X1,X2)
| less_or_equal(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_107]) ).
cnf(c_0_108_0,axiom,
( equalish(X3,X2)
| ~ equalish(X1,X2)
| ~ equalish(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_108]) ).
cnf(c_0_108_1,axiom,
( ~ equalish(X1,X2)
| equalish(X3,X2)
| ~ equalish(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_108]) ).
cnf(c_0_108_2,axiom,
( ~ equalish(X3,X1)
| ~ equalish(X1,X2)
| equalish(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_108]) ).
cnf(c_0_109_0,axiom,
( less_or_equal(X2,X3)
| ~ equalish(X1,X2)
| ~ less_or_equal(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_109]) ).
cnf(c_0_109_1,axiom,
( ~ equalish(X1,X2)
| less_or_equal(X2,X3)
| ~ less_or_equal(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_109]) ).
cnf(c_0_109_2,axiom,
( ~ less_or_equal(X1,X3)
| ~ equalish(X1,X2)
| less_or_equal(X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_109]) ).
cnf(c_0_110_0,axiom,
( equalish(add(X1,additive_inverse(X1)),additive_identity)
| ~ defined(X1) ),
inference(literals_permutation,[status(thm)],[c_0_110]) ).
cnf(c_0_110_1,axiom,
( ~ defined(X1)
| equalish(add(X1,additive_inverse(X1)),additive_identity) ),
inference(literals_permutation,[status(thm)],[c_0_110]) ).
cnf(c_0_111_0,axiom,
( defined(add(X2,X1))
| ~ defined(X1)
| ~ defined(X2) ),
inference(literals_permutation,[status(thm)],[c_0_111]) ).
cnf(c_0_111_1,axiom,
( ~ defined(X1)
| defined(add(X2,X1))
| ~ defined(X2) ),
inference(literals_permutation,[status(thm)],[c_0_111]) ).
cnf(c_0_111_2,axiom,
( ~ defined(X2)
| ~ defined(X1)
| defined(add(X2,X1)) ),
inference(literals_permutation,[status(thm)],[c_0_111]) ).
cnf(c_0_112_0,axiom,
( defined(multiply(X2,X1))
| ~ defined(X1)
| ~ defined(X2) ),
inference(literals_permutation,[status(thm)],[c_0_112]) ).
cnf(c_0_112_1,axiom,
( ~ defined(X1)
| defined(multiply(X2,X1))
| ~ defined(X2) ),
inference(literals_permutation,[status(thm)],[c_0_112]) ).
cnf(c_0_112_2,axiom,
( ~ defined(X2)
| ~ defined(X1)
| defined(multiply(X2,X1)) ),
inference(literals_permutation,[status(thm)],[c_0_112]) ).
cnf(c_0_113_0,axiom,
( equalish(add(additive_identity,X1),X1)
| ~ defined(X1) ),
inference(literals_permutation,[status(thm)],[c_0_113]) ).
cnf(c_0_113_1,axiom,
( ~ defined(X1)
| equalish(add(additive_identity,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_113]) ).
cnf(c_0_114_0,axiom,
( equalish(multiply(multiplicative_identity,X1),X1)
| ~ defined(X1) ),
inference(literals_permutation,[status(thm)],[c_0_114]) ).
cnf(c_0_114_1,axiom,
( ~ defined(X1)
| equalish(multiply(multiplicative_identity,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_114]) ).
cnf(c_0_115_0,axiom,
( less_or_equal(X1,X2)
| less_or_equal(X2,X1)
| ~ defined(X1)
| ~ defined(X2) ),
inference(literals_permutation,[status(thm)],[c_0_115]) ).
cnf(c_0_115_1,axiom,
( less_or_equal(X2,X1)
| less_or_equal(X1,X2)
| ~ defined(X1)
| ~ defined(X2) ),
inference(literals_permutation,[status(thm)],[c_0_115]) ).
cnf(c_0_115_2,axiom,
( ~ defined(X1)
| less_or_equal(X2,X1)
| less_or_equal(X1,X2)
| ~ defined(X2) ),
inference(literals_permutation,[status(thm)],[c_0_115]) ).
cnf(c_0_115_3,axiom,
( ~ defined(X2)
| ~ defined(X1)
| less_or_equal(X2,X1)
| less_or_equal(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_115]) ).
cnf(c_0_116_0,axiom,
( equalish(X2,X1)
| ~ equalish(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_116]) ).
cnf(c_0_116_1,axiom,
( ~ equalish(X1,X2)
| equalish(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_116]) ).
cnf(c_0_117_0,axiom,
( equalish(X1,additive_identity)
| defined(multiplicative_inverse(X1))
| ~ defined(X1) ),
inference(literals_permutation,[status(thm)],[c_0_117]) ).
cnf(c_0_117_1,axiom,
( defined(multiplicative_inverse(X1))
| equalish(X1,additive_identity)
| ~ defined(X1) ),
inference(literals_permutation,[status(thm)],[c_0_117]) ).
cnf(c_0_117_2,axiom,
( ~ defined(X1)
| defined(multiplicative_inverse(X1))
| equalish(X1,additive_identity) ),
inference(literals_permutation,[status(thm)],[c_0_117]) ).
cnf(c_0_118_0,axiom,
( equalish(X1,X1)
| ~ defined(X1) ),
inference(literals_permutation,[status(thm)],[c_0_118]) ).
cnf(c_0_118_1,axiom,
( ~ defined(X1)
| equalish(X1,X1) ),
inference(literals_permutation,[status(thm)],[c_0_118]) ).
cnf(c_0_119_0,axiom,
( defined(additive_inverse(X1))
| ~ defined(X1) ),
inference(literals_permutation,[status(thm)],[c_0_119]) ).
cnf(c_0_119_1,axiom,
( ~ defined(X1)
| defined(additive_inverse(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_119]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_016,negated_conjecture,
~ equalish(multiplicative_inverse(a),multiplicative_identity),
file('<stdin>',multiplicative_inverses_not_equal) ).
fof(c_0_1_017,negated_conjecture,
~ equalish(a,additive_identity),
file('<stdin>',a_not_equal_to_additive_identity_3) ).
fof(c_0_2_018,negated_conjecture,
equalish(a,multiplicative_identity),
file('<stdin>',a_equals_multiplicative_identity_2) ).
fof(c_0_3_019,hypothesis,
defined(a),
file('<stdin>',a_is_defined) ).
fof(c_0_4_020,negated_conjecture,
~ equalish(multiplicative_inverse(a),multiplicative_identity),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_5_021,negated_conjecture,
~ equalish(a,additive_identity),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_6_022,negated_conjecture,
equalish(a,multiplicative_identity),
c_0_2 ).
fof(c_0_7_023,hypothesis,
defined(a),
c_0_3 ).
fof(c_0_8_024,negated_conjecture,
~ equalish(multiplicative_inverse(a),multiplicative_identity),
c_0_4 ).
fof(c_0_9_025,negated_conjecture,
~ equalish(a,additive_identity),
c_0_5 ).
fof(c_0_10_026,negated_conjecture,
equalish(a,multiplicative_identity),
c_0_6 ).
fof(c_0_11_027,hypothesis,
defined(a),
c_0_7 ).
cnf(c_0_12_028,negated_conjecture,
~ equalish(multiplicative_inverse(a),multiplicative_identity),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13_029,negated_conjecture,
~ equalish(a,additive_identity),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14_030,negated_conjecture,
equalish(a,multiplicative_identity),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15_031,hypothesis,
defined(a),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16_032,negated_conjecture,
~ equalish(multiplicative_inverse(a),multiplicative_identity),
c_0_12,
[final] ).
cnf(c_0_17_033,negated_conjecture,
~ equalish(a,additive_identity),
c_0_13,
[final] ).
cnf(c_0_18_034,negated_conjecture,
equalish(a,multiplicative_identity),
c_0_14,
[final] ).
cnf(c_0_19_035,hypothesis,
defined(a),
c_0_15,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_56,plain,
( equalish(multiply(multiplicative_identity,X0),X0)
| ~ defined(X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_010f16.p',c_0_114_1) ).
cnf(c_176,plain,
( equalish(multiply(multiplicative_identity,X0),X0)
| ~ defined(X0) ),
inference(copy,[status(esa)],[c_56]) ).
cnf(c_319588,plain,
( equalish(multiply(multiplicative_identity,multiplicative_inverse(a)),multiplicative_inverse(a))
| ~ defined(multiplicative_inverse(a)) ),
inference(instantiation,[status(thm)],[c_176]) ).
cnf(c_62,plain,
( equalish(X0,X1)
| ~ equalish(X1,X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_010f16.p',c_0_116_1) ).
cnf(c_182,plain,
( equalish(X0,X1)
| ~ equalish(X1,X0) ),
inference(copy,[status(esa)],[c_62]) ).
cnf(c_51686,plain,
( equalish(multiplicative_inverse(a),X0)
| ~ equalish(X0,multiplicative_inverse(a)) ),
inference(instantiation,[status(thm)],[c_182]) ).
cnf(c_173027,plain,
( ~ equalish(multiply(multiplicative_identity,multiplicative_inverse(a)),multiplicative_inverse(a))
| equalish(multiplicative_inverse(a),multiply(multiplicative_identity,multiplicative_inverse(a))) ),
inference(instantiation,[status(thm)],[c_51686]) ).
cnf(c_39,plain,
( ~ equalish(X0,X1)
| ~ equalish(X1,X2)
| equalish(X0,X2) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_010f16.p',c_0_108_0) ).
cnf(c_159,plain,
( ~ equalish(X0,X1)
| ~ equalish(X1,X2)
| equalish(X0,X2) ),
inference(copy,[status(esa)],[c_39]) ).
cnf(c_51213,plain,
( equalish(multiplicative_inverse(a),multiplicative_identity)
| ~ equalish(multiplicative_inverse(a),X0)
| ~ equalish(X0,multiplicative_identity) ),
inference(instantiation,[status(thm)],[c_159]) ).
cnf(c_172454,plain,
( ~ equalish(multiply(multiplicative_identity,multiplicative_inverse(a)),multiplicative_identity)
| ~ equalish(multiplicative_inverse(a),multiply(multiplicative_identity,multiplicative_inverse(a)))
| equalish(multiplicative_inverse(a),multiplicative_identity) ),
inference(instantiation,[status(thm)],[c_51213]) ).
cnf(c_40,plain,
( ~ equalish(X0,X1)
| equalish(X0,X2)
| ~ equalish(X1,X2) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_010f16.p',c_0_108_1) ).
cnf(c_160,plain,
( ~ equalish(X0,X1)
| equalish(X0,X2)
| ~ equalish(X1,X2) ),
inference(copy,[status(esa)],[c_40]) ).
cnf(c_51260,plain,
( equalish(X0,multiplicative_identity)
| ~ equalish(X1,multiplicative_identity)
| ~ equalish(X0,X1) ),
inference(instantiation,[status(thm)],[c_160]) ).
cnf(c_51474,plain,
( ~ equalish(multiply(a,multiplicative_inverse(a)),multiplicative_identity)
| ~ equalish(X0,multiply(a,multiplicative_inverse(a)))
| equalish(X0,multiplicative_identity) ),
inference(instantiation,[status(thm)],[c_51260]) ).
cnf(c_51543,plain,
( ~ equalish(multiply(a,multiplicative_inverse(a)),multiplicative_identity)
| ~ equalish(multiply(X0,multiplicative_inverse(a)),multiply(a,multiplicative_inverse(a)))
| equalish(multiply(X0,multiplicative_inverse(a)),multiplicative_identity) ),
inference(instantiation,[status(thm)],[c_51474]) ).
cnf(c_52202,plain,
( ~ equalish(multiply(multiplicative_identity,multiplicative_inverse(a)),multiply(a,multiplicative_inverse(a)))
| equalish(multiply(multiplicative_identity,multiplicative_inverse(a)),multiplicative_identity)
| ~ equalish(multiply(a,multiplicative_inverse(a)),multiplicative_identity) ),
inference(instantiation,[status(thm)],[c_51543]) ).
cnf(c_19,plain,
( ~ defined(X0)
| equalish(multiply(X1,X0),multiply(X2,X0))
| ~ equalish(X1,X2) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_010f16.p',c_0_101_1) ).
cnf(c_139,plain,
( ~ defined(X0)
| equalish(multiply(X1,X0),multiply(X2,X0))
| ~ equalish(X1,X2) ),
inference(copy,[status(esa)],[c_19]) ).
cnf(c_51544,plain,
( equalish(multiply(X0,multiplicative_inverse(a)),multiply(a,multiplicative_inverse(a)))
| ~ equalish(X0,a)
| ~ defined(multiplicative_inverse(a)) ),
inference(instantiation,[status(thm)],[c_139]) ).
cnf(c_51934,plain,
( equalish(multiply(multiplicative_identity,multiplicative_inverse(a)),multiply(a,multiplicative_inverse(a)))
| ~ equalish(multiplicative_identity,a)
| ~ defined(multiplicative_inverse(a)) ),
inference(instantiation,[status(thm)],[c_51544]) ).
cnf(c_51405,plain,
( equalish(multiplicative_identity,X0)
| ~ equalish(X0,multiplicative_identity) ),
inference(instantiation,[status(thm)],[c_182]) ).
cnf(c_51700,plain,
( equalish(multiplicative_identity,a)
| ~ equalish(a,multiplicative_identity) ),
inference(instantiation,[status(thm)],[c_51405]) ).
cnf(c_30,plain,
( ~ defined(X0)
| equalish(multiply(X0,multiplicative_inverse(X0)),multiplicative_identity)
| equalish(X0,additive_identity) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_010f16.p',c_0_105_0) ).
cnf(c_150,plain,
( ~ defined(X0)
| equalish(multiply(X0,multiplicative_inverse(X0)),multiplicative_identity)
| equalish(X0,additive_identity) ),
inference(copy,[status(esa)],[c_30]) ).
cnf(c_51194,plain,
( equalish(multiply(a,multiplicative_inverse(a)),multiplicative_identity)
| equalish(a,additive_identity)
| ~ defined(a) ),
inference(instantiation,[status(thm)],[c_150]) ).
cnf(c_63,plain,
( ~ defined(X0)
| defined(multiplicative_inverse(X0))
| equalish(X0,additive_identity) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_010f16.p',c_0_117_0) ).
cnf(c_183,plain,
( ~ defined(X0)
| defined(multiplicative_inverse(X0))
| equalish(X0,additive_identity) ),
inference(copy,[status(esa)],[c_63]) ).
cnf(c_51191,plain,
( equalish(a,additive_identity)
| defined(multiplicative_inverse(a))
| ~ defined(a) ),
inference(instantiation,[status(thm)],[c_183]) ).
cnf(c_76,plain,
defined(a),
file('/export/starexec/sandbox/tmp/iprover_modulo_010f16.p',c_0_19) ).
cnf(c_73,negated_conjecture,
~ equalish(multiplicative_inverse(a),multiplicative_identity),
file('/export/starexec/sandbox/tmp/iprover_modulo_010f16.p',c_0_16) ).
cnf(c_74,negated_conjecture,
~ equalish(a,additive_identity),
file('/export/starexec/sandbox/tmp/iprover_modulo_010f16.p',c_0_17) ).
cnf(c_75,negated_conjecture,
equalish(a,multiplicative_identity),
file('/export/starexec/sandbox/tmp/iprover_modulo_010f16.p',c_0_18) ).
cnf(contradiction,plain,
$false,
inference(minisat,[status(thm)],[c_319588,c_173027,c_172454,c_52202,c_51934,c_51700,c_51194,c_51191,c_76,c_73,c_74,c_75]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : FLD031-1 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.03/0.13 % Command : iprover_modulo %s %d
% 0.12/0.34 % Computer : n023.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 : Mon Jun 6 18:42:39 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/sandbox/tmp/iprover_proof_628dcc.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_010f16.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_9200f0 | 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.42 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.42 % --bmc1_dump_file -
% 0.20/0.42 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.42 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.42 % --bmc1_ucm_extend_mode 1
% 0.20/0.42 % --bmc1_ucm_init_mode 2
% 0.20/0.42 % --bmc1_ucm_cone_mode none
% 0.20/0.42 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.42 % --bmc1_ucm_relax_model 4
% 0.20/0.42 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.42 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.42 % --bmc1_ucm_layered_model none
% 0.20/0.42 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.42
% 0.20/0.42 % ------ AIG Options
% 0.20/0.42
% 0.20/0.42 % --aig_mode false
% 0.20/0.42
% 0.20/0.42 % ------ Instantiation Options
% 0.20/0.42
% 0.20/0.42 % --instantiation_flag true
% 0.20/0.42 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.42 % --inst_solver_per_active 750
% 0.20/0.42 % --inst_solver_calls_frac 0.5
% 0.20/0.42 % --inst_passive_queue_type priority_queues
% 0.20/0.42 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.42 % --inst_passive_queues_freq [25;2]
% 0.20/0.42 % --inst_dismatching true
% 0.20/0.42 % --inst_eager_unprocessed_to_passive true
% 0.20/0.42 % --inst_prop_sim_given true
% 0.20/0.42 % --inst_prop_sim_new false
% 0.20/0.42 % --inst_orphan_elimination true
% 0.20/0.42 % --inst_learning_loop_flag true
% 0.20/0.42 % --inst_learning_start 3000
% 0.20/0.42 % --inst_learning_factor 2
% 0.20/0.42 % --inst_start_prop_sim_after_learn 3
% 0.20/0.42 % --inst_sel_renew solver
% 0.20/0.42 % --inst_lit_activity_flag true
% 0.20/0.42 % --inst_out_proof true
% 0.20/0.42
% 0.20/0.42 % ------ Resolution Options
% 0.20/0.42
% 0.20/0.42 % --resolution_flag true
% 0.20/0.42 % --res_lit_sel kbo_max
% 0.20/0.42 % --res_to_prop_solver none
% 0.20/0.42 % --res_prop_simpl_new false
% 0.20/0.42 % --res_prop_simpl_given false
% 0.20/0.42 % --res_passive_queue_type priority_queues
% 0.20/0.42 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.42 % --res_passive_queues_freq [15;5]
% 0.20/0.42 % --res_forward_subs full
% 0.20/0.42 % --res_backward_subs full
% 0.20/0.42 % --res_forward_subs_resolution true
% 0.20/0.42 % --res_backward_subs_resolution true
% 0.20/0.42 % --res_orphan_elimination false
% 0.20/0.42 % --res_time_limit 1000.
% 0.20/0.42 % --res_out_proof true
% 0.20/0.42 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_628dcc.s
% 0.20/0.42 % --modulo true
% 0.20/0.42
% 0.20/0.42 % ------ Combination Options
% 0.20/0.42
% 0.20/0.42 % --comb_res_mult 1000
% 0.20/0.42 % --comb_inst_mult 300
% 0.20/0.42 % ------
% 0.20/0.42
% 0.20/0.42 % ------ Parsing...% successful
% 0.20/0.42
% 0.20/0.42 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe:1:0s pe_e snvd_s sp: 0 0s snvd_e %
% 0.20/0.42
% 0.20/0.42 % ------ Proving...
% 0.20/0.42 % ------ Problem Properties
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % EPR false
% 0.20/0.42 % Horn false
% 0.20/0.42 % Has equality false
% 0.20/0.42
% 0.20/0.42 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 % % ------ Current options:
% 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.42 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.42 % --bmc1_dump_file -
% 0.20/0.42 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.42 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.42 % --bmc1_ucm_extend_mode 1
% 0.20/0.42 % --bmc1_ucm_init_mode 2
% 0.20/0.42 % --bmc1_ucm_cone_mode none
% 0.20/0.42 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.42 % --bmc1_ucm_relax_model 4
% 0.20/0.42 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.42 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.42 % --bmc1_ucm_layered_model none
% 0.20/0.42 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.42
% 0.20/0.42 % ------ AIG Options
% 0.20/0.42
% 0.20/0.42 % --aig_mode false
% 0.20/0.42
% 0.20/0.42 % ------ Instantiation Options
% 0.20/0.42
% 0.20/0.42 % --instantiation_flag true
% 0.20/0.42 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.42 % --inst_solver_per_active 750
% 0.20/0.42 % --inst_solver_calls_frac 0.5
% 0.20/0.42 % --inst_passive_queue_type priority_queues
% 0.20/0.42 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.42 % --inst_passive_queues_freq [25;2]
% 0.20/0.42 % --inst_dismatching true
% 0.20/0.42 % --inst_eager_unprocessed_to_passive true
% 0.20/0.42 % --inst_prop_sim_given true
% 5.58/5.76 % --inst_prop_sim_new false
% 5.58/5.76 % --inst_orphan_elimination true
% 5.58/5.76 % --inst_learning_loop_flag true
% 5.58/5.76 % --inst_learning_start 3000
% 5.58/5.76 % --inst_learning_factor 2
% 5.58/5.76 % --inst_start_prop_sim_after_learn 3
% 5.58/5.76 % --inst_sel_renew solver
% 5.58/5.76 % --inst_lit_activity_flag true
% 5.58/5.76 % --inst_out_proof true
% 5.58/5.76
% 5.58/5.76 % ------ Resolution Options
% 5.58/5.76
% 5.58/5.76 % --resolution_flag true
% 5.58/5.76 % --res_lit_sel kbo_max
% 5.58/5.76 % --res_to_prop_solver none
% 5.58/5.76 % --res_prop_simpl_new false
% 5.58/5.76 % --res_prop_simpl_given false
% 5.58/5.76 % --res_passive_queue_type priority_queues
% 5.58/5.76 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 5.58/5.76 % --res_passive_queues_freq [15;5]
% 5.58/5.76 % --res_forward_subs full
% 5.58/5.76 % --res_backward_subs full
% 5.58/5.76 % --res_forward_subs_resolution true
% 5.58/5.76 % --res_backward_subs_resolution true
% 5.58/5.76 % --res_orphan_elimination false
% 5.58/5.76 % --res_time_limit 1000.
% 5.58/5.76 % --res_out_proof true
% 5.58/5.76 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_628dcc.s
% 5.58/5.76 % --modulo true
% 5.58/5.76
% 5.58/5.76 % ------ Combination Options
% 5.58/5.76
% 5.58/5.76 % --comb_res_mult 1000
% 5.58/5.76 % --comb_inst_mult 300
% 5.58/5.76 % ------
% 5.58/5.76
% 5.58/5.76
% 5.58/5.76
% 5.58/5.76 % ------ Proving...
% 5.58/5.76 %
% 5.58/5.76
% 5.58/5.76
% 5.58/5.76 % ------ Statistics
% 5.58/5.76
% 5.58/5.76 % ------ General
% 5.58/5.76
% 5.58/5.76 % num_of_input_clauses: 77
% 5.58/5.76 % num_of_input_neg_conjectures: 3
% 5.58/5.76 % num_of_splits: 0
% 5.58/5.76 % num_of_split_atoms: 0
% 5.58/5.76 % num_of_sem_filtered_clauses: 0
% 5.58/5.76 % num_of_subtypes: 0
% 5.58/5.76 % monotx_restored_types: 0
% 5.58/5.76 % sat_num_of_epr_types: 0
% 5.58/5.76 % sat_num_of_non_cyclic_types: 0
% 5.58/5.76 % sat_guarded_non_collapsed_types: 0
% 5.58/5.76 % is_epr: 0
% 5.58/5.76 % is_horn: 0
% 5.58/5.77 % has_eq: 0
% 5.58/5.77 % num_pure_diseq_elim: 0
% 5.58/5.77 % simp_replaced_by: 0
% 5.58/5.77 % res_preprocessed: 7
% 5.58/5.77 % prep_upred: 0
% 5.58/5.77 % prep_unflattend: 0
% 5.58/5.77 % pred_elim_cands: 1
% 5.58/5.77 % pred_elim: 1
% 5.58/5.77 % pred_elim_cl: 1
% 5.58/5.77 % pred_elim_cycles: 2
% 5.58/5.77 % forced_gc_time: 0
% 5.58/5.77 % gc_basic_clause_elim: 0
% 5.58/5.77 % parsing_time: 0.002
% 5.58/5.77 % sem_filter_time: 0.
% 5.58/5.77 % pred_elim_time: 0.
% 5.58/5.77 % out_proof_time: 0.001
% 5.58/5.77 % monotx_time: 0.
% 5.58/5.77 % subtype_inf_time: 0.
% 5.58/5.77 % unif_index_cands_time: 0.058
% 5.58/5.77 % unif_index_add_time: 0.007
% 5.58/5.77 % total_time: 5.357
% 5.58/5.77 % num_of_symbols: 35
% 5.58/5.77 % num_of_terms: 39309
% 5.58/5.77
% 5.58/5.77 % ------ Propositional Solver
% 5.58/5.77
% 5.58/5.77 % prop_solver_calls: 10
% 5.58/5.77 % prop_fast_solver_calls: 11
% 5.58/5.77 % prop_num_of_clauses: 1957
% 5.58/5.77 % prop_preprocess_simplified: 2702
% 5.58/5.77 % prop_fo_subsumed: 0
% 5.58/5.77 % prop_solver_time: 0.
% 5.58/5.77 % prop_fast_solver_time: 0.
% 5.58/5.77 % prop_unsat_core_time: 0.
% 5.58/5.77
% 5.58/5.77 % ------ QBF
% 5.58/5.77
% 5.58/5.77 % qbf_q_res: 0
% 5.58/5.77 % qbf_num_tautologies: 0
% 5.58/5.77 % qbf_prep_cycles: 0
% 5.58/5.77
% 5.58/5.77 % ------ BMC1
% 5.58/5.77
% 5.58/5.77 % bmc1_current_bound: -1
% 5.58/5.77 % bmc1_last_solved_bound: -1
% 5.58/5.77 % bmc1_unsat_core_size: -1
% 5.58/5.77 % bmc1_unsat_core_parents_size: -1
% 5.58/5.77 % bmc1_merge_next_fun: 0
% 5.58/5.77 % bmc1_unsat_core_clauses_time: 0.
% 5.58/5.77
% 5.58/5.77 % ------ Instantiation
% 5.58/5.77
% 5.58/5.77 % inst_num_of_clauses: 1886
% 5.58/5.77 % inst_num_in_passive: 626
% 5.58/5.77 % inst_num_in_active: 759
% 5.58/5.77 % inst_num_in_unprocessed: 450
% 5.58/5.77 % inst_num_of_loops: 867
% 5.58/5.77 % inst_num_of_learning_restarts: 0
% 5.58/5.77 % inst_num_moves_active_passive: 56
% 5.58/5.77 % inst_lit_activity: 326
% 5.58/5.77 % inst_lit_activity_moves: 0
% 5.58/5.77 % inst_num_tautologies: 49
% 5.58/5.77 % inst_num_prop_implied: 0
% 5.58/5.77 % inst_num_existing_simplified: 0
% 5.58/5.77 % inst_num_eq_res_simplified: 0
% 5.58/5.77 % inst_num_child_elim: 0
% 5.58/5.77 % inst_num_of_dismatching_blockings: 521
% 5.58/5.77 % inst_num_of_non_proper_insts: 3498
% 5.58/5.77 % inst_num_of_duplicates: 1683
% 5.58/5.77 % inst_inst_num_from_inst_to_res: 0
% 5.58/5.77 % inst_dismatching_checking_time: 0.003
% 5.58/5.77
% 5.58/5.77 % ------ Resolution
% 5.58/5.77
% 5.58/5.77 % res_num_of_clauses: 85570
% 5.58/5.77 % res_num_in_passive: 84056
% 5.58/5.77 % res_num_in_active: 1999
% 5.58/5.77 % res_num_of_loops: 3000
% 5.58/5.77 % res_forward_subset_subsumed: 60695
% 5.58/5.77 % res_backward_subset_subsumed: 665
% 5.58/5.77 % res_forward_subsumed: 855
% 5.58/5.77 % res_backward_subsumed: 3
% 5.58/5.77 % res_forward_subsumption_resolution: 412
% 5.58/5.77 % res_backward_subsumption_resolution: 0
% 5.58/5.77 % res_clause_to_clause_subsumption: 91075
% 5.58/5.77 % res_orphan_elimination: 0
% 5.58/5.77 % res_tautology_del: 2206
% 5.58/5.77 % res_num_eq_res_simplified: 0
% 5.58/5.77 % res_num_sel_changes: 0
% 5.58/5.77 % res_moves_from_active_to_pass: 0
% 5.58/5.77
% 5.58/5.77 % Status Unsatisfiable
% 5.58/5.77 % SZS status Unsatisfiable
% 5.58/5.77 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------