TSTP Solution File: REL027+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : REL027+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 : art02.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:47:31 EST 2010
% Result : Theorem 1.77s
% Output : Solution 1.77s
% 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/SystemOnTPTP3997/REL027+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP3997/REL027+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP3997/REL027+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 4093
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.009 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # 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(3, 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(4, axiom,![X1]:![X2]:meet(X1,X2)=complement(join(complement(X1),complement(X2))),file('/tmp/SRASS.s.p', maddux4_definiton_of_meet)).
% fof(6, axiom,![X1]:composition(X1,one)=X1,file('/tmp/SRASS.s.p', composition_identity)).
% fof(7, axiom,![X1]:![X2]:![X3]:composition(join(X1,X2),X3)=join(composition(X1,X3),composition(X2,X3)),file('/tmp/SRASS.s.p', composition_distributivity)).
% fof(8, axiom,![X1]:top=join(X1,complement(X1)),file('/tmp/SRASS.s.p', def_top)).
% fof(9, axiom,![X1]:![X2]:join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2),file('/tmp/SRASS.s.p', converse_cancellativity)).
% fof(10, axiom,![X1]:zero=meet(X1,complement(X1)),file('/tmp/SRASS.s.p', def_zero)).
% fof(11, axiom,![X1]:converse(converse(X1))=X1,file('/tmp/SRASS.s.p', converse_idempotence)).
% 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]:![X2]:converse(composition(X1,X2))=composition(converse(X2),converse(X1)),file('/tmp/SRASS.s.p', converse_multiplicativity)).
% fof(14, conjecture,![X1]:(join(X1,one)=one=>meet(complement(composition(X1,top)),one)=meet(complement(X1),one)),file('/tmp/SRASS.s.p', goals)).
% fof(15, negated_conjecture,~(![X1]:(join(X1,one)=one=>meet(complement(composition(X1,top)),one)=meet(complement(X1),one))),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(20, plain,![X3]:![X4]:X3=join(complement(join(complement(X3),complement(X4))),complement(join(complement(X3),X4))),inference(variable_rename,[status(thm)],[3])).
% cnf(21,plain,(X1=join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2)))),inference(split_conjunct,[status(thm)],[20])).
% fof(22, plain,![X3]:![X4]:meet(X3,X4)=complement(join(complement(X3),complement(X4))),inference(variable_rename,[status(thm)],[4])).
% cnf(23,plain,(meet(X1,X2)=complement(join(complement(X1),complement(X2)))),inference(split_conjunct,[status(thm)],[22])).
% fof(26, plain,![X2]:composition(X2,one)=X2,inference(variable_rename,[status(thm)],[6])).
% cnf(27,plain,(composition(X1,one)=X1),inference(split_conjunct,[status(thm)],[26])).
% fof(28, plain,![X4]:![X5]:![X6]:composition(join(X4,X5),X6)=join(composition(X4,X6),composition(X5,X6)),inference(variable_rename,[status(thm)],[7])).
% cnf(29,plain,(composition(join(X1,X2),X3)=join(composition(X1,X3),composition(X2,X3))),inference(split_conjunct,[status(thm)],[28])).
% fof(30, plain,![X2]:top=join(X2,complement(X2)),inference(variable_rename,[status(thm)],[8])).
% cnf(31,plain,(top=join(X1,complement(X1))),inference(split_conjunct,[status(thm)],[30])).
% fof(32, plain,![X3]:![X4]:join(composition(converse(X3),complement(composition(X3,X4))),complement(X4))=complement(X4),inference(variable_rename,[status(thm)],[9])).
% cnf(33,plain,(join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2)),inference(split_conjunct,[status(thm)],[32])).
% fof(34, plain,![X2]:zero=meet(X2,complement(X2)),inference(variable_rename,[status(thm)],[10])).
% cnf(35,plain,(zero=meet(X1,complement(X1))),inference(split_conjunct,[status(thm)],[34])).
% fof(36, plain,![X2]:converse(converse(X2))=X2,inference(variable_rename,[status(thm)],[11])).
% cnf(37,plain,(converse(converse(X1))=X1),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,![X3]:![X4]:converse(composition(X3,X4))=composition(converse(X4),converse(X3)),inference(variable_rename,[status(thm)],[13])).
% cnf(41,plain,(converse(composition(X1,X2))=composition(converse(X2),converse(X1))),inference(split_conjunct,[status(thm)],[40])).
% fof(42, negated_conjecture,?[X1]:(join(X1,one)=one&~(meet(complement(composition(X1,top)),one)=meet(complement(X1),one))),inference(fof_nnf,[status(thm)],[15])).
% fof(43, negated_conjecture,?[X2]:(join(X2,one)=one&~(meet(complement(composition(X2,top)),one)=meet(complement(X2),one))),inference(variable_rename,[status(thm)],[42])).
% fof(44, negated_conjecture,(join(esk1_0,one)=one&~(meet(complement(composition(esk1_0,top)),one)=meet(complement(esk1_0),one))),inference(skolemize,[status(esa)],[43])).
% cnf(45,negated_conjecture,(meet(complement(composition(esk1_0,top)),one)!=meet(complement(esk1_0),one)),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)],[35,23,theory(equality)]),['unfolding']).
% cnf(48,negated_conjecture,(complement(join(complement(complement(composition(esk1_0,top))),complement(one)))!=complement(join(complement(complement(esk1_0)),complement(one)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[45,23,theory(equality)]),23,theory(equality)]),['unfolding']).
% cnf(49,negated_conjecture,(complement(join(complement(one),complement(complement(composition(esk1_0,top)))))!=complement(join(complement(complement(esk1_0)),complement(one)))),inference(rw,[status(thm)],[48,17,theory(equality)])).
% cnf(50,negated_conjecture,(complement(join(complement(one),complement(complement(composition(esk1_0,top)))))!=complement(join(complement(one),complement(complement(esk1_0))))),inference(rw,[status(thm)],[49,17,theory(equality)])).
% cnf(51,negated_conjecture,(join(one,esk1_0)=one),inference(rw,[status(thm)],[46,17,theory(equality)])).
% cnf(55,plain,(join(X1,converse(X2))=converse(join(converse(X1),X2))),inference(spm,[status(thm)],[39,37,theory(equality)])).
% cnf(58,plain,(composition(converse(X1),X2)=converse(composition(converse(X2),X1))),inference(spm,[status(thm)],[41,37,theory(equality)])).
% cnf(59,plain,(composition(X1,converse(X2))=converse(composition(X2,converse(X1)))),inference(spm,[status(thm)],[41,37,theory(equality)])).
% cnf(60,plain,(join(X1,join(X2,complement(join(X1,X2))))=top),inference(spm,[status(thm)],[31,19,theory(equality)])).
% cnf(66,plain,(join(top,X2)=join(X1,join(complement(X1),X2))),inference(spm,[status(thm)],[19,31,theory(equality)])).
% cnf(67,plain,(join(join(X2,X1),X3)=join(X1,join(X2,X3))),inference(spm,[status(thm)],[19,17,theory(equality)])).
% cnf(71,plain,(join(X2,join(X1,X3))=join(X1,join(X2,X3))),inference(rw,[status(thm)],[67,19,theory(equality)])).
% cnf(112,plain,(converse(top)=join(X1,converse(complement(converse(X1))))),inference(spm,[status(thm)],[55,31,theory(equality)])).
% cnf(141,plain,(converse(converse(X1))=composition(converse(one),X1)),inference(spm,[status(thm)],[58,27,theory(equality)])).
% cnf(149,plain,(X1=composition(converse(one),X1)),inference(rw,[status(thm)],[141,37,theory(equality)])).
% cnf(153,plain,(one=converse(one)),inference(spm,[status(thm)],[27,149,theory(equality)])).
% cnf(170,plain,(composition(one,X1)=X1),inference(rw,[status(thm)],[149,153,theory(equality)])).
% cnf(231,plain,(complement(top)=zero),inference(rw,[status(thm)],[47,31,theory(equality)])).
% cnf(303,plain,(join(X1,top)=join(top,complement(complement(X1)))),inference(spm,[status(thm)],[66,31,theory(equality)])).
% cnf(365,plain,(join(X1,composition(X2,X1))=composition(join(one,X2),X1)),inference(spm,[status(thm)],[29,170,theory(equality)])).
% cnf(609,plain,(join(complement(X2),composition(converse(X1),complement(composition(X1,X2))))=complement(X2)),inference(rw,[status(thm)],[33,17,theory(equality)])).
% cnf(614,plain,(join(complement(X1),composition(converse(one),complement(X1)))=complement(X1)),inference(spm,[status(thm)],[609,170,theory(equality)])).
% cnf(629,plain,(join(complement(X1),complement(X1))=complement(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[614,153,theory(equality)]),170,theory(equality)])).
% cnf(635,plain,(join(complement(X1),join(complement(X1),complement(complement(X1))))=top),inference(spm,[status(thm)],[60,629,theory(equality)])).
% cnf(639,plain,(join(zero,zero)=zero),inference(spm,[status(thm)],[629,231,theory(equality)])).
% cnf(642,plain,(join(complement(X1),top)=top),inference(rw,[status(thm)],[635,31,theory(equality)])).
% cnf(647,plain,(join(zero,X1)=join(zero,join(zero,X1))),inference(spm,[status(thm)],[19,639,theory(equality)])).
% cnf(654,plain,(join(top,complement(X1))=top),inference(rw,[status(thm)],[642,17,theory(equality)])).
% cnf(661,plain,(top=join(X1,top)),inference(rw,[status(thm)],[303,654,theory(equality)])).
% cnf(672,plain,(top=join(top,X1)),inference(spm,[status(thm)],[17,661,theory(equality)])).
% cnf(691,plain,(top=converse(top)),inference(spm,[status(thm)],[112,672,theory(equality)])).
% cnf(733,plain,(join(X1,converse(complement(converse(X1))))=top),inference(rw,[status(thm)],[112,691,theory(equality)])).
% cnf(907,plain,(join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2))))=X1),inference(rw,[status(thm)],[21,17,theory(equality)])).
% cnf(918,plain,(join(complement(join(complement(X1),complement(X1))),complement(top))=X1),inference(spm,[status(thm)],[907,31,theory(equality)])).
% cnf(933,plain,(join(complement(complement(X1)),zero)=X1),inference(rw,[status(thm)],[inference(rw,[status(thm)],[918,629,theory(equality)]),231,theory(equality)])).
% cnf(940,plain,(join(zero,complement(complement(X1)))=X1),inference(rw,[status(thm)],[933,17,theory(equality)])).
% cnf(963,plain,(join(zero,X1)=X1),inference(spm,[status(thm)],[647,940,theory(equality)])).
% cnf(992,plain,(complement(complement(X1))=X1),inference(rw,[status(thm)],[940,963,theory(equality)])).
% cnf(1024,negated_conjecture,(complement(join(complement(one),composition(esk1_0,top)))!=complement(join(complement(one),complement(complement(esk1_0))))),inference(rw,[status(thm)],[50,992,theory(equality)])).
% cnf(1025,negated_conjecture,(complement(join(complement(one),composition(esk1_0,top)))!=complement(join(esk1_0,complement(one)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1024,992,theory(equality)]),17,theory(equality)])).
% cnf(31028,plain,(join(X1,composition(converse(complement(converse(one))),X1))=composition(top,X1)),inference(spm,[status(thm)],[365,733,theory(equality)])).
% cnf(31079,negated_conjecture,(join(X1,composition(esk1_0,X1))=composition(one,X1)),inference(spm,[status(thm)],[365,51,theory(equality)])).
% cnf(31257,plain,(join(X1,composition(converse(complement(one)),X1))=composition(top,X1)),inference(rw,[status(thm)],[31028,153,theory(equality)])).
% cnf(31288,negated_conjecture,(join(X1,composition(esk1_0,X1))=X1),inference(rw,[status(thm)],[31079,170,theory(equality)])).
% cnf(31434,negated_conjecture,(join(X1,X2)=join(X2,join(X1,composition(esk1_0,X2)))),inference(spm,[status(thm)],[71,31288,theory(equality)])).
% cnf(42569,plain,(converse(composition(top,converse(X1)))=join(X1,converse(composition(converse(complement(one)),converse(X1))))),inference(spm,[status(thm)],[55,31257,theory(equality)])).
% cnf(42677,plain,(composition(X1,top)=join(X1,converse(composition(converse(complement(one)),converse(X1))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[42569,59,theory(equality)]),691,theory(equality)])).
% cnf(42678,plain,(composition(X1,top)=join(X1,composition(X1,complement(one)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[42677,41,theory(equality)]),37,theory(equality)])).
% cnf(42863,negated_conjecture,(join(complement(one),composition(esk1_0,top))=join(esk1_0,complement(one))),inference(spm,[status(thm)],[31434,42678,theory(equality)])).
% cnf(43082,negated_conjecture,($false),inference(rw,[status(thm)],[1025,42863,theory(equality)])).
% cnf(43083,negated_conjecture,($false),inference(cn,[status(thm)],[43082,theory(equality)])).
% cnf(43084,negated_conjecture,($false),43083,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1478
% # ...of these trivial : 916
% # ...subsumed : 207
% # ...remaining for further processing: 355
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 63
% # Generated clauses : 21747
% # ...of the previous two non-trivial : 8990
% # Contextual simplify-reflections : 0
% # Paramodulations : 21747
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 292
% # Positive orientable unit clauses: 286
% # Positive unorientable unit clauses: 6
% # Negative unit clauses : 0
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 6499
% # ...number of literals in the above : 6499
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 19
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 949
% # Indexed BW rewrite successes : 199
% # Backwards rewriting index: 343 leaves, 1.80+/-1.549 terms/leaf
% # Paramod-from index: 172 leaves, 1.72+/-1.408 terms/leaf
% # Paramod-into index: 317 leaves, 1.79+/-1.533 terms/leaf
% # -------------------------------------------------
% # User time : 0.401 s
% # System time : 0.016 s
% # Total time : 0.417 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.98 CPU 1.06 WC
% FINAL PrfWatch: 0.98 CPU 1.06 WC
% SZS output end Solution for /tmp/SystemOnTPTP3997/REL027+1.tptp
%
%------------------------------------------------------------------------------