TSTP Solution File: REL026+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : REL026+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 : 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:58 EST 2010
% Result : Theorem 3.90s
% Output : Solution 3.90s
% 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/SystemOnTPTP26562/REL026+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP26562/REL026+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP26562/REL026+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 26658
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 1.93 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=>(join(meet(composition(X1,top),X2),composition(X1,X2))=composition(X1,X2)&join(composition(X1,X2),meet(composition(X1,top),X2))=meet(composition(X1,top),X2))),file('/tmp/SRASS.s.p', goals)).
% fof(15, negated_conjecture,~(![X1]:![X2]:(join(X1,one)=one=>(join(meet(composition(X1,top),X2),composition(X1,X2))=composition(X1,X2)&join(composition(X1,X2),meet(composition(X1,top),X2))=meet(composition(X1,top),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&(~(join(meet(composition(X1,top),X2),composition(X1,X2))=composition(X1,X2))|~(join(composition(X1,X2),meet(composition(X1,top),X2))=meet(composition(X1,top),X2)))),inference(fof_nnf,[status(thm)],[15])).
% fof(43, negated_conjecture,?[X3]:?[X4]:(join(X3,one)=one&(~(join(meet(composition(X3,top),X4),composition(X3,X4))=composition(X3,X4))|~(join(composition(X3,X4),meet(composition(X3,top),X4))=meet(composition(X3,top),X4)))),inference(variable_rename,[status(thm)],[42])).
% fof(44, negated_conjecture,(join(esk1_0,one)=one&(~(join(meet(composition(esk1_0,top),esk2_0),composition(esk1_0,esk2_0))=composition(esk1_0,esk2_0))|~(join(composition(esk1_0,esk2_0),meet(composition(esk1_0,top),esk2_0))=meet(composition(esk1_0,top),esk2_0)))),inference(skolemize,[status(esa)],[43])).
% cnf(45,negated_conjecture,(join(composition(esk1_0,esk2_0),meet(composition(esk1_0,top),esk2_0))!=meet(composition(esk1_0,top),esk2_0)|join(meet(composition(esk1_0,top),esk2_0),composition(esk1_0,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,(join(complement(join(complement(composition(esk1_0,top)),complement(esk2_0))),composition(esk1_0,esk2_0))!=composition(esk1_0,esk2_0)|join(composition(esk1_0,esk2_0),complement(join(complement(composition(esk1_0,top)),complement(esk2_0))))!=complement(join(complement(composition(esk1_0,top)),complement(esk2_0)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[45,29,theory(equality)]),29,theory(equality)]),29,theory(equality)]),['unfolding']).
% cnf(49,negated_conjecture,(join(composition(esk1_0,esk2_0),complement(join(complement(esk2_0),complement(composition(esk1_0,top)))))!=complement(join(complement(composition(esk1_0,top)),complement(esk2_0)))|join(complement(join(complement(composition(esk1_0,top)),complement(esk2_0))),composition(esk1_0,esk2_0))!=composition(esk1_0,esk2_0)),inference(rw,[status(thm)],[48,17,theory(equality)])).
% cnf(50,negated_conjecture,(join(composition(esk1_0,esk2_0),complement(join(complement(esk2_0),complement(composition(esk1_0,top)))))!=complement(join(complement(esk2_0),complement(composition(esk1_0,top))))|join(complement(join(complement(composition(esk1_0,top)),complement(esk2_0))),composition(esk1_0,esk2_0))!=composition(esk1_0,esk2_0)),inference(rw,[status(thm)],[49,17,theory(equality)])).
% cnf(51,negated_conjecture,(join(composition(esk1_0,esk2_0),complement(join(complement(esk2_0),complement(composition(esk1_0,top)))))!=complement(join(complement(esk2_0),complement(composition(esk1_0,top))))|join(composition(esk1_0,esk2_0),complement(join(complement(esk2_0),complement(composition(esk1_0,top)))))!=composition(esk1_0,esk2_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[50,17,theory(equality)]),17,theory(equality)])).
% cnf(58,plain,(composition(converse(X1),X2)=converse(composition(converse(X2),X1))),inference(spm,[status(thm)],[35,33,theory(equality)])).
% cnf(81,plain,(join(join(X2,X1),X3)=join(X1,join(X2,X3))),inference(spm,[status(thm)],[19,17,theory(equality)])).
% cnf(85,plain,(join(X2,join(X1,X3))=join(X1,join(X2,X3))),inference(rw,[status(thm)],[81,19,theory(equality)])).
% cnf(129,plain,(join(composition(converse(X2),X1),converse(X3))=converse(join(composition(converse(X1),X2),X3))),inference(spm,[status(thm)],[39,58,theory(equality)])).
% cnf(139,plain,(converse(converse(X1))=composition(converse(one),X1)),inference(spm,[status(thm)],[58,23,theory(equality)])).
% cnf(147,plain,(X1=composition(converse(one),X1)),inference(rw,[status(thm)],[139,33,theory(equality)])).
% cnf(151,plain,(one=converse(one)),inference(spm,[status(thm)],[23,147,theory(equality)])).
% cnf(168,plain,(composition(one,X1)=X1),inference(rw,[status(thm)],[147,151,theory(equality)])).
% cnf(230,plain,(complement(top)=zero),inference(rw,[status(thm)],[47,27,theory(equality)])).
% cnf(354,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(355,plain,(join(composition(X1,X2),X2)=composition(join(X1,one),X2)),inference(spm,[status(thm)],[25,168,theory(equality)])).
% cnf(540,plain,(join(complement(X2),composition(converse(X1),complement(composition(X1,X2))))=complement(X2)),inference(rw,[status(thm)],[37,17,theory(equality)])).
% cnf(544,plain,(join(complement(X1),composition(converse(one),complement(X1)))=complement(X1)),inference(spm,[status(thm)],[540,168,theory(equality)])).
% cnf(558,plain,(join(complement(X1),complement(X1))=complement(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[544,151,theory(equality)]),168,theory(equality)])).
% cnf(567,plain,(join(zero,zero)=zero),inference(spm,[status(thm)],[558,230,theory(equality)])).
% cnf(574,plain,(join(zero,X1)=join(zero,join(zero,X1))),inference(spm,[status(thm)],[19,567,theory(equality)])).
% cnf(820,plain,(join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2))))=X1),inference(rw,[status(thm)],[31,17,theory(equality)])).
% cnf(828,plain,(join(complement(join(complement(X1),X2)),complement(join(complement(X2),complement(X1))))=X1),inference(spm,[status(thm)],[820,17,theory(equality)])).
% cnf(830,plain,(join(complement(join(complement(X1),complement(X1))),complement(top))=X1),inference(spm,[status(thm)],[820,27,theory(equality)])).
% cnf(844,plain,(join(complement(complement(X1)),zero)=X1),inference(rw,[status(thm)],[inference(rw,[status(thm)],[830,558,theory(equality)]),230,theory(equality)])).
% cnf(850,plain,(join(zero,complement(complement(X1)))=X1),inference(rw,[status(thm)],[844,17,theory(equality)])).
% cnf(868,plain,(join(zero,X1)=X1),inference(spm,[status(thm)],[574,850,theory(equality)])).
% cnf(891,plain,(complement(complement(X1))=X1),inference(rw,[status(thm)],[850,868,theory(equality)])).
% cnf(914,plain,(join(complement(join(X1,X2)),complement(join(X1,complement(X2))))=complement(X1)),inference(spm,[status(thm)],[820,891,theory(equality)])).
% cnf(917,plain,(join(X1,X1)=X1),inference(spm,[status(thm)],[558,891,theory(equality)])).
% cnf(961,plain,(join(X1,X2)=join(X1,join(X1,X2))),inference(spm,[status(thm)],[19,917,theory(equality)])).
% cnf(1044,plain,(join(complement(join(complement(X1),X2)),X1)=X1),inference(spm,[status(thm)],[961,820,theory(equality)])).
% cnf(1060,plain,(join(X1,join(X2,X1))=join(X2,X1)),inference(spm,[status(thm)],[961,17,theory(equality)])).
% cnf(1597,plain,(join(X1,complement(join(complement(X1),X2)))=X1),inference(rw,[status(thm)],[1044,17,theory(equality)])).
% cnf(1626,plain,(join(X1,complement(join(X2,complement(X1))))=X1),inference(spm,[status(thm)],[1597,1060,theory(equality)])).
% cnf(1684,plain,(join(complement(X1),complement(join(X2,X1)))=complement(X1)),inference(spm,[status(thm)],[1626,891,theory(equality)])).
% cnf(15106,plain,(join(X2,composition(X1,X2))=composition(join(X1,one),X2)),inference(rw,[status(thm)],[355,17,theory(equality)])).
% cnf(15169,negated_conjecture,(join(X1,composition(esk1_0,X1))=composition(one,X1)),inference(spm,[status(thm)],[15106,46,theory(equality)])).
% cnf(15210,negated_conjecture,(join(X1,composition(esk1_0,X1))=X1),inference(rw,[status(thm)],[15169,168,theory(equality)])).
% cnf(15268,negated_conjecture,(join(complement(composition(esk1_0,X1)),complement(X1))=complement(composition(esk1_0,X1))),inference(spm,[status(thm)],[1684,15210,theory(equality)])).
% cnf(15273,negated_conjecture,(join(X1,X2)=join(X2,join(X1,composition(esk1_0,X2)))),inference(spm,[status(thm)],[85,15210,theory(equality)])).
% cnf(32070,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)],[129,354,theory(equality)])).
% cnf(32155,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)],[32070,39,theory(equality)]),35,theory(equality)]),33,theory(equality)])).
% cnf(32156,plain,(composition(X2,join(X1,X3))=join(composition(X2,X1),composition(X2,X3))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[32155,33,theory(equality)]),33,theory(equality)])).
% cnf(32296,negated_conjecture,(join(X1,composition(esk1_0,join(X2,X1)))=join(composition(esk1_0,X2),X1)),inference(spm,[status(thm)],[15273,32156,theory(equality)])).
% cnf(60062,negated_conjecture,(join(complement(X1),composition(esk1_0,top))=join(composition(esk1_0,X1),complement(X1))),inference(spm,[status(thm)],[32296,27,theory(equality)])).
% cnf(92547,negated_conjecture,(join(complement(X1),composition(esk1_0,X1))=join(complement(X1),composition(esk1_0,top))),inference(rw,[status(thm)],[60062,17,theory(equality)])).
% cnf(93139,negated_conjecture,(join(complement(X1),complement(composition(esk1_0,X1)))=complement(composition(esk1_0,X1))),inference(rw,[status(thm)],[15268,17,theory(equality)])).
% cnf(110763,plain,(join(complement(complement(X1)),complement(join(complement(complement(join(X1,complement(X2)))),complement(join(X1,X2)))))=join(X1,X2)),inference(spm,[status(thm)],[828,914,theory(equality)])).
% cnf(111172,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)],[110763,891,theory(equality)]),891,theory(equality)]),19,theory(equality)]),1684,theory(equality)])).
% cnf(113039,plain,(join(X1,complement(join(X1,X2)))=join(X1,join(X1,complement(X2)))),inference(spm,[status(thm)],[111172,111172,theory(equality)])).
% cnf(113217,plain,(join(X1,complement(join(X1,X2)))=join(X1,complement(X2))),inference(rw,[status(thm)],[113039,961,theory(equality)])).
% cnf(113514,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)],[113217,92547,theory(equality)])).
% cnf(113880,negated_conjecture,(complement(composition(esk1_0,X1))=join(complement(X1),complement(composition(esk1_0,top)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[113514,113217,theory(equality)]),93139,theory(equality)])).
% cnf(125066,negated_conjecture,(composition(esk1_0,esk2_0)!=complement(join(complement(esk2_0),complement(composition(esk1_0,top))))|join(composition(esk1_0,esk2_0),complement(join(complement(esk2_0),complement(composition(esk1_0,top)))))!=composition(esk1_0,esk2_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[51,113880,theory(equality)]),891,theory(equality)]),32156,theory(equality)]),917,theory(equality)])).
% cnf(125067,negated_conjecture,($false|join(composition(esk1_0,esk2_0),complement(join(complement(esk2_0),complement(composition(esk1_0,top)))))!=composition(esk1_0,esk2_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[125066,113880,theory(equality)]),891,theory(equality)])).
% cnf(125068,negated_conjecture,($false|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[125067,113880,theory(equality)]),891,theory(equality)]),32156,theory(equality)]),917,theory(equality)])).
% cnf(125069,negated_conjecture,($false),inference(cn,[status(thm)],[125068,theory(equality)])).
% cnf(125070,negated_conjecture,($false),125069,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 2530
% # ...of these trivial : 1516
% # ...subsumed : 311
% # ...remaining for further processing: 703
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 332
% # Generated clauses : 62930
% # ...of the previous two non-trivial : 27962
% # Contextual simplify-reflections : 0
% # Paramodulations : 62930
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 371
% # Positive orientable unit clauses: 361
% # Positive unorientable unit clauses: 10
% # Negative unit clauses : 0
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 14756
% # ...number of literals in the above : 14756
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 102
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3018
% # Indexed BW rewrite successes : 428
% # Backwards rewriting index: 422 leaves, 1.77+/-1.488 terms/leaf
% # Paramod-from index: 220 leaves, 1.71+/-1.377 terms/leaf
% # Paramod-into index: 379 leaves, 1.76+/-1.471 terms/leaf
% # -------------------------------------------------
% # User time : 1.328 s
% # System time : 0.062 s
% # Total time : 1.390 s
% # Maximum resident set size: 0 pages
% PrfWatch: 2.93 CPU 3.04 WC
% FINAL PrfWatch: 2.93 CPU 3.04 WC
% SZS output end Solution for /tmp/SystemOnTPTP26562/REL026+2.tptp
%
%------------------------------------------------------------------------------