TSTP Solution File: REL045+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : REL045+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 : 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 22:07:42 EST 2010
% Result : Theorem 4.46s
% Output : Solution 4.46s
% 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/SystemOnTPTP9969/REL045+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP9969/REL045+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP9969/REL045+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 10103
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 1.95 CPU 2.03 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(3, axiom,![X1]:![X2]:![X3]:composition(X1,composition(X2,X3))=composition(composition(X1,X2),X3),file('/tmp/SRASS.s.p', composition_associativity)).
% fof(4, axiom,![X1]:![X2]:![X3]:composition(join(X1,X2),X3)=join(composition(X1,X3),composition(X2,X3)),file('/tmp/SRASS.s.p', composition_distributivity)).
% fof(5, axiom,![X1]:converse(converse(X1))=X1,file('/tmp/SRASS.s.p', converse_idempotence)).
% fof(6, axiom,![X1]:![X2]:converse(join(X1,X2))=join(converse(X1),converse(X2)),file('/tmp/SRASS.s.p', converse_additivity)).
% fof(7, axiom,![X1]:![X2]:converse(composition(X1,X2))=composition(converse(X2),converse(X1)),file('/tmp/SRASS.s.p', converse_multiplicativity)).
% fof(8, axiom,![X1]:![X2]:join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2),file('/tmp/SRASS.s.p', converse_cancellativity)).
% fof(9, axiom,![X1]:![X2]:![X3]:join(meet(composition(X1,X2),X3),composition(meet(X1,composition(X3,converse(X2))),meet(X2,composition(converse(X1),X3))))=composition(meet(X1,composition(X3,converse(X2))),meet(X2,composition(converse(X1),X3))),file('/tmp/SRASS.s.p', dedekind_law)).
% fof(12, 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]:composition(X1,one)=X1,file('/tmp/SRASS.s.p', composition_identity)).
% fof(14, axiom,![X1]:![X2]:meet(X1,X2)=complement(join(complement(X1),complement(X2))),file('/tmp/SRASS.s.p', maddux4_definiton_of_meet)).
% fof(15, axiom,![X1]:top=join(X1,complement(X1)),file('/tmp/SRASS.s.p', def_top)).
% fof(16, axiom,![X1]:zero=meet(X1,complement(X1)),file('/tmp/SRASS.s.p', def_zero)).
% fof(17, conjecture,![X1]:join(X1,composition(composition(X1,converse(X1)),X1))=composition(composition(X1,converse(X1)),X1),file('/tmp/SRASS.s.p', goals)).
% fof(18, negated_conjecture,~(![X1]:join(X1,composition(composition(X1,converse(X1)),X1))=composition(composition(X1,converse(X1)),X1)),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,![X4]:![X5]:![X6]:composition(X4,composition(X5,X6))=composition(composition(X4,X5),X6),inference(variable_rename,[status(thm)],[3])).
% cnf(24,plain,(composition(X1,composition(X2,X3))=composition(composition(X1,X2),X3)),inference(split_conjunct,[status(thm)],[23])).
% fof(25, plain,![X4]:![X5]:![X6]:composition(join(X4,X5),X6)=join(composition(X4,X6),composition(X5,X6)),inference(variable_rename,[status(thm)],[4])).
% cnf(26,plain,(composition(join(X1,X2),X3)=join(composition(X1,X3),composition(X2,X3))),inference(split_conjunct,[status(thm)],[25])).
% fof(27, plain,![X2]:converse(converse(X2))=X2,inference(variable_rename,[status(thm)],[5])).
% cnf(28,plain,(converse(converse(X1))=X1),inference(split_conjunct,[status(thm)],[27])).
% fof(29, plain,![X3]:![X4]:converse(join(X3,X4))=join(converse(X3),converse(X4)),inference(variable_rename,[status(thm)],[6])).
% cnf(30,plain,(converse(join(X1,X2))=join(converse(X1),converse(X2))),inference(split_conjunct,[status(thm)],[29])).
% fof(31, plain,![X3]:![X4]:converse(composition(X3,X4))=composition(converse(X4),converse(X3)),inference(variable_rename,[status(thm)],[7])).
% cnf(32,plain,(converse(composition(X1,X2))=composition(converse(X2),converse(X1))),inference(split_conjunct,[status(thm)],[31])).
% fof(33, plain,![X3]:![X4]:join(composition(converse(X3),complement(composition(X3,X4))),complement(X4))=complement(X4),inference(variable_rename,[status(thm)],[8])).
% cnf(34,plain,(join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2)),inference(split_conjunct,[status(thm)],[33])).
% fof(35, plain,![X4]:![X5]:![X6]:join(meet(composition(X4,X5),X6),composition(meet(X4,composition(X6,converse(X5))),meet(X5,composition(converse(X4),X6))))=composition(meet(X4,composition(X6,converse(X5))),meet(X5,composition(converse(X4),X6))),inference(variable_rename,[status(thm)],[9])).
% cnf(36,plain,(join(meet(composition(X1,X2),X3),composition(meet(X1,composition(X3,converse(X2))),meet(X2,composition(converse(X1),X3))))=composition(meet(X1,composition(X3,converse(X2))),meet(X2,composition(converse(X1),X3)))),inference(split_conjunct,[status(thm)],[35])).
% fof(41, plain,![X3]:![X4]:X3=join(complement(join(complement(X3),complement(X4))),complement(join(complement(X3),X4))),inference(variable_rename,[status(thm)],[12])).
% cnf(42,plain,(X1=join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2)))),inference(split_conjunct,[status(thm)],[41])).
% fof(43, plain,![X2]:composition(X2,one)=X2,inference(variable_rename,[status(thm)],[13])).
% cnf(44,plain,(composition(X1,one)=X1),inference(split_conjunct,[status(thm)],[43])).
% fof(45, plain,![X3]:![X4]:meet(X3,X4)=complement(join(complement(X3),complement(X4))),inference(variable_rename,[status(thm)],[14])).
% cnf(46,plain,(meet(X1,X2)=complement(join(complement(X1),complement(X2)))),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]:zero=meet(X2,complement(X2)),inference(variable_rename,[status(thm)],[16])).
% cnf(50,plain,(zero=meet(X1,complement(X1))),inference(split_conjunct,[status(thm)],[49])).
% fof(51, negated_conjecture,?[X1]:~(join(X1,composition(composition(X1,converse(X1)),X1))=composition(composition(X1,converse(X1)),X1)),inference(fof_nnf,[status(thm)],[18])).
% fof(52, negated_conjecture,?[X2]:~(join(X2,composition(composition(X2,converse(X2)),X2))=composition(composition(X2,converse(X2)),X2)),inference(variable_rename,[status(thm)],[51])).
% fof(53, negated_conjecture,~(join(esk1_0,composition(composition(esk1_0,converse(esk1_0)),esk1_0))=composition(composition(esk1_0,converse(esk1_0)),esk1_0)),inference(skolemize,[status(esa)],[52])).
% cnf(54,negated_conjecture,(join(esk1_0,composition(composition(esk1_0,converse(esk1_0)),esk1_0))!=composition(composition(esk1_0,converse(esk1_0)),esk1_0)),inference(split_conjunct,[status(thm)],[53])).
% cnf(55,plain,(complement(join(complement(X1),complement(complement(X1))))=zero),inference(rw,[status(thm)],[50,46,theory(equality)]),['unfolding']).
% cnf(58,plain,(join(complement(join(complement(composition(X1,X2)),complement(X3))),composition(complement(join(complement(X1),complement(composition(X3,converse(X2))))),complement(join(complement(X2),complement(composition(converse(X1),X3))))))=composition(complement(join(complement(X1),complement(composition(X3,converse(X2))))),complement(join(complement(X2),complement(composition(converse(X1),X3)))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[36,46,theory(equality)]),46,theory(equality)]),46,theory(equality)]),46,theory(equality)]),46,theory(equality)]),['unfolding']).
% cnf(60,plain,(converse(top)=join(converse(X1),converse(complement(X1)))),inference(spm,[status(thm)],[30,48,theory(equality)])).
% cnf(67,plain,(converse(X1)=composition(converse(one),converse(X1))),inference(spm,[status(thm)],[32,44,theory(equality)])).
% cnf(69,plain,(complement(top)=zero),inference(rw,[status(thm)],[55,48,theory(equality)])).
% cnf(89,negated_conjecture,(join(esk1_0,composition(esk1_0,composition(converse(esk1_0),esk1_0)))!=composition(composition(esk1_0,converse(esk1_0)),esk1_0)),inference(rw,[status(thm)],[54,24,theory(equality)])).
% cnf(90,negated_conjecture,(join(esk1_0,composition(esk1_0,composition(converse(esk1_0),esk1_0)))!=composition(esk1_0,composition(converse(esk1_0),esk1_0))),inference(rw,[status(thm)],[89,24,theory(equality)])).
% cnf(112,plain,(join(complement(X2),composition(converse(X1),complement(composition(X1,X2))))=complement(X2)),inference(rw,[status(thm)],[34,20,theory(equality)])).
% cnf(129,plain,(join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2))))=X1),inference(rw,[status(thm)],[42,20,theory(equality)])).
% cnf(216,plain,(join(complement(join(complement(composition(converse(X1),X2)),complement(X3))),composition(complement(join(complement(converse(X1)),complement(composition(X3,converse(X2))))),complement(join(complement(X2),complement(composition(X1,X3))))))=composition(complement(join(complement(converse(X1)),complement(composition(X3,converse(X2))))),complement(join(complement(X2),complement(composition(X1,X3)))))),inference(spm,[status(thm)],[58,28,theory(equality)])).
% cnf(291,plain,(composition(converse(one),X1)=X1),inference(spm,[status(thm)],[67,28,theory(equality)])).
% cnf(303,plain,(one=converse(one)),inference(spm,[status(thm)],[44,291,theory(equality)])).
% cnf(334,plain,(composition(one,X1)=X1),inference(rw,[status(thm)],[291,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(388,plain,(join(one,converse(complement(one)))=converse(top)),inference(spm,[status(thm)],[60,303,theory(equality)])).
% cnf(401,plain,(join(complement(complement(X1)),complement(join(complement(X1),complement(complement(X1)))))=X1),inference(spm,[status(thm)],[129,360,theory(equality)])).
% cnf(410,plain,(join(zero,zero)=zero),inference(spm,[status(thm)],[360,69,theory(equality)])).
% cnf(414,plain,(join(complement(complement(X1)),zero)=X1),inference(rw,[status(thm)],[inference(rw,[status(thm)],[401,48,theory(equality)]),69,theory(equality)])).
% cnf(426,plain,(join(zero,X1)=join(zero,join(zero,X1))),inference(spm,[status(thm)],[22,410,theory(equality)])).
% cnf(432,plain,(join(zero,complement(complement(X1)))=X1),inference(rw,[status(thm)],[414,20,theory(equality)])).
% cnf(477,plain,(join(zero,X1)=X1),inference(spm,[status(thm)],[426,432,theory(equality)])).
% cnf(496,plain,(complement(complement(X1))=X1),inference(rw,[status(thm)],[432,477,theory(equality)])).
% cnf(520,plain,(join(X1,X1)=X1),inference(spm,[status(thm)],[360,496,theory(equality)])).
% cnf(544,plain,(join(X1,X2)=join(X1,join(X1,X2))),inference(spm,[status(thm)],[22,520,theory(equality)])).
% cnf(593,plain,(join(complement(join(complement(X1),X2)),X1)=X1),inference(spm,[status(thm)],[544,129,theory(equality)])).
% cnf(599,plain,(join(converse(X1),converse(top))=converse(top)),inference(spm,[status(thm)],[544,60,theory(equality)])).
% cnf(602,plain,(join(X1,top)=top),inference(spm,[status(thm)],[544,48,theory(equality)])).
% cnf(626,plain,(top=join(top,X1)),inference(spm,[status(thm)],[20,602,theory(equality)])).
% cnf(722,plain,(join(X1,converse(top))=converse(top)),inference(spm,[status(thm)],[599,28,theory(equality)])).
% cnf(731,plain,(converse(top)=top),inference(spm,[status(thm)],[626,722,theory(equality)])).
% cnf(754,plain,(join(one,converse(complement(one)))=top),inference(rw,[status(thm)],[388,731,theory(equality)])).
% cnf(763,plain,(composition(top,X1)=join(composition(one,X1),composition(converse(complement(one)),X1))),inference(spm,[status(thm)],[26,754,theory(equality)])).
% cnf(768,plain,(composition(top,X1)=join(X1,composition(converse(complement(one)),X1))),inference(rw,[status(thm)],[763,334,theory(equality)])).
% cnf(1188,plain,(join(X1,complement(join(complement(X1),X2)))=X1),inference(rw,[status(thm)],[593,20,theory(equality)])).
% cnf(1335,plain,(join(X1,complement(composition(top,complement(X1))))=X1),inference(spm,[status(thm)],[1188,768,theory(equality)])).
% cnf(1732,plain,(join(complement(X1),complement(composition(top,X1)))=complement(X1)),inference(spm,[status(thm)],[1335,496,theory(equality)])).
% cnf(123263,plain,(join(complement(join(complement(composition(converse(top),X1)),complement(complement(complement(X1))))),composition(complement(join(complement(converse(top)),complement(composition(complement(complement(X1)),converse(X1))))),complement(complement(X1))))=composition(complement(join(complement(converse(top)),complement(composition(complement(complement(X1)),converse(X1))))),complement(complement(X1)))),inference(spm,[status(thm)],[216,1335,theory(equality)])).
% cnf(123635,plain,(join(X1,composition(X1,composition(converse(X1),X1)))=composition(complement(join(complement(converse(top)),complement(composition(complement(complement(X1)),converse(X1))))),complement(complement(X1)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[123263,731,theory(equality)]),496,theory(equality)]),20,theory(equality)]),1732,theory(equality)]),496,theory(equality)]),731,theory(equality)]),69,theory(equality)]),496,theory(equality)]),477,theory(equality)]),496,theory(equality)]),496,theory(equality)]),24,theory(equality)])).
% cnf(123636,plain,(join(X1,composition(X1,composition(converse(X1),X1)))=composition(X1,composition(converse(X1),X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[123635,731,theory(equality)]),69,theory(equality)]),496,theory(equality)]),477,theory(equality)]),496,theory(equality)]),496,theory(equality)]),24,theory(equality)])).
% cnf(123963,negated_conjecture,($false),inference(rw,[status(thm)],[90,123636,theory(equality)])).
% cnf(123964,negated_conjecture,($false),inference(cn,[status(thm)],[123963,theory(equality)])).
% cnf(123965,negated_conjecture,($false),123964,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 2195
% # ...of these trivial : 1280
% # ...subsumed : 378
% # ...remaining for further processing: 537
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 156
% # Generated clauses : 57810
% # ...of the previous two non-trivial : 27283
% # Contextual simplify-reflections : 0
% # Paramodulations : 57810
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 381
% # Positive orientable unit clauses: 377
% # Positive unorientable unit clauses: 4
% # Negative unit clauses : 0
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 20861
% # ...number of literals in the above : 20861
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 23
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2269
% # Indexed BW rewrite successes : 218
% # Backwards rewriting index: 332 leaves, 2.79+/-4.524 terms/leaf
% # Paramod-from index: 182 leaves, 2.10+/-2.502 terms/leaf
% # Paramod-into index: 315 leaves, 2.77+/-4.552 terms/leaf
% # -------------------------------------------------
% # User time : 1.631 s
% # System time : 0.063 s
% # Total time : 1.694 s
% # Maximum resident set size: 0 pages
% PrfWatch: 3.45 CPU 3.53 WC
% FINAL PrfWatch: 3.45 CPU 3.53 WC
% SZS output end Solution for /tmp/SystemOnTPTP9969/REL045+2.tptp
%
%------------------------------------------------------------------------------