TSTP Solution File: REL005+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : REL005+3 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art09.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 : Wed Dec 29 21:35:23 EST 2010
% Result : Theorem 1.56s
% Output : Solution 1.56s
% 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/SystemOnTPTP501/REL005+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP501/REL005+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP501/REL005+3.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 598
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:converse(converse(X1))=X1,file('/tmp/SRASS.s.p', converse_idempotence)).
% fof(2, axiom,![X1]:![X2]:converse(join(X1,X2))=join(converse(X1),converse(X2)),file('/tmp/SRASS.s.p', converse_additivity)).
% fof(6, axiom,![X1]:![X2]:converse(composition(X1,X2))=composition(converse(X2),converse(X1)),file('/tmp/SRASS.s.p', converse_multiplicativity)).
% fof(7, axiom,![X1]:![X2]:join(X1,X2)=join(X2,X1),file('/tmp/SRASS.s.p', maddux1_join_commutativity)).
% fof(8, axiom,![X1]:![X2]:![X3]:join(X1,join(X2,X3))=join(join(X1,X2),X3),file('/tmp/SRASS.s.p', maddux2_join_associativity)).
% fof(11, axiom,![X1]:![X2]:meet(X1,X2)=complement(join(complement(X1),complement(X2))),file('/tmp/SRASS.s.p', maddux4_definiton_of_meet)).
% fof(12, axiom,![X1]:![X2]:X1=join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),file('/tmp/SRASS.s.p', maddux3_a_kind_of_de_Morgan)).
% fof(13, axiom,![X1]:![X2]:join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2),file('/tmp/SRASS.s.p', converse_cancellativity)).
% fof(14, axiom,![X1]:zero=meet(X1,complement(X1)),file('/tmp/SRASS.s.p', def_zero)).
% fof(15, axiom,![X1]:top=join(X1,complement(X1)),file('/tmp/SRASS.s.p', def_top)).
% fof(16, axiom,![X1]:composition(X1,one)=X1,file('/tmp/SRASS.s.p', composition_identity)).
% fof(17, conjecture,![X1]:![X2]:converse(meet(X1,X2))=meet(converse(X1),converse(X2)),file('/tmp/SRASS.s.p', goals)).
% fof(18, negated_conjecture,~(![X1]:![X2]:converse(meet(X1,X2))=meet(converse(X1),converse(X2))),inference(assume_negation,[status(cth)],[17])).
% fof(19, plain,![X2]:converse(converse(X2))=X2,inference(variable_rename,[status(thm)],[1])).
% cnf(20,plain,(converse(converse(X1))=X1),inference(split_conjunct,[status(thm)],[19])).
% fof(21, plain,![X3]:![X4]:converse(join(X3,X4))=join(converse(X3),converse(X4)),inference(variable_rename,[status(thm)],[2])).
% cnf(22,plain,(converse(join(X1,X2))=join(converse(X1),converse(X2))),inference(split_conjunct,[status(thm)],[21])).
% fof(29, plain,![X3]:![X4]:converse(composition(X3,X4))=composition(converse(X4),converse(X3)),inference(variable_rename,[status(thm)],[6])).
% cnf(30,plain,(converse(composition(X1,X2))=composition(converse(X2),converse(X1))),inference(split_conjunct,[status(thm)],[29])).
% fof(31, plain,![X3]:![X4]:join(X3,X4)=join(X4,X3),inference(variable_rename,[status(thm)],[7])).
% cnf(32,plain,(join(X1,X2)=join(X2,X1)),inference(split_conjunct,[status(thm)],[31])).
% fof(33, plain,![X4]:![X5]:![X6]:join(X4,join(X5,X6))=join(join(X4,X5),X6),inference(variable_rename,[status(thm)],[8])).
% cnf(34,plain,(join(X1,join(X2,X3))=join(join(X1,X2),X3)),inference(split_conjunct,[status(thm)],[33])).
% fof(39, plain,![X3]:![X4]:meet(X3,X4)=complement(join(complement(X3),complement(X4))),inference(variable_rename,[status(thm)],[11])).
% cnf(40,plain,(meet(X1,X2)=complement(join(complement(X1),complement(X2)))),inference(split_conjunct,[status(thm)],[39])).
% fof(41, plain,![X3]:![X4]:X3=join(complement(join(complement(X3),complement(X4))),complement(join(complement(X3),X4))),inference(variable_rename,[status(thm)],[12])).
% cnf(42,plain,(X1=join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2)))),inference(split_conjunct,[status(thm)],[41])).
% fof(43, plain,![X3]:![X4]:join(composition(converse(X3),complement(composition(X3,X4))),complement(X4))=complement(X4),inference(variable_rename,[status(thm)],[13])).
% cnf(44,plain,(join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2)),inference(split_conjunct,[status(thm)],[43])).
% fof(45, plain,![X2]:zero=meet(X2,complement(X2)),inference(variable_rename,[status(thm)],[14])).
% cnf(46,plain,(zero=meet(X1,complement(X1))),inference(split_conjunct,[status(thm)],[45])).
% fof(47, plain,![X2]:top=join(X2,complement(X2)),inference(variable_rename,[status(thm)],[15])).
% cnf(48,plain,(top=join(X1,complement(X1))),inference(split_conjunct,[status(thm)],[47])).
% fof(49, plain,![X2]:composition(X2,one)=X2,inference(variable_rename,[status(thm)],[16])).
% cnf(50,plain,(composition(X1,one)=X1),inference(split_conjunct,[status(thm)],[49])).
% fof(51, negated_conjecture,?[X1]:?[X2]:~(converse(meet(X1,X2))=meet(converse(X1),converse(X2))),inference(fof_nnf,[status(thm)],[18])).
% fof(52, negated_conjecture,?[X3]:?[X4]:~(converse(meet(X3,X4))=meet(converse(X3),converse(X4))),inference(variable_rename,[status(thm)],[51])).
% fof(53, negated_conjecture,~(converse(meet(esk1_0,esk2_0))=meet(converse(esk1_0),converse(esk2_0))),inference(skolemize,[status(esa)],[52])).
% cnf(54,negated_conjecture,(converse(meet(esk1_0,esk2_0))!=meet(converse(esk1_0),converse(esk2_0))),inference(split_conjunct,[status(thm)],[53])).
% cnf(55,plain,(complement(join(complement(X1),complement(complement(X1))))=zero),inference(rw,[status(thm)],[46,40,theory(equality)]),['unfolding']).
% cnf(59,negated_conjecture,(complement(join(complement(converse(esk1_0)),complement(converse(esk2_0))))!=converse(complement(join(complement(esk1_0),complement(esk2_0))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[54,40,theory(equality)]),40,theory(equality)]),['unfolding']).
% cnf(61,plain,(converse(top)=join(converse(X1),converse(complement(X1)))),inference(spm,[status(thm)],[22,48,theory(equality)])).
% cnf(68,plain,(converse(X1)=composition(converse(one),converse(X1))),inference(spm,[status(thm)],[30,50,theory(equality)])).
% cnf(70,plain,(complement(top)=zero),inference(rw,[status(thm)],[55,48,theory(equality)])).
% cnf(111,plain,(join(complement(X2),composition(converse(X1),complement(composition(X1,X2))))=complement(X2)),inference(rw,[status(thm)],[44,32,theory(equality)])).
% cnf(128,plain,(join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2))))=X1),inference(rw,[status(thm)],[42,32,theory(equality)])).
% cnf(141,plain,(join(complement(join(X2,complement(X1))),complement(join(complement(X1),complement(X2))))=X1),inference(spm,[status(thm)],[128,32,theory(equality)])).
% cnf(292,plain,(composition(converse(one),X1)=X1),inference(spm,[status(thm)],[68,20,theory(equality)])).
% cnf(302,plain,(one=converse(one)),inference(spm,[status(thm)],[50,292,theory(equality)])).
% cnf(333,plain,(composition(one,X1)=X1),inference(rw,[status(thm)],[292,302,theory(equality)])).
% cnf(347,plain,(join(complement(X1),composition(converse(one),complement(X1)))=complement(X1)),inference(spm,[status(thm)],[111,333,theory(equality)])).
% cnf(359,plain,(join(complement(X1),complement(X1))=complement(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[347,302,theory(equality)]),333,theory(equality)])).
% cnf(400,plain,(join(complement(complement(X1)),complement(join(complement(X1),complement(complement(X1)))))=X1),inference(spm,[status(thm)],[128,359,theory(equality)])).
% cnf(409,plain,(join(zero,zero)=zero),inference(spm,[status(thm)],[359,70,theory(equality)])).
% cnf(413,plain,(join(complement(complement(X1)),zero)=X1),inference(rw,[status(thm)],[inference(rw,[status(thm)],[400,48,theory(equality)]),70,theory(equality)])).
% cnf(425,plain,(join(zero,X1)=join(zero,join(zero,X1))),inference(spm,[status(thm)],[34,409,theory(equality)])).
% cnf(431,plain,(join(zero,complement(complement(X1)))=X1),inference(rw,[status(thm)],[413,32,theory(equality)])).
% cnf(476,plain,(join(zero,X1)=X1),inference(spm,[status(thm)],[425,431,theory(equality)])).
% cnf(487,plain,(X1=join(X1,zero)),inference(spm,[status(thm)],[32,476,theory(equality)])).
% cnf(496,plain,(complement(complement(X1))=X1),inference(rw,[status(thm)],[431,476,theory(equality)])).
% cnf(520,plain,(join(X1,X1)=X1),inference(spm,[status(thm)],[359,496,theory(equality)])).
% cnf(544,plain,(join(X1,X2)=join(X1,join(X1,X2))),inference(spm,[status(thm)],[34,520,theory(equality)])).
% cnf(593,plain,(join(complement(join(complement(X1),X2)),X1)=X1),inference(spm,[status(thm)],[544,128,theory(equality)])).
% cnf(600,plain,(join(converse(X1),converse(top))=converse(top)),inference(spm,[status(thm)],[544,61,theory(equality)])).
% cnf(602,plain,(join(X1,top)=top),inference(spm,[status(thm)],[544,48,theory(equality)])).
% cnf(626,plain,(top=join(top,X1)),inference(spm,[status(thm)],[32,602,theory(equality)])).
% cnf(724,plain,(join(X1,converse(top))=converse(top)),inference(spm,[status(thm)],[600,20,theory(equality)])).
% cnf(731,plain,(converse(top)=top),inference(spm,[status(thm)],[626,724,theory(equality)])).
% cnf(755,plain,(join(converse(X1),converse(complement(X1)))=top),inference(rw,[status(thm)],[61,731,theory(equality)])).
% cnf(837,plain,(join(X1,converse(complement(converse(X1))))=top),inference(spm,[status(thm)],[755,20,theory(equality)])).
% cnf(1188,plain,(join(X1,complement(join(complement(X1),X2)))=X1),inference(rw,[status(thm)],[593,32,theory(equality)])).
% cnf(1200,plain,(join(X1,X3)=join(X1,join(complement(join(complement(X1),X2)),X3))),inference(spm,[status(thm)],[34,1188,theory(equality)])).
% cnf(26476,plain,(join(X1,X2)=join(X1,complement(join(complement(X2),complement(complement(X1)))))),inference(spm,[status(thm)],[1200,141,theory(equality)])).
% cnf(26767,plain,(join(X1,X2)=join(X1,complement(join(complement(X2),X1)))),inference(rw,[status(thm)],[26476,496,theory(equality)])).
% cnf(28136,plain,(join(X1,complement(join(X2,X1)))=join(X1,complement(X2))),inference(spm,[status(thm)],[26767,496,theory(equality)])).
% cnf(28593,plain,(join(converse(complement(X1)),complement(top))=join(converse(complement(X1)),complement(converse(X1)))),inference(spm,[status(thm)],[28136,755,theory(equality)])).
% cnf(28637,plain,(join(converse(complement(converse(X1))),complement(top))=join(converse(complement(converse(X1))),complement(X1))),inference(spm,[status(thm)],[28136,837,theory(equality)])).
% cnf(28780,plain,(converse(complement(X1))=join(converse(complement(X1)),complement(converse(X1)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[28593,70,theory(equality)]),487,theory(equality)])).
% cnf(28854,plain,(converse(complement(converse(X1)))=join(converse(complement(converse(X1))),complement(X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[28637,70,theory(equality)]),487,theory(equality)])).
% cnf(29671,plain,(join(complement(converse(X1)),converse(complement(X1)))=converse(complement(X1))),inference(rw,[status(thm)],[28780,32,theory(equality)])).
% cnf(29755,plain,(join(complement(X1),converse(complement(converse(X1))))=converse(complement(converse(X1)))),inference(rw,[status(thm)],[28854,32,theory(equality)])).
% cnf(29756,plain,(converse(converse(complement(converse(X1))))=join(converse(complement(X1)),converse(converse(complement(converse(X1)))))),inference(spm,[status(thm)],[22,29755,theory(equality)])).
% cnf(29805,plain,(complement(converse(X1))=join(converse(complement(X1)),converse(converse(complement(converse(X1)))))),inference(rw,[status(thm)],[29756,20,theory(equality)])).
% cnf(29806,plain,(complement(converse(X1))=converse(complement(X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[29805,20,theory(equality)]),32,theory(equality)]),29671,theory(equality)])).
% cnf(29900,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[59,29806,theory(equality)]),22,theory(equality)]),29806,theory(equality)]),29806,theory(equality)])).
% cnf(29901,negated_conjecture,($false),inference(cn,[status(thm)],[29900,theory(equality)])).
% cnf(29902,negated_conjecture,($false),29901,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 911
% # ...of these trivial : 534
% # ...subsumed : 98
% # ...remaining for further processing: 279
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 138
% # Generated clauses : 14856
% # ...of the previous two non-trivial : 6697
% # Contextual simplify-reflections : 0
% # Paramodulations : 14856
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 141
% # Positive orientable unit clauses: 137
% # Positive unorientable unit clauses: 4
% # Negative unit clauses : 0
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 2993
% # ...number of literals in the above : 2993
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 23
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 794
% # Indexed BW rewrite successes : 202
% # Backwards rewriting index: 171 leaves, 1.75+/-1.423 terms/leaf
% # Paramod-from index: 94 leaves, 1.52+/-1.374 terms/leaf
% # Paramod-into index: 167 leaves, 1.70+/-1.416 terms/leaf
% # -------------------------------------------------
% # User time : 0.312 s
% # System time : 0.019 s
% # Total time : 0.331 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.75 CPU 0.84 WC
% FINAL PrfWatch: 0.75 CPU 0.84 WC
% SZS output end Solution for /tmp/SystemOnTPTP501/REL005+3.tptp
%
%------------------------------------------------------------------------------