TSTP Solution File: REL010+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : REL010+2 : 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:36:40 EST 2010
% Result : Theorem 1.80s
% Output : Solution 1.80s
% 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/SystemOnTPTP31550/REL010+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP31550/REL010+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31550/REL010+2.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 31646
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:converse(converse(X1))=X1,file('/tmp/SRASS.s.p', converse_idempotence)).
% fof(3, axiom,![X1]:![X2]:converse(composition(X1,X2))=composition(converse(X2),converse(X1)),file('/tmp/SRASS.s.p', converse_multiplicativity)).
% fof(5, axiom,![X1]:![X2]:![X3]:join(meet(composition(X1,X2),X3),meet(composition(X1,meet(X2,composition(converse(X1),X3))),X3))=meet(composition(X1,meet(X2,composition(converse(X1),X3))),X3),file('/tmp/SRASS.s.p', modular_law_1)).
% fof(7, axiom,![X1]:zero=meet(X1,complement(X1)),file('/tmp/SRASS.s.p', def_zero)).
% fof(8, axiom,![X1]:![X2]:converse(join(X1,X2))=join(converse(X1),converse(X2)),file('/tmp/SRASS.s.p', converse_additivity)).
% fof(9, axiom,![X1]:![X2]:![X3]:composition(join(X1,X2),X3)=join(composition(X1,X3),composition(X2,X3)),file('/tmp/SRASS.s.p', composition_distributivity)).
% fof(10, axiom,![X1]:![X2]:join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2),file('/tmp/SRASS.s.p', converse_cancellativity)).
% fof(11, axiom,![X1]:![X2]:join(X1,X2)=join(X2,X1),file('/tmp/SRASS.s.p', maddux1_join_commutativity)).
% fof(12, axiom,![X1]:![X2]:![X3]:join(X1,join(X2,X3))=join(join(X1,X2),X3),file('/tmp/SRASS.s.p', maddux2_join_associativity)).
% fof(13, axiom,![X1]:![X2]:meet(X1,X2)=complement(join(complement(X1),complement(X2))),file('/tmp/SRASS.s.p', maddux4_definiton_of_meet)).
% fof(14, axiom,![X1]:composition(X1,one)=X1,file('/tmp/SRASS.s.p', composition_identity)).
% fof(15, 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(16, axiom,![X1]:top=join(X1,complement(X1)),file('/tmp/SRASS.s.p', def_top)).
% fof(17, conjecture,![X1]:![X2]:![X3]:(meet(composition(X1,X2),X3)=zero=>meet(X2,composition(converse(X1),X3))=zero),file('/tmp/SRASS.s.p', goals)).
% fof(18, negated_conjecture,~(![X1]:![X2]:![X3]:(meet(composition(X1,X2),X3)=zero=>meet(X2,composition(converse(X1),X3))=zero)),inference(assume_negation,[status(cth)],[17])).
% fof(21, plain,![X2]:converse(converse(X2))=X2,inference(variable_rename,[status(thm)],[2])).
% cnf(22,plain,(converse(converse(X1))=X1),inference(split_conjunct,[status(thm)],[21])).
% fof(23, plain,![X3]:![X4]:converse(composition(X3,X4))=composition(converse(X4),converse(X3)),inference(variable_rename,[status(thm)],[3])).
% cnf(24,plain,(converse(composition(X1,X2))=composition(converse(X2),converse(X1))),inference(split_conjunct,[status(thm)],[23])).
% fof(27, plain,![X4]:![X5]:![X6]:join(meet(composition(X4,X5),X6),meet(composition(X4,meet(X5,composition(converse(X4),X6))),X6))=meet(composition(X4,meet(X5,composition(converse(X4),X6))),X6),inference(variable_rename,[status(thm)],[5])).
% cnf(28,plain,(join(meet(composition(X1,X2),X3),meet(composition(X1,meet(X2,composition(converse(X1),X3))),X3))=meet(composition(X1,meet(X2,composition(converse(X1),X3))),X3)),inference(split_conjunct,[status(thm)],[27])).
% fof(31, plain,![X2]:zero=meet(X2,complement(X2)),inference(variable_rename,[status(thm)],[7])).
% cnf(32,plain,(zero=meet(X1,complement(X1))),inference(split_conjunct,[status(thm)],[31])).
% fof(33, plain,![X3]:![X4]:converse(join(X3,X4))=join(converse(X3),converse(X4)),inference(variable_rename,[status(thm)],[8])).
% cnf(34,plain,(converse(join(X1,X2))=join(converse(X1),converse(X2))),inference(split_conjunct,[status(thm)],[33])).
% fof(35, plain,![X4]:![X5]:![X6]:composition(join(X4,X5),X6)=join(composition(X4,X6),composition(X5,X6)),inference(variable_rename,[status(thm)],[9])).
% cnf(36,plain,(composition(join(X1,X2),X3)=join(composition(X1,X3),composition(X2,X3))),inference(split_conjunct,[status(thm)],[35])).
% fof(37, plain,![X3]:![X4]:join(composition(converse(X3),complement(composition(X3,X4))),complement(X4))=complement(X4),inference(variable_rename,[status(thm)],[10])).
% cnf(38,plain,(join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2)),inference(split_conjunct,[status(thm)],[37])).
% fof(39, plain,![X3]:![X4]:join(X3,X4)=join(X4,X3),inference(variable_rename,[status(thm)],[11])).
% cnf(40,plain,(join(X1,X2)=join(X2,X1)),inference(split_conjunct,[status(thm)],[39])).
% fof(41, plain,![X4]:![X5]:![X6]:join(X4,join(X5,X6))=join(join(X4,X5),X6),inference(variable_rename,[status(thm)],[12])).
% cnf(42,plain,(join(X1,join(X2,X3))=join(join(X1,X2),X3)),inference(split_conjunct,[status(thm)],[41])).
% fof(43, plain,![X3]:![X4]:meet(X3,X4)=complement(join(complement(X3),complement(X4))),inference(variable_rename,[status(thm)],[13])).
% cnf(44,plain,(meet(X1,X2)=complement(join(complement(X1),complement(X2)))),inference(split_conjunct,[status(thm)],[43])).
% fof(45, plain,![X2]:composition(X2,one)=X2,inference(variable_rename,[status(thm)],[14])).
% cnf(46,plain,(composition(X1,one)=X1),inference(split_conjunct,[status(thm)],[45])).
% fof(47, plain,![X3]:![X4]:X3=join(complement(join(complement(X3),complement(X4))),complement(join(complement(X3),X4))),inference(variable_rename,[status(thm)],[15])).
% cnf(48,plain,(X1=join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2)))),inference(split_conjunct,[status(thm)],[47])).
% fof(49, plain,![X2]:top=join(X2,complement(X2)),inference(variable_rename,[status(thm)],[16])).
% cnf(50,plain,(top=join(X1,complement(X1))),inference(split_conjunct,[status(thm)],[49])).
% fof(51, negated_conjecture,?[X1]:?[X2]:?[X3]:(meet(composition(X1,X2),X3)=zero&~(meet(X2,composition(converse(X1),X3))=zero)),inference(fof_nnf,[status(thm)],[18])).
% fof(52, negated_conjecture,?[X4]:?[X5]:?[X6]:(meet(composition(X4,X5),X6)=zero&~(meet(X5,composition(converse(X4),X6))=zero)),inference(variable_rename,[status(thm)],[51])).
% fof(53, negated_conjecture,(meet(composition(esk1_0,esk2_0),esk3_0)=zero&~(meet(esk2_0,composition(converse(esk1_0),esk3_0))=zero)),inference(skolemize,[status(esa)],[52])).
% cnf(54,negated_conjecture,(meet(esk2_0,composition(converse(esk1_0),esk3_0))!=zero),inference(split_conjunct,[status(thm)],[53])).
% cnf(55,negated_conjecture,(meet(composition(esk1_0,esk2_0),esk3_0)=zero),inference(split_conjunct,[status(thm)],[53])).
% cnf(56,plain,(complement(join(complement(X1),complement(complement(X1))))=zero),inference(rw,[status(thm)],[32,44,theory(equality)]),['unfolding']).
% cnf(57,negated_conjecture,(complement(join(complement(composition(esk1_0,esk2_0)),complement(esk3_0)))=zero),inference(rw,[status(thm)],[55,44,theory(equality)]),['unfolding']).
% cnf(58,plain,(join(complement(join(complement(composition(X1,X2)),complement(X3))),complement(join(complement(composition(X1,complement(join(complement(X2),complement(composition(converse(X1),X3)))))),complement(X3))))=complement(join(complement(composition(X1,complement(join(complement(X2),complement(composition(converse(X1),X3)))))),complement(X3)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[28,44,theory(equality)]),44,theory(equality)]),44,theory(equality)]),44,theory(equality)]),44,theory(equality)]),['unfolding']).
% cnf(61,negated_conjecture,(complement(join(complement(esk2_0),complement(composition(converse(esk1_0),esk3_0))))!=zero),inference(rw,[status(thm)],[54,44,theory(equality)]),['unfolding']).
% cnf(63,plain,(converse(X1)=composition(converse(one),converse(X1))),inference(spm,[status(thm)],[24,46,theory(equality)])).
% cnf(66,plain,(converse(top)=join(converse(X1),converse(complement(X1)))),inference(spm,[status(thm)],[34,50,theory(equality)])).
% cnf(72,plain,(complement(top)=zero),inference(rw,[status(thm)],[56,50,theory(equality)])).
% cnf(88,plain,(join(top,X2)=join(X1,join(complement(X1),X2))),inference(spm,[status(thm)],[42,50,theory(equality)])).
% cnf(113,negated_conjecture,(complement(join(complement(esk3_0),complement(composition(esk1_0,esk2_0))))=zero),inference(rw,[status(thm)],[57,40,theory(equality)])).
% cnf(116,plain,(join(complement(X2),composition(converse(X1),complement(composition(X1,X2))))=complement(X2)),inference(rw,[status(thm)],[38,40,theory(equality)])).
% cnf(134,plain,(join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2))))=X1),inference(rw,[status(thm)],[48,40,theory(equality)])).
% cnf(157,plain,(join(complement(join(complement(composition(X1,X2)),complement(X3))),complement(join(complement(X3),complement(composition(X1,complement(join(complement(X2),complement(composition(converse(X1),X3)))))))))=complement(join(complement(composition(X1,complement(join(complement(X2),complement(composition(converse(X1),X3)))))),complement(X3)))),inference(rw,[status(thm)],[58,40,theory(equality)])).
% cnf(158,plain,(join(complement(join(complement(composition(X1,X2)),complement(X3))),complement(join(complement(X3),complement(composition(X1,complement(join(complement(X2),complement(composition(converse(X1),X3)))))))))=complement(join(complement(X3),complement(composition(X1,complement(join(complement(X2),complement(composition(converse(X1),X3))))))))),inference(rw,[status(thm)],[157,40,theory(equality)])).
% cnf(165,plain,(join(complement(join(complement(composition(converse(X1),X2)),complement(X3))),complement(join(complement(X3),complement(composition(converse(X1),complement(join(complement(X2),complement(composition(X1,X3)))))))))=complement(join(complement(X3),complement(composition(converse(X1),complement(join(complement(X2),complement(composition(X1,X3))))))))),inference(spm,[status(thm)],[158,22,theory(equality)])).
% cnf(322,plain,(composition(converse(one),X1)=X1),inference(spm,[status(thm)],[63,22,theory(equality)])).
% cnf(338,plain,(one=converse(one)),inference(spm,[status(thm)],[46,322,theory(equality)])).
% cnf(369,plain,(composition(one,X1)=X1),inference(rw,[status(thm)],[322,338,theory(equality)])).
% cnf(383,plain,(join(complement(X1),composition(converse(one),complement(X1)))=complement(X1)),inference(spm,[status(thm)],[116,369,theory(equality)])).
% cnf(395,plain,(join(complement(X1),complement(X1))=complement(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[383,338,theory(equality)]),369,theory(equality)])).
% cnf(413,plain,(join(one,converse(complement(one)))=converse(top)),inference(spm,[status(thm)],[66,338,theory(equality)])).
% cnf(433,plain,(join(complement(complement(X1)),complement(join(complement(X1),complement(complement(X1)))))=X1),inference(spm,[status(thm)],[134,395,theory(equality)])).
% cnf(442,plain,(join(zero,zero)=zero),inference(spm,[status(thm)],[395,72,theory(equality)])).
% cnf(448,plain,(join(complement(complement(X1)),zero)=X1),inference(rw,[status(thm)],[inference(rw,[status(thm)],[433,50,theory(equality)]),72,theory(equality)])).
% cnf(460,plain,(join(zero,X1)=join(zero,join(zero,X1))),inference(spm,[status(thm)],[42,442,theory(equality)])).
% cnf(468,plain,(join(zero,complement(complement(X1)))=X1),inference(rw,[status(thm)],[448,40,theory(equality)])).
% cnf(522,plain,(join(X1,complement(X1))=join(top,complement(X1))),inference(spm,[status(thm)],[88,395,theory(equality)])).
% cnf(538,plain,(top=join(top,complement(X1))),inference(rw,[status(thm)],[522,50,theory(equality)])).
% cnf(565,plain,(join(zero,X1)=X1),inference(spm,[status(thm)],[460,468,theory(equality)])).
% cnf(575,plain,(complement(zero)=top),inference(spm,[status(thm)],[50,565,theory(equality)])).
% cnf(577,plain,(X1=join(X1,zero)),inference(spm,[status(thm)],[40,565,theory(equality)])).
% cnf(587,plain,(complement(complement(X1))=X1),inference(rw,[status(thm)],[468,565,theory(equality)])).
% cnf(629,plain,(join(top,X1)=top),inference(spm,[status(thm)],[538,587,theory(equality)])).
% cnf(638,negated_conjecture,(complement(zero)=join(complement(esk3_0),complement(composition(esk1_0,esk2_0)))),inference(spm,[status(thm)],[587,113,theory(equality)])).
% cnf(642,negated_conjecture,(top=join(complement(esk3_0),complement(composition(esk1_0,esk2_0)))),inference(rw,[status(thm)],[638,575,theory(equality)])).
% cnf(701,plain,(top=join(X1,top)),inference(spm,[status(thm)],[40,629,theory(equality)])).
% cnf(702,plain,(converse(top)=join(converse(top),converse(X1))),inference(spm,[status(thm)],[34,629,theory(equality)])).
% cnf(704,plain,(composition(top,X2)=join(composition(top,X2),composition(X1,X2))),inference(spm,[status(thm)],[36,629,theory(equality)])).
% cnf(785,plain,(join(converse(top),X1)=converse(top)),inference(spm,[status(thm)],[702,22,theory(equality)])).
% cnf(797,plain,(converse(top)=top),inference(spm,[status(thm)],[701,785,theory(equality)])).
% cnf(819,plain,(join(one,converse(complement(one)))=top),inference(rw,[status(thm)],[413,797,theory(equality)])).
% cnf(1139,plain,(composition(top,X1)=join(composition(one,X1),composition(converse(complement(one)),X1))),inference(spm,[status(thm)],[36,819,theory(equality)])).
% cnf(1147,plain,(composition(top,X1)=join(X1,composition(converse(complement(one)),X1))),inference(rw,[status(thm)],[1139,369,theory(equality)])).
% cnf(2045,plain,(composition(top,top)=top),inference(spm,[status(thm)],[629,1147,theory(equality)])).
% cnf(2074,plain,(join(complement(top),composition(converse(top),complement(top)))=complement(top)),inference(spm,[status(thm)],[116,2045,theory(equality)])).
% cnf(2084,plain,(composition(top,zero)=complement(top)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[2074,72,theory(equality)]),797,theory(equality)]),72,theory(equality)]),565,theory(equality)])).
% cnf(2085,plain,(composition(top,zero)=zero),inference(rw,[status(thm)],[2084,72,theory(equality)])).
% cnf(4637,plain,(join(zero,composition(X1,zero))=zero),inference(spm,[status(thm)],[704,2085,theory(equality)])).
% cnf(4682,plain,(composition(X1,zero)=zero),inference(rw,[status(thm)],[4637,565,theory(equality)])).
% cnf(35963,negated_conjecture,(join(complement(join(complement(composition(converse(esk1_0),esk3_0)),complement(esk2_0))),complement(join(complement(esk2_0),complement(composition(converse(esk1_0),complement(top))))))=complement(join(complement(esk2_0),complement(composition(converse(esk1_0),complement(top)))))),inference(spm,[status(thm)],[165,642,theory(equality)])).
% cnf(36209,negated_conjecture,(complement(join(complement(composition(converse(esk1_0),esk3_0)),complement(esk2_0)))=complement(join(complement(esk2_0),complement(composition(converse(esk1_0),complement(top)))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[35963,72,theory(equality)]),4682,theory(equality)]),575,theory(equality)]),701,theory(equality)]),72,theory(equality)]),577,theory(equality)])).
% cnf(36210,negated_conjecture,(complement(join(complement(composition(converse(esk1_0),esk3_0)),complement(esk2_0)))=zero),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[36209,72,theory(equality)]),4682,theory(equality)]),575,theory(equality)]),701,theory(equality)]),72,theory(equality)])).
% cnf(36677,negated_conjecture,(complement(join(complement(esk2_0),complement(composition(converse(esk1_0),esk3_0))))=zero),inference(rw,[status(thm)],[36210,40,theory(equality)])).
% cnf(36678,negated_conjecture,($false),inference(sr,[status(thm)],[36677,61,theory(equality)])).
% cnf(36679,negated_conjecture,($false),36678,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1139
% # ...of these trivial : 627
% # ...subsumed : 179
% # ...remaining for further processing: 333
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 108
% # Generated clauses : 17987
% # ...of the previous two non-trivial : 8459
% # Contextual simplify-reflections : 0
% # Paramodulations : 17987
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 224
% # Positive orientable unit clauses: 219
% # Positive unorientable unit clauses: 4
% # Negative unit clauses : 1
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 5833
% # ...number of literals in the above : 5833
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 17
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 869
% # Indexed BW rewrite successes : 184
% # Backwards rewriting index: 278 leaves, 1.87+/-2.002 terms/leaf
% # Paramod-from index: 143 leaves, 1.57+/-1.441 terms/leaf
% # Paramod-into index: 261 leaves, 1.87+/-1.994 terms/leaf
% # -------------------------------------------------
% # User time : 0.431 s
% # System time : 0.019 s
% # Total time : 0.450 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.99 CPU 1.08 WC
% FINAL PrfWatch: 0.99 CPU 1.08 WC
% SZS output end Solution for /tmp/SystemOnTPTP31550/REL010+2.tptp
%
%------------------------------------------------------------------------------