TSTP Solution File: REL007+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : REL007+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 : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Wed Dec 29 21:40:27 EST 2010
% Result : Theorem 1.22s
% Output : Solution 1.22s
% 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/SystemOnTPTP24575/REL007+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP24575/REL007+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP24575/REL007+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 24707
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.010 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]:zero=meet(X1,complement(X1)),file('/tmp/SRASS.s.p', def_zero)).
% fof(3, axiom,![X1]:![X2]:converse(join(X1,X2))=join(converse(X1),converse(X2)),file('/tmp/SRASS.s.p', converse_additivity)).
% fof(4, axiom,![X1]:![X2]:converse(composition(X1,X2))=composition(converse(X2),converse(X1)),file('/tmp/SRASS.s.p', converse_multiplicativity)).
% fof(5, axiom,![X1]:![X2]:join(X1,X2)=join(X2,X1),file('/tmp/SRASS.s.p', maddux1_join_commutativity)).
% fof(6, 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]:![X2]:meet(X1,X2)=complement(join(complement(X1),complement(X2))),file('/tmp/SRASS.s.p', maddux4_definiton_of_meet)).
% fof(9, 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(11, axiom,![X1]:![X2]:join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2),file('/tmp/SRASS.s.p', converse_cancellativity)).
% fof(12, axiom,![X1]:composition(X1,one)=X1,file('/tmp/SRASS.s.p', composition_identity)).
% fof(13, axiom,![X1]:top=join(X1,complement(X1)),file('/tmp/SRASS.s.p', def_top)).
% fof(14, conjecture,![X1]:![X2]:(meet(X1,converse(X2))=zero=>meet(converse(X1),X2)=zero),file('/tmp/SRASS.s.p', goals)).
% fof(15, negated_conjecture,~(![X1]:![X2]:(meet(X1,converse(X2))=zero=>meet(converse(X1),X2)=zero)),inference(assume_negation,[status(cth)],[14])).
% fof(16, plain,![X2]:converse(converse(X2))=X2,inference(variable_rename,[status(thm)],[1])).
% cnf(17,plain,(converse(converse(X1))=X1),inference(split_conjunct,[status(thm)],[16])).
% fof(18, plain,![X2]:zero=meet(X2,complement(X2)),inference(variable_rename,[status(thm)],[2])).
% cnf(19,plain,(zero=meet(X1,complement(X1))),inference(split_conjunct,[status(thm)],[18])).
% fof(20, plain,![X3]:![X4]:converse(join(X3,X4))=join(converse(X3),converse(X4)),inference(variable_rename,[status(thm)],[3])).
% cnf(21,plain,(converse(join(X1,X2))=join(converse(X1),converse(X2))),inference(split_conjunct,[status(thm)],[20])).
% fof(22, plain,![X3]:![X4]:converse(composition(X3,X4))=composition(converse(X4),converse(X3)),inference(variable_rename,[status(thm)],[4])).
% cnf(23,plain,(converse(composition(X1,X2))=composition(converse(X2),converse(X1))),inference(split_conjunct,[status(thm)],[22])).
% fof(24, plain,![X3]:![X4]:join(X3,X4)=join(X4,X3),inference(variable_rename,[status(thm)],[5])).
% cnf(25,plain,(join(X1,X2)=join(X2,X1)),inference(split_conjunct,[status(thm)],[24])).
% fof(26, plain,![X4]:![X5]:![X6]:join(X4,join(X5,X6))=join(join(X4,X5),X6),inference(variable_rename,[status(thm)],[6])).
% cnf(27,plain,(join(X1,join(X2,X3))=join(join(X1,X2),X3)),inference(split_conjunct,[status(thm)],[26])).
% fof(30, plain,![X3]:![X4]:meet(X3,X4)=complement(join(complement(X3),complement(X4))),inference(variable_rename,[status(thm)],[8])).
% cnf(31,plain,(meet(X1,X2)=complement(join(complement(X1),complement(X2)))),inference(split_conjunct,[status(thm)],[30])).
% fof(32, plain,![X3]:![X4]:X3=join(complement(join(complement(X3),complement(X4))),complement(join(complement(X3),X4))),inference(variable_rename,[status(thm)],[9])).
% cnf(33,plain,(X1=join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2)))),inference(split_conjunct,[status(thm)],[32])).
% fof(36, plain,![X3]:![X4]:join(composition(converse(X3),complement(composition(X3,X4))),complement(X4))=complement(X4),inference(variable_rename,[status(thm)],[11])).
% cnf(37,plain,(join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2)),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]:top=join(X2,complement(X2)),inference(variable_rename,[status(thm)],[13])).
% cnf(41,plain,(top=join(X1,complement(X1))),inference(split_conjunct,[status(thm)],[40])).
% fof(42, negated_conjecture,?[X1]:?[X2]:(meet(X1,converse(X2))=zero&~(meet(converse(X1),X2)=zero)),inference(fof_nnf,[status(thm)],[15])).
% fof(43, negated_conjecture,?[X3]:?[X4]:(meet(X3,converse(X4))=zero&~(meet(converse(X3),X4)=zero)),inference(variable_rename,[status(thm)],[42])).
% fof(44, negated_conjecture,(meet(esk1_0,converse(esk2_0))=zero&~(meet(converse(esk1_0),esk2_0)=zero)),inference(skolemize,[status(esa)],[43])).
% cnf(45,negated_conjecture,(meet(converse(esk1_0),esk2_0)!=zero),inference(split_conjunct,[status(thm)],[44])).
% cnf(46,negated_conjecture,(meet(esk1_0,converse(esk2_0))=zero),inference(split_conjunct,[status(thm)],[44])).
% cnf(47,plain,(complement(join(complement(X1),complement(complement(X1))))=zero),inference(rw,[status(thm)],[19,31,theory(equality)]),['unfolding']).
% cnf(48,negated_conjecture,(complement(join(complement(esk1_0),complement(converse(esk2_0))))=zero),inference(rw,[status(thm)],[46,31,theory(equality)]),['unfolding']).
% cnf(49,negated_conjecture,(complement(join(complement(converse(esk1_0)),complement(esk2_0)))!=zero),inference(rw,[status(thm)],[45,31,theory(equality)]),['unfolding']).
% cnf(50,negated_conjecture,(complement(join(complement(esk2_0),complement(converse(esk1_0))))!=zero),inference(rw,[status(thm)],[49,25,theory(equality)])).
% cnf(53,plain,(join(converse(X1),X2)=converse(join(X1,converse(X2)))),inference(spm,[status(thm)],[21,17,theory(equality)])).
% cnf(54,plain,(join(X1,converse(X2))=converse(join(converse(X1),X2))),inference(spm,[status(thm)],[21,17,theory(equality)])).
% cnf(57,plain,(composition(converse(X1),X2)=converse(composition(converse(X2),X1))),inference(spm,[status(thm)],[23,17,theory(equality)])).
% cnf(82,plain,(converse(top)=join(X1,converse(complement(converse(X1))))),inference(spm,[status(thm)],[54,41,theory(equality)])).
% cnf(94,plain,(join(X1,join(X2,complement(join(X1,X2))))=top),inference(spm,[status(thm)],[41,27,theory(equality)])).
% cnf(100,plain,(join(top,X2)=join(X1,join(complement(X1),X2))),inference(spm,[status(thm)],[27,41,theory(equality)])).
% cnf(131,plain,(converse(converse(X1))=composition(converse(one),X1)),inference(spm,[status(thm)],[57,39,theory(equality)])).
% cnf(139,plain,(X1=composition(converse(one),X1)),inference(rw,[status(thm)],[131,17,theory(equality)])).
% cnf(143,plain,(one=converse(one)),inference(spm,[status(thm)],[39,139,theory(equality)])).
% cnf(160,plain,(composition(one,X1)=X1),inference(rw,[status(thm)],[139,143,theory(equality)])).
% cnf(291,plain,(complement(top)=zero),inference(rw,[status(thm)],[47,41,theory(equality)])).
% cnf(302,plain,(join(X1,top)=join(top,complement(complement(X1)))),inference(spm,[status(thm)],[100,41,theory(equality)])).
% cnf(304,plain,(join(X1,join(X2,complement(X1)))=join(top,X2)),inference(spm,[status(thm)],[100,25,theory(equality)])).
% cnf(693,plain,(join(complement(X2),composition(converse(X1),complement(composition(X1,X2))))=complement(X2)),inference(rw,[status(thm)],[37,25,theory(equality)])).
% cnf(698,plain,(join(complement(X1),composition(converse(one),complement(X1)))=complement(X1)),inference(spm,[status(thm)],[693,160,theory(equality)])).
% cnf(715,plain,(join(complement(X1),complement(X1))=complement(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[698,143,theory(equality)]),160,theory(equality)])).
% cnf(722,plain,(join(complement(X1),join(complement(X1),complement(complement(X1))))=top),inference(spm,[status(thm)],[94,715,theory(equality)])).
% cnf(727,plain,(join(zero,zero)=zero),inference(spm,[status(thm)],[715,291,theory(equality)])).
% cnf(732,plain,(join(complement(X1),top)=top),inference(rw,[status(thm)],[722,41,theory(equality)])).
% cnf(738,plain,(join(zero,X1)=join(zero,join(zero,X1))),inference(spm,[status(thm)],[27,727,theory(equality)])).
% cnf(751,plain,(join(top,complement(X1))=top),inference(rw,[status(thm)],[732,25,theory(equality)])).
% cnf(763,plain,(top=join(X1,top)),inference(rw,[status(thm)],[302,751,theory(equality)])).
% cnf(791,plain,(top=join(top,X1)),inference(spm,[status(thm)],[25,763,theory(equality)])).
% cnf(814,plain,(top=converse(top)),inference(spm,[status(thm)],[82,791,theory(equality)])).
% cnf(823,plain,(join(X1,join(X2,complement(X1)))=top),inference(rw,[status(thm)],[304,791,theory(equality)])).
% cnf(824,plain,(join(X1,join(complement(X1),X2))=top),inference(rw,[status(thm)],[100,791,theory(equality)])).
% cnf(899,plain,(join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2))))=X1),inference(rw,[status(thm)],[33,25,theory(equality)])).
% cnf(911,plain,(join(complement(join(complement(X1),complement(X1))),complement(top))=X1),inference(spm,[status(thm)],[899,41,theory(equality)])).
% cnf(928,plain,(join(complement(complement(X1)),zero)=X1),inference(rw,[status(thm)],[inference(rw,[status(thm)],[911,715,theory(equality)]),291,theory(equality)])).
% cnf(936,plain,(join(zero,complement(complement(X1)))=X1),inference(rw,[status(thm)],[928,25,theory(equality)])).
% cnf(1012,plain,(join(zero,X1)=X1),inference(spm,[status(thm)],[738,936,theory(equality)])).
% cnf(1031,plain,(complement(zero)=top),inference(spm,[status(thm)],[41,1012,theory(equality)])).
% cnf(1041,plain,(complement(complement(X1))=X1),inference(rw,[status(thm)],[936,1012,theory(equality)])).
% cnf(1069,plain,(join(X1,X1)=X1),inference(spm,[status(thm)],[715,1041,theory(equality)])).
% cnf(1072,negated_conjecture,(complement(zero)=join(complement(esk1_0),complement(converse(esk2_0)))),inference(spm,[status(thm)],[1041,48,theory(equality)])).
% cnf(1078,negated_conjecture,(top=join(complement(esk1_0),complement(converse(esk2_0)))),inference(rw,[status(thm)],[1072,1031,theory(equality)])).
% cnf(1091,plain,(join(X1,X2)=join(X1,join(X1,X2))),inference(spm,[status(thm)],[27,1069,theory(equality)])).
% cnf(1346,plain,(join(complement(X1),join(X2,X1))=top),inference(spm,[status(thm)],[823,1041,theory(equality)])).
% cnf(1388,plain,(join(complement(X1),join(X1,X2))=top),inference(spm,[status(thm)],[824,1041,theory(equality)])).
% cnf(1483,negated_conjecture,(join(complement(top),complement(join(complement(esk1_0),complement(complement(converse(esk2_0))))))=esk1_0),inference(spm,[status(thm)],[899,1078,theory(equality)])).
% cnf(1491,negated_conjecture,(complement(join(complement(esk1_0),converse(esk2_0)))=esk1_0),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[1483,291,theory(equality)]),1041,theory(equality)]),1012,theory(equality)])).
% cnf(1515,plain,(join(complement(join(complement(X1),X2)),X1)=X1),inference(spm,[status(thm)],[1091,899,theory(equality)])).
% cnf(1526,plain,(join(X1,join(X2,X1))=join(X2,X1)),inference(spm,[status(thm)],[1091,25,theory(equality)])).
% cnf(1784,negated_conjecture,(complement(esk1_0)=join(complement(esk1_0),converse(esk2_0))),inference(spm,[status(thm)],[1041,1491,theory(equality)])).
% cnf(1804,negated_conjecture,(converse(complement(esk1_0))=join(converse(complement(esk1_0)),esk2_0)),inference(spm,[status(thm)],[53,1784,theory(equality)])).
% cnf(1816,negated_conjecture,(join(esk2_0,converse(complement(esk1_0)))=converse(complement(esk1_0))),inference(rw,[status(thm)],[1804,25,theory(equality)])).
% cnf(1820,negated_conjecture,(join(complement(esk2_0),converse(complement(esk1_0)))=top),inference(spm,[status(thm)],[1388,1816,theory(equality)])).
% cnf(1917,negated_conjecture,(converse(top)=join(converse(complement(esk2_0)),complement(esk1_0))),inference(spm,[status(thm)],[53,1820,theory(equality)])).
% cnf(1928,negated_conjecture,(top=join(converse(complement(esk2_0)),complement(esk1_0))),inference(rw,[status(thm)],[1917,814,theory(equality)])).
% cnf(1933,negated_conjecture,(join(complement(esk1_0),converse(complement(esk2_0)))=top),inference(rw,[status(thm)],[1928,25,theory(equality)])).
% cnf(1943,negated_conjecture,(join(complement(top),complement(join(complement(esk1_0),complement(converse(complement(esk2_0))))))=esk1_0),inference(spm,[status(thm)],[899,1933,theory(equality)])).
% cnf(1956,negated_conjecture,(complement(join(complement(esk1_0),complement(converse(complement(esk2_0)))))=esk1_0),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1943,291,theory(equality)]),1012,theory(equality)])).
% cnf(2009,plain,(join(X1,complement(join(complement(X1),X2)))=X1),inference(rw,[status(thm)],[1515,25,theory(equality)])).
% cnf(2038,plain,(join(X1,complement(join(X2,complement(X1))))=X1),inference(spm,[status(thm)],[2009,1526,theory(equality)])).
% cnf(2111,plain,(join(complement(X1),complement(join(X2,X1)))=complement(X1)),inference(spm,[status(thm)],[2038,1041,theory(equality)])).
% cnf(4975,negated_conjecture,(join(complement(complement(converse(complement(esk2_0)))),esk1_0)=complement(complement(converse(complement(esk2_0))))),inference(spm,[status(thm)],[2111,1956,theory(equality)])).
% cnf(4995,negated_conjecture,(join(converse(complement(esk2_0)),esk1_0)=complement(complement(converse(complement(esk2_0))))),inference(rw,[status(thm)],[4975,1041,theory(equality)])).
% cnf(4996,negated_conjecture,(join(converse(complement(esk2_0)),esk1_0)=converse(complement(esk2_0))),inference(rw,[status(thm)],[4995,1041,theory(equality)])).
% cnf(5000,negated_conjecture,(join(esk1_0,converse(complement(esk2_0)))=converse(complement(esk2_0))),inference(rw,[status(thm)],[4996,25,theory(equality)])).
% cnf(5013,negated_conjecture,(converse(converse(complement(esk2_0)))=join(converse(esk1_0),complement(esk2_0))),inference(spm,[status(thm)],[53,5000,theory(equality)])).
% cnf(5027,negated_conjecture,(complement(esk2_0)=join(converse(esk1_0),complement(esk2_0))),inference(rw,[status(thm)],[5013,17,theory(equality)])).
% cnf(5034,negated_conjecture,(join(complement(esk2_0),converse(esk1_0))=complement(esk2_0)),inference(rw,[status(thm)],[5027,25,theory(equality)])).
% cnf(5041,negated_conjecture,(join(complement(converse(esk1_0)),complement(esk2_0))=top),inference(spm,[status(thm)],[1346,5034,theory(equality)])).
% cnf(5062,negated_conjecture,(join(complement(esk2_0),complement(converse(esk1_0)))=top),inference(rw,[status(thm)],[5041,25,theory(equality)])).
% cnf(5129,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[50,5062,theory(equality)]),291,theory(equality)])).
% cnf(5130,negated_conjecture,($false),inference(cn,[status(thm)],[5129,theory(equality)])).
% cnf(5131,negated_conjecture,($false),5130,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 261
% # ...of these trivial : 122
% # ...subsumed : 17
% # ...remaining for further processing: 122
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 36
% # Generated clauses : 2618
% # ...of the previous two non-trivial : 1076
% # Contextual simplify-reflections : 0
% # Paramodulations : 2618
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 86
% # Positive orientable unit clauses: 85
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 0
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 687
% # ...number of literals in the above : 687
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 131
% # Indexed BW rewrite successes : 34
% # Backwards rewriting index: 139 leaves, 1.44+/-0.858 terms/leaf
% # Paramod-from index: 70 leaves, 1.24+/-0.572 terms/leaf
% # Paramod-into index: 125 leaves, 1.42+/-0.792 terms/leaf
% # -------------------------------------------------
% # User time : 0.050 s
% # System time : 0.006 s
% # Total time : 0.056 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.20 CPU 0.28 WC
% FINAL PrfWatch: 0.20 CPU 0.28 WC
% SZS output end Solution for /tmp/SystemOnTPTP24575/REL007+1.tptp
%
%------------------------------------------------------------------------------