TSTP Solution File: SEU345+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU345+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 : n008.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 2.05s 2.24s
% Output : CNFRefutation 2.05s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU345+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.33 % Computer : n008.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jun 20 06:53:52 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.18/0.37 # No SInE strategy applied
% 0.18/0.37 # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S0Y
% 0.18/0.37 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.18/0.37 #
% 0.18/0.37 # Number of axioms: 158 Number of unprocessed: 158
% 0.18/0.37 # Tableaux proof search.
% 0.18/0.37 # APR header successfully linked.
% 0.18/0.37 # Hello from C++
% 0.73/0.90 # The folding up rule is enabled...
% 0.73/0.90 # Local unification is enabled...
% 0.73/0.90 # Any saturation attempts will use folding labels...
% 0.73/0.90 # 158 beginning clauses after preprocessing and clausification
% 0.73/0.90 # Creating start rules for all 1 conjectures.
% 0.73/0.90 # There are 1 start rule candidates:
% 0.73/0.90 # Found 54 unit axioms.
% 0.73/0.90 # 1 start rule tableaux created.
% 0.73/0.90 # 104 extension rule candidate clauses
% 0.73/0.90 # 54 unit axiom clauses
% 0.73/0.90
% 0.73/0.90 # Requested 8, 32 cores available to the main process.
% 0.73/0.90 # There are not enough tableaux to fork, creating more from the initial 1
% 2.05/2.24 # There were 5 total branch saturation attempts.
% 2.05/2.24 # There were 0 of these attempts blocked.
% 2.05/2.24 # There were 0 deferred branch saturation attempts.
% 2.05/2.24 # There were 0 free duplicated saturations.
% 2.05/2.24 # There were 5 total successful branch saturations.
% 2.05/2.24 # There were 0 successful branch saturations in interreduction.
% 2.05/2.24 # There were 0 successful branch saturations on the branch.
% 2.05/2.24 # There were 5 successful branch saturations after the branch.
% 2.05/2.24 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.05/2.24 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.05/2.24 # Begin clausification derivation
% 2.05/2.24
% 2.05/2.24 # End clausification derivation
% 2.05/2.24 # Begin listing active clauses obtained from FOF to CNF conversion
% 2.05/2.24 cnf(i_0_77, plain, (latt_str(esk9_0))).
% 2.05/2.24 cnf(i_0_136, plain, (latt_str(esk17_0))).
% 2.05/2.24 cnf(i_0_143, plain, (latt_str(esk20_0))).
% 2.05/2.24 cnf(i_0_153, plain, (latt_str(esk21_0))).
% 2.05/2.24 cnf(i_0_135, plain, (strict_latt_str(esk17_0))).
% 2.05/2.24 cnf(i_0_141, plain, (strict_latt_str(esk20_0))).
% 2.05/2.24 cnf(i_0_151, plain, (strict_latt_str(esk21_0))).
% 2.05/2.24 cnf(i_0_144, plain, (lattice(esk21_0))).
% 2.05/2.24 cnf(i_0_150, plain, (join_commutative(esk21_0))).
% 2.05/2.24 cnf(i_0_149, plain, (join_associative(esk21_0))).
% 2.05/2.24 cnf(i_0_148, plain, (meet_commutative(esk21_0))).
% 2.05/2.24 cnf(i_0_147, plain, (meet_associative(esk21_0))).
% 2.05/2.24 cnf(i_0_146, plain, (meet_absorbing(esk21_0))).
% 2.05/2.24 cnf(i_0_145, plain, (join_absorbing(esk21_0))).
% 2.05/2.24 cnf(i_0_74, plain, (meet_semilatt_str(esk6_0))).
% 2.05/2.24 cnf(i_0_76, plain, (join_semilatt_str(esk8_0))).
% 2.05/2.24 cnf(i_0_85, plain, (empty(empty_set))).
% 2.05/2.24 cnf(i_0_131, plain, (empty(esk14_0))).
% 2.05/2.24 cnf(i_0_75, plain, (one_sorted_str(esk7_0))).
% 2.05/2.24 cnf(i_0_138, plain, (one_sorted_str(esk18_0))).
% 2.05/2.24 cnf(i_0_137, plain, (~empty_carrier(esk18_0))).
% 2.05/2.24 cnf(i_0_142, plain, (~empty_carrier(esk20_0))).
% 2.05/2.24 cnf(i_0_152, plain, (~empty_carrier(esk21_0))).
% 2.05/2.24 cnf(i_0_134, plain, (~empty(esk16_0))).
% 2.05/2.24 cnf(i_0_173, plain, (X1=empty_set|~empty(X1))).
% 2.05/2.24 cnf(i_0_42, plain, (latt_str(boole_lattice(X1)))).
% 2.05/2.24 cnf(i_0_43, plain, (strict_latt_str(boole_lattice(X1)))).
% 2.05/2.24 cnf(i_0_81, plain, (strict_latt_str(boole_lattice(X1)))).
% 2.05/2.24 cnf(i_0_98, plain, (strict_latt_str(boole_lattice(X1)))).
% 2.05/2.24 cnf(i_0_91, plain, (lattice(boole_lattice(X1)))).
% 2.05/2.24 cnf(i_0_97, plain, (join_commutative(boole_lattice(X1)))).
% 2.05/2.24 cnf(i_0_96, plain, (join_associative(boole_lattice(X1)))).
% 2.05/2.24 cnf(i_0_95, plain, (meet_commutative(boole_lattice(X1)))).
% 2.05/2.24 cnf(i_0_94, plain, (meet_associative(boole_lattice(X1)))).
% 2.05/2.24 cnf(i_0_93, plain, (meet_absorbing(boole_lattice(X1)))).
% 2.05/2.24 cnf(i_0_92, plain, (join_absorbing(boole_lattice(X1)))).
% 2.05/2.24 cnf(i_0_132, plain, (empty(esk15_1(X1)))).
% 2.05/2.24 cnf(i_0_63, plain, (meet_semilatt_str(X1)|~latt_str(X1))).
% 2.05/2.24 cnf(i_0_62, plain, (join_semilatt_str(X1)|~latt_str(X1))).
% 2.05/2.24 cnf(i_0_59, plain, (one_sorted_str(X1)|~meet_semilatt_str(X1))).
% 2.05/2.24 cnf(i_0_61, plain, (one_sorted_str(X1)|~join_semilatt_str(X1))).
% 2.05/2.24 cnf(i_0_165, plain, (set_intersection2(X1,empty_set)=empty_set)).
% 2.05/2.24 cnf(i_0_167, plain, (subset(empty_set,X1))).
% 2.05/2.24 cnf(i_0_161, plain, (set_union2(X1,empty_set)=X1)).
% 2.05/2.24 cnf(i_0_160, plain, (subset(X1,X1))).
% 2.05/2.24 cnf(i_0_125, plain, (set_union2(X1,X1)=X1)).
% 2.05/2.24 cnf(i_0_126, plain, (set_intersection2(X1,X1)=X1)).
% 2.05/2.24 cnf(i_0_175, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 2.05/2.24 cnf(i_0_82, plain, (~empty_carrier(boole_lattice(X1)))).
% 2.05/2.24 cnf(i_0_99, plain, (~empty_carrier(boole_lattice(X1)))).
% 2.05/2.24 cnf(i_0_84, plain, (~empty(powerset(X1)))).
% 2.05/2.24 cnf(i_0_100, plain, (~empty(singleton(X1)))).
% 2.05/2.24 cnf(i_0_73, plain, (function(the_L_join(X1))|~join_semilatt_str(X1))).
% 2.05/2.24 cnf(i_0_69, plain, (function(the_L_meet(X1))|~meet_semilatt_str(X1))).
% 2.05/2.24 cnf(i_0_79, plain, (element(esk11_1(X1),X1))).
% 2.05/2.24 cnf(i_0_129, plain, (empty(X1)|~empty(esk13_1(X1)))).
% 2.05/2.24 cnf(i_0_8, plain, (empty_carrier(X1)|join_commutative(X1)|~latt_str(X1)|~lattice(X1))).
% 2.05/2.24 cnf(i_0_7, plain, (empty_carrier(X1)|join_associative(X1)|~latt_str(X1)|~lattice(X1))).
% 2.05/2.24 cnf(i_0_6, plain, (empty_carrier(X1)|meet_commutative(X1)|~latt_str(X1)|~lattice(X1))).
% 2.05/2.24 cnf(i_0_5, plain, (empty_carrier(X1)|meet_associative(X1)|~latt_str(X1)|~lattice(X1))).
% 2.05/2.24 cnf(i_0_4, plain, (empty_carrier(X1)|meet_absorbing(X1)|~latt_str(X1)|~lattice(X1))).
% 2.05/2.24 cnf(i_0_3, plain, (empty_carrier(X1)|join_absorbing(X1)|~latt_str(X1)|~lattice(X1))).
% 2.05/2.24 cnf(i_0_168, negated_conjecture, (bottom_of_semilattstr(boole_lattice(esk22_0))!=empty_set|~lower_bounded_semilattstr(boole_lattice(esk22_0)))).
% 2.05/2.24 cnf(i_0_133, plain, (element(esk15_1(X1),powerset(X1)))).
% 2.05/2.24 cnf(i_0_13, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
% 2.05/2.24 cnf(i_0_14, plain, (set_union2(X1,X2)=set_union2(X2,X1))).
% 2.05/2.24 cnf(i_0_15, plain, (set_intersection2(X1,X2)=set_intersection2(X2,X1))).
% 2.05/2.24 cnf(i_0_83, plain, (empty_carrier(X1)|~one_sorted_str(X1)|~empty(the_carrier(X1)))).
% 2.05/2.24 cnf(i_0_139, plain, (empty_carrier(X1)|~one_sorted_str(X1)|~empty(esk19_1(X1)))).
% 2.05/2.24 cnf(i_0_90, plain, (empty_carrier(X1)|relation(the_L_join(X1))|~join_commutative(X1)|~join_semilatt_str(X1))).
% 2.05/2.24 cnf(i_0_106, plain, (empty_carrier(X1)|relation(the_L_join(X1))|~join_associative(X1)|~join_semilatt_str(X1))).
% 2.05/2.24 cnf(i_0_115, plain, (empty_carrier(X1)|relation(the_L_meet(X1))|~meet_commutative(X1)|~meet_semilatt_str(X1))).
% 2.05/2.24 cnf(i_0_121, plain, (empty_carrier(X1)|relation(the_L_meet(X1))|~meet_associative(X1)|~meet_semilatt_str(X1))).
% 2.05/2.24 cnf(i_0_89, plain, (empty_carrier(X1)|function(the_L_join(X1))|~join_commutative(X1)|~join_semilatt_str(X1))).
% 2.05/2.24 cnf(i_0_105, plain, (empty_carrier(X1)|function(the_L_join(X1))|~join_associative(X1)|~join_semilatt_str(X1))).
% 2.05/2.24 cnf(i_0_114, plain, (empty_carrier(X1)|function(the_L_meet(X1))|~meet_commutative(X1)|~meet_semilatt_str(X1))).
% 2.05/2.24 cnf(i_0_120, plain, (empty_carrier(X1)|function(the_L_meet(X1))|~meet_associative(X1)|~meet_semilatt_str(X1))).
% 2.05/2.24 cnf(i_0_174, plain, (~empty(X2)|~in(X1,X2))).
% 2.05/2.24 cnf(i_0_34, plain, (powerset(X2)=the_carrier(X1)|X1!=boole_lattice(X2)|~latt_str(X1)|~strict_latt_str(X1))).
% 2.05/2.24 cnf(i_0_130, plain, (empty(X1)|element(esk13_1(X1),powerset(X1)))).
% 2.05/2.24 cnf(i_0_164, plain, (element(X1,X2)|~in(X1,X2))).
% 2.05/2.24 cnf(i_0_57, plain, (empty_carrier(X1)|element(bottom_of_semilattstr(X1),the_carrier(X1))|~meet_semilatt_str(X1))).
% 2.05/2.24 cnf(i_0_166, plain, (empty(X2)|in(X1,X2)|~element(X1,X2))).
% 2.05/2.24 cnf(i_0_169, plain, (element(X1,powerset(X2))|~subset(X1,X2))).
% 2.05/2.24 cnf(i_0_2, plain, (~in(X2,X1)|~in(X1,X2))).
% 2.05/2.24 cnf(i_0_23, plain, (empty_carrier(X1)|element(esk1_1(X1),the_carrier(X1))|~meet_semilatt_str(X1)|~lower_bounded_semilattstr(X1))).
% 2.05/2.24 cnf(i_0_87, plain, (empty_carrier(X1)|v1_binop_1(the_L_join(X1),the_carrier(X1))|~join_commutative(X1)|~join_semilatt_str(X1))).
% 2.05/2.24 cnf(i_0_112, plain, (empty_carrier(X1)|v1_binop_1(the_L_meet(X1),the_carrier(X1))|~meet_commutative(X1)|~meet_semilatt_str(X1))).
% 2.05/2.24 cnf(i_0_103, plain, (empty_carrier(X1)|v2_binop_1(the_L_join(X1),the_carrier(X1))|~join_associative(X1)|~join_semilatt_str(X1))).
% 2.05/2.24 cnf(i_0_118, plain, (empty_carrier(X1)|v2_binop_1(the_L_meet(X1),the_carrier(X1))|~meet_associative(X1)|~meet_semilatt_str(X1))).
% 2.05/2.24 cnf(i_0_170, plain, (subset(X1,X2)|~element(X1,powerset(X2)))).
% 2.05/2.24 cnf(i_0_109, plain, (~empty(unordered_pair(X1,X2)))).
% 2.05/2.24 cnf(i_0_140, plain, (empty_carrier(X1)|element(esk19_1(X1),powerset(the_carrier(X1)))|~one_sorted_str(X1))).
% 2.05/2.24 cnf(i_0_110, plain, (empty(X1)|~empty(set_union2(X2,X1)))).
% 2.05/2.24 cnf(i_0_101, plain, (empty(X1)|~empty(set_union2(X1,X2)))).
% 2.05/2.24 cnf(i_0_116, plain, (empty(X2)|empty(X1)|~empty(cartesian_product2(X1,X2)))).
% 2.05/2.24 cnf(i_0_11, plain, (empty_carrier(X1)|lattice(X1)|~latt_str(X1)|~join_commutative(X1)|~join_associative(X1)|~meet_commutative(X1)|~meet_associative(X1)|~meet_absorbing(X1)|~join_absorbing(X1))).
% 2.05/2.24 cnf(i_0_172, plain, (~empty(X3)|~in(X1,X2)|~element(X2,powerset(X3)))).
% 2.05/2.24 cnf(i_0_171, plain, (element(X1,X3)|~in(X1,X2)|~element(X2,powerset(X3)))).
% 2.05/2.24 cnf(i_0_31, plain, (X2=boole_lattice(X1)|element(esk4_2(X1,X2),powerset(X1))|powerset(X1)!=the_carrier(X2)|~latt_str(X2)|~strict_latt_str(X2))).
% 2.05/2.24 cnf(i_0_30, plain, (X2=boole_lattice(X1)|element(esk5_2(X1,X2),powerset(X1))|powerset(X1)!=the_carrier(X2)|~latt_str(X2)|~strict_latt_str(X2))).
% 2.05/2.24 cnf(i_0_78, plain, (relation_of2(esk10_2(X1,X2),X1,X2))).
% 2.05/2.24 cnf(i_0_80, plain, (relation_of2_as_subset(esk12_2(X1,X2),X1,X2))).
% 2.05/2.24 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))).
% 2.05/2.24 cnf(i_0_20, plain, (empty_carrier(X1)|lower_bounded_semilattstr(X1)|element(esk2_2(X1,X2),the_carrier(X1))|~meet_semilatt_str(X1)|~element(X2,the_carrier(X1)))).
% 2.05/2.24 cnf(i_0_25, plain, (X2=bottom_of_semilattstr(X1)|empty_carrier(X1)|element(esk3_2(X1,X2),the_carrier(X1))|~meet_semilatt_str(X1)|~lower_bounded_semilattstr(X1)|~element(X2,the_carrier(X1)))).
% 2.05/2.24 cnf(i_0_21, plain, (meet(X1,X2,esk1_1(X1))=esk1_1(X1)|empty_carrier(X1)|~meet_semilatt_str(X1)|~lower_bounded_semilattstr(X1)|~element(X2,the_carrier(X1)))).
% 2.05/2.24 cnf(i_0_22, plain, (meet(X1,esk1_1(X1),X2)=esk1_1(X1)|empty_carrier(X1)|~meet_semilatt_str(X1)|~lower_bounded_semilattstr(X1)|~element(X2,the_carrier(X1)))).
% 2.05/2.24 cnf(i_0_10, plain, (relation(X1)|~element(X1,powerset(cartesian_product2(X2,X3))))).
% 2.05/2.24 cnf(i_0_127, plain, (subset_union2(X2,X1,X1)=X1|~element(X3,powerset(X2))|~element(X1,powerset(X2)))).
% 2.05/2.24 cnf(i_0_128, plain, (subset_intersection2(X2,X1,X1)=X1|~element(X3,powerset(X2))|~element(X1,powerset(X2)))).
% 2.05/2.24 cnf(i_0_72, plain, (quasi_total(the_L_join(X1),cartesian_product2(the_carrier(X1),the_carrier(X1)),the_carrier(X1))|~join_semilatt_str(X1))).
% 2.05/2.24 cnf(i_0_68, plain, (quasi_total(the_L_meet(X1),cartesian_product2(the_carrier(X1),the_carrier(X1)),the_carrier(X1))|~meet_semilatt_str(X1))).
% 2.05/2.24 cnf(i_0_71, plain, (relation_of2_as_subset(the_L_join(X1),cartesian_product2(the_carrier(X1),the_carrier(X1)),the_carrier(X1))|~join_semilatt_str(X1))).
% 2.05/2.24 cnf(i_0_67, plain, (relation_of2_as_subset(the_L_meet(X1),cartesian_product2(the_carrier(X1),the_carrier(X1)),the_carrier(X1))|~meet_semilatt_str(X1))).
% 2.05/2.24 cnf(i_0_156, plain, (subset_union2(X2,X1,X3)=set_union2(X1,X3)|~element(X3,powerset(X2))|~element(X1,powerset(X2)))).
% 2.05/2.24 cnf(i_0_157, plain, (subset_intersection2(X2,X1,X3)=set_intersection2(X1,X3)|~element(X3,powerset(X2))|~element(X1,powerset(X2)))).
% 2.05/2.24 cnf(i_0_88, plain, (empty_carrier(X1)|quasi_total(the_L_join(X1),cartesian_product2(the_carrier(X1),the_carrier(X1)),the_carrier(X1))|~join_commutative(X1)|~join_semilatt_str(X1))).
% 2.05/2.24 cnf(i_0_104, plain, (empty_carrier(X1)|quasi_total(the_L_join(X1),cartesian_product2(the_carrier(X1),the_carrier(X1)),the_carrier(X1))|~join_associative(X1)|~join_semilatt_str(X1))).
% 2.05/2.24 cnf(i_0_113, plain, (empty_carrier(X1)|quasi_total(the_L_meet(X1),cartesian_product2(the_carrier(X1),the_carrier(X1)),the_carrier(X1))|~meet_commutative(X1)|~meet_semilatt_str(X1))).
% 2.05/2.24 cnf(i_0_119, plain, (empty_carrier(X1)|quasi_total(the_L_meet(X1),cartesian_product2(the_carrier(X1),the_carrier(X1)),the_carrier(X1))|~meet_associative(X1)|~meet_semilatt_str(X1))).
% 2.05/2.24 cnf(i_0_86, plain, (empty_carrier(X1)|v1_partfun1(the_L_join(X1),cartesian_product2(the_carrier(X1),the_carrier(X1)),the_carrier(X1))|~join_commutative(X1)|~join_semilatt_str(X1))).
% 2.05/2.24 cnf(i_0_102, plain, (empty_carrier(X1)|v1_partfun1(the_L_join(X1),cartesian_product2(the_carrier(X1),the_carrier(X1)),the_carrier(X1))|~join_associative(X1)|~join_semilatt_str(X1))).
% 2.05/2.24 cnf(i_0_111, plain, (empty_carrier(X1)|v1_partfun1(the_L_meet(X1),cartesian_product2(the_carrier(X1),the_carrier(X1)),the_carrier(X1))|~meet_commutative(X1)|~meet_semilatt_str(X1))).
% 2.05/2.24 cnf(i_0_117, plain, (empty_carrier(X1)|v1_partfun1(the_L_meet(X1),cartesian_product2(the_carrier(X1),the_carrier(X1)),the_carrier(X1))|~meet_associative(X1)|~meet_semilatt_str(X1))).
% 2.05/2.24 cnf(i_0_159, plain, (relation_of2(X1,X2,X3)|~relation_of2_as_subset(X1,X2,X3))).
% 2.05/2.24 cnf(i_0_158, plain, (relation_of2_as_subset(X1,X2,X3)|~relation_of2(X1,X2,X3))).
% 2.05/2.24 cnf(i_0_26, plain, (meet(X1,X2,X3)=X3|empty_carrier(X1)|X3!=bottom_of_semilattstr(X1)|~meet_semilatt_str(X1)|~lower_bounded_semilattstr(X1)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1)))).
% 2.05/2.24 cnf(i_0_27, plain, (meet(X1,X2,X3)=X2|empty_carrier(X1)|X2!=bottom_of_semilattstr(X1)|~meet_semilatt_str(X1)|~lower_bounded_semilattstr(X1)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1)))).
% 2.05/2.24 cnf(i_0_66, plain, (element(X1,powerset(cartesian_product2(X2,X3)))|~relation_of2_as_subset(X1,X2,X3))).
% 2.05/2.24 cnf(i_0_28, plain, (apply(X1,unordered_pair(unordered_pair(X2,X3),singleton(X2)))=apply_binary(X1,X2,X3)|~relation(X1)|~function(X1))).
% 2.05/2.24 cnf(i_0_17, plain, (subset_union2(X2,X1,X3)=subset_union2(X2,X3,X1)|~element(X3,powerset(X2))|~element(X1,powerset(X2)))).
% 2.05/2.24 cnf(i_0_18, plain, (subset_intersection2(X2,X1,X3)=subset_intersection2(X2,X3,X1)|~element(X3,powerset(X2))|~element(X1,powerset(X2)))).
% 2.05/2.24 cnf(i_0_162, 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))))).
% 2.05/2.24 cnf(i_0_163, 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))))).
% 2.05/2.24 cnf(i_0_55, plain, (element(subset_union2(X2,X1,X3),powerset(X2))|~element(X3,powerset(X2))|~element(X1,powerset(X2)))).
% 2.05/2.24 cnf(i_0_58, plain, (element(subset_intersection2(X2,X1,X3),powerset(X2))|~element(X3,powerset(X2))|~element(X1,powerset(X2)))).
% 2.05/2.24 cnf(i_0_16, plain, (meet_commut(X1,X2,X3)=meet_commut(X1,X3,X2)|empty_carrier(X1)|~meet_commutative(X1)|~meet_semilatt_str(X1)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1)))).
% 2.05/2.24 cnf(i_0_155, plain, (meet_commut(X1,X2,X3)=meet(X1,X2,X3)|empty_carrier(X1)|~meet_commutative(X1)|~meet_semilatt_str(X1)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1)))).
% 2.05/2.24 cnf(i_0_33, plain, (apply_binary(the_L_join(X1),X2,X3)=subset_union2(X4,X2,X3)|X1!=boole_lattice(X4)|~latt_str(X1)|~strict_latt_str(X1)|~element(X3,powerset(X4))|~element(X2,powerset(X4)))).
% 2.05/2.24 cnf(i_0_32, plain, (apply_binary(the_L_meet(X1),X2,X3)=subset_intersection2(X4,X2,X3)|X1!=boole_lattice(X4)|~latt_str(X1)|~strict_latt_str(X1)|~element(X3,powerset(X4))|~element(X2,powerset(X4)))).
% 2.05/2.24 cnf(i_0_49, 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)))).
% 2.05/2.24 cnf(i_0_44, 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)))).
% 2.05/2.24 cnf(i_0_54, plain, (empty_carrier(X1)|element(meet_commut(X1,X2,X3),the_carrier(X1))|~meet_commutative(X1)|~meet_semilatt_str(X1)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1)))).
% 2.05/2.24 cnf(i_0_19, plain, (empty_carrier(X1)|lower_bounded_semilattstr(X1)|meet(X1,X2,esk2_2(X1,X2))!=X2|meet(X1,esk2_2(X1,X2),X2)!=X2|~meet_semilatt_str(X1)|~element(X2,the_carrier(X1)))).
% 2.05/2.24 cnf(i_0_24, plain, (X2=bottom_of_semilattstr(X1)|empty_carrier(X1)|meet(X1,X2,esk3_2(X1,X2))!=X2|meet(X1,esk3_2(X1,X2),X2)!=X2|~meet_semilatt_str(X1)|~lower_bounded_semilattstr(X1)|~element(X2,the_carrier(X1)))).
% 2.05/2.24 cnf(i_0_38, 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))).
% 2.05/2.24 cnf(i_0_39, 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))).
% 2.05/2.24 cnf(i_0_107, 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))).
% 2.05/2.24 cnf(i_0_122, 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))).
% 2.05/2.24 cnf(i_0_123, 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))).
% 2.05/2.24 cnf(i_0_124, 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))).
% 2.05/2.24 cnf(i_0_108, 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))).
% 2.05/2.24 cnf(i_0_29, plain, (X1=boole_lattice(X2)|powerset(X2)!=the_carrier(X1)|apply_binary(the_L_join(X1),esk4_2(X2,X1),esk5_2(X2,X1))!=subset_union2(X2,esk4_2(X2,X1),esk5_2(X2,X1))|apply_binary(the_L_meet(X1),esk4_2(X2,X1),esk5_2(X2,X1))!=subset_intersection2(X2,esk4_2(X2,X1),esk5_2(X2,X1))|~latt_str(X1)|~strict_latt_str(X1))).
% 2.05/2.24 cnf(i_0_36, 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)))).
% 2.05/2.24 cnf(i_0_35, 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)))).
% 2.05/2.24 cnf(i_0_154, 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))).
% 2.05/2.24 cnf(i_0_48, 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))).
% 2.05/2.24 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 2.05/2.24 # Begin printing tableau
% 2.05/2.24 # Found 10 steps
% 2.05/2.24 cnf(i_0_168, negated_conjecture, (bottom_of_semilattstr(boole_lattice(esk22_0))!=empty_set|~lower_bounded_semilattstr(boole_lattice(esk22_0))), inference(start_rule)).
% 2.05/2.24 cnf(i_0_177, plain, (~lower_bounded_semilattstr(boole_lattice(esk22_0))), inference(extension_rule, [i_0_19])).
% 2.05/2.24 cnf(i_0_913, plain, (empty_carrier(boole_lattice(esk22_0))), inference(closure_rule, [i_0_82])).
% 2.05/2.24 cnf(i_0_918, plain, (~element(esk11_1(the_carrier(boole_lattice(esk22_0))),the_carrier(boole_lattice(esk22_0)))), inference(closure_rule, [i_0_79])).
% 2.05/2.24 cnf(i_0_915, plain, (meet(boole_lattice(esk22_0),esk11_1(the_carrier(boole_lattice(esk22_0))),esk2_2(boole_lattice(esk22_0),esk11_1(the_carrier(boole_lattice(esk22_0)))))!=esk11_1(the_carrier(boole_lattice(esk22_0)))), inference(extension_rule, [i_0_175])).
% 2.05/2.24 cnf(i_0_176, plain, (bottom_of_semilattstr(boole_lattice(esk22_0))!=empty_set), inference(etableau_closure_rule, [i_0_176, ...])).
% 2.05/2.24 cnf(i_0_916, plain, (meet(boole_lattice(esk22_0),esk2_2(boole_lattice(esk22_0),esk11_1(the_carrier(boole_lattice(esk22_0)))),esk11_1(the_carrier(boole_lattice(esk22_0))))!=esk11_1(the_carrier(boole_lattice(esk22_0)))), inference(etableau_closure_rule, [i_0_916, ...])).
% 2.05/2.24 cnf(i_0_917, plain, (~meet_semilatt_str(boole_lattice(esk22_0))), inference(etableau_closure_rule, [i_0_917, ...])).
% 2.05/2.24 cnf(i_0_1025, plain, (~empty(esk11_1(the_carrier(boole_lattice(esk22_0))))), inference(etableau_closure_rule, [i_0_1025, ...])).
% 2.05/2.24 cnf(i_0_1026, plain, (~empty(meet(boole_lattice(esk22_0),esk11_1(the_carrier(boole_lattice(esk22_0))),esk2_2(boole_lattice(esk22_0),esk11_1(the_carrier(boole_lattice(esk22_0))))))), inference(etableau_closure_rule, [i_0_1026, ...])).
% 2.05/2.24 # End printing tableau
% 2.05/2.24 # SZS output end
% 2.05/2.24 # Branches closed with saturation will be marked with an "s"
% 2.05/2.24 # Returning from population with 7 new_tableaux and 0 remaining starting tableaux.
% 2.05/2.24 # We now have 7 tableaux to operate on
% 2.05/2.24 # Found closed tableau during pool population.
% 2.05/2.24 # Proof search is over...
% 2.05/2.24 # Freeing feature tree
%------------------------------------------------------------------------------