TSTP Solution File: SEU144+2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU144+2 : TPTP v8.1.0. Released v3.3.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 : n016.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 09:24:08 EDT 2022
% Result : Theorem 0.21s 0.42s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.14 % Problem : SEU144+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.14/0.36 % Computer : n016.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Sun Jun 19 17:27:09 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.21/0.40 # No SInE strategy applied
% 0.21/0.40 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 0.21/0.40 # and selection function SelectCQArNTNpEqFirst.
% 0.21/0.40 #
% 0.21/0.40 # Presaturation interreduction done
% 0.21/0.40 # Number of axioms: 96 Number of unprocessed: 86
% 0.21/0.40 # Tableaux proof search.
% 0.21/0.40 # APR header successfully linked.
% 0.21/0.40 # Hello from C++
% 0.21/0.40 # The folding up rule is enabled...
% 0.21/0.40 # Local unification is enabled...
% 0.21/0.40 # Any saturation attempts will use folding labels...
% 0.21/0.40 # 86 beginning clauses after preprocessing and clausification
% 0.21/0.40 # Creating start rules for all 2 conjectures.
% 0.21/0.40 # There are 2 start rule candidates:
% 0.21/0.40 # Found 22 unit axioms.
% 0.21/0.40 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.21/0.40 # 2 start rule tableaux created.
% 0.21/0.40 # 64 extension rule candidate clauses
% 0.21/0.40 # 22 unit axiom clauses
% 0.21/0.40
% 0.21/0.40 # Requested 8, 32 cores available to the main process.
% 0.21/0.40 # There are not enough tableaux to fork, creating more from the initial 2
% 0.21/0.40 # Returning from population with 18 new_tableaux and 0 remaining starting tableaux.
% 0.21/0.40 # We now have 18 tableaux to operate on
% 0.21/0.42 # There were 2 total branch saturation attempts.
% 0.21/0.42 # There were 0 of these attempts blocked.
% 0.21/0.42 # There were 0 deferred branch saturation attempts.
% 0.21/0.42 # There were 0 free duplicated saturations.
% 0.21/0.42 # There were 2 total successful branch saturations.
% 0.21/0.42 # There were 0 successful branch saturations in interreduction.
% 0.21/0.42 # There were 0 successful branch saturations on the branch.
% 0.21/0.42 # There were 2 successful branch saturations after the branch.
% 0.21/0.42 # There were 2 total branch saturation attempts.
% 0.21/0.42 # There were 0 of these attempts blocked.
% 0.21/0.42 # There were 0 deferred branch saturation attempts.
% 0.21/0.42 # There were 0 free duplicated saturations.
% 0.21/0.42 # There were 2 total successful branch saturations.
% 0.21/0.42 # There were 0 successful branch saturations in interreduction.
% 0.21/0.42 # There were 0 successful branch saturations on the branch.
% 0.21/0.42 # There were 2 successful branch saturations after the branch.
% 0.21/0.42 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.42 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.42 # Begin clausification derivation
% 0.21/0.42
% 0.21/0.42 # End clausification derivation
% 0.21/0.42 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.42 cnf(i_0_53, plain, (empty(empty_set))).
% 0.21/0.42 cnf(i_0_64, plain, (empty(esk10_0))).
% 0.21/0.42 cnf(i_0_78, lemma, (subset(empty_set,X1))).
% 0.21/0.42 cnf(i_0_66, plain, (subset(X1,X1))).
% 0.21/0.42 cnf(i_0_92, plain, (set_difference(empty_set,X1)=empty_set)).
% 0.21/0.42 cnf(i_0_71, plain, (set_union2(X1,empty_set)=X1)).
% 0.21/0.42 cnf(i_0_84, plain, (set_difference(X1,empty_set)=X1)).
% 0.21/0.42 cnf(i_0_56, plain, (set_union2(X1,X1)=X1)).
% 0.21/0.42 cnf(i_0_100, lemma, (subset(X1,set_union2(X1,X2)))).
% 0.21/0.42 cnf(i_0_80, lemma, (subset(set_difference(X1,X2),X1))).
% 0.21/0.42 cnf(i_0_75, plain, (set_difference(X1,X1)=empty_set)).
% 0.21/0.42 cnf(i_0_18, plain, (in(X1,unordered_pair(X2,X1)))).
% 0.21/0.42 cnf(i_0_19, plain, (in(X1,unordered_pair(X1,X2)))).
% 0.21/0.42 cnf(i_0_83, lemma, (set_union2(X1,set_difference(X2,X1))=set_union2(X1,X2))).
% 0.21/0.42 cnf(i_0_89, lemma, (set_difference(set_union2(X1,X2),X2)=set_difference(X1,X2))).
% 0.21/0.42 cnf(i_0_3, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
% 0.21/0.42 cnf(i_0_4, plain, (set_union2(X1,X2)=set_union2(X2,X1))).
% 0.21/0.42 cnf(i_0_5, plain, (set_difference(X1,set_difference(X1,X2))=set_difference(X2,set_difference(X2,X1)))).
% 0.21/0.42 cnf(i_0_65, plain, (~empty(esk11_0))).
% 0.21/0.42 cnf(i_0_59, lemma, (unordered_pair(X1,X1)!=empty_set)).
% 0.21/0.42 cnf(i_0_58, plain, (~proper_subset(X1,X1))).
% 0.21/0.42 cnf(i_0_14, plain, (~in(X1,empty_set))).
% 0.21/0.42 cnf(i_0_61, negated_conjecture, (~subset(unordered_pair(esk8_0,esk8_0),esk9_0)|~in(esk8_0,esk9_0))).
% 0.21/0.42 cnf(i_0_60, negated_conjecture, (subset(unordered_pair(esk8_0,esk8_0),esk9_0)|in(esk8_0,esk9_0))).
% 0.21/0.42 cnf(i_0_99, plain, (~empty(X1)|~in(X2,X1))).
% 0.21/0.42 cnf(i_0_98, plain, (X1=empty_set|~empty(X1))).
% 0.21/0.42 cnf(i_0_88, lemma, (X1=empty_set|~subset(X1,empty_set))).
% 0.21/0.42 cnf(i_0_95, lemma, (~subset(X1,X2)|~proper_subset(X2,X1))).
% 0.21/0.42 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 0.21/0.42 cnf(i_0_2, plain, (~proper_subset(X1,X2)|~proper_subset(X2,X1))).
% 0.21/0.42 cnf(i_0_46, plain, (subset(X1,X2)|~proper_subset(X1,X2))).
% 0.21/0.42 cnf(i_0_63, lemma, (subset(X1,X2)|set_difference(X1,X2)!=empty_set)).
% 0.21/0.42 cnf(i_0_103, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 0.21/0.42 cnf(i_0_85, lemma, (~disjoint(X1,X2)|~in(X3,X2)|~in(X3,X1))).
% 0.21/0.42 cnf(i_0_55, plain, (empty(X1)|~empty(set_union2(X2,X1)))).
% 0.21/0.42 cnf(i_0_54, plain, (empty(X1)|~empty(set_union2(X1,X2)))).
% 0.21/0.42 cnf(i_0_93, lemma, (~disjoint(X1,X2)|~in(X3,set_difference(X1,set_difference(X1,X2))))).
% 0.21/0.42 cnf(i_0_29, plain, (in(X1,X2)|~subset(X3,X2)|~in(X1,X3))).
% 0.21/0.42 cnf(i_0_62, lemma, (set_difference(X1,X2)=empty_set|~subset(X1,X2))).
% 0.21/0.42 cnf(i_0_13, plain, (X1=empty_set|in(esk2_1(X1),X1))).
% 0.21/0.42 cnf(i_0_68, lemma, (set_union2(X1,X2)=X2|~subset(X1,X2))).
% 0.21/0.42 cnf(i_0_102, lemma, (set_difference(X1,X2)=X1|~disjoint(X1,X2))).
% 0.21/0.42 cnf(i_0_101, lemma, (disjoint(X1,X2)|set_difference(X1,X2)!=X1)).
% 0.21/0.42 cnf(i_0_67, plain, (disjoint(X1,X2)|~disjoint(X2,X1))).
% 0.21/0.42 cnf(i_0_27, plain, (subset(X1,X2)|~in(esk5_2(X1,X2),X2))).
% 0.21/0.42 cnf(i_0_12, plain, (X1=X2|~in(X1,unordered_pair(X2,X2)))).
% 0.21/0.42 cnf(i_0_6, plain, (X1=X2|~subset(X2,X1)|~subset(X1,X2))).
% 0.21/0.42 cnf(i_0_40, plain, (~in(X1,set_difference(X2,X3))|~in(X1,X3))).
% 0.21/0.42 cnf(i_0_42, plain, (disjoint(X1,X2)|set_difference(X1,set_difference(X1,X2))!=empty_set)).
% 0.21/0.42 cnf(i_0_28, plain, (subset(X1,X2)|in(esk5_2(X1,X2),X1))).
% 0.21/0.42 cnf(i_0_44, plain, (X1=X2|proper_subset(X1,X2)|~subset(X1,X2))).
% 0.21/0.42 cnf(i_0_86, lemma, (disjoint(X1,X2)|in(esk13_2(X1,X2),X2))).
% 0.21/0.42 cnf(i_0_96, lemma, (disjoint(X1,X2)|~disjoint(X3,X2)|~subset(X1,X3))).
% 0.21/0.42 cnf(i_0_74, lemma, (set_difference(X1,set_difference(X1,X2))=X1|~subset(X1,X2))).
% 0.21/0.42 cnf(i_0_43, plain, (set_difference(X1,set_difference(X1,X2))=empty_set|~disjoint(X1,X2))).
% 0.21/0.42 cnf(i_0_87, lemma, (disjoint(X1,X2)|in(esk13_2(X1,X2),X1))).
% 0.21/0.42 cnf(i_0_72, lemma, (subset(X1,X2)|~subset(X3,X2)|~subset(X1,X3))).
% 0.21/0.42 cnf(i_0_24, plain, (in(X1,set_union2(X2,X3))|~in(X1,X3))).
% 0.21/0.42 cnf(i_0_25, plain, (in(X1,set_union2(X2,X3))|~in(X1,X2))).
% 0.21/0.42 cnf(i_0_41, plain, (in(X1,X2)|~in(X1,set_difference(X2,X3)))).
% 0.21/0.42 cnf(i_0_20, plain, (X1=X2|X1=X3|~in(X1,unordered_pair(X3,X2)))).
% 0.21/0.42 cnf(i_0_104, lemma, (subset(set_union2(X1,X2),X3)|~subset(X2,X3)|~subset(X1,X3))).
% 0.21/0.42 cnf(i_0_34, plain, (in(X1,X2)|~in(X1,set_difference(X3,set_difference(X3,X2))))).
% 0.21/0.42 cnf(i_0_79, lemma, (subset(set_difference(X1,X2),set_difference(X3,X2))|~subset(X1,X3))).
% 0.21/0.42 cnf(i_0_77, plain, (X1=X2|~in(esk12_2(X1,X2),X2)|~in(esk12_2(X1,X2),X1))).
% 0.21/0.42 cnf(i_0_10, plain, (X1=unordered_pair(X2,X2)|esk1_2(X2,X1)!=X2|~in(esk1_2(X2,X1),X1))).
% 0.21/0.42 cnf(i_0_94, lemma, (disjoint(X1,X2)|in(esk14_2(X1,X2),set_difference(X1,set_difference(X1,X2))))).
% 0.21/0.42 cnf(i_0_39, plain, (in(X1,set_difference(X2,X3))|in(X1,X3)|~in(X1,X2))).
% 0.21/0.42 cnf(i_0_26, plain, (in(X1,X2)|in(X1,X3)|~in(X1,set_union2(X3,X2)))).
% 0.21/0.42 cnf(i_0_9, plain, (esk1_2(X1,X2)=X1|X2=unordered_pair(X1,X1)|in(esk1_2(X1,X2),X2))).
% 0.21/0.42 cnf(i_0_16, plain, (X1=unordered_pair(X2,X3)|esk3_3(X2,X3,X1)!=X3|~in(esk3_3(X2,X3,X1),X1))).
% 0.21/0.42 cnf(i_0_17, plain, (X1=unordered_pair(X2,X3)|esk3_3(X2,X3,X1)!=X2|~in(esk3_3(X2,X3,X1),X1))).
% 0.21/0.42 cnf(i_0_22, plain, (X1=set_union2(X2,X3)|~in(esk4_3(X2,X3,X1),X1)|~in(esk4_3(X2,X3,X1),X3))).
% 0.21/0.42 cnf(i_0_70, lemma, (subset(X1,set_difference(X2,set_difference(X2,X3)))|~subset(X1,X3)|~subset(X1,X2))).
% 0.21/0.42 cnf(i_0_33, plain, (in(X1,set_difference(X2,set_difference(X2,X3)))|~in(X1,X3)|~in(X1,X2))).
% 0.21/0.42 cnf(i_0_23, plain, (X1=set_union2(X2,X3)|~in(esk4_3(X2,X3,X1),X1)|~in(esk4_3(X2,X3,X1),X2))).
% 0.21/0.42 cnf(i_0_76, plain, (X1=X2|in(esk12_2(X1,X2),X1)|in(esk12_2(X1,X2),X2))).
% 0.21/0.42 cnf(i_0_73, lemma, (subset(set_difference(X1,set_difference(X1,X2)),set_difference(X3,set_difference(X3,X2)))|~subset(X1,X3))).
% 0.21/0.42 cnf(i_0_15, plain, (esk3_3(X1,X2,X3)=X1|esk3_3(X1,X2,X3)=X2|X3=unordered_pair(X1,X2)|in(esk3_3(X1,X2,X3),X3))).
% 0.21/0.42 cnf(i_0_37, plain, (X1=set_difference(X2,X3)|in(esk7_3(X2,X3,X1),X2)|in(esk7_3(X2,X3,X1),X1))).
% 0.21/0.42 cnf(i_0_36, plain, (X1=set_difference(X2,X3)|in(esk7_3(X2,X3,X1),X1)|~in(esk7_3(X2,X3,X1),X3))).
% 0.21/0.42 cnf(i_0_32, plain, (X1=set_difference(X2,set_difference(X2,X3))|~in(esk6_3(X2,X3,X1),X1)|~in(esk6_3(X2,X3,X1),X3)|~in(esk6_3(X2,X3,X1),X2))).
% 0.21/0.42 cnf(i_0_38, plain, (X1=set_difference(X2,X3)|in(esk7_3(X2,X3,X1),X3)|~in(esk7_3(X2,X3,X1),X1)|~in(esk7_3(X2,X3,X1),X2))).
% 0.21/0.42 cnf(i_0_30, plain, (X1=set_difference(X2,set_difference(X2,X3))|in(esk6_3(X2,X3,X1),X3)|in(esk6_3(X2,X3,X1),X1))).
% 0.21/0.42 cnf(i_0_31, plain, (X1=set_difference(X2,set_difference(X2,X3))|in(esk6_3(X2,X3,X1),X2)|in(esk6_3(X2,X3,X1),X1))).
% 0.21/0.42 cnf(i_0_21, plain, (X1=set_union2(X2,X3)|in(esk4_3(X2,X3,X1),X2)|in(esk4_3(X2,X3,X1),X3)|in(esk4_3(X2,X3,X1),X1))).
% 0.21/0.42 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.42 # Begin printing tableau
% 0.21/0.42 # Found 6 steps
% 0.21/0.42 cnf(i_0_60, negated_conjecture, (subset(unordered_pair(esk8_0,esk8_0),esk9_0)|in(esk8_0,esk9_0)), inference(start_rule)).
% 0.21/0.42 cnf(i_0_126, plain, (subset(unordered_pair(esk8_0,esk8_0),esk9_0)), inference(extension_rule, [i_0_70])).
% 0.21/0.42 cnf(i_0_246, plain, (~subset(unordered_pair(esk8_0,esk8_0),unordered_pair(esk8_0,esk8_0))), inference(closure_rule, [i_0_66])).
% 0.21/0.42 cnf(i_0_245, plain, (subset(unordered_pair(esk8_0,esk8_0),set_difference(esk9_0,set_difference(esk9_0,unordered_pair(esk8_0,esk8_0))))), inference(extension_rule, [i_0_95])).
% 0.21/0.42 cnf(i_0_127, plain, (in(esk8_0,esk9_0)), inference(etableau_closure_rule, [i_0_127, ...])).
% 0.21/0.42 cnf(i_0_298, plain, (~proper_subset(set_difference(esk9_0,set_difference(esk9_0,unordered_pair(esk8_0,esk8_0))),unordered_pair(esk8_0,esk8_0))), inference(etableau_closure_rule, [i_0_298, ...])).
% 0.21/0.42 # End printing tableau
% 0.21/0.42 # SZS output end
% 0.21/0.42 # Branches closed with saturation will be marked with an "s"
% 0.21/0.42 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.42 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.42 # Begin clausification derivation
% 0.21/0.42
% 0.21/0.42 # End clausification derivation
% 0.21/0.42 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.42 cnf(i_0_53, plain, (empty(empty_set))).
% 0.21/0.42 cnf(i_0_64, plain, (empty(esk10_0))).
% 0.21/0.42 cnf(i_0_78, lemma, (subset(empty_set,X1))).
% 0.21/0.42 cnf(i_0_66, plain, (subset(X1,X1))).
% 0.21/0.42 cnf(i_0_92, plain, (set_difference(empty_set,X1)=empty_set)).
% 0.21/0.42 cnf(i_0_71, plain, (set_union2(X1,empty_set)=X1)).
% 0.21/0.42 cnf(i_0_84, plain, (set_difference(X1,empty_set)=X1)).
% 0.21/0.42 cnf(i_0_56, plain, (set_union2(X1,X1)=X1)).
% 0.21/0.42 cnf(i_0_100, lemma, (subset(X1,set_union2(X1,X2)))).
% 0.21/0.42 cnf(i_0_80, lemma, (subset(set_difference(X1,X2),X1))).
% 0.21/0.42 cnf(i_0_75, plain, (set_difference(X1,X1)=empty_set)).
% 0.21/0.42 cnf(i_0_18, plain, (in(X1,unordered_pair(X2,X1)))).
% 0.21/0.42 cnf(i_0_19, plain, (in(X1,unordered_pair(X1,X2)))).
% 0.21/0.42 cnf(i_0_83, lemma, (set_union2(X1,set_difference(X2,X1))=set_union2(X1,X2))).
% 0.21/0.42 cnf(i_0_89, lemma, (set_difference(set_union2(X1,X2),X2)=set_difference(X1,X2))).
% 0.21/0.42 cnf(i_0_3, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
% 0.21/0.42 cnf(i_0_4, plain, (set_union2(X1,X2)=set_union2(X2,X1))).
% 0.21/0.42 cnf(i_0_5, plain, (set_difference(X1,set_difference(X1,X2))=set_difference(X2,set_difference(X2,X1)))).
% 0.21/0.42 cnf(i_0_65, plain, (~empty(esk11_0))).
% 0.21/0.42 cnf(i_0_59, lemma, (unordered_pair(X1,X1)!=empty_set)).
% 0.21/0.42 cnf(i_0_58, plain, (~proper_subset(X1,X1))).
% 0.21/0.42 cnf(i_0_14, plain, (~in(X1,empty_set))).
% 0.21/0.42 cnf(i_0_61, negated_conjecture, (~subset(unordered_pair(esk8_0,esk8_0),esk9_0)|~in(esk8_0,esk9_0))).
% 0.21/0.42 cnf(i_0_60, negated_conjecture, (subset(unordered_pair(esk8_0,esk8_0),esk9_0)|in(esk8_0,esk9_0))).
% 0.21/0.42 cnf(i_0_99, plain, (~empty(X1)|~in(X2,X1))).
% 0.21/0.42 cnf(i_0_98, plain, (X1=empty_set|~empty(X1))).
% 0.21/0.42 cnf(i_0_88, lemma, (X1=empty_set|~subset(X1,empty_set))).
% 0.21/0.42 cnf(i_0_95, lemma, (~subset(X1,X2)|~proper_subset(X2,X1))).
% 0.21/0.42 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 0.21/0.42 cnf(i_0_2, plain, (~proper_subset(X1,X2)|~proper_subset(X2,X1))).
% 0.21/0.42 cnf(i_0_46, plain, (subset(X1,X2)|~proper_subset(X1,X2))).
% 0.21/0.42 cnf(i_0_63, lemma, (subset(X1,X2)|set_difference(X1,X2)!=empty_set)).
% 0.21/0.42 cnf(i_0_103, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 0.21/0.42 cnf(i_0_85, lemma, (~disjoint(X1,X2)|~in(X3,X2)|~in(X3,X1))).
% 0.21/0.42 cnf(i_0_55, plain, (empty(X1)|~empty(set_union2(X2,X1)))).
% 0.21/0.42 cnf(i_0_54, plain, (empty(X1)|~empty(set_union2(X1,X2)))).
% 0.21/0.42 cnf(i_0_93, lemma, (~disjoint(X1,X2)|~in(X3,set_difference(X1,set_difference(X1,X2))))).
% 0.21/0.42 cnf(i_0_29, plain, (in(X1,X2)|~subset(X3,X2)|~in(X1,X3))).
% 0.21/0.42 cnf(i_0_62, lemma, (set_difference(X1,X2)=empty_set|~subset(X1,X2))).
% 0.21/0.42 cnf(i_0_13, plain, (X1=empty_set|in(esk2_1(X1),X1))).
% 0.21/0.42 cnf(i_0_68, lemma, (set_union2(X1,X2)=X2|~subset(X1,X2))).
% 0.21/0.42 cnf(i_0_102, lemma, (set_difference(X1,X2)=X1|~disjoint(X1,X2))).
% 0.21/0.42 cnf(i_0_101, lemma, (disjoint(X1,X2)|set_difference(X1,X2)!=X1)).
% 0.21/0.42 cnf(i_0_67, plain, (disjoint(X1,X2)|~disjoint(X2,X1))).
% 0.21/0.42 cnf(i_0_27, plain, (subset(X1,X2)|~in(esk5_2(X1,X2),X2))).
% 0.21/0.42 cnf(i_0_12, plain, (X1=X2|~in(X1,unordered_pair(X2,X2)))).
% 0.21/0.42 cnf(i_0_6, plain, (X1=X2|~subset(X2,X1)|~subset(X1,X2))).
% 0.21/0.42 cnf(i_0_40, plain, (~in(X1,set_difference(X2,X3))|~in(X1,X3))).
% 0.21/0.42 cnf(i_0_42, plain, (disjoint(X1,X2)|set_difference(X1,set_difference(X1,X2))!=empty_set)).
% 0.21/0.42 cnf(i_0_28, plain, (subset(X1,X2)|in(esk5_2(X1,X2),X1))).
% 0.21/0.42 cnf(i_0_44, plain, (X1=X2|proper_subset(X1,X2)|~subset(X1,X2))).
% 0.21/0.42 cnf(i_0_86, lemma, (disjoint(X1,X2)|in(esk13_2(X1,X2),X2))).
% 0.21/0.42 cnf(i_0_96, lemma, (disjoint(X1,X2)|~disjoint(X3,X2)|~subset(X1,X3))).
% 0.21/0.42 cnf(i_0_74, lemma, (set_difference(X1,set_difference(X1,X2))=X1|~subset(X1,X2))).
% 0.21/0.42 cnf(i_0_43, plain, (set_difference(X1,set_difference(X1,X2))=empty_set|~disjoint(X1,X2))).
% 0.21/0.42 cnf(i_0_87, lemma, (disjoint(X1,X2)|in(esk13_2(X1,X2),X1))).
% 0.21/0.42 cnf(i_0_72, lemma, (subset(X1,X2)|~subset(X3,X2)|~subset(X1,X3))).
% 0.21/0.42 cnf(i_0_24, plain, (in(X1,set_union2(X2,X3))|~in(X1,X3))).
% 0.21/0.42 cnf(i_0_25, plain, (in(X1,set_union2(X2,X3))|~in(X1,X2))).
% 0.21/0.42 cnf(i_0_41, plain, (in(X1,X2)|~in(X1,set_difference(X2,X3)))).
% 0.21/0.42 cnf(i_0_20, plain, (X1=X2|X1=X3|~in(X1,unordered_pair(X3,X2)))).
% 0.21/0.42 cnf(i_0_104, lemma, (subset(set_union2(X1,X2),X3)|~subset(X2,X3)|~subse# Child (12121) has found a proof.
% 0.21/0.42
% 0.21/0.42 # Proof search is over...
% 0.21/0.42 # Freeing feature tree
%------------------------------------------------------------------------------