TSTP Solution File: REL005+4 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : REL005+4 : 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:40:14 EST 2010
% Result : Theorem 1.50s
% Output : Solution 1.50s
% 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/SystemOnTPTP24156/REL005+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP24156/REL005+4.tptp
% SZS output start Solution for /tmp/SystemOnTPTP24156/REL005+4.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 24358
% 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(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]:converse(converse(X1))=X1,file('/tmp/SRASS.s.p', converse_idempotence)).
% fof(4, axiom,![X1]:![X2]:converse(join(X1,X2))=join(converse(X1),converse(X2)),file('/tmp/SRASS.s.p', converse_additivity)).
% 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]:![X2]:converse(composition(X1,X2))=composition(converse(X2),converse(X1)),file('/tmp/SRASS.s.p', converse_multiplicativity)).
% fof(10, 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(13, axiom,![X1]:![X2]:join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2),file('/tmp/SRASS.s.p', converse_cancellativity)).
% fof(14, axiom,![X1]:zero=meet(X1,complement(X1)),file('/tmp/SRASS.s.p', def_zero)).
% fof(15, axiom,![X1]:top=join(X1,complement(X1)),file('/tmp/SRASS.s.p', def_top)).
% fof(16, axiom,![X1]:composition(X1,one)=X1,file('/tmp/SRASS.s.p', composition_identity)).
% fof(17, conjecture,![X1]:![X2]:(join(converse(meet(X1,X2)),meet(converse(X1),converse(X2)))=meet(converse(X1),converse(X2))&join(meet(converse(X1),converse(X2)),converse(meet(X1,X2)))=converse(meet(X1,X2))),file('/tmp/SRASS.s.p', goals)).
% fof(18, negated_conjecture,~(![X1]:![X2]:(join(converse(meet(X1,X2)),meet(converse(X1),converse(X2)))=meet(converse(X1),converse(X2))&join(meet(converse(X1),converse(X2)),converse(meet(X1,X2)))=converse(meet(X1,X2)))),inference(assume_negation,[status(cth)],[17])).
% fof(19, plain,![X3]:![X4]:join(X3,X4)=join(X4,X3),inference(variable_rename,[status(thm)],[1])).
% cnf(20,plain,(join(X1,X2)=join(X2,X1)),inference(split_conjunct,[status(thm)],[19])).
% fof(21, plain,![X4]:![X5]:![X6]:join(X4,join(X5,X6))=join(join(X4,X5),X6),inference(variable_rename,[status(thm)],[2])).
% cnf(22,plain,(join(X1,join(X2,X3))=join(join(X1,X2),X3)),inference(split_conjunct,[status(thm)],[21])).
% fof(23, plain,![X2]:converse(converse(X2))=X2,inference(variable_rename,[status(thm)],[3])).
% cnf(24,plain,(converse(converse(X1))=X1),inference(split_conjunct,[status(thm)],[23])).
% fof(25, plain,![X3]:![X4]:converse(join(X3,X4))=join(converse(X3),converse(X4)),inference(variable_rename,[status(thm)],[4])).
% cnf(26,plain,(converse(join(X1,X2))=join(converse(X1),converse(X2))),inference(split_conjunct,[status(thm)],[25])).
% fof(33, plain,![X3]:![X4]:meet(X3,X4)=complement(join(complement(X3),complement(X4))),inference(variable_rename,[status(thm)],[8])).
% cnf(34,plain,(meet(X1,X2)=complement(join(complement(X1),complement(X2)))),inference(split_conjunct,[status(thm)],[33])).
% fof(35, plain,![X3]:![X4]:converse(composition(X3,X4))=composition(converse(X4),converse(X3)),inference(variable_rename,[status(thm)],[9])).
% cnf(36,plain,(converse(composition(X1,X2))=composition(converse(X2),converse(X1))),inference(split_conjunct,[status(thm)],[35])).
% fof(37, plain,![X3]:![X4]:X3=join(complement(join(complement(X3),complement(X4))),complement(join(complement(X3),X4))),inference(variable_rename,[status(thm)],[10])).
% cnf(38,plain,(X1=join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2)))),inference(split_conjunct,[status(thm)],[37])).
% fof(43, plain,![X3]:![X4]:join(composition(converse(X3),complement(composition(X3,X4))),complement(X4))=complement(X4),inference(variable_rename,[status(thm)],[13])).
% cnf(44,plain,(join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2)),inference(split_conjunct,[status(thm)],[43])).
% fof(45, plain,![X2]:zero=meet(X2,complement(X2)),inference(variable_rename,[status(thm)],[14])).
% cnf(46,plain,(zero=meet(X1,complement(X1))),inference(split_conjunct,[status(thm)],[45])).
% fof(47, plain,![X2]:top=join(X2,complement(X2)),inference(variable_rename,[status(thm)],[15])).
% cnf(48,plain,(top=join(X1,complement(X1))),inference(split_conjunct,[status(thm)],[47])).
% fof(49, plain,![X2]:composition(X2,one)=X2,inference(variable_rename,[status(thm)],[16])).
% cnf(50,plain,(composition(X1,one)=X1),inference(split_conjunct,[status(thm)],[49])).
% fof(51, negated_conjecture,?[X1]:?[X2]:(~(join(converse(meet(X1,X2)),meet(converse(X1),converse(X2)))=meet(converse(X1),converse(X2)))|~(join(meet(converse(X1),converse(X2)),converse(meet(X1,X2)))=converse(meet(X1,X2)))),inference(fof_nnf,[status(thm)],[18])).
% fof(52, negated_conjecture,?[X3]:?[X4]:(~(join(converse(meet(X3,X4)),meet(converse(X3),converse(X4)))=meet(converse(X3),converse(X4)))|~(join(meet(converse(X3),converse(X4)),converse(meet(X3,X4)))=converse(meet(X3,X4)))),inference(variable_rename,[status(thm)],[51])).
% fof(53, negated_conjecture,(~(join(converse(meet(esk1_0,esk2_0)),meet(converse(esk1_0),converse(esk2_0)))=meet(converse(esk1_0),converse(esk2_0)))|~(join(meet(converse(esk1_0),converse(esk2_0)),converse(meet(esk1_0,esk2_0)))=converse(meet(esk1_0,esk2_0)))),inference(skolemize,[status(esa)],[52])).
% cnf(54,negated_conjecture,(join(meet(converse(esk1_0),converse(esk2_0)),converse(meet(esk1_0,esk2_0)))!=converse(meet(esk1_0,esk2_0))|join(converse(meet(esk1_0,esk2_0)),meet(converse(esk1_0),converse(esk2_0)))!=meet(converse(esk1_0),converse(esk2_0))),inference(split_conjunct,[status(thm)],[53])).
% cnf(55,plain,(complement(join(complement(X1),complement(complement(X1))))=zero),inference(rw,[status(thm)],[46,34,theory(equality)]),['unfolding']).
% cnf(59,negated_conjecture,(join(complement(join(complement(converse(esk1_0)),complement(converse(esk2_0)))),converse(complement(join(complement(esk1_0),complement(esk2_0)))))!=converse(complement(join(complement(esk1_0),complement(esk2_0))))|join(converse(complement(join(complement(esk1_0),complement(esk2_0)))),complement(join(complement(converse(esk1_0)),complement(converse(esk2_0)))))!=complement(join(complement(converse(esk1_0)),complement(converse(esk2_0))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[54,34,theory(equality)]),34,theory(equality)]),34,theory(equality)]),34,theory(equality)]),34,theory(equality)]),34,theory(equality)]),['unfolding']).
% cnf(60,negated_conjecture,(join(complement(join(complement(converse(esk1_0)),complement(converse(esk2_0)))),converse(complement(join(complement(esk1_0),complement(esk2_0)))))!=complement(join(complement(converse(esk1_0)),complement(converse(esk2_0))))|join(complement(join(complement(converse(esk1_0)),complement(converse(esk2_0)))),converse(complement(join(complement(esk1_0),complement(esk2_0)))))!=converse(complement(join(complement(esk1_0),complement(esk2_0))))),inference(rw,[status(thm)],[59,20,theory(equality)])).
% cnf(62,plain,(converse(top)=join(converse(X1),converse(complement(X1)))),inference(spm,[status(thm)],[26,48,theory(equality)])).
% cnf(69,plain,(converse(X1)=composition(converse(one),converse(X1))),inference(spm,[status(thm)],[36,50,theory(equality)])).
% cnf(71,plain,(complement(top)=zero),inference(rw,[status(thm)],[55,48,theory(equality)])).
% cnf(79,plain,(join(join(X2,X1),X3)=join(X1,join(X2,X3))),inference(spm,[status(thm)],[22,20,theory(equality)])).
% cnf(85,plain,(join(X2,join(X1,X3))=join(X1,join(X2,X3))),inference(rw,[status(thm)],[79,22,theory(equality)])).
% cnf(112,plain,(join(complement(X2),composition(converse(X1),complement(composition(X1,X2))))=complement(X2)),inference(rw,[status(thm)],[44,20,theory(equality)])).
% cnf(129,plain,(join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2))))=X1),inference(rw,[status(thm)],[38,20,theory(equality)])).
% cnf(133,plain,(join(complement(X1),complement(join(complement(join(complement(X1),X2)),complement(complement(join(complement(X1),complement(X2)))))))=join(complement(X1),X2)),inference(spm,[status(thm)],[129,129,theory(equality)])).
% cnf(292,plain,(composition(converse(one),X1)=X1),inference(spm,[status(thm)],[69,24,theory(equality)])).
% cnf(303,plain,(one=converse(one)),inference(spm,[status(thm)],[50,292,theory(equality)])).
% cnf(334,plain,(composition(one,X1)=X1),inference(rw,[status(thm)],[292,303,theory(equality)])).
% cnf(348,plain,(join(complement(X1),composition(converse(one),complement(X1)))=complement(X1)),inference(spm,[status(thm)],[112,334,theory(equality)])).
% cnf(360,plain,(join(complement(X1),complement(X1))=complement(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[348,303,theory(equality)]),334,theory(equality)])).
% cnf(389,plain,(join(complement(complement(X1)),complement(join(complement(X1),complement(complement(X1)))))=X1),inference(spm,[status(thm)],[129,360,theory(equality)])).
% cnf(398,plain,(join(zero,zero)=zero),inference(spm,[status(thm)],[360,71,theory(equality)])).
% cnf(402,plain,(join(complement(complement(X1)),zero)=X1),inference(rw,[status(thm)],[inference(rw,[status(thm)],[389,48,theory(equality)]),71,theory(equality)])).
% cnf(414,plain,(join(zero,X1)=join(zero,join(zero,X1))),inference(spm,[status(thm)],[22,398,theory(equality)])).
% cnf(420,plain,(join(zero,complement(complement(X1)))=X1),inference(rw,[status(thm)],[402,20,theory(equality)])).
% cnf(459,plain,(join(zero,X1)=X1),inference(spm,[status(thm)],[414,420,theory(equality)])).
% cnf(470,plain,(X1=join(X1,zero)),inference(spm,[status(thm)],[20,459,theory(equality)])).
% cnf(479,plain,(complement(complement(X1))=X1),inference(rw,[status(thm)],[420,459,theory(equality)])).
% cnf(501,plain,(join(X1,X1)=X1),inference(spm,[status(thm)],[360,479,theory(equality)])).
% cnf(525,plain,(join(X1,X2)=join(X1,join(X1,X2))),inference(spm,[status(thm)],[22,501,theory(equality)])).
% cnf(573,plain,(join(complement(join(complement(X1),X2)),X1)=X1),inference(spm,[status(thm)],[525,129,theory(equality)])).
% cnf(581,plain,(join(X1,top)=top),inference(spm,[status(thm)],[525,48,theory(equality)])).
% cnf(582,plain,(join(X1,join(X2,X1))=join(X2,X1)),inference(spm,[status(thm)],[525,20,theory(equality)])).
% cnf(605,plain,(top=join(top,X1)),inference(spm,[status(thm)],[20,581,theory(equality)])).
% cnf(606,plain,(converse(top)=join(converse(X1),converse(top))),inference(spm,[status(thm)],[26,581,theory(equality)])).
% cnf(705,plain,(join(X1,converse(top))=converse(top)),inference(spm,[status(thm)],[606,24,theory(equality)])).
% cnf(720,plain,(converse(top)=top),inference(spm,[status(thm)],[605,705,theory(equality)])).
% cnf(743,plain,(join(converse(X1),converse(complement(X1)))=top),inference(rw,[status(thm)],[62,720,theory(equality)])).
% cnf(811,plain,(join(X1,converse(complement(converse(X1))))=top),inference(spm,[status(thm)],[743,24,theory(equality)])).
% cnf(1173,plain,(join(X1,complement(join(complement(X1),X2)))=X1),inference(rw,[status(thm)],[573,20,theory(equality)])).
% cnf(1202,plain,(join(X1,complement(join(X2,complement(X1))))=X1),inference(spm,[status(thm)],[1173,582,theory(equality)])).
% cnf(1269,plain,(join(complement(X1),complement(join(X2,X1)))=complement(X1)),inference(spm,[status(thm)],[1202,479,theory(equality)])).
% cnf(16118,plain,(join(complement(X1),complement(join(complement(X1),complement(X2))))=join(complement(X1),X2)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[133,479,theory(equality)]),85,theory(equality)]),20,theory(equality)]),1269,theory(equality)])).
% cnf(16172,plain,(join(X1,complement(join(X1,complement(X2))))=join(X1,X2)),inference(spm,[status(thm)],[16118,479,theory(equality)])).
% cnf(16336,plain,(join(X1,complement(join(X1,X2)))=join(X1,join(X1,complement(X2)))),inference(spm,[status(thm)],[16172,16172,theory(equality)])).
% cnf(16421,plain,(join(X1,complement(join(X1,X2)))=join(X1,complement(X2))),inference(rw,[status(thm)],[16336,525,theory(equality)])).
% cnf(16581,plain,(join(converse(X1),complement(top))=join(converse(X1),complement(converse(complement(X1))))),inference(spm,[status(thm)],[16421,743,theory(equality)])).
% cnf(16602,plain,(join(X1,complement(top))=join(X1,complement(converse(complement(converse(X1)))))),inference(spm,[status(thm)],[16421,811,theory(equality)])).
% cnf(16736,plain,(converse(X1)=join(converse(X1),complement(converse(complement(X1))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[16581,71,theory(equality)]),470,theory(equality)])).
% cnf(16766,plain,(X1=join(X1,complement(converse(complement(converse(X1)))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[16602,71,theory(equality)]),470,theory(equality)])).
% cnf(16820,plain,(join(complement(complement(converse(complement(converse(X1))))),complement(X1))=complement(complement(converse(complement(converse(X1)))))),inference(spm,[status(thm)],[1269,16766,theory(equality)])).
% cnf(16878,plain,(join(converse(complement(converse(X1))),complement(X1))=complement(complement(converse(complement(converse(X1)))))),inference(rw,[status(thm)],[16820,479,theory(equality)])).
% cnf(16879,plain,(join(converse(complement(converse(X1))),complement(X1))=converse(complement(converse(X1)))),inference(rw,[status(thm)],[16878,479,theory(equality)])).
% cnf(16893,plain,(converse(converse(X1))=join(converse(converse(X1)),converse(complement(converse(complement(X1)))))),inference(spm,[status(thm)],[26,16736,theory(equality)])).
% cnf(16932,plain,(X1=join(converse(converse(X1)),converse(complement(converse(complement(X1)))))),inference(rw,[status(thm)],[16893,24,theory(equality)])).
% cnf(16933,plain,(X1=join(X1,converse(complement(converse(complement(X1)))))),inference(rw,[status(thm)],[16932,24,theory(equality)])).
% cnf(17623,plain,(join(complement(X1),converse(complement(converse(X1))))=converse(complement(converse(X1)))),inference(rw,[status(thm)],[16879,20,theory(equality)])).
% cnf(17665,plain,(join(X1,converse(complement(converse(complement(X1)))))=converse(complement(converse(complement(X1))))),inference(spm,[status(thm)],[17623,479,theory(equality)])).
% cnf(17700,plain,(X1=converse(complement(converse(complement(X1))))),inference(rw,[status(thm)],[17665,16933,theory(equality)])).
% cnf(17701,plain,(converse(X1)=complement(converse(complement(X1)))),inference(spm,[status(thm)],[24,17700,theory(equality)])).
% cnf(17827,plain,(complement(converse(X1))=converse(complement(X1))),inference(spm,[status(thm)],[479,17701,theory(equality)])).
% cnf(17996,negated_conjecture,($false|join(complement(join(complement(converse(esk1_0)),complement(converse(esk2_0)))),converse(complement(join(complement(esk1_0),complement(esk2_0)))))!=converse(complement(join(complement(esk1_0),complement(esk2_0))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[60,17827,theory(equality)]),26,theory(equality)]),17827,theory(equality)]),17827,theory(equality)]),501,theory(equality)])).
% cnf(17997,negated_conjecture,($false|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)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[17996,17827,theory(equality)]),26,theory(equality)]),17827,theory(equality)]),17827,theory(equality)]),501,theory(equality)])).
% cnf(17998,negated_conjecture,($false|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[17997,17827,theory(equality)]),26,theory(equality)]),17827,theory(equality)]),17827,theory(equality)])).
% cnf(17999,negated_conjecture,($false),inference(cn,[status(thm)],[17998,theory(equality)])).
% cnf(18000,negated_conjecture,($false),17999,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 703
% # ...of these trivial : 387
% # ...subsumed : 89
% # ...remaining for further processing: 227
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 109
% # Generated clauses : 8973
% # ...of the previous two non-trivial : 4109
% # Contextual simplify-reflections : 0
% # Paramodulations : 8973
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 118
% # Positive orientable unit clauses: 114
% # Positive unorientable unit clauses: 4
% # Negative unit clauses : 0
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 2019
% # ...number of literals in the above : 2019
% # 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 : 507
% # Indexed BW rewrite successes : 192
% # Backwards rewriting index: 151 leaves, 1.64+/-1.209 terms/leaf
% # Paramod-from index: 84 leaves, 1.43+/-1.038 terms/leaf
% # Paramod-into index: 149 leaves, 1.56+/-1.131 terms/leaf
% # -------------------------------------------------
% # User time : 0.179 s
% # System time : 0.009 s
% # Total time : 0.188 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.46 CPU 0.54 WC
% FINAL PrfWatch: 0.46 CPU 0.54 WC
% SZS output end Solution for /tmp/SystemOnTPTP24156/REL005+4.tptp
%
%------------------------------------------------------------------------------