TSTP Solution File: SEU342+1 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SEU342+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 : art05.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:48:41 EST 2010

% Result   : Theorem 2.34s
% Output   : Solution 2.34s
% 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/SystemOnTPTP8982/SEU342+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP8982/SEU342+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP8982/SEU342+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 9078
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time     : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(5, axiom,![X1]:![X2]:(((~(empty_carrier(X2))&lattice(X2))&latt_str(X2))=>(in(X1,a_1_0_filter_1(X2))<=>?[X3]:?[X4]:(((element(X3,the_carrier(X2))&element(X4,the_carrier(X2)))&X1=ordered_pair_as_product_element(the_carrier(X2),the_carrier(X2),X3,X4))&below_refl(X2,X3,X4)))),file('/tmp/SRASS.s.p', fraenkel_a_1_0_filter_1)).
% fof(8, axiom,![X1]:(((~(empty_carrier(X1))&lattice(X1))&latt_str(X1))=>relation_of_lattice(X1)=a_1_0_filter_1(X1)),file('/tmp/SRASS.s.p', d8_filter_1)).
% fof(12, axiom,![X1]:((~(empty_carrier(X1))&one_sorted_str(X1))=>~(empty(the_carrier(X1)))),file('/tmp/SRASS.s.p', fc1_struct_0)).
% fof(20, axiom,![X1]:![X2]:![X3]:![X4]:((((~(empty(X1))&~(empty(X2)))&element(X3,X1))&element(X4,X2))=>ordered_pair_as_product_element(X1,X2,X3,X4)=ordered_pair(X3,X4)),file('/tmp/SRASS.s.p', redefinition_k1_domain_1)).
% fof(23, axiom,![X1]:(latt_str(X1)=>(meet_semilatt_str(X1)&join_semilatt_str(X1))),file('/tmp/SRASS.s.p', dt_l3_lattices)).
% fof(28, axiom,![X1]:![X2]:ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1)),file('/tmp/SRASS.s.p', d5_tarski)).
% fof(29, axiom,![X1]:(meet_semilatt_str(X1)=>one_sorted_str(X1)),file('/tmp/SRASS.s.p', dt_l1_lattices)).
% fof(31, axiom,![X1]:![X2]:unordered_pair(X1,X2)=unordered_pair(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_tarski)).
% fof(32, axiom,![X1]:![X2]:![X3]:![X4]:(ordered_pair(X1,X2)=ordered_pair(X3,X4)=>(X1=X3&X2=X4)),file('/tmp/SRASS.s.p', t33_zfmisc_1)).
% fof(44, conjecture,![X1]:(((~(empty_carrier(X1))&lattice(X1))&latt_str(X1))=>![X2]:(element(X2,the_carrier(X1))=>![X3]:(element(X3,the_carrier(X1))=>(in(ordered_pair_as_product_element(the_carrier(X1),the_carrier(X1),X2,X3),relation_of_lattice(X1))<=>below_refl(X1,X2,X3))))),file('/tmp/SRASS.s.p', t32_filter_1)).
% fof(45, negated_conjecture,~(![X1]:(((~(empty_carrier(X1))&lattice(X1))&latt_str(X1))=>![X2]:(element(X2,the_carrier(X1))=>![X3]:(element(X3,the_carrier(X1))=>(in(ordered_pair_as_product_element(the_carrier(X1),the_carrier(X1),X2,X3),relation_of_lattice(X1))<=>below_refl(X1,X2,X3)))))),inference(assume_negation,[status(cth)],[44])).
% fof(47, plain,![X1]:![X2]:(((~(empty_carrier(X2))&lattice(X2))&latt_str(X2))=>(in(X1,a_1_0_filter_1(X2))<=>?[X3]:?[X4]:(((element(X3,the_carrier(X2))&element(X4,the_carrier(X2)))&X1=ordered_pair_as_product_element(the_carrier(X2),the_carrier(X2),X3,X4))&below_refl(X2,X3,X4)))),inference(fof_simplification,[status(thm)],[5,theory(equality)])).
% fof(49, plain,![X1]:(((~(empty_carrier(X1))&lattice(X1))&latt_str(X1))=>relation_of_lattice(X1)=a_1_0_filter_1(X1)),inference(fof_simplification,[status(thm)],[8,theory(equality)])).
% fof(52, plain,![X1]:((~(empty_carrier(X1))&one_sorted_str(X1))=>~(empty(the_carrier(X1)))),inference(fof_simplification,[status(thm)],[12,theory(equality)])).
% fof(57, plain,![X1]:![X2]:![X3]:![X4]:((((~(empty(X1))&~(empty(X2)))&element(X3,X1))&element(X4,X2))=>ordered_pair_as_product_element(X1,X2,X3,X4)=ordered_pair(X3,X4)),inference(fof_simplification,[status(thm)],[20,theory(equality)])).
% fof(62, negated_conjecture,~(![X1]:(((~(empty_carrier(X1))&lattice(X1))&latt_str(X1))=>![X2]:(element(X2,the_carrier(X1))=>![X3]:(element(X3,the_carrier(X1))=>(in(ordered_pair_as_product_element(the_carrier(X1),the_carrier(X1),X2,X3),relation_of_lattice(X1))<=>below_refl(X1,X2,X3)))))),inference(fof_simplification,[status(thm)],[45,theory(equality)])).
% fof(75, plain,![X1]:![X2]:(((empty_carrier(X2)|~(lattice(X2)))|~(latt_str(X2)))|((~(in(X1,a_1_0_filter_1(X2)))|?[X3]:?[X4]:(((element(X3,the_carrier(X2))&element(X4,the_carrier(X2)))&X1=ordered_pair_as_product_element(the_carrier(X2),the_carrier(X2),X3,X4))&below_refl(X2,X3,X4)))&(![X3]:![X4]:(((~(element(X3,the_carrier(X2)))|~(element(X4,the_carrier(X2))))|~(X1=ordered_pair_as_product_element(the_carrier(X2),the_carrier(X2),X3,X4)))|~(below_refl(X2,X3,X4)))|in(X1,a_1_0_filter_1(X2))))),inference(fof_nnf,[status(thm)],[47])).
% fof(76, plain,![X5]:![X6]:(((empty_carrier(X6)|~(lattice(X6)))|~(latt_str(X6)))|((~(in(X5,a_1_0_filter_1(X6)))|?[X7]:?[X8]:(((element(X7,the_carrier(X6))&element(X8,the_carrier(X6)))&X5=ordered_pair_as_product_element(the_carrier(X6),the_carrier(X6),X7,X8))&below_refl(X6,X7,X8)))&(![X9]:![X10]:(((~(element(X9,the_carrier(X6)))|~(element(X10,the_carrier(X6))))|~(X5=ordered_pair_as_product_element(the_carrier(X6),the_carrier(X6),X9,X10)))|~(below_refl(X6,X9,X10)))|in(X5,a_1_0_filter_1(X6))))),inference(variable_rename,[status(thm)],[75])).
% fof(77, plain,![X5]:![X6]:(((empty_carrier(X6)|~(lattice(X6)))|~(latt_str(X6)))|((~(in(X5,a_1_0_filter_1(X6)))|(((element(esk3_2(X5,X6),the_carrier(X6))&element(esk4_2(X5,X6),the_carrier(X6)))&X5=ordered_pair_as_product_element(the_carrier(X6),the_carrier(X6),esk3_2(X5,X6),esk4_2(X5,X6)))&below_refl(X6,esk3_2(X5,X6),esk4_2(X5,X6))))&(![X9]:![X10]:(((~(element(X9,the_carrier(X6)))|~(element(X10,the_carrier(X6))))|~(X5=ordered_pair_as_product_element(the_carrier(X6),the_carrier(X6),X9,X10)))|~(below_refl(X6,X9,X10)))|in(X5,a_1_0_filter_1(X6))))),inference(skolemize,[status(esa)],[76])).
% fof(78, plain,![X5]:![X6]:![X9]:![X10]:((((((~(element(X9,the_carrier(X6)))|~(element(X10,the_carrier(X6))))|~(X5=ordered_pair_as_product_element(the_carrier(X6),the_carrier(X6),X9,X10)))|~(below_refl(X6,X9,X10)))|in(X5,a_1_0_filter_1(X6)))&(~(in(X5,a_1_0_filter_1(X6)))|(((element(esk3_2(X5,X6),the_carrier(X6))&element(esk4_2(X5,X6),the_carrier(X6)))&X5=ordered_pair_as_product_element(the_carrier(X6),the_carrier(X6),esk3_2(X5,X6),esk4_2(X5,X6)))&below_refl(X6,esk3_2(X5,X6),esk4_2(X5,X6)))))|((empty_carrier(X6)|~(lattice(X6)))|~(latt_str(X6)))),inference(shift_quantors,[status(thm)],[77])).
% fof(79, plain,![X5]:![X6]:![X9]:![X10]:((((((~(element(X9,the_carrier(X6)))|~(element(X10,the_carrier(X6))))|~(X5=ordered_pair_as_product_element(the_carrier(X6),the_carrier(X6),X9,X10)))|~(below_refl(X6,X9,X10)))|in(X5,a_1_0_filter_1(X6)))|((empty_carrier(X6)|~(lattice(X6)))|~(latt_str(X6))))&(((((element(esk3_2(X5,X6),the_carrier(X6))|~(in(X5,a_1_0_filter_1(X6))))|((empty_carrier(X6)|~(lattice(X6)))|~(latt_str(X6))))&((element(esk4_2(X5,X6),the_carrier(X6))|~(in(X5,a_1_0_filter_1(X6))))|((empty_carrier(X6)|~(lattice(X6)))|~(latt_str(X6)))))&((X5=ordered_pair_as_product_element(the_carrier(X6),the_carrier(X6),esk3_2(X5,X6),esk4_2(X5,X6))|~(in(X5,a_1_0_filter_1(X6))))|((empty_carrier(X6)|~(lattice(X6)))|~(latt_str(X6)))))&((below_refl(X6,esk3_2(X5,X6),esk4_2(X5,X6))|~(in(X5,a_1_0_filter_1(X6))))|((empty_carrier(X6)|~(lattice(X6)))|~(latt_str(X6)))))),inference(distribute,[status(thm)],[78])).
% cnf(80,plain,(empty_carrier(X1)|below_refl(X1,esk3_2(X2,X1),esk4_2(X2,X1))|~latt_str(X1)|~lattice(X1)|~in(X2,a_1_0_filter_1(X1))),inference(split_conjunct,[status(thm)],[79])).
% cnf(81,plain,(empty_carrier(X1)|X2=ordered_pair_as_product_element(the_carrier(X1),the_carrier(X1),esk3_2(X2,X1),esk4_2(X2,X1))|~latt_str(X1)|~lattice(X1)|~in(X2,a_1_0_filter_1(X1))),inference(split_conjunct,[status(thm)],[79])).
% cnf(82,plain,(empty_carrier(X1)|element(esk4_2(X2,X1),the_carrier(X1))|~latt_str(X1)|~lattice(X1)|~in(X2,a_1_0_filter_1(X1))),inference(split_conjunct,[status(thm)],[79])).
% cnf(83,plain,(empty_carrier(X1)|element(esk3_2(X2,X1),the_carrier(X1))|~latt_str(X1)|~lattice(X1)|~in(X2,a_1_0_filter_1(X1))),inference(split_conjunct,[status(thm)],[79])).
% cnf(84,plain,(empty_carrier(X1)|in(X2,a_1_0_filter_1(X1))|~latt_str(X1)|~lattice(X1)|~below_refl(X1,X3,X4)|X2!=ordered_pair_as_product_element(the_carrier(X1),the_carrier(X1),X3,X4)|~element(X4,the_carrier(X1))|~element(X3,the_carrier(X1))),inference(split_conjunct,[status(thm)],[79])).
% fof(91, plain,![X1]:(((empty_carrier(X1)|~(lattice(X1)))|~(latt_str(X1)))|relation_of_lattice(X1)=a_1_0_filter_1(X1)),inference(fof_nnf,[status(thm)],[49])).
% fof(92, plain,![X2]:(((empty_carrier(X2)|~(lattice(X2)))|~(latt_str(X2)))|relation_of_lattice(X2)=a_1_0_filter_1(X2)),inference(variable_rename,[status(thm)],[91])).
% cnf(93,plain,(relation_of_lattice(X1)=a_1_0_filter_1(X1)|empty_carrier(X1)|~latt_str(X1)|~lattice(X1)),inference(split_conjunct,[status(thm)],[92])).
% fof(105, plain,![X1]:((empty_carrier(X1)|~(one_sorted_str(X1)))|~(empty(the_carrier(X1)))),inference(fof_nnf,[status(thm)],[52])).
% fof(106, plain,![X2]:((empty_carrier(X2)|~(one_sorted_str(X2)))|~(empty(the_carrier(X2)))),inference(variable_rename,[status(thm)],[105])).
% cnf(107,plain,(empty_carrier(X1)|~empty(the_carrier(X1))|~one_sorted_str(X1)),inference(split_conjunct,[status(thm)],[106])).
% fof(133, plain,![X1]:![X2]:![X3]:![X4]:((((empty(X1)|empty(X2))|~(element(X3,X1)))|~(element(X4,X2)))|ordered_pair_as_product_element(X1,X2,X3,X4)=ordered_pair(X3,X4)),inference(fof_nnf,[status(thm)],[57])).
% fof(134, plain,![X5]:![X6]:![X7]:![X8]:((((empty(X5)|empty(X6))|~(element(X7,X5)))|~(element(X8,X6)))|ordered_pair_as_product_element(X5,X6,X7,X8)=ordered_pair(X7,X8)),inference(variable_rename,[status(thm)],[133])).
% cnf(135,plain,(ordered_pair_as_product_element(X1,X2,X3,X4)=ordered_pair(X3,X4)|empty(X2)|empty(X1)|~element(X4,X2)|~element(X3,X1)),inference(split_conjunct,[status(thm)],[134])).
% fof(142, plain,![X1]:(~(latt_str(X1))|(meet_semilatt_str(X1)&join_semilatt_str(X1))),inference(fof_nnf,[status(thm)],[23])).
% fof(143, plain,![X2]:(~(latt_str(X2))|(meet_semilatt_str(X2)&join_semilatt_str(X2))),inference(variable_rename,[status(thm)],[142])).
% fof(144, plain,![X2]:((meet_semilatt_str(X2)|~(latt_str(X2)))&(join_semilatt_str(X2)|~(latt_str(X2)))),inference(distribute,[status(thm)],[143])).
% cnf(146,plain,(meet_semilatt_str(X1)|~latt_str(X1)),inference(split_conjunct,[status(thm)],[144])).
% fof(168, plain,![X3]:![X4]:ordered_pair(X3,X4)=unordered_pair(unordered_pair(X3,X4),singleton(X3)),inference(variable_rename,[status(thm)],[28])).
% cnf(169,plain,(ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1))),inference(split_conjunct,[status(thm)],[168])).
% fof(170, plain,![X1]:(~(meet_semilatt_str(X1))|one_sorted_str(X1)),inference(fof_nnf,[status(thm)],[29])).
% fof(171, plain,![X2]:(~(meet_semilatt_str(X2))|one_sorted_str(X2)),inference(variable_rename,[status(thm)],[170])).
% cnf(172,plain,(one_sorted_str(X1)|~meet_semilatt_str(X1)),inference(split_conjunct,[status(thm)],[171])).
% fof(176, plain,![X3]:![X4]:unordered_pair(X3,X4)=unordered_pair(X4,X3),inference(variable_rename,[status(thm)],[31])).
% cnf(177,plain,(unordered_pair(X1,X2)=unordered_pair(X2,X1)),inference(split_conjunct,[status(thm)],[176])).
% fof(178, plain,![X1]:![X2]:![X3]:![X4]:(~(ordered_pair(X1,X2)=ordered_pair(X3,X4))|(X1=X3&X2=X4)),inference(fof_nnf,[status(thm)],[32])).
% fof(179, plain,![X5]:![X6]:![X7]:![X8]:(~(ordered_pair(X5,X6)=ordered_pair(X7,X8))|(X5=X7&X6=X8)),inference(variable_rename,[status(thm)],[178])).
% fof(180, plain,![X5]:![X6]:![X7]:![X8]:((X5=X7|~(ordered_pair(X5,X6)=ordered_pair(X7,X8)))&(X6=X8|~(ordered_pair(X5,X6)=ordered_pair(X7,X8)))),inference(distribute,[status(thm)],[179])).
% cnf(181,plain,(X2=X4|ordered_pair(X1,X2)!=ordered_pair(X3,X4)),inference(split_conjunct,[status(thm)],[180])).
% cnf(182,plain,(X1=X3|ordered_pair(X1,X2)!=ordered_pair(X3,X4)),inference(split_conjunct,[status(thm)],[180])).
% fof(196, negated_conjecture,?[X1]:(((~(empty_carrier(X1))&lattice(X1))&latt_str(X1))&?[X2]:(element(X2,the_carrier(X1))&?[X3]:(element(X3,the_carrier(X1))&((~(in(ordered_pair_as_product_element(the_carrier(X1),the_carrier(X1),X2,X3),relation_of_lattice(X1)))|~(below_refl(X1,X2,X3)))&(in(ordered_pair_as_product_element(the_carrier(X1),the_carrier(X1),X2,X3),relation_of_lattice(X1))|below_refl(X1,X2,X3)))))),inference(fof_nnf,[status(thm)],[62])).
% fof(197, negated_conjecture,?[X4]:(((~(empty_carrier(X4))&lattice(X4))&latt_str(X4))&?[X5]:(element(X5,the_carrier(X4))&?[X6]:(element(X6,the_carrier(X4))&((~(in(ordered_pair_as_product_element(the_carrier(X4),the_carrier(X4),X5,X6),relation_of_lattice(X4)))|~(below_refl(X4,X5,X6)))&(in(ordered_pair_as_product_element(the_carrier(X4),the_carrier(X4),X5,X6),relation_of_lattice(X4))|below_refl(X4,X5,X6)))))),inference(variable_rename,[status(thm)],[196])).
% fof(198, negated_conjecture,(((~(empty_carrier(esk12_0))&lattice(esk12_0))&latt_str(esk12_0))&(element(esk13_0,the_carrier(esk12_0))&(element(esk14_0,the_carrier(esk12_0))&((~(in(ordered_pair_as_product_element(the_carrier(esk12_0),the_carrier(esk12_0),esk13_0,esk14_0),relation_of_lattice(esk12_0)))|~(below_refl(esk12_0,esk13_0,esk14_0)))&(in(ordered_pair_as_product_element(the_carrier(esk12_0),the_carrier(esk12_0),esk13_0,esk14_0),relation_of_lattice(esk12_0))|below_refl(esk12_0,esk13_0,esk14_0)))))),inference(skolemize,[status(esa)],[197])).
% cnf(199,negated_conjecture,(below_refl(esk12_0,esk13_0,esk14_0)|in(ordered_pair_as_product_element(the_carrier(esk12_0),the_carrier(esk12_0),esk13_0,esk14_0),relation_of_lattice(esk12_0))),inference(split_conjunct,[status(thm)],[198])).
% cnf(200,negated_conjecture,(~below_refl(esk12_0,esk13_0,esk14_0)|~in(ordered_pair_as_product_element(the_carrier(esk12_0),the_carrier(esk12_0),esk13_0,esk14_0),relation_of_lattice(esk12_0))),inference(split_conjunct,[status(thm)],[198])).
% cnf(201,negated_conjecture,(element(esk14_0,the_carrier(esk12_0))),inference(split_conjunct,[status(thm)],[198])).
% cnf(202,negated_conjecture,(element(esk13_0,the_carrier(esk12_0))),inference(split_conjunct,[status(thm)],[198])).
% cnf(203,negated_conjecture,(latt_str(esk12_0)),inference(split_conjunct,[status(thm)],[198])).
% cnf(204,negated_conjecture,(lattice(esk12_0)),inference(split_conjunct,[status(thm)],[198])).
% cnf(205,negated_conjecture,(~empty_carrier(esk12_0)),inference(split_conjunct,[status(thm)],[198])).
% cnf(206,plain,(X2=X4|unordered_pair(unordered_pair(X1,X2),singleton(X1))!=unordered_pair(unordered_pair(X3,X4),singleton(X3))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[181,169,theory(equality)]),169,theory(equality)]),['unfolding']).
% cnf(207,plain,(X1=X3|unordered_pair(unordered_pair(X1,X2),singleton(X1))!=unordered_pair(unordered_pair(X3,X4),singleton(X3))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[182,169,theory(equality)]),169,theory(equality)]),['unfolding']).
% cnf(208,plain,(ordered_pair_as_product_element(X1,X2,X3,X4)=unordered_pair(unordered_pair(X3,X4),singleton(X3))|empty(X2)|empty(X1)|~element(X4,X2)|~element(X3,X1)),inference(rw,[status(thm)],[135,169,theory(equality)]),['unfolding']).
% cnf(210,plain,(one_sorted_str(X1)|~latt_str(X1)),inference(spm,[status(thm)],[172,146,theory(equality)])).
% cnf(233,negated_conjecture,(empty_carrier(esk12_0)|~below_refl(esk12_0,esk13_0,esk14_0)|~in(ordered_pair_as_product_element(the_carrier(esk12_0),the_carrier(esk12_0),esk13_0,esk14_0),a_1_0_filter_1(esk12_0))|~lattice(esk12_0)|~latt_str(esk12_0)),inference(spm,[status(thm)],[200,93,theory(equality)])).
% cnf(236,negated_conjecture,(empty_carrier(esk12_0)|~below_refl(esk12_0,esk13_0,esk14_0)|~in(ordered_pair_as_product_element(the_carrier(esk12_0),the_carrier(esk12_0),esk13_0,esk14_0),a_1_0_filter_1(esk12_0))|$false|~latt_str(esk12_0)),inference(rw,[status(thm)],[233,204,theory(equality)])).
% cnf(237,negated_conjecture,(empty_carrier(esk12_0)|~below_refl(esk12_0,esk13_0,esk14_0)|~in(ordered_pair_as_product_element(the_carrier(esk12_0),the_carrier(esk12_0),esk13_0,esk14_0),a_1_0_filter_1(esk12_0))|$false|$false),inference(rw,[status(thm)],[236,203,theory(equality)])).
% cnf(238,negated_conjecture,(empty_carrier(esk12_0)|~below_refl(esk12_0,esk13_0,esk14_0)|~in(ordered_pair_as_product_element(the_carrier(esk12_0),the_carrier(esk12_0),esk13_0,esk14_0),a_1_0_filter_1(esk12_0))),inference(cn,[status(thm)],[237,theory(equality)])).
% cnf(239,negated_conjecture,(~below_refl(esk12_0,esk13_0,esk14_0)|~in(ordered_pair_as_product_element(the_carrier(esk12_0),the_carrier(esk12_0),esk13_0,esk14_0),a_1_0_filter_1(esk12_0))),inference(sr,[status(thm)],[238,205,theory(equality)])).
% cnf(253,plain,(X1=X2|unordered_pair(unordered_pair(X3,X1),singleton(X3))!=unordered_pair(singleton(X4),unordered_pair(X4,X2))),inference(spm,[status(thm)],[206,177,theory(equality)])).
% cnf(262,plain,(X1=X2|unordered_pair(unordered_pair(X1,X3),singleton(X1))!=unordered_pair(singleton(X2),unordered_pair(X2,X4))),inference(spm,[status(thm)],[207,177,theory(equality)])).
% cnf(281,plain,(unordered_pair(unordered_pair(esk3_2(X2,X1),esk4_2(X2,X1)),singleton(esk3_2(X2,X1)))=X2|empty_carrier(X1)|empty(the_carrier(X1))|~lattice(X1)|~latt_str(X1)|~in(X2,a_1_0_filter_1(X1))|~element(esk4_2(X2,X1),the_carrier(X1))|~element(esk3_2(X2,X1),the_carrier(X1))),inference(spm,[status(thm)],[81,208,theory(equality)])).
% cnf(283,plain,(ordered_pair_as_product_element(X3,X4,X1,X2)=unordered_pair(singleton(X1),unordered_pair(X1,X2))|empty(X4)|empty(X3)|~element(X2,X4)|~element(X1,X3)),inference(spm,[status(thm)],[177,208,theory(equality)])).
% cnf(291,plain,(ordered_pair_as_product_element(X5,X6,X1,X2)=ordered_pair_as_product_element(X3,X4,X1,X2)|empty(X4)|empty(X3)|empty(X6)|empty(X5)|~element(X2,X4)|~element(X1,X3)|~element(X2,X6)|~element(X1,X5)),inference(spm,[status(thm)],[208,208,theory(equality)])).
% cnf(298,plain,(empty_carrier(X1)|in(ordered_pair_as_product_element(the_carrier(X1),the_carrier(X1),X2,X3),a_1_0_filter_1(X1))|~below_refl(X1,X2,X3)|~lattice(X1)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1))|~latt_str(X1)),inference(er,[status(thm)],[84,theory(equality)])).
% cnf(311,plain,(empty_carrier(X1)|~empty(the_carrier(X1))|~latt_str(X1)),inference(spm,[status(thm)],[107,210,theory(equality)])).
% cnf(435,negated_conjecture,(empty_carrier(esk12_0)|~below_refl(esk12_0,esk13_0,esk14_0)|~lattice(esk12_0)|~element(esk14_0,the_carrier(esk12_0))|~element(esk13_0,the_carrier(esk12_0))|~latt_str(esk12_0)),inference(spm,[status(thm)],[239,298,theory(equality)])).
% cnf(438,negated_conjecture,(empty_carrier(esk12_0)|~below_refl(esk12_0,esk13_0,esk14_0)|$false|~element(esk14_0,the_carrier(esk12_0))|~element(esk13_0,the_carrier(esk12_0))|~latt_str(esk12_0)),inference(rw,[status(thm)],[435,204,theory(equality)])).
% cnf(439,negated_conjecture,(empty_carrier(esk12_0)|~below_refl(esk12_0,esk13_0,esk14_0)|$false|$false|~element(esk13_0,the_carrier(esk12_0))|~latt_str(esk12_0)),inference(rw,[status(thm)],[438,201,theory(equality)])).
% cnf(440,negated_conjecture,(empty_carrier(esk12_0)|~below_refl(esk12_0,esk13_0,esk14_0)|$false|$false|$false|~latt_str(esk12_0)),inference(rw,[status(thm)],[439,202,theory(equality)])).
% cnf(441,negated_conjecture,(empty_carrier(esk12_0)|~below_refl(esk12_0,esk13_0,esk14_0)|$false|$false|$false|$false),inference(rw,[status(thm)],[440,203,theory(equality)])).
% cnf(442,negated_conjecture,(empty_carrier(esk12_0)|~below_refl(esk12_0,esk13_0,esk14_0)),inference(cn,[status(thm)],[441,theory(equality)])).
% cnf(443,negated_conjecture,(~below_refl(esk12_0,esk13_0,esk14_0)),inference(sr,[status(thm)],[442,205,theory(equality)])).
% cnf(444,negated_conjecture,(in(ordered_pair_as_product_element(the_carrier(esk12_0),the_carrier(esk12_0),esk13_0,esk14_0),relation_of_lattice(esk12_0))),inference(sr,[status(thm)],[199,443,theory(equality)])).
% cnf(631,plain,(unordered_pair(singleton(esk3_2(X2,X1)),unordered_pair(esk3_2(X2,X1),esk4_2(X2,X1)))=X2|empty_carrier(X1)|empty(the_carrier(X1))|~lattice(X1)|~latt_str(X1)|~in(X2,a_1_0_filter_1(X1))|~element(esk4_2(X2,X1),the_carrier(X1))|~element(esk3_2(X2,X1),the_carrier(X1))),inference(rw,[status(thm)],[281,177,theory(equality)])).
% cnf(632,plain,(unordered_pair(singleton(esk3_2(X2,X1)),unordered_pair(esk3_2(X2,X1),esk4_2(X2,X1)))=X2|empty(the_carrier(X1))|empty_carrier(X1)|~lattice(X1)|~element(esk4_2(X2,X1),the_carrier(X1))|~latt_str(X1)|~in(X2,a_1_0_filter_1(X1))),inference(csr,[status(thm)],[631,83])).
% cnf(633,plain,(unordered_pair(singleton(esk3_2(X2,X1)),unordered_pair(esk3_2(X2,X1),esk4_2(X2,X1)))=X2|empty(the_carrier(X1))|empty_carrier(X1)|~lattice(X1)|~latt_str(X1)|~in(X2,a_1_0_filter_1(X1))),inference(csr,[status(thm)],[632,82])).
% cnf(634,plain,(unordered_pair(singleton(esk3_2(X2,X1)),unordered_pair(esk3_2(X2,X1),esk4_2(X2,X1)))=X2|empty_carrier(X1)|~lattice(X1)|~latt_str(X1)|~in(X2,a_1_0_filter_1(X1))),inference(csr,[status(thm)],[633,311])).
% cnf(653,plain,(X1=esk4_2(X2,X3)|empty_carrier(X3)|unordered_pair(unordered_pair(X4,X1),singleton(X4))!=X2|~lattice(X3)|~latt_str(X3)|~in(X2,a_1_0_filter_1(X3))),inference(spm,[status(thm)],[253,634,theory(equality)])).
% cnf(654,plain,(X1=esk3_2(X2,X3)|empty_carrier(X3)|unordered_pair(unordered_pair(X1,X4),singleton(X1))!=X2|~lattice(X3)|~latt_str(X3)|~in(X2,a_1_0_filter_1(X3))),inference(spm,[status(thm)],[262,634,theory(equality)])).
% cnf(1023,negated_conjecture,(in(ordered_pair_as_product_element(X1,X2,esk13_0,esk14_0),relation_of_lattice(esk12_0))|empty(X1)|empty(X2)|empty(the_carrier(esk12_0))|~element(esk14_0,the_carrier(esk12_0))|~element(esk13_0,the_carrier(esk12_0))|~element(esk14_0,X2)|~element(esk13_0,X1)),inference(spm,[status(thm)],[444,291,theory(equality)])).
% cnf(1081,negated_conjecture,(in(ordered_pair_as_product_element(X1,X2,esk13_0,esk14_0),relation_of_lattice(esk12_0))|empty(X1)|empty(X2)|empty(the_carrier(esk12_0))|$false|~element(esk13_0,the_carrier(esk12_0))|~element(esk14_0,X2)|~element(esk13_0,X1)),inference(rw,[status(thm)],[1023,201,theory(equality)])).
% cnf(1082,negated_conjecture,(in(ordered_pair_as_product_element(X1,X2,esk13_0,esk14_0),relation_of_lattice(esk12_0))|empty(X1)|empty(X2)|empty(the_carrier(esk12_0))|$false|$false|~element(esk14_0,X2)|~element(esk13_0,X1)),inference(rw,[status(thm)],[1081,202,theory(equality)])).
% cnf(1083,negated_conjecture,(in(ordered_pair_as_product_element(X1,X2,esk13_0,esk14_0),relation_of_lattice(esk12_0))|empty(X1)|empty(X2)|empty(the_carrier(esk12_0))|~element(esk14_0,X2)|~element(esk13_0,X1)),inference(cn,[status(thm)],[1082,theory(equality)])).
% cnf(1158,negated_conjecture,(empty(the_carrier(esk12_0))|empty(X1)|empty(X2)|in(unordered_pair(singleton(esk13_0),unordered_pair(esk13_0,esk14_0)),relation_of_lattice(esk12_0))|~element(esk14_0,X1)|~element(esk13_0,X2)),inference(spm,[status(thm)],[1083,283,theory(equality)])).
% cnf(1382,negated_conjecture,(empty(the_carrier(esk12_0))|empty(X1)|empty(X2)|in(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),relation_of_lattice(esk12_0))|~element(esk14_0,X1)|~element(esk13_0,X2)),inference(rw,[status(thm)],[1158,177,theory(equality)])).
% cnf(1384,negated_conjecture,(empty(the_carrier(esk12_0))|empty(X1)|in(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),relation_of_lattice(esk12_0))|~element(esk13_0,X1)),inference(spm,[status(thm)],[1382,201,theory(equality)])).
% cnf(1386,negated_conjecture,(empty(the_carrier(esk12_0))|in(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),relation_of_lattice(esk12_0))),inference(spm,[status(thm)],[1384,202,theory(equality)])).
% cnf(1391,negated_conjecture,(empty(the_carrier(esk12_0))|in(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),a_1_0_filter_1(esk12_0))|empty_carrier(esk12_0)|~lattice(esk12_0)|~latt_str(esk12_0)),inference(spm,[status(thm)],[1386,93,theory(equality)])).
% cnf(1394,negated_conjecture,(empty(the_carrier(esk12_0))|in(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),a_1_0_filter_1(esk12_0))|empty_carrier(esk12_0)|$false|~latt_str(esk12_0)),inference(rw,[status(thm)],[1391,204,theory(equality)])).
% cnf(1395,negated_conjecture,(empty(the_carrier(esk12_0))|in(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),a_1_0_filter_1(esk12_0))|empty_carrier(esk12_0)|$false|$false),inference(rw,[status(thm)],[1394,203,theory(equality)])).
% cnf(1396,negated_conjecture,(empty(the_carrier(esk12_0))|in(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),a_1_0_filter_1(esk12_0))|empty_carrier(esk12_0)),inference(cn,[status(thm)],[1395,theory(equality)])).
% cnf(1397,negated_conjecture,(empty(the_carrier(esk12_0))|in(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),a_1_0_filter_1(esk12_0))),inference(sr,[status(thm)],[1396,205,theory(equality)])).
% cnf(2744,plain,(X1=esk4_2(unordered_pair(unordered_pair(X2,X1),singleton(X2)),X3)|empty_carrier(X3)|~lattice(X3)|~latt_str(X3)|~in(unordered_pair(unordered_pair(X2,X1),singleton(X2)),a_1_0_filter_1(X3))),inference(er,[status(thm)],[653,theory(equality)])).
% cnf(2998,plain,(X1=esk3_2(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3)|empty_carrier(X3)|~lattice(X3)|~latt_str(X3)|~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),a_1_0_filter_1(X3))),inference(er,[status(thm)],[654,theory(equality)])).
% cnf(7778,negated_conjecture,(esk4_2(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),esk12_0)=esk14_0|empty_carrier(esk12_0)|empty(the_carrier(esk12_0))|~lattice(esk12_0)|~latt_str(esk12_0)),inference(spm,[status(thm)],[2744,1397,theory(equality)])).
% cnf(7781,negated_conjecture,(esk4_2(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),esk12_0)=esk14_0|empty_carrier(esk12_0)|empty(the_carrier(esk12_0))|$false|~latt_str(esk12_0)),inference(rw,[status(thm)],[7778,204,theory(equality)])).
% cnf(7782,negated_conjecture,(esk4_2(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),esk12_0)=esk14_0|empty_carrier(esk12_0)|empty(the_carrier(esk12_0))|$false|$false),inference(rw,[status(thm)],[7781,203,theory(equality)])).
% cnf(7783,negated_conjecture,(esk4_2(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),esk12_0)=esk14_0|empty_carrier(esk12_0)|empty(the_carrier(esk12_0))),inference(cn,[status(thm)],[7782,theory(equality)])).
% cnf(7784,negated_conjecture,(esk4_2(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),esk12_0)=esk14_0|empty(the_carrier(esk12_0))),inference(sr,[status(thm)],[7783,205,theory(equality)])).
% cnf(7786,negated_conjecture,(below_refl(esk12_0,esk3_2(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),esk12_0),esk14_0)|empty_carrier(esk12_0)|empty(the_carrier(esk12_0))|~lattice(esk12_0)|~latt_str(esk12_0)|~in(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),a_1_0_filter_1(esk12_0))),inference(spm,[status(thm)],[80,7784,theory(equality)])).
% cnf(7810,negated_conjecture,(below_refl(esk12_0,esk3_2(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),esk12_0),esk14_0)|empty_carrier(esk12_0)|empty(the_carrier(esk12_0))|$false|~latt_str(esk12_0)|~in(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),a_1_0_filter_1(esk12_0))),inference(rw,[status(thm)],[7786,204,theory(equality)])).
% cnf(7811,negated_conjecture,(below_refl(esk12_0,esk3_2(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),esk12_0),esk14_0)|empty_carrier(esk12_0)|empty(the_carrier(esk12_0))|$false|$false|~in(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),a_1_0_filter_1(esk12_0))),inference(rw,[status(thm)],[7810,203,theory(equality)])).
% cnf(7812,negated_conjecture,(below_refl(esk12_0,esk3_2(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),esk12_0),esk14_0)|empty_carrier(esk12_0)|empty(the_carrier(esk12_0))|~in(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),a_1_0_filter_1(esk12_0))),inference(cn,[status(thm)],[7811,theory(equality)])).
% cnf(7813,negated_conjecture,(below_refl(esk12_0,esk3_2(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),esk12_0),esk14_0)|empty(the_carrier(esk12_0))|~in(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),a_1_0_filter_1(esk12_0))),inference(sr,[status(thm)],[7812,205,theory(equality)])).
% cnf(9574,negated_conjecture,(empty(the_carrier(esk12_0))|below_refl(esk12_0,esk3_2(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),esk12_0),esk14_0)),inference(csr,[status(thm)],[7813,1397])).
% cnf(15550,negated_conjecture,(esk3_2(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),esk12_0)=esk13_0|empty_carrier(esk12_0)|empty(the_carrier(esk12_0))|~lattice(esk12_0)|~latt_str(esk12_0)),inference(spm,[status(thm)],[2998,1397,theory(equality)])).
% cnf(15553,negated_conjecture,(esk3_2(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),esk12_0)=esk13_0|empty_carrier(esk12_0)|empty(the_carrier(esk12_0))|$false|~latt_str(esk12_0)),inference(rw,[status(thm)],[15550,204,theory(equality)])).
% cnf(15554,negated_conjecture,(esk3_2(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),esk12_0)=esk13_0|empty_carrier(esk12_0)|empty(the_carrier(esk12_0))|$false|$false),inference(rw,[status(thm)],[15553,203,theory(equality)])).
% cnf(15555,negated_conjecture,(esk3_2(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),esk12_0)=esk13_0|empty_carrier(esk12_0)|empty(the_carrier(esk12_0))),inference(cn,[status(thm)],[15554,theory(equality)])).
% cnf(15556,negated_conjecture,(esk3_2(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),esk12_0)=esk13_0|empty(the_carrier(esk12_0))),inference(sr,[status(thm)],[15555,205,theory(equality)])).
% cnf(15587,negated_conjecture,(empty(the_carrier(esk12_0))|below_refl(esk12_0,esk13_0,esk14_0)),inference(spm,[status(thm)],[9574,15556,theory(equality)])).
% cnf(15702,negated_conjecture,(empty(the_carrier(esk12_0))),inference(sr,[status(thm)],[15587,443,theory(equality)])).
% cnf(15705,negated_conjecture,(empty_carrier(esk12_0)|~latt_str(esk12_0)),inference(spm,[status(thm)],[311,15702,theory(equality)])).
% cnf(15832,negated_conjecture,(empty_carrier(esk12_0)|$false),inference(rw,[status(thm)],[15705,203,theory(equality)])).
% cnf(15833,negated_conjecture,(empty_carrier(esk12_0)),inference(cn,[status(thm)],[15832,theory(equality)])).
% cnf(15834,negated_conjecture,($false),inference(sr,[status(thm)],[15833,205,theory(equality)])).
% cnf(15835,negated_conjecture,($false),15834,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 1847
% # ...of these trivial                : 11
% # ...subsumed                        : 1287
% # ...remaining for further processing: 549
% # Other redundant clauses eliminated : 5
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 23
% # Backward-rewritten                 : 134
% # Generated clauses                  : 9281
% # ...of the previous two non-trivial : 9079
% # Contextual simplify-reflections    : 1040
% # Paramodulations                    : 9238
% # Factorizations                     : 4
% # Equation resolutions               : 35
% # Current number of processed clauses: 333
% #    Positive orientable unit clauses: 22
% #    Positive unorientable unit clauses: 1
% #    Negative unit clauses           : 13
% #    Non-unit-clauses                : 297
% # Current number of unprocessed clauses: 5884
% # ...number of literals in the above : 79210
% # Clause-clause subsumption calls (NU) : 79878
% # Rec. Clause-clause subsumption calls : 11963
% # Unit Clause-clause subsumption calls : 20
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 14
% # Indexed BW rewrite successes       : 13
% # Backwards rewriting index:   238 leaves,   2.77+/-5.360 terms/leaf
% # Paramod-from index:           90 leaves,   1.43+/-1.732 terms/leaf
% # Paramod-into index:          198 leaves,   2.46+/-5.263 terms/leaf
% # -------------------------------------------------
% # User time              : 1.037 s
% # System time            : 0.028 s
% # Total time             : 1.065 s
% # Maximum resident set size: 0 pages
% PrfWatch: 1.48 CPU 1.57 WC
% FINAL PrfWatch: 1.48 CPU 1.57 WC
% SZS output end Solution for /tmp/SystemOnTPTP8982/SEU342+1.tptp
% 
%------------------------------------------------------------------------------