%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : FLD060-2 : 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:32 EDT 2022
% Result : Unsatisfiable 157.55s 157.74s
% Output : CNFRefutation 157.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 49
% Syntax : Number of formulae : 297 ( 66 unt; 0 def)
% Number of atoms : 751 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 892 ( 438 ~; 454 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 466 ( 0 sgn 150 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
% Axioms transformation by autotheo
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
fof(c_0_0,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,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_2,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_3,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_4,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,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_6,axiom,
! [X2,X3] :
( equalish(multiply(X3,X2),multiply(X2,X3))
| ~ defined(X3)
| ~ defined(X2) ),
file('<stdin>',commutativity_multiplication) ).
fof(c_0_7,axiom,
! [X2,X3] :
( equalish(add(X3,X2),add(X2,X3))
| ~ defined(X3)
| ~ defined(X2) ),
file('<stdin>',commutativity_addition) ).
fof(c_0_8,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,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,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_11,axiom,
! [X1,X2,X3] :
( equalish(X3,X1)
| ~ equalish(X3,X2)
| ~ equalish(X2,X1) ),
file('<stdin>',transitivity_of_equality) ).
fof(c_0_12,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_13,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_14,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(multiply(X3,X2))
| ~ defined(X3)
| ~ defined(X2) ),
file('<stdin>',well_definedness_of_multiplication) ).
fof(c_0_16,axiom,
! [X2,X3] :
( defined(add(X3,X2))
| ~ defined(X3)
| ~ defined(X2) ),
file('<stdin>',well_definedness_of_addition) ).
fof(c_0_17,axiom,
! [X3] :
( equalish(multiply(multiplicative_identity,X3),X3)
| ~ defined(X3) ),
file('<stdin>',existence_of_identity_multiplication) ).
fof(c_0_18,axiom,
! [X3] :
( equalish(add(additive_identity,X3),X3)
| ~ defined(X3) ),
file('<stdin>',existence_of_identity_addition) ).
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,
~ equalish(additive_identity,multiplicative_identity),
file('<stdin>',different_identities) ).
fof(c_0_24,axiom,
! [X3] :
( defined(additive_inverse(X3))
| ~ defined(X3) ),
file('<stdin>',well_definedness_of_additive_inverse) ).
fof(c_0_25,axiom,
defined(multiplicative_identity),
file('<stdin>',well_definedness_of_multiplicative_identity) ).
fof(c_0_26,axiom,
defined(additive_identity),
file('<stdin>',well_definedness_of_additive_identity) ).
fof(c_0_27,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_28,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_1]) ).
fof(c_0_29,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_2]) ).
fof(c_0_30,plain,
! [X1,X2,X3] :
( equalish(multiply(X3,X1),multiply(X2,X1))
| ~ defined(X1)
| ~ equalish(X3,X2) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_31,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_32,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_5]) ).
fof(c_0_33,plain,
! [X2,X3] :
( equalish(multiply(X3,X2),multiply(X2,X3))
| ~ defined(X3)
| ~ defined(X2) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_34,plain,
! [X2,X3] :
( equalish(add(X3,X2),add(X2,X3))
| ~ defined(X3)
| ~ defined(X2) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_35,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_36,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_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_10]) ).
fof(c_0_38,plain,
! [X1,X2,X3] :
( equalish(X3,X1)
| ~ equalish(X3,X2)
| ~ equalish(X2,X1) ),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_39,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_12]) ).
fof(c_0_40,plain,
! [X2,X3] :
( equalish(X3,X2)
| ~ less_or_equal(X3,X2)
| ~ less_or_equal(X2,X3) ),
inference(fof_simplification,[status(thm)],[c_0_13]) ).
fof(c_0_41,plain,
! [X3] :
( equalish(add(X3,additive_inverse(X3)),additive_identity)
| ~ defined(X3) ),
inference(fof_simplification,[status(thm)],[c_0_14]) ).
fof(c_0_42,plain,
! [X2,X3] :
( defined(multiply(X3,X2))
| ~ defined(X3)
| ~ defined(X2) ),
inference(fof_simplification,[status(thm)],[c_0_15]) ).
fof(c_0_43,plain,
! [X2,X3] :
( defined(add(X3,X2))
| ~ defined(X3)
| ~ defined(X2) ),
inference(fof_simplification,[status(thm)],[c_0_16]) ).
fof(c_0_44,plain,
! [X3] :
( equalish(multiply(multiplicative_identity,X3),X3)
| ~ defined(X3) ),
inference(fof_simplification,[status(thm)],[c_0_17]) ).
fof(c_0_45,plain,
! [X3] :
( equalish(add(additive_identity,X3),X3)
| ~ defined(X3) ),
inference(fof_simplification,[status(thm)],[c_0_18]) ).
fof(c_0_46,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_47,plain,
! [X2,X3] :
( equalish(X3,X2)
| ~ equalish(X2,X3) ),
inference(fof_simplification,[status(thm)],[c_0_20]) ).
fof(c_0_48,plain,
! [X3] :
( defined(multiplicative_inverse(X3))
| ~ defined(X3)
| equalish(X3,additive_identity) ),
inference(fof_simplification,[status(thm)],[c_0_21]) ).
fof(c_0_49,plain,
! [X3] :
( equalish(X3,X3)
| ~ defined(X3) ),
inference(fof_simplification,[status(thm)],[c_0_22]) ).
fof(c_0_50,plain,
~ equalish(additive_identity,multiplicative_identity),
inference(fof_simplification,[status(thm)],[c_0_23]) ).
fof(c_0_51,plain,
! [X3] :
( defined(additive_inverse(X3))
| ~ defined(X3) ),
inference(fof_simplification,[status(thm)],[c_0_24]) ).
fof(c_0_52,axiom,
defined(multiplicative_identity),
c_0_25 ).
fof(c_0_53,axiom,
defined(additive_identity),
c_0_26 ).
fof(c_0_54,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_27]) ).
fof(c_0_55,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_28]) ).
fof(c_0_56,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_29]) ).
fof(c_0_57,plain,
! [X4,X5,X6] :
( equalish(multiply(X6,X4),multiply(X5,X4))
| ~ defined(X4)
| ~ equalish(X6,X5) ),
inference(variable_rename,[status(thm)],[c_0_30]) ).
fof(c_0_58,plain,
! [X4,X5,X6] :
( equalish(add(X6,X4),add(X5,X4))
| ~ defined(X4)
| ~ equalish(X6,X5) ),
inference(variable_rename,[status(thm)],[c_0_31]) ).
fof(c_0_59,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_32]) ).
fof(c_0_60,plain,
! [X4,X5] :
( equalish(multiply(X5,X4),multiply(X4,X5))
| ~ defined(X5)
| ~ defined(X4) ),
inference(variable_rename,[status(thm)],[c_0_33]) ).
fof(c_0_61,plain,
! [X4,X5] :
( equalish(add(X5,X4),add(X4,X5))
| ~ defined(X5)
| ~ defined(X4) ),
inference(variable_rename,[status(thm)],[c_0_34]) ).
fof(c_0_62,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_35]) ).
fof(c_0_63,plain,
! [X4] :
( equalish(multiply(X4,multiplicative_inverse(X4)),multiplicative_identity)
| ~ defined(X4)
| equalish(X4,additive_identity) ),
inference(variable_rename,[status(thm)],[c_0_36]) ).
fof(c_0_64,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_65,plain,
! [X4,X5,X6] :
( equalish(X6,X4)
| ~ equalish(X6,X5)
| ~ equalish(X5,X4) ),
inference(variable_rename,[status(thm)],[c_0_38]) ).
fof(c_0_66,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_39]) ).
fof(c_0_67,plain,
! [X4,X5] :
( equalish(X5,X4)
| ~ less_or_equal(X5,X4)
| ~ less_or_equal(X4,X5) ),
inference(variable_rename,[status(thm)],[c_0_40]) ).
fof(c_0_68,plain,
! [X4] :
( equalish(add(X4,additive_inverse(X4)),additive_identity)
| ~ defined(X4) ),
inference(variable_rename,[status(thm)],[c_0_41]) ).
fof(c_0_69,plain,
! [X4,X5] :
( defined(multiply(X5,X4))
| ~ defined(X5)
| ~ defined(X4) ),
inference(variable_rename,[status(thm)],[c_0_42]) ).
fof(c_0_70,plain,
! [X4,X5] :
( defined(add(X5,X4))
| ~ defined(X5)
| ~ defined(X4) ),
inference(variable_rename,[status(thm)],[c_0_43]) ).
fof(c_0_71,plain,
! [X4] :
( equalish(multiply(multiplicative_identity,X4),X4)
| ~ defined(X4) ),
inference(variable_rename,[status(thm)],[c_0_44]) ).
fof(c_0_72,plain,
! [X4] :
( equalish(add(additive_identity,X4),X4)
| ~ defined(X4) ),
inference(variable_rename,[status(thm)],[c_0_45]) ).
fof(c_0_73,plain,
! [X4,X5] :
( less_or_equal(X5,X4)
| less_or_equal(X4,X5)
| ~ defined(X5)
| ~ defined(X4) ),
inference(variable_rename,[status(thm)],[c_0_46]) ).
fof(c_0_74,plain,
! [X4,X5] :
( equalish(X5,X4)
| ~ equalish(X4,X5) ),
inference(variable_rename,[status(thm)],[c_0_47]) ).
fof(c_0_75,plain,
! [X4] :
( defined(multiplicative_inverse(X4))
| ~ defined(X4)
| equalish(X4,additive_identity) ),
inference(variable_rename,[status(thm)],[c_0_48]) ).
fof(c_0_76,plain,
! [X4] :
( equalish(X4,X4)
| ~ defined(X4) ),
inference(variable_rename,[status(thm)],[c_0_49]) ).
fof(c_0_77,plain,
~ equalish(additive_identity,multiplicative_identity),
c_0_50 ).
fof(c_0_78,plain,
! [X4] :
( defined(additive_inverse(X4))
| ~ defined(X4) ),
inference(variable_rename,[status(thm)],[c_0_51]) ).
fof(c_0_79,axiom,
defined(multiplicative_identity),
c_0_52 ).
fof(c_0_80,axiom,
defined(additive_identity),
c_0_53 ).
cnf(c_0_81,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_54]) ).
cnf(c_0_82,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_55]) ).
cnf(c_0_83,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_56]) ).
cnf(c_0_84,plain,
( equalish(multiply(X1,X3),multiply(X2,X3))
| ~ equalish(X1,X2)
| ~ defined(X3) ),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_85,plain,
( equalish(add(X1,X3),add(X2,X3))
| ~ equalish(X1,X2)
| ~ defined(X3) ),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_86,plain,
( less_or_equal(add(X1,X3),add(X2,X3))
| ~ less_or_equal(X1,X2)
| ~ defined(X3) ),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_87,plain,
( equalish(multiply(X2,X1),multiply(X1,X2))
| ~ defined(X1)
| ~ defined(X2) ),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_88,plain,
( equalish(add(X2,X1),add(X1,X2))
| ~ defined(X1)
| ~ defined(X2) ),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
cnf(c_0_89,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_62]) ).
cnf(c_0_90,plain,
( equalish(X1,additive_identity)
| equalish(multiply(X1,multiplicative_inverse(X1)),multiplicative_identity)
| ~ defined(X1) ),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_91,plain,
( less_or_equal(X2,X3)
| ~ equalish(X1,X2)
| ~ less_or_equal(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_64]) ).
cnf(c_0_92,plain,
( equalish(X3,X2)
| ~ equalish(X1,X2)
| ~ equalish(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_93,plain,
( less_or_equal(X3,X2)
| ~ less_or_equal(X1,X2)
| ~ less_or_equal(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
cnf(c_0_94,plain,
( equalish(X2,X1)
| ~ less_or_equal(X1,X2)
| ~ less_or_equal(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_67]) ).
cnf(c_0_95,plain,
( equalish(add(X1,additive_inverse(X1)),additive_identity)
| ~ defined(X1) ),
inference(split_conjunct,[status(thm)],[c_0_68]) ).
cnf(c_0_96,plain,
( defined(multiply(X2,X1))
| ~ defined(X1)
| ~ defined(X2) ),
inference(split_conjunct,[status(thm)],[c_0_69]) ).
cnf(c_0_97,plain,
( defined(add(X2,X1))
| ~ defined(X1)
| ~ defined(X2) ),
inference(split_conjunct,[status(thm)],[c_0_70]) ).
cnf(c_0_98,plain,
( equalish(multiply(multiplicative_identity,X1),X1)
| ~ defined(X1) ),
inference(split_conjunct,[status(thm)],[c_0_71]) ).
cnf(c_0_99,plain,
( equalish(add(additive_identity,X1),X1)
| ~ defined(X1) ),
inference(split_conjunct,[status(thm)],[c_0_72]) ).
cnf(c_0_100,plain,
( less_or_equal(X1,X2)
| less_or_equal(X2,X1)
| ~ defined(X1)
| ~ defined(X2) ),
inference(split_conjunct,[status(thm)],[c_0_73]) ).
cnf(c_0_101,plain,
( equalish(X2,X1)
| ~ equalish(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_74]) ).
cnf(c_0_102,plain,
( equalish(X1,additive_identity)
| defined(multiplicative_inverse(X1))
| ~ defined(X1) ),
inference(split_conjunct,[status(thm)],[c_0_75]) ).
cnf(c_0_103,plain,
( equalish(X1,X1)
| ~ defined(X1) ),
inference(split_conjunct,[status(thm)],[c_0_76]) ).
cnf(c_0_104,plain,
~ equalish(additive_identity,multiplicative_identity),
inference(split_conjunct,[status(thm)],[c_0_77]) ).
cnf(c_0_105,plain,
( defined(additive_inverse(X1))
| ~ defined(X1) ),
inference(split_conjunct,[status(thm)],[c_0_78]) ).
cnf(c_0_106,plain,
defined(multiplicative_identity),
inference(split_conjunct,[status(thm)],[c_0_79]) ).
cnf(c_0_107,plain,
defined(additive_identity),
inference(split_conjunct,[status(thm)],[c_0_80]) ).
cnf(c_0_108,plain,
( equalish(add(multiply(X3,X1),multiply(X2,X1)),multiply(add(X3,X2),X1))
| ~ defined(X1)
| ~ defined(X2)
| ~ defined(X3) ),
c_0_81,
[final] ).
cnf(c_0_109,plain,
( equalish(multiply(X3,multiply(X2,X1)),multiply(multiply(X3,X2),X1))
| ~ defined(X1)
| ~ defined(X2)
| ~ defined(X3) ),
c_0_82,
[final] ).
cnf(c_0_110,plain,
( equalish(add(X3,add(X2,X1)),add(add(X3,X2),X1))
| ~ defined(X1)
| ~ defined(X2)
| ~ defined(X3) ),
c_0_83,
[final] ).
cnf(c_0_111,plain,
( equalish(multiply(X1,X3),multiply(X2,X3))
| ~ equalish(X1,X2)
| ~ defined(X3) ),
c_0_84,
[final] ).
cnf(c_0_112,plain,
( equalish(add(X1,X3),add(X2,X3))
| ~ equalish(X1,X2)
| ~ defined(X3) ),
c_0_85,
[final] ).
cnf(c_0_113,plain,
( less_or_equal(add(X1,X3),add(X2,X3))
| ~ less_or_equal(X1,X2)
| ~ defined(X3) ),
c_0_86,
[final] ).
cnf(c_0_114,plain,
( equalish(multiply(X2,X1),multiply(X1,X2))
| ~ defined(X1)
| ~ defined(X2) ),
c_0_87,
[final] ).
cnf(c_0_115,plain,
( equalish(add(X2,X1),add(X1,X2))
| ~ defined(X1)
| ~ defined(X2) ),
c_0_88,
[final] ).
cnf(c_0_116,plain,
( less_or_equal(additive_identity,multiply(X2,X1))
| ~ less_or_equal(additive_identity,X1)
| ~ less_or_equal(additive_identity,X2) ),
c_0_89,
[final] ).
cnf(c_0_117,plain,
( equalish(X1,additive_identity)
| equalish(multiply(X1,multiplicative_inverse(X1)),multiplicative_identity)
| ~ defined(X1) ),
c_0_90,
[final] ).
cnf(c_0_118,plain,
( less_or_equal(X2,X3)
| ~ equalish(X1,X2)
| ~ less_or_equal(X1,X3) ),
c_0_91,
[final] ).
cnf(c_0_119,plain,
( equalish(X3,X2)
| ~ equalish(X1,X2)
| ~ equalish(X3,X1) ),
c_0_92,
[final] ).
cnf(c_0_120,plain,
( less_or_equal(X3,X2)
| ~ less_or_equal(X1,X2)
| ~ less_or_equal(X3,X1) ),
c_0_93,
[final] ).
cnf(c_0_121,plain,
( equalish(X2,X1)
| ~ less_or_equal(X1,X2)
| ~ less_or_equal(X2,X1) ),
c_0_94,
[final] ).
cnf(c_0_122,plain,
( equalish(add(X1,additive_inverse(X1)),additive_identity)
| ~ defined(X1) ),
c_0_95,
[final] ).
cnf(c_0_123,plain,
( defined(multiply(X2,X1))
| ~ defined(X1)
| ~ defined(X2) ),
c_0_96,
[final] ).
cnf(c_0_124,plain,
( defined(add(X2,X1))
| ~ defined(X1)
| ~ defined(X2) ),
c_0_97,
[final] ).
cnf(c_0_125,plain,
( equalish(multiply(multiplicative_identity,X1),X1)
| ~ defined(X1) ),
c_0_98,
[final] ).
cnf(c_0_126,plain,
( equalish(add(additive_identity,X1),X1)
| ~ defined(X1) ),
c_0_99,
[final] ).
cnf(c_0_127,plain,
( less_or_equal(X1,X2)
| less_or_equal(X2,X1)
| ~ defined(X1)
| ~ defined(X2) ),
c_0_100,
[final] ).
cnf(c_0_128,plain,
( equalish(X2,X1)
| ~ equalish(X1,X2) ),
c_0_101,
[final] ).
cnf(c_0_129,plain,
( equalish(X1,additive_identity)
| defined(multiplicative_inverse(X1))
| ~ defined(X1) ),
c_0_102,
[final] ).
cnf(c_0_130,plain,
( equalish(X1,X1)
| ~ defined(X1) ),
c_0_103,
[final] ).
cnf(c_0_131,plain,
~ equalish(additive_identity,multiplicative_identity),
c_0_104,
[final] ).
cnf(c_0_132,plain,
( defined(additive_inverse(X1))
| ~ defined(X1) ),
c_0_105,
[final] ).
cnf(c_0_133,plain,
defined(multiplicative_identity),
c_0_106,
[final] ).
cnf(c_0_134,plain,
defined(additive_identity),
c_0_107,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_108_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_108]) ).
cnf(c_0_108_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_108]) ).
cnf(c_0_108_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_108]) ).
cnf(c_0_108_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_108]) ).
cnf(c_0_109_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_109]) ).
cnf(c_0_109_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_109]) ).
cnf(c_0_109_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_109]) ).
cnf(c_0_109_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_109]) ).
cnf(c_0_110_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_110]) ).
cnf(c_0_110_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_110]) ).
cnf(c_0_110_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_110]) ).
cnf(c_0_110_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_110]) ).
cnf(c_0_111_0,axiom,
( equalish(multiply(X1,X3),multiply(X2,X3))
| ~ equalish(X1,X2)
| ~ defined(X3) ),
inference(literals_permutation,[status(thm)],[c_0_111]) ).
cnf(c_0_111_1,axiom,
( ~ equalish(X1,X2)
| equalish(multiply(X1,X3),multiply(X2,X3))
| ~ defined(X3) ),
inference(literals_permutation,[status(thm)],[c_0_111]) ).
cnf(c_0_111_2,axiom,
( ~ defined(X3)
| ~ equalish(X1,X2)
| equalish(multiply(X1,X3),multiply(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_111]) ).
cnf(c_0_112_0,axiom,
( equalish(add(X1,X3),add(X2,X3))
| ~ equalish(X1,X2)
| ~ defined(X3) ),
inference(literals_permutation,[status(thm)],[c_0_112]) ).
cnf(c_0_112_1,axiom,
( ~ equalish(X1,X2)
| equalish(add(X1,X3),add(X2,X3))
| ~ defined(X3) ),
inference(literals_permutation,[status(thm)],[c_0_112]) ).
cnf(c_0_112_2,axiom,
( ~ defined(X3)
| ~ equalish(X1,X2)
| equalish(add(X1,X3),add(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_112]) ).
cnf(c_0_113_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_113]) ).
cnf(c_0_113_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_113]) ).
cnf(c_0_113_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_113]) ).
cnf(c_0_114_0,axiom,
( equalish(multiply(X2,X1),multiply(X1,X2))
| ~ defined(X1)
| ~ defined(X2) ),
inference(literals_permutation,[status(thm)],[c_0_114]) ).
cnf(c_0_114_1,axiom,
( ~ defined(X1)
| equalish(multiply(X2,X1),multiply(X1,X2))
| ~ defined(X2) ),
inference(literals_permutation,[status(thm)],[c_0_114]) ).
cnf(c_0_114_2,axiom,
( ~ defined(X2)
| ~ defined(X1)
| equalish(multiply(X2,X1),multiply(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_114]) ).
cnf(c_0_115_0,axiom,
( equalish(add(X2,X1),add(X1,X2))
| ~ defined(X1)
| ~ defined(X2) ),
inference(literals_permutation,[status(thm)],[c_0_115]) ).
cnf(c_0_115_1,axiom,
( ~ defined(X1)
| equalish(add(X2,X1),add(X1,X2))
| ~ defined(X2) ),
inference(literals_permutation,[status(thm)],[c_0_115]) ).
cnf(c_0_115_2,axiom,
( ~ defined(X2)
| ~ defined(X1)
| equalish(add(X2,X1),add(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_115]) ).
cnf(c_0_116_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_116]) ).
cnf(c_0_116_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_116]) ).
cnf(c_0_116_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_116]) ).
cnf(c_0_117_0,axiom,
( equalish(X1,additive_identity)
| equalish(multiply(X1,multiplicative_inverse(X1)),multiplicative_identity)
| ~ defined(X1) ),
inference(literals_permutation,[status(thm)],[c_0_117]) ).
cnf(c_0_117_1,axiom,
( equalish(multiply(X1,multiplicative_inverse(X1)),multiplicative_identity)
| equalish(X1,additive_identity)
| ~ defined(X1) ),
inference(literals_permutation,[status(thm)],[c_0_117]) ).
cnf(c_0_117_2,axiom,
( ~ defined(X1)
| equalish(multiply(X1,multiplicative_inverse(X1)),multiplicative_identity)
| equalish(X1,additive_identity) ),
inference(literals_permutation,[status(thm)],[c_0_117]) ).
cnf(c_0_118_0,axiom,
( less_or_equal(X2,X3)
| ~ equalish(X1,X2)
| ~ less_or_equal(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_118]) ).
cnf(c_0_118_1,axiom,
( ~ equalish(X1,X2)
| less_or_equal(X2,X3)
| ~ less_or_equal(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_118]) ).
cnf(c_0_118_2,axiom,
( ~ less_or_equal(X1,X3)
| ~ equalish(X1,X2)
| less_or_equal(X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_118]) ).
cnf(c_0_119_0,axiom,
( equalish(X3,X2)
| ~ equalish(X1,X2)
| ~ equalish(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_119]) ).
cnf(c_0_119_1,axiom,
( ~ equalish(X1,X2)
| equalish(X3,X2)
| ~ equalish(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_119]) ).
cnf(c_0_119_2,axiom,
( ~ equalish(X3,X1)
| ~ equalish(X1,X2)
| equalish(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_119]) ).
cnf(c_0_120_0,axiom,
( less_or_equal(X3,X2)
| ~ less_or_equal(X1,X2)
| ~ less_or_equal(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_120]) ).
cnf(c_0_120_1,axiom,
( ~ less_or_equal(X1,X2)
| less_or_equal(X3,X2)
| ~ less_or_equal(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_120]) ).
cnf(c_0_120_2,axiom,
( ~ less_or_equal(X3,X1)
| ~ less_or_equal(X1,X2)
| less_or_equal(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_120]) ).
cnf(c_0_121_0,axiom,
( equalish(X2,X1)
| ~ less_or_equal(X1,X2)
| ~ less_or_equal(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_121]) ).
cnf(c_0_121_1,axiom,
( ~ less_or_equal(X1,X2)
| equalish(X2,X1)
| ~ less_or_equal(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_121]) ).
cnf(c_0_121_2,axiom,
( ~ less_or_equal(X2,X1)
| ~ less_or_equal(X1,X2)
| equalish(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_121]) ).
cnf(c_0_122_0,axiom,
( equalish(add(X1,additive_inverse(X1)),additive_identity)
| ~ defined(X1) ),
inference(literals_permutation,[status(thm)],[c_0_122]) ).
cnf(c_0_122_1,axiom,
( ~ defined(X1)
| equalish(add(X1,additive_inverse(X1)),additive_identity) ),
inference(literals_permutation,[status(thm)],[c_0_122]) ).
cnf(c_0_123_0,axiom,
( defined(multiply(X2,X1))
| ~ defined(X1)
| ~ defined(X2) ),
inference(literals_permutation,[status(thm)],[c_0_123]) ).
cnf(c_0_123_1,axiom,
( ~ defined(X1)
| defined(multiply(X2,X1))
| ~ defined(X2) ),
inference(literals_permutation,[status(thm)],[c_0_123]) ).
cnf(c_0_123_2,axiom,
( ~ defined(X2)
| ~ defined(X1)
| defined(multiply(X2,X1)) ),
inference(literals_permutation,[status(thm)],[c_0_123]) ).
cnf(c_0_124_0,axiom,
( defined(add(X2,X1))
| ~ defined(X1)
| ~ defined(X2) ),
inference(literals_permutation,[status(thm)],[c_0_124]) ).
cnf(c_0_124_1,axiom,
( ~ defined(X1)
| defined(add(X2,X1))
| ~ defined(X2) ),
inference(literals_permutation,[status(thm)],[c_0_124]) ).
cnf(c_0_124_2,axiom,
( ~ defined(X2)
| ~ defined(X1)
| defined(add(X2,X1)) ),
inference(literals_permutation,[status(thm)],[c_0_124]) ).
cnf(c_0_125_0,axiom,
( equalish(multiply(multiplicative_identity,X1),X1)
| ~ defined(X1) ),
inference(literals_permutation,[status(thm)],[c_0_125]) ).
cnf(c_0_125_1,axiom,
( ~ defined(X1)
| equalish(multiply(multiplicative_identity,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_125]) ).
cnf(c_0_126_0,axiom,
( equalish(add(additive_identity,X1),X1)
| ~ defined(X1) ),
inference(literals_permutation,[status(thm)],[c_0_126]) ).
cnf(c_0_126_1,axiom,
( ~ defined(X1)
| equalish(add(additive_identity,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_126]) ).
cnf(c_0_127_0,axiom,
( less_or_equal(X1,X2)
| less_or_equal(X2,X1)
| ~ defined(X1)
| ~ defined(X2) ),
inference(literals_permutation,[status(thm)],[c_0_127]) ).
cnf(c_0_127_1,axiom,
( less_or_equal(X2,X1)
| less_or_equal(X1,X2)
| ~ defined(X1)
| ~ defined(X2) ),
inference(literals_permutation,[status(thm)],[c_0_127]) ).
cnf(c_0_127_2,axiom,
( ~ defined(X1)
| less_or_equal(X2,X1)
| less_or_equal(X1,X2)
| ~ defined(X2) ),
inference(literals_permutation,[status(thm)],[c_0_127]) ).
cnf(c_0_127_3,axiom,
( ~ defined(X2)
| ~ defined(X1)
| less_or_equal(X2,X1)
| less_or_equal(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_127]) ).
cnf(c_0_128_0,axiom,
( equalish(X2,X1)
| ~ equalish(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_128]) ).
cnf(c_0_128_1,axiom,
( ~ equalish(X1,X2)
| equalish(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_128]) ).
cnf(c_0_129_0,axiom,
( equalish(X1,additive_identity)
| defined(multiplicative_inverse(X1))
| ~ defined(X1) ),
inference(literals_permutation,[status(thm)],[c_0_129]) ).
cnf(c_0_129_1,axiom,
( defined(multiplicative_inverse(X1))
| equalish(X1,additive_identity)
| ~ defined(X1) ),
inference(literals_permutation,[status(thm)],[c_0_129]) ).
cnf(c_0_129_2,axiom,
( ~ defined(X1)
| defined(multiplicative_inverse(X1))
| equalish(X1,additive_identity) ),
inference(literals_permutation,[status(thm)],[c_0_129]) ).
cnf(c_0_130_0,axiom,
( equalish(X1,X1)
| ~ defined(X1) ),
inference(literals_permutation,[status(thm)],[c_0_130]) ).
cnf(c_0_130_1,axiom,
( ~ defined(X1)
| equalish(X1,X1) ),
inference(literals_permutation,[status(thm)],[c_0_130]) ).
cnf(c_0_132_0,axiom,
( defined(additive_inverse(X1))
| ~ defined(X1) ),
inference(literals_permutation,[status(thm)],[c_0_132]) ).
cnf(c_0_132_1,axiom,
( ~ defined(X1)
| defined(additive_inverse(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_132]) ).
cnf(c_0_131_0,axiom,
~ equalish(additive_identity,multiplicative_identity),
inference(literals_permutation,[status(thm)],[c_0_131]) ).
cnf(c_0_133_0,axiom,
defined(multiplicative_identity),
inference(literals_permutation,[status(thm)],[c_0_133]) ).
cnf(c_0_134_0,axiom,
defined(additive_identity),
inference(literals_permutation,[status(thm)],[c_0_134]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,negated_conjecture,
equalish(add(b,b),v),
file('<stdin>',add_equals_v_6) ).
fof(c_0_1_002,negated_conjecture,
equalish(add(a,a),u),
file('<stdin>',add_equals_u_5) ).
fof(c_0_2_003,negated_conjecture,
~ less_or_equal(u,v),
file('<stdin>',not_less_or_equal_8) ).
fof(c_0_3_004,negated_conjecture,
less_or_equal(a,b),
file('<stdin>',less_or_equal_7) ).
fof(c_0_4_005,hypothesis,
defined(v),
file('<stdin>',v_is_defined) ).
fof(c_0_5_006,hypothesis,
defined(u),
file('<stdin>',u_is_defined) ).
fof(c_0_6_007,hypothesis,
defined(b),
file('<stdin>',b_is_defined) ).
fof(c_0_7_008,hypothesis,
defined(a),
file('<stdin>',a_is_defined) ).
fof(c_0_8_009,negated_conjecture,
equalish(add(b,b),v),
c_0_0 ).
fof(c_0_9_010,negated_conjecture,
equalish(add(a,a),u),
c_0_1 ).
fof(c_0_10_011,negated_conjecture,
~ less_or_equal(u,v),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_11_012,negated_conjecture,
less_or_equal(a,b),
c_0_3 ).
fof(c_0_12_013,hypothesis,
defined(v),
c_0_4 ).
fof(c_0_13_014,hypothesis,
defined(u),
c_0_5 ).
fof(c_0_14_015,hypothesis,
defined(b),
c_0_6 ).
fof(c_0_15_016,hypothesis,
defined(a),
c_0_7 ).
fof(c_0_16_017,negated_conjecture,
equalish(add(b,b),v),
c_0_8 ).
fof(c_0_17_018,negated_conjecture,
equalish(add(a,a),u),
c_0_9 ).
fof(c_0_18_019,negated_conjecture,
~ less_or_equal(u,v),
c_0_10 ).
fof(c_0_19_020,negated_conjecture,
less_or_equal(a,b),
c_0_11 ).
fof(c_0_20_021,hypothesis,
defined(v),
c_0_12 ).
fof(c_0_21_022,hypothesis,
defined(u),
c_0_13 ).
fof(c_0_22_023,hypothesis,
defined(b),
c_0_14 ).
fof(c_0_23_024,hypothesis,
defined(a),
c_0_15 ).
cnf(c_0_24_025,negated_conjecture,
equalish(add(b,b),v),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_25_026,negated_conjecture,
equalish(add(a,a),u),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_26_027,negated_conjecture,
~ less_or_equal(u,v),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_27_028,negated_conjecture,
less_or_equal(a,b),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_28_029,hypothesis,
defined(v),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_29_030,hypothesis,
defined(u),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_30_031,hypothesis,
defined(b),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_31_032,hypothesis,
defined(a),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_32_033,negated_conjecture,
equalish(add(b,b),v),
c_0_24,
[final] ).
cnf(c_0_33_034,negated_conjecture,
equalish(add(a,a),u),
c_0_25,
[final] ).
cnf(c_0_34_035,negated_conjecture,
~ less_or_equal(u,v),
c_0_26,
[final] ).
cnf(c_0_35_036,negated_conjecture,
less_or_equal(a,b),
c_0_27,
[final] ).
cnf(c_0_36_037,hypothesis,
defined(v),
c_0_28,
[final] ).
cnf(c_0_37_038,hypothesis,
defined(u),
c_0_29,
[final] ).
cnf(c_0_38_039,hypothesis,
defined(b),
c_0_30,
[final] ).
cnf(c_0_39_040,hypothesis,
defined(a),
c_0_31,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_33,plain,
( ~ less_or_equal(X0,X1)
| ~ less_or_equal(X1,X2)
| less_or_equal(X0,X2) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_85bdd4.p',c_0_120_0) ).
cnf(c_174648,plain,
( ~ less_or_equal(X0,X1)
| ~ less_or_equal(X1,X2)
| less_or_equal(X0,X2) ),
inference(copy,[status(esa)],[c_33]) ).
cnf(c_174718,plain,
( ~ less_or_equal(X0,v)
| less_or_equal(X1,v)
| ~ less_or_equal(X1,X0) ),
inference(instantiation,[status(thm)],[c_174648]) ).
cnf(c_175658,plain,
( ~ less_or_equal(add(b,b),v)
| ~ less_or_equal(X0,add(b,b))
| less_or_equal(X0,v) ),
inference(instantiation,[status(thm)],[c_174718]) ).
cnf(c_223882,plain,
( ~ less_or_equal(add(b,b),v)
| ~ less_or_equal(add(b,a),add(b,b))
| less_or_equal(add(b,a),v) ),
inference(instantiation,[status(thm)],[c_175658]) ).
cnf(c_37,plain,
( less_or_equal(X0,X1)
| ~ equalish(X2,X0)
| ~ less_or_equal(X2,X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_85bdd4.p',c_0_118_2) ).
cnf(c_174652,plain,
( less_or_equal(X0,X1)
| ~ equalish(X2,X0)
| ~ less_or_equal(X2,X1) ),
inference(copy,[status(esa)],[c_37]) ).
cnf(c_186106,plain,
( ~ equalish(X0,X1)
| less_or_equal(X1,add(b,b))
| ~ less_or_equal(X0,add(b,b)) ),
inference(instantiation,[status(thm)],[c_174652]) ).
cnf(c_187407,plain,
( ~ equalish(add(X0,b),X1)
| ~ less_or_equal(add(X0,b),add(b,b))
| less_or_equal(X1,add(b,b)) ),
inference(instantiation,[status(thm)],[c_186106]) ).
cnf(c_210063,plain,
( ~ equalish(add(a,b),X0)
| ~ less_or_equal(add(a,b),add(b,b))
| less_or_equal(X0,add(b,b)) ),
inference(instantiation,[status(thm)],[c_187407]) ).
cnf(c_210356,plain,
( ~ equalish(add(a,b),add(b,a))
| less_or_equal(add(b,a),add(b,b))
| ~ less_or_equal(add(a,b),add(b,b)) ),
inference(instantiation,[status(thm)],[c_210063]) ).
cnf(c_52,plain,
( less_or_equal(add(X0,X1),add(X2,X1))
| ~ less_or_equal(X0,X2)
| ~ defined(X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_85bdd4.p',c_0_113_2) ).
cnf(c_174667,plain,
( less_or_equal(add(X0,X1),add(X2,X1))
| ~ less_or_equal(X0,X2)
| ~ defined(X1) ),
inference(copy,[status(esa)],[c_52]) ).
cnf(c_186117,plain,
( ~ defined(b)
| less_or_equal(add(X0,b),add(b,b))
| ~ less_or_equal(X0,b) ),
inference(instantiation,[status(thm)],[c_174667]) ).
cnf(c_187309,plain,
( ~ defined(b)
| less_or_equal(add(a,b),add(b,b))
| ~ less_or_equal(a,b) ),
inference(instantiation,[status(thm)],[c_186117]) ).
cnf(c_182,plain,
( less_or_equal(X0,X1)
| ~ equalish(X2,X0)
| ~ less_or_equal(X2,X1) ),
inference(copy,[status(esa)],[c_37]) ).
cnf(c_19361,plain,
( ~ equalish(X0,X1)
| less_or_equal(X1,v)
| ~ less_or_equal(X0,v) ),
inference(instantiation,[status(thm)],[c_182]) ).
cnf(c_20036,plain,
( ~ equalish(v,X0)
| ~ less_or_equal(v,v)
| less_or_equal(X0,v) ),
inference(instantiation,[status(thm)],[c_19361]) ).
cnf(c_164743,plain,
( ~ equalish(v,add(b,b))
| less_or_equal(add(b,b),v)
| ~ less_or_equal(v,v) ),
inference(instantiation,[status(thm)],[c_20036]) ).
cnf(c_10,plain,
( equalish(X0,X1)
| ~ equalish(X1,X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_85bdd4.p',c_0_128_1) ).
cnf(c_155,plain,
( equalish(X0,X1)
| ~ equalish(X1,X0) ),
inference(copy,[status(esa)],[c_10]) ).
cnf(c_90234,plain,
( ~ equalish(add(b,b),X0)
| equalish(X0,add(b,b)) ),
inference(instantiation,[status(thm)],[c_155]) ).
cnf(c_145301,plain,
( ~ equalish(add(b,b),v)
| equalish(v,add(b,b)) ),
inference(instantiation,[status(thm)],[c_90234]) ).
cnf(c_48,plain,
( ~ defined(X0)
| ~ defined(X1)
| equalish(add(X0,X1),add(X1,X0)) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_85bdd4.p',c_0_115_0) ).
cnf(c_193,plain,
( ~ defined(X0)
| ~ defined(X1)
| equalish(add(X0,X1),add(X1,X0)) ),
inference(copy,[status(esa)],[c_48]) ).
cnf(c_39828,plain,
( ~ defined(a)
| ~ defined(X0)
| equalish(add(a,X0),add(X0,a)) ),
inference(instantiation,[status(thm)],[c_193]) ).
cnf(c_144948,plain,
( ~ defined(b)
| ~ defined(a)
| equalish(add(a,b),add(b,a)) ),
inference(instantiation,[status(thm)],[c_39828]) ).
cnf(c_31,plain,
( less_or_equal(X0,X1)
| ~ less_or_equal(X2,X1)
| ~ less_or_equal(X0,X2) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_85bdd4.p',c_0_120_2) ).
cnf(c_176,plain,
( less_or_equal(X0,X1)
| ~ less_or_equal(X2,X1)
| ~ less_or_equal(X0,X2) ),
inference(copy,[status(esa)],[c_31]) ).
cnf(c_19615,plain,
( less_or_equal(add(a,a),X0)
| ~ less_or_equal(add(a,a),X1)
| ~ less_or_equal(X1,X0) ),
inference(instantiation,[status(thm)],[c_176]) ).
cnf(c_39798,plain,
( ~ less_or_equal(add(b,a),X0)
| ~ less_or_equal(add(a,a),add(b,a))
| less_or_equal(add(a,a),X0) ),
inference(instantiation,[status(thm)],[c_19615]) ).
cnf(c_40102,plain,
( ~ less_or_equal(add(b,a),v)
| ~ less_or_equal(add(a,a),add(b,a))
| less_or_equal(add(a,a),v) ),
inference(instantiation,[status(thm)],[c_39798]) ).
cnf(c_15,plain,
( ~ defined(X0)
| ~ defined(X1)
| less_or_equal(X0,X1)
| less_or_equal(X1,X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_85bdd4.p',c_0_127_0) ).
cnf(c_160,plain,
( ~ defined(X0)
| ~ defined(X1)
| less_or_equal(X0,X1)
| less_or_equal(X1,X0) ),
inference(copy,[status(esa)],[c_15]) ).
cnf(c_19363,plain,
( ~ defined(v)
| ~ defined(X0)
| less_or_equal(v,X0)
| less_or_equal(X0,v) ),
inference(instantiation,[status(thm)],[c_160]) ).
cnf(c_19981,plain,
( ~ defined(v)
| less_or_equal(v,v) ),
inference(instantiation,[status(thm)],[c_19363]) ).
cnf(c_197,plain,
( less_or_equal(add(X0,X1),add(X2,X1))
| ~ less_or_equal(X0,X2)
| ~ defined(X1) ),
inference(copy,[status(esa)],[c_52]) ).
cnf(c_19627,plain,
( ~ defined(a)
| less_or_equal(add(a,a),add(X0,a))
| ~ less_or_equal(a,X0) ),
inference(instantiation,[status(thm)],[c_197]) ).
cnf(c_19970,plain,
( ~ defined(a)
| less_or_equal(add(a,a),add(b,a))
| ~ less_or_equal(a,b) ),
inference(instantiation,[status(thm)],[c_19627]) ).
cnf(c_19221,plain,
( ~ equalish(X0,u)
| less_or_equal(u,v)
| ~ less_or_equal(X0,v) ),
inference(instantiation,[status(thm)],[c_182]) ).
cnf(c_19256,plain,
( ~ equalish(add(a,a),u)
| ~ less_or_equal(add(a,a),v)
| less_or_equal(u,v) ),
inference(instantiation,[status(thm)],[c_19221]) ).
cnf(c_77,plain,
defined(v),
file('/export/starexec/sandbox2/tmp/iprover_modulo_85bdd4.p',c_0_36) ).
cnf(c_79,plain,
defined(b),
file('/export/starexec/sandbox2/tmp/iprover_modulo_85bdd4.p',c_0_38) ).
cnf(c_80,plain,
defined(a),
file('/export/starexec/sandbox2/tmp/iprover_modulo_85bdd4.p',c_0_39) ).
cnf(c_73,negated_conjecture,
~ less_or_equal(u,v),
file('/export/starexec/sandbox2/tmp/iprover_modulo_85bdd4.p',c_0_34) ).
cnf(c_74,negated_conjecture,
equalish(add(b,b),v),
file('/export/starexec/sandbox2/tmp/iprover_modulo_85bdd4.p',c_0_32) ).
cnf(c_75,negated_conjecture,
equalish(add(a,a),u),
file('/export/starexec/sandbox2/tmp/iprover_modulo_85bdd4.p',c_0_33) ).
cnf(c_76,negated_conjecture,
less_or_equal(a,b),
file('/export/starexec/sandbox2/tmp/iprover_modulo_85bdd4.p',c_0_35) ).
cnf(contradiction,plain,
$false,
inference(minisat,[status(thm)],[c_223882,c_210356,c_187309,c_164743,c_145301,c_144948,c_40102,c_19981,c_19970,c_19256,c_77,c_79,c_80,c_73,c_74,c_75,c_76]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : FLD060-2 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.07/0.13 % Command : iprover_modulo %s %d
% 0.12/0.33 % Computer : n023.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jun 7 01:15:24 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.34 % Running in mono-core mode
% 0.19/0.40 % Orienting using strategy Equiv(ClausalAll)
% 0.19/0.40 % Orientation found
% 0.19/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_8850d6.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_85bdd4.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_64bf44 | grep -v "SZS"
% 0.19/0.42
% 0.19/0.42 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.19/0.42
% 0.19/0.42 %
% 0.19/0.42 % ------ iProver source info
% 0.19/0.42
% 0.19/0.42 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.19/0.42 % git: non_committed_changes: true
% 0.19/0.42 % git: last_make_outside_of_git: true
% 0.19/0.42
% 0.19/0.42 %
% 0.19/0.42 % ------ Input Options
% 0.19/0.42
% 0.19/0.42 % --out_options all
% 0.19/0.42 % --tptp_safe_out true
% 0.19/0.42 % --problem_path ""
% 0.19/0.42 % --include_path ""
% 0.19/0.42 % --clausifier .//eprover
% 0.19/0.42 % --clausifier_options --tstp-format
% 0.19/0.42 % --stdin false
% 0.19/0.42 % --dbg_backtrace false
% 0.19/0.42 % --dbg_dump_prop_clauses false
% 0.19/0.42 % --dbg_dump_prop_clauses_file -
% 0.19/0.42 % --dbg_out_stat false
% 0.19/0.42
% 0.19/0.42 % ------ General Options
% 0.19/0.42
% 0.19/0.42 % --fof false
% 0.19/0.42 % --time_out_real 150.
% 0.19/0.42 % --time_out_prep_mult 0.2
% 0.19/0.42 % --time_out_virtual -1.
% 0.19/0.42 % --schedule none
% 0.19/0.42 % --ground_splitting input
% 0.19/0.42 % --splitting_nvd 16
% 0.19/0.42 % --non_eq_to_eq false
% 0.19/0.42 % --prep_gs_sim true
% 0.19/0.42 % --prep_unflatten false
% 0.19/0.42 % --prep_res_sim true
% 0.19/0.42 % --prep_upred true
% 0.19/0.42 % --res_sim_input true
% 0.19/0.42 % --clause_weak_htbl true
% 0.19/0.42 % --gc_record_bc_elim false
% 0.19/0.42 % --symbol_type_check false
% 0.19/0.42 % --clausify_out false
% 0.19/0.42 % --large_theory_mode false
% 0.19/0.42 % --prep_sem_filter none
% 0.19/0.42 % --prep_sem_filter_out false
% 0.19/0.42 % --preprocessed_out false
% 0.19/0.42 % --sub_typing false
% 0.19/0.42 % --brand_transform false
% 0.19/0.42 % --pure_diseq_elim true
% 0.19/0.42 % --min_unsat_core false
% 0.19/0.42 % --pred_elim true
% 0.19/0.42 % --add_important_lit false
% 0.19/0.42 % --soft_assumptions false
% 0.19/0.42 % --reset_solvers false
% 0.19/0.42 % --bc_imp_inh []
% 0.19/0.42 % --conj_cone_tolerance 1.5
% 0.19/0.42 % --prolific_symb_bound 500
% 0.19/0.42 % --lt_threshold 2000
% 0.19/0.42
% 0.19/0.42 % ------ SAT Options
% 0.19/0.42
% 0.19/0.42 % --sat_mode false
% 0.19/0.42 % --sat_fm_restart_options ""
% 0.19/0.42 % --sat_gr_def false
% 0.19/0.42 % --sat_epr_types true
% 0.19/0.42 % --sat_non_cyclic_types false
% 0.19/0.42 % --sat_finite_models false
% 0.19/0.42 % --sat_fm_lemmas false
% 0.19/0.42 % --sat_fm_prep false
% 0.19/0.42 % --sat_fm_uc_incr true
% 0.19/0.42 % --sat_out_model small
% 0.19/0.42 % --sat_out_clauses false
% 0.19/0.42
% 0.19/0.42 % ------ QBF Options
% 0.19/0.42
% 0.19/0.42 % --qbf_mode false
% 0.19/0.42 % --qbf_elim_univ true
% 0.19/0.42 % --qbf_sk_in true
% 0.19/0.42 % --qbf_pred_elim true
% 0.19/0.42 % --qbf_split 32
% 0.19/0.42
% 0.19/0.42 % ------ BMC1 Options
% 0.19/0.42
% 0.19/0.42 % --bmc1_incremental false
% 0.19/0.42 % --bmc1_axioms reachable_all
% 0.19/0.42 % --bmc1_min_bound 0
% 0.19/0.42 % --bmc1_max_bound -1
% 0.19/0.42 % --bmc1_max_bound_default -1
% 0.19/0.42 % --bmc1_symbol_reachability true
% 0.19/0.42 % --bmc1_property_lemmas false
% 0.19/0.42 % --bmc1_k_induction false
% 0.19/0.42 % --bmc1_non_equiv_states false
% 0.19/0.42 % --bmc1_deadlock false
% 0.19/0.42 % --bmc1_ucm false
% 0.19/0.42 % --bmc1_add_unsat_core none
% 0.19/0.42 % --bmc1_unsat_core_children false
% 0.19/0.42 % --bmc1_unsat_core_extrapolate_axioms false
% 0.19/0.42 % --bmc1_out_stat full
% 0.19/0.42 % --bmc1_ground_init false
% 0.19/0.42 % --bmc1_pre_inst_next_state false
% 0.19/0.42 % --bmc1_pre_inst_state false
% 0.19/0.42 % --bmc1_pre_inst_reach_state false
% 0.19/0.42 % --bmc1_out_unsat_core false
% 0.19/0.42 % --bmc1_aig_witness_out false
% 0.19/0.42 % --bmc1_verbose false
% 0.19/0.42 % --bmc1_dump_clauses_tptp false
% 0.19/0.43 % --bmc1_dump_unsat_core_tptp false
% 0.19/0.43 % --bmc1_dump_file -
% 0.19/0.43 % --bmc1_ucm_expand_uc_limit 128
% 0.19/0.43 % --bmc1_ucm_n_expand_iterations 6
% 0.19/0.43 % --bmc1_ucm_extend_mode 1
% 0.19/0.43 % --bmc1_ucm_init_mode 2
% 0.19/0.43 % --bmc1_ucm_cone_mode none
% 0.19/0.43 % --bmc1_ucm_reduced_relation_type 0
% 0.19/0.43 % --bmc1_ucm_relax_model 4
% 0.19/0.43 % --bmc1_ucm_full_tr_after_sat true
% 0.19/0.43 % --bmc1_ucm_expand_neg_assumptions false
% 0.19/0.43 % --bmc1_ucm_layered_model none
% 0.19/0.43 % --bmc1_ucm_max_lemma_size 10
% 0.19/0.43
% 0.19/0.43 % ------ AIG Options
% 0.19/0.43
% 0.19/0.43 % --aig_mode false
% 0.19/0.43
% 0.19/0.43 % ------ Instantiation Options
% 0.19/0.43
% 0.19/0.43 % --instantiation_flag true
% 0.19/0.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.19/0.43 % --inst_solver_per_active 750
% 0.19/0.43 % --inst_solver_calls_frac 0.5
% 0.19/0.43 % --inst_passive_queue_type priority_queues
% 0.19/0.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.19/0.43 % --inst_passive_queues_freq [25;2]
% 0.19/0.43 % --inst_dismatching true
% 0.19/0.43 % --inst_eager_unprocessed_to_passive true
% 0.19/0.43 % --inst_prop_sim_given true
% 0.19/0.43 % --inst_prop_sim_new false
% 0.19/0.43 % --inst_orphan_elimination true
% 0.19/0.43 % --inst_learning_loop_flag true
% 0.19/0.43 % --inst_learning_start 3000
% 0.19/0.43 % --inst_learning_factor 2
% 0.19/0.43 % --inst_start_prop_sim_after_learn 3
% 0.19/0.43 % --inst_sel_renew solver
% 0.19/0.43 % --inst_lit_activity_flag true
% 0.19/0.43 % --inst_out_proof true
% 0.19/0.43
% 0.19/0.43 % ------ Resolution Options
% 0.19/0.43
% 0.19/0.43 % --resolution_flag true
% 0.19/0.43 % --res_lit_sel kbo_max
% 0.19/0.43 % --res_to_prop_solver none
% 0.19/0.43 % --res_prop_simpl_new false
% 0.19/0.43 % --res_prop_simpl_given false
% 0.19/0.43 % --res_passive_queue_type priority_queues
% 0.19/0.43 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.19/0.43 % --res_passive_queues_freq [15;5]
% 0.19/0.43 % --res_forward_subs full
% 0.19/0.43 % --res_backward_subs full
% 0.19/0.43 % --res_forward_subs_resolution true
% 0.19/0.43 % --res_backward_subs_resolution true
% 0.19/0.43 % --res_orphan_elimination false
% 0.19/0.43 % --res_time_limit 1000.
% 0.19/0.43 % --res_out_proof true
% 0.19/0.43 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_8850d6.s
% 0.19/0.43 % --modulo true
% 0.19/0.43
% 0.19/0.43 % ------ Combination Options
% 0.19/0.43
% 0.19/0.43 % --comb_res_mult 1000
% 0.19/0.43 % --comb_inst_mult 300
% 0.19/0.43 % ------
% 0.19/0.43
% 0.19/0.43 % ------ Parsing...% successful
% 0.19/0.43
% 0.19/0.43 % ------ 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.19/0.43
% 0.19/0.43 % ------ Proving...
% 0.19/0.43 % ------ Problem Properties
% 0.19/0.43
% 0.19/0.43 %
% 0.19/0.43 % EPR false
% 0.19/0.43 % Horn false
% 0.19/0.43 % Has equality false
% 0.19/0.43
% 0.19/0.43 % % ------ Input Options Time Limit: Unbounded
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43 % % ------ Current options:
% 0.19/0.43
% 0.19/0.43 % ------ Input Options
% 0.19/0.43
% 0.19/0.43 % --out_options all
% 0.19/0.43 % --tptp_safe_out true
% 0.19/0.43 % --problem_path ""
% 0.19/0.43 % --include_path ""
% 0.19/0.43 % --clausifier .//eprover
% 0.19/0.43 % --clausifier_options --tstp-format
% 0.19/0.43 % --stdin false
% 0.19/0.43 % --dbg_backtrace false
% 0.19/0.43 % --dbg_dump_prop_clauses false
% 0.19/0.43 % --dbg_dump_prop_clauses_file -
% 0.19/0.43 % --dbg_out_stat false
% 0.19/0.43
% 0.19/0.43 % ------ General Options
% 0.19/0.43
% 0.19/0.43 % --fof false
% 0.19/0.43 % --time_out_real 150.
% 0.19/0.43 % --time_out_prep_mult 0.2
% 0.19/0.43 % --time_out_virtual -1.
% 0.19/0.43 % --schedule none
% 0.19/0.43 % --ground_splitting input
% 0.19/0.43 % --splitting_nvd 16
% 0.19/0.43 % --non_eq_to_eq false
% 0.19/0.43 % --prep_gs_sim true
% 0.19/0.43 % --prep_unflatten false
% 0.19/0.43 % --prep_res_sim true
% 0.19/0.43 % --prep_upred true
% 0.19/0.43 % --res_sim_input true
% 0.19/0.43 % --clause_weak_htbl true
% 0.19/0.43 % --gc_record_bc_elim false
% 0.19/0.43 % --symbol_type_check false
% 0.19/0.43 % --clausify_out false
% 0.19/0.43 % --large_theory_mode false
% 0.19/0.43 % --prep_sem_filter none
% 0.19/0.43 % --prep_sem_filter_out false
% 0.19/0.43 % --preprocessed_out false
% 0.19/0.43 % --sub_typing false
% 0.19/0.43 % --brand_transform false
% 0.19/0.43 % --pure_diseq_elim true
% 0.19/0.43 % --min_unsat_core false
% 0.19/0.43 % --pred_elim true
% 0.19/0.43 % --add_important_lit false
% 0.19/0.43 % --soft_assumptions false
% 0.19/0.43 % --reset_solvers false
% 0.19/0.43 % --bc_imp_inh []
% 0.19/0.43 % --conj_cone_tolerance 1.5
% 0.19/0.43 % --prolific_symb_bound 500
% 0.19/0.43 % --lt_threshold 2000
% 0.19/0.43
% 0.19/0.43 % ------ SAT Options
% 0.19/0.43
% 0.19/0.43 % --sat_mode false
% 0.19/0.43 % --sat_fm_restart_options ""
% 0.19/0.43 % --sat_gr_def false
% 0.19/0.43 % --sat_epr_types true
% 0.19/0.43 % --sat_non_cyclic_types false
% 0.19/0.43 % --sat_finite_models false
% 0.19/0.43 % --sat_fm_lemmas false
% 0.19/0.43 % --sat_fm_prep false
% 0.19/0.43 % --sat_fm_uc_incr true
% 0.19/0.43 % --sat_out_model small
% 0.19/0.43 % --sat_out_clauses false
% 0.19/0.43
% 0.19/0.43 % ------ QBF Options
% 0.19/0.43
% 0.19/0.43 % --qbf_mode false
% 0.19/0.43 % --qbf_elim_univ true
% 0.19/0.43 % --qbf_sk_in true
% 0.19/0.43 % --qbf_pred_elim true
% 0.19/0.43 % --qbf_split 32
% 0.19/0.43
% 0.19/0.43 % ------ BMC1 Options
% 0.19/0.43
% 0.19/0.43 % --bmc1_incremental false
% 0.19/0.43 % --bmc1_axioms reachable_all
% 0.19/0.43 % --bmc1_min_bound 0
% 0.19/0.43 % --bmc1_max_bound -1
% 0.19/0.43 % --bmc1_max_bound_default -1
% 0.19/0.43 % --bmc1_symbol_reachability true
% 0.19/0.43 % --bmc1_property_lemmas false
% 0.19/0.43 % --bmc1_k_induction false
% 0.19/0.43 % --bmc1_non_equiv_states false
% 0.19/0.43 % --bmc1_deadlock false
% 0.19/0.43 % --bmc1_ucm false
% 0.19/0.43 % --bmc1_add_unsat_core none
% 0.19/0.43 % --bmc1_unsat_core_children false
% 0.19/0.43 % --bmc1_unsat_core_extrapolate_axioms false
% 0.19/0.43 % --bmc1_out_stat full
% 0.19/0.43 % --bmc1_ground_init false
% 0.19/0.43 % --bmc1_pre_inst_next_state false
% 0.19/0.43 % --bmc1_pre_inst_state false
% 0.19/0.43 % --bmc1_pre_inst_reach_state false
% 0.19/0.43 % --bmc1_out_unsat_core false
% 0.19/0.43 % --bmc1_aig_witness_out false
% 0.19/0.43 % --bmc1_verbose false
% 0.19/0.43 % --bmc1_dump_clauses_tptp false
% 0.19/0.43 % --bmc1_dump_unsat_core_tptp false
% 0.19/0.43 % --bmc1_dump_file -
% 0.19/0.43 % --bmc1_ucm_expand_uc_limit 128
% 0.19/0.43 % --bmc1_ucm_n_expand_iterations 6
% 0.19/0.43 % --bmc1_ucm_extend_mode 1
% 0.19/0.43 % --bmc1_ucm_init_mode 2
% 0.19/0.43 % --bmc1_ucm_cone_mode none
% 0.19/0.43 % --bmc1_ucm_reduced_relation_type 0
% 0.19/0.43 % --bmc1_ucm_relax_model 4
% 0.19/0.43 % --bmc1_ucm_full_tr_after_sat true
% 0.19/0.43 % --bmc1_ucm_expand_neg_assumptions false
% 0.19/0.43 % --bmc1_ucm_layered_model none
% 0.19/0.43 % --bmc1_ucm_max_lemma_size 10
% 0.19/0.43
% 0.19/0.43 % ------ AIG Options
% 0.19/0.43
% 0.19/0.43 % --aig_mode false
% 0.19/0.43
% 0.19/0.43 % ------ Instantiation Options
% 0.19/0.43
% 0.19/0.43 % --instantiation_flag true
% 0.19/0.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.19/0.43 % --inst_solver_per_active 750
% 0.19/0.43 % --inst_solver_calls_frac 0.5
% 0.19/0.43 % --inst_passive_queue_type priority_queues
% 0.19/0.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.19/0.43 % --inst_passive_queues_freq [25;2]
% 0.19/0.43 % --inst_dismatching true
% 0.19/0.43 % --inst_eager_unprocessed_to_passive true
% 0.19/0.43 % --inst_prop_sim_given true
% 150.24/150.42 % --inst_prop_sim_new false
% 150.24/150.42 % --inst_orphan_elimination true
% 150.24/150.42 % --inst_learning_loop_flag true
% 150.24/150.42 % --inst_learning_start 3000
% 150.24/150.42 % --inst_learning_factor 2
% 150.24/150.42 % --inst_start_prop_sim_after_learn 3
% 150.24/150.42 % --inst_sel_renew solver
% 150.24/150.42 % --inst_lit_activity_flag true
% 150.24/150.42 % --inst_out_proof true
% 150.24/150.42
% 150.24/150.42 % ------ Resolution Options
% 150.24/150.42
% 150.24/150.42 % --resolution_flag true
% 150.24/150.42 % --res_lit_sel kbo_max
% 150.24/150.42 % --res_to_prop_solver none
% 150.24/150.42 % --res_prop_simpl_new false
% 150.24/150.42 % --res_prop_simpl_given false
% 150.24/150.42 % --res_passive_queue_type priority_queues
% 150.24/150.42 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 150.24/150.42 % --res_passive_queues_freq [15;5]
% 150.24/150.42 % --res_forward_subs full
% 150.24/150.42 % --res_backward_subs full
% 150.24/150.42 % --res_forward_subs_resolution true
% 150.24/150.42 % --res_backward_subs_resolution true
% 150.24/150.42 % --res_orphan_elimination false
% 150.24/150.42 % --res_time_limit 1000.
% 150.24/150.42 % --res_out_proof true
% 150.24/150.42 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_8850d6.s
% 150.24/150.42 % --modulo true
% 150.24/150.42
% 150.24/150.42 % ------ Combination Options
% 150.24/150.42
% 150.24/150.42 % --comb_res_mult 1000
% 150.24/150.42 % --comb_inst_mult 300
% 150.24/150.42 % ------
% 150.24/150.42
% 150.24/150.42
% 150.24/150.42
% 150.24/150.42 % ------ Proving...
% 150.24/150.42 %
% 150.24/150.42
% 150.24/150.42
% 150.24/150.42 % Time Out Real
% 150.24/150.42
% 150.24/150.42 % ------ Statistics
% 150.24/150.42
% 150.24/150.42 % ------ General
% 150.24/150.42
% 150.24/150.42 % num_of_input_clauses: 81
% 150.24/150.42 % num_of_input_neg_conjectures: 4
% 150.24/150.42 % num_of_splits: 0
% 150.24/150.42 % num_of_split_atoms: 0
% 150.24/150.42 % num_of_sem_filtered_clauses: 0
% 150.24/150.42 % num_of_subtypes: 0
% 150.24/150.42 % monotx_restored_types: 0
% 150.24/150.42 % sat_num_of_epr_types: 0
% 150.24/150.42 % sat_num_of_non_cyclic_types: 0
% 150.24/150.42 % sat_guarded_non_collapsed_types: 0
% 150.24/150.42 % is_epr: 0
% 150.24/150.42 % is_horn: 0
% 150.24/150.42 % has_eq: 0
% 150.24/150.42 % num_pure_diseq_elim: 0
% 150.24/150.42 % simp_replaced_by: 0
% 150.24/150.42 % res_preprocessed: 12
% 150.24/150.42 % prep_upred: 0
% 150.24/150.42 % prep_unflattend: 0
% 150.24/150.42 % pred_elim_cands: 1
% 150.24/150.42 % pred_elim: 1
% 150.24/150.42 % pred_elim_cl: 4
% 150.24/150.42 % pred_elim_cycles: 2
% 150.24/150.42 % forced_gc_time: 0
% 150.24/150.42 % gc_basic_clause_elim: 0
% 150.24/150.42 % parsing_time: 0.003
% 150.24/150.42 % sem_filter_time: 0.
% 150.24/150.42 % pred_elim_time: 0.
% 150.24/150.42 % out_proof_time: 0.
% 150.24/150.42 % monotx_time: 0.
% 150.24/150.42 % subtype_inf_time: 0.
% 150.24/150.42 % unif_index_cands_time: 0.422
% 150.24/150.42 % unif_index_add_time: 0.046
% 150.24/150.42 % total_time: 150.016
% 150.24/150.42 % num_of_symbols: 38
% 150.24/150.42 % num_of_terms: 89565
% 150.24/150.42
% 150.24/150.42 % ------ Propositional Solver
% 150.24/150.42
% 150.24/150.42 % prop_solver_calls: 25
% 150.24/150.42 % prop_fast_solver_calls: 20
% 150.24/150.42 % prop_num_of_clauses: 10391
% 150.24/150.42 % prop_preprocess_simplified: 14607
% 150.24/150.42 % prop_fo_subsumed: 0
% 150.24/150.42 % prop_solver_time: 0.002
% 150.24/150.42 % prop_fast_solver_time: 0.
% 150.24/150.42 % prop_unsat_core_time: 0.
% 150.24/150.42
% 150.24/150.42 % ------ QBF
% 150.24/150.42
% 150.24/150.42 % qbf_q_res: 0
% 150.24/150.42 % qbf_num_tautologies: 0
% 150.24/150.42 % qbf_prep_cycles: 0
% 150.24/150.42
% 150.24/150.42 % ------ BMC1
% 150.24/150.42
% 150.24/150.42 % bmc1_current_bound: -1
% 150.24/150.42 % bmc1_last_solved_bound: -1
% 150.24/150.42 % bmc1_unsat_core_size: -1
% 150.24/150.42 % bmc1_unsat_core_parents_size: -1
% 150.24/150.42 % bmc1_merge_next_fun: 0
% 150.24/150.42 % bmc1_unsat_core_clauses_time: 0.
% 150.24/150.42
% 150.24/150.42 % ------ Instantiation
% 150.24/150.42
% 150.24/150.42 % inst_num_of_clauses: 4804
% 150.24/150.42 % inst_num_in_passive: 1297
% 150.24/150.42 % inst_num_in_active: 1942
% 150.24/150.42 % inst_num_in_unprocessed: 1463
% 150.24/150.42 % inst_num_of_loops: 2399
% 150.24/150.44 % inst_num_of_learning_restarts: 1
% 150.24/150.44 % inst_num_moves_active_passive: 352
% 150.24/150.44 % inst_lit_activity: 619
% 150.24/150.44 % inst_lit_activity_moves: 0
% 150.24/150.44 % inst_num_tautologies: 102
% 150.24/150.44 % inst_num_prop_implied: 0
% 150.24/150.44 % inst_num_existing_simplified: 0
% 150.24/150.44 % inst_num_eq_res_simplified: 0
% 150.24/150.44 % inst_num_child_elim: 0
% 150.24/150.44 % inst_num_of_dismatching_blockings: 3001
% 150.24/150.44 % inst_num_of_non_proper_insts: 11699
% 150.24/150.44 % inst_num_of_duplicates: 6402
% 150.24/150.44 % inst_inst_num_from_inst_to_res: 0
% 150.24/150.44 % inst_dismatching_checking_time: 0.039
% 150.24/150.44
% 150.24/150.44 % ------ Resolution
% 150.24/150.44
% 150.24/150.44 % res_num_of_clauses: 2006396
% 150.24/150.44 % res_num_in_passive: 1999022
% 150.24/150.44 % res_num_in_active: 9158
% 150.24/150.44 % res_num_of_loops: 18936
% 150.24/150.44 % res_forward_subset_subsumed: 454896
% 150.24/150.44 % res_backward_subset_subsumed: 2225
% 150.24/150.44 % res_forward_subsumed: 8361
% 150.24/150.44 % res_backward_subsumed: 200
% 150.24/150.44 % res_forward_subsumption_resolution: 2801
% 150.24/150.44 % res_backward_subsumption_resolution: 11
% 150.24/150.44 % res_clause_to_clause_subsumption: 3563173
% 150.24/150.44 % res_orphan_elimination: 0
% 150.24/150.44 % res_tautology_del: 51179
% 150.24/150.44 % res_num_eq_res_simplified: 0
% 150.24/150.44 % res_num_sel_changes: 0
% 150.24/150.44 % res_moves_from_active_to_pass: 0
% 150.24/150.44
% 150.24/150.44 % Status Unknown
% 150.24/150.49 % Orienting using strategy ClausalAll
% 150.24/150.49 % Orientation found
% 150.24/150.49 % 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_8850d6.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_85bdd4.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_f7062c | grep -v "SZS"
% 150.34/150.50
% 150.34/150.50 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 150.34/150.50
% 150.34/150.50 %
% 150.34/150.50 % ------ iProver source info
% 150.34/150.50
% 150.34/150.50 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 150.34/150.50 % git: non_committed_changes: true
% 150.34/150.50 % git: last_make_outside_of_git: true
% 150.34/150.50
% 150.34/150.50 %
% 150.34/150.50 % ------ Input Options
% 150.34/150.50
% 150.34/150.50 % --out_options all
% 150.34/150.50 % --tptp_safe_out true
% 150.34/150.50 % --problem_path ""
% 150.34/150.50 % --include_path ""
% 150.34/150.50 % --clausifier .//eprover
% 150.34/150.50 % --clausifier_options --tstp-format
% 150.34/150.50 % --stdin false
% 150.34/150.50 % --dbg_backtrace false
% 150.34/150.50 % --dbg_dump_prop_clauses false
% 150.34/150.50 % --dbg_dump_prop_clauses_file -
% 150.34/150.50 % --dbg_out_stat false
% 150.34/150.50
% 150.34/150.50 % ------ General Options
% 150.34/150.50
% 150.34/150.50 % --fof false
% 150.34/150.50 % --time_out_real 150.
% 150.34/150.50 % --time_out_prep_mult 0.2
% 150.34/150.50 % --time_out_virtual -1.
% 150.34/150.50 % --schedule none
% 150.34/150.50 % --ground_splitting input
% 150.34/150.50 % --splitting_nvd 16
% 150.34/150.50 % --non_eq_to_eq false
% 150.34/150.50 % --prep_gs_sim true
% 150.34/150.50 % --prep_unflatten false
% 150.34/150.50 % --prep_res_sim true
% 150.34/150.50 % --prep_upred true
% 150.34/150.50 % --res_sim_input true
% 150.34/150.50 % --clause_weak_htbl true
% 150.34/150.50 % --gc_record_bc_elim false
% 150.34/150.50 % --symbol_type_check false
% 150.34/150.50 % --clausify_out false
% 150.34/150.50 % --large_theory_mode false
% 150.34/150.50 % --prep_sem_filter none
% 150.34/150.50 % --prep_sem_filter_out false
% 150.34/150.50 % --preprocessed_out false
% 150.34/150.50 % --sub_typing false
% 150.34/150.50 % --brand_transform false
% 150.34/150.50 % --pure_diseq_elim true
% 150.34/150.50 % --min_unsat_core false
% 150.34/150.50 % --pred_elim true
% 150.34/150.50 % --add_important_lit false
% 150.34/150.50 % --soft_assumptions false
% 150.34/150.50 % --reset_solvers false
% 150.34/150.50 % --bc_imp_inh []
% 150.34/150.50 % --conj_cone_tolerance 1.5
% 150.34/150.50 % --prolific_symb_bound 500
% 150.34/150.50 % --lt_threshold 2000
% 150.34/150.50
% 150.34/150.50 % ------ SAT Options
% 150.34/150.50
% 150.34/150.50 % --sat_mode false
% 150.34/150.50 % --sat_fm_restart_options ""
% 150.34/150.50 % --sat_gr_def false
% 150.34/150.50 % --sat_epr_types true
% 150.34/150.50 % --sat_non_cyclic_types false
% 150.34/150.50 % --sat_finite_models false
% 150.34/150.50 % --sat_fm_lemmas false
% 150.34/150.50 % --sat_fm_prep false
% 150.34/150.50 % --sat_fm_uc_incr true
% 150.34/150.50 % --sat_out_model small
% 150.34/150.50 % --sat_out_clauses false
% 150.34/150.50
% 150.34/150.50 % ------ QBF Options
% 150.34/150.50
% 150.34/150.50 % --qbf_mode false
% 150.34/150.50 % --qbf_elim_univ true
% 150.34/150.50 % --qbf_sk_in true
% 150.34/150.50 % --qbf_pred_elim true
% 150.34/150.50 % --qbf_split 32
% 150.34/150.50
% 150.34/150.50 % ------ BMC1 Options
% 150.34/150.50
% 150.34/150.50 % --bmc1_incremental false
% 150.34/150.50 % --bmc1_axioms reachable_all
% 150.34/150.50 % --bmc1_min_bound 0
% 150.34/150.50 % --bmc1_max_bound -1
% 150.34/150.50 % --bmc1_max_bound_default -1
% 150.34/150.50 % --bmc1_symbol_reachability true
% 150.34/150.50 % --bmc1_property_lemmas false
% 150.34/150.50 % --bmc1_k_induction false
% 150.34/150.50 % --bmc1_non_equiv_states false
% 150.34/150.50 % --bmc1_deadlock false
% 150.34/150.50 % --bmc1_ucm false
% 150.34/150.50 % --bmc1_add_unsat_core none
% 150.34/150.50 % --bmc1_unsat_core_children false
% 150.34/150.50 % --bmc1_unsat_core_extrapolate_axioms false
% 150.34/150.50 % --bmc1_out_stat full
% 150.34/150.50 % --bmc1_ground_init false
% 150.34/150.50 % --bmc1_pre_inst_next_state false
% 150.34/150.50 % --bmc1_pre_inst_state false
% 150.34/150.50 % --bmc1_pre_inst_reach_state false
% 150.34/150.50 % --bmc1_out_unsat_core false
% 150.34/150.50 % --bmc1_aig_witness_out false
% 150.34/150.50 % --bmc1_verbose false
% 150.34/150.50 % --bmc1_dump_clauses_tptp false
% 150.34/150.51 % --bmc1_dump_unsat_core_tptp false
% 150.34/150.51 % --bmc1_dump_file -
% 150.34/150.51 % --bmc1_ucm_expand_uc_limit 128
% 150.34/150.51 % --bmc1_ucm_n_expand_iterations 6
% 150.34/150.51 % --bmc1_ucm_extend_mode 1
% 150.34/150.51 % --bmc1_ucm_init_mode 2
% 150.34/150.51 % --bmc1_ucm_cone_mode none
% 150.34/150.51 % --bmc1_ucm_reduced_relation_type 0
% 150.34/150.51 % --bmc1_ucm_relax_model 4
% 150.34/150.51 % --bmc1_ucm_full_tr_after_sat true
% 150.34/150.51 % --bmc1_ucm_expand_neg_assumptions false
% 150.34/150.51 % --bmc1_ucm_layered_model none
% 150.34/150.51 % --bmc1_ucm_max_lemma_size 10
% 150.34/150.51
% 150.34/150.51 % ------ AIG Options
% 150.34/150.51
% 150.34/150.51 % --aig_mode false
% 150.34/150.51
% 150.34/150.51 % ------ Instantiation Options
% 150.34/150.51
% 150.34/150.51 % --instantiation_flag true
% 150.34/150.51 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 150.34/150.51 % --inst_solver_per_active 750
% 150.34/150.51 % --inst_solver_calls_frac 0.5
% 150.34/150.51 % --inst_passive_queue_type priority_queues
% 150.34/150.51 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 150.34/150.51 % --inst_passive_queues_freq [25;2]
% 150.34/150.51 % --inst_dismatching true
% 150.34/150.51 % --inst_eager_unprocessed_to_passive true
% 150.34/150.51 % --inst_prop_sim_given true
% 150.34/150.51 % --inst_prop_sim_new false
% 150.34/150.51 % --inst_orphan_elimination true
% 150.34/150.51 % --inst_learning_loop_flag true
% 150.34/150.51 % --inst_learning_start 3000
% 150.34/150.51 % --inst_learning_factor 2
% 150.34/150.51 % --inst_start_prop_sim_after_learn 3
% 150.34/150.51 % --inst_sel_renew solver
% 150.34/150.51 % --inst_lit_activity_flag true
% 150.34/150.51 % --inst_out_proof true
% 150.34/150.51
% 150.34/150.51 % ------ Resolution Options
% 150.34/150.51
% 150.34/150.51 % --resolution_flag true
% 150.34/150.51 % --res_lit_sel kbo_max
% 150.34/150.51 % --res_to_prop_solver none
% 150.34/150.51 % --res_prop_simpl_new false
% 150.34/150.51 % --res_prop_simpl_given false
% 150.34/150.51 % --res_passive_queue_type priority_queues
% 150.34/150.51 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 150.34/150.51 % --res_passive_queues_freq [15;5]
% 150.34/150.51 % --res_forward_subs full
% 150.34/150.51 % --res_backward_subs full
% 150.34/150.51 % --res_forward_subs_resolution true
% 150.34/150.51 % --res_backward_subs_resolution true
% 150.34/150.51 % --res_orphan_elimination false
% 150.34/150.51 % --res_time_limit 1000.
% 150.34/150.51 % --res_out_proof true
% 150.34/150.51 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_8850d6.s
% 150.34/150.51 % --modulo true
% 150.34/150.51
% 150.34/150.51 % ------ Combination Options
% 150.34/150.51
% 150.34/150.51 % --comb_res_mult 1000
% 150.34/150.51 % --comb_inst_mult 300
% 150.34/150.51 % ------
% 150.34/150.51
% 150.34/150.51 % ------ Parsing...% successful
% 150.34/150.51
% 150.34/150.51 % ------ 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 %
% 150.34/150.51
% 150.34/150.51 % ------ Proving...
% 150.34/150.51 % ------ Problem Properties
% 150.34/150.51
% 150.34/150.51 %
% 150.34/150.51 % EPR false
% 150.34/150.51 % Horn false
% 150.34/150.51 % Has equality false
% 150.34/150.51
% 150.34/150.51 % % ------ Input Options Time Limit: Unbounded
% 150.34/150.51
% 150.34/150.51
% 150.34/150.51 % % ------ Current options:
% 150.34/150.51
% 150.34/150.51 % ------ Input Options
% 150.34/150.51
% 150.34/150.51 % --out_options all
% 150.34/150.51 % --tptp_safe_out true
% 150.34/150.51 % --problem_path ""
% 150.34/150.51 % --include_path ""
% 150.34/150.51 % --clausifier .//eprover
% 150.34/150.51 % --clausifier_options --tstp-format
% 150.34/150.51 % --stdin false
% 150.34/150.51 % --dbg_backtrace false
% 150.34/150.51 % --dbg_dump_prop_clauses false
% 150.34/150.51 % --dbg_dump_prop_clauses_file -
% 150.34/150.51 % --dbg_out_stat false
% 150.34/150.51
% 150.34/150.51 % ------ General Options
% 150.34/150.51
% 150.34/150.51 % --fof false
% 150.34/150.51 % --time_out_real 150.
% 150.34/150.51 % --time_out_prep_mult 0.2
% 150.34/150.51 % --time_out_virtual -1.
% 150.34/150.51 % --schedule none
% 150.34/150.51 % --ground_splitting input
% 150.34/150.51 % --splitting_nvd 16
% 150.34/150.51 % --non_eq_to_eq false
% 150.34/150.51 % --prep_gs_sim true
% 150.34/150.51 % --prep_unflatten false
% 150.34/150.51 % --prep_res_sim true
% 150.34/150.51 % --prep_upred true
% 150.34/150.51 % --res_sim_input true
% 150.34/150.51 % --clause_weak_htbl true
% 150.34/150.51 % --gc_record_bc_elim false
% 150.34/150.51 % --symbol_type_check false
% 150.34/150.51 % --clausify_out false
% 150.34/150.51 % --large_theory_mode false
% 150.34/150.51 % --prep_sem_filter none
% 150.34/150.51 % --prep_sem_filter_out false
% 150.34/150.51 % --preprocessed_out false
% 150.34/150.51 % --sub_typing false
% 150.34/150.51 % --brand_transform false
% 150.34/150.51 % --pure_diseq_elim true
% 150.34/150.51 % --min_unsat_core false
% 150.34/150.51 % --pred_elim true
% 150.34/150.51 % --add_important_lit false
% 150.34/150.51 % --soft_assumptions false
% 150.34/150.51 % --reset_solvers false
% 150.34/150.51 % --bc_imp_inh []
% 150.34/150.51 % --conj_cone_tolerance 1.5
% 150.34/150.51 % --prolific_symb_bound 500
% 150.34/150.51 % --lt_threshold 2000
% 150.34/150.51
% 150.34/150.51 % ------ SAT Options
% 150.34/150.51
% 150.34/150.51 % --sat_mode false
% 150.34/150.51 % --sat_fm_restart_options ""
% 150.34/150.51 % --sat_gr_def false
% 150.34/150.51 % --sat_epr_types true
% 150.34/150.51 % --sat_non_cyclic_types false
% 150.34/150.51 % --sat_finite_models false
% 150.34/150.51 % --sat_fm_lemmas false
% 150.34/150.51 % --sat_fm_prep false
% 150.34/150.51 % --sat_fm_uc_incr true
% 150.34/150.51 % --sat_out_model small
% 150.34/150.51 % --sat_out_clauses false
% 150.34/150.51
% 150.34/150.51 % ------ QBF Options
% 150.34/150.51
% 150.34/150.51 % --qbf_mode false
% 150.34/150.51 % --qbf_elim_univ true
% 150.34/150.51 % --qbf_sk_in true
% 150.34/150.51 % --qbf_pred_elim true
% 150.34/150.51 % --qbf_split 32
% 150.34/150.51
% 150.34/150.51 % ------ BMC1 Options
% 150.34/150.51
% 150.34/150.51 % --bmc1_incremental false
% 150.34/150.51 % --bmc1_axioms reachable_all
% 150.34/150.51 % --bmc1_min_bound 0
% 150.34/150.51 % --bmc1_max_bound -1
% 150.34/150.51 % --bmc1_max_bound_default -1
% 150.34/150.51 % --bmc1_symbol_reachability true
% 150.34/150.51 % --bmc1_property_lemmas false
% 150.34/150.51 % --bmc1_k_induction false
% 150.34/150.51 % --bmc1_non_equiv_states false
% 150.34/150.51 % --bmc1_deadlock false
% 150.34/150.51 % --bmc1_ucm false
% 150.34/150.51 % --bmc1_add_unsat_core none
% 150.34/150.51 % --bmc1_unsat_core_children false
% 150.34/150.51 % --bmc1_unsat_core_extrapolate_axioms false
% 150.34/150.51 % --bmc1_out_stat full
% 150.34/150.51 % --bmc1_ground_init false
% 150.34/150.51 % --bmc1_pre_inst_next_state false
% 150.34/150.51 % --bmc1_pre_inst_state false
% 150.34/150.51 % --bmc1_pre_inst_reach_state false
% 150.34/150.51 % --bmc1_out_unsat_core false
% 150.34/150.51 % --bmc1_aig_witness_out false
% 150.34/150.51 % --bmc1_verbose false
% 150.34/150.51 % --bmc1_dump_clauses_tptp false
% 150.34/150.51 % --bmc1_dump_unsat_core_tptp false
% 150.34/150.51 % --bmc1_dump_file -
% 150.34/150.51 % --bmc1_ucm_expand_uc_limit 128
% 150.34/150.51 % --bmc1_ucm_n_expand_iterations 6
% 150.34/150.51 % --bmc1_ucm_extend_mode 1
% 150.34/150.51 % --bmc1_ucm_init_mode 2
% 150.34/150.51 % --bmc1_ucm_cone_mode none
% 150.34/150.51 % --bmc1_ucm_reduced_relation_type 0
% 150.34/150.51 % --bmc1_ucm_relax_model 4
% 150.34/150.51 % --bmc1_ucm_full_tr_after_sat true
% 150.34/150.51 % --bmc1_ucm_expand_neg_assumptions false
% 150.34/150.51 % --bmc1_ucm_layered_model none
% 150.34/150.51 % --bmc1_ucm_max_lemma_size 10
% 150.34/150.51
% 150.34/150.51 % ------ AIG Options
% 150.34/150.51
% 150.34/150.51 % --aig_mode false
% 150.34/150.51
% 150.34/150.51 % ------ Instantiation Options
% 150.34/150.51
% 150.34/150.51 % --instantiation_flag true
% 150.34/150.51 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 150.34/150.51 % --inst_solver_per_active 750
% 150.34/150.51 % --inst_solver_calls_frac 0.5
% 150.34/150.51 % --inst_passive_queue_type priority_queues
% 150.34/150.51 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 150.34/150.51 % --inst_passive_queues_freq [25;2]
% 150.34/150.51 % --inst_dismatching true
% 150.34/150.51 % --inst_eager_unprocessed_to_passive true
% 150.34/150.51 % --inst_prop_sim_given true
% 157.55/157.74 % --inst_prop_sim_new false
% 157.55/157.74 % --inst_orphan_elimination true
% 157.55/157.74 % --inst_learning_loop_flag true
% 157.55/157.74 % --inst_learning_start 3000
% 157.55/157.74 % --inst_learning_factor 2
% 157.55/157.74 % --inst_start_prop_sim_after_learn 3
% 157.55/157.74 % --inst_sel_renew solver
% 157.55/157.74 % --inst_lit_activity_flag true
% 157.55/157.74 % --inst_out_proof true
% 157.55/157.74
% 157.55/157.74 % ------ Resolution Options
% 157.55/157.74
% 157.55/157.74 % --resolution_flag true
% 157.55/157.74 % --res_lit_sel kbo_max
% 157.55/157.74 % --res_to_prop_solver none
% 157.55/157.74 % --res_prop_simpl_new false
% 157.55/157.74 % --res_prop_simpl_given false
% 157.55/157.74 % --res_passive_queue_type priority_queues
% 157.55/157.74 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 157.55/157.74 % --res_passive_queues_freq [15;5]
% 157.55/157.74 % --res_forward_subs full
% 157.55/157.74 % --res_backward_subs full
% 157.55/157.74 % --res_forward_subs_resolution true
% 157.55/157.74 % --res_backward_subs_resolution true
% 157.55/157.74 % --res_orphan_elimination false
% 157.55/157.74 % --res_time_limit 1000.
% 157.55/157.74 % --res_out_proof true
% 157.55/157.74 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_8850d6.s
% 157.55/157.74 % --modulo true
% 157.55/157.74
% 157.55/157.74 % ------ Combination Options
% 157.55/157.74
% 157.55/157.74 % --comb_res_mult 1000
% 157.55/157.74 % --comb_inst_mult 300
% 157.55/157.74 % ------
% 157.55/157.74
% 157.55/157.74
% 157.55/157.74
% 157.55/157.74 % ------ Proving...
% 157.55/157.74 %
% 157.55/157.74
% 157.55/157.74
% 157.55/157.74 % ------ Statistics
% 157.55/157.74
% 157.55/157.74 % ------ General
% 157.55/157.74
% 157.55/157.74 % num_of_input_clauses: 81
% 157.55/157.74 % num_of_input_neg_conjectures: 4
% 157.55/157.74 % num_of_splits: 0
% 157.55/157.74 % num_of_split_atoms: 0
% 157.55/157.74 % num_of_sem_filtered_clauses: 0
% 157.55/157.74 % num_of_subtypes: 0
% 157.55/157.74 % monotx_restored_types: 0
% 157.55/157.74 % sat_num_of_epr_types: 0
% 157.55/157.74 % sat_num_of_non_cyclic_types: 0
% 157.55/157.74 % sat_guarded_non_collapsed_types: 0
% 157.55/157.74 % is_epr: 0
% 157.55/157.74 % is_horn: 0
% 157.55/157.74 % has_eq: 0
% 157.55/157.74 % num_pure_diseq_elim: 0
% 157.55/157.74 % simp_replaced_by: 0
% 157.55/157.74 % res_preprocessed: 12
% 157.55/157.74 % prep_upred: 0
% 157.55/157.74 % prep_unflattend: 0
% 157.55/157.74 % pred_elim_cands: 1
% 157.55/157.74 % pred_elim: 1
% 157.55/157.74 % pred_elim_cl: 4
% 157.55/157.74 % pred_elim_cycles: 2
% 157.55/157.74 % forced_gc_time: 0
% 157.55/157.74 % gc_basic_clause_elim: 0
% 157.55/157.74 % parsing_time: 0.002
% 157.55/157.74 % sem_filter_time: 0.
% 157.55/157.74 % pred_elim_time: 0.
% 157.55/157.74 % out_proof_time: 0.001
% 157.55/157.74 % monotx_time: 0.
% 157.55/157.74 % subtype_inf_time: 0.
% 157.55/157.74 % unif_index_cands_time: 0.02
% 157.55/157.74 % unif_index_add_time: 0.008
% 157.55/157.74 % total_time: 7.246
% 157.55/157.74 % num_of_symbols: 38
% 157.55/157.74 % num_of_terms: 8152
% 157.55/157.74
% 157.55/157.74 % ------ Propositional Solver
% 157.55/157.74
% 157.55/157.74 % prop_solver_calls: 25
% 157.55/157.74 % prop_fast_solver_calls: 20
% 157.55/157.74 % prop_num_of_clauses: 7891
% 157.55/157.74 % prop_preprocess_simplified: 13094
% 157.55/157.74 % prop_fo_subsumed: 0
% 157.55/157.74 % prop_solver_time: 0.003
% 157.55/157.74 % prop_fast_solver_time: 0.
% 157.55/157.74 % prop_unsat_core_time: 0.
% 157.55/157.74
% 157.55/157.74 % ------ QBF
% 157.55/157.74
% 157.55/157.74 % qbf_q_res: 0
% 157.55/157.74 % qbf_num_tautologies: 0
% 157.55/157.74 % qbf_prep_cycles: 0
% 157.55/157.74
% 157.55/157.74 % ------ BMC1
% 157.55/157.74
% 157.55/157.74 % bmc1_current_bound: -1
% 157.55/157.74 % bmc1_last_solved_bound: -1
% 157.55/157.74 % bmc1_unsat_core_size: -1
% 157.55/157.74 % bmc1_unsat_core_parents_size: -1
% 157.55/157.74 % bmc1_merge_next_fun: 0
% 157.55/157.74 % bmc1_unsat_core_clauses_time: 0.
% 157.55/157.74
% 157.55/157.74 % ------ Instantiation
% 157.55/157.74
% 157.55/157.74 % inst_num_of_clauses: 3420
% 157.55/157.74 % inst_num_in_passive: 1819
% 157.55/157.74 % inst_num_in_active: 1329
% 157.55/157.74 % inst_num_in_unprocessed: 180
% 157.55/157.74 % inst_num_of_loops: 1458
% 157.55/157.74 % inst_num_of_learning_restarts: 1
% 157.55/157.74 % inst_num_moves_active_passive: 43
% 157.55/157.74 % inst_lit_activity: 722
% 157.55/157.74 % inst_lit_activity_moves: 0
% 157.55/157.74 % inst_num_tautologies: 82
% 157.55/157.74 % inst_num_prop_implied: 0
% 157.55/157.74 % inst_num_existing_simplified: 0
% 157.55/157.74 % inst_num_eq_res_simplified: 0
% 157.55/157.74 % inst_num_child_elim: 0
% 157.55/157.74 % inst_num_of_dismatching_blockings: 1174
% 157.55/157.74 % inst_num_of_non_proper_insts: 7165
% 157.55/157.74 % inst_num_of_duplicates: 3661
% 157.55/157.74 % inst_inst_num_from_inst_to_res: 0
% 157.55/157.74 % inst_dismatching_checking_time: 0.024
% 157.55/157.74
% 157.55/157.74 % ------ Resolution
% 157.55/157.74
% 157.55/157.74 % res_num_of_clauses: 22508
% 157.55/157.74 % res_num_in_passive: 20387
% 157.55/157.74 % res_num_in_active: 2591
% 157.55/157.74 % res_num_of_loops: 15000
% 157.55/157.74 % res_forward_subset_subsumed: 43887
% 157.55/157.74 % res_backward_subset_subsumed: 1255
% 157.55/157.74 % res_forward_subsumed: 12204
% 157.55/157.74 % res_backward_subsumed: 109
% 157.55/157.74 % res_forward_subsumption_resolution: 386
% 157.55/157.74 % res_backward_subsumption_resolution: 0
% 157.55/157.74 % res_clause_to_clause_subsumption: 2261933
% 157.55/157.74 % res_orphan_elimination: 0
% 157.55/157.74 % res_tautology_del: 4188
% 157.55/157.74 % res_num_eq_res_simplified: 0
% 157.55/157.74 % res_num_sel_changes: 0
% 157.55/157.74 % res_moves_from_active_to_pass: 0
% 157.55/157.74
% 157.55/157.74 % Status Unsatisfiable
% 157.55/157.74 % SZS status Unsatisfiable
% 157.55/157.74 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------