TSTP Solution File: SET664+3 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SET664+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% Computer : n007.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 01:01:50 EDT 2022
% Result : Theorem 0.19s 0.38s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET664+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.34 % Computer : n007.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jul 10 10:48:16 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.37 # No SInE strategy applied
% 0.19/0.37 # Auto-Mode selected heuristic G_E___208_C18C___F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.19/0.37 #
% 0.19/0.37 # Presaturation interreduction done
% 0.19/0.37 # Number of axioms: 60 Number of unprocessed: 45
% 0.19/0.37 # Tableaux proof search.
% 0.19/0.37 # APR header successfully linked.
% 0.19/0.37 # Hello from C++
% 0.19/0.37 # The folding up rule is enabled...
% 0.19/0.37 # Local unification is enabled...
% 0.19/0.37 # Any saturation attempts will use folding labels...
% 0.19/0.37 # 45 beginning clauses after preprocessing and clausification
% 0.19/0.37 # Creating start rules for all 3 conjectures.
% 0.19/0.37 # There are 3 start rule candidates:
% 0.19/0.37 # Found 12 unit axioms.
% 0.19/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.19/0.37 # 3 start rule tableaux created.
% 0.19/0.37 # 33 extension rule candidate clauses
% 0.19/0.37 # 12 unit axiom clauses
% 0.19/0.37
% 0.19/0.37 # Requested 8, 32 cores available to the main process.
% 0.19/0.37 # There are not enough tableaux to fork, creating more from the initial 3
% 0.19/0.37 # Returning from population with 13 new_tableaux and 0 remaining starting tableaux.
% 0.19/0.37 # We now have 13 tableaux to operate on
% 0.19/0.38 # There were 1 total branch saturation attempts.
% 0.19/0.38 # There were 0 of these attempts blocked.
% 0.19/0.38 # There were 0 deferred branch saturation attempts.
% 0.19/0.38 # There were 0 free duplicated saturations.
% 0.19/0.38 # There were 1 total successful branch saturations.
% 0.19/0.38 # There were 0 successful branch saturations in interreduction.
% 0.19/0.38 # There were 0 successful branch saturations on the branch.
% 0.19/0.38 # There were 1 successful branch saturations after the branch.
% 0.19/0.38 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.38 # Begin clausification derivation
% 0.19/0.38
% 0.19/0.38 # End clausification derivation
% 0.19/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.38 cnf(i_0_62, negated_conjecture, (ilf_type(esk15_0,relation_type(esk14_0,empty_set)))).
% 0.19/0.38 cnf(i_0_63, negated_conjecture, (ilf_type(esk15_0,relation_type(esk14_0,esk13_0)))).
% 0.19/0.38 cnf(i_0_7, plain, (empty(empty_set))).
% 0.19/0.38 cnf(i_0_8, plain, (type(empty_set,set_type))).
% 0.19/0.38 cnf(i_0_60, plain, (ilf_type(X1,set_type))).
% 0.19/0.38 cnf(i_0_25, plain, (ilf_type(esk4_0,binary_relation_type))).
% 0.19/0.38 cnf(i_0_35, plain, (subset(X1,X1))).
% 0.19/0.38 cnf(i_0_28, plain, (ilf_type(esk5_1(X1),subset_type(X1)))).
% 0.19/0.38 cnf(i_0_11, plain, (ilf_type(esk1_2(X1,X2),relation_type(X2,X1)))).
% 0.19/0.38 cnf(i_0_61, negated_conjecture, (esk15_0!=empty_set)).
% 0.19/0.38 cnf(i_0_6, plain, (~member(X1,empty_set))).
% 0.19/0.38 cnf(i_0_44, plain, (~empty(power_set(X1)))).
% 0.19/0.38 cnf(i_0_1, plain, (X1=empty_set|~subset(X1,empty_set))).
% 0.19/0.38 cnf(i_0_3, plain, (X1=empty_set|domain_of(X1)!=empty_set|~ilf_type(X1,binary_relation_type))).
% 0.19/0.38 cnf(i_0_2, plain, (X1=empty_set|range_of(X1)!=empty_set|~ilf_type(X1,binary_relation_type))).
% 0.19/0.38 cnf(i_0_54, plain, (relation_like(X1)|~empty(X1))).
% 0.19/0.38 cnf(i_0_24, plain, (relation_like(X1)|~ilf_type(X1,binary_relation_type))).
% 0.19/0.38 cnf(i_0_22, plain, (ilf_type(X1,binary_relation_type)|~relation_like(X1))).
% 0.19/0.38 cnf(i_0_38, plain, (~empty(X1)|~member(X2,X1))).
% 0.19/0.38 cnf(i_0_36, plain, (empty(X1)|member(esk7_1(X1),X1))).
% 0.19/0.38 cnf(i_0_49, plain, (relation_like(X1)|member(esk12_1(X1),X1))).
% 0.19/0.38 cnf(i_0_31, plain, (subset(X1,X2)|~member(esk6_2(X1,X2),X2))).
% 0.19/0.38 cnf(i_0_55, plain, (relation_like(X1)|~ilf_type(X1,subset_type(cross_product(X2,X3))))).
% 0.19/0.38 cnf(i_0_39, plain, (member(X1,power_set(X2))|~member(esk8_2(X1,X2),X2))).
% 0.19/0.38 cnf(i_0_26, plain, (ilf_type(X1,subset_type(X2))|~ilf_type(X1,member_type(power_set(X2))))).
% 0.19/0.38 cnf(i_0_47, plain, (empty(X1)|ilf_type(esk9_1(X1),member_type(X1)))).
% 0.19/0.38 cnf(i_0_48, plain, (relation_like(X1)|esk12_1(X1)!=ordered_pair(X2,X3))).
% 0.19/0.38 cnf(i_0_46, plain, (empty(X1)|member(X2,X1)|~ilf_type(X2,member_type(X1)))).
% 0.19/0.38 cnf(i_0_10, plain, (ilf_type(X1,relation_type(X2,X3))|~ilf_type(X1,subset_type(cross_product(X2,X3))))).
% 0.19/0.38 cnf(i_0_45, plain, (ilf_type(X1,member_type(X2))|~member(X1,X2))).
% 0.19/0.38 cnf(i_0_5, plain, (subset(domain_of(X1),X2)|~ilf_type(X1,relation_type(X2,X3)))).
% 0.19/0.38 cnf(i_0_27, plain, (ilf_type(X1,member_type(power_set(X2)))|~ilf_type(X1,subset_type(X2)))).
% 0.19/0.38 cnf(i_0_32, plain, (member(esk6_2(X1,X2),X1)|subset(X1,X2))).
% 0.19/0.38 cnf(i_0_40, plain, (member(esk8_2(X1,X2),X1)|member(X1,power_set(X2)))).
% 0.19/0.38 cnf(i_0_4, plain, (subset(range_of(X1),X2)|~ilf_type(X1,relation_type(X3,X2)))).
% 0.19/0.38 cnf(i_0_34, plain, (member(X1,X2)|~member(X1,X3)|~subset(X3,X2))).
% 0.19/0.38 cnf(i_0_56, plain, (domain(X1,X2,X3)=domain_of(X3)|~ilf_type(X3,relation_type(X1,X2)))).
% 0.19/0.38 cnf(i_0_58, plain, (range(X1,X2,X3)=range_of(X3)|~ilf_type(X3,relation_type(X1,X2)))).
% 0.19/0.38 cnf(i_0_9, plain, (ilf_type(X1,subset_type(cross_product(X2,X3)))|~ilf_type(X1,relation_type(X2,X3)))).
% 0.19/0.38 cnf(i_0_57, plain, (ilf_type(domain(X1,X2,X3),subset_type(X1))|~ilf_type(X3,relation_type(X1,X2)))).
% 0.19/0.38 cnf(i_0_59, plain, (ilf_type(range(X1,X2,X3),subset_type(X2))|~ilf_type(X3,relation_type(X1,X2)))).
% 0.19/0.38 cnf(i_0_42, plain, (member(X1,X2)|~member(X3,power_set(X2))|~member(X1,X3))).
% 0.19/0.38 cnf(i_0_51, plain, (ordered_pair(esk10_2(X1,X2),esk11_2(X1,X2))=X2|~relation_like(X1)|~member(X2,X1))).
% 0.19/0.38 cnf(i_0_12, plain, (X1=X2|member(ordered_pair(esk2_2(X1,X2),esk3_2(X1,X2)),X1)|member(ordered_pair(esk2_2(X1,X2),esk3_2(X1,X2)),X2)|~ilf_type(X2,binary_relation_type)|~ilf_type(X1,binary_relation_type))).
% 0.19/0.38 cnf(i_0_13, plain, (X1=X2|~member(ordered_pair(esk2_2(X1,X2),esk3_2(X1,X2)),X2)|~member(ordered_pair(esk2_2(X1,X2),esk3_2(X1,X2)),X1)|~ilf_type(X2,binary_relation_type)|~ilf_type(X1,binary_relation_type))).
% 0.19/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.38 # Begin printing tableau
% 0.19/0.38 # Found 4 steps
% 0.19/0.38 cnf(i_0_63, negated_conjecture, (ilf_type(esk15_0,relation_type(esk14_0,esk13_0))), inference(start_rule)).
% 0.19/0.38 cnf(i_0_67, plain, (ilf_type(esk15_0,relation_type(esk14_0,esk13_0))), inference(extension_rule, [i_0_9])).
% 0.19/0.38 cnf(i_0_203, plain, (ilf_type(esk15_0,subset_type(cross_product(esk14_0,esk13_0)))), inference(extension_rule, [i_0_55])).
% 0.19/0.38 cnf(i_0_247, plain, (relation_like(esk15_0)), inference(etableau_closure_rule, [i_0_247, ...])).
% 0.19/0.38 # End printing tableau
% 0.19/0.38 # SZS output end
% 0.19/0.38 # Branches closed with saturation will be marked with an "s"
% 0.19/0.38 # There were 1 total branch saturation attempts.
% 0.19/0.38 # There were 0 of these attempts blocked.
% 0.19/0.38 # There were 0 deferred branch saturation attempts.
% 0.19/0.38 # There were 0 free duplicated saturations.
% 0.19/0.38 # There were 1 total successful branch saturations.
% 0.19/0.38 # There were 0 successful branch saturations in interreduction.
% 0.19/0.38 # There were 0 successful branch saturations on the branch.
% 0.19/0.38 # There were 1 successful branch saturations after the branch.
% 0.19/0.38 # There were 1 total branch saturation attempts.
% 0.19/0.38 # There were 0 of these attempts blocked.
% 0.19/0.38 # There were 0 deferred branch saturation attempts.
% 0.19/0.38 # There were 0 free duplicated saturations.
% 0.19/0.38 # There were 1 total successful branch saturations.
% 0.19/0.38 # There were 0 successful branch saturations in interreduction.
% 0.19/0.38 # There were 0 successful branch saturations on the branch.
% 0.19/0.38 # There were 1 successful branch saturations after the branch.
% 0.19/0.38 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.38 # Begin clausification derivation
% 0.19/0.38
% 0.19/0.38 # End clausification derivation
% 0.19/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.38 cnf(i_0_62, negated_conjecture, (ilf_type(esk15_0,relation_type(esk14_0,empty_set)))).
% 0.19/0.38 cnf(i_0_63, negated_conjecture, (ilf_type(esk15_0,relation_type(esk14_0,esk13_0)))).
% 0.19/0.38 cnf(i_0_7, plain, (empty(empty_set))).
% 0.19/0.38 cnf(i_0_8, plain, (type(empty_set,set_type))).
% 0.19/0.38 cnf(i_0_60, plain, (ilf_type(X1,set_type))).
% 0.19/0.38 cnf(i_0_25, plain, (ilf_type(esk4_0,binary_relation_type))).
% 0.19/0.38 cnf(i_0_35, plain, (subset(X1,X1))).
% 0.19/0.38 cnf(i_0_28, plain, (ilf_type(esk5_1(X1),subset_type(X1)))).
% 0.19/0.38 cnf(i_0_11, plain, (ilf_type(esk1_2(X1,X2),relation_type(X2,X1)))).
% 0.19/0.38 cnf(i_0_61, negated_conjecture, (esk15_0!=empty_set)).
% 0.19/0.38 cnf(i_0_6, plain, (~member(X1,empty_set))).
% 0.19/0.38 cnf(i_0_44, plain, (~empty(power_set(X1)))).
% 0.19/0.38 cnf(i_0_1, plain, (X1=empty_set|~subset(X1,empty_set))).
% 0.19/0.38 cnf(i_0_3, plain, (X1=empty_set|domain_of(X1)!=empty_set|~ilf_type(X1,binary_relation_type))).
% 0.19/0.38 cnf(i_0_2, plain, (X1=empty_set|range_of(X1)!=empty_set|~ilf_type(X1,binary_relation_type))).
% 0.19/0.38 cnf(i_0_54, plain, (relation_like(X1)|~empty(X1))).
% 0.19/0.38 cnf(i_0_24, plain, (relation_like(X1)|~ilf_type(X1,binary_relation_type))).
% 0.19/0.38 cnf(i_0_22, plain, (ilf_type(X1,binary_relation_type)|~relation_like(X1))).
% 0.19/0.38 cnf(i_0_38, plain, (~empty(X1)|~member(X2,X1))).
% 0.19/0.38 cnf(i_0_36, plain, (empty(X1)|member(esk7_1(X1),X1))).
% 0.19/0.38 cnf(i_0_49, plain, (relation_like(X1)|member(esk12_1(X1),X1))).
% 0.19/0.38 cnf(i_0_31, plain, (subset(X1,X2)|~member(esk6_2(X1,X2),X2))).
% 0.19/0.38 cnf(i_0_55, plain, (relation_like(X1)|~ilf_type(X1,subset_type(cross_product(X2,X3))))).
% 0.19/0.38 cnf(i_0_39, plain, (member(X1,power_set(X2))|~member(esk8_2(X1,X2),X2))).
% 0.19/0.38 cnf(i_0_26, plain, (ilf_type(X1,subset_type(X2))|~ilf_type(X1,member_type(power_set(X2))))).
% 0.19/0.38 cnf(i_0_47, plain, (empty(X1)|ilf_type(esk9_1(X1),member_type(X1)))).
% 0.19/0.38 cnf(i_0_48, plain, (relation_like(X1)|esk12_1(X1)!=ordered_pair(X2,X3))).
% 0.19/0.38 cnf(i_0_46, plain, (empty(X1)|member(X2,X1)|~ilf_type(X2,member_type(X1)))).
% 0.19/0.38 cnf(i_0_10, plain, (ilf_type(X1,relation_type(X2,X3))|~ilf_type(X1,subset_type(cross_product(X2,X3))))).
% 0.19/0.38 cnf(i_0_45, plain, (ilf_type(X1,member_type(X2))|~member(X1,X2))).
% 0.19/0.38 cnf(i_0_5, plain, (subset(domain_of(X1),X2)|~ilf_type(X1,relation_type(X2,X3)))).
% 0.19/0.38 cnf(i_0_27, plain, (ilf_type(X1,member_type(power_set(X2)))|~ilf_type(X1,subset_type(X2)))).
% 0.19/0.38 cnf(i_0_32, plain, (member(esk6_2(X1,X2),X1)|subset(X1,X2))).
% 0.19/0.38 cnf(i_0_40, plain, (member(esk8_2(X1,X2),X1)|member(X1,power_set(X2)))).
% 0.19/0.38 cnf(i_0_4, plain, (subset(range_of(X1),X2)|~ilf_type(X1,relation_type(X3,X2)))).
% 0.19/0.38 cnf(i_0_34, plain, (member(X1,X2)|~member(X1,X3)|~subset(X3,X2))).
% 0.19/0.38 cnf(i_0_56, plain, (domain(X1,X2,X3)=domain_of(X3)|~ilf_type(X3,relation_type(X1,X2)))).
% 0.19/0.38 cnf(i_0_58, plain, (range(X1,X2,X3)=range_of(X3)|~ilf_type(X3,relation_type(X1,X2)))).
% 0.19/0.38 cnf(i_0_9, plain, (ilf_type(X1,subset_type(cross_product(X2,X3)))|~ilf_type(X1,relation_type(X2,X3)))).
% 0.19/0.38 cnf(i_0_57, plain, (ilf_type(domain(X1,X2,X3),subset_type(X1))|~ilf_type(X3,relation_type(X1,X2)))).
% 0.19/0.38 cnf(i_0_59, plain, (ilf_type(range(X1,X2,X3),subset_type(X2))|~ilf_type(X3,relation_type(X1,X2)))).
% 0.19/0.38 cnf(i_0_42, plain, (member(X1,X2)|~member(X3,power_set(X2))|~member(X1,X3))).
% 0.19/0.38 cnf(i_0_51, plain, (ordered_pair(esk10_2(X1,X2),esk11_2(X1,X2))=X2|~relation_like(X1)|~member(X2,X1))).
% 0.19/0.38 cnf(i_0_12, plain, (X1=X2|member(ordered_pair(esk2_2(X1,X2),esk3_2(X1,X2)),X1)|member(ordered_pair(esk2_2(X1,X2),esk3_2(X1,X2)),X2)|~ilf_type(X2,binary_relation_type)|~ilf_type(X1,binary_relation_type))).
% 0.19/0.38 cnf(i_0_13, plain, (X1=X2|~member(ordered_pair(esk2_2(X1,X2),esk3_2(X1,X2)),X2)|~member(ordered_pair(esk2_2(X1,X2),esk3_2(X1,X2)),X1)|~ilf_type(X2,binary_relation_type)|~ilf_type(X1,binary_relation_type))).
% 0.19/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.38 # Begin printing tableau
% 0.19/0.38 # Found 4 steps
% 0.19/0.38 cnf(i_0_61, negated_conjecture, (esk15_0!=empty_set), inference(start_rule)).
% 0.19/0.38 cnf(i_0_66, plain, (esk15_0!=empty_set), inference(extensi# SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.38 # Begin clausification derivation
% 0.19/0.38
% 0.19/0.38 # End clausification derivation
% 0.19/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.38 cnf(i_0_62, negated_conjecture, (ilf_type(esk15_0,relation_type(esk14_0,empty_set)))).
% 0.19/0.38 cnf(i_0_63, negated_conjecture, (ilf_type(esk15_0,relation_type(esk14_0,esk13_0)))).
% 0.19/0.38 cnf(i_0_7, plain, (empty(empty_set))).
% 0.19/0.38 cnf(i_0_8, plain, (type(empty_set,set_type))).
% 0.19/0.38 cnf(i_0_60, plain, (ilf_type(X1,set_type))).
% 0.19/0.38 cnf(i_0_25, plain, (ilf_type(esk4_0,binary_relation_type))).
% 0.19/0.38 cnf(i_0_35, plain, (subset(X1,X1))).
% 0.19/0.38 cnf(i_0_28, plain, (ilf_type(esk5_1(X1),subset_type(X1)))).
% 0.19/0.38 cnf(i_0_11, plain, (ilf_type(esk1_2(X1,X2),relation_type(X2,X1)))).
% 0.19/0.38 cnf(i_0_61, negated_conjecture, (esk15_0!=empty_set)).
% 0.19/0.38 cnf(i_0_6, plain, (~member(X1,empty_set))).
% 0.19/0.38 cnf(i_0_44, plain, (~empty(power_set(X1)))).
% 0.19/0.38 cnf(i_0_1, plain, (X1=empty_set|~subset(X1,empty_set))).
% 0.19/0.38 cnf(i_0_3, plain, (X1=empty_set|domain_of(X1)!=empty_set|~ilf_type(X1,binary_relation_type))).
% 0.19/0.38 cnf(i_0_2, plain, (X1=empty_set|range_of(X1)!=empty_set|~ilf_type(X1,binary_relation_type))).
% 0.19/0.38 cnf(i_0_54, plain, (relation_like(X1)|~empty(X1))).
% 0.19/0.38 cnf(i_0_24, plain, (relation_like(X1)|~ilf_type(X1,binary_relation_type))).
% 0.19/0.38 cnf(i_0_22, plain, (ilf_type(X1,binary_relation_type)|~relation_like(X1))).
% 0.19/0.38 cnf(i_0_38, plain, (~empty(X1)|~member(X2,X1))).
% 0.19/0.38 cnf(i_0_36, plain, (empty(X1)|member(esk7_1(X1),X1))).
% 0.19/0.38 cnf(i_0_49, plain, (relation_like(X1)|member(esk12_1(X1),X1))).
% 0.19/0.38 cnf(i_0_31, plain, (subset(X1,X2)|~member(esk6_2(X1,X2),X2))).
% 0.19/0.38 cnf(i_0_55, plain, (relation_like(X1)|~ilf_type(X1,subset_type(cross_product(X2,X3))))).
% 0.19/0.38 cnf(i_0_39, plain, (member(X1,power_set(X2))|~member(esk8_2(X1,X2),X2))).
% 0.19/0.38 cnf(i_0_26, plain, (ilf_type(X1,subset_type(X2))|~ilf_type(X1,member_type(power_set(X2))))).
% 0.19/0.38 cnf(i_0_47, plain, (empty(X1)|ilf_type(esk9_1(X1),member_type(X1)))).
% 0.19/0.38 cnf(i_0_48, plain, (relation_like(X1)|esk12_1(X1)!=ordered_pair(X2,X3))).
% 0.19/0.38 cnf(i_0_46, plain, (empty(X1)|member(X2,X1)|~ilf_type(X2,member_type(X1)))).
% 0.19/0.38 cnf(i_0_10, plain, (ilf_type(X1,relation_type(X2,X3))|~ilf_type(X1,subset_type(cross_product(X2,X3))))).
% 0.19/0.38 cnf(i_0_45, plain, (ilf_type(X1,member_type(X2))|~member(X1,X2))).
% 0.19/0.38 cnf(i_0_5, plain, (subset(domain_of(X1),X2)|~ilf_type(X1,relation_type(X2,X3)))).
% 0.19/0.38 cnf(i_0_27, plain, (ilf_type(X1,member_type(power_set(X2)))|~ilf_type(X1,subset_type(X2)))).
% 0.19/0.38 cnf(i_0_32, plain, (member(esk6_2(X1,X2),X1)|subset(X1,X2))).
% 0.19/0.38 cnf(i_0_40, plain, (member(esk8_2(X1,X2),X1)|member(X1,power_set(X2)))).
% 0.19/0.38 cnf(i_0_4, plain, (subset(range_of(X1),X2)|~ilf_type(X1,relation_type(X3,X2)))).
% 0.19/0.38 cnf(i_0_34, plain, (member(X1,X2)|~member(X1,X3)|~subset(X3,X2))).
% 0.19/0.38 cnf(i_0_56, plain, (domain(X1,X2,X3)=domain_of(X3)|~ilf_type(X3,relation_type(X1,X2)))).
% 0.19/0.38 cnf(i_0_58, plain, (range(X1,X2,X3)=range_of(X3)|~ilf_type(X3,relation_type(X1,X2)))).
% 0.19/0.38 cnf(i_0_9, plain, (ilf_type(X1,subset_type(cross_product(X2,X3)))|~ilf_type(X1,relation_type(X2,X3)))).
% 0.19/0.38 cnf(i_0_57, plain, (ilf_type(domain(X1,X2,X3),subset_type(X1))|~ilf_type(X3,relation_type(X1,X2)))).
% 0.19/0.38 cnf(i_0_59, plain, (ilf_type(range(X1,X2,X3),subset_type(X2))|~ilf_type(X3,relation_type(X1,X2)))).
% 0.19/0.38 cnf(i_0_42, plain, (member(X1,X2)|~member(X3,power_set(X2))|~member(X1,X3))).
% 0.19/0.38 cnf(i_0_51, plain, (ordered_pair(esk10_2(X1,X2),esk11_2(X1,X2))=X2|~relation_like(X1)|~member(X2,X1))).
% 0.19/0.38 cnf(i_0_12, plain, (X1=X2|member(ordered_pair(esk2_2(X1,X2),esk3_2(X1,X2)),X1)|member(ordered_pair(esk2_2(X1,X2),esk3_2(X1,X2)),X2)|~ilf_type(X2,binary_relation_type)|~ilf_type(X1,binary_relation_type))).
% 0.19/0.38 cnf(i_0_13, plain, (X1=X2|~member(ordered_pair(esk2_2(X1,X2),esk3_2(X1,X2)),X2)|~member(ordered_pair(esk2_2(X1,X2),esk3_2(X1,X2)),X1)|~ilf_type(X2,binary_relation_type)|~ilf_type(X1,binary_relation_type))).
% 0.19/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.38 # Begin printing tableau
% 0.19/0.38 # Found 4 steps
% 0.19/0.38 cnf(i_0_63, negated_conjecture, (ilf_type(esk15_0,relation_type(esk14_0,esk13_0))), inference(start_rule)).
% 0.19/0.38 cnf(i_0_67, plain, (ilf_type(esk15_0,relation_type(esk14_0,esk13_0))), inference(extension_rule, [i_0_57])).
% 0.19/0.38 cnf(i_0_205, plain, (ilf_type(domain(esk14_0,esk13_0,esk15_0),subset_type(esk14_0))), inference(extension_rule, [i_0_27])).
% 0.19/0.38 cnf(i_0_266, plain, (ilf_type(domain(esk14_0,esk13_0,esk15_0),member_type(power_set(esk14_0)))), inference(etableau_closure_rule, [i_0_266, ...])).
% 0.19/0.38 # End printing tableau
% 0.19/0.38 # SZS output end
% 0.19/0.38 # Branches closed with saturation will be marked with an "s"
% 0.19/0.38 # Child (13737) has found a proof.
% 0.19/0.38
% 0.19/0.39 # Proof search is over...
% 0.19/0.39 # Freeing feature tree
%------------------------------------------------------------------------------