TSTP Solution File: SEU343+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU343+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art04.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Thu Dec 30 03:49:06 EST 2010
% Result : Theorem 3.05s
% Output : Solution 3.05s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Reading problem from /tmp/SystemOnTPTP25857/SEU343+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP25857/SEU343+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP25857/SEU343+1.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=60 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 60s
% TreeLimitedRun: WC time limit is 120s
% TreeLimitedRun: PID is 25953
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.020 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 1.92 CPU 2.01 WC
% # SZS output start CNFRefutation.
% fof(10, axiom,![X1]:![X2]:![X3]:((element(X2,powerset(X1))&element(X3,powerset(X1)))=>subset_union2(X1,X2,X3)=set_union2(X2,X3)),file('/tmp/SRASS.s.p', redefinition_k4_subset_1)).
% fof(11, axiom,![X1]:![X2]:![X3]:((element(X2,powerset(X1))&element(X3,powerset(X1)))=>subset_intersection2(X1,X2,X3)=set_intersection2(X2,X3)),file('/tmp/SRASS.s.p', redefinition_k5_subset_1)).
% fof(21, axiom,![X1]:((~(empty_carrier(X1))&join_semilatt_str(X1))=>![X2]:(element(X2,the_carrier(X1))=>![X3]:(element(X3,the_carrier(X1))=>join(X1,X2,X3)=apply_binary_as_element(the_carrier(X1),the_carrier(X1),the_carrier(X1),the_L_join(X1),X2,X3)))),file('/tmp/SRASS.s.p', d1_lattices)).
% fof(22, axiom,![X1]:((~(empty_carrier(X1))&meet_semilatt_str(X1))=>![X2]:(element(X2,the_carrier(X1))=>![X3]:(element(X3,the_carrier(X1))=>meet(X1,X2,X3)=apply_binary_as_element(the_carrier(X1),the_carrier(X1),the_carrier(X1),the_L_meet(X1),X2,X3)))),file('/tmp/SRASS.s.p', d2_lattices)).
% fof(29, axiom,![X1]:(strict_latt_str(boole_lattice(X1))&latt_str(boole_lattice(X1))),file('/tmp/SRASS.s.p', dt_k1_lattice3)).
% fof(30, axiom,![X1]:(~(empty_carrier(boole_lattice(X1)))&strict_latt_str(boole_lattice(X1))),file('/tmp/SRASS.s.p', fc1_lattice3)).
% fof(39, axiom,![X1]:![X2]:((strict_latt_str(X2)&latt_str(X2))=>(X2=boole_lattice(X1)<=>(the_carrier(X2)=powerset(X1)&![X3]:(element(X3,powerset(X1))=>![X4]:(element(X4,powerset(X1))=>(apply_binary(the_L_join(X2),X3,X4)=subset_union2(X1,X3,X4)&apply_binary(the_L_meet(X2),X3,X4)=subset_intersection2(X1,X3,X4))))))),file('/tmp/SRASS.s.p', d1_lattice3)).
% fof(45, axiom,![X1]:((~(empty_carrier(X1))&one_sorted_str(X1))=>~(empty(the_carrier(X1)))),file('/tmp/SRASS.s.p', fc1_struct_0)).
% fof(47, axiom,![X1]:(meet_semilatt_str(X1)=>one_sorted_str(X1)),file('/tmp/SRASS.s.p', dt_l1_lattices)).
% fof(48, axiom,![X1]:(join_semilatt_str(X1)=>one_sorted_str(X1)),file('/tmp/SRASS.s.p', dt_l2_lattices)).
% fof(58, axiom,![X1]:(meet_semilatt_str(X1)=>((function(the_L_meet(X1))&quasi_total(the_L_meet(X1),cartesian_product2(the_carrier(X1),the_carrier(X1)),the_carrier(X1)))&relation_of2_as_subset(the_L_meet(X1),cartesian_product2(the_carrier(X1),the_carrier(X1)),the_carrier(X1)))),file('/tmp/SRASS.s.p', dt_u1_lattices)).
% fof(59, axiom,![X1]:(join_semilatt_str(X1)=>((function(the_L_join(X1))&quasi_total(the_L_join(X1),cartesian_product2(the_carrier(X1),the_carrier(X1)),the_carrier(X1)))&relation_of2_as_subset(the_L_join(X1),cartesian_product2(the_carrier(X1),the_carrier(X1)),the_carrier(X1)))),file('/tmp/SRASS.s.p', dt_u2_lattices)).
% fof(64, axiom,![X1]:(latt_str(X1)=>(meet_semilatt_str(X1)&join_semilatt_str(X1))),file('/tmp/SRASS.s.p', dt_l3_lattices)).
% fof(66, axiom,![X1]:![X2]:![X3]:(relation_of2_as_subset(X3,X1,X2)<=>relation_of2(X3,X1,X2)),file('/tmp/SRASS.s.p', redefinition_m2_relset_1)).
% fof(69, axiom,![X1]:![X2]:![X3]:![X4]:![X5]:![X6]:(((((((~(empty(X1))&~(empty(X2)))&function(X4))&quasi_total(X4,cartesian_product2(X1,X2),X3))&relation_of2(X4,cartesian_product2(X1,X2),X3))&element(X5,X1))&element(X6,X2))=>apply_binary_as_element(X1,X2,X3,X4,X5,X6)=apply_binary(X4,X5,X6)),file('/tmp/SRASS.s.p', redefinition_k2_binop_1)).
% fof(86, conjecture,![X1]:![X2]:(element(X2,the_carrier(boole_lattice(X1)))=>![X3]:(element(X3,the_carrier(boole_lattice(X1)))=>(join(boole_lattice(X1),X2,X3)=set_union2(X2,X3)&meet(boole_lattice(X1),X2,X3)=set_intersection2(X2,X3)))),file('/tmp/SRASS.s.p', t1_lattice3)).
% fof(87, negated_conjecture,~(![X1]:![X2]:(element(X2,the_carrier(boole_lattice(X1)))=>![X3]:(element(X3,the_carrier(boole_lattice(X1)))=>(join(boole_lattice(X1),X2,X3)=set_union2(X2,X3)&meet(boole_lattice(X1),X2,X3)=set_intersection2(X2,X3))))),inference(assume_negation,[status(cth)],[86])).
% fof(93, plain,![X1]:((~(empty_carrier(X1))&join_semilatt_str(X1))=>![X2]:(element(X2,the_carrier(X1))=>![X3]:(element(X3,the_carrier(X1))=>join(X1,X2,X3)=apply_binary_as_element(the_carrier(X1),the_carrier(X1),the_carrier(X1),the_L_join(X1),X2,X3)))),inference(fof_simplification,[status(thm)],[21,theory(equality)])).
% fof(94, plain,![X1]:((~(empty_carrier(X1))&meet_semilatt_str(X1))=>![X2]:(element(X2,the_carrier(X1))=>![X3]:(element(X3,the_carrier(X1))=>meet(X1,X2,X3)=apply_binary_as_element(the_carrier(X1),the_carrier(X1),the_carrier(X1),the_L_meet(X1),X2,X3)))),inference(fof_simplification,[status(thm)],[22,theory(equality)])).
% fof(95, plain,![X1]:(~(empty_carrier(boole_lattice(X1)))&strict_latt_str(boole_lattice(X1))),inference(fof_simplification,[status(thm)],[30,theory(equality)])).
% fof(99, plain,![X1]:((~(empty_carrier(X1))&one_sorted_str(X1))=>~(empty(the_carrier(X1)))),inference(fof_simplification,[status(thm)],[45,theory(equality)])).
% fof(107, plain,![X1]:![X2]:![X3]:![X4]:![X5]:![X6]:(((((((~(empty(X1))&~(empty(X2)))&function(X4))&quasi_total(X4,cartesian_product2(X1,X2),X3))&relation_of2(X4,cartesian_product2(X1,X2),X3))&element(X5,X1))&element(X6,X2))=>apply_binary_as_element(X1,X2,X3,X4,X5,X6)=apply_binary(X4,X5,X6)),inference(fof_simplification,[status(thm)],[69,theory(equality)])).
% fof(130, plain,![X1]:![X2]:![X3]:((~(element(X2,powerset(X1)))|~(element(X3,powerset(X1))))|subset_union2(X1,X2,X3)=set_union2(X2,X3)),inference(fof_nnf,[status(thm)],[10])).
% fof(131, plain,![X4]:![X5]:![X6]:((~(element(X5,powerset(X4)))|~(element(X6,powerset(X4))))|subset_union2(X4,X5,X6)=set_union2(X5,X6)),inference(variable_rename,[status(thm)],[130])).
% cnf(132,plain,(subset_union2(X1,X2,X3)=set_union2(X2,X3)|~element(X3,powerset(X1))|~element(X2,powerset(X1))),inference(split_conjunct,[status(thm)],[131])).
% fof(133, plain,![X1]:![X2]:![X3]:((~(element(X2,powerset(X1)))|~(element(X3,powerset(X1))))|subset_intersection2(X1,X2,X3)=set_intersection2(X2,X3)),inference(fof_nnf,[status(thm)],[11])).
% fof(134, plain,![X4]:![X5]:![X6]:((~(element(X5,powerset(X4)))|~(element(X6,powerset(X4))))|subset_intersection2(X4,X5,X6)=set_intersection2(X5,X6)),inference(variable_rename,[status(thm)],[133])).
% cnf(135,plain,(subset_intersection2(X1,X2,X3)=set_intersection2(X2,X3)|~element(X3,powerset(X1))|~element(X2,powerset(X1))),inference(split_conjunct,[status(thm)],[134])).
% fof(163, plain,![X1]:((empty_carrier(X1)|~(join_semilatt_str(X1)))|![X2]:(~(element(X2,the_carrier(X1)))|![X3]:(~(element(X3,the_carrier(X1)))|join(X1,X2,X3)=apply_binary_as_element(the_carrier(X1),the_carrier(X1),the_carrier(X1),the_L_join(X1),X2,X3)))),inference(fof_nnf,[status(thm)],[93])).
% fof(164, plain,![X4]:((empty_carrier(X4)|~(join_semilatt_str(X4)))|![X5]:(~(element(X5,the_carrier(X4)))|![X6]:(~(element(X6,the_carrier(X4)))|join(X4,X5,X6)=apply_binary_as_element(the_carrier(X4),the_carrier(X4),the_carrier(X4),the_L_join(X4),X5,X6)))),inference(variable_rename,[status(thm)],[163])).
% fof(165, plain,![X4]:![X5]:![X6]:(((~(element(X6,the_carrier(X4)))|join(X4,X5,X6)=apply_binary_as_element(the_carrier(X4),the_carrier(X4),the_carrier(X4),the_L_join(X4),X5,X6))|~(element(X5,the_carrier(X4))))|(empty_carrier(X4)|~(join_semilatt_str(X4)))),inference(shift_quantors,[status(thm)],[164])).
% cnf(166,plain,(empty_carrier(X1)|join(X1,X2,X3)=apply_binary_as_element(the_carrier(X1),the_carrier(X1),the_carrier(X1),the_L_join(X1),X2,X3)|~join_semilatt_str(X1)|~element(X2,the_carrier(X1))|~element(X3,the_carrier(X1))),inference(split_conjunct,[status(thm)],[165])).
% fof(167, plain,![X1]:((empty_carrier(X1)|~(meet_semilatt_str(X1)))|![X2]:(~(element(X2,the_carrier(X1)))|![X3]:(~(element(X3,the_carrier(X1)))|meet(X1,X2,X3)=apply_binary_as_element(the_carrier(X1),the_carrier(X1),the_carrier(X1),the_L_meet(X1),X2,X3)))),inference(fof_nnf,[status(thm)],[94])).
% fof(168, plain,![X4]:((empty_carrier(X4)|~(meet_semilatt_str(X4)))|![X5]:(~(element(X5,the_carrier(X4)))|![X6]:(~(element(X6,the_carrier(X4)))|meet(X4,X5,X6)=apply_binary_as_element(the_carrier(X4),the_carrier(X4),the_carrier(X4),the_L_meet(X4),X5,X6)))),inference(variable_rename,[status(thm)],[167])).
% fof(169, plain,![X4]:![X5]:![X6]:(((~(element(X6,the_carrier(X4)))|meet(X4,X5,X6)=apply_binary_as_element(the_carrier(X4),the_carrier(X4),the_carrier(X4),the_L_meet(X4),X5,X6))|~(element(X5,the_carrier(X4))))|(empty_carrier(X4)|~(meet_semilatt_str(X4)))),inference(shift_quantors,[status(thm)],[168])).
% cnf(170,plain,(empty_carrier(X1)|meet(X1,X2,X3)=apply_binary_as_element(the_carrier(X1),the_carrier(X1),the_carrier(X1),the_L_meet(X1),X2,X3)|~meet_semilatt_str(X1)|~element(X2,the_carrier(X1))|~element(X3,the_carrier(X1))),inference(split_conjunct,[status(thm)],[169])).
% fof(188, plain,![X2]:(strict_latt_str(boole_lattice(X2))&latt_str(boole_lattice(X2))),inference(variable_rename,[status(thm)],[29])).
% cnf(189,plain,(latt_str(boole_lattice(X1))),inference(split_conjunct,[status(thm)],[188])).
% cnf(190,plain,(strict_latt_str(boole_lattice(X1))),inference(split_conjunct,[status(thm)],[188])).
% fof(191, plain,![X2]:(~(empty_carrier(boole_lattice(X2)))&strict_latt_str(boole_lattice(X2))),inference(variable_rename,[status(thm)],[95])).
% cnf(193,plain,(~empty_carrier(boole_lattice(X1))),inference(split_conjunct,[status(thm)],[191])).
% fof(223, plain,![X1]:![X2]:((~(strict_latt_str(X2))|~(latt_str(X2)))|((~(X2=boole_lattice(X1))|(the_carrier(X2)=powerset(X1)&![X3]:(~(element(X3,powerset(X1)))|![X4]:(~(element(X4,powerset(X1)))|(apply_binary(the_L_join(X2),X3,X4)=subset_union2(X1,X3,X4)&apply_binary(the_L_meet(X2),X3,X4)=subset_intersection2(X1,X3,X4))))))&((~(the_carrier(X2)=powerset(X1))|?[X3]:(element(X3,powerset(X1))&?[X4]:(element(X4,powerset(X1))&(~(apply_binary(the_L_join(X2),X3,X4)=subset_union2(X1,X3,X4))|~(apply_binary(the_L_meet(X2),X3,X4)=subset_intersection2(X1,X3,X4))))))|X2=boole_lattice(X1)))),inference(fof_nnf,[status(thm)],[39])).
% fof(224, plain,![X5]:![X6]:((~(strict_latt_str(X6))|~(latt_str(X6)))|((~(X6=boole_lattice(X5))|(the_carrier(X6)=powerset(X5)&![X7]:(~(element(X7,powerset(X5)))|![X8]:(~(element(X8,powerset(X5)))|(apply_binary(the_L_join(X6),X7,X8)=subset_union2(X5,X7,X8)&apply_binary(the_L_meet(X6),X7,X8)=subset_intersection2(X5,X7,X8))))))&((~(the_carrier(X6)=powerset(X5))|?[X9]:(element(X9,powerset(X5))&?[X10]:(element(X10,powerset(X5))&(~(apply_binary(the_L_join(X6),X9,X10)=subset_union2(X5,X9,X10))|~(apply_binary(the_L_meet(X6),X9,X10)=subset_intersection2(X5,X9,X10))))))|X6=boole_lattice(X5)))),inference(variable_rename,[status(thm)],[223])).
% fof(225, plain,![X5]:![X6]:((~(strict_latt_str(X6))|~(latt_str(X6)))|((~(X6=boole_lattice(X5))|(the_carrier(X6)=powerset(X5)&![X7]:(~(element(X7,powerset(X5)))|![X8]:(~(element(X8,powerset(X5)))|(apply_binary(the_L_join(X6),X7,X8)=subset_union2(X5,X7,X8)&apply_binary(the_L_meet(X6),X7,X8)=subset_intersection2(X5,X7,X8))))))&((~(the_carrier(X6)=powerset(X5))|(element(esk12_2(X5,X6),powerset(X5))&(element(esk13_2(X5,X6),powerset(X5))&(~(apply_binary(the_L_join(X6),esk12_2(X5,X6),esk13_2(X5,X6))=subset_union2(X5,esk12_2(X5,X6),esk13_2(X5,X6)))|~(apply_binary(the_L_meet(X6),esk12_2(X5,X6),esk13_2(X5,X6))=subset_intersection2(X5,esk12_2(X5,X6),esk13_2(X5,X6)))))))|X6=boole_lattice(X5)))),inference(skolemize,[status(esa)],[224])).
% fof(226, plain,![X5]:![X6]:![X7]:![X8]:((((((~(element(X8,powerset(X5)))|(apply_binary(the_L_join(X6),X7,X8)=subset_union2(X5,X7,X8)&apply_binary(the_L_meet(X6),X7,X8)=subset_intersection2(X5,X7,X8)))|~(element(X7,powerset(X5))))&the_carrier(X6)=powerset(X5))|~(X6=boole_lattice(X5)))&((~(the_carrier(X6)=powerset(X5))|(element(esk12_2(X5,X6),powerset(X5))&(element(esk13_2(X5,X6),powerset(X5))&(~(apply_binary(the_L_join(X6),esk12_2(X5,X6),esk13_2(X5,X6))=subset_union2(X5,esk12_2(X5,X6),esk13_2(X5,X6)))|~(apply_binary(the_L_meet(X6),esk12_2(X5,X6),esk13_2(X5,X6))=subset_intersection2(X5,esk12_2(X5,X6),esk13_2(X5,X6)))))))|X6=boole_lattice(X5)))|(~(strict_latt_str(X6))|~(latt_str(X6)))),inference(shift_quantors,[status(thm)],[225])).
% fof(227, plain,![X5]:![X6]:![X7]:![X8]:(((((((apply_binary(the_L_join(X6),X7,X8)=subset_union2(X5,X7,X8)|~(element(X8,powerset(X5))))|~(element(X7,powerset(X5))))|~(X6=boole_lattice(X5)))|(~(strict_latt_str(X6))|~(latt_str(X6))))&((((apply_binary(the_L_meet(X6),X7,X8)=subset_intersection2(X5,X7,X8)|~(element(X8,powerset(X5))))|~(element(X7,powerset(X5))))|~(X6=boole_lattice(X5)))|(~(strict_latt_str(X6))|~(latt_str(X6)))))&((the_carrier(X6)=powerset(X5)|~(X6=boole_lattice(X5)))|(~(strict_latt_str(X6))|~(latt_str(X6)))))&((((element(esk12_2(X5,X6),powerset(X5))|~(the_carrier(X6)=powerset(X5)))|X6=boole_lattice(X5))|(~(strict_latt_str(X6))|~(latt_str(X6))))&((((element(esk13_2(X5,X6),powerset(X5))|~(the_carrier(X6)=powerset(X5)))|X6=boole_lattice(X5))|(~(strict_latt_str(X6))|~(latt_str(X6))))&((((~(apply_binary(the_L_join(X6),esk12_2(X5,X6),esk13_2(X5,X6))=subset_union2(X5,esk12_2(X5,X6),esk13_2(X5,X6)))|~(apply_binary(the_L_meet(X6),esk12_2(X5,X6),esk13_2(X5,X6))=subset_intersection2(X5,esk12_2(X5,X6),esk13_2(X5,X6))))|~(the_carrier(X6)=powerset(X5)))|X6=boole_lattice(X5))|(~(strict_latt_str(X6))|~(latt_str(X6))))))),inference(distribute,[status(thm)],[226])).
% cnf(231,plain,(the_carrier(X1)=powerset(X2)|~latt_str(X1)|~strict_latt_str(X1)|X1!=boole_lattice(X2)),inference(split_conjunct,[status(thm)],[227])).
% cnf(232,plain,(apply_binary(the_L_meet(X1),X3,X4)=subset_intersection2(X2,X3,X4)|~latt_str(X1)|~strict_latt_str(X1)|X1!=boole_lattice(X2)|~element(X3,powerset(X2))|~element(X4,powerset(X2))),inference(split_conjunct,[status(thm)],[227])).
% cnf(233,plain,(apply_binary(the_L_join(X1),X3,X4)=subset_union2(X2,X3,X4)|~latt_str(X1)|~strict_latt_str(X1)|X1!=boole_lattice(X2)|~element(X3,powerset(X2))|~element(X4,powerset(X2))),inference(split_conjunct,[status(thm)],[227])).
% fof(248, plain,![X1]:((empty_carrier(X1)|~(one_sorted_str(X1)))|~(empty(the_carrier(X1)))),inference(fof_nnf,[status(thm)],[99])).
% fof(249, plain,![X2]:((empty_carrier(X2)|~(one_sorted_str(X2)))|~(empty(the_carrier(X2)))),inference(variable_rename,[status(thm)],[248])).
% cnf(250,plain,(empty_carrier(X1)|~empty(the_carrier(X1))|~one_sorted_str(X1)),inference(split_conjunct,[status(thm)],[249])).
% fof(253, plain,![X1]:(~(meet_semilatt_str(X1))|one_sorted_str(X1)),inference(fof_nnf,[status(thm)],[47])).
% fof(254, plain,![X2]:(~(meet_semilatt_str(X2))|one_sorted_str(X2)),inference(variable_rename,[status(thm)],[253])).
% cnf(255,plain,(one_sorted_str(X1)|~meet_semilatt_str(X1)),inference(split_conjunct,[status(thm)],[254])).
% fof(256, plain,![X1]:(~(join_semilatt_str(X1))|one_sorted_str(X1)),inference(fof_nnf,[status(thm)],[48])).
% fof(257, plain,![X2]:(~(join_semilatt_str(X2))|one_sorted_str(X2)),inference(variable_rename,[status(thm)],[256])).
% cnf(258,plain,(one_sorted_str(X1)|~join_semilatt_str(X1)),inference(split_conjunct,[status(thm)],[257])).
% fof(290, plain,![X1]:(~(meet_semilatt_str(X1))|((function(the_L_meet(X1))&quasi_total(the_L_meet(X1),cartesian_product2(the_carrier(X1),the_carrier(X1)),the_carrier(X1)))&relation_of2_as_subset(the_L_meet(X1),cartesian_product2(the_carrier(X1),the_carrier(X1)),the_carrier(X1)))),inference(fof_nnf,[status(thm)],[58])).
% fof(291, plain,![X2]:(~(meet_semilatt_str(X2))|((function(the_L_meet(X2))&quasi_total(the_L_meet(X2),cartesian_product2(the_carrier(X2),the_carrier(X2)),the_carrier(X2)))&relation_of2_as_subset(the_L_meet(X2),cartesian_product2(the_carrier(X2),the_carrier(X2)),the_carrier(X2)))),inference(variable_rename,[status(thm)],[290])).
% fof(292, plain,![X2]:(((function(the_L_meet(X2))|~(meet_semilatt_str(X2)))&(quasi_total(the_L_meet(X2),cartesian_product2(the_carrier(X2),the_carrier(X2)),the_carrier(X2))|~(meet_semilatt_str(X2))))&(relation_of2_as_subset(the_L_meet(X2),cartesian_product2(the_carrier(X2),the_carrier(X2)),the_carrier(X2))|~(meet_semilatt_str(X2)))),inference(distribute,[status(thm)],[291])).
% cnf(293,plain,(relation_of2_as_subset(the_L_meet(X1),cartesian_product2(the_carrier(X1),the_carrier(X1)),the_carrier(X1))|~meet_semilatt_str(X1)),inference(split_conjunct,[status(thm)],[292])).
% cnf(294,plain,(quasi_total(the_L_meet(X1),cartesian_product2(the_carrier(X1),the_carrier(X1)),the_carrier(X1))|~meet_semilatt_str(X1)),inference(split_conjunct,[status(thm)],[292])).
% cnf(295,plain,(function(the_L_meet(X1))|~meet_semilatt_str(X1)),inference(split_conjunct,[status(thm)],[292])).
% fof(296, plain,![X1]:(~(join_semilatt_str(X1))|((function(the_L_join(X1))&quasi_total(the_L_join(X1),cartesian_product2(the_carrier(X1),the_carrier(X1)),the_carrier(X1)))&relation_of2_as_subset(the_L_join(X1),cartesian_product2(the_carrier(X1),the_carrier(X1)),the_carrier(X1)))),inference(fof_nnf,[status(thm)],[59])).
% fof(297, plain,![X2]:(~(join_semilatt_str(X2))|((function(the_L_join(X2))&quasi_total(the_L_join(X2),cartesian_product2(the_carrier(X2),the_carrier(X2)),the_carrier(X2)))&relation_of2_as_subset(the_L_join(X2),cartesian_product2(the_carrier(X2),the_carrier(X2)),the_carrier(X2)))),inference(variable_rename,[status(thm)],[296])).
% fof(298, plain,![X2]:(((function(the_L_join(X2))|~(join_semilatt_str(X2)))&(quasi_total(the_L_join(X2),cartesian_product2(the_carrier(X2),the_carrier(X2)),the_carrier(X2))|~(join_semilatt_str(X2))))&(relation_of2_as_subset(the_L_join(X2),cartesian_product2(the_carrier(X2),the_carrier(X2)),the_carrier(X2))|~(join_semilatt_str(X2)))),inference(distribute,[status(thm)],[297])).
% cnf(299,plain,(relation_of2_as_subset(the_L_join(X1),cartesian_product2(the_carrier(X1),the_carrier(X1)),the_carrier(X1))|~join_semilatt_str(X1)),inference(split_conjunct,[status(thm)],[298])).
% cnf(300,plain,(quasi_total(the_L_join(X1),cartesian_product2(the_carrier(X1),the_carrier(X1)),the_carrier(X1))|~join_semilatt_str(X1)),inference(split_conjunct,[status(thm)],[298])).
% cnf(301,plain,(function(the_L_join(X1))|~join_semilatt_str(X1)),inference(split_conjunct,[status(thm)],[298])).
% fof(312, plain,![X1]:(~(latt_str(X1))|(meet_semilatt_str(X1)&join_semilatt_str(X1))),inference(fof_nnf,[status(thm)],[64])).
% fof(313, plain,![X2]:(~(latt_str(X2))|(meet_semilatt_str(X2)&join_semilatt_str(X2))),inference(variable_rename,[status(thm)],[312])).
% fof(314, plain,![X2]:((meet_semilatt_str(X2)|~(latt_str(X2)))&(join_semilatt_str(X2)|~(latt_str(X2)))),inference(distribute,[status(thm)],[313])).
% cnf(315,plain,(join_semilatt_str(X1)|~latt_str(X1)),inference(split_conjunct,[status(thm)],[314])).
% cnf(316,plain,(meet_semilatt_str(X1)|~latt_str(X1)),inference(split_conjunct,[status(thm)],[314])).
% fof(324, plain,![X1]:![X2]:![X3]:((~(relation_of2_as_subset(X3,X1,X2))|relation_of2(X3,X1,X2))&(~(relation_of2(X3,X1,X2))|relation_of2_as_subset(X3,X1,X2))),inference(fof_nnf,[status(thm)],[66])).
% fof(325, plain,![X4]:![X5]:![X6]:((~(relation_of2_as_subset(X6,X4,X5))|relation_of2(X6,X4,X5))&(~(relation_of2(X6,X4,X5))|relation_of2_as_subset(X6,X4,X5))),inference(variable_rename,[status(thm)],[324])).
% cnf(327,plain,(relation_of2(X1,X2,X3)|~relation_of2_as_subset(X1,X2,X3)),inference(split_conjunct,[status(thm)],[325])).
% fof(335, plain,![X1]:![X2]:![X3]:![X4]:![X5]:![X6]:(((((((empty(X1)|empty(X2))|~(function(X4)))|~(quasi_total(X4,cartesian_product2(X1,X2),X3)))|~(relation_of2(X4,cartesian_product2(X1,X2),X3)))|~(element(X5,X1)))|~(element(X6,X2)))|apply_binary_as_element(X1,X2,X3,X4,X5,X6)=apply_binary(X4,X5,X6)),inference(fof_nnf,[status(thm)],[107])).
% fof(336, plain,![X7]:![X8]:![X9]:![X10]:![X11]:![X12]:(((((((empty(X7)|empty(X8))|~(function(X10)))|~(quasi_total(X10,cartesian_product2(X7,X8),X9)))|~(relation_of2(X10,cartesian_product2(X7,X8),X9)))|~(element(X11,X7)))|~(element(X12,X8)))|apply_binary_as_element(X7,X8,X9,X10,X11,X12)=apply_binary(X10,X11,X12)),inference(variable_rename,[status(thm)],[335])).
% cnf(337,plain,(apply_binary_as_element(X1,X2,X3,X4,X5,X6)=apply_binary(X4,X5,X6)|empty(X2)|empty(X1)|~element(X6,X2)|~element(X5,X1)|~relation_of2(X4,cartesian_product2(X1,X2),X3)|~quasi_total(X4,cartesian_product2(X1,X2),X3)|~function(X4)),inference(split_conjunct,[status(thm)],[336])).
% fof(362, negated_conjecture,?[X1]:?[X2]:(element(X2,the_carrier(boole_lattice(X1)))&?[X3]:(element(X3,the_carrier(boole_lattice(X1)))&(~(join(boole_lattice(X1),X2,X3)=set_union2(X2,X3))|~(meet(boole_lattice(X1),X2,X3)=set_intersection2(X2,X3))))),inference(fof_nnf,[status(thm)],[87])).
% fof(363, negated_conjecture,?[X4]:?[X5]:(element(X5,the_carrier(boole_lattice(X4)))&?[X6]:(element(X6,the_carrier(boole_lattice(X4)))&(~(join(boole_lattice(X4),X5,X6)=set_union2(X5,X6))|~(meet(boole_lattice(X4),X5,X6)=set_intersection2(X5,X6))))),inference(variable_rename,[status(thm)],[362])).
% fof(364, negated_conjecture,(element(esk19_0,the_carrier(boole_lattice(esk18_0)))&(element(esk20_0,the_carrier(boole_lattice(esk18_0)))&(~(join(boole_lattice(esk18_0),esk19_0,esk20_0)=set_union2(esk19_0,esk20_0))|~(meet(boole_lattice(esk18_0),esk19_0,esk20_0)=set_intersection2(esk19_0,esk20_0))))),inference(skolemize,[status(esa)],[363])).
% cnf(365,negated_conjecture,(meet(boole_lattice(esk18_0),esk19_0,esk20_0)!=set_intersection2(esk19_0,esk20_0)|join(boole_lattice(esk18_0),esk19_0,esk20_0)!=set_union2(esk19_0,esk20_0)),inference(split_conjunct,[status(thm)],[364])).
% cnf(366,negated_conjecture,(element(esk20_0,the_carrier(boole_lattice(esk18_0)))),inference(split_conjunct,[status(thm)],[364])).
% cnf(367,negated_conjecture,(element(esk19_0,the_carrier(boole_lattice(esk18_0)))),inference(split_conjunct,[status(thm)],[364])).
% cnf(398,plain,(empty_carrier(X1)|~empty(the_carrier(X1))|~join_semilatt_str(X1)),inference(spm,[status(thm)],[250,258,theory(equality)])).
% cnf(399,plain,(empty_carrier(X1)|~empty(the_carrier(X1))|~meet_semilatt_str(X1)),inference(spm,[status(thm)],[250,255,theory(equality)])).
% cnf(405,plain,(powerset(X1)=the_carrier(boole_lattice(X1))|~strict_latt_str(boole_lattice(X1))|~latt_str(boole_lattice(X1))),inference(er,[status(thm)],[231,theory(equality)])).
% cnf(406,plain,(powerset(X1)=the_carrier(boole_lattice(X1))|$false|~latt_str(boole_lattice(X1))),inference(rw,[status(thm)],[405,190,theory(equality)])).
% cnf(407,plain,(powerset(X1)=the_carrier(boole_lattice(X1))|$false|$false),inference(rw,[status(thm)],[406,189,theory(equality)])).
% cnf(408,plain,(powerset(X1)=the_carrier(boole_lattice(X1))),inference(cn,[status(thm)],[407,theory(equality)])).
% cnf(427,plain,(relation_of2(the_L_join(X1),cartesian_product2(the_carrier(X1),the_carrier(X1)),the_carrier(X1))|~join_semilatt_str(X1)),inference(spm,[status(thm)],[327,299,theory(equality)])).
% cnf(429,plain,(relation_of2(the_L_meet(X1),cartesian_product2(the_carrier(X1),the_carrier(X1)),the_carrier(X1))|~meet_semilatt_str(X1)),inference(spm,[status(thm)],[327,293,theory(equality)])).
% cnf(478,plain,(apply_binary(the_L_join(boole_lattice(X1)),X2,X3)=subset_union2(X1,X2,X3)|~strict_latt_str(boole_lattice(X1))|~latt_str(boole_lattice(X1))|~element(X3,powerset(X1))|~element(X2,powerset(X1))),inference(er,[status(thm)],[233,theory(equality)])).
% cnf(479,plain,(apply_binary(the_L_join(boole_lattice(X1)),X2,X3)=subset_union2(X1,X2,X3)|$false|~latt_str(boole_lattice(X1))|~element(X3,powerset(X1))|~element(X2,powerset(X1))),inference(rw,[status(thm)],[478,190,theory(equality)])).
% cnf(480,plain,(apply_binary(the_L_join(boole_lattice(X1)),X2,X3)=subset_union2(X1,X2,X3)|$false|$false|~element(X3,powerset(X1))|~element(X2,powerset(X1))),inference(rw,[status(thm)],[479,189,theory(equality)])).
% cnf(481,plain,(apply_binary(the_L_join(boole_lattice(X1)),X2,X3)=subset_union2(X1,X2,X3)|~element(X3,powerset(X1))|~element(X2,powerset(X1))),inference(cn,[status(thm)],[480,theory(equality)])).
% cnf(482,plain,(apply_binary(the_L_meet(boole_lattice(X1)),X2,X3)=subset_intersection2(X1,X2,X3)|~strict_latt_str(boole_lattice(X1))|~latt_str(boole_lattice(X1))|~element(X3,powerset(X1))|~element(X2,powerset(X1))),inference(er,[status(thm)],[232,theory(equality)])).
% cnf(483,plain,(apply_binary(the_L_meet(boole_lattice(X1)),X2,X3)=subset_intersection2(X1,X2,X3)|$false|~latt_str(boole_lattice(X1))|~element(X3,powerset(X1))|~element(X2,powerset(X1))),inference(rw,[status(thm)],[482,190,theory(equality)])).
% cnf(484,plain,(apply_binary(the_L_meet(boole_lattice(X1)),X2,X3)=subset_intersection2(X1,X2,X3)|$false|$false|~element(X3,powerset(X1))|~element(X2,powerset(X1))),inference(rw,[status(thm)],[483,189,theory(equality)])).
% cnf(485,plain,(apply_binary(the_L_meet(boole_lattice(X1)),X2,X3)=subset_intersection2(X1,X2,X3)|~element(X3,powerset(X1))|~element(X2,powerset(X1))),inference(cn,[status(thm)],[484,theory(equality)])).
% cnf(502,plain,(apply_binary(the_L_join(X1),X2,X3)=join(X1,X2,X3)|empty_carrier(X1)|empty(the_carrier(X1))|~join_semilatt_str(X1)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1))|~quasi_total(the_L_join(X1),cartesian_product2(the_carrier(X1),the_carrier(X1)),the_carrier(X1))|~function(the_L_join(X1))|~relation_of2(the_L_join(X1),cartesian_product2(the_carrier(X1),the_carrier(X1)),the_carrier(X1))),inference(spm,[status(thm)],[166,337,theory(equality)])).
% cnf(503,plain,(apply_binary(the_L_meet(X1),X2,X3)=meet(X1,X2,X3)|empty_carrier(X1)|empty(the_carrier(X1))|~meet_semilatt_str(X1)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1))|~quasi_total(the_L_meet(X1),cartesian_product2(the_carrier(X1),the_carrier(X1)),the_carrier(X1))|~function(the_L_meet(X1))|~relation_of2(the_L_meet(X1),cartesian_product2(the_carrier(X1),the_carrier(X1)),the_carrier(X1))),inference(spm,[status(thm)],[170,337,theory(equality)])).
% cnf(521,negated_conjecture,(element(esk20_0,powerset(esk18_0))),inference(rw,[status(thm)],[366,408,theory(equality)])).
% cnf(522,negated_conjecture,(element(esk19_0,powerset(esk18_0))),inference(rw,[status(thm)],[367,408,theory(equality)])).
% cnf(2612,plain,(apply_binary(the_L_join(X1),X2,X3)=join(X1,X2,X3)|empty(the_carrier(X1))|empty_carrier(X1)|~quasi_total(the_L_join(X1),cartesian_product2(the_carrier(X1),the_carrier(X1)),the_carrier(X1))|~function(the_L_join(X1))|~join_semilatt_str(X1)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1))),inference(csr,[status(thm)],[502,427])).
% cnf(2613,plain,(apply_binary(the_L_join(X1),X2,X3)=join(X1,X2,X3)|empty(the_carrier(X1))|empty_carrier(X1)|~quasi_total(the_L_join(X1),cartesian_product2(the_carrier(X1),the_carrier(X1)),the_carrier(X1))|~join_semilatt_str(X1)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1))),inference(csr,[status(thm)],[2612,301])).
% cnf(2614,plain,(apply_binary(the_L_join(X1),X2,X3)=join(X1,X2,X3)|empty(the_carrier(X1))|empty_carrier(X1)|~join_semilatt_str(X1)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1))),inference(csr,[status(thm)],[2613,300])).
% cnf(2615,plain,(apply_binary(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))),inference(csr,[status(thm)],[2614,398])).
% cnf(2616,plain,(join(boole_lattice(X1),X2,X3)=subset_union2(X1,X2,X3)|empty_carrier(boole_lattice(X1))|~element(X3,powerset(X1))|~element(X2,powerset(X1))|~join_semilatt_str(boole_lattice(X1))|~element(X3,the_carrier(boole_lattice(X1)))|~element(X2,the_carrier(boole_lattice(X1)))),inference(spm,[status(thm)],[481,2615,theory(equality)])).
% cnf(2617,plain,(join(boole_lattice(X1),X2,X3)=subset_union2(X1,X2,X3)|empty_carrier(boole_lattice(X1))|~element(X3,powerset(X1))|~element(X2,powerset(X1))|~join_semilatt_str(boole_lattice(X1))|~element(X3,powerset(X1))|~element(X2,the_carrier(boole_lattice(X1)))),inference(rw,[status(thm)],[2616,408,theory(equality)])).
% cnf(2618,plain,(join(boole_lattice(X1),X2,X3)=subset_union2(X1,X2,X3)|empty_carrier(boole_lattice(X1))|~element(X3,powerset(X1))|~element(X2,powerset(X1))|~join_semilatt_str(boole_lattice(X1))|~element(X3,powerset(X1))|~element(X2,powerset(X1))),inference(rw,[status(thm)],[2617,408,theory(equality)])).
% cnf(2619,plain,(join(boole_lattice(X1),X2,X3)=subset_union2(X1,X2,X3)|empty_carrier(boole_lattice(X1))|~element(X3,powerset(X1))|~element(X2,powerset(X1))|~join_semilatt_str(boole_lattice(X1))),inference(cn,[status(thm)],[2618,theory(equality)])).
% cnf(2620,plain,(join(boole_lattice(X1),X2,X3)=subset_union2(X1,X2,X3)|~element(X3,powerset(X1))|~element(X2,powerset(X1))|~join_semilatt_str(boole_lattice(X1))),inference(sr,[status(thm)],[2619,193,theory(equality)])).
% cnf(2646,plain,(apply_binary(the_L_meet(X1),X2,X3)=meet(X1,X2,X3)|empty(the_carrier(X1))|empty_carrier(X1)|~quasi_total(the_L_meet(X1),cartesian_product2(the_carrier(X1),the_carrier(X1)),the_carrier(X1))|~function(the_L_meet(X1))|~meet_semilatt_str(X1)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1))),inference(csr,[status(thm)],[503,429])).
% cnf(2647,plain,(apply_binary(the_L_meet(X1),X2,X3)=meet(X1,X2,X3)|empty(the_carrier(X1))|empty_carrier(X1)|~quasi_total(the_L_meet(X1),cartesian_product2(the_carrier(X1),the_carrier(X1)),the_carrier(X1))|~meet_semilatt_str(X1)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1))),inference(csr,[status(thm)],[2646,295])).
% cnf(2648,plain,(apply_binary(the_L_meet(X1),X2,X3)=meet(X1,X2,X3)|empty(the_carrier(X1))|empty_carrier(X1)|~meet_semilatt_str(X1)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1))),inference(csr,[status(thm)],[2647,294])).
% cnf(2649,plain,(apply_binary(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))),inference(csr,[status(thm)],[2648,399])).
% cnf(2651,plain,(meet(boole_lattice(X1),X2,X3)=subset_intersection2(X1,X2,X3)|empty_carrier(boole_lattice(X1))|~element(X3,powerset(X1))|~element(X2,powerset(X1))|~meet_semilatt_str(boole_lattice(X1))|~element(X3,the_carrier(boole_lattice(X1)))|~element(X2,the_carrier(boole_lattice(X1)))),inference(spm,[status(thm)],[485,2649,theory(equality)])).
% cnf(2652,plain,(meet(boole_lattice(X1),X2,X3)=subset_intersection2(X1,X2,X3)|empty_carrier(boole_lattice(X1))|~element(X3,powerset(X1))|~element(X2,powerset(X1))|~meet_semilatt_str(boole_lattice(X1))|~element(X3,powerset(X1))|~element(X2,the_carrier(boole_lattice(X1)))),inference(rw,[status(thm)],[2651,408,theory(equality)])).
% cnf(2653,plain,(meet(boole_lattice(X1),X2,X3)=subset_intersection2(X1,X2,X3)|empty_carrier(boole_lattice(X1))|~element(X3,powerset(X1))|~element(X2,powerset(X1))|~meet_semilatt_str(boole_lattice(X1))|~element(X3,powerset(X1))|~element(X2,powerset(X1))),inference(rw,[status(thm)],[2652,408,theory(equality)])).
% cnf(2654,plain,(meet(boole_lattice(X1),X2,X3)=subset_intersection2(X1,X2,X3)|empty_carrier(boole_lattice(X1))|~element(X3,powerset(X1))|~element(X2,powerset(X1))|~meet_semilatt_str(boole_lattice(X1))),inference(cn,[status(thm)],[2653,theory(equality)])).
% cnf(2655,plain,(meet(boole_lattice(X1),X2,X3)=subset_intersection2(X1,X2,X3)|~element(X3,powerset(X1))|~element(X2,powerset(X1))|~meet_semilatt_str(boole_lattice(X1))),inference(sr,[status(thm)],[2654,193,theory(equality)])).
% cnf(25562,negated_conjecture,(join(boole_lattice(esk18_0),esk19_0,esk20_0)!=set_union2(esk19_0,esk20_0)|subset_intersection2(esk18_0,esk19_0,esk20_0)!=set_intersection2(esk19_0,esk20_0)|~meet_semilatt_str(boole_lattice(esk18_0))|~element(esk20_0,powerset(esk18_0))|~element(esk19_0,powerset(esk18_0))),inference(spm,[status(thm)],[365,2655,theory(equality)])).
% cnf(25576,negated_conjecture,(join(boole_lattice(esk18_0),esk19_0,esk20_0)!=set_union2(esk19_0,esk20_0)|subset_intersection2(esk18_0,esk19_0,esk20_0)!=set_intersection2(esk19_0,esk20_0)|~meet_semilatt_str(boole_lattice(esk18_0))|$false|~element(esk19_0,powerset(esk18_0))),inference(rw,[status(thm)],[25562,521,theory(equality)])).
% cnf(25577,negated_conjecture,(join(boole_lattice(esk18_0),esk19_0,esk20_0)!=set_union2(esk19_0,esk20_0)|subset_intersection2(esk18_0,esk19_0,esk20_0)!=set_intersection2(esk19_0,esk20_0)|~meet_semilatt_str(boole_lattice(esk18_0))|$false|$false),inference(rw,[status(thm)],[25576,522,theory(equality)])).
% cnf(25578,negated_conjecture,(join(boole_lattice(esk18_0),esk19_0,esk20_0)!=set_union2(esk19_0,esk20_0)|subset_intersection2(esk18_0,esk19_0,esk20_0)!=set_intersection2(esk19_0,esk20_0)|~meet_semilatt_str(boole_lattice(esk18_0))),inference(cn,[status(thm)],[25577,theory(equality)])).
% cnf(25579,negated_conjecture,(subset_union2(esk18_0,esk19_0,esk20_0)!=set_union2(esk19_0,esk20_0)|set_intersection2(esk19_0,esk20_0)!=subset_intersection2(esk18_0,esk19_0,esk20_0)|~meet_semilatt_str(boole_lattice(esk18_0))|~join_semilatt_str(boole_lattice(esk18_0))|~element(esk20_0,powerset(esk18_0))|~element(esk19_0,powerset(esk18_0))),inference(spm,[status(thm)],[25578,2620,theory(equality)])).
% cnf(25580,negated_conjecture,(subset_union2(esk18_0,esk19_0,esk20_0)!=set_union2(esk19_0,esk20_0)|set_intersection2(esk19_0,esk20_0)!=subset_intersection2(esk18_0,esk19_0,esk20_0)|~meet_semilatt_str(boole_lattice(esk18_0))|~join_semilatt_str(boole_lattice(esk18_0))|$false|~element(esk19_0,powerset(esk18_0))),inference(rw,[status(thm)],[25579,521,theory(equality)])).
% cnf(25581,negated_conjecture,(subset_union2(esk18_0,esk19_0,esk20_0)!=set_union2(esk19_0,esk20_0)|set_intersection2(esk19_0,esk20_0)!=subset_intersection2(esk18_0,esk19_0,esk20_0)|~meet_semilatt_str(boole_lattice(esk18_0))|~join_semilatt_str(boole_lattice(esk18_0))|$false|$false),inference(rw,[status(thm)],[25580,522,theory(equality)])).
% cnf(25582,negated_conjecture,(subset_union2(esk18_0,esk19_0,esk20_0)!=set_union2(esk19_0,esk20_0)|set_intersection2(esk19_0,esk20_0)!=subset_intersection2(esk18_0,esk19_0,esk20_0)|~meet_semilatt_str(boole_lattice(esk18_0))|~join_semilatt_str(boole_lattice(esk18_0))),inference(cn,[status(thm)],[25581,theory(equality)])).
% cnf(25585,negated_conjecture,(subset_union2(esk18_0,esk19_0,esk20_0)!=set_union2(esk19_0,esk20_0)|set_intersection2(esk19_0,esk20_0)!=subset_intersection2(esk18_0,esk19_0,esk20_0)|~join_semilatt_str(boole_lattice(esk18_0))|~latt_str(boole_lattice(esk18_0))),inference(spm,[status(thm)],[25582,316,theory(equality)])).
% cnf(25586,negated_conjecture,(subset_union2(esk18_0,esk19_0,esk20_0)!=set_union2(esk19_0,esk20_0)|set_intersection2(esk19_0,esk20_0)!=subset_intersection2(esk18_0,esk19_0,esk20_0)|~join_semilatt_str(boole_lattice(esk18_0))|$false),inference(rw,[status(thm)],[25585,189,theory(equality)])).
% cnf(25587,negated_conjecture,(subset_union2(esk18_0,esk19_0,esk20_0)!=set_union2(esk19_0,esk20_0)|set_intersection2(esk19_0,esk20_0)!=subset_intersection2(esk18_0,esk19_0,esk20_0)|~join_semilatt_str(boole_lattice(esk18_0))),inference(cn,[status(thm)],[25586,theory(equality)])).
% cnf(25588,negated_conjecture,(subset_union2(esk18_0,esk19_0,esk20_0)!=set_union2(esk19_0,esk20_0)|set_intersection2(esk19_0,esk20_0)!=subset_intersection2(esk18_0,esk19_0,esk20_0)|~latt_str(boole_lattice(esk18_0))),inference(spm,[status(thm)],[25587,315,theory(equality)])).
% cnf(25589,negated_conjecture,(subset_union2(esk18_0,esk19_0,esk20_0)!=set_union2(esk19_0,esk20_0)|set_intersection2(esk19_0,esk20_0)!=subset_intersection2(esk18_0,esk19_0,esk20_0)|$false),inference(rw,[status(thm)],[25588,189,theory(equality)])).
% cnf(25590,negated_conjecture,(subset_union2(esk18_0,esk19_0,esk20_0)!=set_union2(esk19_0,esk20_0)|set_intersection2(esk19_0,esk20_0)!=subset_intersection2(esk18_0,esk19_0,esk20_0)),inference(cn,[status(thm)],[25589,theory(equality)])).
% cnf(25592,negated_conjecture,(subset_union2(esk18_0,esk19_0,esk20_0)!=set_union2(esk19_0,esk20_0)|subset_intersection2(X1,esk19_0,esk20_0)!=subset_intersection2(esk18_0,esk19_0,esk20_0)|~element(esk20_0,powerset(X1))|~element(esk19_0,powerset(X1))),inference(spm,[status(thm)],[25590,135,theory(equality)])).
% cnf(36063,negated_conjecture,(subset_union2(esk18_0,esk19_0,esk20_0)!=set_union2(esk19_0,esk20_0)|~element(esk20_0,powerset(esk18_0))|~element(esk19_0,powerset(esk18_0))),inference(er,[status(thm)],[25592,theory(equality)])).
% cnf(36074,negated_conjecture,(subset_union2(esk18_0,esk19_0,esk20_0)!=set_union2(esk19_0,esk20_0)|$false|~element(esk19_0,powerset(esk18_0))),inference(rw,[status(thm)],[36063,521,theory(equality)])).
% cnf(36075,negated_conjecture,(subset_union2(esk18_0,esk19_0,esk20_0)!=set_union2(esk19_0,esk20_0)|$false|$false),inference(rw,[status(thm)],[36074,522,theory(equality)])).
% cnf(36076,negated_conjecture,(subset_union2(esk18_0,esk19_0,esk20_0)!=set_union2(esk19_0,esk20_0)),inference(cn,[status(thm)],[36075,theory(equality)])).
% cnf(36090,negated_conjecture,(~element(esk20_0,powerset(esk18_0))|~element(esk19_0,powerset(esk18_0))),inference(spm,[status(thm)],[36076,132,theory(equality)])).
% cnf(36092,negated_conjecture,($false|~element(esk19_0,powerset(esk18_0))),inference(rw,[status(thm)],[36090,521,theory(equality)])).
% cnf(36093,negated_conjecture,($false|$false),inference(rw,[status(thm)],[36092,522,theory(equality)])).
% cnf(36094,negated_conjecture,($false),inference(cn,[status(thm)],[36093,theory(equality)])).
% cnf(36095,negated_conjecture,($false),36094,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 7708
% # ...of these trivial : 5
% # ...subsumed : 6321
% # ...remaining for further processing: 1382
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 108
% # Backward-rewritten : 16
% # Generated clauses : 19907
% # ...of the previous two non-trivial : 17816
% # Contextual simplify-reflections : 7116
% # Paramodulations : 19876
% # Factorizations : 0
% # Equation resolutions : 16
% # Current number of processed clauses: 1253
% # Positive orientable unit clauses: 59
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 23
% # Non-unit-clauses : 1168
% # Current number of unprocessed clauses: 9625
% # ...number of literals in the above : 46939
% # Clause-clause subsumption calls (NU) : 404660
% # Rec. Clause-clause subsumption calls : 273827
% # Unit Clause-clause subsumption calls : 2955
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 299
% # Indexed BW rewrite successes : 23
% # Backwards rewriting index: 717 leaves, 2.27+/-4.537 terms/leaf
% # Paramod-from index: 268 leaves, 2.22+/-3.343 terms/leaf
% # Paramod-into index: 599 leaves, 2.15+/-4.486 terms/leaf
% # -------------------------------------------------
% # User time : 1.480 s
% # System time : 0.029 s
% # Total time : 1.509 s
% # Maximum resident set size: 0 pages
% PrfWatch: 2.03 CPU 2.14 WC
% FINAL PrfWatch: 2.03 CPU 2.14 WC
% SZS output end Solution for /tmp/SystemOnTPTP25857/SEU343+1.tptp
%
%------------------------------------------------------------------------------