%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : CAT001-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n025.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 : Fri Jul 15 00:01:26 EDT 2022
% Result : Unsatisfiable 178.31s 178.56s
% Output : CNFRefutation 178.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 40
% Number of leaves : 39
% Syntax : Number of formulae : 290 ( 107 unt; 0 def)
% Number of atoms : 657 ( 34 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 745 ( 378 ~; 367 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 592 ( 28 sgn 165 !; 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,
! [X3,X5,X1,X6,X4,X2] :
( ~ product(X1,X3,X5)
| ~ product(X2,X5,X6)
| ~ product(X2,X1,X4)
| product(X4,X3,X6) ),
file('<stdin>',category_theory_axiom5) ).
fof(c_0_1,axiom,
! [X3,X5,X1,X6,X4,X2] :
( ~ product(X2,X1,X4)
| ~ product(X4,X3,X6)
| ~ product(X1,X3,X5)
| product(X2,X5,X6) ),
file('<stdin>',category_theory_axiom2) ).
fof(c_0_2,axiom,
! [X3,X5,X1,X4,X2] :
( ~ product(X1,X3,X5)
| ~ product(X2,X1,X4)
| ~ defined(X2,X5)
| defined(X4,X3) ),
file('<stdin>',category_theory_axiom4) ).
fof(c_0_3,axiom,
! [X3,X5,X1,X4,X2] :
( ~ product(X2,X1,X4)
| ~ product(X1,X3,X5)
| ~ defined(X4,X3)
| defined(X2,X5) ),
file('<stdin>',category_theory_axiom1) ).
fof(c_0_4,axiom,
! [X3,X1,X2,X7] :
( ~ product(X2,X1,X3)
| ~ product(X2,X1,X7)
| X3 = X7 ),
file('<stdin>',composition_is_well_defined) ).
fof(c_0_5,axiom,
! [X3,X5,X1,X2] :
( ~ product(X1,X3,X5)
| ~ defined(X2,X5)
| defined(X2,X1) ),
file('<stdin>',category_theory_axiom3) ).
fof(c_0_6,axiom,
! [X3,X1,X4,X2] :
( ~ product(X2,X1,X4)
| ~ defined(X4,X3)
| defined(X1,X3) ),
file('<stdin>',associative_property2) ).
fof(c_0_7,axiom,
! [X1,X2] :
( ~ defined(X2,X1)
| product(X2,X1,compose(X2,X1)) ),
file('<stdin>',closure_of_composition) ).
fof(c_0_8,axiom,
! [X3,X1,X2] :
( ~ product(X2,X1,X3)
| defined(X2,X1) ),
file('<stdin>',associative_property1) ).
fof(c_0_9,axiom,
! [X1,X2] :
( ~ defined(X2,X1)
| ~ identity_map(X1)
| product(X2,X1,X2) ),
file('<stdin>',identity2) ).
fof(c_0_10,axiom,
! [X1,X2] :
( ~ defined(X2,X1)
| ~ identity_map(X2)
| product(X2,X1,X1) ),
file('<stdin>',identity1) ).
fof(c_0_11,axiom,
! [X3,X1,X2] :
( ~ defined(X2,X1)
| ~ defined(X1,X3)
| ~ identity_map(X1)
| defined(X2,X3) ),
file('<stdin>',category_theory_axiom6) ).
fof(c_0_12,axiom,
! [X2] : product(codomain(X2),X2,X2),
file('<stdin>',product_on_codomain) ).
fof(c_0_13,axiom,
! [X2] : product(X2,domain(X2),X2),
file('<stdin>',product_on_domain) ).
fof(c_0_14,axiom,
! [X2] : defined(codomain(X2),X2),
file('<stdin>',mapping_from_codomain_of_x_to_x) ).
fof(c_0_15,axiom,
! [X2] : defined(X2,domain(X2)),
file('<stdin>',mapping_from_x_to_its_domain) ).
fof(c_0_16,axiom,
! [X2] : identity_map(codomain(X2)),
file('<stdin>',codomain_is_an_identity_map) ).
fof(c_0_17,axiom,
! [X2] : identity_map(domain(X2)),
file('<stdin>',domain_is_an_identity_map) ).
fof(c_0_18,plain,
! [X3,X5,X1,X6,X4,X2] :
( ~ product(X1,X3,X5)
| ~ product(X2,X5,X6)
| ~ product(X2,X1,X4)
| product(X4,X3,X6) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_19,plain,
! [X3,X5,X1,X6,X4,X2] :
( ~ product(X2,X1,X4)
| ~ product(X4,X3,X6)
| ~ product(X1,X3,X5)
| product(X2,X5,X6) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_20,plain,
! [X3,X5,X1,X4,X2] :
( ~ product(X1,X3,X5)
| ~ product(X2,X1,X4)
| ~ defined(X2,X5)
| defined(X4,X3) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_21,plain,
! [X3,X5,X1,X4,X2] :
( ~ product(X2,X1,X4)
| ~ product(X1,X3,X5)
| ~ defined(X4,X3)
| defined(X2,X5) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_22,plain,
! [X3,X1,X2,X7] :
( ~ product(X2,X1,X3)
| ~ product(X2,X1,X7)
| X3 = X7 ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_23,plain,
! [X3,X5,X1,X2] :
( ~ product(X1,X3,X5)
| ~ defined(X2,X5)
| defined(X2,X1) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_24,plain,
! [X3,X1,X4,X2] :
( ~ product(X2,X1,X4)
| ~ defined(X4,X3)
| defined(X1,X3) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_25,plain,
! [X1,X2] :
( ~ defined(X2,X1)
| product(X2,X1,compose(X2,X1)) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_26,plain,
! [X3,X1,X2] :
( ~ product(X2,X1,X3)
| defined(X2,X1) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_27,plain,
! [X1,X2] :
( ~ defined(X2,X1)
| ~ identity_map(X1)
| product(X2,X1,X2) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_28,plain,
! [X1,X2] :
( ~ defined(X2,X1)
| ~ identity_map(X2)
| product(X2,X1,X1) ),
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_29,plain,
! [X3,X1,X2] :
( ~ defined(X2,X1)
| ~ defined(X1,X3)
| ~ identity_map(X1)
| defined(X2,X3) ),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_30,axiom,
! [X2] : product(codomain(X2),X2,X2),
c_0_12 ).
fof(c_0_31,axiom,
! [X2] : product(X2,domain(X2),X2),
c_0_13 ).
fof(c_0_32,axiom,
! [X2] : defined(codomain(X2),X2),
c_0_14 ).
fof(c_0_33,axiom,
! [X2] : defined(X2,domain(X2)),
c_0_15 ).
fof(c_0_34,axiom,
! [X2] : identity_map(codomain(X2)),
c_0_16 ).
fof(c_0_35,axiom,
! [X2] : identity_map(domain(X2)),
c_0_17 ).
fof(c_0_36,plain,
! [X7,X8,X9,X10,X11,X12] :
( ~ product(X9,X7,X8)
| ~ product(X12,X8,X10)
| ~ product(X12,X9,X11)
| product(X11,X7,X10) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_18])])]) ).
fof(c_0_37,plain,
! [X7,X8,X9,X10,X11,X12] :
( ~ product(X12,X9,X11)
| ~ product(X11,X7,X10)
| ~ product(X9,X7,X8)
| product(X12,X8,X10) ),
inference(variable_rename,[status(thm)],[c_0_19]) ).
fof(c_0_38,plain,
! [X6,X7,X8,X9,X10] :
( ~ product(X8,X6,X7)
| ~ product(X10,X8,X9)
| ~ defined(X10,X7)
| defined(X9,X6) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_20])])]) ).
fof(c_0_39,plain,
! [X6,X7,X8,X9,X10] :
( ~ product(X10,X8,X9)
| ~ product(X8,X6,X7)
| ~ defined(X9,X6)
| defined(X10,X7) ),
inference(variable_rename,[status(thm)],[c_0_21]) ).
fof(c_0_40,plain,
! [X8,X9,X10,X11] :
( ~ product(X10,X9,X8)
| ~ product(X10,X9,X11)
| X8 = X11 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_22])])]) ).
fof(c_0_41,plain,
! [X6,X7,X8,X9] :
( ~ product(X8,X6,X7)
| ~ defined(X9,X7)
| defined(X9,X8) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_23])])]) ).
fof(c_0_42,plain,
! [X5,X6,X7,X8] :
( ~ product(X8,X6,X7)
| ~ defined(X7,X5)
| defined(X6,X5) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_24])])]) ).
fof(c_0_43,plain,
! [X3,X4] :
( ~ defined(X4,X3)
| product(X4,X3,compose(X4,X3)) ),
inference(variable_rename,[status(thm)],[c_0_25]) ).
fof(c_0_44,plain,
! [X4,X5,X6] :
( ~ product(X6,X5,X4)
| defined(X6,X5) ),
inference(variable_rename,[status(thm)],[c_0_26]) ).
fof(c_0_45,plain,
! [X3,X4] :
( ~ defined(X4,X3)
| ~ identity_map(X3)
| product(X4,X3,X4) ),
inference(variable_rename,[status(thm)],[c_0_27]) ).
fof(c_0_46,plain,
! [X3,X4] :
( ~ defined(X4,X3)
| ~ identity_map(X4)
| product(X4,X3,X3) ),
inference(variable_rename,[status(thm)],[c_0_28]) ).
fof(c_0_47,plain,
! [X4,X5,X6] :
( ~ defined(X6,X5)
| ~ defined(X5,X4)
| ~ identity_map(X5)
| defined(X6,X4) ),
inference(variable_rename,[status(thm)],[c_0_29]) ).
fof(c_0_48,plain,
! [X3] : product(codomain(X3),X3,X3),
inference(variable_rename,[status(thm)],[c_0_30]) ).
fof(c_0_49,plain,
! [X3] : product(X3,domain(X3),X3),
inference(variable_rename,[status(thm)],[c_0_31]) ).
fof(c_0_50,plain,
! [X3] : defined(codomain(X3),X3),
inference(variable_rename,[status(thm)],[c_0_32]) ).
fof(c_0_51,plain,
! [X3] : defined(X3,domain(X3)),
inference(variable_rename,[status(thm)],[c_0_33]) ).
fof(c_0_52,plain,
! [X3] : identity_map(codomain(X3)),
inference(variable_rename,[status(thm)],[c_0_34]) ).
fof(c_0_53,plain,
! [X3] : identity_map(domain(X3)),
inference(variable_rename,[status(thm)],[c_0_35]) ).
cnf(c_0_54,plain,
( product(X1,X2,X3)
| ~ product(X4,X5,X1)
| ~ product(X4,X6,X3)
| ~ product(X5,X2,X6) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_55,plain,
( product(X1,X2,X3)
| ~ product(X4,X5,X2)
| ~ product(X6,X5,X3)
| ~ product(X1,X4,X6) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_56,plain,
( defined(X1,X2)
| ~ defined(X3,X4)
| ~ product(X3,X5,X1)
| ~ product(X5,X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_57,plain,
( defined(X1,X2)
| ~ defined(X3,X4)
| ~ product(X5,X4,X2)
| ~ product(X1,X5,X3) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_58,plain,
( X1 = X2
| ~ product(X3,X4,X2)
| ~ product(X3,X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_59,plain,
( defined(X1,X2)
| ~ defined(X1,X3)
| ~ product(X2,X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_60,plain,
( defined(X1,X2)
| ~ defined(X3,X2)
| ~ product(X4,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_61,plain,
( product(X1,X2,compose(X1,X2))
| ~ defined(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_62,plain,
( defined(X1,X2)
| ~ product(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_63,plain,
( product(X1,X2,X1)
| ~ identity_map(X2)
| ~ defined(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_64,plain,
( product(X1,X2,X2)
| ~ identity_map(X1)
| ~ defined(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_65,plain,
( defined(X1,X2)
| ~ identity_map(X3)
| ~ defined(X3,X2)
| ~ defined(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_66,plain,
product(codomain(X1),X1,X1),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_67,plain,
product(X1,domain(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_68,plain,
defined(codomain(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_69,plain,
defined(X1,domain(X1)),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_70,plain,
identity_map(codomain(X1)),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_71,plain,
identity_map(domain(X1)),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_72,plain,
( product(X1,X2,X3)
| ~ product(X4,X5,X1)
| ~ product(X4,X6,X3)
| ~ product(X5,X2,X6) ),
c_0_54,
[final] ).
cnf(c_0_73,plain,
( product(X1,X2,X3)
| ~ product(X4,X5,X2)
| ~ product(X6,X5,X3)
| ~ product(X1,X4,X6) ),
c_0_55,
[final] ).
cnf(c_0_74,plain,
( defined(X1,X2)
| ~ defined(X3,X4)
| ~ product(X3,X5,X1)
| ~ product(X5,X2,X4) ),
c_0_56,
[final] ).
cnf(c_0_75,plain,
( defined(X1,X2)
| ~ defined(X3,X4)
| ~ product(X5,X4,X2)
| ~ product(X1,X5,X3) ),
c_0_57,
[final] ).
cnf(c_0_76,plain,
( X1 = X2
| ~ product(X3,X4,X2)
| ~ product(X3,X4,X1) ),
c_0_58,
[final] ).
cnf(c_0_77,plain,
( defined(X1,X2)
| ~ defined(X1,X3)
| ~ product(X2,X4,X3) ),
c_0_59,
[final] ).
cnf(c_0_78,plain,
( defined(X1,X2)
| ~ defined(X3,X2)
| ~ product(X4,X1,X3) ),
c_0_60,
[final] ).
cnf(c_0_79,plain,
( product(X1,X2,compose(X1,X2))
| ~ defined(X1,X2) ),
c_0_61,
[final] ).
cnf(c_0_80,plain,
( defined(X1,X2)
| ~ product(X1,X2,X3) ),
c_0_62,
[final] ).
cnf(c_0_81,plain,
( product(X1,X2,X1)
| ~ identity_map(X2)
| ~ defined(X1,X2) ),
c_0_63,
[final] ).
cnf(c_0_82,plain,
( product(X1,X2,X2)
| ~ identity_map(X1)
| ~ defined(X1,X2) ),
c_0_64,
[final] ).
cnf(c_0_83,plain,
( defined(X1,X2)
| ~ identity_map(X3)
| ~ defined(X3,X2)
| ~ defined(X1,X3) ),
c_0_65,
[final] ).
cnf(c_0_84,plain,
product(codomain(X1),X1,X1),
c_0_66,
[final] ).
cnf(c_0_85,plain,
product(X1,domain(X1),X1),
c_0_67,
[final] ).
cnf(c_0_86,plain,
defined(codomain(X1),X1),
c_0_68,
[final] ).
cnf(c_0_87,plain,
defined(X1,domain(X1)),
c_0_69,
[final] ).
cnf(c_0_88,plain,
identity_map(codomain(X1)),
c_0_70,
[final] ).
cnf(c_0_89,plain,
identity_map(domain(X1)),
c_0_71,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_72_0,axiom,
( product(X1,X2,X3)
| ~ product(X4,X5,X1)
| ~ product(X4,X6,X3)
| ~ product(X5,X2,X6) ),
inference(literals_permutation,[status(thm)],[c_0_72]) ).
cnf(c_0_72_1,axiom,
( ~ product(X4,X5,X1)
| product(X1,X2,X3)
| ~ product(X4,X6,X3)
| ~ product(X5,X2,X6) ),
inference(literals_permutation,[status(thm)],[c_0_72]) ).
cnf(c_0_72_2,axiom,
( ~ product(X4,X6,X3)
| ~ product(X4,X5,X1)
| product(X1,X2,X3)
| ~ product(X5,X2,X6) ),
inference(literals_permutation,[status(thm)],[c_0_72]) ).
cnf(c_0_72_3,axiom,
( ~ product(X5,X2,X6)
| ~ product(X4,X6,X3)
| ~ product(X4,X5,X1)
| product(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_72]) ).
cnf(c_0_73_0,axiom,
( product(X1,X2,X3)
| ~ product(X4,X5,X2)
| ~ product(X6,X5,X3)
| ~ product(X1,X4,X6) ),
inference(literals_permutation,[status(thm)],[c_0_73]) ).
cnf(c_0_73_1,axiom,
( ~ product(X4,X5,X2)
| product(X1,X2,X3)
| ~ product(X6,X5,X3)
| ~ product(X1,X4,X6) ),
inference(literals_permutation,[status(thm)],[c_0_73]) ).
cnf(c_0_73_2,axiom,
( ~ product(X6,X5,X3)
| ~ product(X4,X5,X2)
| product(X1,X2,X3)
| ~ product(X1,X4,X6) ),
inference(literals_permutation,[status(thm)],[c_0_73]) ).
cnf(c_0_73_3,axiom,
( ~ product(X1,X4,X6)
| ~ product(X6,X5,X3)
| ~ product(X4,X5,X2)
| product(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_73]) ).
cnf(c_0_74_0,axiom,
( defined(X1,X2)
| ~ defined(X3,X4)
| ~ product(X3,X5,X1)
| ~ product(X5,X2,X4) ),
inference(literals_permutation,[status(thm)],[c_0_74]) ).
cnf(c_0_74_1,axiom,
( ~ defined(X3,X4)
| defined(X1,X2)
| ~ product(X3,X5,X1)
| ~ product(X5,X2,X4) ),
inference(literals_permutation,[status(thm)],[c_0_74]) ).
cnf(c_0_74_2,axiom,
( ~ product(X3,X5,X1)
| ~ defined(X3,X4)
| defined(X1,X2)
| ~ product(X5,X2,X4) ),
inference(literals_permutation,[status(thm)],[c_0_74]) ).
cnf(c_0_74_3,axiom,
( ~ product(X5,X2,X4)
| ~ product(X3,X5,X1)
| ~ defined(X3,X4)
| defined(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_74]) ).
cnf(c_0_75_0,axiom,
( defined(X1,X2)
| ~ defined(X3,X4)
| ~ product(X5,X4,X2)
| ~ product(X1,X5,X3) ),
inference(literals_permutation,[status(thm)],[c_0_75]) ).
cnf(c_0_75_1,axiom,
( ~ defined(X3,X4)
| defined(X1,X2)
| ~ product(X5,X4,X2)
| ~ product(X1,X5,X3) ),
inference(literals_permutation,[status(thm)],[c_0_75]) ).
cnf(c_0_75_2,axiom,
( ~ product(X5,X4,X2)
| ~ defined(X3,X4)
| defined(X1,X2)
| ~ product(X1,X5,X3) ),
inference(literals_permutation,[status(thm)],[c_0_75]) ).
cnf(c_0_75_3,axiom,
( ~ product(X1,X5,X3)
| ~ product(X5,X4,X2)
| ~ defined(X3,X4)
| defined(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_75]) ).
cnf(c_0_76_0,axiom,
( X1 = X2
| ~ product(X3,X4,X2)
| ~ product(X3,X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_76]) ).
cnf(c_0_76_1,axiom,
( ~ product(X3,X4,X2)
| X1 = X2
| ~ product(X3,X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_76]) ).
cnf(c_0_76_2,axiom,
( ~ product(X3,X4,X1)
| ~ product(X3,X4,X2)
| X1 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_76]) ).
cnf(c_0_77_0,axiom,
( defined(X1,X2)
| ~ defined(X1,X3)
| ~ product(X2,X4,X3) ),
inference(literals_permutation,[status(thm)],[c_0_77]) ).
cnf(c_0_77_1,axiom,
( ~ defined(X1,X3)
| defined(X1,X2)
| ~ product(X2,X4,X3) ),
inference(literals_permutation,[status(thm)],[c_0_77]) ).
cnf(c_0_77_2,axiom,
( ~ product(X2,X4,X3)
| ~ defined(X1,X3)
| defined(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_77]) ).
cnf(c_0_78_0,axiom,
( defined(X1,X2)
| ~ defined(X3,X2)
| ~ product(X4,X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_78]) ).
cnf(c_0_78_1,axiom,
( ~ defined(X3,X2)
| defined(X1,X2)
| ~ product(X4,X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_78]) ).
cnf(c_0_78_2,axiom,
( ~ product(X4,X1,X3)
| ~ defined(X3,X2)
| defined(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_78]) ).
cnf(c_0_79_0,axiom,
( product(X1,X2,compose(X1,X2))
| ~ defined(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_79]) ).
cnf(c_0_79_1,axiom,
( ~ defined(X1,X2)
| product(X1,X2,compose(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_79]) ).
cnf(c_0_80_0,axiom,
( defined(X1,X2)
| ~ product(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_80]) ).
cnf(c_0_80_1,axiom,
( ~ product(X1,X2,X3)
| defined(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_80]) ).
cnf(c_0_81_0,axiom,
( product(X1,X2,X1)
| ~ identity_map(X2)
| ~ defined(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_81]) ).
cnf(c_0_81_1,axiom,
( ~ identity_map(X2)
| product(X1,X2,X1)
| ~ defined(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_81]) ).
cnf(c_0_81_2,axiom,
( ~ defined(X1,X2)
| ~ identity_map(X2)
| product(X1,X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_81]) ).
cnf(c_0_82_0,axiom,
( product(X1,X2,X2)
| ~ identity_map(X1)
| ~ defined(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_82]) ).
cnf(c_0_82_1,axiom,
( ~ identity_map(X1)
| product(X1,X2,X2)
| ~ defined(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_82]) ).
cnf(c_0_82_2,axiom,
( ~ defined(X1,X2)
| ~ identity_map(X1)
| product(X1,X2,X2) ),
inference(literals_permutation,[status(thm)],[c_0_82]) ).
cnf(c_0_83_0,axiom,
( defined(X1,X2)
| ~ identity_map(X3)
| ~ defined(X3,X2)
| ~ defined(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_83]) ).
cnf(c_0_83_1,axiom,
( ~ identity_map(X3)
| defined(X1,X2)
| ~ defined(X3,X2)
| ~ defined(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_83]) ).
cnf(c_0_83_2,axiom,
( ~ defined(X3,X2)
| ~ identity_map(X3)
| defined(X1,X2)
| ~ defined(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_83]) ).
cnf(c_0_83_3,axiom,
( ~ defined(X1,X3)
| ~ defined(X3,X2)
| ~ identity_map(X3)
| defined(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_83]) ).
cnf(c_0_84_0,axiom,
product(codomain(X1),X1,X1),
inference(literals_permutation,[status(thm)],[c_0_84]) ).
cnf(c_0_85_0,axiom,
product(X1,domain(X1),X1),
inference(literals_permutation,[status(thm)],[c_0_85]) ).
cnf(c_0_86_0,axiom,
defined(codomain(X1),X1),
inference(literals_permutation,[status(thm)],[c_0_86]) ).
cnf(c_0_87_0,axiom,
defined(X1,domain(X1)),
inference(literals_permutation,[status(thm)],[c_0_87]) ).
cnf(c_0_88_0,axiom,
identity_map(codomain(X1)),
inference(literals_permutation,[status(thm)],[c_0_88]) ).
cnf(c_0_89_0,axiom,
identity_map(domain(X1)),
inference(literals_permutation,[status(thm)],[c_0_89]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,hypothesis,
! [X1,X2,X3] :
( ~ product(c,X3,X2)
| ~ product(c,X1,X2)
| X3 = X1 ),
file('<stdin>',cancellation_for_product) ).
fof(c_0_1_002,hypothesis,
product(b,g,d),
file('<stdin>',bg_equals_d) ).
fof(c_0_2_003,hypothesis,
product(b,h,d),
file('<stdin>',bh_equals_d) ).
fof(c_0_3_004,hypothesis,
product(a,b,c),
file('<stdin>',ab_equals_c) ).
fof(c_0_4_005,negated_conjecture,
h != g,
file('<stdin>',prove_h_equals_g) ).
fof(c_0_5_006,hypothesis,
! [X1,X2,X3] :
( ~ product(c,X3,X2)
| ~ product(c,X1,X2)
| X3 = X1 ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_6_007,hypothesis,
product(b,g,d),
c_0_1 ).
fof(c_0_7_008,hypothesis,
product(b,h,d),
c_0_2 ).
fof(c_0_8_009,hypothesis,
product(a,b,c),
c_0_3 ).
fof(c_0_9_010,negated_conjecture,
h != g,
c_0_4 ).
fof(c_0_10_011,hypothesis,
! [X4,X5,X6] :
( ~ product(c,X6,X5)
| ~ product(c,X4,X5)
| X6 = X4 ),
inference(variable_rename,[status(thm)],[c_0_5]) ).
fof(c_0_11_012,hypothesis,
product(b,g,d),
c_0_6 ).
fof(c_0_12_013,hypothesis,
product(b,h,d),
c_0_7 ).
fof(c_0_13_014,hypothesis,
product(a,b,c),
c_0_8 ).
fof(c_0_14_015,negated_conjecture,
h != g,
c_0_9 ).
cnf(c_0_15_016,hypothesis,
( X1 = X2
| ~ product(c,X2,X3)
| ~ product(c,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16_017,hypothesis,
product(b,g,d),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17_018,hypothesis,
product(b,h,d),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18_019,hypothesis,
product(a,b,c),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19_020,negated_conjecture,
h != g,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20_021,hypothesis,
( X1 = X2
| ~ product(c,X2,X3)
| ~ product(c,X1,X3) ),
c_0_15,
[final] ).
cnf(c_0_21_022,hypothesis,
product(b,g,d),
c_0_16,
[final] ).
cnf(c_0_22_023,hypothesis,
product(b,h,d),
c_0_17,
[final] ).
cnf(c_0_23_024,hypothesis,
product(a,b,c),
c_0_18,
[final] ).
cnf(c_0_24_025,negated_conjecture,
g != h,
c_0_19,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_48,plain,
product(b,h,d),
file('/export/starexec/sandbox/tmp/iprover_modulo_9e39da.p',c_0_22) ).
cnf(c_65,plain,
product(b,h,d),
inference(copy,[status(esa)],[c_48]) ).
cnf(c_76,plain,
product(b,h,d),
inference(copy,[status(esa)],[c_65]) ).
cnf(c_79,plain,
product(b,h,d),
inference(copy,[status(esa)],[c_76]) ).
cnf(c_83,plain,
product(b,h,d),
inference(copy,[status(esa)],[c_79]) ).
cnf(c_228,plain,
product(b,h,d),
inference(copy,[status(esa)],[c_83]) ).
cnf(c_16,plain,
( defined(X0,X1)
| ~ product(X0,X1,X2) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_9e39da.p',c_0_80_1) ).
cnf(c_170,plain,
( defined(X0,X1)
| ~ product(X0,X1,X2) ),
inference(copy,[status(esa)],[c_16]) ).
cnf(c_242,plain,
defined(b,h),
inference(resolution,[status(thm)],[c_228,c_170]) ).
cnf(c_243,plain,
defined(b,h),
inference(rewriting,[status(thm)],[c_242]) ).
cnf(c_18,plain,
( product(X0,X1,compose(X0,X1))
| ~ defined(X0,X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_9e39da.p',c_0_79_1) ).
cnf(c_174,plain,
( product(X0,X1,compose(X0,X1))
| ~ defined(X0,X1) ),
inference(copy,[status(esa)],[c_18]) ).
cnf(c_175,plain,
( ~ defined(X0,X1)
| product(X0,X1,compose(X0,X1)) ),
inference(rewriting,[status(thm)],[c_174]) ).
cnf(c_274,plain,
product(b,h,compose(b,h)),
inference(resolution,[status(thm)],[c_243,c_175]) ).
cnf(c_279,plain,
product(b,h,compose(b,h)),
inference(rewriting,[status(thm)],[c_274]) ).
cnf(c_23,plain,
( defined(X0,X1)
| ~ defined(X0,X2)
| ~ product(X1,X3,X2) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_9e39da.p',c_0_77_2) ).
cnf(c_184,plain,
( defined(X0,X1)
| ~ defined(X0,X2)
| ~ product(X1,X3,X2) ),
inference(copy,[status(esa)],[c_23]) ).
cnf(c_334,plain,
( ~ defined(X0,compose(b,h))
| defined(X0,b) ),
inference(resolution,[status(thm)],[c_279,c_184]) ).
cnf(c_335,plain,
( ~ defined(X0,compose(b,h))
| defined(X0,b) ),
inference(rewriting,[status(thm)],[c_334]) ).
cnf(c_3,plain,
defined(codomain(X0),X0),
file('/export/starexec/sandbox/tmp/iprover_modulo_9e39da.p',c_0_86_0) ).
cnf(c_144,plain,
defined(codomain(X0),X0),
inference(copy,[status(esa)],[c_3]) ).
cnf(c_734,plain,
defined(codomain(compose(b,h)),b),
inference(resolution,[status(thm)],[c_335,c_144]) ).
cnf(c_735,plain,
defined(codomain(compose(b,h)),b),
inference(rewriting,[status(thm)],[c_734]) ).
cnf(c_10,plain,
( product(X0,X1,X1)
| ~ identity_map(X0)
| ~ defined(X0,X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_9e39da.p',c_0_82_2) ).
cnf(c_158,plain,
( product(X0,X1,X1)
| ~ identity_map(X0)
| ~ defined(X0,X1) ),
inference(copy,[status(esa)],[c_10]) ).
cnf(c_159,plain,
( ~ identity_map(X0)
| ~ defined(X0,X1)
| product(X0,X1,X1) ),
inference(rewriting,[status(thm)],[c_158]) ).
cnf(c_750,plain,
( ~ identity_map(codomain(compose(b,h)))
| product(codomain(compose(b,h)),b,b) ),
inference(resolution,[status(thm)],[c_735,c_159]) ).
cnf(c_751,plain,
( ~ identity_map(codomain(compose(b,h)))
| product(codomain(compose(b,h)),b,b) ),
inference(rewriting,[status(thm)],[c_750]) ).
cnf(c_1,plain,
identity_map(codomain(X0)),
file('/export/starexec/sandbox/tmp/iprover_modulo_9e39da.p',c_0_88_0) ).
cnf(c_140,plain,
identity_map(codomain(X0)),
inference(copy,[status(esa)],[c_1]) ).
cnf(c_191338,plain,
product(codomain(compose(b,h)),b,b),
inference(forward_subsumption_resolution,[status(thm)],[c_751,c_140]) ).
cnf(c_191339,plain,
product(codomain(compose(b,h)),b,b),
inference(rewriting,[status(thm)],[c_191338]) ).
cnf(c_29,plain,
( defined(X0,X1)
| ~ defined(X2,X3)
| ~ product(X4,X3,X1)
| ~ product(X0,X4,X2) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_9e39da.p',c_0_75_3) ).
cnf(c_196,plain,
( defined(X0,X1)
| ~ defined(X2,X3)
| ~ product(X4,X3,X1)
| ~ product(X0,X4,X2) ),
inference(copy,[status(esa)],[c_29]) ).
cnf(c_191355,plain,
( defined(codomain(compose(b,h)),X0)
| ~ defined(b,X1)
| ~ product(b,X1,X0) ),
inference(resolution,[status(thm)],[c_191339,c_196]) ).
cnf(c_191356,plain,
( defined(codomain(compose(b,h)),X0)
| ~ defined(b,X1)
| ~ product(b,X1,X0) ),
inference(rewriting,[status(thm)],[c_191355]) ).
cnf(c_193132,plain,
( defined(codomain(compose(b,h)),X0)
| ~ product(b,X1,X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_191356,c_170]) ).
cnf(c_193133,plain,
( defined(codomain(compose(b,h)),X0)
| ~ product(b,X1,X0) ),
inference(rewriting,[status(thm)],[c_193132]) ).
cnf(c_47,plain,
product(b,g,d),
file('/export/starexec/sandbox/tmp/iprover_modulo_9e39da.p',c_0_21) ).
cnf(c_63,plain,
product(b,g,d),
inference(copy,[status(esa)],[c_47]) ).
cnf(c_75,plain,
product(b,g,d),
inference(copy,[status(esa)],[c_63]) ).
cnf(c_80,plain,
product(b,g,d),
inference(copy,[status(esa)],[c_75]) ).
cnf(c_87,plain,
product(b,g,d),
inference(copy,[status(esa)],[c_80]) ).
cnf(c_236,plain,
product(b,g,d),
inference(copy,[status(esa)],[c_87]) ).
cnf(c_193142,plain,
defined(codomain(compose(b,h)),d),
inference(resolution,[status(thm)],[c_193133,c_236]) ).
cnf(c_193143,plain,
defined(codomain(compose(b,h)),d),
inference(rewriting,[status(thm)],[c_193142]) ).
cnf(c_6,plain,
( defined(X0,X1)
| ~ identity_map(X2)
| ~ defined(X2,X1)
| ~ defined(X0,X2) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_9e39da.p',c_0_83_3) ).
cnf(c_150,plain,
( defined(X0,X1)
| ~ identity_map(X2)
| ~ defined(X2,X1)
| ~ defined(X0,X2) ),
inference(copy,[status(esa)],[c_6]) ).
cnf(c_151,plain,
( ~ identity_map(X0)
| defined(X1,X2)
| ~ defined(X0,X2)
| ~ defined(X1,X0) ),
inference(rewriting,[status(thm)],[c_150]) ).
cnf(c_193292,plain,
( ~ identity_map(codomain(compose(b,h)))
| ~ defined(X0,codomain(compose(b,h)))
| defined(X0,d) ),
inference(resolution,[status(thm)],[c_193143,c_151]) ).
cnf(c_193293,plain,
( ~ identity_map(codomain(compose(b,h)))
| ~ defined(X0,codomain(compose(b,h)))
| defined(X0,d) ),
inference(rewriting,[status(thm)],[c_193292]) ).
cnf(c_1493473,plain,
( ~ defined(X0,codomain(compose(b,h)))
| defined(X0,d) ),
inference(forward_subsumption_resolution,[status(thm)],[c_193293,c_140]) ).
cnf(c_1493474,plain,
( ~ defined(X0,codomain(compose(b,h)))
| defined(X0,d) ),
inference(rewriting,[status(thm)],[c_1493473]) ).
cnf(c_191345,plain,
( defined(X0,codomain(compose(b,h)))
| ~ defined(X0,b) ),
inference(resolution,[status(thm)],[c_191339,c_184]) ).
cnf(c_191346,plain,
( defined(X0,codomain(compose(b,h)))
| ~ defined(X0,b) ),
inference(rewriting,[status(thm)],[c_191345]) ).
cnf(c_1493534,plain,
( ~ defined(X0,b)
| defined(X0,d) ),
inference(resolution,[status(thm)],[c_1493474,c_191346]) ).
cnf(c_1493535,plain,
( ~ defined(X0,b)
| defined(X0,d) ),
inference(rewriting,[status(thm)],[c_1493534]) ).
cnf(c_33,plain,
( defined(X0,X1)
| ~ defined(X2,X3)
| ~ product(X2,X4,X0)
| ~ product(X4,X1,X3) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_9e39da.p',c_0_74_3) ).
cnf(c_204,plain,
( defined(X0,X1)
| ~ defined(X2,X3)
| ~ product(X2,X4,X0)
| ~ product(X4,X1,X3) ),
inference(copy,[status(esa)],[c_33]) ).
cnf(c_256,plain,
( defined(X0,h)
| ~ defined(X1,d)
| ~ product(X1,b,X0) ),
inference(resolution,[status(thm)],[c_228,c_204]) ).
cnf(c_257,plain,
( defined(X0,h)
| ~ defined(X1,d)
| ~ product(X1,b,X0) ),
inference(rewriting,[status(thm)],[c_256]) ).
cnf(c_49,plain,
product(a,b,c),
file('/export/starexec/sandbox/tmp/iprover_modulo_9e39da.p',c_0_23) ).
cnf(c_67,plain,
product(a,b,c),
inference(copy,[status(esa)],[c_49]) ).
cnf(c_77,plain,
product(a,b,c),
inference(copy,[status(esa)],[c_67]) ).
cnf(c_78,plain,
product(a,b,c),
inference(copy,[status(esa)],[c_77]) ).
cnf(c_84,plain,
product(a,b,c),
inference(copy,[status(esa)],[c_78]) ).
cnf(c_230,plain,
product(a,b,c),
inference(copy,[status(esa)],[c_84]) ).
cnf(c_874,plain,
( defined(c,h)
| ~ defined(a,d) ),
inference(resolution,[status(thm)],[c_257,c_230]) ).
cnf(c_875,plain,
( defined(c,h)
| ~ defined(a,d) ),
inference(rewriting,[status(thm)],[c_874]) ).
cnf(c_1493918,plain,
( defined(c,h)
| ~ defined(a,b) ),
inference(resolution,[status(thm)],[c_1493535,c_875]) ).
cnf(c_1493919,plain,
( defined(c,h)
| ~ defined(a,b) ),
inference(rewriting,[status(thm)],[c_1493918]) ).
cnf(c_578,plain,
defined(a,b),
inference(resolution,[status(thm)],[c_230,c_170]) ).
cnf(c_579,plain,
defined(a,b),
inference(rewriting,[status(thm)],[c_578]) ).
cnf(c_1494400,plain,
defined(c,h),
inference(forward_subsumption_resolution,[status(thm)],[c_1493919,c_579]) ).
cnf(c_1494401,plain,
defined(c,h),
inference(rewriting,[status(thm)],[c_1494400]) ).
cnf(c_1494511,plain,
product(c,h,compose(c,h)),
inference(resolution,[status(thm)],[c_1494401,c_175]) ).
cnf(c_1494516,plain,
product(c,h,compose(c,h)),
inference(rewriting,[status(thm)],[c_1494511]) ).
cnf(c_45,plain,
( ~ product(c,X0,X1)
| ~ product(c,X2,X1)
| X0 = X2 ),
file('/export/starexec/sandbox/tmp/iprover_modulo_9e39da.p',c_0_20) ).
cnf(c_61,plain,
( ~ product(c,X0,X1)
| ~ product(c,X2,X1)
| X0 = X2 ),
inference(copy,[status(esa)],[c_45]) ).
cnf(c_73,plain,
( ~ product(c,X0,X1)
| ~ product(c,X2,X1)
| X0 = X2 ),
inference(copy,[status(esa)],[c_61]) ).
cnf(c_82,plain,
( ~ product(c,X0,X1)
| ~ product(c,X2,X1)
| X0 = X2 ),
inference(copy,[status(esa)],[c_73]) ).
cnf(c_85,plain,
( ~ product(c,X0,X1)
| ~ product(c,X2,X1)
| X0 = X2 ),
inference(copy,[status(esa)],[c_82]) ).
cnf(c_232,plain,
( ~ product(c,X0,X1)
| ~ product(c,X2,X1)
| X0 = X2 ),
inference(copy,[status(esa)],[c_85]) ).
cnf(c_1495278,plain,
( ~ product(c,X0,compose(c,h))
| X0 = h ),
inference(resolution,[status(thm)],[c_1494516,c_232]) ).
cnf(c_1495279,plain,
( ~ product(c,X0,compose(c,h))
| X0 = h ),
inference(rewriting,[status(thm)],[c_1495278]) ).
cnf(c_588,plain,
( ~ defined(c,X0)
| defined(a,X1)
| ~ product(b,X0,X1) ),
inference(resolution,[status(thm)],[c_230,c_196]) ).
cnf(c_589,plain,
( ~ defined(c,X0)
| defined(a,X1)
| ~ product(b,X0,X1) ),
inference(rewriting,[status(thm)],[c_588]) ).
cnf(c_1156,plain,
( ~ defined(c,h)
| defined(a,d) ),
inference(resolution,[status(thm)],[c_589,c_228]) ).
cnf(c_1157,plain,
( ~ defined(c,h)
| defined(a,d) ),
inference(rewriting,[status(thm)],[c_1156]) ).
cnf(c_300,plain,
( defined(X0,g)
| ~ defined(X1,d)
| ~ product(X1,b,X0) ),
inference(resolution,[status(thm)],[c_236,c_204]) ).
cnf(c_301,plain,
( defined(X0,g)
| ~ defined(X1,d)
| ~ product(X1,b,X0) ),
inference(rewriting,[status(thm)],[c_300]) ).
cnf(c_1140,plain,
( defined(c,g)
| ~ defined(a,d) ),
inference(resolution,[status(thm)],[c_301,c_230]) ).
cnf(c_1141,plain,
( defined(c,g)
| ~ defined(a,d) ),
inference(rewriting,[status(thm)],[c_1140]) ).
cnf(c_1238,plain,
( defined(c,g)
| ~ defined(c,h) ),
inference(resolution,[status(thm)],[c_1157,c_1141]) ).
cnf(c_1241,plain,
( defined(c,g)
| ~ defined(c,h) ),
inference(rewriting,[status(thm)],[c_1238]) ).
cnf(c_1494456,plain,
defined(c,g),
inference(backward_subsumption_resolution,[status(thm)],[c_1494401,c_1241]) ).
cnf(c_1494457,plain,
defined(c,g),
inference(rewriting,[status(thm)],[c_1494456]) ).
cnf(c_41,plain,
( product(X0,X1,X2)
| ~ product(X3,X4,X0)
| ~ product(X3,X5,X2)
| ~ product(X4,X1,X5) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_9e39da.p',c_0_72_3) ).
cnf(c_220,plain,
( product(X0,X1,X2)
| ~ product(X3,X4,X0)
| ~ product(X3,X5,X2)
| ~ product(X4,X1,X5) ),
inference(copy,[status(esa)],[c_41]) ).
cnf(c_310,plain,
( product(X0,g,X1)
| ~ product(X2,b,X0)
| ~ product(X2,d,X1) ),
inference(resolution,[status(thm)],[c_236,c_220]) ).
cnf(c_311,plain,
( product(X0,g,X1)
| ~ product(X2,b,X0)
| ~ product(X2,d,X1) ),
inference(rewriting,[status(thm)],[c_310]) ).
cnf(c_39,plain,
( ~ product(X0,X1,X2)
| ~ product(X2,X3,X4)
| product(X0,X5,X4)
| ~ product(X1,X3,X5) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_9e39da.p',c_0_73_1) ).
cnf(c_216,plain,
( ~ product(X0,X1,X2)
| ~ product(X2,X3,X4)
| product(X0,X5,X4)
| ~ product(X1,X3,X5) ),
inference(copy,[status(esa)],[c_39]) ).
cnf(c_264,plain,
( ~ product(X0,h,X1)
| ~ product(X2,b,X0)
| product(X2,d,X1) ),
inference(resolution,[status(thm)],[c_228,c_216]) ).
cnf(c_265,plain,
( ~ product(X0,h,X1)
| ~ product(X2,b,X0)
| product(X2,d,X1) ),
inference(rewriting,[status(thm)],[c_264]) ).
cnf(c_1504,plain,
( ~ product(c,h,X0)
| product(a,d,X0) ),
inference(resolution,[status(thm)],[c_265,c_230]) ).
cnf(c_1505,plain,
( ~ product(c,h,X0)
| product(a,d,X0) ),
inference(rewriting,[status(thm)],[c_1504]) ).
cnf(c_1994,plain,
( ~ product(c,h,X0)
| ~ product(a,b,X1)
| product(X1,g,X0) ),
inference(resolution,[status(thm)],[c_311,c_1505]) ).
cnf(c_1995,plain,
( ~ product(c,h,X0)
| ~ product(a,b,X1)
| product(X1,g,X0) ),
inference(rewriting,[status(thm)],[c_1994]) ).
cnf(c_157778,plain,
( product(c,g,X0)
| ~ product(c,h,X0) ),
inference(resolution,[status(thm)],[c_1995,c_230]) ).
cnf(c_157779,plain,
( product(c,g,X0)
| ~ product(c,h,X0) ),
inference(rewriting,[status(thm)],[c_157778]) ).
cnf(c_1154,plain,
( ~ defined(c,g)
| defined(a,d) ),
inference(resolution,[status(thm)],[c_589,c_236]) ).
cnf(c_1155,plain,
( ~ defined(c,g)
| defined(a,d) ),
inference(rewriting,[status(thm)],[c_1154]) ).
cnf(c_1219,plain,
( ~ defined(c,g)
| defined(c,h) ),
inference(resolution,[status(thm)],[c_1155,c_875]) ).
cnf(c_1220,plain,
( ~ defined(c,g)
| defined(c,h) ),
inference(rewriting,[status(thm)],[c_1219]) ).
cnf(c_1246,plain,
( ~ defined(c,g)
| product(c,h,compose(c,h)) ),
inference(resolution,[status(thm)],[c_1220,c_175]) ).
cnf(c_1251,plain,
( ~ defined(c,g)
| product(c,h,compose(c,h)) ),
inference(rewriting,[status(thm)],[c_1246]) ).
cnf(c_157991,plain,
( ~ defined(c,g)
| product(c,g,compose(c,h)) ),
inference(resolution,[status(thm)],[c_157779,c_1251]) ).
cnf(c_157992,plain,
( ~ defined(c,g)
| product(c,g,compose(c,h)) ),
inference(rewriting,[status(thm)],[c_157991]) ).
cnf(c_1494565,plain,
product(c,g,compose(c,h)),
inference(backward_subsumption_resolution,[status(thm)],[c_1494457,c_157992]) ).
cnf(c_1494600,plain,
product(c,g,compose(c,h)),
inference(rewriting,[status(thm)],[c_1494565]) ).
cnf(c_1678916,plain,
g = h,
inference(resolution,[status(thm)],[c_1495279,c_1494600]) ).
cnf(c_1678917,plain,
g = h,
inference(rewriting,[status(thm)],[c_1678916]) ).
cnf(c_46,negated_conjecture,
g != h,
file('/export/starexec/sandbox/tmp/iprover_modulo_9e39da.p',c_0_24) ).
cnf(c_69,negated_conjecture,
g != h,
inference(copy,[status(esa)],[c_46]) ).
cnf(c_74,negated_conjecture,
g != h,
inference(copy,[status(esa)],[c_69]) ).
cnf(c_81,negated_conjecture,
g != h,
inference(copy,[status(esa)],[c_74]) ).
cnf(c_86,negated_conjecture,
g != h,
inference(copy,[status(esa)],[c_81]) ).
cnf(c_234,negated_conjecture,
g != h,
inference(copy,[status(esa)],[c_86]) ).
cnf(c_1680331,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1678917,c_234]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : CAT001-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.12 % Command : iprover_modulo %s %d
% 0.12/0.33 % Computer : n025.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 : Sun May 29 23:03:57 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 % 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_f9ff60.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_9e39da.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_42b081 | grep -v "SZS"
% 0.20/0.42
% 0.20/0.42 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % ------ iProver source info
% 0.20/0.42
% 0.20/0.42 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.42 % git: non_committed_changes: true
% 0.20/0.42 % git: last_make_outside_of_git: true
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % ------ Input Options
% 0.20/0.42
% 0.20/0.42 % --out_options all
% 0.20/0.42 % --tptp_safe_out true
% 0.20/0.42 % --problem_path ""
% 0.20/0.42 % --include_path ""
% 0.20/0.42 % --clausifier .//eprover
% 0.20/0.42 % --clausifier_options --tstp-format
% 0.20/0.42 % --stdin false
% 0.20/0.42 % --dbg_backtrace false
% 0.20/0.42 % --dbg_dump_prop_clauses false
% 0.20/0.42 % --dbg_dump_prop_clauses_file -
% 0.20/0.42 % --dbg_out_stat false
% 0.20/0.42
% 0.20/0.42 % ------ General Options
% 0.20/0.42
% 0.20/0.42 % --fof false
% 0.20/0.42 % --time_out_real 150.
% 0.20/0.42 % --time_out_prep_mult 0.2
% 0.20/0.42 % --time_out_virtual -1.
% 0.20/0.42 % --schedule none
% 0.20/0.42 % --ground_splitting input
% 0.20/0.42 % --splitting_nvd 16
% 0.20/0.42 % --non_eq_to_eq false
% 0.20/0.42 % --prep_gs_sim true
% 0.20/0.42 % --prep_unflatten false
% 0.20/0.42 % --prep_res_sim true
% 0.20/0.42 % --prep_upred true
% 0.20/0.42 % --res_sim_input true
% 0.20/0.42 % --clause_weak_htbl true
% 0.20/0.42 % --gc_record_bc_elim false
% 0.20/0.42 % --symbol_type_check false
% 0.20/0.42 % --clausify_out false
% 0.20/0.42 % --large_theory_mode false
% 0.20/0.42 % --prep_sem_filter none
% 0.20/0.42 % --prep_sem_filter_out false
% 0.20/0.42 % --preprocessed_out false
% 0.20/0.42 % --sub_typing false
% 0.20/0.42 % --brand_transform false
% 0.20/0.42 % --pure_diseq_elim true
% 0.20/0.42 % --min_unsat_core false
% 0.20/0.42 % --pred_elim true
% 0.20/0.42 % --add_important_lit false
% 0.20/0.42 % --soft_assumptions false
% 0.20/0.42 % --reset_solvers false
% 0.20/0.42 % --bc_imp_inh []
% 0.20/0.42 % --conj_cone_tolerance 1.5
% 0.20/0.42 % --prolific_symb_bound 500
% 0.20/0.42 % --lt_threshold 2000
% 0.20/0.42
% 0.20/0.42 % ------ SAT Options
% 0.20/0.42
% 0.20/0.42 % --sat_mode false
% 0.20/0.42 % --sat_fm_restart_options ""
% 0.20/0.42 % --sat_gr_def false
% 0.20/0.42 % --sat_epr_types true
% 0.20/0.42 % --sat_non_cyclic_types false
% 0.20/0.42 % --sat_finite_models false
% 0.20/0.42 % --sat_fm_lemmas false
% 0.20/0.42 % --sat_fm_prep false
% 0.20/0.42 % --sat_fm_uc_incr true
% 0.20/0.42 % --sat_out_model small
% 0.20/0.42 % --sat_out_clauses false
% 0.20/0.42
% 0.20/0.42 % ------ QBF Options
% 0.20/0.42
% 0.20/0.42 % --qbf_mode false
% 0.20/0.42 % --qbf_elim_univ true
% 0.20/0.42 % --qbf_sk_in true
% 0.20/0.42 % --qbf_pred_elim true
% 0.20/0.42 % --qbf_split 32
% 0.20/0.42
% 0.20/0.42 % ------ BMC1 Options
% 0.20/0.42
% 0.20/0.42 % --bmc1_incremental false
% 0.20/0.42 % --bmc1_axioms reachable_all
% 0.20/0.42 % --bmc1_min_bound 0
% 0.20/0.42 % --bmc1_max_bound -1
% 0.20/0.42 % --bmc1_max_bound_default -1
% 0.20/0.42 % --bmc1_symbol_reachability true
% 0.20/0.42 % --bmc1_property_lemmas false
% 0.20/0.42 % --bmc1_k_induction false
% 0.20/0.42 % --bmc1_non_equiv_states false
% 0.20/0.42 % --bmc1_deadlock false
% 0.20/0.42 % --bmc1_ucm false
% 0.20/0.42 % --bmc1_add_unsat_core none
% 0.20/0.42 % --bmc1_unsat_core_children false
% 0.20/0.42 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.42 % --bmc1_out_stat full
% 0.20/0.42 % --bmc1_ground_init false
% 0.20/0.42 % --bmc1_pre_inst_next_state false
% 0.20/0.42 % --bmc1_pre_inst_state false
% 0.20/0.42 % --bmc1_pre_inst_reach_state false
% 0.20/0.42 % --bmc1_out_unsat_core false
% 0.20/0.42 % --bmc1_aig_witness_out false
% 0.20/0.42 % --bmc1_verbose false
% 0.20/0.42 % --bmc1_dump_clauses_tptp false
% 0.20/0.43 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.43 % --bmc1_dump_file -
% 0.20/0.43 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.43 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.43 % --bmc1_ucm_extend_mode 1
% 0.20/0.43 % --bmc1_ucm_init_mode 2
% 0.20/0.43 % --bmc1_ucm_cone_mode none
% 0.20/0.43 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.43 % --bmc1_ucm_relax_model 4
% 0.20/0.43 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.43 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.43 % --bmc1_ucm_layered_model none
% 0.20/0.43 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.43
% 0.20/0.43 % ------ AIG Options
% 0.20/0.43
% 0.20/0.43 % --aig_mode false
% 0.20/0.43
% 0.20/0.43 % ------ Instantiation Options
% 0.20/0.43
% 0.20/0.43 % --instantiation_flag true
% 0.20/0.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.43 % --inst_solver_per_active 750
% 0.20/0.43 % --inst_solver_calls_frac 0.5
% 0.20/0.43 % --inst_passive_queue_type priority_queues
% 0.20/0.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.43 % --inst_passive_queues_freq [25;2]
% 0.20/0.43 % --inst_dismatching true
% 0.20/0.43 % --inst_eager_unprocessed_to_passive true
% 0.20/0.43 % --inst_prop_sim_given true
% 0.20/0.43 % --inst_prop_sim_new false
% 0.20/0.43 % --inst_orphan_elimination true
% 0.20/0.43 % --inst_learning_loop_flag true
% 0.20/0.43 % --inst_learning_start 3000
% 0.20/0.43 % --inst_learning_factor 2
% 0.20/0.43 % --inst_start_prop_sim_after_learn 3
% 0.20/0.43 % --inst_sel_renew solver
% 0.20/0.43 % --inst_lit_activity_flag true
% 0.20/0.43 % --inst_out_proof true
% 0.20/0.43
% 0.20/0.43 % ------ Resolution Options
% 0.20/0.43
% 0.20/0.43 % --resolution_flag true
% 0.20/0.43 % --res_lit_sel kbo_max
% 0.20/0.43 % --res_to_prop_solver none
% 0.20/0.43 % --res_prop_simpl_new false
% 0.20/0.43 % --res_prop_simpl_given false
% 0.20/0.43 % --res_passive_queue_type priority_queues
% 0.20/0.43 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.43 % --res_passive_queues_freq [15;5]
% 0.20/0.43 % --res_forward_subs full
% 0.20/0.43 % --res_backward_subs full
% 0.20/0.43 % --res_forward_subs_resolution true
% 0.20/0.43 % --res_backward_subs_resolution true
% 0.20/0.43 % --res_orphan_elimination false
% 0.20/0.43 % --res_time_limit 1000.
% 0.20/0.43 % --res_out_proof true
% 0.20/0.43 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_f9ff60.s
% 0.20/0.43 % --modulo true
% 0.20/0.43
% 0.20/0.43 % ------ Combination Options
% 0.20/0.43
% 0.20/0.43 % --comb_res_mult 1000
% 0.20/0.43 % --comb_inst_mult 300
% 0.20/0.43 % ------
% 0.20/0.43
% 0.20/0.43 % ------ Parsing...% successful
% 0.20/0.43
% 0.20/0.43 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 0.20/0.43
% 0.20/0.43 % ------ Proving...
% 0.20/0.43 % ------ Problem Properties
% 0.20/0.43
% 0.20/0.43 %
% 0.20/0.43 % EPR false
% 0.20/0.43 % Horn true
% 0.20/0.43 % Has equality true
% 0.20/0.43
% 0.20/0.43 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 % % ------ Current options:
% 0.20/0.43
% 0.20/0.43 % ------ Input Options
% 0.20/0.43
% 0.20/0.43 % --out_options all
% 0.20/0.43 % --tptp_safe_out true
% 0.20/0.43 % --problem_path ""
% 0.20/0.43 % --include_path ""
% 0.20/0.43 % --clausifier .//eprover
% 0.20/0.43 % --clausifier_options --tstp-format
% 0.20/0.43 % --stdin false
% 0.20/0.43 % --dbg_backtrace false
% 0.20/0.43 % --dbg_dump_prop_clauses false
% 0.20/0.43 % --dbg_dump_prop_clauses_file -
% 0.20/0.43 % --dbg_out_stat false
% 0.20/0.43
% 0.20/0.43 % ------ General Options
% 0.20/0.43
% 0.20/0.43 % --fof false
% 0.20/0.43 % --time_out_real 150.
% 0.20/0.43 % --time_out_prep_mult 0.2
% 0.20/0.43 % --time_out_virtual -1.
% 0.20/0.43 % --schedule none
% 0.20/0.43 % --ground_splitting input
% 0.20/0.43 % --splitting_nvd 16
% 0.20/0.43 % --non_eq_to_eq false
% 0.20/0.43 % --prep_gs_sim true
% 0.20/0.43 % --prep_unflatten false
% 0.20/0.43 % --prep_res_sim true
% 0.20/0.43 % --prep_upred true
% 0.20/0.43 % --res_sim_input true
% 0.20/0.43 % --clause_weak_htbl true
% 0.20/0.43 % --gc_record_bc_elim false
% 0.20/0.43 % --symbol_type_check false
% 0.20/0.43 % --clausify_out false
% 0.20/0.43 % --large_theory_mode false
% 0.20/0.43 % --prep_sem_filter none
% 0.20/0.43 % --prep_sem_filter_out false
% 0.20/0.43 % --preprocessed_out false
% 0.20/0.43 % --sub_typing false
% 0.20/0.43 % --brand_transform false
% 0.20/0.43 % --pure_diseq_elim true
% 0.20/0.43 % --min_unsat_core false
% 0.20/0.43 % --pred_elim true
% 0.20/0.43 % --add_important_lit false
% 0.20/0.43 % --soft_assumptions false
% 0.20/0.43 % --reset_solvers false
% 0.20/0.43 % --bc_imp_inh []
% 0.20/0.43 % --conj_cone_tolerance 1.5
% 0.20/0.43 % --prolific_symb_bound 500
% 0.20/0.43 % --lt_threshold 2000
% 0.20/0.43
% 0.20/0.43 % ------ SAT Options
% 0.20/0.43
% 0.20/0.43 % --sat_mode false
% 0.20/0.43 % --sat_fm_restart_options ""
% 0.20/0.43 % --sat_gr_def false
% 0.20/0.43 % --sat_epr_types true
% 0.20/0.43 % --sat_non_cyclic_types false
% 0.20/0.43 % --sat_finite_models false
% 0.20/0.43 % --sat_fm_lemmas false
% 0.20/0.43 % --sat_fm_prep false
% 0.20/0.43 % --sat_fm_uc_incr true
% 0.20/0.43 % --sat_out_model small
% 0.20/0.43 % --sat_out_clauses false
% 0.20/0.43
% 0.20/0.43 % ------ QBF Options
% 0.20/0.43
% 0.20/0.43 % --qbf_mode false
% 0.20/0.43 % --qbf_elim_univ true
% 0.20/0.43 % --qbf_sk_in true
% 0.20/0.43 % --qbf_pred_elim true
% 0.20/0.43 % --qbf_split 32
% 0.20/0.43
% 0.20/0.43 % ------ BMC1 Options
% 0.20/0.43
% 0.20/0.43 % --bmc1_incremental false
% 0.20/0.43 % --bmc1_axioms reachable_all
% 0.20/0.43 % --bmc1_min_bound 0
% 0.20/0.43 % --bmc1_max_bound -1
% 0.20/0.43 % --bmc1_max_bound_default -1
% 0.20/0.43 % --bmc1_symbol_reachability true
% 0.20/0.43 % --bmc1_property_lemmas false
% 0.20/0.43 % --bmc1_k_induction false
% 0.20/0.43 % --bmc1_non_equiv_states false
% 0.20/0.43 % --bmc1_deadlock false
% 0.20/0.43 % --bmc1_ucm false
% 0.20/0.43 % --bmc1_add_unsat_core none
% 0.20/0.43 % --bmc1_unsat_core_children false
% 0.20/0.43 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.43 % --bmc1_out_stat full
% 0.20/0.43 % --bmc1_ground_init false
% 0.20/0.43 % --bmc1_pre_inst_next_state false
% 0.20/0.43 % --bmc1_pre_inst_state false
% 0.20/0.43 % --bmc1_pre_inst_reach_state false
% 0.20/0.43 % --bmc1_out_unsat_core false
% 0.20/0.43 % --bmc1_aig_witness_out false
% 0.20/0.43 % --bmc1_verbose false
% 0.20/0.43 % --bmc1_dump_clauses_tptp false
% 0.20/0.43 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.43 % --bmc1_dump_file -
% 0.20/0.43 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.43 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.43 % --bmc1_ucm_extend_mode 1
% 0.20/0.43 % --bmc1_ucm_init_mode 2
% 0.20/0.43 % --bmc1_ucm_cone_mode none
% 0.20/0.43 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.43 % --bmc1_ucm_relax_model 4
% 0.20/0.43 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.43 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.43 % --bmc1_ucm_layered_model none
% 0.20/0.43 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.43
% 0.20/0.43 % ------ AIG Options
% 0.20/0.43
% 0.20/0.43 % --aig_mode false
% 0.20/0.43
% 0.20/0.43 % ------ Instantiation Options
% 0.20/0.43
% 0.20/0.43 % --instantiation_flag true
% 0.20/0.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.43 % --inst_solver_per_active 750
% 0.20/0.43 % --inst_solver_calls_frac 0.5
% 0.20/0.43 % --inst_passive_queue_type priority_queues
% 0.20/0.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.43 % --inst_passive_queues_freq [25;2]
% 0.20/0.43 % --inst_dismatching true
% 0.20/0.43 % --inst_eager_unprocessed_to_passive true
% 0.20/0.43 % --inst_prop_sim_given true
% 150.20/150.42 % --inst_prop_sim_new false
% 150.20/150.42 % --inst_orphan_elimination true
% 150.20/150.42 % --inst_learning_loop_flag true
% 150.20/150.42 % --inst_learning_start 3000
% 150.20/150.42 % --inst_learning_factor 2
% 150.20/150.42 % --inst_start_prop_sim_after_learn 3
% 150.20/150.42 % --inst_sel_renew solver
% 150.20/150.42 % --inst_lit_activity_flag true
% 150.20/150.42 % --inst_out_proof true
% 150.20/150.42
% 150.20/150.42 % ------ Resolution Options
% 150.20/150.42
% 150.20/150.42 % --resolution_flag true
% 150.20/150.42 % --res_lit_sel kbo_max
% 150.20/150.42 % --res_to_prop_solver none
% 150.20/150.42 % --res_prop_simpl_new false
% 150.20/150.42 % --res_prop_simpl_given false
% 150.20/150.42 % --res_passive_queue_type priority_queues
% 150.20/150.42 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 150.20/150.42 % --res_passive_queues_freq [15;5]
% 150.20/150.42 % --res_forward_subs full
% 150.20/150.42 % --res_backward_subs full
% 150.20/150.42 % --res_forward_subs_resolution true
% 150.20/150.42 % --res_backward_subs_resolution true
% 150.20/150.42 % --res_orphan_elimination false
% 150.20/150.42 % --res_time_limit 1000.
% 150.20/150.42 % --res_out_proof true
% 150.20/150.42 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_f9ff60.s
% 150.20/150.42 % --modulo true
% 150.20/150.42
% 150.20/150.42 % ------ Combination Options
% 150.20/150.42
% 150.20/150.42 % --comb_res_mult 1000
% 150.20/150.42 % --comb_inst_mult 300
% 150.20/150.42 % ------
% 150.20/150.42
% 150.20/150.42
% 150.20/150.42
% 150.20/150.42 % ------ Proving...
% 150.20/150.42 %
% 150.20/150.42
% 150.20/150.42
% 150.20/150.42 % Time Out Real
% 150.20/150.42
% 150.20/150.42 % ------ Statistics
% 150.20/150.42
% 150.20/150.42 % ------ General
% 150.20/150.42
% 150.20/150.42 % num_of_input_clauses: 50
% 150.20/150.42 % num_of_input_neg_conjectures: 1
% 150.20/150.42 % num_of_splits: 0
% 150.20/150.42 % num_of_split_atoms: 0
% 150.20/150.42 % num_of_sem_filtered_clauses: 0
% 150.20/150.42 % num_of_subtypes: 0
% 150.20/150.42 % monotx_restored_types: 0
% 150.20/150.42 % sat_num_of_epr_types: 0
% 150.20/150.42 % sat_num_of_non_cyclic_types: 0
% 150.20/150.42 % sat_guarded_non_collapsed_types: 0
% 150.20/150.42 % is_epr: 0
% 150.20/150.42 % is_horn: 1
% 150.20/150.42 % has_eq: 1
% 150.20/150.42 % num_pure_diseq_elim: 0
% 150.20/150.42 % simp_replaced_by: 0
% 150.20/150.42 % res_preprocessed: 6
% 150.20/150.42 % prep_upred: 0
% 150.20/150.42 % prep_unflattend: 0
% 150.20/150.42 % pred_elim_cands: 1
% 150.20/150.42 % pred_elim: 0
% 150.20/150.42 % pred_elim_cl: 0
% 150.20/150.42 % pred_elim_cycles: 1
% 150.20/150.42 % forced_gc_time: 0
% 150.20/150.42 % gc_basic_clause_elim: 0
% 150.20/150.42 % parsing_time: 0.002
% 150.20/150.42 % sem_filter_time: 0.
% 150.20/150.42 % pred_elim_time: 0.
% 150.20/150.42 % out_proof_time: 0.
% 150.20/150.42 % monotx_time: 0.
% 150.20/150.42 % subtype_inf_time: 0.
% 150.20/150.42 % unif_index_cands_time: 0.554
% 150.20/150.42 % unif_index_add_time: 0.121
% 150.20/150.42 % total_time: 150.017
% 150.20/150.42 % num_of_symbols: 37
% 150.20/150.42 % num_of_terms: 180479
% 150.20/150.42
% 150.20/150.42 % ------ Propositional Solver
% 150.20/150.42
% 150.20/150.42 % prop_solver_calls: 52
% 150.20/150.42 % prop_fast_solver_calls: 15
% 150.20/150.42 % prop_num_of_clauses: 49051
% 150.20/150.42 % prop_preprocess_simplified: 93410
% 150.20/150.42 % prop_fo_subsumed: 0
% 150.20/150.42 % prop_solver_time: 0.036
% 150.20/150.42 % prop_fast_solver_time: 0.
% 150.20/150.42 % prop_unsat_core_time: 0.
% 150.20/150.42
% 150.20/150.42 % ------ QBF
% 150.20/150.42
% 150.20/150.42 % qbf_q_res: 0
% 150.20/150.42 % qbf_num_tautologies: 0
% 150.20/150.42 % qbf_prep_cycles: 0
% 150.20/150.42
% 150.20/150.42 % ------ BMC1
% 150.20/150.42
% 150.20/150.42 % bmc1_current_bound: -1
% 150.20/150.42 % bmc1_last_solved_bound: -1
% 150.20/150.42 % bmc1_unsat_core_size: -1
% 150.20/150.42 % bmc1_unsat_core_parents_size: -1
% 150.20/150.42 % bmc1_merge_next_fun: 0
% 150.20/150.42 % bmc1_unsat_core_clauses_time: 0.
% 150.20/150.42
% 150.20/150.42 % ------ Instantiation
% 150.20/150.42
% 150.20/150.42 % inst_num_of_clauses: 11356
% 150.20/150.42 % inst_num_in_passive: 8078
% 150.20/150.42 % inst_num_in_active: 2858
% 150.20/150.42 % inst_num_in_unprocessed: 319
% 150.20/150.42 % inst_num_of_loops: 3019
% 150.20/150.44 % inst_num_of_learning_restarts: 2
% 150.20/150.44 % inst_num_moves_active_passive: 61
% 150.20/150.44 % inst_lit_activity: 1551
% 150.20/150.44 % inst_lit_activity_moves: 0
% 150.20/150.44 % inst_num_tautologies: 98
% 150.20/150.44 % inst_num_prop_implied: 0
% 150.20/150.44 % inst_num_existing_simplified: 0
% 150.20/150.44 % inst_num_eq_res_simplified: 0
% 150.20/150.44 % inst_num_child_elim: 0
% 150.20/150.44 % inst_num_of_dismatching_blockings: 27805
% 150.20/150.44 % inst_num_of_non_proper_insts: 31100
% 150.20/150.44 % inst_num_of_duplicates: 6425
% 150.20/150.44 % inst_inst_num_from_inst_to_res: 0
% 150.20/150.44 % inst_dismatching_checking_time: 0.781
% 150.20/150.44
% 150.20/150.44 % ------ Resolution
% 150.20/150.44
% 150.20/150.44 % res_num_of_clauses: 2027029
% 150.20/150.44 % res_num_in_passive: 2001842
% 150.20/150.44 % res_num_in_active: 35213
% 150.20/150.44 % res_num_of_loops: 41000
% 150.20/150.44 % res_forward_subset_subsumed: 158882
% 150.20/150.44 % res_backward_subset_subsumed: 10776
% 150.20/150.44 % res_forward_subsumed: 4360
% 150.20/150.44 % res_backward_subsumed: 714
% 150.20/150.44 % res_forward_subsumption_resolution: 3223
% 150.20/150.44 % res_backward_subsumption_resolution: 29
% 150.20/150.44 % res_clause_to_clause_subsumption: 14092607
% 150.20/150.44 % res_orphan_elimination: 0
% 150.20/150.44 % res_tautology_del: 421
% 150.20/150.44 % res_num_eq_res_simplified: 0
% 150.20/150.44 % res_num_sel_changes: 0
% 150.20/150.44 % res_moves_from_active_to_pass: 0
% 150.20/150.44
% 150.20/150.44 % Status Unknown
% 150.20/150.48 % Orienting using strategy ClausalAll
% 150.20/150.48 % Orientation found
% 150.20/150.48 % 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_f9ff60.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_9e39da.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_898f1a | grep -v "SZS"
% 150.29/150.49
% 150.29/150.49 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 150.29/150.49
% 150.29/150.49 %
% 150.29/150.49 % ------ iProver source info
% 150.29/150.49
% 150.29/150.49 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 150.29/150.49 % git: non_committed_changes: true
% 150.29/150.49 % git: last_make_outside_of_git: true
% 150.29/150.49
% 150.29/150.49 %
% 150.29/150.49 % ------ Input Options
% 150.29/150.49
% 150.29/150.49 % --out_options all
% 150.29/150.49 % --tptp_safe_out true
% 150.29/150.49 % --problem_path ""
% 150.29/150.49 % --include_path ""
% 150.29/150.49 % --clausifier .//eprover
% 150.29/150.49 % --clausifier_options --tstp-format
% 150.29/150.49 % --stdin false
% 150.29/150.49 % --dbg_backtrace false
% 150.29/150.49 % --dbg_dump_prop_clauses false
% 150.29/150.49 % --dbg_dump_prop_clauses_file -
% 150.29/150.49 % --dbg_out_stat false
% 150.29/150.49
% 150.29/150.49 % ------ General Options
% 150.29/150.49
% 150.29/150.49 % --fof false
% 150.29/150.49 % --time_out_real 150.
% 150.29/150.49 % --time_out_prep_mult 0.2
% 150.29/150.49 % --time_out_virtual -1.
% 150.29/150.49 % --schedule none
% 150.29/150.49 % --ground_splitting input
% 150.29/150.49 % --splitting_nvd 16
% 150.29/150.49 % --non_eq_to_eq false
% 150.29/150.49 % --prep_gs_sim true
% 150.29/150.49 % --prep_unflatten false
% 150.29/150.49 % --prep_res_sim true
% 150.29/150.49 % --prep_upred true
% 150.29/150.49 % --res_sim_input true
% 150.29/150.49 % --clause_weak_htbl true
% 150.29/150.49 % --gc_record_bc_elim false
% 150.29/150.49 % --symbol_type_check false
% 150.29/150.49 % --clausify_out false
% 150.29/150.49 % --large_theory_mode false
% 150.29/150.49 % --prep_sem_filter none
% 150.29/150.49 % --prep_sem_filter_out false
% 150.29/150.49 % --preprocessed_out false
% 150.29/150.49 % --sub_typing false
% 150.29/150.49 % --brand_transform false
% 150.29/150.49 % --pure_diseq_elim true
% 150.29/150.49 % --min_unsat_core false
% 150.29/150.49 % --pred_elim true
% 150.29/150.49 % --add_important_lit false
% 150.29/150.49 % --soft_assumptions false
% 150.29/150.49 % --reset_solvers false
% 150.29/150.49 % --bc_imp_inh []
% 150.29/150.49 % --conj_cone_tolerance 1.5
% 150.29/150.49 % --prolific_symb_bound 500
% 150.29/150.49 % --lt_threshold 2000
% 150.29/150.49
% 150.29/150.49 % ------ SAT Options
% 150.29/150.49
% 150.29/150.49 % --sat_mode false
% 150.29/150.49 % --sat_fm_restart_options ""
% 150.29/150.49 % --sat_gr_def false
% 150.29/150.49 % --sat_epr_types true
% 150.29/150.49 % --sat_non_cyclic_types false
% 150.29/150.49 % --sat_finite_models false
% 150.29/150.49 % --sat_fm_lemmas false
% 150.29/150.49 % --sat_fm_prep false
% 150.29/150.49 % --sat_fm_uc_incr true
% 150.29/150.49 % --sat_out_model small
% 150.29/150.49 % --sat_out_clauses false
% 150.29/150.49
% 150.29/150.49 % ------ QBF Options
% 150.29/150.49
% 150.29/150.49 % --qbf_mode false
% 150.29/150.49 % --qbf_elim_univ true
% 150.29/150.49 % --qbf_sk_in true
% 150.29/150.49 % --qbf_pred_elim true
% 150.29/150.49 % --qbf_split 32
% 150.29/150.49
% 150.29/150.49 % ------ BMC1 Options
% 150.29/150.49
% 150.29/150.49 % --bmc1_incremental false
% 150.29/150.49 % --bmc1_axioms reachable_all
% 150.29/150.49 % --bmc1_min_bound 0
% 150.29/150.49 % --bmc1_max_bound -1
% 150.29/150.49 % --bmc1_max_bound_default -1
% 150.29/150.49 % --bmc1_symbol_reachability true
% 150.29/150.49 % --bmc1_property_lemmas false
% 150.29/150.49 % --bmc1_k_induction false
% 150.29/150.49 % --bmc1_non_equiv_states false
% 150.29/150.49 % --bmc1_deadlock false
% 150.29/150.49 % --bmc1_ucm false
% 150.29/150.49 % --bmc1_add_unsat_core none
% 150.29/150.49 % --bmc1_unsat_core_children false
% 150.29/150.49 % --bmc1_unsat_core_extrapolate_axioms false
% 150.29/150.49 % --bmc1_out_stat full
% 150.29/150.49 % --bmc1_ground_init false
% 150.29/150.49 % --bmc1_pre_inst_next_state false
% 150.29/150.49 % --bmc1_pre_inst_state false
% 150.29/150.49 % --bmc1_pre_inst_reach_state false
% 150.29/150.49 % --bmc1_out_unsat_core false
% 150.29/150.49 % --bmc1_aig_witness_out false
% 150.29/150.49 % --bmc1_verbose false
% 150.29/150.49 % --bmc1_dump_clauses_tptp false
% 150.29/150.50 % --bmc1_dump_unsat_core_tptp false
% 150.29/150.50 % --bmc1_dump_file -
% 150.29/150.50 % --bmc1_ucm_expand_uc_limit 128
% 150.29/150.50 % --bmc1_ucm_n_expand_iterations 6
% 150.29/150.50 % --bmc1_ucm_extend_mode 1
% 150.29/150.50 % --bmc1_ucm_init_mode 2
% 150.29/150.50 % --bmc1_ucm_cone_mode none
% 150.29/150.50 % --bmc1_ucm_reduced_relation_type 0
% 150.29/150.50 % --bmc1_ucm_relax_model 4
% 150.29/150.50 % --bmc1_ucm_full_tr_after_sat true
% 150.29/150.50 % --bmc1_ucm_expand_neg_assumptions false
% 150.29/150.50 % --bmc1_ucm_layered_model none
% 150.29/150.50 % --bmc1_ucm_max_lemma_size 10
% 150.29/150.50
% 150.29/150.50 % ------ AIG Options
% 150.29/150.50
% 150.29/150.50 % --aig_mode false
% 150.29/150.50
% 150.29/150.50 % ------ Instantiation Options
% 150.29/150.50
% 150.29/150.50 % --instantiation_flag true
% 150.29/150.50 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 150.29/150.50 % --inst_solver_per_active 750
% 150.29/150.50 % --inst_solver_calls_frac 0.5
% 150.29/150.50 % --inst_passive_queue_type priority_queues
% 150.29/150.50 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 150.29/150.50 % --inst_passive_queues_freq [25;2]
% 150.29/150.50 % --inst_dismatching true
% 150.29/150.50 % --inst_eager_unprocessed_to_passive true
% 150.29/150.50 % --inst_prop_sim_given true
% 150.29/150.50 % --inst_prop_sim_new false
% 150.29/150.50 % --inst_orphan_elimination true
% 150.29/150.50 % --inst_learning_loop_flag true
% 150.29/150.50 % --inst_learning_start 3000
% 150.29/150.50 % --inst_learning_factor 2
% 150.29/150.50 % --inst_start_prop_sim_after_learn 3
% 150.29/150.50 % --inst_sel_renew solver
% 150.29/150.50 % --inst_lit_activity_flag true
% 150.29/150.50 % --inst_out_proof true
% 150.29/150.50
% 150.29/150.50 % ------ Resolution Options
% 150.29/150.50
% 150.29/150.50 % --resolution_flag true
% 150.29/150.50 % --res_lit_sel kbo_max
% 150.29/150.50 % --res_to_prop_solver none
% 150.29/150.50 % --res_prop_simpl_new false
% 150.29/150.50 % --res_prop_simpl_given false
% 150.29/150.50 % --res_passive_queue_type priority_queues
% 150.29/150.50 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 150.29/150.50 % --res_passive_queues_freq [15;5]
% 150.29/150.50 % --res_forward_subs full
% 150.29/150.50 % --res_backward_subs full
% 150.29/150.50 % --res_forward_subs_resolution true
% 150.29/150.50 % --res_backward_subs_resolution true
% 150.29/150.50 % --res_orphan_elimination false
% 150.29/150.50 % --res_time_limit 1000.
% 150.29/150.50 % --res_out_proof true
% 150.29/150.50 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_f9ff60.s
% 150.29/150.50 % --modulo true
% 150.29/150.50
% 150.29/150.50 % ------ Combination Options
% 150.29/150.50
% 150.29/150.50 % --comb_res_mult 1000
% 150.29/150.50 % --comb_inst_mult 300
% 150.29/150.50 % ------
% 150.29/150.50
% 150.29/150.50 % ------ Parsing...% successful
% 150.29/150.50
% 150.29/150.50 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 150.29/150.50
% 150.29/150.50 % ------ Proving...
% 150.29/150.50 % ------ Problem Properties
% 150.29/150.50
% 150.29/150.50 %
% 150.29/150.50 % EPR false
% 150.29/150.50 % Horn true
% 150.29/150.50 % Has equality true
% 150.29/150.50
% 150.29/150.50 % % ------ Input Options Time Limit: Unbounded
% 150.29/150.50
% 150.29/150.50
% 150.29/150.50 % % ------ Current options:
% 150.29/150.50
% 150.29/150.50 % ------ Input Options
% 150.29/150.50
% 150.29/150.50 % --out_options all
% 150.29/150.50 % --tptp_safe_out true
% 150.29/150.50 % --problem_path ""
% 150.29/150.50 % --include_path ""
% 150.29/150.50 % --clausifier .//eprover
% 150.29/150.50 % --clausifier_options --tstp-format
% 150.29/150.50 % --stdin false
% 150.29/150.50 % --dbg_backtrace false
% 150.29/150.50 % --dbg_dump_prop_clauses false
% 150.29/150.50 % --dbg_dump_prop_clauses_file -
% 150.29/150.50 % --dbg_out_stat false
% 150.29/150.50
% 150.29/150.50 % ------ General Options
% 150.29/150.50
% 150.29/150.50 % --fof false
% 150.29/150.50 % --time_out_real 150.
% 150.29/150.50 % --time_out_prep_mult 0.2
% 150.29/150.50 % --time_out_virtual -1.
% 150.29/150.50 % --schedule none
% 150.29/150.50 % --ground_splitting input
% 150.29/150.50 % --splitting_nvd 16
% 150.29/150.50 % --non_eq_to_eq false
% 150.29/150.50 % --prep_gs_sim true
% 150.29/150.50 % --prep_unflatten false
% 150.29/150.50 % --prep_res_sim true
% 150.29/150.50 % --prep_upred true
% 150.29/150.50 % --res_sim_input true
% 150.29/150.50 % --clause_weak_htbl true
% 150.29/150.50 % --gc_record_bc_elim false
% 150.29/150.50 % --symbol_type_check false
% 150.29/150.50 % --clausify_out false
% 150.29/150.50 % --large_theory_mode false
% 150.29/150.50 % --prep_sem_filter none
% 150.29/150.50 % --prep_sem_filter_out false
% 150.29/150.50 % --preprocessed_out false
% 150.29/150.50 % --sub_typing false
% 150.29/150.50 % --brand_transform false
% 150.29/150.50 % --pure_diseq_elim true
% 150.29/150.50 % --min_unsat_core false
% 150.29/150.50 % --pred_elim true
% 150.29/150.50 % --add_important_lit false
% 150.29/150.50 % --soft_assumptions false
% 150.29/150.50 % --reset_solvers false
% 150.29/150.50 % --bc_imp_inh []
% 150.29/150.50 % --conj_cone_tolerance 1.5
% 150.29/150.50 % --prolific_symb_bound 500
% 150.29/150.50 % --lt_threshold 2000
% 150.29/150.50
% 150.29/150.50 % ------ SAT Options
% 150.29/150.50
% 150.29/150.50 % --sat_mode false
% 150.29/150.50 % --sat_fm_restart_options ""
% 150.29/150.50 % --sat_gr_def false
% 150.29/150.50 % --sat_epr_types true
% 150.29/150.50 % --sat_non_cyclic_types false
% 150.29/150.50 % --sat_finite_models false
% 150.29/150.50 % --sat_fm_lemmas false
% 150.29/150.50 % --sat_fm_prep false
% 150.29/150.50 % --sat_fm_uc_incr true
% 150.29/150.50 % --sat_out_model small
% 150.29/150.50 % --sat_out_clauses false
% 150.29/150.50
% 150.29/150.50 % ------ QBF Options
% 150.29/150.50
% 150.29/150.50 % --qbf_mode false
% 150.29/150.50 % --qbf_elim_univ true
% 150.29/150.50 % --qbf_sk_in true
% 150.29/150.50 % --qbf_pred_elim true
% 150.29/150.50 % --qbf_split 32
% 150.29/150.50
% 150.29/150.50 % ------ BMC1 Options
% 150.29/150.50
% 150.29/150.50 % --bmc1_incremental false
% 150.29/150.50 % --bmc1_axioms reachable_all
% 150.29/150.50 % --bmc1_min_bound 0
% 150.29/150.50 % --bmc1_max_bound -1
% 150.29/150.50 % --bmc1_max_bound_default -1
% 150.29/150.50 % --bmc1_symbol_reachability true
% 150.29/150.50 % --bmc1_property_lemmas false
% 150.29/150.50 % --bmc1_k_induction false
% 150.29/150.50 % --bmc1_non_equiv_states false
% 150.29/150.50 % --bmc1_deadlock false
% 150.29/150.50 % --bmc1_ucm false
% 150.29/150.50 % --bmc1_add_unsat_core none
% 150.29/150.50 % --bmc1_unsat_core_children false
% 150.29/150.50 % --bmc1_unsat_core_extrapolate_axioms false
% 150.29/150.50 % --bmc1_out_stat full
% 150.29/150.50 % --bmc1_ground_init false
% 150.29/150.50 % --bmc1_pre_inst_next_state false
% 150.29/150.50 % --bmc1_pre_inst_state false
% 150.29/150.50 % --bmc1_pre_inst_reach_state false
% 150.29/150.50 % --bmc1_out_unsat_core false
% 150.29/150.50 % --bmc1_aig_witness_out false
% 150.29/150.50 % --bmc1_verbose false
% 150.29/150.50 % --bmc1_dump_clauses_tptp false
% 150.29/150.50 % --bmc1_dump_unsat_core_tptp false
% 150.29/150.50 % --bmc1_dump_file -
% 150.29/150.50 % --bmc1_ucm_expand_uc_limit 128
% 150.29/150.50 % --bmc1_ucm_n_expand_iterations 6
% 150.29/150.50 % --bmc1_ucm_extend_mode 1
% 150.29/150.50 % --bmc1_ucm_init_mode 2
% 150.29/150.50 % --bmc1_ucm_cone_mode none
% 150.29/150.50 % --bmc1_ucm_reduced_relation_type 0
% 150.29/150.50 % --bmc1_ucm_relax_model 4
% 150.29/150.50 % --bmc1_ucm_full_tr_after_sat true
% 150.29/150.50 % --bmc1_ucm_expand_neg_assumptions false
% 150.29/150.50 % --bmc1_ucm_layered_model none
% 150.29/150.50 % --bmc1_ucm_max_lemma_size 10
% 150.29/150.50
% 150.29/150.50 % ------ AIG Options
% 150.29/150.50
% 150.29/150.50 % --aig_mode false
% 150.29/150.50
% 150.29/150.50 % ------ Instantiation Options
% 150.29/150.50
% 150.29/150.50 % --instantiation_flag true
% 150.29/150.50 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 150.29/150.50 % --inst_solver_per_active 750
% 150.29/150.50 % --inst_solver_calls_frac 0.5
% 150.29/150.50 % --inst_passive_queue_type priority_queues
% 150.29/150.50 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 150.29/150.50 % --inst_passive_queues_freq [25;2]
% 150.29/150.50 % --inst_dismatching true
% 150.29/150.50 % --inst_eager_unprocessed_to_passive true
% 150.29/150.50 % --inst_prop_sim_given true
% 178.24/178.56 % --inst_prop_sim_new false
% 178.24/178.56 % --inst_orphan_elimination true
% 178.24/178.56 % --inst_learning_loop_flag true
% 178.24/178.56 % --inst_learning_start 3000
% 178.24/178.56 % --inst_learning_factor 2
% 178.24/178.56 % --inst_start_prop_sim_after_learn 3
% 178.24/178.56 % --inst_sel_renew solver
% 178.24/178.56 % --inst_lit_activity_flag true
% 178.24/178.56 % --inst_out_proof true
% 178.24/178.56
% 178.24/178.56 % ------ Resolution Options
% 178.24/178.56
% 178.24/178.56 % --resolution_flag true
% 178.24/178.56 % --res_lit_sel kbo_max
% 178.24/178.56 % --res_to_prop_solver none
% 178.24/178.56 % --res_prop_simpl_new false
% 178.24/178.56 % --res_prop_simpl_given false
% 178.24/178.56 % --res_passive_queue_type priority_queues
% 178.24/178.56 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 178.24/178.56 % --res_passive_queues_freq [15;5]
% 178.24/178.56 % --res_forward_subs full
% 178.24/178.56 % --res_backward_subs full
% 178.24/178.56 % --res_forward_subs_resolution true
% 178.24/178.56 % --res_backward_subs_resolution true
% 178.24/178.56 % --res_orphan_elimination false
% 178.24/178.56 % --res_time_limit 1000.
% 178.24/178.56 % --res_out_proof true
% 178.24/178.56 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_f9ff60.s
% 178.24/178.56 % --modulo true
% 178.24/178.56
% 178.24/178.56 % ------ Combination Options
% 178.24/178.56
% 178.24/178.56 % --comb_res_mult 1000
% 178.24/178.56 % --comb_inst_mult 300
% 178.24/178.56 % ------
% 178.24/178.56
% 178.24/178.56
% 178.24/178.56
% 178.24/178.56 % ------ Proving...
% 178.24/178.56 %
% 178.24/178.56
% 178.24/178.56
% 178.24/178.56 % Resolution empty clause
% 178.24/178.56
% 178.24/178.56 % ------ Statistics
% 178.24/178.56
% 178.24/178.56 % ------ General
% 178.24/178.56
% 178.24/178.56 % num_of_input_clauses: 50
% 178.24/178.56 % num_of_input_neg_conjectures: 1
% 178.24/178.56 % num_of_splits: 0
% 178.24/178.56 % num_of_split_atoms: 0
% 178.24/178.56 % num_of_sem_filtered_clauses: 0
% 178.24/178.56 % num_of_subtypes: 0
% 178.24/178.56 % monotx_restored_types: 0
% 178.24/178.56 % sat_num_of_epr_types: 0
% 178.24/178.56 % sat_num_of_non_cyclic_types: 0
% 178.24/178.56 % sat_guarded_non_collapsed_types: 0
% 178.24/178.56 % is_epr: 0
% 178.24/178.56 % is_horn: 1
% 178.24/178.56 % has_eq: 1
% 178.24/178.56 % num_pure_diseq_elim: 0
% 178.24/178.56 % simp_replaced_by: 0
% 178.24/178.56 % res_preprocessed: 6
% 178.24/178.56 % prep_upred: 0
% 178.24/178.56 % prep_unflattend: 0
% 178.24/178.56 % pred_elim_cands: 1
% 178.24/178.56 % pred_elim: 0
% 178.24/178.56 % pred_elim_cl: 0
% 178.24/178.56 % pred_elim_cycles: 1
% 178.24/178.56 % forced_gc_time: 0
% 178.24/178.56 % gc_basic_clause_elim: 0
% 178.24/178.56 % parsing_time: 0.001
% 178.24/178.56 % sem_filter_time: 0.
% 178.24/178.56 % pred_elim_time: 0.
% 178.24/178.56 % out_proof_time: 0.003
% 178.24/178.56 % monotx_time: 0.
% 178.24/178.56 % subtype_inf_time: 0.
% 178.24/178.56 % unif_index_cands_time: 0.223
% 178.24/178.56 % unif_index_add_time: 0.045
% 178.24/178.56 % total_time: 28.075
% 178.24/178.56 % num_of_symbols: 37
% 178.24/178.56 % num_of_terms: 152668
% 178.24/178.56
% 178.24/178.56 % ------ Propositional Solver
% 178.24/178.56
% 178.24/178.56 % prop_solver_calls: 33
% 178.24/178.56 % prop_fast_solver_calls: 15
% 178.24/178.56 % prop_num_of_clauses: 21696
% 178.24/178.56 % prop_preprocess_simplified: 34799
% 178.24/178.56 % prop_fo_subsumed: 0
% 178.24/178.56 % prop_solver_time: 0.011
% 178.24/178.56 % prop_fast_solver_time: 0.
% 178.24/178.56 % prop_unsat_core_time: 0.
% 178.24/178.56
% 178.24/178.56 % ------ QBF
% 178.24/178.56
% 178.24/178.56 % qbf_q_res: 0
% 178.24/178.56 % qbf_num_tautologies: 0
% 178.24/178.56 % qbf_prep_cycles: 0
% 178.24/178.56
% 178.24/178.56 % ------ BMC1
% 178.24/178.56
% 178.24/178.56 % bmc1_current_bound: -1
% 178.24/178.56 % bmc1_last_solved_bound: -1
% 178.24/178.56 % bmc1_unsat_core_size: -1
% 178.24/178.56 % bmc1_unsat_core_parents_size: -1
% 178.24/178.56 % bmc1_merge_next_fun: 0
% 178.24/178.56 % bmc1_unsat_core_clauses_time: 0.
% 178.24/178.56
% 178.24/178.56 % ------ Instantiation
% 178.24/178.56
% 178.24/178.56 % inst_num_of_clauses: 4628
% 178.24/178.56 % inst_num_in_passive: 2120
% 178.24/178.56 % inst_num_in_active: 1390
% 178.24/178.56 % inst_num_in_unprocessed: 1015
% 178.24/178.56 % inst_num_of_loops: 1499
% 178.31/178.56 % inst_num_of_learning_restarts: 1
% 178.31/178.56 % inst_num_moves_active_passive: 5
% 178.31/178.56 % inst_lit_activity: 677
% 178.31/178.56 % inst_lit_activity_moves: 0
% 178.31/178.56 % inst_num_tautologies: 103
% 178.31/178.56 % inst_num_prop_implied: 0
% 178.31/178.56 % inst_num_existing_simplified: 0
% 178.31/178.56 % inst_num_eq_res_simplified: 0
% 178.31/178.56 % inst_num_child_elim: 0
% 178.31/178.56 % inst_num_of_dismatching_blockings: 5229
% 178.31/178.56 % inst_num_of_non_proper_insts: 10428
% 178.31/178.56 % inst_num_of_duplicates: 2931
% 178.31/178.56 % inst_inst_num_from_inst_to_res: 0
% 178.31/178.56 % inst_dismatching_checking_time: 0.128
% 178.31/178.56
% 178.31/178.56 % ------ Resolution
% 178.31/178.56
% 178.31/178.56 % res_num_of_clauses: 546845
% 178.31/178.56 % res_num_in_passive: 564266
% 178.31/178.56 % res_num_in_active: 10190
% 178.31/178.56 % res_num_of_loops: 15271
% 178.31/178.56 % res_forward_subset_subsumed: 196042
% 178.31/178.56 % res_backward_subset_subsumed: 29010
% 178.31/178.56 % res_forward_subsumed: 3244
% 178.31/178.56 % res_backward_subsumed: 680
% 178.31/178.56 % res_forward_subsumption_resolution: 300
% 178.31/178.56 % res_backward_subsumption_resolution: 169
% 178.31/178.56 % res_clause_to_clause_subsumption: 92736
% 178.31/178.56 % res_orphan_elimination: 0
% 178.31/178.56 % res_tautology_del: 3221
% 178.31/178.56 % res_num_eq_res_simplified: 0
% 178.31/178.56 % res_num_sel_changes: 0
% 178.31/178.56 % res_moves_from_active_to_pass: 0
% 178.31/178.56
% 178.31/178.56 % Status Unsatisfiable
% 178.31/178.56 % SZS status Unsatisfiable
% 178.31/178.56 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------