TSTP Solution File: REL026+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : REL026+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 : art01.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:46:46 EST 2010
% Result : Theorem 3.84s
% Output : Solution 3.84s
% 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/SystemOnTPTP26303/REL026+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP26303/REL026+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP26303/REL026+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 26399
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 1.95 CPU 2.02 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(4, axiom,![X1]:composition(X1,one)=X1,file('/tmp/SRASS.s.p', composition_identity)).
% fof(5, axiom,![X1]:![X2]:![X3]:composition(join(X1,X2),X3)=join(composition(X1,X3),composition(X2,X3)),file('/tmp/SRASS.s.p', composition_distributivity)).
% fof(6, axiom,![X1]:top=join(X1,complement(X1)),file('/tmp/SRASS.s.p', def_top)).
% fof(7, axiom,![X1]:![X2]:meet(X1,X2)=complement(join(complement(X1),complement(X2))),file('/tmp/SRASS.s.p', maddux4_definiton_of_meet)).
% fof(8, 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(9, axiom,![X1]:converse(converse(X1))=X1,file('/tmp/SRASS.s.p', converse_idempotence)).
% 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]:![X2]:join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2),file('/tmp/SRASS.s.p', converse_cancellativity)).
% fof(12, axiom,![X1]:![X2]:converse(join(X1,X2))=join(converse(X1),converse(X2)),file('/tmp/SRASS.s.p', converse_additivity)).
% fof(13, axiom,![X1]:zero=meet(X1,complement(X1)),file('/tmp/SRASS.s.p', def_zero)).
% fof(14, conjecture,![X1]:![X2]:(join(X1,one)=one=>meet(composition(X1,top),X2)=composition(X1,X2)),file('/tmp/SRASS.s.p', goals)).
% fof(15, negated_conjecture,~(![X1]:![X2]:(join(X1,one)=one=>meet(composition(X1,top),X2)=composition(X1,X2))),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(22, plain,![X2]:composition(X2,one)=X2,inference(variable_rename,[status(thm)],[4])).
% cnf(23,plain,(composition(X1,one)=X1),inference(split_conjunct,[status(thm)],[22])).
% fof(24, plain,![X4]:![X5]:![X6]:composition(join(X4,X5),X6)=join(composition(X4,X6),composition(X5,X6)),inference(variable_rename,[status(thm)],[5])).
% cnf(25,plain,(composition(join(X1,X2),X3)=join(composition(X1,X3),composition(X2,X3))),inference(split_conjunct,[status(thm)],[24])).
% fof(26, plain,![X2]:top=join(X2,complement(X2)),inference(variable_rename,[status(thm)],[6])).
% cnf(27,plain,(top=join(X1,complement(X1))),inference(split_conjunct,[status(thm)],[26])).
% fof(28, plain,![X3]:![X4]:meet(X3,X4)=complement(join(complement(X3),complement(X4))),inference(variable_rename,[status(thm)],[7])).
% cnf(29,plain,(meet(X1,X2)=complement(join(complement(X1),complement(X2)))),inference(split_conjunct,[status(thm)],[28])).
% fof(30, plain,![X3]:![X4]:X3=join(complement(join(complement(X3),complement(X4))),complement(join(complement(X3),X4))),inference(variable_rename,[status(thm)],[8])).
% cnf(31,plain,(X1=join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2)))),inference(split_conjunct,[status(thm)],[30])).
% fof(32, plain,![X2]:converse(converse(X2))=X2,inference(variable_rename,[status(thm)],[9])).
% cnf(33,plain,(converse(converse(X1))=X1),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,![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,![X3]:![X4]:converse(join(X3,X4))=join(converse(X3),converse(X4)),inference(variable_rename,[status(thm)],[12])).
% cnf(39,plain,(converse(join(X1,X2))=join(converse(X1),converse(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]:?[X2]:(join(X1,one)=one&~(meet(composition(X1,top),X2)=composition(X1,X2))),inference(fof_nnf,[status(thm)],[15])).
% fof(43, negated_conjecture,?[X3]:?[X4]:(join(X3,one)=one&~(meet(composition(X3,top),X4)=composition(X3,X4))),inference(variable_rename,[status(thm)],[42])).
% fof(44, negated_conjecture,(join(esk1_0,one)=one&~(meet(composition(esk1_0,top),esk2_0)=composition(esk1_0,esk2_0))),inference(skolemize,[status(esa)],[43])).
% cnf(45,negated_conjecture,(meet(composition(esk1_0,top),esk2_0)!=composition(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[44])).
% cnf(46,negated_conjecture,(join(esk1_0,one)=one),inference(split_conjunct,[status(thm)],[44])).
% cnf(47,plain,(complement(join(complement(X1),complement(complement(X1))))=zero),inference(rw,[status(thm)],[41,29,theory(equality)]),['unfolding']).
% cnf(48,negated_conjecture,(complement(join(complement(composition(esk1_0,top)),complement(esk2_0)))!=composition(esk1_0,esk2_0)),inference(rw,[status(thm)],[45,29,theory(equality)]),['unfolding']).
% cnf(49,negated_conjecture,(complement(join(complement(esk2_0),complement(composition(esk1_0,top))))!=composition(esk1_0,esk2_0)),inference(rw,[status(thm)],[48,17,theory(equality)])).
% cnf(50,negated_conjecture,(join(one,esk1_0)=one),inference(rw,[status(thm)],[46,17,theory(equality)])).
% cnf(57,plain,(composition(converse(X1),X2)=converse(composition(converse(X2),X1))),inference(spm,[status(thm)],[35,33,theory(equality)])).
% cnf(60,plain,(join(X1,join(X2,X3))=join(X3,join(X1,X2))),inference(spm,[status(thm)],[17,19,theory(equality)])).
% cnf(66,plain,(join(join(X2,X1),X3)=join(X1,join(X2,X3))),inference(spm,[status(thm)],[19,17,theory(equality)])).
% cnf(70,plain,(join(X2,join(X1,X3))=join(X1,join(X2,X3))),inference(rw,[status(thm)],[66,19,theory(equality)])).
% cnf(130,plain,(join(composition(converse(X2),X1),converse(X3))=converse(join(composition(converse(X1),X2),X3))),inference(spm,[status(thm)],[39,57,theory(equality)])).
% cnf(140,plain,(converse(converse(X1))=composition(converse(one),X1)),inference(spm,[status(thm)],[57,23,theory(equality)])).
% cnf(148,plain,(X1=composition(converse(one),X1)),inference(rw,[status(thm)],[140,33,theory(equality)])).
% cnf(152,plain,(one=converse(one)),inference(spm,[status(thm)],[23,148,theory(equality)])).
% cnf(169,plain,(composition(one,X1)=X1),inference(rw,[status(thm)],[148,152,theory(equality)])).
% cnf(230,plain,(complement(top)=zero),inference(rw,[status(thm)],[47,27,theory(equality)])).
% cnf(359,plain,(join(composition(X1,converse(X2)),converse(composition(X2,X3)))=composition(join(X1,converse(X3)),converse(X2))),inference(spm,[status(thm)],[25,35,theory(equality)])).
% cnf(364,plain,(join(X1,composition(X2,X1))=composition(join(one,X2),X1)),inference(spm,[status(thm)],[25,169,theory(equality)])).
% cnf(608,plain,(join(complement(X2),composition(converse(X1),complement(composition(X1,X2))))=complement(X2)),inference(rw,[status(thm)],[37,17,theory(equality)])).
% cnf(613,plain,(join(complement(X1),composition(converse(one),complement(X1)))=complement(X1)),inference(spm,[status(thm)],[608,169,theory(equality)])).
% cnf(628,plain,(join(complement(X1),complement(X1))=complement(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[613,152,theory(equality)]),169,theory(equality)])).
% cnf(638,plain,(join(zero,zero)=zero),inference(spm,[status(thm)],[628,230,theory(equality)])).
% cnf(646,plain,(join(zero,X1)=join(zero,join(zero,X1))),inference(spm,[status(thm)],[19,638,theory(equality)])).
% cnf(906,plain,(join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2))))=X1),inference(rw,[status(thm)],[31,17,theory(equality)])).
% cnf(915,plain,(join(complement(join(complement(X1),X2)),complement(join(complement(X2),complement(X1))))=X1),inference(spm,[status(thm)],[906,17,theory(equality)])).
% cnf(917,plain,(join(complement(join(complement(X1),complement(X1))),complement(top))=X1),inference(spm,[status(thm)],[906,27,theory(equality)])).
% cnf(932,plain,(join(complement(complement(X1)),zero)=X1),inference(rw,[status(thm)],[inference(rw,[status(thm)],[917,628,theory(equality)]),230,theory(equality)])).
% cnf(939,plain,(join(zero,complement(complement(X1)))=X1),inference(rw,[status(thm)],[932,17,theory(equality)])).
% cnf(962,plain,(join(zero,X1)=X1),inference(spm,[status(thm)],[646,939,theory(equality)])).
% cnf(991,plain,(complement(complement(X1))=X1),inference(rw,[status(thm)],[939,962,theory(equality)])).
% cnf(1016,plain,(join(complement(join(X1,X2)),complement(join(X1,complement(X2))))=complement(X1)),inference(spm,[status(thm)],[906,991,theory(equality)])).
% cnf(1019,plain,(join(X1,X1)=X1),inference(spm,[status(thm)],[628,991,theory(equality)])).
% cnf(1045,plain,(join(X1,X2)=join(X1,join(X1,X2))),inference(spm,[status(thm)],[19,1019,theory(equality)])).
% cnf(1290,plain,(join(X1,X2)=join(X2,join(X1,X2))),inference(spm,[status(thm)],[60,1019,theory(equality)])).
% cnf(1392,plain,(join(complement(join(complement(X1),X2)),X1)=X1),inference(spm,[status(thm)],[1045,906,theory(equality)])).
% cnf(1753,plain,(join(X1,complement(join(complement(X1),X2)))=X1),inference(rw,[status(thm)],[1392,17,theory(equality)])).
% cnf(1787,plain,(join(X1,complement(join(X2,complement(X1))))=X1),inference(spm,[status(thm)],[1753,1290,theory(equality)])).
% cnf(1843,plain,(join(complement(X1),complement(join(X2,X1)))=complement(X1)),inference(spm,[status(thm)],[1787,991,theory(equality)])).
% cnf(27279,plain,(converse(composition(join(converse(X1),converse(X3)),converse(X2)))=join(composition(converse(converse(X2)),X1),converse(converse(composition(X2,X3))))),inference(spm,[status(thm)],[130,359,theory(equality)])).
% cnf(27367,plain,(composition(X2,join(X1,X3))=join(composition(converse(converse(X2)),X1),converse(converse(composition(X2,X3))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[27279,39,theory(equality)]),35,theory(equality)]),33,theory(equality)])).
% cnf(27368,plain,(composition(X2,join(X1,X3))=join(composition(X2,X1),composition(X2,X3))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[27367,33,theory(equality)]),33,theory(equality)])).
% cnf(31178,negated_conjecture,(join(X1,composition(esk1_0,X1))=composition(one,X1)),inference(spm,[status(thm)],[364,50,theory(equality)])).
% cnf(31387,negated_conjecture,(join(X1,composition(esk1_0,X1))=X1),inference(rw,[status(thm)],[31178,169,theory(equality)])).
% cnf(31526,negated_conjecture,(join(complement(composition(esk1_0,X1)),complement(X1))=complement(composition(esk1_0,X1))),inference(spm,[status(thm)],[1843,31387,theory(equality)])).
% cnf(31533,negated_conjecture,(join(X1,X2)=join(X2,join(X1,composition(esk1_0,X2)))),inference(spm,[status(thm)],[70,31387,theory(equality)])).
% cnf(34961,negated_conjecture,(join(X1,composition(esk1_0,join(X2,X1)))=join(composition(esk1_0,X2),X1)),inference(spm,[status(thm)],[31533,27368,theory(equality)])).
% cnf(79183,negated_conjecture,(join(complement(X1),composition(esk1_0,top))=join(composition(esk1_0,X1),complement(X1))),inference(spm,[status(thm)],[34961,27,theory(equality)])).
% cnf(100762,negated_conjecture,(join(complement(X1),complement(composition(esk1_0,X1)))=complement(composition(esk1_0,X1))),inference(rw,[status(thm)],[31526,17,theory(equality)])).
% cnf(102069,plain,(join(complement(complement(X1)),complement(join(complement(complement(join(X1,complement(X2)))),complement(join(X1,X2)))))=join(X1,X2)),inference(spm,[status(thm)],[915,1016,theory(equality)])).
% cnf(102438,plain,(join(X1,complement(join(X1,complement(X2))))=join(X1,X2)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[102069,991,theory(equality)]),991,theory(equality)]),19,theory(equality)]),1843,theory(equality)])).
% cnf(103290,plain,(join(X1,complement(join(X1,X2)))=join(X1,join(X1,complement(X2)))),inference(spm,[status(thm)],[102438,102438,theory(equality)])).
% cnf(103464,plain,(join(X1,complement(join(X1,X2)))=join(X1,complement(X2))),inference(rw,[status(thm)],[103290,1045,theory(equality)])).
% cnf(114894,negated_conjecture,(join(complement(X1),composition(esk1_0,X1))=join(complement(X1),composition(esk1_0,top))),inference(rw,[status(thm)],[79183,17,theory(equality)])).
% cnf(114909,negated_conjecture,(join(complement(X1),complement(join(complement(X1),composition(esk1_0,X1))))=join(complement(X1),complement(composition(esk1_0,top)))),inference(spm,[status(thm)],[103464,114894,theory(equality)])).
% cnf(115034,negated_conjecture,(complement(composition(esk1_0,X1))=join(complement(X1),complement(composition(esk1_0,top)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[114909,103464,theory(equality)]),100762,theory(equality)])).
% cnf(119336,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[49,115034,theory(equality)]),991,theory(equality)])).
% cnf(119337,negated_conjecture,($false),inference(cn,[status(thm)],[119336,theory(equality)])).
% cnf(119338,negated_conjecture,($false),119337,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 2732
% # ...of these trivial : 1710
% # ...subsumed : 338
% # ...remaining for further processing: 684
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 341
% # Generated clauses : 60152
% # ...of the previous two non-trivial : 28727
% # Contextual simplify-reflections : 0
% # Paramodulations : 60152
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 343
% # Positive orientable unit clauses: 333
% # Positive unorientable unit clauses: 10
% # Negative unit clauses : 0
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 13986
% # ...number of literals in the above : 13986
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 75
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2492
% # Indexed BW rewrite successes : 323
% # Backwards rewriting index: 408 leaves, 1.71+/-1.319 terms/leaf
% # Paramod-from index: 217 leaves, 1.61+/-1.155 terms/leaf
% # Paramod-into index: 363 leaves, 1.68+/-1.282 terms/leaf
% # -------------------------------------------------
% # User time : 1.318 s
% # System time : 0.053 s
% # Total time : 1.371 s
% # Maximum resident set size: 0 pages
% PrfWatch: 2.88 CPU 3.18 WC
% FINAL PrfWatch: 2.88 CPU 3.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP26303/REL026+1.tptp
%
%------------------------------------------------------------------------------