TSTP Solution File: SEU344+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU344+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 : art02.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:47 EST 2010
% Result : Theorem 1.11s
% Output : Solution 1.11s
% 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/SystemOnTPTP16297/SEU344+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP16297/SEU344+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16297/SEU344+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 16393
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.021 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, axiom,![X1]:![X2]:subset(X1,set_union2(X1,X2)),file('/tmp/SRASS.s.p', t7_xboole_1)).
% fof(10, axiom,![X1]:((~(empty_carrier(X1))&join_semilatt_str(X1))=>![X2]:(element(X2,the_carrier(X1))=>![X3]:(element(X3,the_carrier(X1))=>(below(X1,X2,X3)<=>join(X1,X2,X3)=X3)))),file('/tmp/SRASS.s.p', d3_lattices)).
% fof(14, axiom,![X1]:![X2]:(subset(X1,X2)=>set_union2(X1,X2)=X2),file('/tmp/SRASS.s.p', t12_xboole_1)).
% fof(15, axiom,![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(16, axiom,![X1]:(strict_latt_str(boole_lattice(X1))&latt_str(boole_lattice(X1))),file('/tmp/SRASS.s.p', dt_k1_lattice3)).
% fof(17, axiom,![X1]:(~(empty_carrier(boole_lattice(X1)))&strict_latt_str(boole_lattice(X1))),file('/tmp/SRASS.s.p', fc1_lattice3)).
% fof(52, axiom,![X1]:(latt_str(X1)=>(meet_semilatt_str(X1)&join_semilatt_str(X1))),file('/tmp/SRASS.s.p', dt_l3_lattices)).
% fof(81, conjecture,![X1]:![X2]:(element(X2,the_carrier(boole_lattice(X1)))=>![X3]:(element(X3,the_carrier(boole_lattice(X1)))=>(below(boole_lattice(X1),X2,X3)<=>subset(X2,X3)))),file('/tmp/SRASS.s.p', t2_lattice3)).
% fof(82, negated_conjecture,~(![X1]:![X2]:(element(X2,the_carrier(boole_lattice(X1)))=>![X3]:(element(X3,the_carrier(boole_lattice(X1)))=>(below(boole_lattice(X1),X2,X3)<=>subset(X2,X3))))),inference(assume_negation,[status(cth)],[81])).
% fof(83, plain,![X1]:((~(empty_carrier(X1))&join_semilatt_str(X1))=>![X2]:(element(X2,the_carrier(X1))=>![X3]:(element(X3,the_carrier(X1))=>(below(X1,X2,X3)<=>join(X1,X2,X3)=X3)))),inference(fof_simplification,[status(thm)],[10,theory(equality)])).
% fof(87, plain,![X1]:(~(empty_carrier(boole_lattice(X1)))&strict_latt_str(boole_lattice(X1))),inference(fof_simplification,[status(thm)],[17,theory(equality)])).
% fof(114, plain,![X3]:![X4]:subset(X3,set_union2(X3,X4)),inference(variable_rename,[status(thm)],[4])).
% cnf(115,plain,(subset(X1,set_union2(X1,X2))),inference(split_conjunct,[status(thm)],[114])).
% fof(131, plain,![X1]:((empty_carrier(X1)|~(join_semilatt_str(X1)))|![X2]:(~(element(X2,the_carrier(X1)))|![X3]:(~(element(X3,the_carrier(X1)))|((~(below(X1,X2,X3))|join(X1,X2,X3)=X3)&(~(join(X1,X2,X3)=X3)|below(X1,X2,X3)))))),inference(fof_nnf,[status(thm)],[83])).
% fof(132, plain,![X4]:((empty_carrier(X4)|~(join_semilatt_str(X4)))|![X5]:(~(element(X5,the_carrier(X4)))|![X6]:(~(element(X6,the_carrier(X4)))|((~(below(X4,X5,X6))|join(X4,X5,X6)=X6)&(~(join(X4,X5,X6)=X6)|below(X4,X5,X6)))))),inference(variable_rename,[status(thm)],[131])).
% fof(133, plain,![X4]:![X5]:![X6]:(((~(element(X6,the_carrier(X4)))|((~(below(X4,X5,X6))|join(X4,X5,X6)=X6)&(~(join(X4,X5,X6)=X6)|below(X4,X5,X6))))|~(element(X5,the_carrier(X4))))|(empty_carrier(X4)|~(join_semilatt_str(X4)))),inference(shift_quantors,[status(thm)],[132])).
% fof(134, plain,![X4]:![X5]:![X6]:(((((~(below(X4,X5,X6))|join(X4,X5,X6)=X6)|~(element(X6,the_carrier(X4))))|~(element(X5,the_carrier(X4))))|(empty_carrier(X4)|~(join_semilatt_str(X4))))&((((~(join(X4,X5,X6)=X6)|below(X4,X5,X6))|~(element(X6,the_carrier(X4))))|~(element(X5,the_carrier(X4))))|(empty_carrier(X4)|~(join_semilatt_str(X4))))),inference(distribute,[status(thm)],[133])).
% cnf(135,plain,(empty_carrier(X1)|below(X1,X2,X3)|~join_semilatt_str(X1)|~element(X2,the_carrier(X1))|~element(X3,the_carrier(X1))|join(X1,X2,X3)!=X3),inference(split_conjunct,[status(thm)],[134])).
% cnf(136,plain,(empty_carrier(X1)|join(X1,X2,X3)=X3|~join_semilatt_str(X1)|~element(X2,the_carrier(X1))|~element(X3,the_carrier(X1))|~below(X1,X2,X3)),inference(split_conjunct,[status(thm)],[134])).
% fof(147, plain,![X1]:![X2]:(~(subset(X1,X2))|set_union2(X1,X2)=X2),inference(fof_nnf,[status(thm)],[14])).
% fof(148, plain,![X3]:![X4]:(~(subset(X3,X4))|set_union2(X3,X4)=X4),inference(variable_rename,[status(thm)],[147])).
% cnf(149,plain,(set_union2(X1,X2)=X2|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[148])).
% fof(150, plain,![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)],[15])).
% fof(151, plain,![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)],[150])).
% fof(152, plain,![X4]:![X5]:![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)))|~(element(X5,the_carrier(boole_lattice(X4))))),inference(shift_quantors,[status(thm)],[151])).
% fof(153, plain,![X4]:![X5]:![X6]:(((join(boole_lattice(X4),X5,X6)=set_union2(X5,X6)|~(element(X6,the_carrier(boole_lattice(X4)))))|~(element(X5,the_carrier(boole_lattice(X4)))))&((meet(boole_lattice(X4),X5,X6)=set_intersection2(X5,X6)|~(element(X6,the_carrier(boole_lattice(X4)))))|~(element(X5,the_carrier(boole_lattice(X4)))))),inference(distribute,[status(thm)],[152])).
% cnf(155,plain,(join(boole_lattice(X2),X1,X3)=set_union2(X1,X3)|~element(X1,the_carrier(boole_lattice(X2)))|~element(X3,the_carrier(boole_lattice(X2)))),inference(split_conjunct,[status(thm)],[153])).
% fof(156, plain,![X2]:(strict_latt_str(boole_lattice(X2))&latt_str(boole_lattice(X2))),inference(variable_rename,[status(thm)],[16])).
% cnf(157,plain,(latt_str(boole_lattice(X1))),inference(split_conjunct,[status(thm)],[156])).
% fof(159, plain,![X2]:(~(empty_carrier(boole_lattice(X2)))&strict_latt_str(boole_lattice(X2))),inference(variable_rename,[status(thm)],[87])).
% cnf(161,plain,(~empty_carrier(boole_lattice(X1))),inference(split_conjunct,[status(thm)],[159])).
% fof(268, plain,![X1]:(~(latt_str(X1))|(meet_semilatt_str(X1)&join_semilatt_str(X1))),inference(fof_nnf,[status(thm)],[52])).
% fof(269, plain,![X2]:(~(latt_str(X2))|(meet_semilatt_str(X2)&join_semilatt_str(X2))),inference(variable_rename,[status(thm)],[268])).
% fof(270, plain,![X2]:((meet_semilatt_str(X2)|~(latt_str(X2)))&(join_semilatt_str(X2)|~(latt_str(X2)))),inference(distribute,[status(thm)],[269])).
% cnf(271,plain,(join_semilatt_str(X1)|~latt_str(X1)),inference(split_conjunct,[status(thm)],[270])).
% fof(340, negated_conjecture,?[X1]:?[X2]:(element(X2,the_carrier(boole_lattice(X1)))&?[X3]:(element(X3,the_carrier(boole_lattice(X1)))&((~(below(boole_lattice(X1),X2,X3))|~(subset(X2,X3)))&(below(boole_lattice(X1),X2,X3)|subset(X2,X3))))),inference(fof_nnf,[status(thm)],[82])).
% fof(341, negated_conjecture,?[X4]:?[X5]:(element(X5,the_carrier(boole_lattice(X4)))&?[X6]:(element(X6,the_carrier(boole_lattice(X4)))&((~(below(boole_lattice(X4),X5,X6))|~(subset(X5,X6)))&(below(boole_lattice(X4),X5,X6)|subset(X5,X6))))),inference(variable_rename,[status(thm)],[340])).
% fof(342, negated_conjecture,(element(esk17_0,the_carrier(boole_lattice(esk16_0)))&(element(esk18_0,the_carrier(boole_lattice(esk16_0)))&((~(below(boole_lattice(esk16_0),esk17_0,esk18_0))|~(subset(esk17_0,esk18_0)))&(below(boole_lattice(esk16_0),esk17_0,esk18_0)|subset(esk17_0,esk18_0))))),inference(skolemize,[status(esa)],[341])).
% cnf(343,negated_conjecture,(subset(esk17_0,esk18_0)|below(boole_lattice(esk16_0),esk17_0,esk18_0)),inference(split_conjunct,[status(thm)],[342])).
% cnf(344,negated_conjecture,(~subset(esk17_0,esk18_0)|~below(boole_lattice(esk16_0),esk17_0,esk18_0)),inference(split_conjunct,[status(thm)],[342])).
% cnf(345,negated_conjecture,(element(esk18_0,the_carrier(boole_lattice(esk16_0)))),inference(split_conjunct,[status(thm)],[342])).
% cnf(346,negated_conjecture,(element(esk17_0,the_carrier(boole_lattice(esk16_0)))),inference(split_conjunct,[status(thm)],[342])).
% cnf(358,plain,(join_semilatt_str(boole_lattice(X1))),inference(spm,[status(thm)],[271,157,theory(equality)])).
% cnf(442,negated_conjecture,(join(boole_lattice(esk16_0),X1,esk18_0)=set_union2(X1,esk18_0)|~element(X1,the_carrier(boole_lattice(esk16_0)))),inference(spm,[status(thm)],[155,345,theory(equality)])).
% cnf(460,negated_conjecture,(join(boole_lattice(esk16_0),esk17_0,esk18_0)=esk18_0|empty_carrier(boole_lattice(esk16_0))|subset(esk17_0,esk18_0)|~join_semilatt_str(boole_lattice(esk16_0))|~element(esk18_0,the_carrier(boole_lattice(esk16_0)))|~element(esk17_0,the_carrier(boole_lattice(esk16_0)))),inference(spm,[status(thm)],[136,343,theory(equality)])).
% cnf(461,negated_conjecture,(join(boole_lattice(esk16_0),esk17_0,esk18_0)=esk18_0|empty_carrier(boole_lattice(esk16_0))|subset(esk17_0,esk18_0)|~join_semilatt_str(boole_lattice(esk16_0))|$false|~element(esk17_0,the_carrier(boole_lattice(esk16_0)))),inference(rw,[status(thm)],[460,345,theory(equality)])).
% cnf(462,negated_conjecture,(join(boole_lattice(esk16_0),esk17_0,esk18_0)=esk18_0|empty_carrier(boole_lattice(esk16_0))|subset(esk17_0,esk18_0)|~join_semilatt_str(boole_lattice(esk16_0))|$false|$false),inference(rw,[status(thm)],[461,346,theory(equality)])).
% cnf(463,negated_conjecture,(join(boole_lattice(esk16_0),esk17_0,esk18_0)=esk18_0|empty_carrier(boole_lattice(esk16_0))|subset(esk17_0,esk18_0)|~join_semilatt_str(boole_lattice(esk16_0))),inference(cn,[status(thm)],[462,theory(equality)])).
% cnf(464,negated_conjecture,(join(boole_lattice(esk16_0),esk17_0,esk18_0)=esk18_0|subset(esk17_0,esk18_0)|~join_semilatt_str(boole_lattice(esk16_0))),inference(sr,[status(thm)],[463,161,theory(equality)])).
% cnf(531,negated_conjecture,(join(boole_lattice(esk16_0),esk17_0,esk18_0)=esk18_0|subset(esk17_0,esk18_0)|$false),inference(rw,[status(thm)],[464,358,theory(equality)])).
% cnf(532,negated_conjecture,(join(boole_lattice(esk16_0),esk17_0,esk18_0)=esk18_0|subset(esk17_0,esk18_0)),inference(cn,[status(thm)],[531,theory(equality)])).
% cnf(752,negated_conjecture,(join(boole_lattice(esk16_0),esk17_0,esk18_0)=set_union2(esk17_0,esk18_0)),inference(spm,[status(thm)],[442,346,theory(equality)])).
% cnf(777,negated_conjecture,(set_union2(esk17_0,esk18_0)=esk18_0|subset(esk17_0,esk18_0)),inference(spm,[status(thm)],[532,752,theory(equality)])).
% cnf(784,negated_conjecture,(set_union2(esk17_0,esk18_0)=esk18_0),inference(csr,[status(thm)],[777,149])).
% cnf(785,negated_conjecture,(subset(esk17_0,esk18_0)),inference(spm,[status(thm)],[115,784,theory(equality)])).
% cnf(798,negated_conjecture,(~below(boole_lattice(esk16_0),esk17_0,esk18_0)|$false),inference(rw,[status(thm)],[344,785,theory(equality)])).
% cnf(799,negated_conjecture,(~below(boole_lattice(esk16_0),esk17_0,esk18_0)),inference(cn,[status(thm)],[798,theory(equality)])).
% cnf(802,negated_conjecture,(empty_carrier(boole_lattice(esk16_0))|join(boole_lattice(esk16_0),esk17_0,esk18_0)!=esk18_0|~join_semilatt_str(boole_lattice(esk16_0))|~element(esk18_0,the_carrier(boole_lattice(esk16_0)))|~element(esk17_0,the_carrier(boole_lattice(esk16_0)))),inference(spm,[status(thm)],[799,135,theory(equality)])).
% cnf(803,negated_conjecture,(empty_carrier(boole_lattice(esk16_0))|$false|~join_semilatt_str(boole_lattice(esk16_0))|~element(esk18_0,the_carrier(boole_lattice(esk16_0)))|~element(esk17_0,the_carrier(boole_lattice(esk16_0)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[802,752,theory(equality)]),784,theory(equality)])).
% cnf(804,negated_conjecture,(empty_carrier(boole_lattice(esk16_0))|$false|$false|~element(esk18_0,the_carrier(boole_lattice(esk16_0)))|~element(esk17_0,the_carrier(boole_lattice(esk16_0)))),inference(rw,[status(thm)],[803,358,theory(equality)])).
% cnf(805,negated_conjecture,(empty_carrier(boole_lattice(esk16_0))|$false|$false|$false|~element(esk17_0,the_carrier(boole_lattice(esk16_0)))),inference(rw,[status(thm)],[804,345,theory(equality)])).
% cnf(806,negated_conjecture,(empty_carrier(boole_lattice(esk16_0))|$false|$false|$false|$false),inference(rw,[status(thm)],[805,346,theory(equality)])).
% cnf(807,negated_conjecture,(empty_carrier(boole_lattice(esk16_0))),inference(cn,[status(thm)],[806,theory(equality)])).
% cnf(808,negated_conjecture,($false),inference(sr,[status(thm)],[807,161,theory(equality)])).
% cnf(809,negated_conjecture,($false),808,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 305
% # ...of these trivial : 5
% # ...subsumed : 44
% # ...remaining for further processing: 256
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 12
% # Generated clauses : 313
% # ...of the previous two non-trivial : 227
% # Contextual simplify-reflections : 3
% # Paramodulations : 310
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 154
% # Positive orientable unit clauses: 54
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 16
% # Non-unit-clauses : 81
% # Current number of unprocessed clauses: 95
% # ...number of literals in the above : 386
% # Clause-clause subsumption calls (NU) : 192
% # Rec. Clause-clause subsumption calls : 134
% # Unit Clause-clause subsumption calls : 108
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 30
% # Indexed BW rewrite successes : 28
% # Backwards rewriting index: 180 leaves, 1.34+/-1.051 terms/leaf
% # Paramod-from index: 88 leaves, 1.10+/-0.370 terms/leaf
% # Paramod-into index: 161 leaves, 1.19+/-0.574 terms/leaf
% # -------------------------------------------------
% # User time : 0.040 s
% # System time : 0.005 s
% # Total time : 0.045 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.22 WC
% FINAL PrfWatch: 0.13 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP16297/SEU344+1.tptp
%
%------------------------------------------------------------------------------