TSTP Solution File: REL012+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : REL012+1 : TPTP v5.0.0. Released v4.0.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 : Wed Dec 29 21:37:06 EST 2010
% Result : Theorem 29.23s
% Output : Solution 29.23s
% 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/SystemOnTPTP31810/REL012+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP31810/REL012+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31810/REL012+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 31906
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% PrfWatch: 1.94 CPU 2.02 WC
% PrfWatch: 3.92 CPU 4.02 WC
% PrfWatch: 5.91 CPU 6.03 WC
% PrfWatch: 7.90 CPU 8.03 WC
% PrfWatch: 9.88 CPU 10.04 WC
% PrfWatch: 11.87 CPU 12.04 WC
% PrfWatch: 13.84 CPU 14.05 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 15.82 CPU 16.05 WC
% PrfWatch: 17.82 CPU 18.06 WC
% PrfWatch: 19.81 CPU 20.06 WC
% PrfWatch: 21.80 CPU 22.06 WC
% PrfWatch: 23.79 CPU 24.07 WC
% PrfWatch: 25.79 CPU 26.07 WC
% PrfWatch: 27.78 CPU 28.08 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:join(X1,X2)=join(X2,X1),file('/tmp/SRASS.s.p', maddux1_join_commutativity)).
% fof(2, axiom,![X1]:![X2]:![X3]:join(X1,join(X2,X3))=join(join(X1,X2),X3),file('/tmp/SRASS.s.p', maddux2_join_associativity)).
% fof(3, 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(6, axiom,![X1]:converse(converse(X1))=X1,file('/tmp/SRASS.s.p', converse_idempotence)).
% fof(7, axiom,![X1]:![X2]:converse(join(X1,X2))=join(converse(X1),converse(X2)),file('/tmp/SRASS.s.p', converse_additivity)).
% fof(8, axiom,![X1]:![X2]:converse(composition(X1,X2))=composition(converse(X2),converse(X1)),file('/tmp/SRASS.s.p', converse_multiplicativity)).
% fof(9, axiom,![X1]:![X2]:join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2),file('/tmp/SRASS.s.p', converse_cancellativity)).
% fof(10, axiom,![X1]:![X2]:meet(X1,X2)=complement(join(complement(X1),complement(X2))),file('/tmp/SRASS.s.p', maddux4_definiton_of_meet)).
% fof(11, axiom,![X1]:top=join(X1,complement(X1)),file('/tmp/SRASS.s.p', def_top)).
% fof(12, axiom,![X1]:composition(X1,one)=X1,file('/tmp/SRASS.s.p', composition_identity)).
% fof(13, axiom,![X1]:zero=meet(X1,complement(X1)),file('/tmp/SRASS.s.p', def_zero)).
% fof(14, conjecture,![X1]:![X2]:join(composition(complement(composition(X1,X2)),converse(X2)),complement(X1))=complement(X1),file('/tmp/SRASS.s.p', goals)).
% fof(15, negated_conjecture,~(![X1]:![X2]:join(composition(complement(composition(X1,X2)),converse(X2)),complement(X1))=complement(X1)),inference(assume_negation,[status(cth)],[14])).
% fof(16, plain,![X3]:![X4]:join(X3,X4)=join(X4,X3),inference(variable_rename,[status(thm)],[1])).
% cnf(17,plain,(join(X1,X2)=join(X2,X1)),inference(split_conjunct,[status(thm)],[16])).
% fof(18, plain,![X4]:![X5]:![X6]:join(X4,join(X5,X6))=join(join(X4,X5),X6),inference(variable_rename,[status(thm)],[2])).
% cnf(19,plain,(join(X1,join(X2,X3))=join(join(X1,X2),X3)),inference(split_conjunct,[status(thm)],[18])).
% fof(20, plain,![X3]:![X4]:X3=join(complement(join(complement(X3),complement(X4))),complement(join(complement(X3),X4))),inference(variable_rename,[status(thm)],[3])).
% cnf(21,plain,(X1=join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2)))),inference(split_conjunct,[status(thm)],[20])).
% fof(26, plain,![X2]:converse(converse(X2))=X2,inference(variable_rename,[status(thm)],[6])).
% cnf(27,plain,(converse(converse(X1))=X1),inference(split_conjunct,[status(thm)],[26])).
% fof(28, plain,![X3]:![X4]:converse(join(X3,X4))=join(converse(X3),converse(X4)),inference(variable_rename,[status(thm)],[7])).
% cnf(29,plain,(converse(join(X1,X2))=join(converse(X1),converse(X2))),inference(split_conjunct,[status(thm)],[28])).
% fof(30, plain,![X3]:![X4]:converse(composition(X3,X4))=composition(converse(X4),converse(X3)),inference(variable_rename,[status(thm)],[8])).
% cnf(31,plain,(converse(composition(X1,X2))=composition(converse(X2),converse(X1))),inference(split_conjunct,[status(thm)],[30])).
% fof(32, plain,![X3]:![X4]:join(composition(converse(X3),complement(composition(X3,X4))),complement(X4))=complement(X4),inference(variable_rename,[status(thm)],[9])).
% cnf(33,plain,(join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2)),inference(split_conjunct,[status(thm)],[32])).
% fof(34, plain,![X3]:![X4]:meet(X3,X4)=complement(join(complement(X3),complement(X4))),inference(variable_rename,[status(thm)],[10])).
% cnf(35,plain,(meet(X1,X2)=complement(join(complement(X1),complement(X2)))),inference(split_conjunct,[status(thm)],[34])).
% fof(36, plain,![X2]:top=join(X2,complement(X2)),inference(variable_rename,[status(thm)],[11])).
% cnf(37,plain,(top=join(X1,complement(X1))),inference(split_conjunct,[status(thm)],[36])).
% fof(38, plain,![X2]:composition(X2,one)=X2,inference(variable_rename,[status(thm)],[12])).
% cnf(39,plain,(composition(X1,one)=X1),inference(split_conjunct,[status(thm)],[38])).
% fof(40, plain,![X2]:zero=meet(X2,complement(X2)),inference(variable_rename,[status(thm)],[13])).
% cnf(41,plain,(zero=meet(X1,complement(X1))),inference(split_conjunct,[status(thm)],[40])).
% fof(42, negated_conjecture,?[X1]:?[X2]:~(join(composition(complement(composition(X1,X2)),converse(X2)),complement(X1))=complement(X1)),inference(fof_nnf,[status(thm)],[15])).
% fof(43, negated_conjecture,?[X3]:?[X4]:~(join(composition(complement(composition(X3,X4)),converse(X4)),complement(X3))=complement(X3)),inference(variable_rename,[status(thm)],[42])).
% fof(44, negated_conjecture,~(join(composition(complement(composition(esk1_0,esk2_0)),converse(esk2_0)),complement(esk1_0))=complement(esk1_0)),inference(skolemize,[status(esa)],[43])).
% cnf(45,negated_conjecture,(join(composition(complement(composition(esk1_0,esk2_0)),converse(esk2_0)),complement(esk1_0))!=complement(esk1_0)),inference(split_conjunct,[status(thm)],[44])).
% cnf(46,plain,(complement(join(complement(X1),complement(complement(X1))))=zero),inference(rw,[status(thm)],[41,35,theory(equality)]),['unfolding']).
% cnf(47,negated_conjecture,(join(complement(esk1_0),composition(complement(composition(esk1_0,esk2_0)),converse(esk2_0)))!=complement(esk1_0)),inference(rw,[status(thm)],[45,17,theory(equality)])).
% cnf(51,plain,(join(X1,converse(X2))=converse(join(converse(X1),X2))),inference(spm,[status(thm)],[29,27,theory(equality)])).
% cnf(54,plain,(composition(converse(X1),X2)=converse(composition(converse(X2),X1))),inference(spm,[status(thm)],[31,27,theory(equality)])).
% cnf(55,plain,(composition(X1,converse(X2))=converse(composition(X2,converse(X1)))),inference(spm,[status(thm)],[31,27,theory(equality)])).
% cnf(79,plain,(converse(top)=join(X1,converse(complement(converse(X1))))),inference(spm,[status(thm)],[51,37,theory(equality)])).
% cnf(92,plain,(join(X1,join(X2,complement(join(X1,X2))))=top),inference(spm,[status(thm)],[37,19,theory(equality)])).
% cnf(93,plain,(join(X1,join(X2,X3))=join(X3,join(X1,X2))),inference(spm,[status(thm)],[17,19,theory(equality)])).
% cnf(97,plain,(join(top,X2)=join(X1,join(complement(X1),X2))),inference(spm,[status(thm)],[19,37,theory(equality)])).
% cnf(128,plain,(converse(converse(X1))=composition(converse(one),X1)),inference(spm,[status(thm)],[54,39,theory(equality)])).
% cnf(136,plain,(X1=composition(converse(one),X1)),inference(rw,[status(thm)],[128,27,theory(equality)])).
% cnf(140,plain,(one=converse(one)),inference(spm,[status(thm)],[39,136,theory(equality)])).
% cnf(157,plain,(composition(one,X1)=X1),inference(rw,[status(thm)],[136,140,theory(equality)])).
% cnf(219,plain,(complement(top)=zero),inference(rw,[status(thm)],[46,37,theory(equality)])).
% cnf(287,plain,(join(X1,top)=join(top,complement(complement(X1)))),inference(spm,[status(thm)],[97,37,theory(equality)])).
% cnf(449,plain,(join(X1,join(X2,complement(join(X2,X1))))=top),inference(spm,[status(thm)],[92,17,theory(equality)])).
% cnf(705,plain,(join(complement(X2),composition(converse(X1),complement(composition(X1,X2))))=complement(X2)),inference(rw,[status(thm)],[33,17,theory(equality)])).
% cnf(713,plain,(join(complement(X1),composition(converse(one),complement(X1)))=complement(X1)),inference(spm,[status(thm)],[705,157,theory(equality)])).
% cnf(714,plain,(join(complement(converse(X1)),composition(converse(converse(X2)),complement(converse(composition(X1,X2)))))=complement(converse(X1))),inference(spm,[status(thm)],[705,31,theory(equality)])).
% cnf(731,plain,(join(complement(X1),complement(X1))=complement(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[713,140,theory(equality)]),157,theory(equality)])).
% cnf(732,plain,(join(complement(converse(X1)),composition(X2,complement(converse(composition(X1,X2)))))=complement(converse(X1))),inference(rw,[status(thm)],[714,27,theory(equality)])).
% cnf(741,plain,(join(complement(X1),join(complement(X1),complement(complement(X1))))=top),inference(spm,[status(thm)],[92,731,theory(equality)])).
% cnf(749,plain,(join(zero,zero)=zero),inference(spm,[status(thm)],[731,219,theory(equality)])).
% cnf(752,plain,(join(complement(X1),top)=top),inference(rw,[status(thm)],[741,37,theory(equality)])).
% cnf(762,plain,(join(zero,X1)=join(zero,join(zero,X1))),inference(spm,[status(thm)],[19,749,theory(equality)])).
% cnf(773,plain,(join(top,complement(X1))=top),inference(rw,[status(thm)],[752,17,theory(equality)])).
% cnf(784,plain,(top=join(X1,top)),inference(rw,[status(thm)],[287,773,theory(equality)])).
% cnf(795,plain,(top=join(top,X1)),inference(spm,[status(thm)],[17,784,theory(equality)])).
% cnf(817,plain,(top=converse(top)),inference(spm,[status(thm)],[79,795,theory(equality)])).
% cnf(872,plain,(join(X1,converse(complement(converse(X1))))=top),inference(rw,[status(thm)],[79,817,theory(equality)])).
% cnf(919,plain,(join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2))))=X1),inference(rw,[status(thm)],[21,17,theory(equality)])).
% cnf(931,plain,(join(complement(join(complement(X1),complement(X1))),complement(top))=X1),inference(spm,[status(thm)],[919,37,theory(equality)])).
% cnf(945,plain,(join(complement(complement(X1)),zero)=X1),inference(rw,[status(thm)],[inference(rw,[status(thm)],[931,731,theory(equality)]),219,theory(equality)])).
% cnf(952,plain,(join(zero,complement(complement(X1)))=X1),inference(rw,[status(thm)],[945,17,theory(equality)])).
% cnf(1031,plain,(join(zero,X1)=X1),inference(spm,[status(thm)],[762,952,theory(equality)])).
% cnf(1057,plain,(X1=join(X1,zero)),inference(spm,[status(thm)],[17,1031,theory(equality)])).
% cnf(1067,plain,(complement(complement(X1))=X1),inference(rw,[status(thm)],[952,1031,theory(equality)])).
% cnf(1093,plain,(join(X1,X1)=X1),inference(spm,[status(thm)],[731,1067,theory(equality)])).
% cnf(1115,plain,(join(X1,X2)=join(X1,join(X1,X2))),inference(spm,[status(thm)],[19,1093,theory(equality)])).
% cnf(1120,plain,(join(X1,X2)=join(X2,join(X1,X2))),inference(spm,[status(thm)],[93,1093,theory(equality)])).
% cnf(1589,plain,(join(complement(join(complement(X1),X2)),X1)=X1),inference(spm,[status(thm)],[1115,919,theory(equality)])).
% cnf(1957,plain,(join(X1,complement(join(complement(X1),X2)))=X1),inference(rw,[status(thm)],[1589,17,theory(equality)])).
% cnf(1992,plain,(join(X1,complement(join(X2,complement(X1))))=X1),inference(spm,[status(thm)],[1957,1120,theory(equality)])).
% cnf(2039,plain,(join(X1,X3)=join(X1,join(complement(join(X2,complement(X1))),X3))),inference(spm,[status(thm)],[19,1992,theory(equality)])).
% cnf(2051,plain,(join(complement(X1),complement(join(X2,X1)))=complement(X1)),inference(spm,[status(thm)],[1992,1067,theory(equality)])).
% cnf(68574,plain,(join(X1,X2)=join(X1,complement(join(complement(X2),complement(complement(X1)))))),inference(spm,[status(thm)],[2039,919,theory(equality)])).
% cnf(68926,plain,(join(X1,X2)=join(X1,complement(join(complement(X2),X1)))),inference(rw,[status(thm)],[68574,1067,theory(equality)])).
% cnf(69068,plain,(join(X1,complement(join(X2,X1)))=join(X1,complement(X2))),inference(spm,[status(thm)],[68926,1067,theory(equality)])).
% cnf(69793,plain,(join(join(X1,complement(join(X1,X2))),complement(top))=join(join(X1,complement(join(X1,X2))),complement(X2))),inference(spm,[status(thm)],[69068,449,theory(equality)])).
% cnf(70072,plain,(join(X1,complement(join(X1,X2)))=join(join(X1,complement(join(X1,X2))),complement(X2))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[69793,219,theory(equality)]),19,theory(equality)]),1057,theory(equality)])).
% cnf(70073,plain,(join(X1,complement(join(X1,X2)))=join(X1,complement(X2))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[70072,19,theory(equality)]),17,theory(equality)]),2051,theory(equality)])).
% cnf(72176,plain,(join(X1,complement(top))=join(X1,complement(converse(complement(converse(X1)))))),inference(spm,[status(thm)],[70073,872,theory(equality)])).
% cnf(72466,plain,(X1=join(X1,complement(converse(complement(converse(X1)))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[72176,219,theory(equality)]),1057,theory(equality)])).
% cnf(72602,plain,(converse(converse(X1))=join(X1,converse(complement(converse(complement(converse(converse(X1)))))))),inference(spm,[status(thm)],[51,72466,theory(equality)])).
% cnf(72777,plain,(X1=join(X1,converse(complement(converse(complement(converse(converse(X1)))))))),inference(rw,[status(thm)],[72602,27,theory(equality)])).
% cnf(72778,plain,(X1=join(X1,converse(complement(converse(complement(X1)))))),inference(rw,[status(thm)],[72777,27,theory(equality)])).
% cnf(73019,plain,(join(complement(X1),converse(complement(converse(X1))))=complement(X1)),inference(spm,[status(thm)],[72778,1067,theory(equality)])).
% cnf(73337,plain,(join(complement(converse(complement(converse(X1)))),complement(complement(X1)))=complement(converse(complement(converse(X1))))),inference(spm,[status(thm)],[2051,73019,theory(equality)])).
% cnf(73445,plain,(X1=complement(converse(complement(converse(X1))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[73337,1067,theory(equality)]),17,theory(equality)]),72466,theory(equality)])).
% cnf(73499,plain,(complement(X1)=converse(complement(converse(X1)))),inference(spm,[status(thm)],[1067,73445,theory(equality)])).
% cnf(73680,plain,(converse(complement(X1))=complement(converse(X1))),inference(spm,[status(thm)],[27,73499,theory(equality)])).
% cnf(73854,plain,(converse(join(complement(converse(X1)),X2))=join(complement(X1),converse(X2))),inference(spm,[status(thm)],[51,73680,theory(equality)])).
% cnf(73898,plain,(converse(composition(X1,complement(converse(X2))))=composition(complement(X2),converse(X1))),inference(spm,[status(thm)],[55,73680,theory(equality)])).
% cnf(111899,plain,(converse(complement(converse(X1)))=join(complement(X1),converse(composition(X2,complement(converse(composition(X1,X2))))))),inference(spm,[status(thm)],[73854,732,theory(equality)])).
% cnf(112146,plain,(complement(X1)=join(complement(X1),converse(composition(X2,complement(converse(composition(X1,X2))))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[111899,73680,theory(equality)]),27,theory(equality)])).
% cnf(112147,plain,(complement(X1)=join(complement(X1),composition(complement(composition(X1,X2)),converse(X2)))),inference(rw,[status(thm)],[112146,73898,theory(equality)])).
% cnf(934494,negated_conjecture,($false),inference(rw,[status(thm)],[47,112147,theory(equality)])).
% cnf(934495,negated_conjecture,($false),inference(cn,[status(thm)],[934494,theory(equality)])).
% cnf(934496,negated_conjecture,($false),934495,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 10158
% # ...of these trivial : 7687
% # ...subsumed : 1046
% # ...remaining for further processing: 1425
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 263
% # Generated clauses : 464847
% # ...of the previous two non-trivial : 235293
% # Contextual simplify-reflections : 0
% # Paramodulations : 464847
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 1162
% # Positive orientable unit clauses: 1153
% # Positive unorientable unit clauses: 9
% # Negative unit clauses : 0
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 192708
% # ...number of literals in the above : 192708
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 55
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 11615
% # Indexed BW rewrite successes : 369
% # Backwards rewriting index: 724 leaves, 3.61+/-4.887 terms/leaf
% # Paramod-from index: 427 leaves, 2.73+/-3.262 terms/leaf
% # Paramod-into index: 649 leaves, 3.23+/-4.241 terms/leaf
% # -------------------------------------------------
% # User time : 13.968 s
% # System time : 0.617 s
% # Total time : 14.585 s
% # Maximum resident set size: 0 pages
% PrfWatch: 28.35 CPU 28.65 WC
% FINAL PrfWatch: 28.35 CPU 28.65 WC
% SZS output end Solution for /tmp/SystemOnTPTP31810/REL012+1.tptp
%
%------------------------------------------------------------------------------