TSTP Solution File: REL050+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : REL050+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 : art06.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 22:04:01 EST 2010
% Result : Theorem 2.97s
% Output : Solution 2.97s
% 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/SystemOnTPTP8527/REL050+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP8527/REL050+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP8527/REL050+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 8623
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 1.92 CPU 2.02 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:composition(X1,composition(X2,X3))=composition(composition(X1,X2),X3),file('/tmp/SRASS.s.p', composition_associativity)).
% fof(2, axiom,![X1]:top=join(X1,complement(X1)),file('/tmp/SRASS.s.p', def_top)).
% 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(4, axiom,![X1]:![X2]:![X3]:composition(join(X1,X2),X3)=join(composition(X1,X3),composition(X2,X3)),file('/tmp/SRASS.s.p', composition_distributivity)).
% fof(5, axiom,![X1]:![X2]:join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2),file('/tmp/SRASS.s.p', converse_cancellativity)).
% fof(6, axiom,![X1]:![X2]:join(X1,X2)=join(X2,X1),file('/tmp/SRASS.s.p', maddux1_join_commutativity)).
% fof(7, axiom,![X1]:![X2]:![X3]:join(X1,join(X2,X3))=join(join(X1,X2),X3),file('/tmp/SRASS.s.p', maddux2_join_associativity)).
% fof(8, axiom,![X1]:converse(converse(X1))=X1,file('/tmp/SRASS.s.p', converse_idempotence)).
% fof(9, axiom,![X1]:![X2]:converse(join(X1,X2))=join(converse(X1),converse(X2)),file('/tmp/SRASS.s.p', converse_additivity)).
% fof(10, axiom,![X1]:![X2]:converse(composition(X1,X2))=composition(converse(X2),converse(X1)),file('/tmp/SRASS.s.p', converse_multiplicativity)).
% fof(11, axiom,![X1]:composition(X1,one)=X1,file('/tmp/SRASS.s.p', composition_identity)).
% fof(12, axiom,![X1]:![X2]:meet(X1,X2)=complement(join(complement(X1),complement(X2))),file('/tmp/SRASS.s.p', maddux4_definiton_of_meet)).
% fof(13, axiom,![X1]:zero=meet(X1,complement(X1)),file('/tmp/SRASS.s.p', def_zero)).
% fof(14, conjecture,![X1]:complement(composition(X1,top))=composition(complement(composition(X1,top)),top),file('/tmp/SRASS.s.p', goals)).
% fof(15, negated_conjecture,~(![X1]:complement(composition(X1,top))=composition(complement(composition(X1,top)),top)),inference(assume_negation,[status(cth)],[14])).
% fof(16, plain,![X4]:![X5]:![X6]:composition(X4,composition(X5,X6))=composition(composition(X4,X5),X6),inference(variable_rename,[status(thm)],[1])).
% cnf(17,plain,(composition(X1,composition(X2,X3))=composition(composition(X1,X2),X3)),inference(split_conjunct,[status(thm)],[16])).
% fof(18, plain,![X2]:top=join(X2,complement(X2)),inference(variable_rename,[status(thm)],[2])).
% cnf(19,plain,(top=join(X1,complement(X1))),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(22, plain,![X4]:![X5]:![X6]:composition(join(X4,X5),X6)=join(composition(X4,X6),composition(X5,X6)),inference(variable_rename,[status(thm)],[4])).
% cnf(23,plain,(composition(join(X1,X2),X3)=join(composition(X1,X3),composition(X2,X3))),inference(split_conjunct,[status(thm)],[22])).
% fof(24, plain,![X3]:![X4]:join(composition(converse(X3),complement(composition(X3,X4))),complement(X4))=complement(X4),inference(variable_rename,[status(thm)],[5])).
% cnf(25,plain,(join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2)),inference(split_conjunct,[status(thm)],[24])).
% fof(26, plain,![X3]:![X4]:join(X3,X4)=join(X4,X3),inference(variable_rename,[status(thm)],[6])).
% cnf(27,plain,(join(X1,X2)=join(X2,X1)),inference(split_conjunct,[status(thm)],[26])).
% fof(28, plain,![X4]:![X5]:![X6]:join(X4,join(X5,X6))=join(join(X4,X5),X6),inference(variable_rename,[status(thm)],[7])).
% cnf(29,plain,(join(X1,join(X2,X3))=join(join(X1,X2),X3)),inference(split_conjunct,[status(thm)],[28])).
% fof(30, plain,![X2]:converse(converse(X2))=X2,inference(variable_rename,[status(thm)],[8])).
% cnf(31,plain,(converse(converse(X1))=X1),inference(split_conjunct,[status(thm)],[30])).
% fof(32, plain,![X3]:![X4]:converse(join(X3,X4))=join(converse(X3),converse(X4)),inference(variable_rename,[status(thm)],[9])).
% cnf(33,plain,(converse(join(X1,X2))=join(converse(X1),converse(X2))),inference(split_conjunct,[status(thm)],[32])).
% fof(34, plain,![X3]:![X4]:converse(composition(X3,X4))=composition(converse(X4),converse(X3)),inference(variable_rename,[status(thm)],[10])).
% cnf(35,plain,(converse(composition(X1,X2))=composition(converse(X2),converse(X1))),inference(split_conjunct,[status(thm)],[34])).
% fof(36, plain,![X2]:composition(X2,one)=X2,inference(variable_rename,[status(thm)],[11])).
% cnf(37,plain,(composition(X1,one)=X1),inference(split_conjunct,[status(thm)],[36])).
% fof(38, plain,![X3]:![X4]:meet(X3,X4)=complement(join(complement(X3),complement(X4))),inference(variable_rename,[status(thm)],[12])).
% cnf(39,plain,(meet(X1,X2)=complement(join(complement(X1),complement(X2)))),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]:~(complement(composition(X1,top))=composition(complement(composition(X1,top)),top)),inference(fof_nnf,[status(thm)],[15])).
% fof(43, negated_conjecture,?[X2]:~(complement(composition(X2,top))=composition(complement(composition(X2,top)),top)),inference(variable_rename,[status(thm)],[42])).
% fof(44, negated_conjecture,~(complement(composition(esk1_0,top))=composition(complement(composition(esk1_0,top)),top)),inference(skolemize,[status(esa)],[43])).
% cnf(45,negated_conjecture,(complement(composition(esk1_0,top))!=composition(complement(composition(esk1_0,top)),top)),inference(split_conjunct,[status(thm)],[44])).
% cnf(46,plain,(complement(join(complement(X1),complement(complement(X1))))=zero),inference(rw,[status(thm)],[41,39,theory(equality)]),['unfolding']).
% cnf(47,plain,(composition(converse(X1),X2)=converse(composition(converse(X2),X1))),inference(spm,[status(thm)],[35,31,theory(equality)])).
% cnf(52,plain,(join(X1,converse(X2))=converse(join(converse(X1),X2))),inference(spm,[status(thm)],[33,31,theory(equality)])).
% cnf(62,plain,(converse(converse(X1))=composition(converse(one),X1)),inference(spm,[status(thm)],[47,37,theory(equality)])).
% cnf(66,plain,(X1=composition(converse(one),X1)),inference(rw,[status(thm)],[62,31,theory(equality)])).
% cnf(69,plain,(one=converse(one)),inference(spm,[status(thm)],[37,66,theory(equality)])).
% cnf(80,plain,(composition(one,X1)=X1),inference(rw,[status(thm)],[66,69,theory(equality)])).
% cnf(98,plain,(join(X1,join(X2,complement(join(X1,X2))))=top),inference(spm,[status(thm)],[19,29,theory(equality)])).
% cnf(99,plain,(join(X1,join(X2,X3))=join(X3,join(X1,X2))),inference(spm,[status(thm)],[27,29,theory(equality)])).
% cnf(103,plain,(join(top,X2)=join(X1,join(complement(X1),X2))),inference(spm,[status(thm)],[29,19,theory(equality)])).
% cnf(223,plain,(converse(top)=join(X1,converse(complement(converse(X1))))),inference(spm,[status(thm)],[52,19,theory(equality)])).
% cnf(248,plain,(complement(top)=zero),inference(rw,[status(thm)],[46,19,theory(equality)])).
% cnf(308,plain,(join(X1,top)=join(top,complement(complement(X1)))),inference(spm,[status(thm)],[103,19,theory(equality)])).
% cnf(363,plain,(join(X1,join(X2,complement(join(X2,X1))))=top),inference(spm,[status(thm)],[98,27,theory(equality)])).
% cnf(426,plain,(join(composition(X1,X2),X2)=composition(join(X1,one),X2)),inference(spm,[status(thm)],[23,80,theory(equality)])).
% cnf(717,plain,(join(complement(X2),composition(converse(X1),complement(composition(X1,X2))))=complement(X2)),inference(rw,[status(thm)],[25,27,theory(equality)])).
% cnf(725,plain,(join(complement(X1),composition(converse(one),complement(X1)))=complement(X1)),inference(spm,[status(thm)],[717,80,theory(equality)])).
% cnf(739,plain,(join(zero,composition(converse(X1),complement(composition(X1,top))))=zero),inference(spm,[status(thm)],[717,248,theory(equality)])).
% cnf(744,plain,(join(complement(X1),complement(X1))=complement(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[725,69,theory(equality)]),80,theory(equality)])).
% cnf(751,plain,(join(complement(X1),join(complement(X1),complement(complement(X1))))=top),inference(spm,[status(thm)],[98,744,theory(equality)])).
% cnf(760,plain,(join(zero,zero)=zero),inference(spm,[status(thm)],[744,248,theory(equality)])).
% cnf(763,plain,(join(complement(X1),top)=top),inference(rw,[status(thm)],[751,19,theory(equality)])).
% cnf(773,plain,(join(zero,X1)=join(zero,join(zero,X1))),inference(spm,[status(thm)],[29,760,theory(equality)])).
% cnf(784,plain,(join(top,complement(X1))=top),inference(rw,[status(thm)],[763,27,theory(equality)])).
% cnf(795,plain,(top=join(X1,top)),inference(rw,[status(thm)],[308,784,theory(equality)])).
% cnf(806,plain,(top=join(top,X1)),inference(spm,[status(thm)],[27,795,theory(equality)])).
% cnf(829,plain,(top=converse(top)),inference(spm,[status(thm)],[223,806,theory(equality)])).
% cnf(876,plain,(converse(composition(top,X1))=composition(converse(X1),top)),inference(spm,[status(thm)],[47,829,theory(equality)])).
% cnf(880,plain,(join(complement(X1),composition(top,complement(composition(top,X1))))=complement(X1)),inference(spm,[status(thm)],[717,829,theory(equality)])).
% cnf(883,plain,(join(X1,converse(complement(converse(X1))))=top),inference(rw,[status(thm)],[223,829,theory(equality)])).
% cnf(979,plain,(join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2))))=X1),inference(rw,[status(thm)],[21,27,theory(equality)])).
% cnf(991,plain,(join(complement(join(complement(X1),complement(X1))),complement(top))=X1),inference(spm,[status(thm)],[979,19,theory(equality)])).
% cnf(1005,plain,(join(complement(complement(X1)),zero)=X1),inference(rw,[status(thm)],[inference(rw,[status(thm)],[991,744,theory(equality)]),248,theory(equality)])).
% cnf(1012,plain,(join(zero,complement(complement(X1)))=X1),inference(rw,[status(thm)],[1005,27,theory(equality)])).
% cnf(1043,plain,(join(zero,X1)=X1),inference(spm,[status(thm)],[773,1012,theory(equality)])).
% cnf(1069,plain,(X1=join(X1,zero)),inference(spm,[status(thm)],[27,1043,theory(equality)])).
% cnf(1076,plain,(complement(complement(X1))=X1),inference(rw,[status(thm)],[1012,1043,theory(equality)])).
% cnf(1105,plain,(join(X1,X1)=X1),inference(spm,[status(thm)],[744,1076,theory(equality)])).
% cnf(1152,plain,(join(X1,X2)=join(X1,join(X1,X2))),inference(spm,[status(thm)],[29,1105,theory(equality)])).
% cnf(1157,plain,(join(X1,X2)=join(X2,join(X1,X2))),inference(spm,[status(thm)],[99,1105,theory(equality)])).
% cnf(1558,plain,(join(complement(join(complement(X1),X2)),X1)=X1),inference(spm,[status(thm)],[1152,979,theory(equality)])).
% cnf(1931,plain,(join(X1,complement(join(complement(X1),X2)))=X1),inference(rw,[status(thm)],[1558,27,theory(equality)])).
% cnf(1964,plain,(join(X1,complement(join(X2,complement(X1))))=X1),inference(spm,[status(thm)],[1931,1157,theory(equality)])).
% cnf(2013,plain,(join(X1,X3)=join(X1,join(complement(join(X2,complement(X1))),X3))),inference(spm,[status(thm)],[29,1964,theory(equality)])).
% cnf(2024,plain,(join(complement(X1),complement(join(X2,X1)))=complement(X1)),inference(spm,[status(thm)],[1964,1076,theory(equality)])).
% cnf(10990,plain,(composition(converse(X1),complement(composition(X1,top)))=zero),inference(rw,[status(thm)],[739,1043,theory(equality)])).
% cnf(11027,plain,(composition(top,complement(composition(top,top)))=zero),inference(spm,[status(thm)],[10990,829,theory(equality)])).
% cnf(11083,plain,(join(zero,composition(X1,complement(composition(top,top))))=composition(join(top,X1),complement(composition(top,top)))),inference(spm,[status(thm)],[23,11027,theory(equality)])).
% cnf(11087,plain,(composition(X1,complement(composition(top,top)))=composition(join(top,X1),complement(composition(top,top)))),inference(rw,[status(thm)],[11083,1043,theory(equality)])).
% cnf(11088,plain,(composition(X1,complement(composition(top,top)))=zero),inference(rw,[status(thm)],[inference(rw,[status(thm)],[11087,806,theory(equality)]),11027,theory(equality)])).
% cnf(11095,plain,(zero=complement(composition(top,top))),inference(spm,[status(thm)],[80,11088,theory(equality)])).
% cnf(11248,plain,(join(composition(top,top),zero)=top),inference(spm,[status(thm)],[19,11095,theory(equality)])).
% cnf(11271,plain,(composition(top,top)=top),inference(rw,[status(thm)],[11248,1069,theory(equality)])).
% cnf(11294,plain,(composition(top,X1)=composition(top,composition(top,X1))),inference(spm,[status(thm)],[17,11271,theory(equality)])).
% cnf(12872,plain,(join(X2,composition(X1,X2))=composition(join(X1,one),X2)),inference(rw,[status(thm)],[426,27,theory(equality)])).
% cnf(12929,plain,(join(X1,composition(top,X1))=composition(top,X1)),inference(spm,[status(thm)],[12872,806,theory(equality)])).
% cnf(68062,plain,(join(X1,X2)=join(X1,complement(join(complement(X2),complement(complement(X1)))))),inference(spm,[status(thm)],[2013,979,theory(equality)])).
% cnf(68406,plain,(join(X1,X2)=join(X1,complement(join(complement(X2),X1)))),inference(rw,[status(thm)],[68062,1076,theory(equality)])).
% cnf(68554,plain,(join(X1,complement(join(X2,X1)))=join(X1,complement(X2))),inference(spm,[status(thm)],[68406,1076,theory(equality)])).
% cnf(71018,plain,(join(join(X1,complement(join(X1,X2))),complement(top))=join(join(X1,complement(join(X1,X2))),complement(X2))),inference(spm,[status(thm)],[68554,363,theory(equality)])).
% cnf(71296,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)],[71018,248,theory(equality)]),29,theory(equality)]),1069,theory(equality)])).
% cnf(71297,plain,(join(X1,complement(join(X1,X2)))=join(X1,complement(X2))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[71296,29,theory(equality)]),27,theory(equality)]),2024,theory(equality)])).
% cnf(71566,plain,(join(X1,complement(top))=join(X1,complement(converse(complement(converse(X1)))))),inference(spm,[status(thm)],[71297,883,theory(equality)])).
% cnf(71840,plain,(X1=join(X1,complement(converse(complement(converse(X1)))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[71566,248,theory(equality)]),1069,theory(equality)])).
% cnf(71975,plain,(converse(converse(X1))=join(X1,converse(complement(converse(complement(converse(converse(X1)))))))),inference(spm,[status(thm)],[52,71840,theory(equality)])).
% cnf(72148,plain,(X1=join(X1,converse(complement(converse(complement(converse(converse(X1)))))))),inference(rw,[status(thm)],[71975,31,theory(equality)])).
% cnf(72149,plain,(X1=join(X1,converse(complement(converse(complement(X1)))))),inference(rw,[status(thm)],[72148,31,theory(equality)])).
% cnf(72386,plain,(join(complement(X1),converse(complement(converse(X1))))=complement(X1)),inference(spm,[status(thm)],[72149,1076,theory(equality)])).
% cnf(72702,plain,(join(complement(converse(complement(converse(X1)))),complement(complement(X1)))=complement(converse(complement(converse(X1))))),inference(spm,[status(thm)],[2024,72386,theory(equality)])).
% cnf(72810,plain,(X1=complement(converse(complement(converse(X1))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[72702,1076,theory(equality)]),27,theory(equality)]),71840,theory(equality)])).
% cnf(72864,plain,(complement(X1)=converse(complement(converse(X1)))),inference(spm,[status(thm)],[1076,72810,theory(equality)])).
% cnf(73038,plain,(converse(complement(X1))=complement(converse(X1))),inference(spm,[status(thm)],[31,72864,theory(equality)])).
% cnf(90252,plain,(join(complement(composition(top,X1)),composition(top,complement(composition(top,X1))))=complement(composition(top,X1))),inference(spm,[status(thm)],[880,11294,theory(equality)])).
% cnf(90348,plain,(composition(top,complement(composition(top,X1)))=complement(composition(top,X1))),inference(rw,[status(thm)],[90252,12929,theory(equality)])).
% cnf(90386,plain,(converse(complement(composition(top,X1)))=composition(converse(complement(composition(top,X1))),top)),inference(spm,[status(thm)],[876,90348,theory(equality)])).
% cnf(90486,plain,(complement(composition(converse(X1),top))=composition(converse(complement(composition(top,X1))),top)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[90386,73038,theory(equality)]),876,theory(equality)])).
% cnf(90487,plain,(complement(composition(converse(X1),top))=composition(complement(composition(converse(X1),top)),top)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[90486,73038,theory(equality)]),876,theory(equality)])).
% cnf(90634,plain,(composition(complement(composition(X1,top)),top)=complement(composition(X1,top))),inference(spm,[status(thm)],[90487,31,theory(equality)])).
% cnf(90915,negated_conjecture,($false),inference(rw,[status(thm)],[45,90634,theory(equality)])).
% cnf(90916,negated_conjecture,($false),inference(cn,[status(thm)],[90915,theory(equality)])).
% cnf(90917,negated_conjecture,($false),90916,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1998
% # ...of these trivial : 1258
% # ...subsumed : 263
% # ...remaining for further processing: 477
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 164
% # Generated clauses : 45860
% # ...of the previous two non-trivial : 21405
% # Contextual simplify-reflections : 0
% # Paramodulations : 45860
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 313
% # Positive orientable unit clauses: 305
% # Positive unorientable unit clauses: 8
% # Negative unit clauses : 0
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 13244
% # ...number of literals in the above : 13244
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 67
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1677
% # Indexed BW rewrite successes : 268
% # Backwards rewriting index: 316 leaves, 2.07+/-2.131 terms/leaf
% # Paramod-from index: 173 leaves, 1.83+/-1.770 terms/leaf
% # Paramod-into index: 282 leaves, 2.00+/-2.004 terms/leaf
% # -------------------------------------------------
% # User time : 0.965 s
% # System time : 0.047 s
% # Total time : 1.012 s
% # Maximum resident set size: 0 pages
% PrfWatch: 2.16 CPU 2.26 WC
% FINAL PrfWatch: 2.16 CPU 2.26 WC
% SZS output end Solution for /tmp/SystemOnTPTP8527/REL050+1.tptp
%
%------------------------------------------------------------------------------