TSTP Solution File: SET058-7 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SET058-7 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n003.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 : Tue Jul 19 02:09:28 EDT 2022
% Result : Unsatisfiable 0.70s 1.03s
% Output : CNFRefutation 0.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(subclass_is_reflexive,axiom,
subclass(X,X),
input ).
fof(subclass_is_reflexive_0,plain,
! [X] :
( subclass(X,X)
| $false ),
inference(orientation,[status(thm)],[subclass_is_reflexive]) ).
cnf(cantor_class,axiom,
intersection(domain_of(X),diagonalise(compose(inverse(element_relation),X))) = cantor(X),
input ).
fof(cantor_class_0,plain,
! [X] :
( intersection(domain_of(X),diagonalise(compose(inverse(element_relation),X))) = cantor(X)
| $false ),
inference(orientation,[status(thm)],[cantor_class]) ).
cnf(diagonalisation,axiom,
complement(domain_of(intersection(Xr,identity_relation))) = diagonalise(Xr),
input ).
fof(diagonalisation_0,plain,
! [Xr] :
( complement(domain_of(intersection(Xr,identity_relation))) = diagonalise(Xr)
| $false ),
inference(orientation,[status(thm)],[diagonalisation]) ).
cnf(identity_relation,axiom,
intersection(inverse(subset_relation),subset_relation) = identity_relation,
input ).
fof(identity_relation_0,plain,
( intersection(inverse(subset_relation),subset_relation) = identity_relation
| $false ),
inference(orientation,[status(thm)],[identity_relation]) ).
cnf(subset_relation,axiom,
intersection(cross_product(universal_class,universal_class),intersection(cross_product(universal_class,universal_class),complement(compose(complement(element_relation),inverse(element_relation))))) = subset_relation,
input ).
fof(subset_relation_0,plain,
( intersection(cross_product(universal_class,universal_class),intersection(cross_product(universal_class,universal_class),complement(compose(complement(element_relation),inverse(element_relation))))) = subset_relation
| $false ),
inference(orientation,[status(thm)],[subset_relation]) ).
cnf(choice1,axiom,
function(choice),
input ).
fof(choice1_0,plain,
( function(choice)
| $false ),
inference(orientation,[status(thm)],[choice1]) ).
cnf(apply,axiom,
sum_class(image(Xf,singleton(Y))) = apply(Xf,Y),
input ).
fof(apply_0,plain,
! [Xf,Y] :
( sum_class(image(Xf,singleton(Y))) = apply(Xf,Y)
| $false ),
inference(orientation,[status(thm)],[apply]) ).
cnf(compose1,axiom,
subclass(compose(Yr,Xr),cross_product(universal_class,universal_class)),
input ).
fof(compose1_0,plain,
! [Xr,Yr] :
( subclass(compose(Yr,Xr),cross_product(universal_class,universal_class))
| $false ),
inference(orientation,[status(thm)],[compose1]) ).
cnf(power_class_definition,axiom,
complement(image(element_relation,complement(X))) = power_class(X),
input ).
fof(power_class_definition_0,plain,
! [X] :
( complement(image(element_relation,complement(X))) = power_class(X)
| $false ),
inference(orientation,[status(thm)],[power_class_definition]) ).
cnf(sum_class_definition,axiom,
domain_of(restrict(element_relation,universal_class,X)) = sum_class(X),
input ).
fof(sum_class_definition_0,plain,
! [X] :
( domain_of(restrict(element_relation,universal_class,X)) = sum_class(X)
| $false ),
inference(orientation,[status(thm)],[sum_class_definition]) ).
cnf(omega_in_universal,axiom,
member(omega,universal_class),
input ).
fof(omega_in_universal_0,plain,
( member(omega,universal_class)
| $false ),
inference(orientation,[status(thm)],[omega_in_universal]) ).
cnf(omega_is_inductive1,axiom,
inductive(omega),
input ).
fof(omega_is_inductive1_0,plain,
( inductive(omega)
| $false ),
inference(orientation,[status(thm)],[omega_is_inductive1]) ).
cnf(successor_relation1,axiom,
subclass(successor_relation,cross_product(universal_class,universal_class)),
input ).
fof(successor_relation1_0,plain,
( subclass(successor_relation,cross_product(universal_class,universal_class))
| $false ),
inference(orientation,[status(thm)],[successor_relation1]) ).
cnf(successor,axiom,
union(X,singleton(X)) = successor(X),
input ).
fof(successor_0,plain,
! [X] :
( union(X,singleton(X)) = successor(X)
| $false ),
inference(orientation,[status(thm)],[successor]) ).
cnf(image,axiom,
range_of(restrict(Xr,X,universal_class)) = image(Xr,X),
input ).
fof(image_0,plain,
! [X,Xr] :
( range_of(restrict(Xr,X,universal_class)) = image(Xr,X)
| $false ),
inference(orientation,[status(thm)],[image]) ).
cnf(range,axiom,
second(not_subclass_element(restrict(Z,singleton(X),Y),null_class)) = range(Z,X,Y),
input ).
fof(range_0,plain,
! [X,Y,Z] :
( second(not_subclass_element(restrict(Z,singleton(X),Y),null_class)) = range(Z,X,Y)
| $false ),
inference(orientation,[status(thm)],[range]) ).
cnf(domain,axiom,
first(not_subclass_element(restrict(Z,X,singleton(Y)),null_class)) = domain(Z,X,Y),
input ).
fof(domain_0,plain,
! [X,Y,Z] :
( first(not_subclass_element(restrict(Z,X,singleton(Y)),null_class)) = domain(Z,X,Y)
| $false ),
inference(orientation,[status(thm)],[domain]) ).
cnf(range_of,axiom,
domain_of(inverse(Z)) = range_of(Z),
input ).
fof(range_of_0,plain,
! [Z] :
( domain_of(inverse(Z)) = range_of(Z)
| $false ),
inference(orientation,[status(thm)],[range_of]) ).
cnf(inverse,axiom,
domain_of(flip(cross_product(Y,universal_class))) = inverse(Y),
input ).
fof(inverse_0,plain,
! [Y] :
( domain_of(flip(cross_product(Y,universal_class))) = inverse(Y)
| $false ),
inference(orientation,[status(thm)],[inverse]) ).
cnf(flip1,axiom,
subclass(flip(X),cross_product(cross_product(universal_class,universal_class),universal_class)),
input ).
fof(flip1_0,plain,
! [X] :
( subclass(flip(X),cross_product(cross_product(universal_class,universal_class),universal_class))
| $false ),
inference(orientation,[status(thm)],[flip1]) ).
cnf(rotate1,axiom,
subclass(rotate(X),cross_product(cross_product(universal_class,universal_class),universal_class)),
input ).
fof(rotate1_0,plain,
! [X] :
( subclass(rotate(X),cross_product(cross_product(universal_class,universal_class),universal_class))
| $false ),
inference(orientation,[status(thm)],[rotate1]) ).
cnf(restriction2,axiom,
intersection(cross_product(X,Y),Xr) = restrict(Xr,X,Y),
input ).
fof(restriction2_0,plain,
! [X,Xr,Y] :
( intersection(cross_product(X,Y),Xr) = restrict(Xr,X,Y)
| $false ),
inference(orientation,[status(thm)],[restriction2]) ).
cnf(restriction1,axiom,
intersection(Xr,cross_product(X,Y)) = restrict(Xr,X,Y),
input ).
fof(restriction1_0,plain,
! [X,Xr,Y] :
( intersection(Xr,cross_product(X,Y)) = restrict(Xr,X,Y)
| $false ),
inference(orientation,[status(thm)],[restriction1]) ).
cnf(symmetric_difference,axiom,
intersection(complement(intersection(X,Y)),complement(intersection(complement(X),complement(Y)))) = symmetric_difference(X,Y),
input ).
fof(symmetric_difference_0,plain,
! [X,Y] :
( intersection(complement(intersection(X,Y)),complement(intersection(complement(X),complement(Y)))) = symmetric_difference(X,Y)
| $false ),
inference(orientation,[status(thm)],[symmetric_difference]) ).
cnf(union,axiom,
complement(intersection(complement(X),complement(Y))) = union(X,Y),
input ).
fof(union_0,plain,
! [X,Y] :
( complement(intersection(complement(X),complement(Y))) = union(X,Y)
| $false ),
inference(orientation,[status(thm)],[union]) ).
cnf(element_relation1,axiom,
subclass(element_relation,cross_product(universal_class,universal_class)),
input ).
fof(element_relation1_0,plain,
( subclass(element_relation,cross_product(universal_class,universal_class))
| $false ),
inference(orientation,[status(thm)],[element_relation1]) ).
cnf(ordered_pair,axiom,
unordered_pair(singleton(X),unordered_pair(X,singleton(Y))) = ordered_pair(X,Y),
input ).
fof(ordered_pair_0,plain,
! [X,Y] :
( unordered_pair(singleton(X),unordered_pair(X,singleton(Y))) = ordered_pair(X,Y)
| $false ),
inference(orientation,[status(thm)],[ordered_pair]) ).
cnf(singleton_set,axiom,
unordered_pair(X,X) = singleton(X),
input ).
fof(singleton_set_0,plain,
! [X] :
( unordered_pair(X,X) = singleton(X)
| $false ),
inference(orientation,[status(thm)],[singleton_set]) ).
cnf(unordered_pairs_in_universal,axiom,
member(unordered_pair(X,Y),universal_class),
input ).
fof(unordered_pairs_in_universal_0,plain,
! [X,Y] :
( member(unordered_pair(X,Y),universal_class)
| $false ),
inference(orientation,[status(thm)],[unordered_pairs_in_universal]) ).
cnf(class_elements_are_sets,axiom,
subclass(X,universal_class),
input ).
fof(class_elements_are_sets_0,plain,
! [X] :
( subclass(X,universal_class)
| $false ),
inference(orientation,[status(thm)],[class_elements_are_sets]) ).
fof(def_lhs_atom1,axiom,
! [X] :
( lhs_atom1(X)
<=> subclass(X,universal_class) ),
inference(definition,[],]) ).
fof(to_be_clausified_0,plain,
! [X] :
( lhs_atom1(X)
| $false ),
inference(fold_definition,[status(thm)],[class_elements_are_sets_0,def_lhs_atom1]) ).
fof(def_lhs_atom2,axiom,
! [Y,X] :
( lhs_atom2(Y,X)
<=> member(unordered_pair(X,Y),universal_class) ),
inference(definition,[],]) ).
fof(to_be_clausified_1,plain,
! [X,Y] :
( lhs_atom2(Y,X)
| $false ),
inference(fold_definition,[status(thm)],[unordered_pairs_in_universal_0,def_lhs_atom2]) ).
fof(def_lhs_atom3,axiom,
! [X] :
( lhs_atom3(X)
<=> unordered_pair(X,X) = singleton(X) ),
inference(definition,[],]) ).
fof(to_be_clausified_2,plain,
! [X] :
( lhs_atom3(X)
| $false ),
inference(fold_definition,[status(thm)],[singleton_set_0,def_lhs_atom3]) ).
fof(def_lhs_atom4,axiom,
! [Y,X] :
( lhs_atom4(Y,X)
<=> unordered_pair(singleton(X),unordered_pair(X,singleton(Y))) = ordered_pair(X,Y) ),
inference(definition,[],]) ).
fof(to_be_clausified_3,plain,
! [X,Y] :
( lhs_atom4(Y,X)
| $false ),
inference(fold_definition,[status(thm)],[ordered_pair_0,def_lhs_atom4]) ).
fof(def_lhs_atom5,axiom,
( lhs_atom5
<=> subclass(element_relation,cross_product(universal_class,universal_class)) ),
inference(definition,[],]) ).
fof(to_be_clausified_4,plain,
( lhs_atom5
| $false ),
inference(fold_definition,[status(thm)],[element_relation1_0,def_lhs_atom5]) ).
fof(def_lhs_atom6,axiom,
! [Y,X] :
( lhs_atom6(Y,X)
<=> complement(intersection(complement(X),complement(Y))) = union(X,Y) ),
inference(definition,[],]) ).
fof(to_be_clausified_5,plain,
! [X,Y] :
( lhs_atom6(Y,X)
| $false ),
inference(fold_definition,[status(thm)],[union_0,def_lhs_atom6]) ).
fof(def_lhs_atom7,axiom,
! [Y,X] :
( lhs_atom7(Y,X)
<=> intersection(complement(intersection(X,Y)),complement(intersection(complement(X),complement(Y)))) = symmetric_difference(X,Y) ),
inference(definition,[],]) ).
fof(to_be_clausified_6,plain,
! [X,Y] :
( lhs_atom7(Y,X)
| $false ),
inference(fold_definition,[status(thm)],[symmetric_difference_0,def_lhs_atom7]) ).
fof(def_lhs_atom8,axiom,
! [Y,Xr,X] :
( lhs_atom8(Y,Xr,X)
<=> intersection(Xr,cross_product(X,Y)) = restrict(Xr,X,Y) ),
inference(definition,[],]) ).
fof(to_be_clausified_7,plain,
! [X,Xr,Y] :
( lhs_atom8(Y,Xr,X)
| $false ),
inference(fold_definition,[status(thm)],[restriction1_0,def_lhs_atom8]) ).
fof(def_lhs_atom9,axiom,
! [Y,Xr,X] :
( lhs_atom9(Y,Xr,X)
<=> intersection(cross_product(X,Y),Xr) = restrict(Xr,X,Y) ),
inference(definition,[],]) ).
fof(to_be_clausified_8,plain,
! [X,Xr,Y] :
( lhs_atom9(Y,Xr,X)
| $false ),
inference(fold_definition,[status(thm)],[restriction2_0,def_lhs_atom9]) ).
fof(def_lhs_atom10,axiom,
! [X] :
( lhs_atom10(X)
<=> subclass(rotate(X),cross_product(cross_product(universal_class,universal_class),universal_class)) ),
inference(definition,[],]) ).
fof(to_be_clausified_9,plain,
! [X] :
( lhs_atom10(X)
| $false ),
inference(fold_definition,[status(thm)],[rotate1_0,def_lhs_atom10]) ).
fof(def_lhs_atom11,axiom,
! [X] :
( lhs_atom11(X)
<=> subclass(flip(X),cross_product(cross_product(universal_class,universal_class),universal_class)) ),
inference(definition,[],]) ).
fof(to_be_clausified_10,plain,
! [X] :
( lhs_atom11(X)
| $false ),
inference(fold_definition,[status(thm)],[flip1_0,def_lhs_atom11]) ).
fof(def_lhs_atom12,axiom,
! [Y] :
( lhs_atom12(Y)
<=> domain_of(flip(cross_product(Y,universal_class))) = inverse(Y) ),
inference(definition,[],]) ).
fof(to_be_clausified_11,plain,
! [Y] :
( lhs_atom12(Y)
| $false ),
inference(fold_definition,[status(thm)],[inverse_0,def_lhs_atom12]) ).
fof(def_lhs_atom13,axiom,
! [Z] :
( lhs_atom13(Z)
<=> domain_of(inverse(Z)) = range_of(Z) ),
inference(definition,[],]) ).
fof(to_be_clausified_12,plain,
! [Z] :
( lhs_atom13(Z)
| $false ),
inference(fold_definition,[status(thm)],[range_of_0,def_lhs_atom13]) ).
fof(def_lhs_atom14,axiom,
! [Z,Y,X] :
( lhs_atom14(Z,Y,X)
<=> first(not_subclass_element(restrict(Z,X,singleton(Y)),null_class)) = domain(Z,X,Y) ),
inference(definition,[],]) ).
fof(to_be_clausified_13,plain,
! [X,Y,Z] :
( lhs_atom14(Z,Y,X)
| $false ),
inference(fold_definition,[status(thm)],[domain_0,def_lhs_atom14]) ).
fof(def_lhs_atom15,axiom,
! [Z,Y,X] :
( lhs_atom15(Z,Y,X)
<=> second(not_subclass_element(restrict(Z,singleton(X),Y),null_class)) = range(Z,X,Y) ),
inference(definition,[],]) ).
fof(to_be_clausified_14,plain,
! [X,Y,Z] :
( lhs_atom15(Z,Y,X)
| $false ),
inference(fold_definition,[status(thm)],[range_0,def_lhs_atom15]) ).
fof(def_lhs_atom16,axiom,
! [Xr,X] :
( lhs_atom16(Xr,X)
<=> range_of(restrict(Xr,X,universal_class)) = image(Xr,X) ),
inference(definition,[],]) ).
fof(to_be_clausified_15,plain,
! [X,Xr] :
( lhs_atom16(Xr,X)
| $false ),
inference(fold_definition,[status(thm)],[image_0,def_lhs_atom16]) ).
fof(def_lhs_atom17,axiom,
! [X] :
( lhs_atom17(X)
<=> union(X,singleton(X)) = successor(X) ),
inference(definition,[],]) ).
fof(to_be_clausified_16,plain,
! [X] :
( lhs_atom17(X)
| $false ),
inference(fold_definition,[status(thm)],[successor_0,def_lhs_atom17]) ).
fof(def_lhs_atom18,axiom,
( lhs_atom18
<=> subclass(successor_relation,cross_product(universal_class,universal_class)) ),
inference(definition,[],]) ).
fof(to_be_clausified_17,plain,
( lhs_atom18
| $false ),
inference(fold_definition,[status(thm)],[successor_relation1_0,def_lhs_atom18]) ).
fof(def_lhs_atom19,axiom,
( lhs_atom19
<=> inductive(omega) ),
inference(definition,[],]) ).
fof(to_be_clausified_18,plain,
( lhs_atom19
| $false ),
inference(fold_definition,[status(thm)],[omega_is_inductive1_0,def_lhs_atom19]) ).
fof(def_lhs_atom20,axiom,
( lhs_atom20
<=> member(omega,universal_class) ),
inference(definition,[],]) ).
fof(to_be_clausified_19,plain,
( lhs_atom20
| $false ),
inference(fold_definition,[status(thm)],[omega_in_universal_0,def_lhs_atom20]) ).
fof(def_lhs_atom21,axiom,
! [X] :
( lhs_atom21(X)
<=> domain_of(restrict(element_relation,universal_class,X)) = sum_class(X) ),
inference(definition,[],]) ).
fof(to_be_clausified_20,plain,
! [X] :
( lhs_atom21(X)
| $false ),
inference(fold_definition,[status(thm)],[sum_class_definition_0,def_lhs_atom21]) ).
fof(def_lhs_atom22,axiom,
! [X] :
( lhs_atom22(X)
<=> complement(image(element_relation,complement(X))) = power_class(X) ),
inference(definition,[],]) ).
fof(to_be_clausified_21,plain,
! [X] :
( lhs_atom22(X)
| $false ),
inference(fold_definition,[status(thm)],[power_class_definition_0,def_lhs_atom22]) ).
fof(def_lhs_atom23,axiom,
! [Yr,Xr] :
( lhs_atom23(Yr,Xr)
<=> subclass(compose(Yr,Xr),cross_product(universal_class,universal_class)) ),
inference(definition,[],]) ).
fof(to_be_clausified_22,plain,
! [Xr,Yr] :
( lhs_atom23(Yr,Xr)
| $false ),
inference(fold_definition,[status(thm)],[compose1_0,def_lhs_atom23]) ).
fof(def_lhs_atom24,axiom,
! [Y,Xf] :
( lhs_atom24(Y,Xf)
<=> sum_class(image(Xf,singleton(Y))) = apply(Xf,Y) ),
inference(definition,[],]) ).
fof(to_be_clausified_23,plain,
! [Xf,Y] :
( lhs_atom24(Y,Xf)
| $false ),
inference(fold_definition,[status(thm)],[apply_0,def_lhs_atom24]) ).
fof(def_lhs_atom25,axiom,
( lhs_atom25
<=> function(choice) ),
inference(definition,[],]) ).
fof(to_be_clausified_24,plain,
( lhs_atom25
| $false ),
inference(fold_definition,[status(thm)],[choice1_0,def_lhs_atom25]) ).
fof(def_lhs_atom26,axiom,
( lhs_atom26
<=> intersection(cross_product(universal_class,universal_class),intersection(cross_product(universal_class,universal_class),complement(compose(complement(element_relation),inverse(element_relation))))) = subset_relation ),
inference(definition,[],]) ).
fof(to_be_clausified_25,plain,
( lhs_atom26
| $false ),
inference(fold_definition,[status(thm)],[subset_relation_0,def_lhs_atom26]) ).
fof(def_lhs_atom27,axiom,
( lhs_atom27
<=> intersection(inverse(subset_relation),subset_relation) = identity_relation ),
inference(definition,[],]) ).
fof(to_be_clausified_26,plain,
( lhs_atom27
| $false ),
inference(fold_definition,[status(thm)],[identity_relation_0,def_lhs_atom27]) ).
fof(def_lhs_atom28,axiom,
! [Xr] :
( lhs_atom28(Xr)
<=> complement(domain_of(intersection(Xr,identity_relation))) = diagonalise(Xr) ),
inference(definition,[],]) ).
fof(to_be_clausified_27,plain,
! [Xr] :
( lhs_atom28(Xr)
| $false ),
inference(fold_definition,[status(thm)],[diagonalisation_0,def_lhs_atom28]) ).
fof(def_lhs_atom29,axiom,
! [X] :
( lhs_atom29(X)
<=> intersection(domain_of(X),diagonalise(compose(inverse(element_relation),X))) = cantor(X) ),
inference(definition,[],]) ).
fof(to_be_clausified_28,plain,
! [X] :
( lhs_atom29(X)
| $false ),
inference(fold_definition,[status(thm)],[cantor_class_0,def_lhs_atom29]) ).
fof(def_lhs_atom30,axiom,
! [X] :
( lhs_atom30(X)
<=> subclass(X,X) ),
inference(definition,[],]) ).
fof(to_be_clausified_29,plain,
! [X] :
( lhs_atom30(X)
| $false ),
inference(fold_definition,[status(thm)],[subclass_is_reflexive_0,def_lhs_atom30]) ).
% Start CNF derivation
fof(c_0_0,axiom,
! [X4,X2,X1] :
( lhs_atom15(X4,X2,X1)
| ~ $true ),
file('<stdin>',to_be_clausified_14) ).
fof(c_0_1,axiom,
! [X4,X2,X1] :
( lhs_atom14(X4,X2,X1)
| ~ $true ),
file('<stdin>',to_be_clausified_13) ).
fof(c_0_2,axiom,
! [X2,X3,X1] :
( lhs_atom9(X2,X3,X1)
| ~ $true ),
file('<stdin>',to_be_clausified_8) ).
fof(c_0_3,axiom,
! [X2,X3,X1] :
( lhs_atom8(X2,X3,X1)
| ~ $true ),
file('<stdin>',to_be_clausified_7) ).
fof(c_0_4,axiom,
! [X2,X6] :
( lhs_atom24(X2,X6)
| ~ $true ),
file('<stdin>',to_be_clausified_23) ).
fof(c_0_5,axiom,
! [X5,X3] :
( lhs_atom23(X5,X3)
| ~ $true ),
file('<stdin>',to_be_clausified_22) ).
fof(c_0_6,axiom,
! [X3,X1] :
( lhs_atom16(X3,X1)
| ~ $true ),
file('<stdin>',to_be_clausified_15) ).
fof(c_0_7,axiom,
! [X2,X1] :
( lhs_atom7(X2,X1)
| ~ $true ),
file('<stdin>',to_be_clausified_6) ).
fof(c_0_8,axiom,
! [X2,X1] :
( lhs_atom6(X2,X1)
| ~ $true ),
file('<stdin>',to_be_clausified_5) ).
fof(c_0_9,axiom,
! [X2,X1] :
( lhs_atom4(X2,X1)
| ~ $true ),
file('<stdin>',to_be_clausified_3) ).
fof(c_0_10,axiom,
! [X2,X1] :
( lhs_atom2(X2,X1)
| ~ $true ),
file('<stdin>',to_be_clausified_1) ).
fof(c_0_11,axiom,
! [X1] :
( lhs_atom30(X1)
| ~ $true ),
file('<stdin>',to_be_clausified_29) ).
fof(c_0_12,axiom,
! [X1] :
( lhs_atom29(X1)
| ~ $true ),
file('<stdin>',to_be_clausified_28) ).
fof(c_0_13,axiom,
! [X3] :
( lhs_atom28(X3)
| ~ $true ),
file('<stdin>',to_be_clausified_27) ).
fof(c_0_14,axiom,
! [X1] :
( lhs_atom22(X1)
| ~ $true ),
file('<stdin>',to_be_clausified_21) ).
fof(c_0_15,axiom,
! [X1] :
( lhs_atom21(X1)
| ~ $true ),
file('<stdin>',to_be_clausified_20) ).
fof(c_0_16,axiom,
! [X1] :
( lhs_atom17(X1)
| ~ $true ),
file('<stdin>',to_be_clausified_16) ).
fof(c_0_17,axiom,
! [X4] :
( lhs_atom13(X4)
| ~ $true ),
file('<stdin>',to_be_clausified_12) ).
fof(c_0_18,axiom,
! [X2] :
( lhs_atom12(X2)
| ~ $true ),
file('<stdin>',to_be_clausified_11) ).
fof(c_0_19,axiom,
! [X1] :
( lhs_atom11(X1)
| ~ $true ),
file('<stdin>',to_be_clausified_10) ).
fof(c_0_20,axiom,
! [X1] :
( lhs_atom10(X1)
| ~ $true ),
file('<stdin>',to_be_clausified_9) ).
fof(c_0_21,axiom,
! [X1] :
( lhs_atom3(X1)
| ~ $true ),
file('<stdin>',to_be_clausified_2) ).
fof(c_0_22,axiom,
! [X1] :
( lhs_atom1(X1)
| ~ $true ),
file('<stdin>',to_be_clausified_0) ).
fof(c_0_23,axiom,
( lhs_atom27
| ~ $true ),
file('<stdin>',to_be_clausified_26) ).
fof(c_0_24,axiom,
( lhs_atom26
| ~ $true ),
file('<stdin>',to_be_clausified_25) ).
fof(c_0_25,axiom,
( lhs_atom25
| ~ $true ),
file('<stdin>',to_be_clausified_24) ).
fof(c_0_26,axiom,
( lhs_atom20
| ~ $true ),
file('<stdin>',to_be_clausified_19) ).
fof(c_0_27,axiom,
( lhs_atom19
| ~ $true ),
file('<stdin>',to_be_clausified_18) ).
fof(c_0_28,axiom,
( lhs_atom18
| ~ $true ),
file('<stdin>',to_be_clausified_17) ).
fof(c_0_29,axiom,
( lhs_atom5
| ~ $true ),
file('<stdin>',to_be_clausified_4) ).
fof(c_0_30,plain,
! [X4,X2,X1] : lhs_atom15(X4,X2,X1),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_31,plain,
! [X4,X2,X1] : lhs_atom14(X4,X2,X1),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_32,plain,
! [X2,X3,X1] : lhs_atom9(X2,X3,X1),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_33,plain,
! [X2,X3,X1] : lhs_atom8(X2,X3,X1),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_34,plain,
! [X2,X6] : lhs_atom24(X2,X6),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_35,plain,
! [X5,X3] : lhs_atom23(X5,X3),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_36,plain,
! [X3,X1] : lhs_atom16(X3,X1),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_37,plain,
! [X2,X1] : lhs_atom7(X2,X1),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_38,plain,
! [X2,X1] : lhs_atom6(X2,X1),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_39,plain,
! [X2,X1] : lhs_atom4(X2,X1),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_40,plain,
! [X2,X1] : lhs_atom2(X2,X1),
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_41,plain,
! [X1] : lhs_atom30(X1),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_42,plain,
! [X1] : lhs_atom29(X1),
inference(fof_simplification,[status(thm)],[c_0_12]) ).
fof(c_0_43,plain,
! [X3] : lhs_atom28(X3),
inference(fof_simplification,[status(thm)],[c_0_13]) ).
fof(c_0_44,plain,
! [X1] : lhs_atom22(X1),
inference(fof_simplification,[status(thm)],[c_0_14]) ).
fof(c_0_45,plain,
! [X1] : lhs_atom21(X1),
inference(fof_simplification,[status(thm)],[c_0_15]) ).
fof(c_0_46,plain,
! [X1] : lhs_atom17(X1),
inference(fof_simplification,[status(thm)],[c_0_16]) ).
fof(c_0_47,plain,
! [X4] : lhs_atom13(X4),
inference(fof_simplification,[status(thm)],[c_0_17]) ).
fof(c_0_48,plain,
! [X2] : lhs_atom12(X2),
inference(fof_simplification,[status(thm)],[c_0_18]) ).
fof(c_0_49,plain,
! [X1] : lhs_atom11(X1),
inference(fof_simplification,[status(thm)],[c_0_19]) ).
fof(c_0_50,plain,
! [X1] : lhs_atom10(X1),
inference(fof_simplification,[status(thm)],[c_0_20]) ).
fof(c_0_51,plain,
! [X1] : lhs_atom3(X1),
inference(fof_simplification,[status(thm)],[c_0_21]) ).
fof(c_0_52,plain,
! [X1] : lhs_atom1(X1),
inference(fof_simplification,[status(thm)],[c_0_22]) ).
fof(c_0_53,plain,
lhs_atom27,
inference(fof_simplification,[status(thm)],[c_0_23]) ).
fof(c_0_54,plain,
lhs_atom26,
inference(fof_simplification,[status(thm)],[c_0_24]) ).
fof(c_0_55,plain,
lhs_atom25,
inference(fof_simplification,[status(thm)],[c_0_25]) ).
fof(c_0_56,plain,
lhs_atom20,
inference(fof_simplification,[status(thm)],[c_0_26]) ).
fof(c_0_57,plain,
lhs_atom19,
inference(fof_simplification,[status(thm)],[c_0_27]) ).
fof(c_0_58,plain,
lhs_atom18,
inference(fof_simplification,[status(thm)],[c_0_28]) ).
fof(c_0_59,plain,
lhs_atom5,
inference(fof_simplification,[status(thm)],[c_0_29]) ).
fof(c_0_60,plain,
! [X5,X6,X7] : lhs_atom15(X5,X6,X7),
inference(variable_rename,[status(thm)],[c_0_30]) ).
fof(c_0_61,plain,
! [X5,X6,X7] : lhs_atom14(X5,X6,X7),
inference(variable_rename,[status(thm)],[c_0_31]) ).
fof(c_0_62,plain,
! [X4,X5,X6] : lhs_atom9(X4,X5,X6),
inference(variable_rename,[status(thm)],[c_0_32]) ).
fof(c_0_63,plain,
! [X4,X5,X6] : lhs_atom8(X4,X5,X6),
inference(variable_rename,[status(thm)],[c_0_33]) ).
fof(c_0_64,plain,
! [X7,X8] : lhs_atom24(X7,X8),
inference(variable_rename,[status(thm)],[c_0_34]) ).
fof(c_0_65,plain,
! [X6,X7] : lhs_atom23(X6,X7),
inference(variable_rename,[status(thm)],[c_0_35]) ).
fof(c_0_66,plain,
! [X4,X5] : lhs_atom16(X4,X5),
inference(variable_rename,[status(thm)],[c_0_36]) ).
fof(c_0_67,plain,
! [X3,X4] : lhs_atom7(X3,X4),
inference(variable_rename,[status(thm)],[c_0_37]) ).
fof(c_0_68,plain,
! [X3,X4] : lhs_atom6(X3,X4),
inference(variable_rename,[status(thm)],[c_0_38]) ).
fof(c_0_69,plain,
! [X3,X4] : lhs_atom4(X3,X4),
inference(variable_rename,[status(thm)],[c_0_39]) ).
fof(c_0_70,plain,
! [X3,X4] : lhs_atom2(X3,X4),
inference(variable_rename,[status(thm)],[c_0_40]) ).
fof(c_0_71,plain,
! [X2] : lhs_atom30(X2),
inference(variable_rename,[status(thm)],[c_0_41]) ).
fof(c_0_72,plain,
! [X2] : lhs_atom29(X2),
inference(variable_rename,[status(thm)],[c_0_42]) ).
fof(c_0_73,plain,
! [X4] : lhs_atom28(X4),
inference(variable_rename,[status(thm)],[c_0_43]) ).
fof(c_0_74,plain,
! [X2] : lhs_atom22(X2),
inference(variable_rename,[status(thm)],[c_0_44]) ).
fof(c_0_75,plain,
! [X2] : lhs_atom21(X2),
inference(variable_rename,[status(thm)],[c_0_45]) ).
fof(c_0_76,plain,
! [X2] : lhs_atom17(X2),
inference(variable_rename,[status(thm)],[c_0_46]) ).
fof(c_0_77,plain,
! [X5] : lhs_atom13(X5),
inference(variable_rename,[status(thm)],[c_0_47]) ).
fof(c_0_78,plain,
! [X3] : lhs_atom12(X3),
inference(variable_rename,[status(thm)],[c_0_48]) ).
fof(c_0_79,plain,
! [X2] : lhs_atom11(X2),
inference(variable_rename,[status(thm)],[c_0_49]) ).
fof(c_0_80,plain,
! [X2] : lhs_atom10(X2),
inference(variable_rename,[status(thm)],[c_0_50]) ).
fof(c_0_81,plain,
! [X2] : lhs_atom3(X2),
inference(variable_rename,[status(thm)],[c_0_51]) ).
fof(c_0_82,plain,
! [X2] : lhs_atom1(X2),
inference(variable_rename,[status(thm)],[c_0_52]) ).
fof(c_0_83,plain,
lhs_atom27,
c_0_53 ).
fof(c_0_84,plain,
lhs_atom26,
c_0_54 ).
fof(c_0_85,plain,
lhs_atom25,
c_0_55 ).
fof(c_0_86,plain,
lhs_atom20,
c_0_56 ).
fof(c_0_87,plain,
lhs_atom19,
c_0_57 ).
fof(c_0_88,plain,
lhs_atom18,
c_0_58 ).
fof(c_0_89,plain,
lhs_atom5,
c_0_59 ).
cnf(c_0_90,plain,
lhs_atom15(X1,X2,X3),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_91,plain,
lhs_atom14(X1,X2,X3),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
cnf(c_0_92,plain,
lhs_atom9(X1,X2,X3),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_93,plain,
lhs_atom8(X1,X2,X3),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_94,plain,
lhs_atom24(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_64]) ).
cnf(c_0_95,plain,
lhs_atom23(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_96,plain,
lhs_atom16(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
cnf(c_0_97,plain,
lhs_atom7(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_67]) ).
cnf(c_0_98,plain,
lhs_atom6(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_68]) ).
cnf(c_0_99,plain,
lhs_atom4(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_69]) ).
cnf(c_0_100,plain,
lhs_atom2(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_70]) ).
cnf(c_0_101,plain,
lhs_atom30(X1),
inference(split_conjunct,[status(thm)],[c_0_71]) ).
cnf(c_0_102,plain,
lhs_atom29(X1),
inference(split_conjunct,[status(thm)],[c_0_72]) ).
cnf(c_0_103,plain,
lhs_atom28(X1),
inference(split_conjunct,[status(thm)],[c_0_73]) ).
cnf(c_0_104,plain,
lhs_atom22(X1),
inference(split_conjunct,[status(thm)],[c_0_74]) ).
cnf(c_0_105,plain,
lhs_atom21(X1),
inference(split_conjunct,[status(thm)],[c_0_75]) ).
cnf(c_0_106,plain,
lhs_atom17(X1),
inference(split_conjunct,[status(thm)],[c_0_76]) ).
cnf(c_0_107,plain,
lhs_atom13(X1),
inference(split_conjunct,[status(thm)],[c_0_77]) ).
cnf(c_0_108,plain,
lhs_atom12(X1),
inference(split_conjunct,[status(thm)],[c_0_78]) ).
cnf(c_0_109,plain,
lhs_atom11(X1),
inference(split_conjunct,[status(thm)],[c_0_79]) ).
cnf(c_0_110,plain,
lhs_atom10(X1),
inference(split_conjunct,[status(thm)],[c_0_80]) ).
cnf(c_0_111,plain,
lhs_atom3(X1),
inference(split_conjunct,[status(thm)],[c_0_81]) ).
cnf(c_0_112,plain,
lhs_atom1(X1),
inference(split_conjunct,[status(thm)],[c_0_82]) ).
cnf(c_0_113,plain,
lhs_atom27,
inference(split_conjunct,[status(thm)],[c_0_83]) ).
cnf(c_0_114,plain,
lhs_atom26,
inference(split_conjunct,[status(thm)],[c_0_84]) ).
cnf(c_0_115,plain,
lhs_atom25,
inference(split_conjunct,[status(thm)],[c_0_85]) ).
cnf(c_0_116,plain,
lhs_atom20,
inference(split_conjunct,[status(thm)],[c_0_86]) ).
cnf(c_0_117,plain,
lhs_atom19,
inference(split_conjunct,[status(thm)],[c_0_87]) ).
cnf(c_0_118,plain,
lhs_atom18,
inference(split_conjunct,[status(thm)],[c_0_88]) ).
cnf(c_0_119,plain,
lhs_atom5,
inference(split_conjunct,[status(thm)],[c_0_89]) ).
cnf(c_0_120,plain,
lhs_atom15(X1,X2,X3),
c_0_90,
[final] ).
cnf(c_0_121,plain,
lhs_atom14(X1,X2,X3),
c_0_91,
[final] ).
cnf(c_0_122,plain,
lhs_atom9(X1,X2,X3),
c_0_92,
[final] ).
cnf(c_0_123,plain,
lhs_atom8(X1,X2,X3),
c_0_93,
[final] ).
cnf(c_0_124,plain,
lhs_atom24(X1,X2),
c_0_94,
[final] ).
cnf(c_0_125,plain,
lhs_atom23(X1,X2),
c_0_95,
[final] ).
cnf(c_0_126,plain,
lhs_atom16(X1,X2),
c_0_96,
[final] ).
cnf(c_0_127,plain,
lhs_atom7(X1,X2),
c_0_97,
[final] ).
cnf(c_0_128,plain,
lhs_atom6(X1,X2),
c_0_98,
[final] ).
cnf(c_0_129,plain,
lhs_atom4(X1,X2),
c_0_99,
[final] ).
cnf(c_0_130,plain,
lhs_atom2(X1,X2),
c_0_100,
[final] ).
cnf(c_0_131,plain,
lhs_atom30(X1),
c_0_101,
[final] ).
cnf(c_0_132,plain,
lhs_atom29(X1),
c_0_102,
[final] ).
cnf(c_0_133,plain,
lhs_atom28(X1),
c_0_103,
[final] ).
cnf(c_0_134,plain,
lhs_atom22(X1),
c_0_104,
[final] ).
cnf(c_0_135,plain,
lhs_atom21(X1),
c_0_105,
[final] ).
cnf(c_0_136,plain,
lhs_atom17(X1),
c_0_106,
[final] ).
cnf(c_0_137,plain,
lhs_atom13(X1),
c_0_107,
[final] ).
cnf(c_0_138,plain,
lhs_atom12(X1),
c_0_108,
[final] ).
cnf(c_0_139,plain,
lhs_atom11(X1),
c_0_109,
[final] ).
cnf(c_0_140,plain,
lhs_atom10(X1),
c_0_110,
[final] ).
cnf(c_0_141,plain,
lhs_atom3(X1),
c_0_111,
[final] ).
cnf(c_0_142,plain,
lhs_atom1(X1),
c_0_112,
[final] ).
cnf(c_0_143,plain,
lhs_atom27,
c_0_113,
[final] ).
cnf(c_0_144,plain,
lhs_atom26,
c_0_114,
[final] ).
cnf(c_0_145,plain,
lhs_atom25,
c_0_115,
[final] ).
cnf(c_0_146,plain,
lhs_atom20,
c_0_116,
[final] ).
cnf(c_0_147,plain,
lhs_atom19,
c_0_117,
[final] ).
cnf(c_0_148,plain,
lhs_atom18,
c_0_118,
[final] ).
cnf(c_0_149,plain,
lhs_atom5,
c_0_119,
[final] ).
% End CNF derivation
cnf(c_0_120_0,axiom,
second(not_subclass_element(restrict(X1,singleton(X3),X2),null_class)) = range(X1,X3,X2),
inference(unfold_definition,[status(thm)],[c_0_120,def_lhs_atom15]) ).
cnf(c_0_121_0,axiom,
first(not_subclass_element(restrict(X1,X3,singleton(X2)),null_class)) = domain(X1,X3,X2),
inference(unfold_definition,[status(thm)],[c_0_121,def_lhs_atom14]) ).
cnf(c_0_122_0,axiom,
intersection(cross_product(X3,X1),X2) = restrict(X2,X3,X1),
inference(unfold_definition,[status(thm)],[c_0_122,def_lhs_atom9]) ).
cnf(c_0_123_0,axiom,
intersection(X2,cross_product(X3,X1)) = restrict(X2,X3,X1),
inference(unfold_definition,[status(thm)],[c_0_123,def_lhs_atom8]) ).
cnf(c_0_124_0,axiom,
sum_class(image(X2,singleton(X1))) = apply(X2,X1),
inference(unfold_definition,[status(thm)],[c_0_124,def_lhs_atom24]) ).
cnf(c_0_125_0,axiom,
subclass(compose(X1,X2),cross_product(universal_class,universal_class)),
inference(unfold_definition,[status(thm)],[c_0_125,def_lhs_atom23]) ).
cnf(c_0_126_0,axiom,
range_of(restrict(X1,X2,universal_class)) = image(X1,X2),
inference(unfold_definition,[status(thm)],[c_0_126,def_lhs_atom16]) ).
cnf(c_0_127_0,axiom,
intersection(complement(intersection(X2,X1)),complement(intersection(complement(X2),complement(X1)))) = symmetric_difference(X2,X1),
inference(unfold_definition,[status(thm)],[c_0_127,def_lhs_atom7]) ).
cnf(c_0_128_0,axiom,
complement(intersection(complement(X2),complement(X1))) = union(X2,X1),
inference(unfold_definition,[status(thm)],[c_0_128,def_lhs_atom6]) ).
cnf(c_0_129_0,axiom,
unordered_pair(singleton(X2),unordered_pair(X2,singleton(X1))) = ordered_pair(X2,X1),
inference(unfold_definition,[status(thm)],[c_0_129,def_lhs_atom4]) ).
cnf(c_0_130_0,axiom,
member(unordered_pair(X2,X1),universal_class),
inference(unfold_definition,[status(thm)],[c_0_130,def_lhs_atom2]) ).
cnf(c_0_131_0,axiom,
subclass(X1,X1),
inference(unfold_definition,[status(thm)],[c_0_131,def_lhs_atom30]) ).
cnf(c_0_132_0,axiom,
intersection(domain_of(X1),diagonalise(compose(inverse(element_relation),X1))) = cantor(X1),
inference(unfold_definition,[status(thm)],[c_0_132,def_lhs_atom29]) ).
cnf(c_0_133_0,axiom,
complement(domain_of(intersection(X1,identity_relation))) = diagonalise(X1),
inference(unfold_definition,[status(thm)],[c_0_133,def_lhs_atom28]) ).
cnf(c_0_134_0,axiom,
complement(image(element_relation,complement(X1))) = power_class(X1),
inference(unfold_definition,[status(thm)],[c_0_134,def_lhs_atom22]) ).
cnf(c_0_135_0,axiom,
domain_of(restrict(element_relation,universal_class,X1)) = sum_class(X1),
inference(unfold_definition,[status(thm)],[c_0_135,def_lhs_atom21]) ).
cnf(c_0_136_0,axiom,
union(X1,singleton(X1)) = successor(X1),
inference(unfold_definition,[status(thm)],[c_0_136,def_lhs_atom17]) ).
cnf(c_0_137_0,axiom,
domain_of(inverse(X1)) = range_of(X1),
inference(unfold_definition,[status(thm)],[c_0_137,def_lhs_atom13]) ).
cnf(c_0_138_0,axiom,
domain_of(flip(cross_product(X1,universal_class))) = inverse(X1),
inference(unfold_definition,[status(thm)],[c_0_138,def_lhs_atom12]) ).
cnf(c_0_139_0,axiom,
subclass(flip(X1),cross_product(cross_product(universal_class,universal_class),universal_class)),
inference(unfold_definition,[status(thm)],[c_0_139,def_lhs_atom11]) ).
cnf(c_0_140_0,axiom,
subclass(rotate(X1),cross_product(cross_product(universal_class,universal_class),universal_class)),
inference(unfold_definition,[status(thm)],[c_0_140,def_lhs_atom10]) ).
cnf(c_0_141_0,axiom,
unordered_pair(X1,X1) = singleton(X1),
inference(unfold_definition,[status(thm)],[c_0_141,def_lhs_atom3]) ).
cnf(c_0_142_0,axiom,
subclass(X1,universal_class),
inference(unfold_definition,[status(thm)],[c_0_142,def_lhs_atom1]) ).
cnf(c_0_143_0,axiom,
intersection(inverse(subset_relation),subset_relation) = identity_relation,
inference(unfold_definition,[status(thm)],[c_0_143,def_lhs_atom27]) ).
cnf(c_0_144_0,axiom,
intersection(cross_product(universal_class,universal_class),intersection(cross_product(universal_class,universal_class),complement(compose(complement(element_relation),inverse(element_relation))))) = subset_relation,
inference(unfold_definition,[status(thm)],[c_0_144,def_lhs_atom26]) ).
cnf(c_0_145_0,axiom,
function(choice),
inference(unfold_definition,[status(thm)],[c_0_145,def_lhs_atom25]) ).
cnf(c_0_146_0,axiom,
member(omega,universal_class),
inference(unfold_definition,[status(thm)],[c_0_146,def_lhs_atom20]) ).
cnf(c_0_147_0,axiom,
inductive(omega),
inference(unfold_definition,[status(thm)],[c_0_147,def_lhs_atom19]) ).
cnf(c_0_148_0,axiom,
subclass(successor_relation,cross_product(universal_class,universal_class)),
inference(unfold_definition,[status(thm)],[c_0_148,def_lhs_atom18]) ).
cnf(c_0_149_0,axiom,
subclass(element_relation,cross_product(universal_class,universal_class)),
inference(unfold_definition,[status(thm)],[c_0_149,def_lhs_atom5]) ).
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
fof(c_0_0_001,axiom,
! [X6,X7,X8] :
( ~ operation(X8)
| ~ operation(X7)
| ~ compatible(X6,X8,X7)
| apply(X7,ordered_pair(apply(X6,not_homomorphism1(X6,X8,X7)),apply(X6,not_homomorphism2(X6,X8,X7)))) != apply(X6,apply(X8,ordered_pair(not_homomorphism1(X6,X8,X7),not_homomorphism2(X6,X8,X7))))
| homomorphism(X6,X8,X7) ),
file('<stdin>',homomorphism6) ).
fof(c_0_1_002,axiom,
! [X6,X7,X8] :
( ~ operation(X8)
| ~ operation(X7)
| ~ compatible(X6,X8,X7)
| member(ordered_pair(not_homomorphism1(X6,X8,X7),not_homomorphism2(X6,X8,X7)),domain_of(X8))
| homomorphism(X6,X8,X7) ),
file('<stdin>',homomorphism5) ).
fof(c_0_2_003,axiom,
! [X3,X12,X4,X5] :
( ~ member(ordered_pair(ordered_pair(X4,X12),X5),X3)
| ~ member(ordered_pair(ordered_pair(X5,X4),X12),cross_product(cross_product(universal_class,universal_class),universal_class))
| member(ordered_pair(ordered_pair(X5,X4),X12),rotate(X3)) ),
file('<stdin>',rotate3) ).
fof(c_0_3_004,axiom,
! [X3,X12,X4,X5] :
( ~ member(ordered_pair(ordered_pair(X4,X5),X12),X3)
| ~ member(ordered_pair(ordered_pair(X5,X4),X12),cross_product(cross_product(universal_class,universal_class),universal_class))
| member(ordered_pair(ordered_pair(X5,X4),X12),flip(X3)) ),
file('<stdin>',flip3) ).
fof(c_0_4_005,axiom,
! [X2,X6,X7,X8,X3] :
( ~ homomorphism(X6,X8,X7)
| ~ member(ordered_pair(X3,X2),domain_of(X8))
| apply(X7,ordered_pair(apply(X6,X3),apply(X6,X2))) = apply(X6,apply(X8,ordered_pair(X3,X2))) ),
file('<stdin>',homomorphism4) ).
fof(c_0_5_006,axiom,
! [X1,X10,X2,X11] :
( ~ member(X1,image(X10,image(X11,singleton(X2))))
| ~ member(ordered_pair(X2,X1),cross_product(universal_class,universal_class))
| member(ordered_pair(X2,X1),compose(X10,X11)) ),
file('<stdin>',compose3) ).
fof(c_0_6_007,axiom,
! [X3,X12,X4,X5] :
( ~ member(ordered_pair(ordered_pair(X5,X4),X12),rotate(X3))
| member(ordered_pair(ordered_pair(X4,X12),X5),X3) ),
file('<stdin>',rotate2) ).
fof(c_0_7_008,axiom,
! [X3,X12,X4,X5] :
( ~ member(ordered_pair(ordered_pair(X5,X4),X12),flip(X3))
| member(ordered_pair(ordered_pair(X4,X5),X12),X3) ),
file('<stdin>',flip2) ).
fof(c_0_8_009,axiom,
! [X1,X10,X2,X11] :
( ~ member(ordered_pair(X2,X1),compose(X10,X11))
| member(X1,image(X10,image(X11,singleton(X2)))) ),
file('<stdin>',compose2) ).
fof(c_0_9_010,axiom,
! [X9] :
( ~ function(X9)
| cross_product(domain_of(domain_of(X9)),domain_of(domain_of(X9))) != domain_of(X9)
| ~ subclass(range_of(X9),domain_of(domain_of(X9)))
| operation(X9) ),
file('<stdin>',operation4) ).
fof(c_0_10_011,axiom,
! [X2,X3] :
( ~ member(ordered_pair(X3,X2),cross_product(universal_class,universal_class))
| ~ member(X3,X2)
| member(ordered_pair(X3,X2),element_relation) ),
file('<stdin>',element_relation3) ).
fof(c_0_11_012,axiom,
! [X6,X7,X8] :
( ~ function(X6)
| domain_of(domain_of(X8)) != domain_of(X6)
| ~ subclass(range_of(X6),domain_of(domain_of(X7)))
| compatible(X6,X8,X7) ),
file('<stdin>',compatible4) ).
fof(c_0_12_013,axiom,
! [X2,X3,X4,X5] :
( ~ member(ordered_pair(X3,X2),cross_product(X5,X4))
| member(X3,unordered_pair(X3,X2)) ),
file('<stdin>',corollary_1_to_unordered_pair) ).
fof(c_0_13_014,axiom,
! [X2,X3,X4,X5] :
( ~ member(ordered_pair(X3,X2),cross_product(X5,X4))
| member(X2,unordered_pair(X3,X2)) ),
file('<stdin>',corollary_2_to_unordered_pair) ).
fof(c_0_14_015,axiom,
! [X2,X3] :
( successor(X3) != X2
| ~ member(ordered_pair(X3,X2),cross_product(universal_class,universal_class))
| member(ordered_pair(X3,X2),successor_relation) ),
file('<stdin>',successor_relation3) ).
fof(c_0_15_016,axiom,
! [X6,X7,X8] :
( ~ homomorphism(X6,X8,X7)
| compatible(X6,X8,X7) ),
file('<stdin>',homomorphism3) ).
fof(c_0_16_017,axiom,
! [X9] :
( ~ subclass(X9,cross_product(universal_class,universal_class))
| ~ subclass(compose(X9,inverse(X9)),identity_relation)
| function(X9) ),
file('<stdin>',function3) ).
fof(c_0_17_018,axiom,
! [X1,X3] :
( restrict(X3,singleton(X1),universal_class) != null_class
| ~ member(X1,domain_of(X3)) ),
file('<stdin>',domain1) ).
fof(c_0_18_019,axiom,
! [X6,X7,X8] :
( ~ compatible(X6,X8,X7)
| subclass(range_of(X6),domain_of(domain_of(X7))) ),
file('<stdin>',compatible3) ).
fof(c_0_19_020,axiom,
! [X2,X3,X4,X5] :
( ~ member(ordered_pair(X5,X4),cross_product(X3,X2))
| member(X5,X3) ),
file('<stdin>',cartesian_product1) ).
fof(c_0_20_021,axiom,
! [X2,X3,X4,X5] :
( ~ member(ordered_pair(X5,X4),cross_product(X3,X2))
| member(X4,X2) ),
file('<stdin>',cartesian_product2) ).
fof(c_0_21_022,axiom,
! [X2,X3,X4,X5] :
( ~ member(ordered_pair(X5,X4),cross_product(X3,X2))
| member(X5,universal_class) ),
file('<stdin>',corollary_1_to_cartesian_product) ).
fof(c_0_22_023,axiom,
! [X2,X3,X4,X5] :
( ~ member(ordered_pair(X5,X4),cross_product(X3,X2))
| member(X4,universal_class) ),
file('<stdin>',corollary_2_to_cartesian_product) ).
fof(c_0_23_024,axiom,
! [X2,X3,X4,X5] :
( ~ member(X5,X3)
| ~ member(X4,X2)
| member(ordered_pair(X5,X4),cross_product(X3,X2)) ),
file('<stdin>',cartesian_product3) ).
fof(c_0_24_025,axiom,
! [X6,X7,X8] :
( ~ compatible(X6,X8,X7)
| domain_of(domain_of(X8)) = domain_of(X6) ),
file('<stdin>',compatible2) ).
fof(c_0_25_026,axiom,
! [X1,X3] :
( ~ member(X1,universal_class)
| restrict(X3,singleton(X1),universal_class) = null_class
| member(X1,domain_of(X3)) ),
file('<stdin>',domain2) ).
fof(c_0_26_027,axiom,
! [X1,X2,X3] :
( ~ member(X1,cross_product(X3,X2))
| ordered_pair(first(X1),second(X1)) = X1 ),
file('<stdin>',cartesian_product4) ).
fof(c_0_27_028,axiom,
! [X6,X7,X8] :
( ~ compatible(X6,X8,X7)
| function(X6) ),
file('<stdin>',compatible1) ).
fof(c_0_28_029,axiom,
! [X6,X7,X8] :
( ~ homomorphism(X6,X8,X7)
| operation(X8) ),
file('<stdin>',homomorphism1) ).
fof(c_0_29_030,axiom,
! [X6,X7,X8] :
( ~ homomorphism(X6,X8,X7)
| operation(X7) ),
file('<stdin>',homomorphism2) ).
fof(c_0_30_031,axiom,
! [X1,X2,X3] :
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X3,X2)) ),
file('<stdin>',intersection3) ).
fof(c_0_31_032,axiom,
! [X3] :
( ~ subclass(compose(X3,inverse(X3)),identity_relation)
| single_valued_class(X3) ),
file('<stdin>',single_valued_class2) ).
fof(c_0_32_033,axiom,
! [X3] :
( ~ member(null_class,X3)
| ~ subclass(image(successor_relation,X3),X3)
| inductive(X3) ),
file('<stdin>',inductive3) ).
fof(c_0_33_034,axiom,
! [X2,X3] :
( ~ member(not_subclass_element(X3,X2),X2)
| subclass(X3,X2) ),
file('<stdin>',not_subclass_members2) ).
fof(c_0_34_035,axiom,
! [X1,X2,X3] :
( ~ member(X1,intersection(X3,X2))
| member(X1,X3) ),
file('<stdin>',intersection1) ).
fof(c_0_35_036,axiom,
! [X1,X2,X3] :
( ~ member(X1,intersection(X3,X2))
| member(X1,X2) ),
file('<stdin>',intersection2) ).
fof(c_0_36_037,axiom,
! [X2,X3] :
( ~ member(ordered_pair(X3,X2),element_relation)
| member(X3,X2) ),
file('<stdin>',element_relation2) ).
fof(c_0_37_038,axiom,
! [X2,X3,X5] :
( ~ member(X5,unordered_pair(X3,X2))
| X5 = X3
| X5 = X2 ),
file('<stdin>',unordered_pair_member) ).
fof(c_0_38_039,axiom,
! [X2,X3] :
( ~ member(ordered_pair(X3,X2),successor_relation)
| successor(X3) = X2 ),
file('<stdin>',successor_relation2) ).
fof(c_0_39_040,axiom,
! [X9,X3] :
( ~ function(X9)
| ~ member(X3,universal_class)
| member(image(X9,X3),universal_class) ),
file('<stdin>',replacement) ).
fof(c_0_40_041,axiom,
! [X9] :
( ~ operation(X9)
| cross_product(domain_of(domain_of(X9)),domain_of(domain_of(X9))) = domain_of(X9) ),
file('<stdin>',operation2) ).
fof(c_0_41_042,axiom,
! [X2,X3] :
( ~ member(X3,universal_class)
| member(X3,unordered_pair(X3,X2)) ),
file('<stdin>',unordered_pair2) ).
fof(c_0_42_043,axiom,
! [X2,X3] :
( ~ member(X2,universal_class)
| member(X2,unordered_pair(X3,X2)) ),
file('<stdin>',unordered_pair3) ).
fof(c_0_43_044,axiom,
! [X2,X3,X5] :
( ~ subclass(X3,X2)
| ~ member(X5,X3)
| member(X5,X2) ),
file('<stdin>',subclass_members) ).
fof(c_0_44_045,axiom,
! [X1,X2,X3] :
( ~ subclass(X3,X2)
| ~ subclass(X2,X1)
| subclass(X3,X1) ),
file('<stdin>',transitivity_of_subclass) ).
fof(c_0_45_046,axiom,
! [X2] :
( ~ member(X2,universal_class)
| X2 = null_class
| member(apply(choice,X2),X2) ),
file('<stdin>',choice2) ).
fof(c_0_46_047,axiom,
! [X3] :
( ~ single_valued_class(X3)
| subclass(compose(X3,inverse(X3)),identity_relation) ),
file('<stdin>',single_valued_class1) ).
fof(c_0_47_048,axiom,
! [X9] :
( ~ function(X9)
| subclass(compose(X9,inverse(X9)),identity_relation) ),
file('<stdin>',function2) ).
fof(c_0_48_049,axiom,
! [X1,X3] :
( ~ member(X1,universal_class)
| member(X1,complement(X3))
| member(X1,X3) ),
file('<stdin>',complement2) ).
fof(c_0_49_050,axiom,
! [X1,X3] :
( ~ member(X1,complement(X3))
| ~ member(X1,X3) ),
file('<stdin>',complement1) ).
fof(c_0_50_051,axiom,
! [X2,X3] :
( member(not_subclass_element(X3,X2),X3)
| subclass(X3,X2) ),
file('<stdin>',not_subclass_members1) ).
fof(c_0_51_052,axiom,
! [X2,X3] :
( ~ subclass(X3,X2)
| ~ subclass(X2,X3)
| X3 = X2 ),
file('<stdin>',subclass_implies_equal) ).
fof(c_0_52_053,axiom,
! [X9] :
( ~ operation(X9)
| subclass(range_of(X9),domain_of(domain_of(X9))) ),
file('<stdin>',operation3) ).
fof(c_0_53_054,axiom,
! [X3] :
( ~ inductive(X3)
| subclass(image(successor_relation,X3),X3) ),
file('<stdin>',inductive2) ).
fof(c_0_54_055,axiom,
! [X9] :
( ~ function(X9)
| subclass(X9,cross_product(universal_class,universal_class)) ),
file('<stdin>',function1) ).
fof(c_0_55_056,axiom,
! [X3] :
( ~ member(X3,universal_class)
| member(sum_class(X3),universal_class) ),
file('<stdin>',sum_class2) ).
fof(c_0_56_057,axiom,
! [X5] :
( ~ member(X5,universal_class)
| member(power_class(X5),universal_class) ),
file('<stdin>',power_class2) ).
fof(c_0_57_058,axiom,
! [X9] :
( ~ function(inverse(X9))
| ~ function(X9)
| one_to_one(X9) ),
file('<stdin>',one_to_one3) ).
fof(c_0_58_059,axiom,
! [X3] :
( X3 = null_class
| member(regular(X3),X3) ),
file('<stdin>',regularity1) ).
fof(c_0_59_060,axiom,
! [X3] :
( X3 = null_class
| intersection(X3,regular(X3)) = null_class ),
file('<stdin>',regularity2) ).
fof(c_0_60_061,axiom,
! [X3] :
( ~ inductive(X3)
| member(null_class,X3) ),
file('<stdin>',inductive1) ).
fof(c_0_61_062,axiom,
! [X2] :
( ~ inductive(X2)
| subclass(omega,X2) ),
file('<stdin>',omega_is_inductive2) ).
fof(c_0_62_063,axiom,
! [X2,X3] :
( X3 != X2
| subclass(X3,X2) ),
file('<stdin>',equal_implies_subclass1) ).
fof(c_0_63_064,axiom,
! [X2,X3] :
( X3 != X2
| subclass(X2,X3) ),
file('<stdin>',equal_implies_subclass2) ).
fof(c_0_64_065,axiom,
! [X9] :
( ~ one_to_one(X9)
| function(inverse(X9)) ),
file('<stdin>',one_to_one2) ).
fof(c_0_65_066,axiom,
! [X9] :
( ~ one_to_one(X9)
| function(X9) ),
file('<stdin>',one_to_one1) ).
fof(c_0_66_067,axiom,
! [X9] :
( ~ operation(X9)
| function(X9) ),
file('<stdin>',operation1) ).
fof(c_0_67_068,plain,
! [X6,X7,X8] :
( ~ operation(X8)
| ~ operation(X7)
| ~ compatible(X6,X8,X7)
| apply(X7,ordered_pair(apply(X6,not_homomorphism1(X6,X8,X7)),apply(X6,not_homomorphism2(X6,X8,X7)))) != apply(X6,apply(X8,ordered_pair(not_homomorphism1(X6,X8,X7),not_homomorphism2(X6,X8,X7))))
| homomorphism(X6,X8,X7) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_68_069,plain,
! [X6,X7,X8] :
( ~ operation(X8)
| ~ operation(X7)
| ~ compatible(X6,X8,X7)
| member(ordered_pair(not_homomorphism1(X6,X8,X7),not_homomorphism2(X6,X8,X7)),domain_of(X8))
| homomorphism(X6,X8,X7) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_69_070,plain,
! [X3,X12,X4,X5] :
( ~ member(ordered_pair(ordered_pair(X4,X12),X5),X3)
| ~ member(ordered_pair(ordered_pair(X5,X4),X12),cross_product(cross_product(universal_class,universal_class),universal_class))
| member(ordered_pair(ordered_pair(X5,X4),X12),rotate(X3)) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_70_071,plain,
! [X3,X12,X4,X5] :
( ~ member(ordered_pair(ordered_pair(X4,X5),X12),X3)
| ~ member(ordered_pair(ordered_pair(X5,X4),X12),cross_product(cross_product(universal_class,universal_class),universal_class))
| member(ordered_pair(ordered_pair(X5,X4),X12),flip(X3)) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_71_072,plain,
! [X2,X6,X7,X8,X3] :
( ~ homomorphism(X6,X8,X7)
| ~ member(ordered_pair(X3,X2),domain_of(X8))
| apply(X7,ordered_pair(apply(X6,X3),apply(X6,X2))) = apply(X6,apply(X8,ordered_pair(X3,X2))) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_72_073,plain,
! [X1,X10,X2,X11] :
( ~ member(X1,image(X10,image(X11,singleton(X2))))
| ~ member(ordered_pair(X2,X1),cross_product(universal_class,universal_class))
| member(ordered_pair(X2,X1),compose(X10,X11)) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_73_074,plain,
! [X3,X12,X4,X5] :
( ~ member(ordered_pair(ordered_pair(X5,X4),X12),rotate(X3))
| member(ordered_pair(ordered_pair(X4,X12),X5),X3) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_74_075,plain,
! [X3,X12,X4,X5] :
( ~ member(ordered_pair(ordered_pair(X5,X4),X12),flip(X3))
| member(ordered_pair(ordered_pair(X4,X5),X12),X3) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_75_076,plain,
! [X1,X10,X2,X11] :
( ~ member(ordered_pair(X2,X1),compose(X10,X11))
| member(X1,image(X10,image(X11,singleton(X2)))) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_76_077,plain,
! [X9] :
( ~ function(X9)
| cross_product(domain_of(domain_of(X9)),domain_of(domain_of(X9))) != domain_of(X9)
| ~ subclass(range_of(X9),domain_of(domain_of(X9)))
| operation(X9) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_77_078,plain,
! [X2,X3] :
( ~ member(ordered_pair(X3,X2),cross_product(universal_class,universal_class))
| ~ member(X3,X2)
| member(ordered_pair(X3,X2),element_relation) ),
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_78_079,plain,
! [X6,X7,X8] :
( ~ function(X6)
| domain_of(domain_of(X8)) != domain_of(X6)
| ~ subclass(range_of(X6),domain_of(domain_of(X7)))
| compatible(X6,X8,X7) ),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_79_080,plain,
! [X2,X3,X4,X5] :
( ~ member(ordered_pair(X3,X2),cross_product(X5,X4))
| member(X3,unordered_pair(X3,X2)) ),
inference(fof_simplification,[status(thm)],[c_0_12]) ).
fof(c_0_80_081,plain,
! [X2,X3,X4,X5] :
( ~ member(ordered_pair(X3,X2),cross_product(X5,X4))
| member(X2,unordered_pair(X3,X2)) ),
inference(fof_simplification,[status(thm)],[c_0_13]) ).
fof(c_0_81_082,plain,
! [X2,X3] :
( successor(X3) != X2
| ~ member(ordered_pair(X3,X2),cross_product(universal_class,universal_class))
| member(ordered_pair(X3,X2),successor_relation) ),
inference(fof_simplification,[status(thm)],[c_0_14]) ).
fof(c_0_82_083,plain,
! [X6,X7,X8] :
( ~ homomorphism(X6,X8,X7)
| compatible(X6,X8,X7) ),
inference(fof_simplification,[status(thm)],[c_0_15]) ).
fof(c_0_83_084,plain,
! [X9] :
( ~ subclass(X9,cross_product(universal_class,universal_class))
| ~ subclass(compose(X9,inverse(X9)),identity_relation)
| function(X9) ),
inference(fof_simplification,[status(thm)],[c_0_16]) ).
fof(c_0_84_085,plain,
! [X1,X3] :
( restrict(X3,singleton(X1),universal_class) != null_class
| ~ member(X1,domain_of(X3)) ),
inference(fof_simplification,[status(thm)],[c_0_17]) ).
fof(c_0_85_086,plain,
! [X6,X7,X8] :
( ~ compatible(X6,X8,X7)
| subclass(range_of(X6),domain_of(domain_of(X7))) ),
inference(fof_simplification,[status(thm)],[c_0_18]) ).
fof(c_0_86_087,plain,
! [X2,X3,X4,X5] :
( ~ member(ordered_pair(X5,X4),cross_product(X3,X2))
| member(X5,X3) ),
inference(fof_simplification,[status(thm)],[c_0_19]) ).
fof(c_0_87_088,plain,
! [X2,X3,X4,X5] :
( ~ member(ordered_pair(X5,X4),cross_product(X3,X2))
| member(X4,X2) ),
inference(fof_simplification,[status(thm)],[c_0_20]) ).
fof(c_0_88_089,plain,
! [X2,X3,X4,X5] :
( ~ member(ordered_pair(X5,X4),cross_product(X3,X2))
| member(X5,universal_class) ),
inference(fof_simplification,[status(thm)],[c_0_21]) ).
fof(c_0_89_090,plain,
! [X2,X3,X4,X5] :
( ~ member(ordered_pair(X5,X4),cross_product(X3,X2))
| member(X4,universal_class) ),
inference(fof_simplification,[status(thm)],[c_0_22]) ).
fof(c_0_90_091,plain,
! [X2,X3,X4,X5] :
( ~ member(X5,X3)
| ~ member(X4,X2)
| member(ordered_pair(X5,X4),cross_product(X3,X2)) ),
inference(fof_simplification,[status(thm)],[c_0_23]) ).
fof(c_0_91_092,plain,
! [X6,X7,X8] :
( ~ compatible(X6,X8,X7)
| domain_of(domain_of(X8)) = domain_of(X6) ),
inference(fof_simplification,[status(thm)],[c_0_24]) ).
fof(c_0_92_093,plain,
! [X1,X3] :
( ~ member(X1,universal_class)
| restrict(X3,singleton(X1),universal_class) = null_class
| member(X1,domain_of(X3)) ),
inference(fof_simplification,[status(thm)],[c_0_25]) ).
fof(c_0_93_094,plain,
! [X1,X2,X3] :
( ~ member(X1,cross_product(X3,X2))
| ordered_pair(first(X1),second(X1)) = X1 ),
inference(fof_simplification,[status(thm)],[c_0_26]) ).
fof(c_0_94_095,plain,
! [X6,X7,X8] :
( ~ compatible(X6,X8,X7)
| function(X6) ),
inference(fof_simplification,[status(thm)],[c_0_27]) ).
fof(c_0_95_096,plain,
! [X6,X7,X8] :
( ~ homomorphism(X6,X8,X7)
| operation(X8) ),
inference(fof_simplification,[status(thm)],[c_0_28]) ).
fof(c_0_96_097,plain,
! [X6,X7,X8] :
( ~ homomorphism(X6,X8,X7)
| operation(X7) ),
inference(fof_simplification,[status(thm)],[c_0_29]) ).
fof(c_0_97_098,plain,
! [X1,X2,X3] :
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X3,X2)) ),
inference(fof_simplification,[status(thm)],[c_0_30]) ).
fof(c_0_98_099,plain,
! [X3] :
( ~ subclass(compose(X3,inverse(X3)),identity_relation)
| single_valued_class(X3) ),
inference(fof_simplification,[status(thm)],[c_0_31]) ).
fof(c_0_99_100,plain,
! [X3] :
( ~ member(null_class,X3)
| ~ subclass(image(successor_relation,X3),X3)
| inductive(X3) ),
inference(fof_simplification,[status(thm)],[c_0_32]) ).
fof(c_0_100_101,plain,
! [X2,X3] :
( ~ member(not_subclass_element(X3,X2),X2)
| subclass(X3,X2) ),
inference(fof_simplification,[status(thm)],[c_0_33]) ).
fof(c_0_101_102,plain,
! [X1,X2,X3] :
( ~ member(X1,intersection(X3,X2))
| member(X1,X3) ),
inference(fof_simplification,[status(thm)],[c_0_34]) ).
fof(c_0_102_103,plain,
! [X1,X2,X3] :
( ~ member(X1,intersection(X3,X2))
| member(X1,X2) ),
inference(fof_simplification,[status(thm)],[c_0_35]) ).
fof(c_0_103_104,plain,
! [X2,X3] :
( ~ member(ordered_pair(X3,X2),element_relation)
| member(X3,X2) ),
inference(fof_simplification,[status(thm)],[c_0_36]) ).
fof(c_0_104_105,plain,
! [X2,X3,X5] :
( ~ member(X5,unordered_pair(X3,X2))
| X5 = X3
| X5 = X2 ),
inference(fof_simplification,[status(thm)],[c_0_37]) ).
fof(c_0_105_106,plain,
! [X2,X3] :
( ~ member(ordered_pair(X3,X2),successor_relation)
| successor(X3) = X2 ),
inference(fof_simplification,[status(thm)],[c_0_38]) ).
fof(c_0_106_107,plain,
! [X9,X3] :
( ~ function(X9)
| ~ member(X3,universal_class)
| member(image(X9,X3),universal_class) ),
inference(fof_simplification,[status(thm)],[c_0_39]) ).
fof(c_0_107_108,plain,
! [X9] :
( ~ operation(X9)
| cross_product(domain_of(domain_of(X9)),domain_of(domain_of(X9))) = domain_of(X9) ),
inference(fof_simplification,[status(thm)],[c_0_40]) ).
fof(c_0_108_109,plain,
! [X2,X3] :
( ~ member(X3,universal_class)
| member(X3,unordered_pair(X3,X2)) ),
inference(fof_simplification,[status(thm)],[c_0_41]) ).
fof(c_0_109_110,plain,
! [X2,X3] :
( ~ member(X2,universal_class)
| member(X2,unordered_pair(X3,X2)) ),
inference(fof_simplification,[status(thm)],[c_0_42]) ).
fof(c_0_110_111,plain,
! [X2,X3,X5] :
( ~ subclass(X3,X2)
| ~ member(X5,X3)
| member(X5,X2) ),
inference(fof_simplification,[status(thm)],[c_0_43]) ).
fof(c_0_111_112,plain,
! [X1,X2,X3] :
( ~ subclass(X3,X2)
| ~ subclass(X2,X1)
| subclass(X3,X1) ),
inference(fof_simplification,[status(thm)],[c_0_44]) ).
fof(c_0_112_113,plain,
! [X2] :
( ~ member(X2,universal_class)
| X2 = null_class
| member(apply(choice,X2),X2) ),
inference(fof_simplification,[status(thm)],[c_0_45]) ).
fof(c_0_113_114,plain,
! [X3] :
( ~ single_valued_class(X3)
| subclass(compose(X3,inverse(X3)),identity_relation) ),
inference(fof_simplification,[status(thm)],[c_0_46]) ).
fof(c_0_114_115,plain,
! [X9] :
( ~ function(X9)
| subclass(compose(X9,inverse(X9)),identity_relation) ),
inference(fof_simplification,[status(thm)],[c_0_47]) ).
fof(c_0_115_116,plain,
! [X1,X3] :
( ~ member(X1,universal_class)
| member(X1,complement(X3))
| member(X1,X3) ),
inference(fof_simplification,[status(thm)],[c_0_48]) ).
fof(c_0_116_117,plain,
! [X1,X3] :
( ~ member(X1,complement(X3))
| ~ member(X1,X3) ),
inference(fof_simplification,[status(thm)],[c_0_49]) ).
fof(c_0_117_118,axiom,
! [X2,X3] :
( member(not_subclass_element(X3,X2),X3)
| subclass(X3,X2) ),
c_0_50 ).
fof(c_0_118_119,plain,
! [X2,X3] :
( ~ subclass(X3,X2)
| ~ subclass(X2,X3)
| X3 = X2 ),
inference(fof_simplification,[status(thm)],[c_0_51]) ).
fof(c_0_119_120,plain,
! [X9] :
( ~ operation(X9)
| subclass(range_of(X9),domain_of(domain_of(X9))) ),
inference(fof_simplification,[status(thm)],[c_0_52]) ).
fof(c_0_120_121,plain,
! [X3] :
( ~ inductive(X3)
| subclass(image(successor_relation,X3),X3) ),
inference(fof_simplification,[status(thm)],[c_0_53]) ).
fof(c_0_121_122,plain,
! [X9] :
( ~ function(X9)
| subclass(X9,cross_product(universal_class,universal_class)) ),
inference(fof_simplification,[status(thm)],[c_0_54]) ).
fof(c_0_122_123,plain,
! [X3] :
( ~ member(X3,universal_class)
| member(sum_class(X3),universal_class) ),
inference(fof_simplification,[status(thm)],[c_0_55]) ).
fof(c_0_123_124,plain,
! [X5] :
( ~ member(X5,universal_class)
| member(power_class(X5),universal_class) ),
inference(fof_simplification,[status(thm)],[c_0_56]) ).
fof(c_0_124_125,plain,
! [X9] :
( ~ function(inverse(X9))
| ~ function(X9)
| one_to_one(X9) ),
inference(fof_simplification,[status(thm)],[c_0_57]) ).
fof(c_0_125_126,axiom,
! [X3] :
( X3 = null_class
| member(regular(X3),X3) ),
c_0_58 ).
fof(c_0_126_127,axiom,
! [X3] :
( X3 = null_class
| intersection(X3,regular(X3)) = null_class ),
c_0_59 ).
fof(c_0_127_128,plain,
! [X3] :
( ~ inductive(X3)
| member(null_class,X3) ),
inference(fof_simplification,[status(thm)],[c_0_60]) ).
fof(c_0_128_129,plain,
! [X2] :
( ~ inductive(X2)
| subclass(omega,X2) ),
inference(fof_simplification,[status(thm)],[c_0_61]) ).
fof(c_0_129_130,axiom,
! [X2,X3] :
( X3 != X2
| subclass(X3,X2) ),
c_0_62 ).
fof(c_0_130_131,axiom,
! [X2,X3] :
( X3 != X2
| subclass(X2,X3) ),
c_0_63 ).
fof(c_0_131_132,plain,
! [X9] :
( ~ one_to_one(X9)
| function(inverse(X9)) ),
inference(fof_simplification,[status(thm)],[c_0_64]) ).
fof(c_0_132_133,plain,
! [X9] :
( ~ one_to_one(X9)
| function(X9) ),
inference(fof_simplification,[status(thm)],[c_0_65]) ).
fof(c_0_133_134,plain,
! [X9] :
( ~ operation(X9)
| function(X9) ),
inference(fof_simplification,[status(thm)],[c_0_66]) ).
fof(c_0_134_135,plain,
! [X9,X10,X11] :
( ~ operation(X11)
| ~ operation(X10)
| ~ compatible(X9,X11,X10)
| apply(X10,ordered_pair(apply(X9,not_homomorphism1(X9,X11,X10)),apply(X9,not_homomorphism2(X9,X11,X10)))) != apply(X9,apply(X11,ordered_pair(not_homomorphism1(X9,X11,X10),not_homomorphism2(X9,X11,X10))))
| homomorphism(X9,X11,X10) ),
inference(variable_rename,[status(thm)],[c_0_67]) ).
fof(c_0_135_136,plain,
! [X9,X10,X11] :
( ~ operation(X11)
| ~ operation(X10)
| ~ compatible(X9,X11,X10)
| member(ordered_pair(not_homomorphism1(X9,X11,X10),not_homomorphism2(X9,X11,X10)),domain_of(X11))
| homomorphism(X9,X11,X10) ),
inference(variable_rename,[status(thm)],[c_0_68]) ).
fof(c_0_136_137,plain,
! [X13,X14,X15,X16] :
( ~ member(ordered_pair(ordered_pair(X15,X14),X16),X13)
| ~ member(ordered_pair(ordered_pair(X16,X15),X14),cross_product(cross_product(universal_class,universal_class),universal_class))
| member(ordered_pair(ordered_pair(X16,X15),X14),rotate(X13)) ),
inference(variable_rename,[status(thm)],[c_0_69]) ).
fof(c_0_137_138,plain,
! [X13,X14,X15,X16] :
( ~ member(ordered_pair(ordered_pair(X15,X16),X14),X13)
| ~ member(ordered_pair(ordered_pair(X16,X15),X14),cross_product(cross_product(universal_class,universal_class),universal_class))
| member(ordered_pair(ordered_pair(X16,X15),X14),flip(X13)) ),
inference(variable_rename,[status(thm)],[c_0_70]) ).
fof(c_0_138_139,plain,
! [X9,X10,X11,X12,X13] :
( ~ homomorphism(X10,X12,X11)
| ~ member(ordered_pair(X13,X9),domain_of(X12))
| apply(X11,ordered_pair(apply(X10,X13),apply(X10,X9))) = apply(X10,apply(X12,ordered_pair(X13,X9))) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_71])])]) ).
fof(c_0_139_140,plain,
! [X12,X13,X14,X15] :
( ~ member(X12,image(X13,image(X15,singleton(X14))))
| ~ member(ordered_pair(X14,X12),cross_product(universal_class,universal_class))
| member(ordered_pair(X14,X12),compose(X13,X15)) ),
inference(variable_rename,[status(thm)],[c_0_72]) ).
fof(c_0_140_141,plain,
! [X13,X14,X15,X16] :
( ~ member(ordered_pair(ordered_pair(X16,X15),X14),rotate(X13))
| member(ordered_pair(ordered_pair(X15,X14),X16),X13) ),
inference(variable_rename,[status(thm)],[c_0_73]) ).
fof(c_0_141_142,plain,
! [X13,X14,X15,X16] :
( ~ member(ordered_pair(ordered_pair(X16,X15),X14),flip(X13))
| member(ordered_pair(ordered_pair(X15,X16),X14),X13) ),
inference(variable_rename,[status(thm)],[c_0_74]) ).
fof(c_0_142_143,plain,
! [X12,X13,X14,X15] :
( ~ member(ordered_pair(X14,X12),compose(X13,X15))
| member(X12,image(X13,image(X15,singleton(X14)))) ),
inference(variable_rename,[status(thm)],[c_0_75]) ).
fof(c_0_143_144,plain,
! [X10] :
( ~ function(X10)
| cross_product(domain_of(domain_of(X10)),domain_of(domain_of(X10))) != domain_of(X10)
| ~ subclass(range_of(X10),domain_of(domain_of(X10)))
| operation(X10) ),
inference(variable_rename,[status(thm)],[c_0_76]) ).
fof(c_0_144_145,plain,
! [X4,X5] :
( ~ member(ordered_pair(X5,X4),cross_product(universal_class,universal_class))
| ~ member(X5,X4)
| member(ordered_pair(X5,X4),element_relation) ),
inference(variable_rename,[status(thm)],[c_0_77]) ).
fof(c_0_145_146,plain,
! [X9,X10,X11] :
( ~ function(X9)
| domain_of(domain_of(X11)) != domain_of(X9)
| ~ subclass(range_of(X9),domain_of(domain_of(X10)))
| compatible(X9,X11,X10) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_78])])]) ).
fof(c_0_146_147,plain,
! [X6,X7,X8,X9] :
( ~ member(ordered_pair(X7,X6),cross_product(X9,X8))
| member(X7,unordered_pair(X7,X6)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_79])])]) ).
fof(c_0_147_148,plain,
! [X6,X7,X8,X9] :
( ~ member(ordered_pair(X7,X6),cross_product(X9,X8))
| member(X6,unordered_pair(X7,X6)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_80])])]) ).
fof(c_0_148_149,plain,
! [X4,X5] :
( successor(X5) != X4
| ~ member(ordered_pair(X5,X4),cross_product(universal_class,universal_class))
| member(ordered_pair(X5,X4),successor_relation) ),
inference(variable_rename,[status(thm)],[c_0_81]) ).
fof(c_0_149_150,plain,
! [X9,X10,X11] :
( ~ homomorphism(X9,X11,X10)
| compatible(X9,X11,X10) ),
inference(variable_rename,[status(thm)],[c_0_82]) ).
fof(c_0_150,plain,
! [X10] :
( ~ subclass(X10,cross_product(universal_class,universal_class))
| ~ subclass(compose(X10,inverse(X10)),identity_relation)
| function(X10) ),
inference(variable_rename,[status(thm)],[c_0_83]) ).
fof(c_0_151,plain,
! [X4,X5] :
( restrict(X5,singleton(X4),universal_class) != null_class
| ~ member(X4,domain_of(X5)) ),
inference(variable_rename,[status(thm)],[c_0_84]) ).
fof(c_0_152,plain,
! [X9,X10,X11] :
( ~ compatible(X9,X11,X10)
| subclass(range_of(X9),domain_of(domain_of(X10))) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_85])])]) ).
fof(c_0_153,plain,
! [X6,X7,X8,X9] :
( ~ member(ordered_pair(X9,X8),cross_product(X7,X6))
| member(X9,X7) ),
inference(variable_rename,[status(thm)],[c_0_86]) ).
fof(c_0_154,plain,
! [X6,X7,X8,X9] :
( ~ member(ordered_pair(X9,X8),cross_product(X7,X6))
| member(X8,X6) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_87])])]) ).
fof(c_0_155,plain,
! [X6,X7,X8,X9] :
( ~ member(ordered_pair(X9,X8),cross_product(X7,X6))
| member(X9,universal_class) ),
inference(variable_rename,[status(thm)],[c_0_88]) ).
fof(c_0_156,plain,
! [X6,X7,X8,X9] :
( ~ member(ordered_pair(X9,X8),cross_product(X7,X6))
| member(X8,universal_class) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_89])])]) ).
fof(c_0_157,plain,
! [X6,X7,X8,X9] :
( ~ member(X9,X7)
| ~ member(X8,X6)
| member(ordered_pair(X9,X8),cross_product(X7,X6)) ),
inference(variable_rename,[status(thm)],[c_0_90]) ).
fof(c_0_158,plain,
! [X9,X10,X11] :
( ~ compatible(X9,X11,X10)
| domain_of(domain_of(X11)) = domain_of(X9) ),
inference(variable_rename,[status(thm)],[c_0_91]) ).
fof(c_0_159,plain,
! [X4,X5] :
( ~ member(X4,universal_class)
| restrict(X5,singleton(X4),universal_class) = null_class
| member(X4,domain_of(X5)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_92])])]) ).
fof(c_0_160,plain,
! [X4,X5,X6] :
( ~ member(X4,cross_product(X6,X5))
| ordered_pair(first(X4),second(X4)) = X4 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_93])])]) ).
fof(c_0_161,plain,
! [X9,X10,X11] :
( ~ compatible(X9,X11,X10)
| function(X9) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_94])])]) ).
fof(c_0_162,plain,
! [X9,X10,X11] :
( ~ homomorphism(X9,X11,X10)
| operation(X11) ),
inference(variable_rename,[status(thm)],[c_0_95]) ).
fof(c_0_163,plain,
! [X9,X10,X11] :
( ~ homomorphism(X9,X11,X10)
| operation(X10) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_96])])]) ).
fof(c_0_164,plain,
! [X4,X5,X6] :
( ~ member(X4,X6)
| ~ member(X4,X5)
| member(X4,intersection(X6,X5)) ),
inference(variable_rename,[status(thm)],[c_0_97]) ).
fof(c_0_165,plain,
! [X4] :
( ~ subclass(compose(X4,inverse(X4)),identity_relation)
| single_valued_class(X4) ),
inference(variable_rename,[status(thm)],[c_0_98]) ).
fof(c_0_166,plain,
! [X4] :
( ~ member(null_class,X4)
| ~ subclass(image(successor_relation,X4),X4)
| inductive(X4) ),
inference(variable_rename,[status(thm)],[c_0_99]) ).
fof(c_0_167,plain,
! [X4,X5] :
( ~ member(not_subclass_element(X5,X4),X4)
| subclass(X5,X4) ),
inference(variable_rename,[status(thm)],[c_0_100]) ).
fof(c_0_168,plain,
! [X4,X5,X6] :
( ~ member(X4,intersection(X6,X5))
| member(X4,X6) ),
inference(variable_rename,[status(thm)],[c_0_101]) ).
fof(c_0_169,plain,
! [X4,X5,X6] :
( ~ member(X4,intersection(X6,X5))
| member(X4,X5) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_102])])]) ).
fof(c_0_170,plain,
! [X4,X5] :
( ~ member(ordered_pair(X5,X4),element_relation)
| member(X5,X4) ),
inference(variable_rename,[status(thm)],[c_0_103]) ).
fof(c_0_171,plain,
! [X6,X7,X8] :
( ~ member(X8,unordered_pair(X7,X6))
| X8 = X7
| X8 = X6 ),
inference(variable_rename,[status(thm)],[c_0_104]) ).
fof(c_0_172,plain,
! [X4,X5] :
( ~ member(ordered_pair(X5,X4),successor_relation)
| successor(X5) = X4 ),
inference(variable_rename,[status(thm)],[c_0_105]) ).
fof(c_0_173,plain,
! [X10,X11] :
( ~ function(X10)
| ~ member(X11,universal_class)
| member(image(X10,X11),universal_class) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_106])])]) ).
fof(c_0_174,plain,
! [X10] :
( ~ operation(X10)
| cross_product(domain_of(domain_of(X10)),domain_of(domain_of(X10))) = domain_of(X10) ),
inference(variable_rename,[status(thm)],[c_0_107]) ).
fof(c_0_175,plain,
! [X4,X5] :
( ~ member(X5,universal_class)
| member(X5,unordered_pair(X5,X4)) ),
inference(variable_rename,[status(thm)],[c_0_108]) ).
fof(c_0_176,plain,
! [X4,X5] :
( ~ member(X4,universal_class)
| member(X4,unordered_pair(X5,X4)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_109])])]) ).
fof(c_0_177,plain,
! [X6,X7,X8] :
( ~ subclass(X7,X6)
| ~ member(X8,X7)
| member(X8,X6) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_110])])]) ).
fof(c_0_178,plain,
! [X4,X5,X6] :
( ~ subclass(X6,X5)
| ~ subclass(X5,X4)
| subclass(X6,X4) ),
inference(variable_rename,[status(thm)],[c_0_111]) ).
fof(c_0_179,plain,
! [X3] :
( ~ member(X3,universal_class)
| X3 = null_class
| member(apply(choice,X3),X3) ),
inference(variable_rename,[status(thm)],[c_0_112]) ).
fof(c_0_180,plain,
! [X4] :
( ~ single_valued_class(X4)
| subclass(compose(X4,inverse(X4)),identity_relation) ),
inference(variable_rename,[status(thm)],[c_0_113]) ).
fof(c_0_181,plain,
! [X10] :
( ~ function(X10)
| subclass(compose(X10,inverse(X10)),identity_relation) ),
inference(variable_rename,[status(thm)],[c_0_114]) ).
fof(c_0_182,plain,
! [X4,X5] :
( ~ member(X4,universal_class)
| member(X4,complement(X5))
| member(X4,X5) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_115])])]) ).
fof(c_0_183,plain,
! [X4,X5] :
( ~ member(X4,complement(X5))
| ~ member(X4,X5) ),
inference(variable_rename,[status(thm)],[c_0_116]) ).
fof(c_0_184,plain,
! [X4,X5] :
( member(not_subclass_element(X5,X4),X5)
| subclass(X5,X4) ),
inference(variable_rename,[status(thm)],[c_0_117]) ).
fof(c_0_185,plain,
! [X4,X5] :
( ~ subclass(X5,X4)
| ~ subclass(X4,X5)
| X5 = X4 ),
inference(variable_rename,[status(thm)],[c_0_118]) ).
fof(c_0_186,plain,
! [X10] :
( ~ operation(X10)
| subclass(range_of(X10),domain_of(domain_of(X10))) ),
inference(variable_rename,[status(thm)],[c_0_119]) ).
fof(c_0_187,plain,
! [X4] :
( ~ inductive(X4)
| subclass(image(successor_relation,X4),X4) ),
inference(variable_rename,[status(thm)],[c_0_120]) ).
fof(c_0_188,plain,
! [X10] :
( ~ function(X10)
| subclass(X10,cross_product(universal_class,universal_class)) ),
inference(variable_rename,[status(thm)],[c_0_121]) ).
fof(c_0_189,plain,
! [X4] :
( ~ member(X4,universal_class)
| member(sum_class(X4),universal_class) ),
inference(variable_rename,[status(thm)],[c_0_122]) ).
fof(c_0_190,plain,
! [X6] :
( ~ member(X6,universal_class)
| member(power_class(X6),universal_class) ),
inference(variable_rename,[status(thm)],[c_0_123]) ).
fof(c_0_191,plain,
! [X10] :
( ~ function(inverse(X10))
| ~ function(X10)
| one_to_one(X10) ),
inference(variable_rename,[status(thm)],[c_0_124]) ).
fof(c_0_192,plain,
! [X4] :
( X4 = null_class
| member(regular(X4),X4) ),
inference(variable_rename,[status(thm)],[c_0_125]) ).
fof(c_0_193,plain,
! [X4] :
( X4 = null_class
| intersection(X4,regular(X4)) = null_class ),
inference(variable_rename,[status(thm)],[c_0_126]) ).
fof(c_0_194,plain,
! [X4] :
( ~ inductive(X4)
| member(null_class,X4) ),
inference(variable_rename,[status(thm)],[c_0_127]) ).
fof(c_0_195,plain,
! [X3] :
( ~ inductive(X3)
| subclass(omega,X3) ),
inference(variable_rename,[status(thm)],[c_0_128]) ).
fof(c_0_196,plain,
! [X4,X5] :
( X5 != X4
| subclass(X5,X4) ),
inference(variable_rename,[status(thm)],[c_0_129]) ).
fof(c_0_197,plain,
! [X4,X5] :
( X5 != X4
| subclass(X4,X5) ),
inference(variable_rename,[status(thm)],[c_0_130]) ).
fof(c_0_198,plain,
! [X10] :
( ~ one_to_one(X10)
| function(inverse(X10)) ),
inference(variable_rename,[status(thm)],[c_0_131]) ).
fof(c_0_199,plain,
! [X10] :
( ~ one_to_one(X10)
| function(X10) ),
inference(variable_rename,[status(thm)],[c_0_132]) ).
fof(c_0_200,plain,
! [X10] :
( ~ operation(X10)
| function(X10) ),
inference(variable_rename,[status(thm)],[c_0_133]) ).
cnf(c_0_201,plain,
( homomorphism(X1,X2,X3)
| apply(X3,ordered_pair(apply(X1,not_homomorphism1(X1,X2,X3)),apply(X1,not_homomorphism2(X1,X2,X3)))) != apply(X1,apply(X2,ordered_pair(not_homomorphism1(X1,X2,X3),not_homomorphism2(X1,X2,X3))))
| ~ compatible(X1,X2,X3)
| ~ operation(X3)
| ~ operation(X2) ),
inference(split_conjunct,[status(thm)],[c_0_134]) ).
cnf(c_0_202,plain,
( homomorphism(X1,X2,X3)
| member(ordered_pair(not_homomorphism1(X1,X2,X3),not_homomorphism2(X1,X2,X3)),domain_of(X2))
| ~ compatible(X1,X2,X3)
| ~ operation(X3)
| ~ operation(X2) ),
inference(split_conjunct,[status(thm)],[c_0_135]) ).
cnf(c_0_203,plain,
( member(ordered_pair(ordered_pair(X1,X2),X3),rotate(X4))
| ~ member(ordered_pair(ordered_pair(X1,X2),X3),cross_product(cross_product(universal_class,universal_class),universal_class))
| ~ member(ordered_pair(ordered_pair(X2,X3),X1),X4) ),
inference(split_conjunct,[status(thm)],[c_0_136]) ).
cnf(c_0_204,plain,
( member(ordered_pair(ordered_pair(X1,X2),X3),flip(X4))
| ~ member(ordered_pair(ordered_pair(X1,X2),X3),cross_product(cross_product(universal_class,universal_class),universal_class))
| ~ member(ordered_pair(ordered_pair(X2,X1),X3),X4) ),
inference(split_conjunct,[status(thm)],[c_0_137]) ).
cnf(c_0_205,plain,
( apply(X1,ordered_pair(apply(X2,X3),apply(X2,X4))) = apply(X2,apply(X5,ordered_pair(X3,X4)))
| ~ member(ordered_pair(X3,X4),domain_of(X5))
| ~ homomorphism(X2,X5,X1) ),
inference(split_conjunct,[status(thm)],[c_0_138]) ).
cnf(c_0_206,plain,
( member(ordered_pair(X1,X2),compose(X3,X4))
| ~ member(ordered_pair(X1,X2),cross_product(universal_class,universal_class))
| ~ member(X2,image(X3,image(X4,singleton(X1)))) ),
inference(split_conjunct,[status(thm)],[c_0_139]) ).
cnf(c_0_207,plain,
( member(ordered_pair(ordered_pair(X1,X2),X3),X4)
| ~ member(ordered_pair(ordered_pair(X3,X1),X2),rotate(X4)) ),
inference(split_conjunct,[status(thm)],[c_0_140]) ).
cnf(c_0_208,plain,
( member(ordered_pair(ordered_pair(X1,X2),X3),X4)
| ~ member(ordered_pair(ordered_pair(X2,X1),X3),flip(X4)) ),
inference(split_conjunct,[status(thm)],[c_0_141]) ).
cnf(c_0_209,plain,
( member(X1,image(X2,image(X3,singleton(X4))))
| ~ member(ordered_pair(X4,X1),compose(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_142]) ).
cnf(c_0_210,plain,
( operation(X1)
| ~ subclass(range_of(X1),domain_of(domain_of(X1)))
| cross_product(domain_of(domain_of(X1)),domain_of(domain_of(X1))) != domain_of(X1)
| ~ function(X1) ),
inference(split_conjunct,[status(thm)],[c_0_143]) ).
cnf(c_0_211,plain,
( member(ordered_pair(X1,X2),element_relation)
| ~ member(X1,X2)
| ~ member(ordered_pair(X1,X2),cross_product(universal_class,universal_class)) ),
inference(split_conjunct,[status(thm)],[c_0_144]) ).
cnf(c_0_212,plain,
( compatible(X1,X2,X3)
| ~ subclass(range_of(X1),domain_of(domain_of(X3)))
| domain_of(domain_of(X2)) != domain_of(X1)
| ~ function(X1) ),
inference(split_conjunct,[status(thm)],[c_0_145]) ).
cnf(c_0_213,plain,
( member(X1,unordered_pair(X1,X2))
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_146]) ).
cnf(c_0_214,plain,
( member(X1,unordered_pair(X2,X1))
| ~ member(ordered_pair(X2,X1),cross_product(X3,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_147]) ).
cnf(c_0_215,plain,
( member(ordered_pair(X1,X2),successor_relation)
| ~ member(ordered_pair(X1,X2),cross_product(universal_class,universal_class))
| successor(X1) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_148]) ).
cnf(c_0_216,plain,
( compatible(X1,X2,X3)
| ~ homomorphism(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_149]) ).
cnf(c_0_217,plain,
( function(X1)
| ~ subclass(compose(X1,inverse(X1)),identity_relation)
| ~ subclass(X1,cross_product(universal_class,universal_class)) ),
inference(split_conjunct,[status(thm)],[c_0_150]) ).
cnf(c_0_218,plain,
( ~ member(X1,domain_of(X2))
| restrict(X2,singleton(X1),universal_class) != null_class ),
inference(split_conjunct,[status(thm)],[c_0_151]) ).
cnf(c_0_219,plain,
( subclass(range_of(X1),domain_of(domain_of(X2)))
| ~ compatible(X1,X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_152]) ).
cnf(c_0_220,plain,
( member(X1,X2)
| ~ member(ordered_pair(X1,X3),cross_product(X2,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_153]) ).
cnf(c_0_221,plain,
( member(X1,X2)
| ~ member(ordered_pair(X3,X1),cross_product(X4,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_154]) ).
cnf(c_0_222,plain,
( member(X1,universal_class)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_155]) ).
cnf(c_0_223,plain,
( member(X1,universal_class)
| ~ member(ordered_pair(X2,X1),cross_product(X3,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_156]) ).
cnf(c_0_224,plain,
( member(ordered_pair(X1,X2),cross_product(X3,X4))
| ~ member(X2,X4)
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_157]) ).
cnf(c_0_225,plain,
( domain_of(domain_of(X1)) = domain_of(X2)
| ~ compatible(X2,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_158]) ).
cnf(c_0_226,plain,
( member(X1,domain_of(X2))
| restrict(X2,singleton(X1),universal_class) = null_class
| ~ member(X1,universal_class) ),
inference(split_conjunct,[status(thm)],[c_0_159]) ).
cnf(c_0_227,plain,
( ordered_pair(first(X1),second(X1)) = X1
| ~ member(X1,cross_product(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_160]) ).
cnf(c_0_228,plain,
( function(X1)
| ~ compatible(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_161]) ).
cnf(c_0_229,plain,
( operation(X1)
| ~ homomorphism(X2,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_162]) ).
cnf(c_0_230,plain,
( operation(X1)
| ~ homomorphism(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_163]) ).
cnf(c_0_231,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X3)
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_164]) ).
cnf(c_0_232,plain,
( single_valued_class(X1)
| ~ subclass(compose(X1,inverse(X1)),identity_relation) ),
inference(split_conjunct,[status(thm)],[c_0_165]) ).
cnf(c_0_233,plain,
( inductive(X1)
| ~ subclass(image(successor_relation,X1),X1)
| ~ member(null_class,X1) ),
inference(split_conjunct,[status(thm)],[c_0_166]) ).
cnf(c_0_234,plain,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_167]) ).
cnf(c_0_235,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_168]) ).
cnf(c_0_236,plain,
( member(X1,X2)
| ~ member(X1,intersection(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_169]) ).
cnf(c_0_237,plain,
( member(X1,X2)
| ~ member(ordered_pair(X1,X2),element_relation) ),
inference(split_conjunct,[status(thm)],[c_0_170]) ).
cnf(c_0_238,plain,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_171]) ).
cnf(c_0_239,plain,
( successor(X1) = X2
| ~ member(ordered_pair(X1,X2),successor_relation) ),
inference(split_conjunct,[status(thm)],[c_0_172]) ).
cnf(c_0_240,plain,
( member(image(X1,X2),universal_class)
| ~ member(X2,universal_class)
| ~ function(X1) ),
inference(split_conjunct,[status(thm)],[c_0_173]) ).
cnf(c_0_241,plain,
( cross_product(domain_of(domain_of(X1)),domain_of(domain_of(X1))) = domain_of(X1)
| ~ operation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_174]) ).
cnf(c_0_242,plain,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
inference(split_conjunct,[status(thm)],[c_0_175]) ).
cnf(c_0_243,plain,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
inference(split_conjunct,[status(thm)],[c_0_176]) ).
cnf(c_0_244,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subclass(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_177]) ).
cnf(c_0_245,plain,
( subclass(X1,X2)
| ~ subclass(X3,X2)
| ~ subclass(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_178]) ).
cnf(c_0_246,plain,
( member(apply(choice,X1),X1)
| X1 = null_class
| ~ member(X1,universal_class) ),
inference(split_conjunct,[status(thm)],[c_0_179]) ).
cnf(c_0_247,plain,
( subclass(compose(X1,inverse(X1)),identity_relation)
| ~ single_valued_class(X1) ),
inference(split_conjunct,[status(thm)],[c_0_180]) ).
cnf(c_0_248,plain,
( subclass(compose(X1,inverse(X1)),identity_relation)
| ~ function(X1) ),
inference(split_conjunct,[status(thm)],[c_0_181]) ).
cnf(c_0_249,plain,
( member(X1,X2)
| member(X1,complement(X2))
| ~ member(X1,universal_class) ),
inference(split_conjunct,[status(thm)],[c_0_182]) ).
cnf(c_0_250,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_183]) ).
cnf(c_0_251,plain,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_184]) ).
cnf(c_0_252,plain,
( X1 = X2
| ~ subclass(X2,X1)
| ~ subclass(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_185]) ).
cnf(c_0_253,plain,
( subclass(range_of(X1),domain_of(domain_of(X1)))
| ~ operation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_186]) ).
cnf(c_0_254,plain,
( subclass(image(successor_relation,X1),X1)
| ~ inductive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_187]) ).
cnf(c_0_255,plain,
( subclass(X1,cross_product(universal_class,universal_class))
| ~ function(X1) ),
inference(split_conjunct,[status(thm)],[c_0_188]) ).
cnf(c_0_256,plain,
( member(sum_class(X1),universal_class)
| ~ member(X1,universal_class) ),
inference(split_conjunct,[status(thm)],[c_0_189]) ).
cnf(c_0_257,plain,
( member(power_class(X1),universal_class)
| ~ member(X1,universal_class) ),
inference(split_conjunct,[status(thm)],[c_0_190]) ).
cnf(c_0_258,plain,
( one_to_one(X1)
| ~ function(X1)
| ~ function(inverse(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_191]) ).
cnf(c_0_259,plain,
( member(regular(X1),X1)
| X1 = null_class ),
inference(split_conjunct,[status(thm)],[c_0_192]) ).
cnf(c_0_260,plain,
( intersection(X1,regular(X1)) = null_class
| X1 = null_class ),
inference(split_conjunct,[status(thm)],[c_0_193]) ).
cnf(c_0_261,plain,
( member(null_class,X1)
| ~ inductive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_194]) ).
cnf(c_0_262,plain,
( subclass(omega,X1)
| ~ inductive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_195]) ).
cnf(c_0_263,plain,
( subclass(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_196]) ).
cnf(c_0_264,plain,
( subclass(X1,X2)
| X2 != X1 ),
inference(split_conjunct,[status(thm)],[c_0_197]) ).
cnf(c_0_265,plain,
( function(inverse(X1))
| ~ one_to_one(X1) ),
inference(split_conjunct,[status(thm)],[c_0_198]) ).
cnf(c_0_266,plain,
( function(X1)
| ~ one_to_one(X1) ),
inference(split_conjunct,[status(thm)],[c_0_199]) ).
cnf(c_0_267,plain,
( function(X1)
| ~ operation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_200]) ).
cnf(c_0_268,plain,
( homomorphism(X1,X2,X3)
| apply(X3,ordered_pair(apply(X1,not_homomorphism1(X1,X2,X3)),apply(X1,not_homomorphism2(X1,X2,X3)))) != apply(X1,apply(X2,ordered_pair(not_homomorphism1(X1,X2,X3),not_homomorphism2(X1,X2,X3))))
| ~ compatible(X1,X2,X3)
| ~ operation(X3)
| ~ operation(X2) ),
c_0_201,
[final] ).
cnf(c_0_269,plain,
( homomorphism(X1,X2,X3)
| member(ordered_pair(not_homomorphism1(X1,X2,X3),not_homomorphism2(X1,X2,X3)),domain_of(X2))
| ~ compatible(X1,X2,X3)
| ~ operation(X3)
| ~ operation(X2) ),
c_0_202,
[final] ).
cnf(c_0_270,plain,
( member(ordered_pair(ordered_pair(X1,X2),X3),rotate(X4))
| ~ member(ordered_pair(ordered_pair(X1,X2),X3),cross_product(cross_product(universal_class,universal_class),universal_class))
| ~ member(ordered_pair(ordered_pair(X2,X3),X1),X4) ),
c_0_203,
[final] ).
cnf(c_0_271,plain,
( member(ordered_pair(ordered_pair(X1,X2),X3),flip(X4))
| ~ member(ordered_pair(ordered_pair(X1,X2),X3),cross_product(cross_product(universal_class,universal_class),universal_class))
| ~ member(ordered_pair(ordered_pair(X2,X1),X3),X4) ),
c_0_204,
[final] ).
cnf(c_0_272,plain,
( apply(X1,ordered_pair(apply(X2,X3),apply(X2,X4))) = apply(X2,apply(X5,ordered_pair(X3,X4)))
| ~ member(ordered_pair(X3,X4),domain_of(X5))
| ~ homomorphism(X2,X5,X1) ),
c_0_205,
[final] ).
cnf(c_0_273,plain,
( member(ordered_pair(X1,X2),compose(X3,X4))
| ~ member(ordered_pair(X1,X2),cross_product(universal_class,universal_class))
| ~ member(X2,image(X3,image(X4,singleton(X1)))) ),
c_0_206,
[final] ).
cnf(c_0_274,plain,
( member(ordered_pair(ordered_pair(X1,X2),X3),X4)
| ~ member(ordered_pair(ordered_pair(X3,X1),X2),rotate(X4)) ),
c_0_207,
[final] ).
cnf(c_0_275,plain,
( member(ordered_pair(ordered_pair(X1,X2),X3),X4)
| ~ member(ordered_pair(ordered_pair(X2,X1),X3),flip(X4)) ),
c_0_208,
[final] ).
cnf(c_0_276,plain,
( member(X1,image(X2,image(X3,singleton(X4))))
| ~ member(ordered_pair(X4,X1),compose(X2,X3)) ),
c_0_209,
[final] ).
cnf(c_0_277,plain,
( operation(X1)
| ~ subclass(range_of(X1),domain_of(domain_of(X1)))
| cross_product(domain_of(domain_of(X1)),domain_of(domain_of(X1))) != domain_of(X1)
| ~ function(X1) ),
c_0_210,
[final] ).
cnf(c_0_278,plain,
( member(ordered_pair(X1,X2),element_relation)
| ~ member(X1,X2)
| ~ member(ordered_pair(X1,X2),cross_product(universal_class,universal_class)) ),
c_0_211,
[final] ).
cnf(c_0_279,plain,
( compatible(X1,X2,X3)
| ~ subclass(range_of(X1),domain_of(domain_of(X3)))
| domain_of(domain_of(X2)) != domain_of(X1)
| ~ function(X1) ),
c_0_212,
[final] ).
cnf(c_0_280,plain,
( member(X1,unordered_pair(X1,X2))
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
c_0_213,
[final] ).
cnf(c_0_281,plain,
( member(X1,unordered_pair(X2,X1))
| ~ member(ordered_pair(X2,X1),cross_product(X3,X4)) ),
c_0_214,
[final] ).
cnf(c_0_282,plain,
( member(ordered_pair(X1,X2),successor_relation)
| ~ member(ordered_pair(X1,X2),cross_product(universal_class,universal_class))
| successor(X1) != X2 ),
c_0_215,
[final] ).
cnf(c_0_283,plain,
( compatible(X1,X2,X3)
| ~ homomorphism(X1,X2,X3) ),
c_0_216,
[final] ).
cnf(c_0_284,plain,
( function(X1)
| ~ subclass(compose(X1,inverse(X1)),identity_relation)
| ~ subclass(X1,cross_product(universal_class,universal_class)) ),
c_0_217,
[final] ).
cnf(c_0_285,plain,
( ~ member(X1,domain_of(X2))
| restrict(X2,singleton(X1),universal_class) != null_class ),
c_0_218,
[final] ).
cnf(c_0_286,plain,
( subclass(range_of(X1),domain_of(domain_of(X2)))
| ~ compatible(X1,X3,X2) ),
c_0_219,
[final] ).
cnf(c_0_287,plain,
( member(X1,X2)
| ~ member(ordered_pair(X1,X3),cross_product(X2,X4)) ),
c_0_220,
[final] ).
cnf(c_0_288,plain,
( member(X1,X2)
| ~ member(ordered_pair(X3,X1),cross_product(X4,X2)) ),
c_0_221,
[final] ).
cnf(c_0_289,plain,
( member(X1,universal_class)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
c_0_222,
[final] ).
cnf(c_0_290,plain,
( member(X1,universal_class)
| ~ member(ordered_pair(X2,X1),cross_product(X3,X4)) ),
c_0_223,
[final] ).
cnf(c_0_291,plain,
( member(ordered_pair(X1,X2),cross_product(X3,X4))
| ~ member(X2,X4)
| ~ member(X1,X3) ),
c_0_224,
[final] ).
cnf(c_0_292,plain,
( domain_of(domain_of(X1)) = domain_of(X2)
| ~ compatible(X2,X1,X3) ),
c_0_225,
[final] ).
cnf(c_0_293,plain,
( member(X1,domain_of(X2))
| restrict(X2,singleton(X1),universal_class) = null_class
| ~ member(X1,universal_class) ),
c_0_226,
[final] ).
cnf(c_0_294,plain,
( ordered_pair(first(X1),second(X1)) = X1
| ~ member(X1,cross_product(X2,X3)) ),
c_0_227,
[final] ).
cnf(c_0_295,plain,
( function(X1)
| ~ compatible(X1,X2,X3) ),
c_0_228,
[final] ).
cnf(c_0_296,plain,
( operation(X1)
| ~ homomorphism(X2,X1,X3) ),
c_0_229,
[final] ).
cnf(c_0_297,plain,
( operation(X1)
| ~ homomorphism(X2,X3,X1) ),
c_0_230,
[final] ).
cnf(c_0_298,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X3)
| ~ member(X1,X2) ),
c_0_231,
[final] ).
cnf(c_0_299,plain,
( single_valued_class(X1)
| ~ subclass(compose(X1,inverse(X1)),identity_relation) ),
c_0_232,
[final] ).
cnf(c_0_300,plain,
( inductive(X1)
| ~ subclass(image(successor_relation,X1),X1)
| ~ member(null_class,X1) ),
c_0_233,
[final] ).
cnf(c_0_301,plain,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
c_0_234,
[final] ).
cnf(c_0_302,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
c_0_235,
[final] ).
cnf(c_0_303,plain,
( member(X1,X2)
| ~ member(X1,intersection(X3,X2)) ),
c_0_236,
[final] ).
cnf(c_0_304,plain,
( member(X1,X2)
| ~ member(ordered_pair(X1,X2),element_relation) ),
c_0_237,
[final] ).
cnf(c_0_305,plain,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X3,X2)) ),
c_0_238,
[final] ).
cnf(c_0_306,plain,
( successor(X1) = X2
| ~ member(ordered_pair(X1,X2),successor_relation) ),
c_0_239,
[final] ).
cnf(c_0_307,plain,
( member(image(X1,X2),universal_class)
| ~ member(X2,universal_class)
| ~ function(X1) ),
c_0_240,
[final] ).
cnf(c_0_308,plain,
( cross_product(domain_of(domain_of(X1)),domain_of(domain_of(X1))) = domain_of(X1)
| ~ operation(X1) ),
c_0_241,
[final] ).
cnf(c_0_309,plain,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
c_0_242,
[final] ).
cnf(c_0_310,plain,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
c_0_243,
[final] ).
cnf(c_0_311,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subclass(X3,X2) ),
c_0_244,
[final] ).
cnf(c_0_312,plain,
( subclass(X1,X2)
| ~ subclass(X3,X2)
| ~ subclass(X1,X3) ),
c_0_245,
[final] ).
cnf(c_0_313,plain,
( member(apply(choice,X1),X1)
| X1 = null_class
| ~ member(X1,universal_class) ),
c_0_246,
[final] ).
cnf(c_0_314,plain,
( subclass(compose(X1,inverse(X1)),identity_relation)
| ~ single_valued_class(X1) ),
c_0_247,
[final] ).
cnf(c_0_315,plain,
( subclass(compose(X1,inverse(X1)),identity_relation)
| ~ function(X1) ),
c_0_248,
[final] ).
cnf(c_0_316,plain,
( member(X1,X2)
| member(X1,complement(X2))
| ~ member(X1,universal_class) ),
c_0_249,
[final] ).
cnf(c_0_317,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
c_0_250,
[final] ).
cnf(c_0_318,plain,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),X1) ),
c_0_251,
[final] ).
cnf(c_0_319,plain,
( X1 = X2
| ~ subclass(X2,X1)
| ~ subclass(X1,X2) ),
c_0_252,
[final] ).
cnf(c_0_320,plain,
( subclass(range_of(X1),domain_of(domain_of(X1)))
| ~ operation(X1) ),
c_0_253,
[final] ).
cnf(c_0_321,plain,
( subclass(image(successor_relation,X1),X1)
| ~ inductive(X1) ),
c_0_254,
[final] ).
cnf(c_0_322,plain,
( subclass(X1,cross_product(universal_class,universal_class))
| ~ function(X1) ),
c_0_255,
[final] ).
cnf(c_0_323,plain,
( member(sum_class(X1),universal_class)
| ~ member(X1,universal_class) ),
c_0_256,
[final] ).
cnf(c_0_324,plain,
( member(power_class(X1),universal_class)
| ~ member(X1,universal_class) ),
c_0_257,
[final] ).
cnf(c_0_325,plain,
( one_to_one(X1)
| ~ function(X1)
| ~ function(inverse(X1)) ),
c_0_258,
[final] ).
cnf(c_0_326,plain,
( member(regular(X1),X1)
| X1 = null_class ),
c_0_259,
[final] ).
cnf(c_0_327,plain,
( intersection(X1,regular(X1)) = null_class
| X1 = null_class ),
c_0_260,
[final] ).
cnf(c_0_328,plain,
( member(null_class,X1)
| ~ inductive(X1) ),
c_0_261,
[final] ).
cnf(c_0_329,plain,
( subclass(omega,X1)
| ~ inductive(X1) ),
c_0_262,
[final] ).
cnf(c_0_330,plain,
( subclass(X1,X2)
| X1 != X2 ),
c_0_263,
[final] ).
cnf(c_0_331,plain,
( subclass(X1,X2)
| X2 != X1 ),
c_0_264,
[final] ).
cnf(c_0_332,plain,
( function(inverse(X1))
| ~ one_to_one(X1) ),
c_0_265,
[final] ).
cnf(c_0_333,plain,
( function(X1)
| ~ one_to_one(X1) ),
c_0_266,
[final] ).
cnf(c_0_334,plain,
( function(X1)
| ~ operation(X1) ),
c_0_267,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_268_0,axiom,
( homomorphism(X1,X2,X3)
| apply(X3,ordered_pair(apply(X1,not_homomorphism1(X1,X2,X3)),apply(X1,not_homomorphism2(X1,X2,X3)))) != apply(X1,apply(X2,ordered_pair(not_homomorphism1(X1,X2,X3),not_homomorphism2(X1,X2,X3))))
| ~ compatible(X1,X2,X3)
| ~ operation(X3)
| ~ operation(X2) ),
inference(literals_permutation,[status(thm)],[c_0_268]) ).
cnf(c_0_268_1,axiom,
( apply(X3,ordered_pair(apply(X1,not_homomorphism1(X1,X2,X3)),apply(X1,not_homomorphism2(X1,X2,X3)))) != apply(X1,apply(X2,ordered_pair(not_homomorphism1(X1,X2,X3),not_homomorphism2(X1,X2,X3))))
| homomorphism(X1,X2,X3)
| ~ compatible(X1,X2,X3)
| ~ operation(X3)
| ~ operation(X2) ),
inference(literals_permutation,[status(thm)],[c_0_268]) ).
cnf(c_0_268_2,axiom,
( ~ compatible(X1,X2,X3)
| apply(X3,ordered_pair(apply(X1,not_homomorphism1(X1,X2,X3)),apply(X1,not_homomorphism2(X1,X2,X3)))) != apply(X1,apply(X2,ordered_pair(not_homomorphism1(X1,X2,X3),not_homomorphism2(X1,X2,X3))))
| homomorphism(X1,X2,X3)
| ~ operation(X3)
| ~ operation(X2) ),
inference(literals_permutation,[status(thm)],[c_0_268]) ).
cnf(c_0_268_3,axiom,
( ~ operation(X3)
| ~ compatible(X1,X2,X3)
| apply(X3,ordered_pair(apply(X1,not_homomorphism1(X1,X2,X3)),apply(X1,not_homomorphism2(X1,X2,X3)))) != apply(X1,apply(X2,ordered_pair(not_homomorphism1(X1,X2,X3),not_homomorphism2(X1,X2,X3))))
| homomorphism(X1,X2,X3)
| ~ operation(X2) ),
inference(literals_permutation,[status(thm)],[c_0_268]) ).
cnf(c_0_268_4,axiom,
( ~ operation(X2)
| ~ operation(X3)
| ~ compatible(X1,X2,X3)
| apply(X3,ordered_pair(apply(X1,not_homomorphism1(X1,X2,X3)),apply(X1,not_homomorphism2(X1,X2,X3)))) != apply(X1,apply(X2,ordered_pair(not_homomorphism1(X1,X2,X3),not_homomorphism2(X1,X2,X3))))
| homomorphism(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_268]) ).
cnf(c_0_269_0,axiom,
( homomorphism(X1,X2,X3)
| member(ordered_pair(not_homomorphism1(X1,X2,X3),not_homomorphism2(X1,X2,X3)),domain_of(X2))
| ~ compatible(X1,X2,X3)
| ~ operation(X3)
| ~ operation(X2) ),
inference(literals_permutation,[status(thm)],[c_0_269]) ).
cnf(c_0_269_1,axiom,
( member(ordered_pair(not_homomorphism1(X1,X2,X3),not_homomorphism2(X1,X2,X3)),domain_of(X2))
| homomorphism(X1,X2,X3)
| ~ compatible(X1,X2,X3)
| ~ operation(X3)
| ~ operation(X2) ),
inference(literals_permutation,[status(thm)],[c_0_269]) ).
cnf(c_0_269_2,axiom,
( ~ compatible(X1,X2,X3)
| member(ordered_pair(not_homomorphism1(X1,X2,X3),not_homomorphism2(X1,X2,X3)),domain_of(X2))
| homomorphism(X1,X2,X3)
| ~ operation(X3)
| ~ operation(X2) ),
inference(literals_permutation,[status(thm)],[c_0_269]) ).
cnf(c_0_269_3,axiom,
( ~ operation(X3)
| ~ compatible(X1,X2,X3)
| member(ordered_pair(not_homomorphism1(X1,X2,X3),not_homomorphism2(X1,X2,X3)),domain_of(X2))
| homomorphism(X1,X2,X3)
| ~ operation(X2) ),
inference(literals_permutation,[status(thm)],[c_0_269]) ).
cnf(c_0_269_4,axiom,
( ~ operation(X2)
| ~ operation(X3)
| ~ compatible(X1,X2,X3)
| member(ordered_pair(not_homomorphism1(X1,X2,X3),not_homomorphism2(X1,X2,X3)),domain_of(X2))
| homomorphism(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_269]) ).
cnf(c_0_270_0,axiom,
( member(ordered_pair(ordered_pair(X1,X2),X3),rotate(X4))
| ~ member(ordered_pair(ordered_pair(X1,X2),X3),cross_product(cross_product(universal_class,universal_class),universal_class))
| ~ member(ordered_pair(ordered_pair(X2,X3),X1),X4) ),
inference(literals_permutation,[status(thm)],[c_0_270]) ).
cnf(c_0_270_1,axiom,
( ~ member(ordered_pair(ordered_pair(X1,X2),X3),cross_product(cross_product(universal_class,universal_class),universal_class))
| member(ordered_pair(ordered_pair(X1,X2),X3),rotate(X4))
| ~ member(ordered_pair(ordered_pair(X2,X3),X1),X4) ),
inference(literals_permutation,[status(thm)],[c_0_270]) ).
cnf(c_0_270_2,axiom,
( ~ member(ordered_pair(ordered_pair(X2,X3),X1),X4)
| ~ member(ordered_pair(ordered_pair(X1,X2),X3),cross_product(cross_product(universal_class,universal_class),universal_class))
| member(ordered_pair(ordered_pair(X1,X2),X3),rotate(X4)) ),
inference(literals_permutation,[status(thm)],[c_0_270]) ).
cnf(c_0_271_0,axiom,
( member(ordered_pair(ordered_pair(X1,X2),X3),flip(X4))
| ~ member(ordered_pair(ordered_pair(X1,X2),X3),cross_product(cross_product(universal_class,universal_class),universal_class))
| ~ member(ordered_pair(ordered_pair(X2,X1),X3),X4) ),
inference(literals_permutation,[status(thm)],[c_0_271]) ).
cnf(c_0_271_1,axiom,
( ~ member(ordered_pair(ordered_pair(X1,X2),X3),cross_product(cross_product(universal_class,universal_class),universal_class))
| member(ordered_pair(ordered_pair(X1,X2),X3),flip(X4))
| ~ member(ordered_pair(ordered_pair(X2,X1),X3),X4) ),
inference(literals_permutation,[status(thm)],[c_0_271]) ).
cnf(c_0_271_2,axiom,
( ~ member(ordered_pair(ordered_pair(X2,X1),X3),X4)
| ~ member(ordered_pair(ordered_pair(X1,X2),X3),cross_product(cross_product(universal_class,universal_class),universal_class))
| member(ordered_pair(ordered_pair(X1,X2),X3),flip(X4)) ),
inference(literals_permutation,[status(thm)],[c_0_271]) ).
cnf(c_0_272_0,axiom,
( apply(X1,ordered_pair(apply(X2,X3),apply(X2,X4))) = apply(X2,apply(X5,ordered_pair(X3,X4)))
| ~ member(ordered_pair(X3,X4),domain_of(X5))
| ~ homomorphism(X2,X5,X1) ),
inference(literals_permutation,[status(thm)],[c_0_272]) ).
cnf(c_0_272_1,axiom,
( ~ member(ordered_pair(X3,X4),domain_of(X5))
| apply(X1,ordered_pair(apply(X2,X3),apply(X2,X4))) = apply(X2,apply(X5,ordered_pair(X3,X4)))
| ~ homomorphism(X2,X5,X1) ),
inference(literals_permutation,[status(thm)],[c_0_272]) ).
cnf(c_0_272_2,axiom,
( ~ homomorphism(X2,X5,X1)
| ~ member(ordered_pair(X3,X4),domain_of(X5))
| apply(X1,ordered_pair(apply(X2,X3),apply(X2,X4))) = apply(X2,apply(X5,ordered_pair(X3,X4))) ),
inference(literals_permutation,[status(thm)],[c_0_272]) ).
cnf(c_0_273_0,axiom,
( member(ordered_pair(X1,X2),compose(X3,X4))
| ~ member(ordered_pair(X1,X2),cross_product(universal_class,universal_class))
| ~ member(X2,image(X3,image(X4,singleton(X1)))) ),
inference(literals_permutation,[status(thm)],[c_0_273]) ).
cnf(c_0_273_1,axiom,
( ~ member(ordered_pair(X1,X2),cross_product(universal_class,universal_class))
| member(ordered_pair(X1,X2),compose(X3,X4))
| ~ member(X2,image(X3,image(X4,singleton(X1)))) ),
inference(literals_permutation,[status(thm)],[c_0_273]) ).
cnf(c_0_273_2,axiom,
( ~ member(X2,image(X3,image(X4,singleton(X1))))
| ~ member(ordered_pair(X1,X2),cross_product(universal_class,universal_class))
| member(ordered_pair(X1,X2),compose(X3,X4)) ),
inference(literals_permutation,[status(thm)],[c_0_273]) ).
cnf(c_0_274_0,axiom,
( member(ordered_pair(ordered_pair(X1,X2),X3),X4)
| ~ member(ordered_pair(ordered_pair(X3,X1),X2),rotate(X4)) ),
inference(literals_permutation,[status(thm)],[c_0_274]) ).
cnf(c_0_274_1,axiom,
( ~ member(ordered_pair(ordered_pair(X3,X1),X2),rotate(X4))
| member(ordered_pair(ordered_pair(X1,X2),X3),X4) ),
inference(literals_permutation,[status(thm)],[c_0_274]) ).
cnf(c_0_275_0,axiom,
( member(ordered_pair(ordered_pair(X1,X2),X3),X4)
| ~ member(ordered_pair(ordered_pair(X2,X1),X3),flip(X4)) ),
inference(literals_permutation,[status(thm)],[c_0_275]) ).
cnf(c_0_275_1,axiom,
( ~ member(ordered_pair(ordered_pair(X2,X1),X3),flip(X4))
| member(ordered_pair(ordered_pair(X1,X2),X3),X4) ),
inference(literals_permutation,[status(thm)],[c_0_275]) ).
cnf(c_0_276_0,axiom,
( member(X1,image(X2,image(X3,singleton(X4))))
| ~ member(ordered_pair(X4,X1),compose(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_276]) ).
cnf(c_0_276_1,axiom,
( ~ member(ordered_pair(X4,X1),compose(X2,X3))
| member(X1,image(X2,image(X3,singleton(X4)))) ),
inference(literals_permutation,[status(thm)],[c_0_276]) ).
cnf(c_0_277_0,axiom,
( operation(X1)
| ~ subclass(range_of(X1),domain_of(domain_of(X1)))
| cross_product(domain_of(domain_of(X1)),domain_of(domain_of(X1))) != domain_of(X1)
| ~ function(X1) ),
inference(literals_permutation,[status(thm)],[c_0_277]) ).
cnf(c_0_277_1,axiom,
( ~ subclass(range_of(X1),domain_of(domain_of(X1)))
| operation(X1)
| cross_product(domain_of(domain_of(X1)),domain_of(domain_of(X1))) != domain_of(X1)
| ~ function(X1) ),
inference(literals_permutation,[status(thm)],[c_0_277]) ).
cnf(c_0_277_2,axiom,
( cross_product(domain_of(domain_of(X1)),domain_of(domain_of(X1))) != domain_of(X1)
| ~ subclass(range_of(X1),domain_of(domain_of(X1)))
| operation(X1)
| ~ function(X1) ),
inference(literals_permutation,[status(thm)],[c_0_277]) ).
cnf(c_0_277_3,axiom,
( ~ function(X1)
| cross_product(domain_of(domain_of(X1)),domain_of(domain_of(X1))) != domain_of(X1)
| ~ subclass(range_of(X1),domain_of(domain_of(X1)))
| operation(X1) ),
inference(literals_permutation,[status(thm)],[c_0_277]) ).
cnf(c_0_278_0,axiom,
( member(ordered_pair(X1,X2),element_relation)
| ~ member(X1,X2)
| ~ member(ordered_pair(X1,X2),cross_product(universal_class,universal_class)) ),
inference(literals_permutation,[status(thm)],[c_0_278]) ).
cnf(c_0_278_1,axiom,
( ~ member(X1,X2)
| member(ordered_pair(X1,X2),element_relation)
| ~ member(ordered_pair(X1,X2),cross_product(universal_class,universal_class)) ),
inference(literals_permutation,[status(thm)],[c_0_278]) ).
cnf(c_0_278_2,axiom,
( ~ member(ordered_pair(X1,X2),cross_product(universal_class,universal_class))
| ~ member(X1,X2)
| member(ordered_pair(X1,X2),element_relation) ),
inference(literals_permutation,[status(thm)],[c_0_278]) ).
cnf(c_0_279_0,axiom,
( compatible(X1,X2,X3)
| ~ subclass(range_of(X1),domain_of(domain_of(X3)))
| domain_of(domain_of(X2)) != domain_of(X1)
| ~ function(X1) ),
inference(literals_permutation,[status(thm)],[c_0_279]) ).
cnf(c_0_279_1,axiom,
( ~ subclass(range_of(X1),domain_of(domain_of(X3)))
| compatible(X1,X2,X3)
| domain_of(domain_of(X2)) != domain_of(X1)
| ~ function(X1) ),
inference(literals_permutation,[status(thm)],[c_0_279]) ).
cnf(c_0_279_2,axiom,
( domain_of(domain_of(X2)) != domain_of(X1)
| ~ subclass(range_of(X1),domain_of(domain_of(X3)))
| compatible(X1,X2,X3)
| ~ function(X1) ),
inference(literals_permutation,[status(thm)],[c_0_279]) ).
cnf(c_0_279_3,axiom,
( ~ function(X1)
| domain_of(domain_of(X2)) != domain_of(X1)
| ~ subclass(range_of(X1),domain_of(domain_of(X3)))
| compatible(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_279]) ).
cnf(c_0_280_0,axiom,
( member(X1,unordered_pair(X1,X2))
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
inference(literals_permutation,[status(thm)],[c_0_280]) ).
cnf(c_0_280_1,axiom,
( ~ member(ordered_pair(X1,X2),cross_product(X3,X4))
| member(X1,unordered_pair(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_280]) ).
cnf(c_0_281_0,axiom,
( member(X1,unordered_pair(X2,X1))
| ~ member(ordered_pair(X2,X1),cross_product(X3,X4)) ),
inference(literals_permutation,[status(thm)],[c_0_281]) ).
cnf(c_0_281_1,axiom,
( ~ member(ordered_pair(X2,X1),cross_product(X3,X4))
| member(X1,unordered_pair(X2,X1)) ),
inference(literals_permutation,[status(thm)],[c_0_281]) ).
cnf(c_0_282_0,axiom,
( member(ordered_pair(X1,X2),successor_relation)
| ~ member(ordered_pair(X1,X2),cross_product(universal_class,universal_class))
| successor(X1) != X2 ),
inference(literals_permutation,[status(thm)],[c_0_282]) ).
cnf(c_0_282_1,axiom,
( ~ member(ordered_pair(X1,X2),cross_product(universal_class,universal_class))
| member(ordered_pair(X1,X2),successor_relation)
| successor(X1) != X2 ),
inference(literals_permutation,[status(thm)],[c_0_282]) ).
cnf(c_0_282_2,axiom,
( successor(X1) != X2
| ~ member(ordered_pair(X1,X2),cross_product(universal_class,universal_class))
| member(ordered_pair(X1,X2),successor_relation) ),
inference(literals_permutation,[status(thm)],[c_0_282]) ).
cnf(c_0_283_0,axiom,
( compatible(X1,X2,X3)
| ~ homomorphism(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_283]) ).
cnf(c_0_283_1,axiom,
( ~ homomorphism(X1,X2,X3)
| compatible(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_283]) ).
cnf(c_0_284_0,axiom,
( function(X1)
| ~ subclass(compose(X1,inverse(X1)),identity_relation)
| ~ subclass(X1,cross_product(universal_class,universal_class)) ),
inference(literals_permutation,[status(thm)],[c_0_284]) ).
cnf(c_0_284_1,axiom,
( ~ subclass(compose(X1,inverse(X1)),identity_relation)
| function(X1)
| ~ subclass(X1,cross_product(universal_class,universal_class)) ),
inference(literals_permutation,[status(thm)],[c_0_284]) ).
cnf(c_0_284_2,axiom,
( ~ subclass(X1,cross_product(universal_class,universal_class))
| ~ subclass(compose(X1,inverse(X1)),identity_relation)
| function(X1) ),
inference(literals_permutation,[status(thm)],[c_0_284]) ).
cnf(c_0_285_0,axiom,
( ~ member(X1,domain_of(X2))
| restrict(X2,singleton(X1),universal_class) != null_class ),
inference(literals_permutation,[status(thm)],[c_0_285]) ).
cnf(c_0_285_1,axiom,
( restrict(X2,singleton(X1),universal_class) != null_class
| ~ member(X1,domain_of(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_285]) ).
cnf(c_0_286_0,axiom,
( subclass(range_of(X1),domain_of(domain_of(X2)))
| ~ compatible(X1,X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_286]) ).
cnf(c_0_286_1,axiom,
( ~ compatible(X1,X3,X2)
| subclass(range_of(X1),domain_of(domain_of(X2))) ),
inference(literals_permutation,[status(thm)],[c_0_286]) ).
cnf(c_0_287_0,axiom,
( member(X1,X2)
| ~ member(ordered_pair(X1,X3),cross_product(X2,X4)) ),
inference(literals_permutation,[status(thm)],[c_0_287]) ).
cnf(c_0_287_1,axiom,
( ~ member(ordered_pair(X1,X3),cross_product(X2,X4))
| member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_287]) ).
cnf(c_0_288_0,axiom,
( member(X1,X2)
| ~ member(ordered_pair(X3,X1),cross_product(X4,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_288]) ).
cnf(c_0_288_1,axiom,
( ~ member(ordered_pair(X3,X1),cross_product(X4,X2))
| member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_288]) ).
cnf(c_0_289_0,axiom,
( member(X1,universal_class)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
inference(literals_permutation,[status(thm)],[c_0_289]) ).
cnf(c_0_289_1,axiom,
( ~ member(ordered_pair(X1,X2),cross_product(X3,X4))
| member(X1,universal_class) ),
inference(literals_permutation,[status(thm)],[c_0_289]) ).
cnf(c_0_290_0,axiom,
( member(X1,universal_class)
| ~ member(ordered_pair(X2,X1),cross_product(X3,X4)) ),
inference(literals_permutation,[status(thm)],[c_0_290]) ).
cnf(c_0_290_1,axiom,
( ~ member(ordered_pair(X2,X1),cross_product(X3,X4))
| member(X1,universal_class) ),
inference(literals_permutation,[status(thm)],[c_0_290]) ).
cnf(c_0_291_0,axiom,
( member(ordered_pair(X1,X2),cross_product(X3,X4))
| ~ member(X2,X4)
| ~ member(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_291]) ).
cnf(c_0_291_1,axiom,
( ~ member(X2,X4)
| member(ordered_pair(X1,X2),cross_product(X3,X4))
| ~ member(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_291]) ).
cnf(c_0_291_2,axiom,
( ~ member(X1,X3)
| ~ member(X2,X4)
| member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
inference(literals_permutation,[status(thm)],[c_0_291]) ).
cnf(c_0_292_0,axiom,
( domain_of(domain_of(X1)) = domain_of(X2)
| ~ compatible(X2,X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_292]) ).
cnf(c_0_292_1,axiom,
( ~ compatible(X2,X1,X3)
| domain_of(domain_of(X1)) = domain_of(X2) ),
inference(literals_permutation,[status(thm)],[c_0_292]) ).
cnf(c_0_293_0,axiom,
( member(X1,domain_of(X2))
| restrict(X2,singleton(X1),universal_class) = null_class
| ~ member(X1,universal_class) ),
inference(literals_permutation,[status(thm)],[c_0_293]) ).
cnf(c_0_293_1,axiom,
( restrict(X2,singleton(X1),universal_class) = null_class
| member(X1,domain_of(X2))
| ~ member(X1,universal_class) ),
inference(literals_permutation,[status(thm)],[c_0_293]) ).
cnf(c_0_293_2,axiom,
( ~ member(X1,universal_class)
| restrict(X2,singleton(X1),universal_class) = null_class
| member(X1,domain_of(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_293]) ).
cnf(c_0_294_0,axiom,
( ordered_pair(first(X1),second(X1)) = X1
| ~ member(X1,cross_product(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_294]) ).
cnf(c_0_294_1,axiom,
( ~ member(X1,cross_product(X2,X3))
| ordered_pair(first(X1),second(X1)) = X1 ),
inference(literals_permutation,[status(thm)],[c_0_294]) ).
cnf(c_0_295_0,axiom,
( function(X1)
| ~ compatible(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_295]) ).
cnf(c_0_295_1,axiom,
( ~ compatible(X1,X2,X3)
| function(X1) ),
inference(literals_permutation,[status(thm)],[c_0_295]) ).
cnf(c_0_296_0,axiom,
( operation(X1)
| ~ homomorphism(X2,X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_296]) ).
cnf(c_0_296_1,axiom,
( ~ homomorphism(X2,X1,X3)
| operation(X1) ),
inference(literals_permutation,[status(thm)],[c_0_296]) ).
cnf(c_0_297_0,axiom,
( operation(X1)
| ~ homomorphism(X2,X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_297]) ).
cnf(c_0_297_1,axiom,
( ~ homomorphism(X2,X3,X1)
| operation(X1) ),
inference(literals_permutation,[status(thm)],[c_0_297]) ).
cnf(c_0_298_0,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X3)
| ~ member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_298]) ).
cnf(c_0_298_1,axiom,
( ~ member(X1,X3)
| member(X1,intersection(X2,X3))
| ~ member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_298]) ).
cnf(c_0_298_2,axiom,
( ~ member(X1,X2)
| ~ member(X1,X3)
| member(X1,intersection(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_298]) ).
cnf(c_0_299_0,axiom,
( single_valued_class(X1)
| ~ subclass(compose(X1,inverse(X1)),identity_relation) ),
inference(literals_permutation,[status(thm)],[c_0_299]) ).
cnf(c_0_299_1,axiom,
( ~ subclass(compose(X1,inverse(X1)),identity_relation)
| single_valued_class(X1) ),
inference(literals_permutation,[status(thm)],[c_0_299]) ).
cnf(c_0_300_0,axiom,
( inductive(X1)
| ~ subclass(image(successor_relation,X1),X1)
| ~ member(null_class,X1) ),
inference(literals_permutation,[status(thm)],[c_0_300]) ).
cnf(c_0_300_1,axiom,
( ~ subclass(image(successor_relation,X1),X1)
| inductive(X1)
| ~ member(null_class,X1) ),
inference(literals_permutation,[status(thm)],[c_0_300]) ).
cnf(c_0_300_2,axiom,
( ~ member(null_class,X1)
| ~ subclass(image(successor_relation,X1),X1)
| inductive(X1) ),
inference(literals_permutation,[status(thm)],[c_0_300]) ).
cnf(c_0_301_0,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
inference(literals_permutation,[status(thm)],[c_0_301]) ).
cnf(c_0_301_1,axiom,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_301]) ).
cnf(c_0_302_0,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_302]) ).
cnf(c_0_302_1,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_302]) ).
cnf(c_0_303_0,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X3,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_303]) ).
cnf(c_0_303_1,axiom,
( ~ member(X1,intersection(X3,X2))
| member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_303]) ).
cnf(c_0_304_0,axiom,
( member(X1,X2)
| ~ member(ordered_pair(X1,X2),element_relation) ),
inference(literals_permutation,[status(thm)],[c_0_304]) ).
cnf(c_0_304_1,axiom,
( ~ member(ordered_pair(X1,X2),element_relation)
| member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_304]) ).
cnf(c_0_305_0,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X3,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_305]) ).
cnf(c_0_305_1,axiom,
( X1 = X3
| X1 = X2
| ~ member(X1,unordered_pair(X3,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_305]) ).
cnf(c_0_305_2,axiom,
( ~ member(X1,unordered_pair(X3,X2))
| X1 = X3
| X1 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_305]) ).
cnf(c_0_306_0,axiom,
( successor(X1) = X2
| ~ member(ordered_pair(X1,X2),successor_relation) ),
inference(literals_permutation,[status(thm)],[c_0_306]) ).
cnf(c_0_306_1,axiom,
( ~ member(ordered_pair(X1,X2),successor_relation)
| successor(X1) = X2 ),
inference(literals_permutation,[status(thm)],[c_0_306]) ).
cnf(c_0_307_0,axiom,
( member(image(X1,X2),universal_class)
| ~ member(X2,universal_class)
| ~ function(X1) ),
inference(literals_permutation,[status(thm)],[c_0_307]) ).
cnf(c_0_307_1,axiom,
( ~ member(X2,universal_class)
| member(image(X1,X2),universal_class)
| ~ function(X1) ),
inference(literals_permutation,[status(thm)],[c_0_307]) ).
cnf(c_0_307_2,axiom,
( ~ function(X1)
| ~ member(X2,universal_class)
| member(image(X1,X2),universal_class) ),
inference(literals_permutation,[status(thm)],[c_0_307]) ).
cnf(c_0_308_0,axiom,
( cross_product(domain_of(domain_of(X1)),domain_of(domain_of(X1))) = domain_of(X1)
| ~ operation(X1) ),
inference(literals_permutation,[status(thm)],[c_0_308]) ).
cnf(c_0_308_1,axiom,
( ~ operation(X1)
| cross_product(domain_of(domain_of(X1)),domain_of(domain_of(X1))) = domain_of(X1) ),
inference(literals_permutation,[status(thm)],[c_0_308]) ).
cnf(c_0_309_0,axiom,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
inference(literals_permutation,[status(thm)],[c_0_309]) ).
cnf(c_0_309_1,axiom,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_309]) ).
cnf(c_0_310_0,axiom,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
inference(literals_permutation,[status(thm)],[c_0_310]) ).
cnf(c_0_310_1,axiom,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X2,X1)) ),
inference(literals_permutation,[status(thm)],[c_0_310]) ).
cnf(c_0_311_0,axiom,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subclass(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_311]) ).
cnf(c_0_311_1,axiom,
( ~ member(X1,X3)
| member(X1,X2)
| ~ subclass(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_311]) ).
cnf(c_0_311_2,axiom,
( ~ subclass(X3,X2)
| ~ member(X1,X3)
| member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_311]) ).
cnf(c_0_312_0,axiom,
( subclass(X1,X2)
| ~ subclass(X3,X2)
| ~ subclass(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_312]) ).
cnf(c_0_312_1,axiom,
( ~ subclass(X3,X2)
| subclass(X1,X2)
| ~ subclass(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_312]) ).
cnf(c_0_312_2,axiom,
( ~ subclass(X1,X3)
| ~ subclass(X3,X2)
| subclass(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_312]) ).
cnf(c_0_313_0,axiom,
( member(apply(choice,X1),X1)
| X1 = null_class
| ~ member(X1,universal_class) ),
inference(literals_permutation,[status(thm)],[c_0_313]) ).
cnf(c_0_313_1,axiom,
( X1 = null_class
| member(apply(choice,X1),X1)
| ~ member(X1,universal_class) ),
inference(literals_permutation,[status(thm)],[c_0_313]) ).
cnf(c_0_313_2,axiom,
( ~ member(X1,universal_class)
| X1 = null_class
| member(apply(choice,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_313]) ).
cnf(c_0_314_0,axiom,
( subclass(compose(X1,inverse(X1)),identity_relation)
| ~ single_valued_class(X1) ),
inference(literals_permutation,[status(thm)],[c_0_314]) ).
cnf(c_0_314_1,axiom,
( ~ single_valued_class(X1)
| subclass(compose(X1,inverse(X1)),identity_relation) ),
inference(literals_permutation,[status(thm)],[c_0_314]) ).
cnf(c_0_315_0,axiom,
( subclass(compose(X1,inverse(X1)),identity_relation)
| ~ function(X1) ),
inference(literals_permutation,[status(thm)],[c_0_315]) ).
cnf(c_0_315_1,axiom,
( ~ function(X1)
| subclass(compose(X1,inverse(X1)),identity_relation) ),
inference(literals_permutation,[status(thm)],[c_0_315]) ).
cnf(c_0_316_0,axiom,
( member(X1,X2)
| member(X1,complement(X2))
| ~ member(X1,universal_class) ),
inference(literals_permutation,[status(thm)],[c_0_316]) ).
cnf(c_0_316_1,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
inference(literals_permutation,[status(thm)],[c_0_316]) ).
cnf(c_0_316_2,axiom,
( ~ member(X1,universal_class)
| member(X1,complement(X2))
| member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_316]) ).
cnf(c_0_317_0,axiom,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_317]) ).
cnf(c_0_317_1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_317]) ).
cnf(c_0_318_0,axiom,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),X1) ),
inference(literals_permutation,[status(thm)],[c_0_318]) ).
cnf(c_0_318_1,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_318]) ).
cnf(c_0_319_0,axiom,
( X1 = X2
| ~ subclass(X2,X1)
| ~ subclass(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_319]) ).
cnf(c_0_319_1,axiom,
( ~ subclass(X2,X1)
| X1 = X2
| ~ subclass(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_319]) ).
cnf(c_0_319_2,axiom,
( ~ subclass(X1,X2)
| ~ subclass(X2,X1)
| X1 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_319]) ).
cnf(c_0_320_0,axiom,
( subclass(range_of(X1),domain_of(domain_of(X1)))
| ~ operation(X1) ),
inference(literals_permutation,[status(thm)],[c_0_320]) ).
cnf(c_0_320_1,axiom,
( ~ operation(X1)
| subclass(range_of(X1),domain_of(domain_of(X1))) ),
inference(literals_permutation,[status(thm)],[c_0_320]) ).
cnf(c_0_321_0,axiom,
( subclass(image(successor_relation,X1),X1)
| ~ inductive(X1) ),
inference(literals_permutation,[status(thm)],[c_0_321]) ).
cnf(c_0_321_1,axiom,
( ~ inductive(X1)
| subclass(image(successor_relation,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_321]) ).
cnf(c_0_322_0,axiom,
( subclass(X1,cross_product(universal_class,universal_class))
| ~ function(X1) ),
inference(literals_permutation,[status(thm)],[c_0_322]) ).
cnf(c_0_322_1,axiom,
( ~ function(X1)
| subclass(X1,cross_product(universal_class,universal_class)) ),
inference(literals_permutation,[status(thm)],[c_0_322]) ).
cnf(c_0_323_0,axiom,
( member(sum_class(X1),universal_class)
| ~ member(X1,universal_class) ),
inference(literals_permutation,[status(thm)],[c_0_323]) ).
cnf(c_0_323_1,axiom,
( ~ member(X1,universal_class)
| member(sum_class(X1),universal_class) ),
inference(literals_permutation,[status(thm)],[c_0_323]) ).
cnf(c_0_324_0,axiom,
( member(power_class(X1),universal_class)
| ~ member(X1,universal_class) ),
inference(literals_permutation,[status(thm)],[c_0_324]) ).
cnf(c_0_324_1,axiom,
( ~ member(X1,universal_class)
| member(power_class(X1),universal_class) ),
inference(literals_permutation,[status(thm)],[c_0_324]) ).
cnf(c_0_325_0,axiom,
( one_to_one(X1)
| ~ function(X1)
| ~ function(inverse(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_325]) ).
cnf(c_0_325_1,axiom,
( ~ function(X1)
| one_to_one(X1)
| ~ function(inverse(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_325]) ).
cnf(c_0_325_2,axiom,
( ~ function(inverse(X1))
| ~ function(X1)
| one_to_one(X1) ),
inference(literals_permutation,[status(thm)],[c_0_325]) ).
cnf(c_0_326_0,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
inference(literals_permutation,[status(thm)],[c_0_326]) ).
cnf(c_0_326_1,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_326]) ).
cnf(c_0_327_0,axiom,
( intersection(X1,regular(X1)) = null_class
| X1 = null_class ),
inference(literals_permutation,[status(thm)],[c_0_327]) ).
cnf(c_0_327_1,axiom,
( X1 = null_class
| intersection(X1,regular(X1)) = null_class ),
inference(literals_permutation,[status(thm)],[c_0_327]) ).
cnf(c_0_328_0,axiom,
( member(null_class,X1)
| ~ inductive(X1) ),
inference(literals_permutation,[status(thm)],[c_0_328]) ).
cnf(c_0_328_1,axiom,
( ~ inductive(X1)
| member(null_class,X1) ),
inference(literals_permutation,[status(thm)],[c_0_328]) ).
cnf(c_0_329_0,axiom,
( subclass(omega,X1)
| ~ inductive(X1) ),
inference(literals_permutation,[status(thm)],[c_0_329]) ).
cnf(c_0_329_1,axiom,
( ~ inductive(X1)
| subclass(omega,X1) ),
inference(literals_permutation,[status(thm)],[c_0_329]) ).
cnf(c_0_330_0,axiom,
( subclass(X1,X2)
| X1 != X2 ),
inference(literals_permutation,[status(thm)],[c_0_330]) ).
cnf(c_0_330_1,axiom,
( X1 != X2
| subclass(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_330]) ).
cnf(c_0_331_0,axiom,
( subclass(X1,X2)
| X2 != X1 ),
inference(literals_permutation,[status(thm)],[c_0_331]) ).
cnf(c_0_331_1,axiom,
( X2 != X1
| subclass(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_331]) ).
cnf(c_0_332_0,axiom,
( function(inverse(X1))
| ~ one_to_one(X1) ),
inference(literals_permutation,[status(thm)],[c_0_332]) ).
cnf(c_0_332_1,axiom,
( ~ one_to_one(X1)
| function(inverse(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_332]) ).
cnf(c_0_333_0,axiom,
( function(X1)
| ~ one_to_one(X1) ),
inference(literals_permutation,[status(thm)],[c_0_333]) ).
cnf(c_0_333_1,axiom,
( ~ one_to_one(X1)
| function(X1) ),
inference(literals_permutation,[status(thm)],[c_0_333]) ).
cnf(c_0_334_0,axiom,
( function(X1)
| ~ operation(X1) ),
inference(literals_permutation,[status(thm)],[c_0_334]) ).
cnf(c_0_334_1,axiom,
( ~ operation(X1)
| function(X1) ),
inference(literals_permutation,[status(thm)],[c_0_334]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_151,negated_conjecture,
~ member(not_subclass_element(x,y),x),
file('<stdin>',prove_equality3_3) ).
fof(c_0_1_152,negated_conjecture,
member(not_subclass_element(y,x),x),
file('<stdin>',prove_equality3_1) ).
fof(c_0_2_153,negated_conjecture,
x != y,
file('<stdin>',prove_equality3_2) ).
fof(c_0_3_154,negated_conjecture,
~ member(not_subclass_element(x,y),x),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_4_155,negated_conjecture,
member(not_subclass_element(y,x),x),
c_0_1 ).
fof(c_0_5_156,negated_conjecture,
x != y,
c_0_2 ).
fof(c_0_6_157,negated_conjecture,
~ member(not_subclass_element(x,y),x),
c_0_3 ).
fof(c_0_7_158,negated_conjecture,
member(not_subclass_element(y,x),x),
c_0_4 ).
fof(c_0_8_159,negated_conjecture,
x != y,
c_0_5 ).
cnf(c_0_9_160,negated_conjecture,
~ member(not_subclass_element(x,y),x),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10_161,negated_conjecture,
member(not_subclass_element(y,x),x),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11_162,negated_conjecture,
x != y,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12_163,negated_conjecture,
~ member(not_subclass_element(x,y),x),
c_0_9,
[final] ).
cnf(c_0_13_164,negated_conjecture,
member(not_subclass_element(y,x),x),
c_0_10,
[final] ).
cnf(c_0_14_165,negated_conjecture,
y != x,
c_0_11,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_194,negated_conjecture,
y != x,
file('/export/starexec/sandbox/tmp/iprover_modulo_4f5988.p',c_0_14) ).
cnf(c_273,negated_conjecture,
y != x,
inference(copy,[status(esa)],[c_194]) ).
cnf(c_284,negated_conjecture,
y != x,
inference(copy,[status(esa)],[c_273]) ).
cnf(c_287,negated_conjecture,
y != x,
inference(copy,[status(esa)],[c_284]) ).
cnf(c_290,negated_conjecture,
y != x,
inference(copy,[status(esa)],[c_287]) ).
cnf(c_857,plain,
y != x,
inference(copy,[status(esa)],[c_290]) ).
cnf(c_129,plain,
( ~ subclass(X0,X1)
| ~ subclass(X1,X0)
| X0 = X1 ),
file('/export/starexec/sandbox/tmp/iprover_modulo_4f5988.p',c_0_319_0) ).
cnf(c_746,plain,
( ~ subclass(X0,X1)
| ~ subclass(X1,X0)
| X0 = X1 ),
inference(copy,[status(esa)],[c_129]) ).
cnf(c_863,plain,
( ~ subclass(x,y)
| ~ subclass(y,x) ),
inference(resolution,[status(thm)],[c_857,c_746]) ).
cnf(c_866,plain,
( ~ subclass(x,y)
| ~ subclass(y,x) ),
inference(rewriting,[status(thm)],[c_863]) ).
cnf(c_87,plain,
( ~ member(not_subclass_element(X0,X1),X1)
| subclass(X0,X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_4f5988.p',c_0_301_0) ).
cnf(c_662,plain,
( ~ member(not_subclass_element(X0,X1),X1)
| subclass(X0,X1) ),
inference(copy,[status(esa)],[c_87]) ).
cnf(c_917,plain,
( ~ member(not_subclass_element(y,x),x)
| ~ subclass(x,y) ),
inference(resolution,[status(thm)],[c_866,c_662]) ).
cnf(c_918,plain,
( ~ member(not_subclass_element(y,x),x)
| ~ subclass(x,y) ),
inference(rewriting,[status(thm)],[c_917]) ).
cnf(c_195,negated_conjecture,
member(not_subclass_element(y,x),x),
file('/export/starexec/sandbox/tmp/iprover_modulo_4f5988.p',c_0_13) ).
cnf(c_275,negated_conjecture,
member(not_subclass_element(y,x),x),
inference(copy,[status(esa)],[c_195]) ).
cnf(c_285,negated_conjecture,
member(not_subclass_element(y,x),x),
inference(copy,[status(esa)],[c_275]) ).
cnf(c_286,negated_conjecture,
member(not_subclass_element(y,x),x),
inference(copy,[status(esa)],[c_285]) ).
cnf(c_291,negated_conjecture,
member(not_subclass_element(y,x),x),
inference(copy,[status(esa)],[c_286]) ).
cnf(c_859,negated_conjecture,
member(not_subclass_element(y,x),x),
inference(copy,[status(esa)],[c_291]) ).
cnf(c_1175,plain,
~ subclass(x,y),
inference(forward_subsumption_resolution,[status(thm)],[c_918,c_859]) ).
cnf(c_1176,plain,
~ subclass(x,y),
inference(rewriting,[status(thm)],[c_1175]) ).
cnf(c_127,plain,
( member(not_subclass_element(X0,X1),X0)
| subclass(X0,X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_4f5988.p',c_0_318_0) ).
cnf(c_742,plain,
( member(not_subclass_element(X0,X1),X0)
| subclass(X0,X1) ),
inference(copy,[status(esa)],[c_127]) ).
cnf(c_1179,plain,
member(not_subclass_element(x,y),x),
inference(resolution,[status(thm)],[c_1176,c_742]) ).
cnf(c_1182,plain,
member(not_subclass_element(x,y),x),
inference(rewriting,[status(thm)],[c_1179]) ).
cnf(c_193,negated_conjecture,
~ member(not_subclass_element(x,y),x),
file('/export/starexec/sandbox/tmp/iprover_modulo_4f5988.p',c_0_12) ).
cnf(c_271,negated_conjecture,
~ member(not_subclass_element(x,y),x),
inference(copy,[status(esa)],[c_193]) ).
cnf(c_283,negated_conjecture,
~ member(not_subclass_element(x,y),x),
inference(copy,[status(esa)],[c_271]) ).
cnf(c_288,negated_conjecture,
~ member(not_subclass_element(x,y),x),
inference(copy,[status(esa)],[c_283]) ).
cnf(c_289,negated_conjecture,
~ member(not_subclass_element(x,y),x),
inference(copy,[status(esa)],[c_288]) ).
cnf(c_855,plain,
~ member(not_subclass_element(x,y),x),
inference(copy,[status(esa)],[c_289]) ).
cnf(c_1397,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1182,c_855]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SET058-7 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.06/0.12 % Command : iprover_modulo %s %d
% 0.12/0.33 % Computer : n003.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 Jul 10 04:12:29 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 % Running in mono-core mode
% 0.19/0.41 % Orienting using strategy Equiv(ClausalAll)
% 0.19/0.41 % Orientation found
% 0.19/0.41 % 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_a0625f.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_4f5988.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_462f4f | grep -v "SZS"
% 0.19/0.43
% 0.19/0.43 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.19/0.43
% 0.19/0.43 %
% 0.19/0.43 % ------ iProver source info
% 0.19/0.43
% 0.19/0.43 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.19/0.43 % git: non_committed_changes: true
% 0.19/0.43 % git: last_make_outside_of_git: true
% 0.19/0.43
% 0.19/0.43 %
% 0.19/0.43 % ------ Input Options
% 0.19/0.43
% 0.19/0.43 % --out_options all
% 0.19/0.43 % --tptp_safe_out true
% 0.19/0.43 % --problem_path ""
% 0.19/0.43 % --include_path ""
% 0.19/0.43 % --clausifier .//eprover
% 0.19/0.43 % --clausifier_options --tstp-format
% 0.19/0.43 % --stdin false
% 0.19/0.43 % --dbg_backtrace false
% 0.19/0.43 % --dbg_dump_prop_clauses false
% 0.19/0.43 % --dbg_dump_prop_clauses_file -
% 0.19/0.43 % --dbg_out_stat false
% 0.19/0.43
% 0.19/0.43 % ------ General Options
% 0.19/0.43
% 0.19/0.43 % --fof false
% 0.19/0.43 % --time_out_real 150.
% 0.19/0.43 % --time_out_prep_mult 0.2
% 0.19/0.43 % --time_out_virtual -1.
% 0.19/0.43 % --schedule none
% 0.19/0.43 % --ground_splitting input
% 0.19/0.43 % --splitting_nvd 16
% 0.19/0.43 % --non_eq_to_eq false
% 0.19/0.43 % --prep_gs_sim true
% 0.19/0.43 % --prep_unflatten false
% 0.19/0.43 % --prep_res_sim true
% 0.19/0.43 % --prep_upred true
% 0.19/0.43 % --res_sim_input true
% 0.19/0.43 % --clause_weak_htbl true
% 0.19/0.43 % --gc_record_bc_elim false
% 0.19/0.43 % --symbol_type_check false
% 0.19/0.43 % --clausify_out false
% 0.19/0.43 % --large_theory_mode false
% 0.19/0.43 % --prep_sem_filter none
% 0.19/0.43 % --prep_sem_filter_out false
% 0.19/0.43 % --preprocessed_out false
% 0.19/0.43 % --sub_typing false
% 0.19/0.43 % --brand_transform false
% 0.19/0.43 % --pure_diseq_elim true
% 0.19/0.43 % --min_unsat_core false
% 0.19/0.43 % --pred_elim true
% 0.19/0.43 % --add_important_lit false
% 0.19/0.43 % --soft_assumptions false
% 0.19/0.43 % --reset_solvers false
% 0.19/0.43 % --bc_imp_inh []
% 0.19/0.43 % --conj_cone_tolerance 1.5
% 0.19/0.43 % --prolific_symb_bound 500
% 0.19/0.43 % --lt_threshold 2000
% 0.19/0.43
% 0.19/0.43 % ------ SAT Options
% 0.19/0.43
% 0.19/0.43 % --sat_mode false
% 0.19/0.43 % --sat_fm_restart_options ""
% 0.19/0.43 % --sat_gr_def false
% 0.19/0.43 % --sat_epr_types true
% 0.19/0.43 % --sat_non_cyclic_types false
% 0.19/0.43 % --sat_finite_models false
% 0.19/0.43 % --sat_fm_lemmas false
% 0.19/0.43 % --sat_fm_prep false
% 0.19/0.43 % --sat_fm_uc_incr true
% 0.19/0.43 % --sat_out_model small
% 0.19/0.43 % --sat_out_clauses false
% 0.19/0.43
% 0.19/0.43 % ------ QBF Options
% 0.19/0.43
% 0.19/0.43 % --qbf_mode false
% 0.19/0.43 % --qbf_elim_univ true
% 0.19/0.43 % --qbf_sk_in true
% 0.19/0.43 % --qbf_pred_elim true
% 0.19/0.43 % --qbf_split 32
% 0.19/0.43
% 0.19/0.43 % ------ BMC1 Options
% 0.19/0.43
% 0.19/0.43 % --bmc1_incremental false
% 0.19/0.43 % --bmc1_axioms reachable_all
% 0.19/0.43 % --bmc1_min_bound 0
% 0.19/0.43 % --bmc1_max_bound -1
% 0.19/0.43 % --bmc1_max_bound_default -1
% 0.19/0.43 % --bmc1_symbol_reachability true
% 0.19/0.43 % --bmc1_property_lemmas false
% 0.19/0.43 % --bmc1_k_induction false
% 0.19/0.43 % --bmc1_non_equiv_states false
% 0.19/0.43 % --bmc1_deadlock false
% 0.19/0.43 % --bmc1_ucm false
% 0.19/0.43 % --bmc1_add_unsat_core none
% 0.19/0.43 % --bmc1_unsat_core_children false
% 0.19/0.43 % --bmc1_unsat_core_extrapolate_axioms false
% 0.19/0.43 % --bmc1_out_stat full
% 0.19/0.43 % --bmc1_ground_init false
% 0.19/0.43 % --bmc1_pre_inst_next_state false
% 0.19/0.43 % --bmc1_pre_inst_state false
% 0.19/0.43 % --bmc1_pre_inst_reach_state false
% 0.19/0.43 % --bmc1_out_unsat_core false
% 0.19/0.43 % --bmc1_aig_witness_out false
% 0.19/0.43 % --bmc1_verbose false
% 0.19/0.43 % --bmc1_dump_clauses_tptp false
% 0.70/1.02 % --bmc1_dump_unsat_core_tptp false
% 0.70/1.02 % --bmc1_dump_file -
% 0.70/1.02 % --bmc1_ucm_expand_uc_limit 128
% 0.70/1.02 % --bmc1_ucm_n_expand_iterations 6
% 0.70/1.02 % --bmc1_ucm_extend_mode 1
% 0.70/1.02 % --bmc1_ucm_init_mode 2
% 0.70/1.02 % --bmc1_ucm_cone_mode none
% 0.70/1.02 % --bmc1_ucm_reduced_relation_type 0
% 0.70/1.02 % --bmc1_ucm_relax_model 4
% 0.70/1.02 % --bmc1_ucm_full_tr_after_sat true
% 0.70/1.02 % --bmc1_ucm_expand_neg_assumptions false
% 0.70/1.02 % --bmc1_ucm_layered_model none
% 0.70/1.02 % --bmc1_ucm_max_lemma_size 10
% 0.70/1.02
% 0.70/1.02 % ------ AIG Options
% 0.70/1.02
% 0.70/1.02 % --aig_mode false
% 0.70/1.02
% 0.70/1.02 % ------ Instantiation Options
% 0.70/1.02
% 0.70/1.02 % --instantiation_flag true
% 0.70/1.02 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.70/1.02 % --inst_solver_per_active 750
% 0.70/1.02 % --inst_solver_calls_frac 0.5
% 0.70/1.02 % --inst_passive_queue_type priority_queues
% 0.70/1.02 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.70/1.02 % --inst_passive_queues_freq [25;2]
% 0.70/1.02 % --inst_dismatching true
% 0.70/1.02 % --inst_eager_unprocessed_to_passive true
% 0.70/1.02 % --inst_prop_sim_given true
% 0.70/1.02 % --inst_prop_sim_new false
% 0.70/1.02 % --inst_orphan_elimination true
% 0.70/1.02 % --inst_learning_loop_flag true
% 0.70/1.02 % --inst_learning_start 3000
% 0.70/1.02 % --inst_learning_factor 2
% 0.70/1.02 % --inst_start_prop_sim_after_learn 3
% 0.70/1.02 % --inst_sel_renew solver
% 0.70/1.02 % --inst_lit_activity_flag true
% 0.70/1.02 % --inst_out_proof true
% 0.70/1.02
% 0.70/1.02 % ------ Resolution Options
% 0.70/1.02
% 0.70/1.02 % --resolution_flag true
% 0.70/1.02 % --res_lit_sel kbo_max
% 0.70/1.02 % --res_to_prop_solver none
% 0.70/1.02 % --res_prop_simpl_new false
% 0.70/1.02 % --res_prop_simpl_given false
% 0.70/1.02 % --res_passive_queue_type priority_queues
% 0.70/1.02 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.70/1.02 % --res_passive_queues_freq [15;5]
% 0.70/1.02 % --res_forward_subs full
% 0.70/1.02 % --res_backward_subs full
% 0.70/1.02 % --res_forward_subs_resolution true
% 0.70/1.02 % --res_backward_subs_resolution true
% 0.70/1.02 % --res_orphan_elimination false
% 0.70/1.02 % --res_time_limit 1000.
% 0.70/1.02 % --res_out_proof true
% 0.70/1.02 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_a0625f.s
% 0.70/1.02 % --modulo true
% 0.70/1.02
% 0.70/1.02 % ------ Combination Options
% 0.70/1.02
% 0.70/1.02 % --comb_res_mult 1000
% 0.70/1.02 % --comb_inst_mult 300
% 0.70/1.02 % ------
% 0.70/1.02
% 0.70/1.02 % ------ Parsing...% successful
% 0.70/1.02
% 0.70/1.02 % ------ 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.70/1.02
% 0.70/1.02 % ------ Proving...
% 0.70/1.02 % ------ Problem Properties
% 0.70/1.02
% 0.70/1.02 %
% 0.70/1.02 % EPR false
% 0.70/1.02 % Horn false
% 0.70/1.02 % Has equality true
% 0.70/1.02
% 0.70/1.02 % % ------ Input Options Time Limit: Unbounded
% 0.70/1.02
% 0.70/1.02
% 0.70/1.02 Compiling...
% 0.70/1.02 Loading plugin: done.
% 0.70/1.02 Compiling...
% 0.70/1.02 Loading plugin: done.
% 0.70/1.02 Compiling...
% 0.70/1.02 Loading plugin: done.
% 0.70/1.02 Compiling...
% 0.70/1.02 Loading plugin: done.
% 0.70/1.02 Compiling...
% 0.70/1.02 Loading plugin: done.
% 0.70/1.02 % % ------ Current options:
% 0.70/1.02
% 0.70/1.02 % ------ Input Options
% 0.70/1.02
% 0.70/1.02 % --out_options all
% 0.70/1.02 % --tptp_safe_out true
% 0.70/1.02 % --problem_path ""
% 0.70/1.02 % --include_path ""
% 0.70/1.02 % --clausifier .//eprover
% 0.70/1.02 % --clausifier_options --tstp-format
% 0.70/1.02 % --stdin false
% 0.70/1.02 % --dbg_backtrace false
% 0.70/1.02 % --dbg_dump_prop_clauses false
% 0.70/1.02 % --dbg_dump_prop_clauses_file -
% 0.70/1.02 % --dbg_out_stat false
% 0.70/1.02
% 0.70/1.02 % ------ General Options
% 0.70/1.02
% 0.70/1.02 % --fof false
% 0.70/1.02 % --time_out_real 150.
% 0.70/1.02 % --time_out_prep_mult 0.2
% 0.70/1.02 % --time_out_virtual -1.
% 0.70/1.02 % --schedule none
% 0.70/1.02 % --ground_splitting input
% 0.70/1.02 % --splitting_nvd 16
% 0.70/1.02 % --non_eq_to_eq false
% 0.70/1.02 % --prep_gs_sim true
% 0.70/1.02 % --prep_unflatten false
% 0.70/1.02 % --prep_res_sim true
% 0.70/1.02 % --prep_upred true
% 0.70/1.02 % --res_sim_input true
% 0.70/1.02 % --clause_weak_htbl true
% 0.70/1.02 % --gc_record_bc_elim false
% 0.70/1.02 % --symbol_type_check false
% 0.70/1.02 % --clausify_out false
% 0.70/1.02 % --large_theory_mode false
% 0.70/1.02 % --prep_sem_filter none
% 0.70/1.02 % --prep_sem_filter_out false
% 0.70/1.02 % --preprocessed_out false
% 0.70/1.02 % --sub_typing false
% 0.70/1.02 % --brand_transform false
% 0.70/1.02 % --pure_diseq_elim true
% 0.70/1.02 % --min_unsat_core false
% 0.70/1.02 % --pred_elim true
% 0.70/1.02 % --add_important_lit false
% 0.70/1.02 % --soft_assumptions false
% 0.70/1.02 % --reset_solvers false
% 0.70/1.02 % --bc_imp_inh []
% 0.70/1.02 % --conj_cone_tolerance 1.5
% 0.70/1.02 % --prolific_symb_bound 500
% 0.70/1.02 % --lt_threshold 2000
% 0.70/1.02
% 0.70/1.02 % ------ SAT Options
% 0.70/1.02
% 0.70/1.02 % --sat_mode false
% 0.70/1.02 % --sat_fm_restart_options ""
% 0.70/1.02 % --sat_gr_def false
% 0.70/1.02 % --sat_epr_types true
% 0.70/1.02 % --sat_non_cyclic_types false
% 0.70/1.02 % --sat_finite_models false
% 0.70/1.02 % --sat_fm_lemmas false
% 0.70/1.02 % --sat_fm_prep false
% 0.70/1.02 % --sat_fm_uc_incr true
% 0.70/1.02 % --sat_out_model small
% 0.70/1.02 % --sat_out_clauses false
% 0.70/1.02
% 0.70/1.02 % ------ QBF Options
% 0.70/1.02
% 0.70/1.02 % --qbf_mode false
% 0.70/1.02 % --qbf_elim_univ true
% 0.70/1.02 % --qbf_sk_in true
% 0.70/1.02 % --qbf_pred_elim true
% 0.70/1.02 % --qbf_split 32
% 0.70/1.02
% 0.70/1.02 % ------ BMC1 Options
% 0.70/1.02
% 0.70/1.02 % --bmc1_incremental false
% 0.70/1.02 % --bmc1_axioms reachable_all
% 0.70/1.02 % --bmc1_min_bound 0
% 0.70/1.02 % --bmc1_max_bound -1
% 0.70/1.02 % --bmc1_max_bound_default -1
% 0.70/1.02 % --bmc1_symbol_reachability true
% 0.70/1.02 % --bmc1_property_lemmas false
% 0.70/1.02 % --bmc1_k_induction false
% 0.70/1.02 % --bmc1_non_equiv_states false
% 0.70/1.02 % --bmc1_deadlock false
% 0.70/1.02 % --bmc1_ucm false
% 0.70/1.02 % --bmc1_add_unsat_core none
% 0.70/1.02 % --bmc1_unsat_core_children false
% 0.70/1.02 % --bmc1_unsat_core_extrapolate_axioms false
% 0.70/1.02 % --bmc1_out_stat full
% 0.70/1.02 % --bmc1_ground_init false
% 0.70/1.02 % --bmc1_pre_inst_next_state false
% 0.70/1.02 % --bmc1_pre_inst_state false
% 0.70/1.02 % --bmc1_pre_inst_reach_state false
% 0.70/1.02 % --bmc1_out_unsat_core false
% 0.70/1.02 % --bmc1_aig_witness_out false
% 0.70/1.02 % --bmc1_verbose false
% 0.70/1.02 % --bmc1_dump_clauses_tptp false
% 0.70/1.02 % --bmc1_dump_unsat_core_tptp false
% 0.70/1.02 % --bmc1_dump_file -
% 0.70/1.02 % --bmc1_ucm_expand_uc_limit 128
% 0.70/1.02 % --bmc1_ucm_n_expand_iterations 6
% 0.70/1.02 % --bmc1_ucm_extend_mode 1
% 0.70/1.02 % --bmc1_ucm_init_mode 2
% 0.70/1.02 % --bmc1_ucm_cone_mode none
% 0.70/1.02 % --bmc1_ucm_reduced_relation_type 0
% 0.70/1.02 % --bmc1_ucm_relax_model 4
% 0.70/1.02 % --bmc1_ucm_full_tr_after_sat true
% 0.70/1.02 % --bmc1_ucm_expand_neg_assumptions false
% 0.70/1.02 % --bmc1_ucm_layered_model none
% 0.70/1.02 % --bmc1_ucm_max_lemma_size 10
% 0.70/1.02
% 0.70/1.02 % ------ AIG Options
% 0.70/1.02
% 0.70/1.02 % --aig_mode false
% 0.70/1.02
% 0.70/1.02 % ------ Instantiation Options
% 0.70/1.02
% 0.70/1.02 % --instantiation_flag true
% 0.70/1.02 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.70/1.02 % --inst_solver_per_active 750
% 0.70/1.02 % --inst_solver_calls_frac 0.5
% 0.70/1.02 % --inst_passive_queue_type priority_queues
% 0.70/1.02 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.70/1.03 % --inst_passive_queues_freq [25;2]
% 0.70/1.03 % --inst_dismatching true
% 0.70/1.03 % --inst_eager_unprocessed_to_passive true
% 0.70/1.03 % --inst_prop_sim_given true
% 0.70/1.03 % --inst_prop_sim_new false
% 0.70/1.03 % --inst_orphan_elimination true
% 0.70/1.03 % --inst_learning_loop_flag true
% 0.70/1.03 % --inst_learning_start 3000
% 0.70/1.03 % --inst_learning_factor 2
% 0.70/1.03 % --inst_start_prop_sim_after_learn 3
% 0.70/1.03 % --inst_sel_renew solver
% 0.70/1.03 % --inst_lit_activity_flag true
% 0.70/1.03 % --inst_out_proof true
% 0.70/1.03
% 0.70/1.03 % ------ Resolution Options
% 0.70/1.03
% 0.70/1.03 % --resolution_flag true
% 0.70/1.03 % --res_lit_sel kbo_max
% 0.70/1.03 % --res_to_prop_solver none
% 0.70/1.03 % --res_prop_simpl_new false
% 0.70/1.03 % --res_prop_simpl_given false
% 0.70/1.03 % --res_passive_queue_type priority_queues
% 0.70/1.03 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.70/1.03 % --res_passive_queues_freq [15;5]
% 0.70/1.03 % --res_forward_subs full
% 0.70/1.03 % --res_backward_subs full
% 0.70/1.03 % --res_forward_subs_resolution true
% 0.70/1.03 % --res_backward_subs_resolution true
% 0.70/1.03 % --res_orphan_elimination false
% 0.70/1.03 % --res_time_limit 1000.
% 0.70/1.03 % --res_out_proof true
% 0.70/1.03 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_a0625f.s
% 0.70/1.03 % --modulo true
% 0.70/1.03
% 0.70/1.03 % ------ Combination Options
% 0.70/1.03
% 0.70/1.03 % --comb_res_mult 1000
% 0.70/1.03 % --comb_inst_mult 300
% 0.70/1.03 % ------
% 0.70/1.03
% 0.70/1.03
% 0.70/1.03
% 0.70/1.03 % ------ Proving...
% 0.70/1.03 %
% 0.70/1.03
% 0.70/1.03
% 0.70/1.03 % Resolution empty clause
% 0.70/1.03
% 0.70/1.03 % ------ Statistics
% 0.70/1.03
% 0.70/1.03 % ------ General
% 0.70/1.03
% 0.70/1.03 % num_of_input_clauses: 196
% 0.70/1.03 % num_of_input_neg_conjectures: 3
% 0.70/1.03 % num_of_splits: 0
% 0.70/1.03 % num_of_split_atoms: 0
% 0.70/1.03 % num_of_sem_filtered_clauses: 0
% 0.70/1.03 % num_of_subtypes: 0
% 0.70/1.03 % monotx_restored_types: 0
% 0.70/1.03 % sat_num_of_epr_types: 0
% 0.70/1.03 % sat_num_of_non_cyclic_types: 0
% 0.70/1.03 % sat_guarded_non_collapsed_types: 0
% 0.70/1.03 % is_epr: 0
% 0.70/1.03 % is_horn: 0
% 0.70/1.03 % has_eq: 1
% 0.70/1.03 % num_pure_diseq_elim: 0
% 0.70/1.03 % simp_replaced_by: 0
% 0.70/1.03 % res_preprocessed: 6
% 0.70/1.03 % prep_upred: 0
% 0.70/1.03 % prep_unflattend: 0
% 0.70/1.03 % pred_elim_cands: 0
% 0.70/1.03 % pred_elim: 0
% 0.70/1.03 % pred_elim_cl: 0
% 0.70/1.03 % pred_elim_cycles: 0
% 0.70/1.03 % forced_gc_time: 0
% 0.70/1.03 % gc_basic_clause_elim: 0
% 0.70/1.03 % parsing_time: 0.008
% 0.70/1.03 % sem_filter_time: 0.
% 0.70/1.03 % pred_elim_time: 0.
% 0.70/1.03 % out_proof_time: 0.
% 0.70/1.03 % monotx_time: 0.
% 0.70/1.03 % subtype_inf_time: 0.
% 0.70/1.03 % unif_index_cands_time: 0.
% 0.70/1.03 % unif_index_add_time: 0.
% 0.70/1.03 % total_time: 0.62
% 0.70/1.03 % num_of_symbols: 74
% 0.70/1.03 % num_of_terms: 1320
% 0.70/1.03
% 0.70/1.03 % ------ Propositional Solver
% 0.70/1.03
% 0.70/1.03 % prop_solver_calls: 1
% 0.70/1.03 % prop_fast_solver_calls: 9
% 0.70/1.03 % prop_num_of_clauses: 201
% 0.70/1.03 % prop_preprocess_simplified: 587
% 0.70/1.03 % prop_fo_subsumed: 0
% 0.70/1.03 % prop_solver_time: 0.
% 0.70/1.03 % prop_fast_solver_time: 0.
% 0.70/1.03 % prop_unsat_core_time: 0.
% 0.70/1.03
% 0.70/1.03 % ------ QBF
% 0.70/1.03
% 0.70/1.03 % qbf_q_res: 0
% 0.70/1.03 % qbf_num_tautologies: 0
% 0.70/1.03 % qbf_prep_cycles: 0
% 0.70/1.03
% 0.70/1.03 % ------ BMC1
% 0.70/1.03
% 0.70/1.03 % bmc1_current_bound: -1
% 0.70/1.03 % bmc1_last_solved_bound: -1
% 0.70/1.03 % bmc1_unsat_core_size: -1
% 0.70/1.03 % bmc1_unsat_core_parents_size: -1
% 0.70/1.03 % bmc1_merge_next_fun: 0
% 0.70/1.03 % bmc1_unsat_core_clauses_time: 0.
% 0.70/1.03
% 0.70/1.03 % ------ Instantiation
% 0.70/1.03
% 0.70/1.03 % inst_num_of_clauses: 196
% 0.70/1.03 % inst_num_in_passive: 0
% 0.70/1.03 % inst_num_in_active: 0
% 0.70/1.03 % inst_num_in_unprocessed: 196
% 0.70/1.03 % inst_num_of_loops: 0
% 0.70/1.03 % inst_num_of_learning_restarts: 0
% 0.70/1.03 % inst_num_moves_active_passive: 0
% 0.70/1.03 % inst_lit_activity: 0
% 0.70/1.03 % inst_lit_activity_moves: 0
% 0.70/1.03 % inst_num_tautologies: 0
% 0.70/1.03 % inst_num_prop_implied: 0
% 0.70/1.03 % inst_num_existing_simplified: 0
% 0.70/1.03 % inst_num_eq_res_simplified: 0
% 0.70/1.03 % inst_num_child_elim: 0
% 0.70/1.03 % inst_num_of_dismatching_blockings: 0
% 0.70/1.03 % inst_num_of_non_proper_insts: 0
% 0.70/1.03 % inst_num_of_duplicates: 0
% 0.70/1.03 % inst_inst_num_from_inst_to_res: 0
% 0.70/1.03 % inst_dismatching_checking_time: 0.
% 0.70/1.03
% 0.70/1.03 % ------ Resolution
% 0.70/1.03
% 0.70/1.03 % res_num_of_clauses: 411
% 0.70/1.03 % res_num_in_passive: 171
% 0.70/1.03 % res_num_in_active: 117
% 0.70/1.03 % res_num_of_loops: 35
% 0.70/1.03 % res_forward_subset_subsumed: 108
% 0.70/1.03 % res_backward_subset_subsumed: 2
% 0.70/1.03 % res_forward_subsumed: 2
% 0.70/1.03 % res_backward_subsumed: 1
% 0.70/1.03 % res_forward_subsumption_resolution: 2
% 0.70/1.03 % res_backward_subsumption_resolution: 0
% 0.70/1.03 % res_clause_to_clause_subsumption: 48
% 0.70/1.03 % res_orphan_elimination: 0
% 0.70/1.03 % res_tautology_del: 1
% 0.70/1.03 % res_num_eq_res_simplified: 0
% 0.70/1.03 % res_num_sel_changes: 0
% 0.70/1.03 % res_moves_from_active_to_pass: 0
% 0.70/1.03
% 0.70/1.03 % Status Unsatisfiable
% 0.70/1.03 % SZS status Unsatisfiable
% 0.70/1.03 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------