TSTP Solution File: CAT003-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : CAT003-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n024.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:27 EDT 2022
% Result : Unsatisfiable 21.70s 21.91s
% Output : CNFRefutation 21.70s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named input)
% Comments :
%------------------------------------------------------------------------------
% Axioms transformation by autotheo
% Orienting (remaining) axiom formulas using strategy Equiv(ClausalAll)
% Orienting axioms whose shape is orientable
cnf(product_on_codomain,axiom,
product(codomain(X),X,X),
input ).
fof(product_on_codomain_0,plain,
! [X] :
( product(codomain(X),X,X)
| $false ),
inference(orientation,[status(thm)],[product_on_codomain]) ).
cnf(product_on_domain,axiom,
product(X,domain(X),X),
input ).
fof(product_on_domain_0,plain,
! [X] :
( product(X,domain(X),X)
| $false ),
inference(orientation,[status(thm)],[product_on_domain]) ).
cnf(mapping_from_codomain_of_x_to_x,axiom,
defined(codomain(X),X),
input ).
fof(mapping_from_codomain_of_x_to_x_0,plain,
! [X] :
( defined(codomain(X),X)
| $false ),
inference(orientation,[status(thm)],[mapping_from_codomain_of_x_to_x]) ).
cnf(mapping_from_x_to_its_domain,axiom,
defined(X,domain(X)),
input ).
fof(mapping_from_x_to_its_domain_0,plain,
! [X] :
( defined(X,domain(X))
| $false ),
inference(orientation,[status(thm)],[mapping_from_x_to_its_domain]) ).
cnf(codomain_is_an_identity_map,axiom,
identity_map(codomain(X)),
input ).
fof(codomain_is_an_identity_map_0,plain,
! [X] :
( identity_map(codomain(X))
| $false ),
inference(orientation,[status(thm)],[codomain_is_an_identity_map]) ).
cnf(domain_is_an_identity_map,axiom,
identity_map(domain(X)),
input ).
fof(domain_is_an_identity_map_0,plain,
! [X] :
( identity_map(domain(X))
| $false ),
inference(orientation,[status(thm)],[domain_is_an_identity_map]) ).
fof(def_lhs_atom1,axiom,
! [X] :
( lhs_atom1(X)
<=> identity_map(domain(X)) ),
inference(definition,[],]) ).
fof(to_be_clausified_0,plain,
! [X] :
( lhs_atom1(X)
| $false ),
inference(fold_definition,[status(thm)],[domain_is_an_identity_map_0,def_lhs_atom1]) ).
fof(def_lhs_atom2,axiom,
! [X] :
( lhs_atom2(X)
<=> identity_map(codomain(X)) ),
inference(definition,[],]) ).
fof(to_be_clausified_1,plain,
! [X] :
( lhs_atom2(X)
| $false ),
inference(fold_definition,[status(thm)],[codomain_is_an_identity_map_0,def_lhs_atom2]) ).
fof(def_lhs_atom3,axiom,
! [X] :
( lhs_atom3(X)
<=> defined(X,domain(X)) ),
inference(definition,[],]) ).
fof(to_be_clausified_2,plain,
! [X] :
( lhs_atom3(X)
| $false ),
inference(fold_definition,[status(thm)],[mapping_from_x_to_its_domain_0,def_lhs_atom3]) ).
fof(def_lhs_atom4,axiom,
! [X] :
( lhs_atom4(X)
<=> defined(codomain(X),X) ),
inference(definition,[],]) ).
fof(to_be_clausified_3,plain,
! [X] :
( lhs_atom4(X)
| $false ),
inference(fold_definition,[status(thm)],[mapping_from_codomain_of_x_to_x_0,def_lhs_atom4]) ).
fof(def_lhs_atom5,axiom,
! [X] :
( lhs_atom5(X)
<=> product(X,domain(X),X) ),
inference(definition,[],]) ).
fof(to_be_clausified_4,plain,
! [X] :
( lhs_atom5(X)
| $false ),
inference(fold_definition,[status(thm)],[product_on_domain_0,def_lhs_atom5]) ).
fof(def_lhs_atom6,axiom,
! [X] :
( lhs_atom6(X)
<=> product(codomain(X),X,X) ),
inference(definition,[],]) ).
fof(to_be_clausified_5,plain,
! [X] :
( lhs_atom6(X)
| $false ),
inference(fold_definition,[status(thm)],[product_on_codomain_0,def_lhs_atom6]) ).
% Start CNF derivation
fof(c_0_0,axiom,
! [X1] :
( lhs_atom6(X1)
| ~ $true ),
file('<stdin>',to_be_clausified_5) ).
fof(c_0_1,axiom,
! [X1] :
( lhs_atom5(X1)
| ~ $true ),
file('<stdin>',to_be_clausified_4) ).
fof(c_0_2,axiom,
! [X1] :
( lhs_atom4(X1)
| ~ $true ),
file('<stdin>',to_be_clausified_3) ).
fof(c_0_3,axiom,
! [X1] :
( lhs_atom3(X1)
| ~ $true ),
file('<stdin>',to_be_clausified_2) ).
fof(c_0_4,axiom,
! [X1] :
( lhs_atom2(X1)
| ~ $true ),
file('<stdin>',to_be_clausified_1) ).
fof(c_0_5,axiom,
! [X1] :
( lhs_atom1(X1)
| ~ $true ),
file('<stdin>',to_be_clausified_0) ).
fof(c_0_6,plain,
! [X1] : lhs_atom6(X1),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_7,plain,
! [X1] : lhs_atom5(X1),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_8,plain,
! [X1] : lhs_atom4(X1),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_9,plain,
! [X1] : lhs_atom3(X1),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_10,plain,
! [X1] : lhs_atom2(X1),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_11,plain,
! [X1] : lhs_atom1(X1),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_12,plain,
! [X2] : lhs_atom6(X2),
inference(variable_rename,[status(thm)],[c_0_6]) ).
fof(c_0_13,plain,
! [X2] : lhs_atom5(X2),
inference(variable_rename,[status(thm)],[c_0_7]) ).
fof(c_0_14,plain,
! [X2] : lhs_atom4(X2),
inference(variable_rename,[status(thm)],[c_0_8]) ).
fof(c_0_15,plain,
! [X2] : lhs_atom3(X2),
inference(variable_rename,[status(thm)],[c_0_9]) ).
fof(c_0_16,plain,
! [X2] : lhs_atom2(X2),
inference(variable_rename,[status(thm)],[c_0_10]) ).
fof(c_0_17,plain,
! [X2] : lhs_atom1(X2),
inference(variable_rename,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
lhs_atom6(X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
lhs_atom5(X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
lhs_atom4(X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
lhs_atom3(X1),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
lhs_atom2(X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
lhs_atom1(X1),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
lhs_atom6(X1),
c_0_18,
[final] ).
cnf(c_0_25,plain,
lhs_atom5(X1),
c_0_19,
[final] ).
cnf(c_0_26,plain,
lhs_atom4(X1),
c_0_20,
[final] ).
cnf(c_0_27,plain,
lhs_atom3(X1),
c_0_21,
[final] ).
cnf(c_0_28,plain,
lhs_atom2(X1),
c_0_22,
[final] ).
cnf(c_0_29,plain,
lhs_atom1(X1),
c_0_23,
[final] ).
% End CNF derivation
cnf(c_0_24_0,axiom,
product(codomain(X1),X1,X1),
inference(unfold_definition,[status(thm)],[c_0_24,def_lhs_atom6]) ).
cnf(c_0_25_0,axiom,
product(X1,domain(X1),X1),
inference(unfold_definition,[status(thm)],[c_0_25,def_lhs_atom5]) ).
cnf(c_0_26_0,axiom,
defined(codomain(X1),X1),
inference(unfold_definition,[status(thm)],[c_0_26,def_lhs_atom4]) ).
cnf(c_0_27_0,axiom,
defined(X1,domain(X1)),
inference(unfold_definition,[status(thm)],[c_0_27,def_lhs_atom3]) ).
cnf(c_0_28_0,axiom,
identity_map(codomain(X1)),
inference(unfold_definition,[status(thm)],[c_0_28,def_lhs_atom2]) ).
cnf(c_0_29_0,axiom,
identity_map(domain(X1)),
inference(unfold_definition,[status(thm)],[c_0_29,def_lhs_atom1]) ).
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
fof(c_0_0_001,axiom,
! [X1,X5,X2,X6,X7,X3] :
( ~ product(X3,X2,X7)
| ~ product(X7,X1,X6)
| ~ product(X2,X1,X5)
| product(X3,X5,X6) ),
file('<stdin>',category_theory_axiom2) ).
fof(c_0_1_002,axiom,
! [X1,X5,X2,X6,X7,X3] :
( ~ product(X2,X1,X5)
| ~ product(X3,X5,X6)
| ~ product(X3,X2,X7)
| product(X7,X1,X6) ),
file('<stdin>',category_theory_axiom5) ).
fof(c_0_2_003,axiom,
! [X1,X5,X2,X7,X3] :
( ~ product(X3,X2,X7)
| ~ product(X2,X1,X5)
| ~ defined(X7,X1)
| defined(X3,X5) ),
file('<stdin>',category_theory_axiom1) ).
fof(c_0_3_004,axiom,
! [X1,X5,X2,X7,X3] :
( ~ product(X2,X1,X5)
| ~ product(X3,X2,X7)
| ~ defined(X3,X5)
| defined(X7,X1) ),
file('<stdin>',category_theory_axiom4) ).
fof(c_0_4_005,axiom,
! [X1,X2,X3,X4] :
( ~ product(X3,X2,X1)
| ~ product(X3,X2,X4)
| X1 = X4 ),
file('<stdin>',composition_is_well_defined) ).
fof(c_0_5_006,axiom,
! [X1,X2,X7,X3] :
( ~ product(X3,X2,X7)
| ~ defined(X7,X1)
| defined(X2,X1) ),
file('<stdin>',associative_property2) ).
fof(c_0_6_007,axiom,
! [X1,X5,X2,X3] :
( ~ product(X2,X1,X5)
| ~ defined(X3,X5)
| defined(X3,X2) ),
file('<stdin>',category_theory_axiom3) ).
fof(c_0_7_008,axiom,
! [X2,X3] :
( ~ defined(X3,X2)
| product(X3,X2,compose(X3,X2)) ),
file('<stdin>',closure_of_composition) ).
fof(c_0_8_009,axiom,
! [X1,X2,X3] :
( ~ product(X3,X2,X1)
| defined(X3,X2) ),
file('<stdin>',associative_property1) ).
fof(c_0_9_010,axiom,
! [X2,X3] :
( ~ defined(X3,X2)
| ~ identity_map(X3)
| product(X3,X2,X2) ),
file('<stdin>',identity1) ).
fof(c_0_10_011,axiom,
! [X2,X3] :
( ~ defined(X3,X2)
| ~ identity_map(X2)
| product(X3,X2,X3) ),
file('<stdin>',identity2) ).
fof(c_0_11_012,axiom,
! [X1,X2,X3] :
( ~ defined(X3,X2)
| ~ defined(X2,X1)
| ~ identity_map(X2)
| defined(X3,X1) ),
file('<stdin>',category_theory_axiom6) ).
fof(c_0_12_013,plain,
! [X1,X5,X2,X6,X7,X3] :
( ~ product(X3,X2,X7)
| ~ product(X7,X1,X6)
| ~ product(X2,X1,X5)
| product(X3,X5,X6) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_13_014,plain,
! [X1,X5,X2,X6,X7,X3] :
( ~ product(X2,X1,X5)
| ~ product(X3,X5,X6)
| ~ product(X3,X2,X7)
| product(X7,X1,X6) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_14_015,plain,
! [X1,X5,X2,X7,X3] :
( ~ product(X3,X2,X7)
| ~ product(X2,X1,X5)
| ~ defined(X7,X1)
| defined(X3,X5) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_15_016,plain,
! [X1,X5,X2,X7,X3] :
( ~ product(X2,X1,X5)
| ~ product(X3,X2,X7)
| ~ defined(X3,X5)
| defined(X7,X1) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_16_017,plain,
! [X1,X2,X3,X4] :
( ~ product(X3,X2,X1)
| ~ product(X3,X2,X4)
| X1 = X4 ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_17_018,plain,
! [X1,X2,X7,X3] :
( ~ product(X3,X2,X7)
| ~ defined(X7,X1)
| defined(X2,X1) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_18_019,plain,
! [X1,X5,X2,X3] :
( ~ product(X2,X1,X5)
| ~ defined(X3,X5)
| defined(X3,X2) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_19_020,plain,
! [X2,X3] :
( ~ defined(X3,X2)
| product(X3,X2,compose(X3,X2)) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_20_021,plain,
! [X1,X2,X3] :
( ~ product(X3,X2,X1)
| defined(X3,X2) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_21_022,plain,
! [X2,X3] :
( ~ defined(X3,X2)
| ~ identity_map(X3)
| product(X3,X2,X2) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_22_023,plain,
! [X2,X3] :
( ~ defined(X3,X2)
| ~ identity_map(X2)
| product(X3,X2,X3) ),
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_23_024,plain,
! [X1,X2,X3] :
( ~ defined(X3,X2)
| ~ defined(X2,X1)
| ~ identity_map(X2)
| defined(X3,X1) ),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_24_025,plain,
! [X8,X9,X10,X11,X12,X13] :
( ~ product(X13,X10,X12)
| ~ product(X12,X8,X11)
| ~ product(X10,X8,X9)
| product(X13,X9,X11) ),
inference(variable_rename,[status(thm)],[c_0_12]) ).
fof(c_0_25_026,plain,
! [X8,X9,X10,X11,X12,X13] :
( ~ product(X10,X8,X9)
| ~ product(X13,X9,X11)
| ~ product(X13,X10,X12)
| product(X12,X8,X11) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_13])])]) ).
fof(c_0_26_027,plain,
! [X8,X9,X10,X11,X12] :
( ~ product(X12,X10,X11)
| ~ product(X10,X8,X9)
| ~ defined(X11,X8)
| defined(X12,X9) ),
inference(variable_rename,[status(thm)],[c_0_14]) ).
fof(c_0_27_028,plain,
! [X8,X9,X10,X11,X12] :
( ~ product(X10,X8,X9)
| ~ product(X12,X10,X11)
| ~ defined(X12,X9)
| defined(X11,X8) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_15])])]) ).
fof(c_0_28_029,plain,
! [X5,X6,X7,X8] :
( ~ product(X7,X6,X5)
| ~ product(X7,X6,X8)
| X5 = X8 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_16])])]) ).
fof(c_0_29_030,plain,
! [X8,X9,X10,X11] :
( ~ product(X11,X9,X10)
| ~ defined(X10,X8)
| defined(X9,X8) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_17])])]) ).
fof(c_0_30,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_18])])]) ).
fof(c_0_31,plain,
! [X4,X5] :
( ~ defined(X5,X4)
| product(X5,X4,compose(X5,X4)) ),
inference(variable_rename,[status(thm)],[c_0_19]) ).
fof(c_0_32,plain,
! [X4,X5,X6] :
( ~ product(X6,X5,X4)
| defined(X6,X5) ),
inference(variable_rename,[status(thm)],[c_0_20]) ).
fof(c_0_33,plain,
! [X4,X5] :
( ~ defined(X5,X4)
| ~ identity_map(X5)
| product(X5,X4,X4) ),
inference(variable_rename,[status(thm)],[c_0_21]) ).
fof(c_0_34,plain,
! [X4,X5] :
( ~ defined(X5,X4)
| ~ identity_map(X4)
| product(X5,X4,X5) ),
inference(variable_rename,[status(thm)],[c_0_22]) ).
fof(c_0_35,plain,
! [X4,X5,X6] :
( ~ defined(X6,X5)
| ~ defined(X5,X4)
| ~ identity_map(X5)
| defined(X6,X4) ),
inference(variable_rename,[status(thm)],[c_0_23]) ).
cnf(c_0_36,plain,
( product(X1,X2,X3)
| ~ product(X4,X5,X2)
| ~ product(X6,X5,X3)
| ~ product(X1,X4,X6) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_37,plain,
( product(X1,X2,X3)
| ~ product(X4,X5,X1)
| ~ product(X4,X6,X3)
| ~ product(X5,X2,X6) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_38,plain,
( defined(X1,X2)
| ~ defined(X3,X4)
| ~ product(X5,X4,X2)
| ~ product(X1,X5,X3) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_39,plain,
( defined(X1,X2)
| ~ defined(X3,X4)
| ~ product(X3,X5,X1)
| ~ product(X5,X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_40,plain,
( X1 = X2
| ~ product(X3,X4,X2)
| ~ product(X3,X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_41,plain,
( defined(X1,X2)
| ~ defined(X3,X2)
| ~ product(X4,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_42,plain,
( defined(X1,X2)
| ~ defined(X1,X3)
| ~ product(X2,X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_43,plain,
( product(X1,X2,compose(X1,X2))
| ~ defined(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_44,plain,
( defined(X1,X2)
| ~ product(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_45,plain,
( product(X1,X2,X2)
| ~ identity_map(X1)
| ~ defined(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_46,plain,
( product(X1,X2,X1)
| ~ identity_map(X2)
| ~ defined(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_47,plain,
( defined(X1,X2)
| ~ identity_map(X3)
| ~ defined(X3,X2)
| ~ defined(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_48,plain,
( product(X1,X2,X3)
| ~ product(X4,X5,X2)
| ~ product(X6,X5,X3)
| ~ product(X1,X4,X6) ),
c_0_36,
[final] ).
cnf(c_0_49,plain,
( product(X1,X2,X3)
| ~ product(X4,X5,X1)
| ~ product(X4,X6,X3)
| ~ product(X5,X2,X6) ),
c_0_37,
[final] ).
cnf(c_0_50,plain,
( defined(X1,X2)
| ~ defined(X3,X4)
| ~ product(X5,X4,X2)
| ~ product(X1,X5,X3) ),
c_0_38,
[final] ).
cnf(c_0_51,plain,
( defined(X1,X2)
| ~ defined(X3,X4)
| ~ product(X3,X5,X1)
| ~ product(X5,X2,X4) ),
c_0_39,
[final] ).
cnf(c_0_52,plain,
( X1 = X2
| ~ product(X3,X4,X2)
| ~ product(X3,X4,X1) ),
c_0_40,
[final] ).
cnf(c_0_53,plain,
( defined(X1,X2)
| ~ defined(X3,X2)
| ~ product(X4,X1,X3) ),
c_0_41,
[final] ).
cnf(c_0_54,plain,
( defined(X1,X2)
| ~ defined(X1,X3)
| ~ product(X2,X4,X3) ),
c_0_42,
[final] ).
cnf(c_0_55,plain,
( product(X1,X2,compose(X1,X2))
| ~ defined(X1,X2) ),
c_0_43,
[final] ).
cnf(c_0_56,plain,
( defined(X1,X2)
| ~ product(X1,X2,X3) ),
c_0_44,
[final] ).
cnf(c_0_57,plain,
( product(X1,X2,X2)
| ~ identity_map(X1)
| ~ defined(X1,X2) ),
c_0_45,
[final] ).
cnf(c_0_58,plain,
( product(X1,X2,X1)
| ~ identity_map(X2)
| ~ defined(X1,X2) ),
c_0_46,
[final] ).
cnf(c_0_59,plain,
( defined(X1,X2)
| ~ identity_map(X3)
| ~ defined(X3,X2)
| ~ defined(X1,X3) ),
c_0_47,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_48_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_48]) ).
cnf(c_0_48_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_48]) ).
cnf(c_0_48_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_48]) ).
cnf(c_0_48_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_48]) ).
cnf(c_0_49_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_49]) ).
cnf(c_0_49_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_49]) ).
cnf(c_0_49_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_49]) ).
cnf(c_0_49_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_49]) ).
cnf(c_0_50_0,axiom,
( defined(X1,X2)
| ~ defined(X3,X4)
| ~ product(X5,X4,X2)
| ~ product(X1,X5,X3) ),
inference(literals_permutation,[status(thm)],[c_0_50]) ).
cnf(c_0_50_1,axiom,
( ~ defined(X3,X4)
| defined(X1,X2)
| ~ product(X5,X4,X2)
| ~ product(X1,X5,X3) ),
inference(literals_permutation,[status(thm)],[c_0_50]) ).
cnf(c_0_50_2,axiom,
( ~ product(X5,X4,X2)
| ~ defined(X3,X4)
| defined(X1,X2)
| ~ product(X1,X5,X3) ),
inference(literals_permutation,[status(thm)],[c_0_50]) ).
cnf(c_0_50_3,axiom,
( ~ product(X1,X5,X3)
| ~ product(X5,X4,X2)
| ~ defined(X3,X4)
| defined(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_50]) ).
cnf(c_0_51_0,axiom,
( defined(X1,X2)
| ~ defined(X3,X4)
| ~ product(X3,X5,X1)
| ~ product(X5,X2,X4) ),
inference(literals_permutation,[status(thm)],[c_0_51]) ).
cnf(c_0_51_1,axiom,
( ~ defined(X3,X4)
| defined(X1,X2)
| ~ product(X3,X5,X1)
| ~ product(X5,X2,X4) ),
inference(literals_permutation,[status(thm)],[c_0_51]) ).
cnf(c_0_51_2,axiom,
( ~ product(X3,X5,X1)
| ~ defined(X3,X4)
| defined(X1,X2)
| ~ product(X5,X2,X4) ),
inference(literals_permutation,[status(thm)],[c_0_51]) ).
cnf(c_0_51_3,axiom,
( ~ product(X5,X2,X4)
| ~ product(X3,X5,X1)
| ~ defined(X3,X4)
| defined(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_51]) ).
cnf(c_0_52_0,axiom,
( X1 = X2
| ~ product(X3,X4,X2)
| ~ product(X3,X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_52]) ).
cnf(c_0_52_1,axiom,
( ~ product(X3,X4,X2)
| X1 = X2
| ~ product(X3,X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_52]) ).
cnf(c_0_52_2,axiom,
( ~ product(X3,X4,X1)
| ~ product(X3,X4,X2)
| X1 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_52]) ).
cnf(c_0_53_0,axiom,
( defined(X1,X2)
| ~ defined(X3,X2)
| ~ product(X4,X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_53]) ).
cnf(c_0_53_1,axiom,
( ~ defined(X3,X2)
| defined(X1,X2)
| ~ product(X4,X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_53]) ).
cnf(c_0_53_2,axiom,
( ~ product(X4,X1,X3)
| ~ defined(X3,X2)
| defined(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_53]) ).
cnf(c_0_54_0,axiom,
( defined(X1,X2)
| ~ defined(X1,X3)
| ~ product(X2,X4,X3) ),
inference(literals_permutation,[status(thm)],[c_0_54]) ).
cnf(c_0_54_1,axiom,
( ~ defined(X1,X3)
| defined(X1,X2)
| ~ product(X2,X4,X3) ),
inference(literals_permutation,[status(thm)],[c_0_54]) ).
cnf(c_0_54_2,axiom,
( ~ product(X2,X4,X3)
| ~ defined(X1,X3)
| defined(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_54]) ).
cnf(c_0_55_0,axiom,
( product(X1,X2,compose(X1,X2))
| ~ defined(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_55]) ).
cnf(c_0_55_1,axiom,
( ~ defined(X1,X2)
| product(X1,X2,compose(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_55]) ).
cnf(c_0_56_0,axiom,
( defined(X1,X2)
| ~ product(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_56]) ).
cnf(c_0_56_1,axiom,
( ~ product(X1,X2,X3)
| defined(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_56]) ).
cnf(c_0_57_0,axiom,
( product(X1,X2,X2)
| ~ identity_map(X1)
| ~ defined(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_57]) ).
cnf(c_0_57_1,axiom,
( ~ identity_map(X1)
| product(X1,X2,X2)
| ~ defined(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_57]) ).
cnf(c_0_57_2,axiom,
( ~ defined(X1,X2)
| ~ identity_map(X1)
| product(X1,X2,X2) ),
inference(literals_permutation,[status(thm)],[c_0_57]) ).
cnf(c_0_58_0,axiom,
( product(X1,X2,X1)
| ~ identity_map(X2)
| ~ defined(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_58]) ).
cnf(c_0_58_1,axiom,
( ~ identity_map(X2)
| product(X1,X2,X1)
| ~ defined(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_58]) ).
cnf(c_0_58_2,axiom,
( ~ defined(X1,X2)
| ~ identity_map(X2)
| product(X1,X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_58]) ).
cnf(c_0_59_0,axiom,
( defined(X1,X2)
| ~ identity_map(X3)
| ~ defined(X3,X2)
| ~ defined(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_59]) ).
cnf(c_0_59_1,axiom,
( ~ identity_map(X3)
| defined(X1,X2)
| ~ defined(X3,X2)
| ~ defined(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_59]) ).
cnf(c_0_59_2,axiom,
( ~ defined(X3,X2)
| ~ identity_map(X3)
| defined(X1,X2)
| ~ defined(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_59]) ).
cnf(c_0_59_3,axiom,
( ~ defined(X1,X3)
| ~ defined(X3,X2)
| ~ identity_map(X3)
| defined(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_59]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_031,hypothesis,
! [X1,X2,X3] :
( ~ product(X2,c,X3)
| ~ product(X1,c,X3)
| X2 = X1 ),
file('<stdin>',cancellation_for_product) ).
fof(c_0_1_032,hypothesis,
product(g,a,d),
file('<stdin>',ga_equals_d) ).
fof(c_0_2_033,hypothesis,
product(h,a,d),
file('<stdin>',ha_equals_d) ).
fof(c_0_3_034,hypothesis,
product(a,b,c),
file('<stdin>',ab_equals_c) ).
fof(c_0_4_035,negated_conjecture,
h != g,
file('<stdin>',prove_h_equals_g) ).
fof(c_0_5_036,hypothesis,
! [X1,X2,X3] :
( ~ product(X2,c,X3)
| ~ product(X1,c,X3)
| X2 = X1 ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_6_037,hypothesis,
product(g,a,d),
c_0_1 ).
fof(c_0_7_038,hypothesis,
product(h,a,d),
c_0_2 ).
fof(c_0_8_039,hypothesis,
product(a,b,c),
c_0_3 ).
fof(c_0_9_040,negated_conjecture,
h != g,
c_0_4 ).
fof(c_0_10_041,hypothesis,
! [X4,X5,X6] :
( ~ product(X5,c,X6)
| ~ product(X4,c,X6)
| X5 = X4 ),
inference(variable_rename,[status(thm)],[c_0_5]) ).
fof(c_0_11_042,hypothesis,
product(g,a,d),
c_0_6 ).
fof(c_0_12_043,hypothesis,
product(h,a,d),
c_0_7 ).
fof(c_0_13_044,hypothesis,
product(a,b,c),
c_0_8 ).
fof(c_0_14_045,negated_conjecture,
h != g,
c_0_9 ).
cnf(c_0_15_046,hypothesis,
( X1 = X2
| ~ product(X2,c,X3)
| ~ product(X1,c,X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16_047,hypothesis,
product(g,a,d),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17_048,hypothesis,
product(h,a,d),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18_049,hypothesis,
product(a,b,c),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19_050,negated_conjecture,
h != g,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20_051,hypothesis,
( X1 = X2
| ~ product(X2,c,X3)
| ~ product(X1,c,X3) ),
c_0_15,
[final] ).
cnf(c_0_21_052,hypothesis,
product(g,a,d),
c_0_16,
[final] ).
cnf(c_0_22_053,hypothesis,
product(h,a,d),
c_0_17,
[final] ).
cnf(c_0_23_054,hypothesis,
product(a,b,c),
c_0_18,
[final] ).
cnf(c_0_24_055,negated_conjecture,
g != h,
c_0_19,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_0,plain,
( ~ product(X0,X1,X2)
| ~ product(X2,X3,X4)
| ~ product(X1,X3,X5)
| product(X0,X5,X4) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_ca0a69.p',c_0_48_0) ).
cnf(c_563146,plain,
( ~ product(X0,X1,X2)
| ~ product(X2,X3,X4)
| ~ product(X1,X3,X5)
| product(X0,X5,X4) ),
inference(copy,[status(esa)],[c_0]) ).
cnf(c_563266,plain,
( ~ product(h,a,d)
| product(h,X0,X1)
| ~ product(a,X2,X0)
| ~ product(d,X2,X1) ),
inference(instantiation,[status(thm)],[c_563146]) ).
cnf(c_563313,plain,
( product(h,c,X0)
| ~ product(h,a,d)
| ~ product(a,b,c)
| ~ product(d,b,X0) ),
inference(instantiation,[status(thm)],[c_563266]) ).
cnf(c_730874,plain,
( product(h,c,compose(g,c))
| ~ product(h,a,d)
| ~ product(a,b,c)
| ~ product(d,b,compose(g,c)) ),
inference(instantiation,[status(thm)],[c_563313]) ).
cnf(c_4,plain,
( ~ product(X0,X1,X2)
| ~ product(X3,X2,X4)
| ~ product(X3,X0,X5)
| product(X5,X1,X4) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_ca0a69.p',c_0_49_0) ).
cnf(c_563150,plain,
( ~ product(X0,X1,X2)
| ~ product(X3,X2,X4)
| ~ product(X3,X0,X5)
| product(X5,X1,X4) ),
inference(copy,[status(esa)],[c_4]) ).
cnf(c_563487,plain,
( ~ product(a,b,c)
| ~ product(X0,c,X1)
| ~ product(X0,a,X2)
| product(X2,b,X1) ),
inference(instantiation,[status(thm)],[c_563150]) ).
cnf(c_604993,plain,
( ~ product(g,c,compose(g,c))
| ~ product(g,a,X0)
| ~ product(a,b,c)
| product(X0,b,compose(g,c)) ),
inference(instantiation,[status(thm)],[c_563487]) ).
cnf(c_606747,plain,
( ~ product(g,c,compose(g,c))
| ~ product(g,a,d)
| ~ product(a,b,c)
| product(d,b,compose(g,c)) ),
inference(instantiation,[status(thm)],[c_604993]) ).
cnf(c_35,plain,
( ~ defined(X0,X1)
| ~ defined(X1,X2)
| ~ identity_map(X1)
| defined(X0,X2) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_ca0a69.p',c_0_59_0) ).
cnf(c_563181,plain,
( ~ defined(X0,X1)
| ~ defined(X1,X2)
| ~ identity_map(X1)
| defined(X0,X2) ),
inference(copy,[status(esa)],[c_35]) ).
cnf(c_563240,plain,
( ~ defined(codomain(X0),X1)
| ~ defined(X2,codomain(X0))
| defined(X2,X1)
| ~ identity_map(codomain(X0)) ),
inference(instantiation,[status(thm)],[c_563181]) ).
cnf(c_564599,plain,
( ~ defined(codomain(X0),X1)
| ~ defined(g,codomain(X0))
| defined(g,X1)
| ~ identity_map(codomain(X0)) ),
inference(instantiation,[status(thm)],[c_563240]) ).
cnf(c_604436,plain,
( ~ defined(codomain(X0),c)
| ~ defined(g,codomain(X0))
| defined(g,c)
| ~ identity_map(codomain(X0)) ),
inference(instantiation,[status(thm)],[c_564599]) ).
cnf(c_604437,plain,
( ~ defined(codomain(a),c)
| ~ defined(g,codomain(a))
| defined(g,c)
| ~ identity_map(codomain(a)) ),
inference(instantiation,[status(thm)],[c_604436]) ).
cnf(c_3,plain,
( product(X0,X1,X2)
| ~ product(X3,X4,X1)
| ~ product(X5,X4,X2)
| ~ product(X0,X3,X5) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_ca0a69.p',c_0_48_3) ).
cnf(c_91,plain,
( product(X0,X1,X2)
| ~ product(X3,X4,X1)
| ~ product(X5,X4,X2)
| ~ product(X0,X3,X5) ),
inference(copy,[status(esa)],[c_3]) ).
cnf(c_37335,plain,
( ~ product(a,b,c)
| product(X0,c,X1)
| ~ product(X0,a,X2)
| ~ product(X2,b,X1) ),
inference(instantiation,[status(thm)],[c_91]) ).
cnf(c_289375,plain,
( ~ product(a,b,c)
| product(X0,c,c)
| ~ product(X0,a,a) ),
inference(instantiation,[status(thm)],[c_37335]) ).
cnf(c_516327,plain,
( product(codomain(X0),c,c)
| ~ product(codomain(X0),a,a)
| ~ product(a,b,c) ),
inference(instantiation,[status(thm)],[c_289375]) ).
cnf(c_516330,plain,
( product(codomain(a),c,c)
| ~ product(codomain(a),a,a)
| ~ product(a,b,c) ),
inference(instantiation,[status(thm)],[c_516327]) ).
cnf(c_45,plain,
( ~ product(X0,c,X1)
| ~ product(X2,c,X1)
| X0 = X2 ),
file('/export/starexec/sandbox/tmp/iprover_modulo_ca0a69.p',c_0_20) ).
cnf(c_61,plain,
( ~ product(X0,c,X1)
| ~ product(X2,c,X1)
| X0 = X2 ),
inference(copy,[status(esa)],[c_45]) ).
cnf(c_73,plain,
( ~ product(X0,c,X1)
| ~ product(X2,c,X1)
| X0 = X2 ),
inference(copy,[status(esa)],[c_61]) ).
cnf(c_82,plain,
( ~ product(X0,c,X1)
| ~ product(X2,c,X1)
| X0 = X2 ),
inference(copy,[status(esa)],[c_73]) ).
cnf(c_85,plain,
( ~ product(X0,c,X1)
| ~ product(X2,c,X1)
| X0 = X2 ),
inference(copy,[status(esa)],[c_82]) ).
cnf(c_135,plain,
( ~ product(X0,c,X1)
| ~ product(X2,c,X1)
| X0 = X2 ),
inference(copy,[status(esa)],[c_85]) ).
cnf(c_206232,plain,
( ~ product(X0,c,compose(X0,c))
| ~ product(X1,c,compose(X0,c))
| X0 = X1 ),
inference(instantiation,[status(thm)],[c_135]) ).
cnf(c_343142,plain,
( ~ product(g,c,compose(g,c))
| ~ product(h,c,compose(g,c))
| g = h ),
inference(instantiation,[status(thm)],[c_206232]) ).
cnf(c_28,plain,
( defined(X0,X1)
| ~ product(X0,X1,X2) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_ca0a69.p',c_0_56_1) ).
cnf(c_116,plain,
( defined(X0,X1)
| ~ product(X0,X1,X2) ),
inference(copy,[status(esa)],[c_28]) ).
cnf(c_36219,plain,
( ~ product(codomain(X0),X1,X1)
| defined(codomain(X0),X1) ),
inference(instantiation,[status(thm)],[c_116]) ).
cnf(c_36699,plain,
( ~ product(codomain(X0),c,c)
| defined(codomain(X0),c) ),
inference(instantiation,[status(thm)],[c_36219]) ).
cnf(c_36700,plain,
( ~ product(codomain(a),c,c)
| defined(codomain(a),c) ),
inference(instantiation,[status(thm)],[c_36699]) ).
cnf(c_26,plain,
( product(X0,X1,compose(X0,X1))
| ~ defined(X0,X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_ca0a69.p',c_0_55_1) ).
cnf(c_114,plain,
( product(X0,X1,compose(X0,X1))
| ~ defined(X0,X1) ),
inference(copy,[status(esa)],[c_26]) ).
cnf(c_36290,plain,
( product(g,X0,compose(g,X0))
| ~ defined(g,X0) ),
inference(instantiation,[status(thm)],[c_114]) ).
cnf(c_36483,plain,
( product(g,c,compose(g,c))
| ~ defined(g,c) ),
inference(instantiation,[status(thm)],[c_36290]) ).
cnf(c_23,plain,
( ~ product(X0,X1,X2)
| defined(X3,X0)
| ~ defined(X3,X2) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_ca0a69.p',c_0_54_1) ).
cnf(c_111,plain,
( ~ product(X0,X1,X2)
| defined(X3,X0)
| ~ defined(X3,X2) ),
inference(copy,[status(esa)],[c_23]) ).
cnf(c_36157,plain,
( ~ product(X0,X1,a)
| ~ defined(g,a)
| defined(g,X0) ),
inference(instantiation,[status(thm)],[c_111]) ).
cnf(c_36292,plain,
( ~ product(codomain(X0),X1,a)
| defined(g,codomain(X0))
| ~ defined(g,a) ),
inference(instantiation,[status(thm)],[c_36157]) ).
cnf(c_36294,plain,
( ~ product(codomain(a),a,a)
| defined(g,codomain(a))
| ~ defined(g,a) ),
inference(instantiation,[status(thm)],[c_36292]) ).
cnf(c_27,plain,
( ~ product(X0,X1,X2)
| defined(X0,X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_ca0a69.p',c_0_56_0) ).
cnf(c_115,plain,
( ~ product(X0,X1,X2)
| defined(X0,X1) ),
inference(copy,[status(esa)],[c_27]) ).
cnf(c_36114,plain,
( ~ product(g,a,d)
| defined(g,a) ),
inference(instantiation,[status(thm)],[c_115]) ).
cnf(c_40,plain,
identity_map(codomain(X0)),
file('/export/starexec/sandbox/tmp/iprover_modulo_ca0a69.p',c_0_28_0) ).
cnf(c_55,plain,
identity_map(codomain(a)),
inference(instantiation,[status(thm)],[c_40]) ).
cnf(c_44,plain,
product(codomain(X0),X0,X0),
file('/export/starexec/sandbox/tmp/iprover_modulo_ca0a69.p',c_0_24_0) ).
cnf(c_51,plain,
product(codomain(a),a,a),
inference(instantiation,[status(thm)],[c_44]) ).
cnf(c_47,plain,
product(g,a,d),
file('/export/starexec/sandbox/tmp/iprover_modulo_ca0a69.p',c_0_21) ).
cnf(c_48,plain,
product(h,a,d),
file('/export/starexec/sandbox/tmp/iprover_modulo_ca0a69.p',c_0_22) ).
cnf(c_49,plain,
product(a,b,c),
file('/export/starexec/sandbox/tmp/iprover_modulo_ca0a69.p',c_0_23) ).
cnf(c_46,negated_conjecture,
g != h,
file('/export/starexec/sandbox/tmp/iprover_modulo_ca0a69.p',c_0_24) ).
cnf(contradiction,plain,
$false,
inference(minisat,[status(thm)],[c_730874,c_606747,c_604437,c_516330,c_343142,c_36700,c_36483,c_36294,c_36114,c_55,c_51,c_47,c_48,c_49,c_46]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : CAT003-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12 % Command : iprover_modulo %s %d
% 0.12/0.33 % Computer : n024.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.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun May 29 19:18:51 EDT 2022
% 0.12/0.34 % 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_4bc0b5.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_ca0a69.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_3c3831 | 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_4bc0b5.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
% 21.70/21.90 % --inst_prop_sim_new false
% 21.70/21.90 % --inst_orphan_elimination true
% 21.70/21.90 % --inst_learning_loop_flag true
% 21.70/21.90 % --inst_learning_start 3000
% 21.70/21.90 % --inst_learning_factor 2
% 21.70/21.90 % --inst_start_prop_sim_after_learn 3
% 21.70/21.90 % --inst_sel_renew solver
% 21.70/21.90 % --inst_lit_activity_flag true
% 21.70/21.90 % --inst_out_proof true
% 21.70/21.90
% 21.70/21.90 % ------ Resolution Options
% 21.70/21.90
% 21.70/21.90 % --resolution_flag true
% 21.70/21.90 % --res_lit_sel kbo_max
% 21.70/21.90 % --res_to_prop_solver none
% 21.70/21.90 % --res_prop_simpl_new false
% 21.70/21.90 % --res_prop_simpl_given false
% 21.70/21.90 % --res_passive_queue_type priority_queues
% 21.70/21.90 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 21.70/21.90 % --res_passive_queues_freq [15;5]
% 21.70/21.90 % --res_forward_subs full
% 21.70/21.90 % --res_backward_subs full
% 21.70/21.90 % --res_forward_subs_resolution true
% 21.70/21.90 % --res_backward_subs_resolution true
% 21.70/21.90 % --res_orphan_elimination false
% 21.70/21.90 % --res_time_limit 1000.
% 21.70/21.90 % --res_out_proof true
% 21.70/21.90 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_4bc0b5.s
% 21.70/21.90 % --modulo true
% 21.70/21.90
% 21.70/21.90 % ------ Combination Options
% 21.70/21.90
% 21.70/21.90 % --comb_res_mult 1000
% 21.70/21.90 % --comb_inst_mult 300
% 21.70/21.90 % ------
% 21.70/21.90
% 21.70/21.90
% 21.70/21.90
% 21.70/21.90 % ------ Proving...
% 21.70/21.90 %
% 21.70/21.90
% 21.70/21.90
% 21.70/21.90 % ------ Statistics
% 21.70/21.90
% 21.70/21.90 % ------ General
% 21.70/21.90
% 21.70/21.90 % num_of_input_clauses: 50
% 21.70/21.90 % num_of_input_neg_conjectures: 1
% 21.70/21.90 % num_of_splits: 0
% 21.70/21.90 % num_of_split_atoms: 0
% 21.70/21.90 % num_of_sem_filtered_clauses: 0
% 21.70/21.90 % num_of_subtypes: 0
% 21.70/21.90 % monotx_restored_types: 0
% 21.70/21.90 % sat_num_of_epr_types: 0
% 21.70/21.90 % sat_num_of_non_cyclic_types: 0
% 21.70/21.90 % sat_guarded_non_collapsed_types: 0
% 21.70/21.90 % is_epr: 0
% 21.70/21.90 % is_horn: 1
% 21.70/21.90 % has_eq: 1
% 21.70/21.90 % num_pure_diseq_elim: 0
% 21.70/21.90 % simp_replaced_by: 0
% 21.70/21.90 % res_preprocessed: 6
% 21.70/21.90 % prep_upred: 0
% 21.70/21.90 % prep_unflattend: 0
% 21.70/21.90 % pred_elim_cands: 1
% 21.70/21.90 % pred_elim: 0
% 21.70/21.90 % pred_elim_cl: 0
% 21.70/21.90 % pred_elim_cycles: 1
% 21.70/21.90 % forced_gc_time: 0
% 21.70/21.90 % gc_basic_clause_elim: 0
% 21.70/21.90 % parsing_time: 0.002
% 21.70/21.90 % sem_filter_time: 0.
% 21.70/21.90 % pred_elim_time: 0.
% 21.70/21.90 % out_proof_time: 0.002
% 21.70/21.90 % monotx_time: 0.
% 21.70/21.90 % subtype_inf_time: 0.
% 21.70/21.90 % unif_index_cands_time: 0.097
% 21.70/21.90 % unif_index_add_time: 0.034
% 21.70/21.90 % total_time: 21.496
% 21.70/21.90 % num_of_symbols: 37
% 21.70/21.90 % num_of_terms: 56769
% 21.70/21.90
% 21.70/21.90 % ------ Propositional Solver
% 21.70/21.90
% 21.70/21.90 % prop_solver_calls: 26
% 21.70/21.90 % prop_fast_solver_calls: 15
% 21.70/21.90 % prop_num_of_clauses: 12792
% 21.70/21.90 % prop_preprocess_simplified: 21270
% 21.70/21.90 % prop_fo_subsumed: 0
% 21.70/21.90 % prop_solver_time: 0.007
% 21.70/21.90 % prop_fast_solver_time: 0.
% 21.70/21.90 % prop_unsat_core_time: 0.001
% 21.70/21.90
% 21.70/21.90 % ------ QBF
% 21.70/21.90
% 21.70/21.90 % qbf_q_res: 0
% 21.70/21.90 % qbf_num_tautologies: 0
% 21.70/21.90 % qbf_prep_cycles: 0
% 21.70/21.90
% 21.70/21.90 % ------ BMC1
% 21.70/21.90
% 21.70/21.90 % bmc1_current_bound: -1
% 21.70/21.90 % bmc1_last_solved_bound: -1
% 21.70/21.90 % bmc1_unsat_core_size: -1
% 21.70/21.90 % bmc1_unsat_core_parents_size: -1
% 21.70/21.90 % bmc1_merge_next_fun: 0
% 21.70/21.90 % bmc1_unsat_core_clauses_time: 0.
% 21.70/21.90
% 21.70/21.90 % ------ Instantiation
% 21.70/21.90
% 21.70/21.90 % inst_num_of_clauses: 2541
% 21.70/21.90 % inst_num_in_passive: 1520
% 21.70/21.90 % inst_num_in_active: 861
% 21.70/21.90 % inst_num_in_unprocessed: 119
% 21.70/21.90 % inst_num_of_loops: 917
% 21.70/21.91 % inst_num_of_learning_restarts: 1
% 21.70/21.91 % inst_num_moves_active_passive: 16
% 21.70/21.91 % inst_lit_activity: 487
% 21.70/21.91 % inst_lit_activity_moves: 0
% 21.70/21.91 % inst_num_tautologies: 38
% 21.70/21.91 % inst_num_prop_implied: 0
% 21.70/21.91 % inst_num_existing_simplified: 0
% 21.70/21.91 % inst_num_eq_res_simplified: 0
% 21.70/21.91 % inst_num_child_elim: 0
% 21.70/21.91 % inst_num_of_dismatching_blockings: 2638
% 21.70/21.91 % inst_num_of_non_proper_insts: 4827
% 21.70/21.91 % inst_num_of_duplicates: 1689
% 21.70/21.91 % inst_inst_num_from_inst_to_res: 0
% 21.70/21.91 % inst_dismatching_checking_time: 0.135
% 21.70/21.91
% 21.70/21.91 % ------ Resolution
% 21.70/21.91
% 21.70/21.91 % res_num_of_clauses: 257247
% 21.70/21.91 % res_num_in_passive: 246605
% 21.70/21.91 % res_num_in_active: 12302
% 21.70/21.91 % res_num_of_loops: 14000
% 21.70/21.91 % res_forward_subset_subsumed: 13287
% 21.70/21.91 % res_backward_subset_subsumed: 1872
% 21.70/21.91 % res_forward_subsumed: 1263
% 21.70/21.91 % res_backward_subsumed: 362
% 21.70/21.91 % res_forward_subsumption_resolution: 885
% 21.70/21.91 % res_backward_subsumption_resolution: 0
% 21.70/21.91 % res_clause_to_clause_subsumption: 2882673
% 21.70/21.91 % res_orphan_elimination: 0
% 21.70/21.91 % res_tautology_del: 12
% 21.70/21.91 % res_num_eq_res_simplified: 0
% 21.70/21.91 % res_num_sel_changes: 0
% 21.70/21.91 % res_moves_from_active_to_pass: 0
% 21.70/21.91
% 21.70/21.91 % Status Unsatisfiable
% 21.70/21.91 % SZS status Unsatisfiable
% 21.70/21.91 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------