TSTP Solution File: SEU387+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU387+2 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art01.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 04:30:49 EST 2010
% Result : Theorem 85.90s
% Output : Solution 85.90s
% 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/SystemOnTPTP5589/SEU387+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP5589/SEU387+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP5589/SEU387+2.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 5796
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% PrfWatch: 1.95 CPU 2.02 WC
% PrfWatch: 3.94 CPU 4.03 WC
% PrfWatch: 5.91 CPU 6.04 WC
% PrfWatch: 7.90 CPU 8.04 WC
% PrfWatch: 9.90 CPU 10.05 WC
% PrfWatch: 11.88 CPU 12.06 WC
% PrfWatch: 13.87 CPU 14.07 WC
% PrfWatch: 15.85 CPU 16.07 WC
% # Preprocessing time : 0.525 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 17.84 CPU 18.08 WC
% PrfWatch: 19.83 CPU 20.09 WC
% PrfWatch: 21.82 CPU 22.10 WC
% # SZS output start CNFRefutation.
% fof(17, axiom,![X1]:![X2]:~((in(X1,X2)&empty(X2))),file('/tmp/SRASS.s.p', t7_boole)).
% fof(20, axiom,![X1]:the_carrier(boole_POSet(X1))=powerset(X1),file('/tmp/SRASS.s.p', t4_waybel_7)).
% fof(58, axiom,![X1]:((((((~(empty_carrier(X1))&reflexive_relstr(X1))&transitive_relstr(X1))&antisymmetric_relstr(X1))&lower_bounded_relstr(X1))&rel_str(X1))=>![X2]:((((~(empty(X2))&filtered_subset(X2,X1))&upper_relstr_subset(X2,X1))&element(X2,powerset(the_carrier(X1))))=>(proper_element(X2,powerset(the_carrier(X1)))<=>~(in(bottom_of_relstr(X1),X2))))),file('/tmp/SRASS.s.p', t8_waybel_7)).
% fof(189, axiom,![X1]:(strict_rel_str(boole_POSet(X1))&rel_str(boole_POSet(X1))),file('/tmp/SRASS.s.p', dt_k3_yellow_1)).
% fof(231, axiom,![X1]:((((~(empty_carrier(boole_POSet(X1)))&strict_rel_str(boole_POSet(X1)))&reflexive_relstr(boole_POSet(X1)))&transitive_relstr(boole_POSet(X1)))&antisymmetric_relstr(boole_POSet(X1))),file('/tmp/SRASS.s.p', fc7_yellow_1)).
% fof(268, axiom,![X1]:(empty(X1)=>X1=empty_set),file('/tmp/SRASS.s.p', t6_boole)).
% fof(498, axiom,![X1]:boole_POSet(X1)=poset_of_lattice(boole_lattice(X1)),file('/tmp/SRASS.s.p', d2_yellow_1)).
% fof(515, axiom,![X1]:bottom_of_relstr(boole_POSet(X1))=empty_set,file('/tmp/SRASS.s.p', t18_yellow_1)).
% fof(559, axiom,![X1]:(((((((((((((~(empty_carrier(boole_POSet(X1)))&strict_rel_str(boole_POSet(X1)))&reflexive_relstr(boole_POSet(X1)))&transitive_relstr(boole_POSet(X1)))&antisymmetric_relstr(boole_POSet(X1)))&with_suprema_relstr(boole_POSet(X1)))&with_infima_relstr(boole_POSet(X1)))&complete_relstr(boole_POSet(X1)))&lower_bounded_relstr(boole_POSet(X1)))&upper_bounded_relstr(boole_POSet(X1)))&bounded_relstr(boole_POSet(X1)))&up_complete_relstr(boole_POSet(X1)))&join_complete_relstr(boole_POSet(X1)))&distributive_relstr(boole_POSet(X1))),file('/tmp/SRASS.s.p', fc1_waybel_1)).
% fof(860, conjecture,![X1]:(~(empty(X1))=>![X2]:(((((~(empty(X2))&filtered_subset(X2,boole_POSet(X1)))&upper_relstr_subset(X2,boole_POSet(X1)))&proper_element(X2,powerset(the_carrier(boole_POSet(X1)))))&element(X2,powerset(the_carrier(boole_POSet(X1)))))=>![X3]:~((in(X3,X2)&empty(X3))))),file('/tmp/SRASS.s.p', t2_yellow19)).
% fof(861, negated_conjecture,~(![X1]:(~(empty(X1))=>![X2]:(((((~(empty(X2))&filtered_subset(X2,boole_POSet(X1)))&upper_relstr_subset(X2,boole_POSet(X1)))&proper_element(X2,powerset(the_carrier(boole_POSet(X1)))))&element(X2,powerset(the_carrier(boole_POSet(X1)))))=>![X3]:~((in(X3,X2)&empty(X3)))))),inference(assume_negation,[status(cth)],[860])).
% fof(877, plain,![X1]:((((((~(empty_carrier(X1))&reflexive_relstr(X1))&transitive_relstr(X1))&antisymmetric_relstr(X1))&lower_bounded_relstr(X1))&rel_str(X1))=>![X2]:((((~(empty(X2))&filtered_subset(X2,X1))&upper_relstr_subset(X2,X1))&element(X2,powerset(the_carrier(X1))))=>(proper_element(X2,powerset(the_carrier(X1)))<=>~(in(bottom_of_relstr(X1),X2))))),inference(fof_simplification,[status(thm)],[58,theory(equality)])).
% fof(930, plain,![X1]:((((~(empty_carrier(boole_POSet(X1)))&strict_rel_str(boole_POSet(X1)))&reflexive_relstr(boole_POSet(X1)))&transitive_relstr(boole_POSet(X1)))&antisymmetric_relstr(boole_POSet(X1))),inference(fof_simplification,[status(thm)],[231,theory(equality)])).
% fof(1030, plain,![X1]:(((((((((((((~(empty_carrier(boole_POSet(X1)))&strict_rel_str(boole_POSet(X1)))&reflexive_relstr(boole_POSet(X1)))&transitive_relstr(boole_POSet(X1)))&antisymmetric_relstr(boole_POSet(X1)))&with_suprema_relstr(boole_POSet(X1)))&with_infima_relstr(boole_POSet(X1)))&complete_relstr(boole_POSet(X1)))&lower_bounded_relstr(boole_POSet(X1)))&upper_bounded_relstr(boole_POSet(X1)))&bounded_relstr(boole_POSet(X1)))&up_complete_relstr(boole_POSet(X1)))&join_complete_relstr(boole_POSet(X1)))&distributive_relstr(boole_POSet(X1))),inference(fof_simplification,[status(thm)],[559,theory(equality)])).
% fof(1130, negated_conjecture,~(![X1]:(~(empty(X1))=>![X2]:(((((~(empty(X2))&filtered_subset(X2,boole_POSet(X1)))&upper_relstr_subset(X2,boole_POSet(X1)))&proper_element(X2,powerset(the_carrier(boole_POSet(X1)))))&element(X2,powerset(the_carrier(boole_POSet(X1)))))=>![X3]:~((in(X3,X2)&empty(X3)))))),inference(fof_simplification,[status(thm)],[861,theory(equality)])).
% fof(1197, plain,![X1]:![X2]:(~(in(X1,X2))|~(empty(X2))),inference(fof_nnf,[status(thm)],[17])).
% fof(1198, plain,![X3]:![X4]:(~(in(X3,X4))|~(empty(X4))),inference(variable_rename,[status(thm)],[1197])).
% cnf(1199,plain,(~empty(X1)|~in(X2,X1)),inference(split_conjunct,[status(thm)],[1198])).
% fof(1217, plain,![X2]:the_carrier(boole_POSet(X2))=powerset(X2),inference(variable_rename,[status(thm)],[20])).
% cnf(1218,plain,(the_carrier(boole_POSet(X1))=powerset(X1)),inference(split_conjunct,[status(thm)],[1217])).
% fof(1415, plain,![X1]:((((((empty_carrier(X1)|~(reflexive_relstr(X1)))|~(transitive_relstr(X1)))|~(antisymmetric_relstr(X1)))|~(lower_bounded_relstr(X1)))|~(rel_str(X1)))|![X2]:((((empty(X2)|~(filtered_subset(X2,X1)))|~(upper_relstr_subset(X2,X1)))|~(element(X2,powerset(the_carrier(X1)))))|((~(proper_element(X2,powerset(the_carrier(X1))))|~(in(bottom_of_relstr(X1),X2)))&(in(bottom_of_relstr(X1),X2)|proper_element(X2,powerset(the_carrier(X1))))))),inference(fof_nnf,[status(thm)],[877])).
% fof(1416, plain,![X3]:((((((empty_carrier(X3)|~(reflexive_relstr(X3)))|~(transitive_relstr(X3)))|~(antisymmetric_relstr(X3)))|~(lower_bounded_relstr(X3)))|~(rel_str(X3)))|![X4]:((((empty(X4)|~(filtered_subset(X4,X3)))|~(upper_relstr_subset(X4,X3)))|~(element(X4,powerset(the_carrier(X3)))))|((~(proper_element(X4,powerset(the_carrier(X3))))|~(in(bottom_of_relstr(X3),X4)))&(in(bottom_of_relstr(X3),X4)|proper_element(X4,powerset(the_carrier(X3))))))),inference(variable_rename,[status(thm)],[1415])).
% fof(1417, plain,![X3]:![X4]:(((((empty(X4)|~(filtered_subset(X4,X3)))|~(upper_relstr_subset(X4,X3)))|~(element(X4,powerset(the_carrier(X3)))))|((~(proper_element(X4,powerset(the_carrier(X3))))|~(in(bottom_of_relstr(X3),X4)))&(in(bottom_of_relstr(X3),X4)|proper_element(X4,powerset(the_carrier(X3))))))|(((((empty_carrier(X3)|~(reflexive_relstr(X3)))|~(transitive_relstr(X3)))|~(antisymmetric_relstr(X3)))|~(lower_bounded_relstr(X3)))|~(rel_str(X3)))),inference(shift_quantors,[status(thm)],[1416])).
% fof(1418, plain,![X3]:![X4]:((((~(proper_element(X4,powerset(the_carrier(X3))))|~(in(bottom_of_relstr(X3),X4)))|(((empty(X4)|~(filtered_subset(X4,X3)))|~(upper_relstr_subset(X4,X3)))|~(element(X4,powerset(the_carrier(X3))))))|(((((empty_carrier(X3)|~(reflexive_relstr(X3)))|~(transitive_relstr(X3)))|~(antisymmetric_relstr(X3)))|~(lower_bounded_relstr(X3)))|~(rel_str(X3))))&(((in(bottom_of_relstr(X3),X4)|proper_element(X4,powerset(the_carrier(X3))))|(((empty(X4)|~(filtered_subset(X4,X3)))|~(upper_relstr_subset(X4,X3)))|~(element(X4,powerset(the_carrier(X3))))))|(((((empty_carrier(X3)|~(reflexive_relstr(X3)))|~(transitive_relstr(X3)))|~(antisymmetric_relstr(X3)))|~(lower_bounded_relstr(X3)))|~(rel_str(X3))))),inference(distribute,[status(thm)],[1417])).
% cnf(1420,plain,(empty_carrier(X1)|empty(X2)|~rel_str(X1)|~lower_bounded_relstr(X1)|~antisymmetric_relstr(X1)|~transitive_relstr(X1)|~reflexive_relstr(X1)|~element(X2,powerset(the_carrier(X1)))|~upper_relstr_subset(X2,X1)|~filtered_subset(X2,X1)|~in(bottom_of_relstr(X1),X2)|~proper_element(X2,powerset(the_carrier(X1)))),inference(split_conjunct,[status(thm)],[1418])).
% fof(2477, plain,![X2]:(strict_rel_str(boole_POSet(X2))&rel_str(boole_POSet(X2))),inference(variable_rename,[status(thm)],[189])).
% cnf(2478,plain,(rel_str(boole_POSet(X1))),inference(split_conjunct,[status(thm)],[2477])).
% fof(3028, plain,![X2]:((((~(empty_carrier(boole_POSet(X2)))&strict_rel_str(boole_POSet(X2)))&reflexive_relstr(boole_POSet(X2)))&transitive_relstr(boole_POSet(X2)))&antisymmetric_relstr(boole_POSet(X2))),inference(variable_rename,[status(thm)],[930])).
% cnf(3029,plain,(antisymmetric_relstr(boole_POSet(X1))),inference(split_conjunct,[status(thm)],[3028])).
% cnf(3030,plain,(transitive_relstr(boole_POSet(X1))),inference(split_conjunct,[status(thm)],[3028])).
% cnf(3031,plain,(reflexive_relstr(boole_POSet(X1))),inference(split_conjunct,[status(thm)],[3028])).
% cnf(3033,plain,(~empty_carrier(boole_POSet(X1))),inference(split_conjunct,[status(thm)],[3028])).
% fof(3333, plain,![X1]:(~(empty(X1))|X1=empty_set),inference(fof_nnf,[status(thm)],[268])).
% fof(3334, plain,![X2]:(~(empty(X2))|X2=empty_set),inference(variable_rename,[status(thm)],[3333])).
% cnf(3335,plain,(X1=empty_set|~empty(X1)),inference(split_conjunct,[status(thm)],[3334])).
% fof(5259, plain,![X2]:boole_POSet(X2)=poset_of_lattice(boole_lattice(X2)),inference(variable_rename,[status(thm)],[498])).
% cnf(5260,plain,(boole_POSet(X1)=poset_of_lattice(boole_lattice(X1))),inference(split_conjunct,[status(thm)],[5259])).
% fof(5363, plain,![X2]:bottom_of_relstr(boole_POSet(X2))=empty_set,inference(variable_rename,[status(thm)],[515])).
% cnf(5364,plain,(bottom_of_relstr(boole_POSet(X1))=empty_set),inference(split_conjunct,[status(thm)],[5363])).
% fof(5596, plain,![X2]:(((((((((((((~(empty_carrier(boole_POSet(X2)))&strict_rel_str(boole_POSet(X2)))&reflexive_relstr(boole_POSet(X2)))&transitive_relstr(boole_POSet(X2)))&antisymmetric_relstr(boole_POSet(X2)))&with_suprema_relstr(boole_POSet(X2)))&with_infima_relstr(boole_POSet(X2)))&complete_relstr(boole_POSet(X2)))&lower_bounded_relstr(boole_POSet(X2)))&upper_bounded_relstr(boole_POSet(X2)))&bounded_relstr(boole_POSet(X2)))&up_complete_relstr(boole_POSet(X2)))&join_complete_relstr(boole_POSet(X2)))&distributive_relstr(boole_POSet(X2))),inference(variable_rename,[status(thm)],[1030])).
% cnf(5602,plain,(lower_bounded_relstr(boole_POSet(X1))),inference(split_conjunct,[status(thm)],[5596])).
% fof(7316, negated_conjecture,?[X1]:(~(empty(X1))&?[X2]:(((((~(empty(X2))&filtered_subset(X2,boole_POSet(X1)))&upper_relstr_subset(X2,boole_POSet(X1)))&proper_element(X2,powerset(the_carrier(boole_POSet(X1)))))&element(X2,powerset(the_carrier(boole_POSet(X1)))))&?[X3]:(in(X3,X2)&empty(X3)))),inference(fof_nnf,[status(thm)],[1130])).
% fof(7317, negated_conjecture,?[X4]:(~(empty(X4))&?[X5]:(((((~(empty(X5))&filtered_subset(X5,boole_POSet(X4)))&upper_relstr_subset(X5,boole_POSet(X4)))&proper_element(X5,powerset(the_carrier(boole_POSet(X4)))))&element(X5,powerset(the_carrier(boole_POSet(X4)))))&?[X6]:(in(X6,X5)&empty(X6)))),inference(variable_rename,[status(thm)],[7316])).
% fof(7318, negated_conjecture,(~(empty(esk539_0))&(((((~(empty(esk540_0))&filtered_subset(esk540_0,boole_POSet(esk539_0)))&upper_relstr_subset(esk540_0,boole_POSet(esk539_0)))&proper_element(esk540_0,powerset(the_carrier(boole_POSet(esk539_0)))))&element(esk540_0,powerset(the_carrier(boole_POSet(esk539_0)))))&(in(esk541_0,esk540_0)&empty(esk541_0)))),inference(skolemize,[status(esa)],[7317])).
% cnf(7319,negated_conjecture,(empty(esk541_0)),inference(split_conjunct,[status(thm)],[7318])).
% cnf(7320,negated_conjecture,(in(esk541_0,esk540_0)),inference(split_conjunct,[status(thm)],[7318])).
% cnf(7321,negated_conjecture,(element(esk540_0,powerset(the_carrier(boole_POSet(esk539_0))))),inference(split_conjunct,[status(thm)],[7318])).
% cnf(7322,negated_conjecture,(proper_element(esk540_0,powerset(the_carrier(boole_POSet(esk539_0))))),inference(split_conjunct,[status(thm)],[7318])).
% cnf(7323,negated_conjecture,(upper_relstr_subset(esk540_0,boole_POSet(esk539_0))),inference(split_conjunct,[status(thm)],[7318])).
% cnf(7324,negated_conjecture,(filtered_subset(esk540_0,boole_POSet(esk539_0))),inference(split_conjunct,[status(thm)],[7318])).
% cnf(7577,negated_conjecture,(element(esk540_0,the_carrier(boole_POSet(the_carrier(boole_POSet(esk539_0)))))),inference(rw,[status(thm)],[7321,1218,theory(equality)]),['unfolding']).
% cnf(7578,negated_conjecture,(proper_element(esk540_0,the_carrier(boole_POSet(the_carrier(boole_POSet(esk539_0)))))),inference(rw,[status(thm)],[7322,1218,theory(equality)]),['unfolding']).
% cnf(8546,plain,(empty(X2)|empty_carrier(X1)|~rel_str(X1)|~reflexive_relstr(X1)|~transitive_relstr(X1)|~antisymmetric_relstr(X1)|~lower_bounded_relstr(X1)|~upper_relstr_subset(X2,X1)|~filtered_subset(X2,X1)|~in(bottom_of_relstr(X1),X2)|~element(X2,the_carrier(boole_POSet(the_carrier(X1))))|~proper_element(X2,the_carrier(boole_POSet(the_carrier(X1))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1420,1218,theory(equality)]),1218,theory(equality)]),['unfolding']).
% cnf(8595,plain,(bottom_of_relstr(poset_of_lattice(boole_lattice(X1)))=empty_set),inference(rw,[status(thm)],[5364,5260,theory(equality)]),['unfolding']).
% cnf(8596,plain,(rel_str(poset_of_lattice(boole_lattice(X1)))),inference(rw,[status(thm)],[2478,5260,theory(equality)]),['unfolding']).
% cnf(8597,plain,(reflexive_relstr(poset_of_lattice(boole_lattice(X1)))),inference(rw,[status(thm)],[3031,5260,theory(equality)]),['unfolding']).
% cnf(8603,plain,(transitive_relstr(poset_of_lattice(boole_lattice(X1)))),inference(rw,[status(thm)],[3030,5260,theory(equality)]),['unfolding']).
% cnf(8609,plain,(antisymmetric_relstr(poset_of_lattice(boole_lattice(X1)))),inference(rw,[status(thm)],[3029,5260,theory(equality)]),['unfolding']).
% cnf(8615,plain,(lower_bounded_relstr(poset_of_lattice(boole_lattice(X1)))),inference(rw,[status(thm)],[5602,5260,theory(equality)]),['unfolding']).
% cnf(8673,negated_conjecture,(upper_relstr_subset(esk540_0,poset_of_lattice(boole_lattice(esk539_0)))),inference(rw,[status(thm)],[7323,5260,theory(equality)]),['unfolding']).
% cnf(8674,negated_conjecture,(filtered_subset(esk540_0,poset_of_lattice(boole_lattice(esk539_0)))),inference(rw,[status(thm)],[7324,5260,theory(equality)]),['unfolding']).
% cnf(8681,negated_conjecture,(element(esk540_0,the_carrier(poset_of_lattice(boole_lattice(the_carrier(poset_of_lattice(boole_lattice(esk539_0)))))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[7577,5260,theory(equality)]),5260,theory(equality)]),['unfolding']).
% cnf(8682,negated_conjecture,(proper_element(esk540_0,the_carrier(poset_of_lattice(boole_lattice(the_carrier(poset_of_lattice(boole_lattice(esk539_0)))))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[7578,5260,theory(equality)]),5260,theory(equality)]),['unfolding']).
% cnf(9671,plain,(empty(X2)|empty_carrier(X1)|~rel_str(X1)|~reflexive_relstr(X1)|~transitive_relstr(X1)|~antisymmetric_relstr(X1)|~lower_bounded_relstr(X1)|~upper_relstr_subset(X2,X1)|~filtered_subset(X2,X1)|~in(bottom_of_relstr(X1),X2)|~element(X2,the_carrier(poset_of_lattice(boole_lattice(the_carrier(X1)))))|~proper_element(X2,the_carrier(poset_of_lattice(boole_lattice(the_carrier(X1)))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[8546,5260,theory(equality)]),5260,theory(equality)]),['unfolding']).
% cnf(9694,plain,(~empty_carrier(poset_of_lattice(boole_lattice(X1)))),inference(rw,[status(thm)],[3033,5260,theory(equality)]),['unfolding']).
% cnf(10876,plain,(empty_carrier(X1)|~lower_bounded_relstr(X1)|~antisymmetric_relstr(X1)|~transitive_relstr(X1)|~reflexive_relstr(X1)|~filtered_subset(X2,X1)|~rel_str(X1)|~upper_relstr_subset(X2,X1)|~proper_element(X2,the_carrier(poset_of_lattice(boole_lattice(the_carrier(X1)))))|~element(X2,the_carrier(poset_of_lattice(boole_lattice(the_carrier(X1)))))|~in(bottom_of_relstr(X1),X2)),inference(csr,[status(thm)],[9671,1199])).
% cnf(11738,negated_conjecture,(empty_set=esk541_0),inference(spm,[status(thm)],[3335,7319,theory(equality)])).
% cnf(44160,negated_conjecture,(empty_carrier(poset_of_lattice(boole_lattice(esk539_0)))|~lower_bounded_relstr(poset_of_lattice(boole_lattice(esk539_0)))|~antisymmetric_relstr(poset_of_lattice(boole_lattice(esk539_0)))|~transitive_relstr(poset_of_lattice(boole_lattice(esk539_0)))|~reflexive_relstr(poset_of_lattice(boole_lattice(esk539_0)))|~filtered_subset(esk540_0,poset_of_lattice(boole_lattice(esk539_0)))|~rel_str(poset_of_lattice(boole_lattice(esk539_0)))|~upper_relstr_subset(esk540_0,poset_of_lattice(boole_lattice(esk539_0)))|~element(esk540_0,the_carrier(poset_of_lattice(boole_lattice(the_carrier(poset_of_lattice(boole_lattice(esk539_0)))))))|~in(bottom_of_relstr(poset_of_lattice(boole_lattice(esk539_0))),esk540_0)),inference(spm,[status(thm)],[10876,8682,theory(equality)])).
% cnf(44177,negated_conjecture,(empty_carrier(poset_of_lattice(boole_lattice(esk539_0)))|$false|~antisymmetric_relstr(poset_of_lattice(boole_lattice(esk539_0)))|~transitive_relstr(poset_of_lattice(boole_lattice(esk539_0)))|~reflexive_relstr(poset_of_lattice(boole_lattice(esk539_0)))|~filtered_subset(esk540_0,poset_of_lattice(boole_lattice(esk539_0)))|~rel_str(poset_of_lattice(boole_lattice(esk539_0)))|~upper_relstr_subset(esk540_0,poset_of_lattice(boole_lattice(esk539_0)))|~element(esk540_0,the_carrier(poset_of_lattice(boole_lattice(the_carrier(poset_of_lattice(boole_lattice(esk539_0)))))))|~in(bottom_of_relstr(poset_of_lattice(boole_lattice(esk539_0))),esk540_0)),inference(rw,[status(thm)],[44160,8615,theory(equality)])).
% cnf(44178,negated_conjecture,(empty_carrier(poset_of_lattice(boole_lattice(esk539_0)))|$false|$false|~transitive_relstr(poset_of_lattice(boole_lattice(esk539_0)))|~reflexive_relstr(poset_of_lattice(boole_lattice(esk539_0)))|~filtered_subset(esk540_0,poset_of_lattice(boole_lattice(esk539_0)))|~rel_str(poset_of_lattice(boole_lattice(esk539_0)))|~upper_relstr_subset(esk540_0,poset_of_lattice(boole_lattice(esk539_0)))|~element(esk540_0,the_carrier(poset_of_lattice(boole_lattice(the_carrier(poset_of_lattice(boole_lattice(esk539_0)))))))|~in(bottom_of_relstr(poset_of_lattice(boole_lattice(esk539_0))),esk540_0)),inference(rw,[status(thm)],[44177,8609,theory(equality)])).
% cnf(44179,negated_conjecture,(empty_carrier(poset_of_lattice(boole_lattice(esk539_0)))|$false|$false|$false|~reflexive_relstr(poset_of_lattice(boole_lattice(esk539_0)))|~filtered_subset(esk540_0,poset_of_lattice(boole_lattice(esk539_0)))|~rel_str(poset_of_lattice(boole_lattice(esk539_0)))|~upper_relstr_subset(esk540_0,poset_of_lattice(boole_lattice(esk539_0)))|~element(esk540_0,the_carrier(poset_of_lattice(boole_lattice(the_carrier(poset_of_lattice(boole_lattice(esk539_0)))))))|~in(bottom_of_relstr(poset_of_lattice(boole_lattice(esk539_0))),esk540_0)),inference(rw,[status(thm)],[44178,8603,theory(equality)])).
% cnf(44180,negated_conjecture,(empty_carrier(poset_of_lattice(boole_lattice(esk539_0)))|$false|$false|$false|$false|~filtered_subset(esk540_0,poset_of_lattice(boole_lattice(esk539_0)))|~rel_str(poset_of_lattice(boole_lattice(esk539_0)))|~upper_relstr_subset(esk540_0,poset_of_lattice(boole_lattice(esk539_0)))|~element(esk540_0,the_carrier(poset_of_lattice(boole_lattice(the_carrier(poset_of_lattice(boole_lattice(esk539_0)))))))|~in(bottom_of_relstr(poset_of_lattice(boole_lattice(esk539_0))),esk540_0)),inference(rw,[status(thm)],[44179,8597,theory(equality)])).
% cnf(44181,negated_conjecture,(empty_carrier(poset_of_lattice(boole_lattice(esk539_0)))|$false|$false|$false|$false|$false|~rel_str(poset_of_lattice(boole_lattice(esk539_0)))|~upper_relstr_subset(esk540_0,poset_of_lattice(boole_lattice(esk539_0)))|~element(esk540_0,the_carrier(poset_of_lattice(boole_lattice(the_carrier(poset_of_lattice(boole_lattice(esk539_0)))))))|~in(bottom_of_relstr(poset_of_lattice(boole_lattice(esk539_0))),esk540_0)),inference(rw,[status(thm)],[44180,8674,theory(equality)])).
% cnf(44182,negated_conjecture,(empty_carrier(poset_of_lattice(boole_lattice(esk539_0)))|$false|$false|$false|$false|$false|$false|~upper_relstr_subset(esk540_0,poset_of_lattice(boole_lattice(esk539_0)))|~element(esk540_0,the_carrier(poset_of_lattice(boole_lattice(the_carrier(poset_of_lattice(boole_lattice(esk539_0)))))))|~in(bottom_of_relstr(poset_of_lattice(boole_lattice(esk539_0))),esk540_0)),inference(rw,[status(thm)],[44181,8596,theory(equality)])).
% cnf(44183,negated_conjecture,(empty_carrier(poset_of_lattice(boole_lattice(esk539_0)))|$false|$false|$false|$false|$false|$false|$false|~element(esk540_0,the_carrier(poset_of_lattice(boole_lattice(the_carrier(poset_of_lattice(boole_lattice(esk539_0)))))))|~in(bottom_of_relstr(poset_of_lattice(boole_lattice(esk539_0))),esk540_0)),inference(rw,[status(thm)],[44182,8673,theory(equality)])).
% cnf(44184,negated_conjecture,(empty_carrier(poset_of_lattice(boole_lattice(esk539_0)))|$false|$false|$false|$false|$false|$false|$false|$false|~in(bottom_of_relstr(poset_of_lattice(boole_lattice(esk539_0))),esk540_0)),inference(rw,[status(thm)],[44183,8681,theory(equality)])).
% cnf(44185,negated_conjecture,(empty_carrier(poset_of_lattice(boole_lattice(esk539_0)))|$false|$false|$false|$false|$false|$false|$false|$false|~in(empty_set,esk540_0)),inference(rw,[status(thm)],[44184,8595,theory(equality)])).
% cnf(44186,negated_conjecture,(empty_carrier(poset_of_lattice(boole_lattice(esk539_0)))|~in(empty_set,esk540_0)),inference(cn,[status(thm)],[44185,theory(equality)])).
% cnf(44187,negated_conjecture,(~in(empty_set,esk540_0)),inference(sr,[status(thm)],[44186,9694,theory(equality)])).
% cnf(265544,negated_conjecture,(in(empty_set,esk540_0)),inference(rw,[status(thm)],[7320,11738,theory(equality)])).
% cnf(265637,negated_conjecture,($false),inference(sr,[status(thm)],[265544,44187,theory(equality)])).
% cnf(265638,negated_conjecture,($false),265637,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 7333
% # ...of these trivial : 118
% # ...subsumed : 221
% # ...remaining for further processing: 6994
% # Other redundant clauses eliminated : 724
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 20
% # Generated clauses : 189754
% # ...of the previous two non-trivial : 186187
% # Contextual simplify-reflections : 478
% # Paramodulations : 188919
% # Factorizations : 14
% # Equation resolutions : 894
% # Current number of processed clauses: 3348
% # Positive orientable unit clauses: 414
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 52
% # Non-unit-clauses : 2879
% # Current number of unprocessed clauses: 185742
% # ...number of literals in the above : 1468852
% # Clause-clause subsumption calls (NU) : 10010265
% # Rec. Clause-clause subsumption calls : 405236
% # Unit Clause-clause subsumption calls : 25175
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 90
% # Indexed BW rewrite successes : 64
% # Backwards rewriting index: 2626 leaves, 1.70+/-3.502 terms/leaf
% # Paramod-from index: 1217 leaves, 1.08+/-1.266 terms/leaf
% # Paramod-into index: 2148 leaves, 1.37+/-2.654 terms/leaf
% # -------------------------------------------------
% # User time : 17.135 s
% # System time : 0.419 s
% # Total time : 17.554 s
% # Maximum resident set size: 0 pages
% PrfWatch: 23.73 CPU 24.01 WC
% FINAL PrfWatch: 23.73 CPU 24.01 WC
% SZS output end Solution for /tmp/SystemOnTPTP5589/SEU387+2.tptp
%
%------------------------------------------------------------------------------