TSTP Solution File: REL005+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : REL005+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:39:48 EST 2010
% Result : Theorem 2.92s
% Output : Solution 2.92s
% 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/SystemOnTPTP23807/REL005+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP23807/REL005+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP23807/REL005+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 23939
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.011 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(3, axiom,![X1]:![X2]:converse(composition(X1,X2))=composition(converse(X2),converse(X1)),file('/tmp/SRASS.s.p', converse_multiplicativity)).
% fof(4, axiom,![X1]:![X2]:join(X1,X2)=join(X2,X1),file('/tmp/SRASS.s.p', maddux1_join_commutativity)).
% fof(5, axiom,![X1]:![X2]:![X3]:join(X1,join(X2,X3))=join(join(X1,X2),X3),file('/tmp/SRASS.s.p', maddux2_join_associativity)).
% fof(6, 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(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]:zero=meet(X1,complement(X1)),file('/tmp/SRASS.s.p', def_zero)).
% 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]:top=join(X1,complement(X1)),file('/tmp/SRASS.s.p', def_top)).
% fof(13, axiom,![X1]:composition(X1,one)=X1,file('/tmp/SRASS.s.p', composition_identity)).
% fof(14, conjecture,![X1]:![X2]:converse(meet(X1,X2))=meet(converse(X1),converse(X2)),file('/tmp/SRASS.s.p', goals)).
% fof(15, negated_conjecture,~(![X1]:![X2]:converse(meet(X1,X2))=meet(converse(X1),converse(X2))),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,![X3]:![X4]:converse(join(X3,X4))=join(converse(X3),converse(X4)),inference(variable_rename,[status(thm)],[2])).
% cnf(19,plain,(converse(join(X1,X2))=join(converse(X1),converse(X2))),inference(split_conjunct,[status(thm)],[18])).
% fof(20, plain,![X3]:![X4]:converse(composition(X3,X4))=composition(converse(X4),converse(X3)),inference(variable_rename,[status(thm)],[3])).
% cnf(21,plain,(converse(composition(X1,X2))=composition(converse(X2),converse(X1))),inference(split_conjunct,[status(thm)],[20])).
% fof(22, plain,![X3]:![X4]:join(X3,X4)=join(X4,X3),inference(variable_rename,[status(thm)],[4])).
% cnf(23,plain,(join(X1,X2)=join(X2,X1)),inference(split_conjunct,[status(thm)],[22])).
% fof(24, plain,![X4]:![X5]:![X6]:join(X4,join(X5,X6))=join(join(X4,X5),X6),inference(variable_rename,[status(thm)],[5])).
% cnf(25,plain,(join(X1,join(X2,X3))=join(join(X1,X2),X3)),inference(split_conjunct,[status(thm)],[24])).
% fof(26, plain,![X3]:![X4]:X3=join(complement(join(complement(X3),complement(X4))),complement(join(complement(X3),X4))),inference(variable_rename,[status(thm)],[6])).
% cnf(27,plain,(X1=join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2)))),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,![X2]:zero=meet(X2,complement(X2)),inference(variable_rename,[status(thm)],[9])).
% cnf(33,plain,(zero=meet(X1,complement(X1))),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]:top=join(X2,complement(X2)),inference(variable_rename,[status(thm)],[12])).
% cnf(39,plain,(top=join(X1,complement(X1))),inference(split_conjunct,[status(thm)],[38])).
% fof(40, plain,![X2]:composition(X2,one)=X2,inference(variable_rename,[status(thm)],[13])).
% cnf(41,plain,(composition(X1,one)=X1),inference(split_conjunct,[status(thm)],[40])).
% fof(42, negated_conjecture,?[X1]:?[X2]:~(converse(meet(X1,X2))=meet(converse(X1),converse(X2))),inference(fof_nnf,[status(thm)],[15])).
% fof(43, negated_conjecture,?[X3]:?[X4]:~(converse(meet(X3,X4))=meet(converse(X3),converse(X4))),inference(variable_rename,[status(thm)],[42])).
% fof(44, negated_conjecture,~(converse(meet(esk1_0,esk2_0))=meet(converse(esk1_0),converse(esk2_0))),inference(skolemize,[status(esa)],[43])).
% cnf(45,negated_conjecture,(converse(meet(esk1_0,esk2_0))!=meet(converse(esk1_0),converse(esk2_0))),inference(split_conjunct,[status(thm)],[44])).
% cnf(46,plain,(complement(join(complement(X1),complement(complement(X1))))=zero),inference(rw,[status(thm)],[33,31,theory(equality)]),['unfolding']).
% cnf(47,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)],[45,31,theory(equality)]),31,theory(equality)]),['unfolding']).
% cnf(51,plain,(join(X1,converse(X2))=converse(join(converse(X1),X2))),inference(spm,[status(thm)],[19,17,theory(equality)])).
% cnf(54,plain,(composition(converse(X1),X2)=converse(composition(converse(X2),X1))),inference(spm,[status(thm)],[21,17,theory(equality)])).
% cnf(79,plain,(converse(top)=join(X1,converse(complement(converse(X1))))),inference(spm,[status(thm)],[51,39,theory(equality)])).
% cnf(102,plain,(converse(converse(X1))=composition(converse(one),X1)),inference(spm,[status(thm)],[54,41,theory(equality)])).
% cnf(106,plain,(X1=composition(converse(one),X1)),inference(rw,[status(thm)],[102,17,theory(equality)])).
% cnf(109,plain,(one=converse(one)),inference(spm,[status(thm)],[41,106,theory(equality)])).
% cnf(122,plain,(composition(one,X1)=X1),inference(rw,[status(thm)],[106,109,theory(equality)])).
% cnf(130,plain,(join(X1,join(X2,complement(join(X1,X2))))=top),inference(spm,[status(thm)],[39,25,theory(equality)])).
% cnf(132,plain,(join(X1,join(X2,X3))=join(X3,join(X1,X2))),inference(spm,[status(thm)],[23,25,theory(equality)])).
% cnf(136,plain,(join(top,X2)=join(X1,join(complement(X1),X2))),inference(spm,[status(thm)],[25,39,theory(equality)])).
% cnf(206,plain,(complement(top)=zero),inference(rw,[status(thm)],[46,39,theory(equality)])).
% cnf(272,plain,(join(X1,top)=join(top,complement(complement(X1)))),inference(spm,[status(thm)],[136,39,theory(equality)])).
% cnf(458,plain,(join(X1,join(X2,complement(join(X2,X1))))=top),inference(spm,[status(thm)],[130,23,theory(equality)])).
% cnf(787,plain,(join(complement(X2),composition(converse(X1),complement(composition(X1,X2))))=complement(X2)),inference(rw,[status(thm)],[37,23,theory(equality)])).
% cnf(795,plain,(join(complement(X1),composition(converse(one),complement(X1)))=complement(X1)),inference(spm,[status(thm)],[787,122,theory(equality)])).
% cnf(813,plain,(join(complement(X1),complement(X1))=complement(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[795,109,theory(equality)]),122,theory(equality)])).
% cnf(823,plain,(join(complement(X1),join(complement(X1),complement(complement(X1))))=top),inference(spm,[status(thm)],[130,813,theory(equality)])).
% cnf(831,plain,(join(zero,zero)=zero),inference(spm,[status(thm)],[813,206,theory(equality)])).
% cnf(834,plain,(join(complement(X1),top)=top),inference(rw,[status(thm)],[823,39,theory(equality)])).
% cnf(844,plain,(join(zero,X1)=join(zero,join(zero,X1))),inference(spm,[status(thm)],[25,831,theory(equality)])).
% cnf(855,plain,(join(top,complement(X1))=top),inference(rw,[status(thm)],[834,23,theory(equality)])).
% cnf(866,plain,(top=join(X1,top)),inference(rw,[status(thm)],[272,855,theory(equality)])).
% cnf(877,plain,(top=join(top,X1)),inference(spm,[status(thm)],[23,866,theory(equality)])).
% cnf(903,plain,(top=converse(top)),inference(spm,[status(thm)],[79,877,theory(equality)])).
% cnf(953,plain,(join(X1,converse(complement(converse(X1))))=top),inference(rw,[status(thm)],[79,903,theory(equality)])).
% cnf(975,plain,(join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2))))=X1),inference(rw,[status(thm)],[27,23,theory(equality)])).
% cnf(987,plain,(join(complement(join(complement(X1),complement(X1))),complement(top))=X1),inference(spm,[status(thm)],[975,39,theory(equality)])).
% cnf(1001,plain,(join(complement(complement(X1)),zero)=X1),inference(rw,[status(thm)],[inference(rw,[status(thm)],[987,813,theory(equality)]),206,theory(equality)])).
% cnf(1033,plain,(join(zero,complement(complement(X1)))=X1),inference(rw,[status(thm)],[1001,23,theory(equality)])).
% cnf(1284,plain,(join(zero,X1)=X1),inference(spm,[status(thm)],[844,1033,theory(equality)])).
% cnf(1318,plain,(X1=join(X1,zero)),inference(spm,[status(thm)],[23,1284,theory(equality)])).
% cnf(1328,plain,(complement(complement(X1))=X1),inference(rw,[status(thm)],[1033,1284,theory(equality)])).
% cnf(1361,plain,(join(X1,X1)=X1),inference(spm,[status(thm)],[813,1328,theory(equality)])).
% cnf(1517,plain,(join(X1,X2)=join(X1,join(X1,X2))),inference(spm,[status(thm)],[25,1361,theory(equality)])).
% cnf(1522,plain,(join(X1,X2)=join(X2,join(X1,X2))),inference(spm,[status(thm)],[132,1361,theory(equality)])).
% cnf(1666,plain,(join(complement(join(complement(X1),X2)),X1)=X1),inference(spm,[status(thm)],[1517,975,theory(equality)])).
% cnf(2065,plain,(join(X1,complement(join(complement(X1),X2)))=X1),inference(rw,[status(thm)],[1666,23,theory(equality)])).
% cnf(2099,plain,(join(X1,complement(join(X2,complement(X1))))=X1),inference(spm,[status(thm)],[2065,1522,theory(equality)])).
% cnf(2147,plain,(join(X1,X3)=join(X1,join(complement(join(X2,complement(X1))),X3))),inference(spm,[status(thm)],[25,2099,theory(equality)])).
% cnf(2159,plain,(join(complement(X1),complement(join(X2,X1)))=complement(X1)),inference(spm,[status(thm)],[2099,1328,theory(equality)])).
% cnf(68888,plain,(join(X1,X2)=join(X1,complement(join(complement(X2),complement(complement(X1)))))),inference(spm,[status(thm)],[2147,975,theory(equality)])).
% cnf(69231,plain,(join(X1,X2)=join(X1,complement(join(complement(X2),X1)))),inference(rw,[status(thm)],[68888,1328,theory(equality)])).
% cnf(69389,plain,(join(X1,complement(join(X2,X1)))=join(X1,complement(X2))),inference(spm,[status(thm)],[69231,1328,theory(equality)])).
% cnf(70107,plain,(join(join(X1,complement(join(X1,X2))),complement(top))=join(join(X1,complement(join(X1,X2))),complement(X2))),inference(spm,[status(thm)],[69389,458,theory(equality)])).
% cnf(70388,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)],[70107,206,theory(equality)]),25,theory(equality)]),1318,theory(equality)])).
% cnf(70389,plain,(join(X1,complement(join(X1,X2)))=join(X1,complement(X2))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[70388,25,theory(equality)]),23,theory(equality)]),2159,theory(equality)])).
% cnf(71655,plain,(join(X1,complement(top))=join(X1,complement(converse(complement(converse(X1)))))),inference(spm,[status(thm)],[70389,953,theory(equality)])).
% cnf(71964,plain,(X1=join(X1,complement(converse(complement(converse(X1)))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[71655,206,theory(equality)]),1318,theory(equality)])).
% cnf(72048,plain,(converse(converse(X1))=join(X1,converse(complement(converse(complement(converse(converse(X1)))))))),inference(spm,[status(thm)],[51,71964,theory(equality)])).
% cnf(72227,plain,(X1=join(X1,converse(complement(converse(complement(converse(converse(X1)))))))),inference(rw,[status(thm)],[72048,17,theory(equality)])).
% cnf(72228,plain,(X1=join(X1,converse(complement(converse(complement(X1)))))),inference(rw,[status(thm)],[72227,17,theory(equality)])).
% cnf(72422,plain,(join(complement(X1),converse(complement(converse(X1))))=complement(X1)),inference(spm,[status(thm)],[72228,1328,theory(equality)])).
% cnf(72754,plain,(join(complement(converse(complement(converse(X1)))),complement(complement(X1)))=complement(converse(complement(converse(X1))))),inference(spm,[status(thm)],[2159,72422,theory(equality)])).
% cnf(72863,plain,(X1=complement(converse(complement(converse(X1))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[72754,1328,theory(equality)]),23,theory(equality)]),71964,theory(equality)])).
% cnf(72916,plain,(complement(X1)=converse(complement(converse(X1)))),inference(spm,[status(thm)],[1328,72863,theory(equality)])).
% cnf(73095,plain,(converse(complement(X1))=complement(converse(X1))),inference(spm,[status(thm)],[17,72916,theory(equality)])).
% cnf(73249,plain,(join(complement(converse(X1)),converse(X2))=converse(join(complement(X1),X2))),inference(spm,[status(thm)],[19,73095,theory(equality)])).
% cnf(73339,negated_conjecture,(complement(join(complement(converse(esk1_0)),complement(converse(esk2_0))))!=complement(converse(join(complement(esk1_0),complement(esk2_0))))),inference(rw,[status(thm)],[47,73095,theory(equality)])).
% cnf(74487,plain,(join(complement(converse(X1)),complement(converse(X2)))=converse(join(complement(X1),complement(X2)))),inference(spm,[status(thm)],[73249,73095,theory(equality)])).
% cnf(84104,negated_conjecture,($false),inference(rw,[status(thm)],[73339,74487,theory(equality)])).
% cnf(84105,negated_conjecture,($false),inference(cn,[status(thm)],[84104,theory(equality)])).
% cnf(84106,negated_conjecture,($false),84105,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 2023
% # ...of these trivial : 1277
% # ...subsumed : 265
% # ...remaining for further processing: 481
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 177
% # Generated clauses : 42600
% # ...of the previous two non-trivial : 20731
% # Contextual simplify-reflections : 0
% # Paramodulations : 42600
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 304
% # Positive orientable unit clauses: 296
% # Positive unorientable unit clauses: 8
% # Negative unit clauses : 0
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 12151
% # ...number of literals in the above : 12151
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 77
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1631
% # Indexed BW rewrite successes : 287
% # Backwards rewriting index: 334 leaves, 1.96+/-1.893 terms/leaf
% # Paramod-from index: 177 leaves, 1.74+/-1.637 terms/leaf
% # Paramod-into index: 291 leaves, 1.88+/-1.853 terms/leaf
% # -------------------------------------------------
% # User time : 0.853 s
% # System time : 0.048 s
% # Total time : 0.901 s
% # Maximum resident set size: 0 pages
% PrfWatch: 1.91 CPU 1.99 WC
% FINAL PrfWatch: 1.91 CPU 1.99 WC
% SZS output end Solution for /tmp/SystemOnTPTP23807/REL005+1.tptp
%
%------------------------------------------------------------------------------