TSTP Solution File: SEU344+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU344+1 : 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 : n028.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:26:02 EDT 2022
% Result : Theorem 0.18s 0.41s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SEU344+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.33 % Computer : n028.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 : Mon Jun 20 11:30:16 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.36 # No SInE strategy applied
% 0.12/0.36 # Auto-Mode selected heuristic G_E___301_C18_F1_URBAN_S5PRR_RG_S0Y
% 0.12/0.36 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.12/0.36 #
% 0.12/0.36 # Number of axioms: 91 Number of unprocessed: 91
% 0.12/0.36 # Tableaux proof search.
% 0.12/0.36 # APR header successfully linked.
% 0.12/0.36 # Hello from C++
% 0.12/0.37 # The folding up rule is enabled...
% 0.12/0.37 # Local unification is enabled...
% 0.12/0.37 # Any saturation attempts will use folding labels...
% 0.12/0.37 # 91 beginning clauses after preprocessing and clausification
% 0.12/0.37 # Creating start rules for all 4 conjectures.
% 0.12/0.37 # There are 4 start rule candidates:
% 0.12/0.37 # Found 37 unit axioms.
% 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.37 # 4 start rule tableaux created.
% 0.12/0.37 # 54 extension rule candidate clauses
% 0.12/0.37 # 37 unit axiom clauses
% 0.12/0.37
% 0.12/0.37 # Requested 8, 32 cores available to the main process.
% 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 4
% 0.12/0.37 # Returning from population with 27 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.37 # We now have 27 tableaux to operate on
% 0.18/0.40 # Creating equality axioms
% 0.18/0.40 # Ran out of tableaux, making start rules for all clauses
% 0.18/0.40 # Creating equality axioms
% 0.18/0.40 # Ran out of tableaux, making start rules for all clauses
% 0.18/0.41 # There were 2 total branch saturation attempts.
% 0.18/0.41 # There were 0 of these attempts blocked.
% 0.18/0.41 # There were 0 deferred branch saturation attempts.
% 0.18/0.41 # There were 0 free duplicated saturations.
% 0.18/0.41 # There were 2 total successful branch saturations.
% 0.18/0.41 # There were 0 successful branch saturations in interreduction.
% 0.18/0.41 # There were 0 successful branch saturations on the branch.
% 0.18/0.41 # There were 2 successful branch saturations after the branch.
% 0.18/0.41 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.41 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.41 # Begin clausification derivation
% 0.18/0.41
% 0.18/0.41 # End clausification derivation
% 0.18/0.41 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.41 cnf(i_0_48, plain, (latt_str(esk4_0))).
% 0.18/0.41 cnf(i_0_76, plain, (latt_str(esk12_0))).
% 0.18/0.41 cnf(i_0_83, plain, (latt_str(esk15_0))).
% 0.18/0.41 cnf(i_0_75, plain, (strict_latt_str(esk12_0))).
% 0.18/0.41 cnf(i_0_81, plain, (strict_latt_str(esk15_0))).
% 0.18/0.41 cnf(i_0_47, plain, (join_semilatt_str(esk3_0))).
% 0.18/0.41 cnf(i_0_45, plain, (meet_semilatt_str(esk1_0))).
% 0.18/0.41 cnf(i_0_56, plain, (empty(empty_set))).
% 0.18/0.41 cnf(i_0_71, plain, (empty(esk9_0))).
% 0.18/0.41 cnf(i_0_46, plain, (one_sorted_str(esk2_0))).
% 0.18/0.41 cnf(i_0_78, plain, (one_sorted_str(esk13_0))).
% 0.18/0.41 cnf(i_0_77, plain, (~empty_carrier(esk13_0))).
% 0.18/0.41 cnf(i_0_82, plain, (~empty_carrier(esk15_0))).
% 0.18/0.41 cnf(i_0_74, plain, (~empty(esk11_0))).
% 0.18/0.41 cnf(i_0_103, plain, (X1=empty_set|~empty(X1))).
% 0.18/0.41 cnf(i_0_17, plain, (latt_str(boole_lattice(X1)))).
% 0.18/0.41 cnf(i_0_18, plain, (strict_latt_str(boole_lattice(X1)))).
% 0.18/0.41 cnf(i_0_52, plain, (strict_latt_str(boole_lattice(X1)))).
% 0.18/0.41 cnf(i_0_72, plain, (empty(esk10_1(X1)))).
% 0.18/0.41 cnf(i_0_33, plain, (join_semilatt_str(X1)|~latt_str(X1))).
% 0.18/0.41 cnf(i_0_34, plain, (meet_semilatt_str(X1)|~latt_str(X1))).
% 0.18/0.41 cnf(i_0_32, plain, (one_sorted_str(X1)|~join_semilatt_str(X1))).
% 0.18/0.41 cnf(i_0_30, plain, (one_sorted_str(X1)|~meet_semilatt_str(X1))).
% 0.18/0.41 cnf(i_0_93, plain, (set_intersection2(X1,empty_set)=empty_set)).
% 0.18/0.41 cnf(i_0_89, plain, (set_union2(X1,empty_set)=X1)).
% 0.18/0.41 cnf(i_0_87, plain, (subset(X1,X1))).
% 0.18/0.41 cnf(i_0_67, plain, (set_union2(X1,X1)=X1)).
% 0.18/0.41 cnf(i_0_68, plain, (set_intersection2(X1,X1)=X1)).
% 0.18/0.41 cnf(i_0_106, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 0.18/0.41 cnf(i_0_53, plain, (~empty_carrier(boole_lattice(X1)))).
% 0.18/0.41 cnf(i_0_55, plain, (~empty(powerset(X1)))).
% 0.18/0.41 cnf(i_0_57, plain, (~empty(singleton(X1)))).
% 0.18/0.41 cnf(i_0_44, plain, (function(the_L_join(X1))|~join_semilatt_str(X1))).
% 0.18/0.41 cnf(i_0_40, plain, (function(the_L_meet(X1))|~meet_semilatt_str(X1))).
% 0.18/0.41 cnf(i_0_50, plain, (element(esk6_1(X1),X1))).
% 0.18/0.41 cnf(i_0_69, plain, (empty(X1)|~empty(esk8_1(X1)))).
% 0.18/0.41 cnf(i_0_97, negated_conjecture, (element(esk17_0,the_carrier(boole_lattice(esk16_0))))).
% 0.18/0.41 cnf(i_0_96, negated_conjecture, (element(esk18_0,the_carrier(boole_lattice(esk16_0))))).
% 0.18/0.41 cnf(i_0_73, plain, (element(esk10_1(X1),powerset(X1)))).
% 0.18/0.41 cnf(i_0_4, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
% 0.18/0.41 cnf(i_0_5, plain, (set_union2(X1,X2)=set_union2(X2,X1))).
% 0.18/0.41 cnf(i_0_6, plain, (set_intersection2(X1,X2)=set_intersection2(X2,X1))).
% 0.18/0.41 cnf(i_0_54, plain, (empty_carrier(X1)|~one_sorted_str(X1)|~empty(the_carrier(X1)))).
% 0.18/0.41 cnf(i_0_79, plain, (empty_carrier(X1)|~one_sorted_str(X1)|~empty(esk14_1(X1)))).
% 0.18/0.41 cnf(i_0_104, plain, (~empty(X2)|~in(X1,X2))).
% 0.18/0.41 cnf(i_0_70, plain, (empty(X1)|element(esk8_1(X1),powerset(X1)))).
% 0.18/0.41 cnf(i_0_92, plain, (element(X1,X2)|~in(X1,X2))).
% 0.18/0.41 cnf(i_0_88, plain, (set_union2(X1,X2)=X2|~subset(X1,X2))).
% 0.18/0.41 cnf(i_0_105, plain, (subset(X1,set_union2(X1,X2)))).
% 0.18/0.41 cnf(i_0_98, plain, (empty(X2)|in(X1,X2)|~element(X1,X2))).
% 0.18/0.41 cnf(i_0_99, plain, (element(X1,powerset(X2))|~subset(X1,X2))).
% 0.18/0.41 cnf(i_0_2, plain, (~in(X2,X1)|~in(X1,X2))).
% 0.18/0.41 cnf(i_0_100, plain, (subset(X1,X2)|~element(X1,powerset(X2)))).
% 0.18/0.41 cnf(i_0_61, plain, (~empty(unordered_pair(X1,X2)))).
% 0.18/0.41 cnf(i_0_80, plain, (empty_carrier(X1)|element(esk14_1(X1),powerset(the_carrier(X1)))|~one_sorted_str(X1))).
% 0.18/0.41 cnf(i_0_62, plain, (empty(X1)|~empty(set_union2(X2,X1)))).
% 0.18/0.41 cnf(i_0_58, plain, (empty(X1)|~empty(set_union2(X1,X2)))).
% 0.18/0.41 cnf(i_0_63, plain, (empty(X2)|empty(X1)|~empty(cartesian_product2(X1,X2)))).
% 0.18/0.41 cnf(i_0_102, plain, (~empty(X3)|~in(X1,X2)|~element(X2,powerset(X3)))).
% 0.18/0.41 cnf(i_0_94, negated_conjecture, (subset(esk17_0,esk18_0)|below(boole_lattice(esk16_0),esk17_0,esk18_0))).
% 0.18/0.41 cnf(i_0_101, plain, (element(X1,X3)|~in(X1,X2)|~element(X2,powerset(X3)))).
% 0.18/0.41 cnf(i_0_49, plain, (relation_of2(esk5_2(X1,X2),X1,X2))).
% 0.18/0.41 cnf(i_0_51, plain, (relation_of2_as_subset(esk7_2(X1,X2),X1,X2))).
% 0.18/0.41 cnf(i_0_1, plain, (latt_str_of(the_carrier(X1),the_L_join(X1),the_L_meet(X1))=X1|~latt_str(X1)|~strict_latt_str(X1))).
% 0.18/0.41 cnf(i_0_95, negated_conjecture, (~subset(esk17_0,esk18_0)|~below(boole_lattice(esk16_0),esk17_0,esk18_0))).
% 0.18/0.41 cnf(i_0_3, plain, (relation(X1)|~element(X1,powerset(cartesian_product2(X2,X3))))).
% 0.18/0.41 cnf(i_0_43, plain, (quasi_total(the_L_join(X1),cartesian_product2(the_carrier(X1),the_carrier(X1)),the_carrier(X1))|~join_semilatt_str(X1))).
% 0.18/0.41 cnf(i_0_39, plain, (quasi_total(the_L_meet(X1),cartesian_product2(the_carrier(X1),the_carrier(X1)),the_carrier(X1))|~meet_semilatt_str(X1))).
% 0.18/0.41 cnf(i_0_42, plain, (relation_of2_as_subset(the_L_join(X1),cartesian_product2(the_carrier(X1),the_carrier(X1)),the_carrier(X1))|~join_semilatt_str(X1))).
% 0.18/0.41 cnf(i_0_38, plain, (relation_of2_as_subset(the_L_meet(X1),cartesian_product2(the_carrier(X1),the_carrier(X1)),the_carrier(X1))|~meet_semilatt_str(X1))).
% 0.18/0.41 cnf(i_0_86, plain, (relation_of2(X1,X2,X3)|~relation_of2_as_subset(X1,X2,X3))).
% 0.18/0.41 cnf(i_0_85, plain, (relation_of2_as_subset(X1,X2,X3)|~relation_of2(X1,X2,X3))).
% 0.18/0.41 cnf(i_0_37, plain, (element(X1,powerset(cartesian_product2(X2,X3)))|~relation_of2_as_subset(X1,X2,X3))).
% 0.18/0.41 cnf(i_0_7, plain, (apply(X1,unordered_pair(unordered_pair(X2,X3),singleton(X2)))=apply_binary(X1,X2,X3)|~relation(X1)|~function(X1))).
% 0.18/0.41 cnf(i_0_91, plain, (join(boole_lattice(X1),X2,X3)=set_union2(X2,X3)|~element(X3,the_carrier(boole_lattice(X1)))|~element(X2,the_carrier(boole_lattice(X1))))).
% 0.18/0.41 cnf(i_0_90, plain, (meet(boole_lattice(X1),X2,X3)=set_intersection2(X2,X3)|~element(X3,the_carrier(boole_lattice(X1)))|~element(X2,the_carrier(boole_lattice(X1))))).
% 0.18/0.41 cnf(i_0_19, plain, (empty_carrier(X1)|element(join(X1,X2,X3),the_carrier(X1))|~join_semilatt_str(X1)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1)))).
% 0.18/0.41 cnf(i_0_24, plain, (empty_carrier(X1)|element(meet(X1,X2,X3),the_carrier(X1))|~meet_semilatt_str(X1)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1)))).
% 0.18/0.41 cnf(i_0_11, plain, (join(X1,X2,X3)=X3|empty_carrier(X1)|~join_semilatt_str(X1)|~below(X1,X2,X3)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1)))).
% 0.18/0.41 cnf(i_0_10, plain, (empty_carrier(X1)|below(X1,X2,X3)|join(X1,X2,X3)!=X3|~join_semilatt_str(X1)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1)))).
% 0.18/0.41 cnf(i_0_13, plain, (latt_str(latt_str_of(X1,X2,X3))|~function(X3)|~function(X2)|~quasi_total(X3,cartesian_product2(X1,X1),X1)|~quasi_total(X2,cartesian_product2(X1,X1),X1)|~relation_of2(X3,cartesian_product2(X1,X1),X1)|~relation_of2(X2,cartesian_product2(X1,X1),X1))).
% 0.18/0.41 cnf(i_0_14, plain, (strict_latt_str(latt_str_of(X1,X2,X3))|~function(X3)|~function(X2)|~quasi_total(X3,cartesian_product2(X1,X1),X1)|~quasi_total(X2,cartesian_product2(X1,X1),X1)|~relation_of2(X3,cartesian_product2(X1,X1),X1)|~relation_of2(X2,cartesian_product2(X1,X1),X1))).
% 0.18/0.41 cnf(i_0_59, plain, (empty(X1)|strict_latt_str(latt_str_of(X1,X2,X3))|~function(X3)|~function(X2)|~quasi_total(X3,cartesian_product2(X1,X1),X1)|~quasi_total(X2,cartesian_product2(X1,X1),X1)|~relation_of2(X3,cartesian_product2(X1,X1),X1)|~relation_of2(X2,cartesian_product2(X1,X1),X1))).
% 0.18/0.41 cnf(i_0_64, plain, (X1=X2|latt_str_of(X3,X4,X1)!=latt_str_of(X5,X6,X2)|~function(X4)|~function(X1)|~quasi_total(X4,cartesian_product2(X3,X3),X3)|~quasi_total(X1,cartesian_product2(X3,X3),X3)|~relation_of2(X4,cartesian_product2(X3,X3),X3)|~relation_of2(X1,cartesian_product2(X3,X3),X3))).
% 0.18/0.41 cnf(i_0_65, plain, (X1=X2|latt_str_of(X3,X1,X4)!=latt_str_of(X5,X2,X6)|~function(X4)|~function(X1)|~quasi_total(X4,cartesian_product2(X3,X3),X3)|~quasi_total(X1,cartesian_product2(X3,X3),X3)|~relation_of2(X4,cartesian_product2(X3,X3),X3)|~relation_of2(X1,cartesian_product2(X3,X3),X3))).
% 0.18/0.41 cnf(i_0_66, plain, (X1=X2|latt_str_of(X1,X3,X4)!=latt_str_of(X2,X5,X6)|~function(X4)|~function(X3)|~quasi_total(X4,cartesian_product2(X1,X1),X1)|~quasi_total(X3,cartesian_product2(X1,X1),X1)|~relation_of2(X4,cartesian_product2(X1,X1),X1)|~relation_of2(X3,cartesian_product2(X1,X1),X1))).
% 0.18/0.41 cnf(i_0_60, plain, (empty(X1)|~function(X3)|~function(X2)|~empty_carrier(latt_str_of(X1,X2,X3))|~quasi_total(X3,cartesian_product2(X1,X1),X1)|~quasi_total(X2,cartesian_product2(X1,X1),X1)|~relation_of2(X3,cartesian_product2(X1,X1),X1)|~relation_of2(X2,cartesian_product2(X1,X1),X1))).
% 0.18/0.41 cnf(i_0_8, plain, (apply_binary_as_element(the_carrier(X1),the_carrier(X1),the_carrier(X1),the_L_join(X1),X2,X3)=join(X1,X2,X3)|empty_carrier(X1)|~join_semilatt_str(X1)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1)))).
% 0.18/0.41 cnf(i_0_9, plain, (apply_binary_as_element(the_carrier(X1),the_carrier(X1),the_carrier(X1),the_L_meet(X1),X2,X3)=meet(X1,X2,X3)|empty_carrier(X1)|~meet_semilatt_str(X1)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1)))).
% 0.18/0.41 cnf(i_0_84, plain, (apply_binary_as_element(X1,X2,X4,X3,X5,X6)=apply_binary(X3,X5,X6)|empty(X2)|empty(X1)|~function(X3)|~element(X6,X2)|~element(X5,X1)|~quasi_total(X3,cartesian_product2(X1,X2),X4)|~relation_of2(X3,cartesian_product2(X1,X2),X4))).
% 0.18/0.41 cnf(i_0_23, plain, (empty(X2)|empty(X1)|element(apply_binary_as_element(X1,X2,X4,X3,X5,X6),X4)|~function(X3)|~element(X6,X2)|~element(X5,X1)|~quasi_total(X3,cartesian_product2(X1,X2),X4)|~relation_of2(X3,cartesian_product2(X1,X2),X4))).
% 0.18/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.18/0.41 # Begin printing tableau
% 0.18/0.41 # Found 5 steps
% 0.18/0.41 cnf(i_0_97, negated_conjecture, (element(esk17_0,the_carrier(boole_lattice(esk16_0)))), inference(start_rule)).
% 0.18/0.41 cnf(i_0_112, plain, (element(esk17_0,the_carrier(boole_lattice(esk16_0)))), inference(extension_rule, [i_0_98])).
% 0.18/0.41 cnf(i_0_1106, plain, (empty(the_carrier(boole_lattice(esk16_0)))), inference(extension_rule, [i_0_103])).
% 0.18/0.41 cnf(i_0_1107, plain, (in(esk17_0,the_carrier(boole_lattice(esk16_0)))), inference(etableau_closure_rule, [i_0_1107, ...])).
% 0.18/0.41 cnf(i_0_1109, plain, (the_carrier(boole_lattice(esk16_0))=empty_set), inference(etableau_closure_rule, [i_0_1109, ...])).
% 0.18/0.41 # End printing tableau
% 0.18/0.41 # SZS output end
% 0.18/0.41 # Branches closed with saturation will be marked with an "s"
% 0.18/0.41 # There were 3 total branch saturation attempts.
% 0.18/0.41 # There were 0 of these attempts blocked.
% 0.18/0.41 # There were 0 deferred branch saturation attempts.
% 0.18/0.41 # There were 0 free duplicated saturations.
% 0.18/0.41 # There were 3 total successful branch saturations.
% 0.18/0.41 # There were 0 successful branch saturations in interreduction.
% 0.18/0.41 # There were 0 successful branch saturations on the branch.
% 0.18/0.41 # There were 3 successful branch saturations after the branch.
% 0.18/0.41 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.41 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.41 # Begin clausification derivation
% 0.18/0.41
% 0.18/0.41 # End clausification derivation
% 0.18/0.41 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.41 cnf(i_0_48, plain, (latt_str(esk4_0))).
% 0.18/0.41 cnf(i_0_76, plain, (latt_str(esk12_0))).
% 0.18/0.41 cnf(i_0_83, plain, (latt_str(esk15_0))).
% 0.18/0.41 cnf(i_0_75, plain, (strict_latt_str(esk12_0))).
% 0.18/0.41 cnf(i_0_81, plain, (strict_latt_str(esk15_0))).
% 0.18/0.41 cnf(i_0_47, plain, (join_semilatt_str(esk3_0))).
% 0.18/0.41 cnf(i_0_45, plain, (meet_semilatt_str(esk1_0))).
% 0.18/0.41 cnf(i_0_56, plain, (empty(empty_set))).
% 0.18/0.41 cnf(i_0_71, plain, (empty(esk9_0))).
% 0.18/0.41 cnf(i_0_46, plain, (one_sorted_str(esk2_0))).
% 0.18/0.41 cnf(i_0_78, plain, (one_sorted_str(esk13_0))).
% 0.18/0.41 cnf(i_0_77, plain, (~empty_carrier(esk13_0))).
% 0.18/0.41 cnf(i_0_82, plain, (~empty_carrier(esk15_0))).
% 0.18/0.41 cnf(i_0_74, plain, (~empty(esk11_0))).
% 0.18/0.41 cnf(i_0_103, plain, (X1=empty_set|~empty(X1))).
% 0.18/0.41 cnf(i_0_17, plain, (latt_str(boole_lattice(X1)))).
% 0.18/0.41 cnf(i_0_18, plain, (strict_latt_str(boole_lattice(X1)))).
% 0.18/0.41 cnf(i_0_52, plain, (strict_latt_str(boole_lattice(X1)))).
% 0.18/0.41 cnf(i_0_72, plain, (empty(esk10_1(X1)))).
% 0.18/0.41 cnf(i_0_33, plain, (join_semilatt_str(X1)|~latt_str(X1))).
% 0.18/0.41 cnf(i_0_34, plain, (meet_semilatt_str(X1)|~latt_str(X1))).
% 0.18/0.41 cnf(i_0_32, plain, (one_sorted_str(X1)|~join_semilatt_str(X1))).
% 0.18/0.41 cnf(i_0_30, plain, (one_sorted_str(X1)|~meet_semilatt_str(X1))).
% 0.18/0.41 cnf(i_0_93, plain, (set_intersection2(X1,empty_set)=empty_set)).
% 0.18/0.41 cnf(i_0_89, plain, (set_union2(X1,empty_set)=X1)).
% 0.18/0.41 cnf(i_0_87, plain, (subset(X1,X1))).
% 0.18/0.41 cnf(i_0_67, plain, (set_union2(X1,X1)=X1)).
% 0.18/0.41 cnf(i_0_68, plain, (set_intersection2(X1,X1)=X1)).
% 0.18/0.41 cnf(i_0_106, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 0.18/0.41 cnf(i_0_53, plain, (~empty_carrier(boole_lattice(X1)))).
% 0.18/0.41 cnf(i_0_55, plain, (~empty(powerset(X1)))).
% 0.18/0.41 cnf(i_0_57, plain, (~empty(singleton(X1)))).
% 0.18/0.41 cnf(i_0_44, plain, (function(the_L_join(X1))|~join_semilatt_str(X1))).
% 0.18/0.41 cnf(i_0_40, plain, (function(the_L_meet(X1))|~meet_semilatt_str(X1))).
% 0.18/0.41 cnf(i_0_50, plain, (element(esk6_1(X1),X1))).
% 0.18/0.41 cnf(i_0_69, plain, (empty(X1)|~empty(esk8_1(X1)))).
% 0.18/0.41 cnf(i_0_97, negated_conjecture, (element(esk17_0,the_carrier(boole_lattice(esk16_0))))).
% 0.18/0.41 cnf(i_0_96, negated_conjecture, (element(esk18_0,the_carrier(boole_lattice(esk16_0))))).
% 0.18/0.41 cnf(i_0_73, plain, (element(esk10_1(X1),powerset(X1)))).
% 0.18/0.41 cnf(i_0_4, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
% 0.18/0.41 cnf(i_0_5, plain, (set_union2(X1,X2)=set_union2(X2,X1))).
% 0.18/0.41 cnf(i_0_6, plain, (set_intersection2(X1,X2)=set_intersection2(X2,X1))).
% 0.18/0.41 cnf(i_0_54, plain, (empty_carrier(X1)|~one_sorted_str(X1)|~empty(the_carrier(X1)))).
% 0.18/0.41 cnf(i_0_79, plain, (empty_carrier(X1)|~one_sorted_str(X1)|~empty(esk14_1(X1)))).
% 0.18/0.41 cnf(i_0_104, plain, (~empty(X2)|~in(X1,X2))).
% 0.18/0.41 cnf(i_0_70, plain, (empty(X1)|element(esk8_1(X1),powerset(X1)))).
% 0.18/0.41 cnf(i_0_92, plain, (element(X1,X2)|~in(X1,X2))).
% 0.18/0.41 cnf(i_0_88, plain, (set_union2(X1,X2)=X2|~subset(X1,X2))).
% 0.18/0.41 cnf(i_0_105, plain, (subset(X1,set_union2(X1,X2)))).
% 0.18/0.41 cnf(i_0_98, plain, (empty(X2)|in(X1,X2)|~element(X1,X2))).
% 0.18/0.41 cnf(i_0_99, plain, (element(X1,powerset(X2))|~subset(X1,X2))).
% 0.18/0.41 cnf(i_0_2, plain, (~in(X2,X1)|~in(X1,X2))).
% 0.18/0.41 cnf(i_0_100, plain, (subset(X1,X2)|~element(X1,powerset(X2)))).
% 0.18/0.41 cnf(i_0_61, plain, (~empty(unordered_pair(X1,X2)))).
% 0.18/0.41 cnf(i_0_80, plain, (empty_carrier(X1)|element(esk14_1(X1),powerset(the_carrier(X1)))|~one_sorted_str(X1))).
% 0.18/0.41 cnf(i_0_62, plain, (empty(X1)|~empty(set_union2(X2,X1)))).
% 0.18/0.41 cnf(i_0_58, plain, (empty(X1)|~empty(set_union2(X1,X2)))).
% 0.18/0.41 cnf(i_0_63, plain, (empty(X2)|empty(X1)|~empty(cartesian_product2(X1,X2)))).
% 0.18/0.41 cnf(i_0_102, plain, (~empty(X3)|~in(X1,X2)|~element(X2,powerset(X3)))).
% 0.18/0.41 cnf(i_0_94, negated_conjecture, (subset(esk17_0,esk18_0)|below(boole_lattice(esk16_0),esk17_0,esk18_0))).
% 0.18/0.41 cnf(i_0_101, plain, (element(X1,X3)|~in(X1,X2)|~element(X2,powerset(X3)))).
% 0.18/0.41 cnf(i_0_49, plain, (relation_of2(esk5_2(X1,X2),X1,X2))).
% 0.18/0.41 cnf(i_0_51, plain, (relation_of2_as_subset(esk7_2(X1,X2),X1,X2))).
% 0.18/0.41 cnf(i_0_1, plain, (latt_str_of(the_carrier(X1),the_L_join(X1),the_L_meet(X1))=X1|~latt_str(X1)|~strict_latt_str(X1))).
% 0.18/0.41 cnf(i_0_95, negated_conjecture, (~subset(esk17_0,# Child (1673) has found a proof.
% 0.18/0.41
% 0.18/0.41 # Proof search is over...
% 0.18/0.41 # Freeing feature tree
%------------------------------------------------------------------------------