TSTP Solution File: REL023+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : REL023+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 : 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:49:38 EST 2010
% Result : Theorem 1.91s
% Output : Solution 1.91s
% 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/SystemOnTPTP30033/REL023+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP30033/REL023+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP30033/REL023+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 30165
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.010 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(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(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]:meet(X1,X2)=complement(join(complement(X1),complement(X2))),file('/tmp/SRASS.s.p', maddux4_definiton_of_meet)).
% 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(11, axiom,![X1]:composition(X1,one)=X1,file('/tmp/SRASS.s.p', composition_identity)).
% fof(12, axiom,![X1]:zero=meet(X1,complement(X1)),file('/tmp/SRASS.s.p', def_zero)).
% fof(13, axiom,![X1]:top=join(X1,complement(X1)),file('/tmp/SRASS.s.p', def_top)).
% fof(14, conjecture,![X1]:![X2]:![X3]:join(composition(meet(X1,converse(X2)),meet(X2,X3)),composition(X1,meet(X2,X3)))=composition(X1,meet(X2,X3)),file('/tmp/SRASS.s.p', goals)).
% fof(15, negated_conjecture,~(![X1]:![X2]:![X3]:join(composition(meet(X1,converse(X2)),meet(X2,X3)),composition(X1,meet(X2,X3)))=composition(X1,meet(X2,X3))),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,![X4]:![X5]:![X6]:composition(join(X4,X5),X6)=join(composition(X4,X6),composition(X5,X6)),inference(variable_rename,[status(thm)],[4])).
% cnf(23,plain,(composition(join(X1,X2),X3)=join(composition(X1,X3),composition(X2,X3))),inference(split_conjunct,[status(thm)],[22])).
% fof(24, plain,![X2]:converse(converse(X2))=X2,inference(variable_rename,[status(thm)],[5])).
% cnf(25,plain,(converse(converse(X1))=X1),inference(split_conjunct,[status(thm)],[24])).
% fof(28, plain,![X3]:![X4]:converse(composition(X3,X4))=composition(converse(X4),converse(X3)),inference(variable_rename,[status(thm)],[7])).
% cnf(29,plain,(converse(composition(X1,X2))=composition(converse(X2),converse(X1))),inference(split_conjunct,[status(thm)],[28])).
% fof(30, plain,![X3]:![X4]:join(composition(converse(X3),complement(composition(X3,X4))),complement(X4))=complement(X4),inference(variable_rename,[status(thm)],[8])).
% cnf(31,plain,(join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2)),inference(split_conjunct,[status(thm)],[30])).
% fof(32, plain,![X3]:![X4]:meet(X3,X4)=complement(join(complement(X3),complement(X4))),inference(variable_rename,[status(thm)],[9])).
% cnf(33,plain,(meet(X1,X2)=complement(join(complement(X1),complement(X2)))),inference(split_conjunct,[status(thm)],[32])).
% fof(34, plain,![X3]:![X4]:X3=join(complement(join(complement(X3),complement(X4))),complement(join(complement(X3),X4))),inference(variable_rename,[status(thm)],[10])).
% cnf(35,plain,(X1=join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2)))),inference(split_conjunct,[status(thm)],[34])).
% fof(36, plain,![X2]:composition(X2,one)=X2,inference(variable_rename,[status(thm)],[11])).
% cnf(37,plain,(composition(X1,one)=X1),inference(split_conjunct,[status(thm)],[36])).
% fof(38, plain,![X2]:zero=meet(X2,complement(X2)),inference(variable_rename,[status(thm)],[12])).
% cnf(39,plain,(zero=meet(X1,complement(X1))),inference(split_conjunct,[status(thm)],[38])).
% fof(40, plain,![X2]:top=join(X2,complement(X2)),inference(variable_rename,[status(thm)],[13])).
% cnf(41,plain,(top=join(X1,complement(X1))),inference(split_conjunct,[status(thm)],[40])).
% fof(42, negated_conjecture,?[X1]:?[X2]:?[X3]:~(join(composition(meet(X1,converse(X2)),meet(X2,X3)),composition(X1,meet(X2,X3)))=composition(X1,meet(X2,X3))),inference(fof_nnf,[status(thm)],[15])).
% fof(43, negated_conjecture,?[X4]:?[X5]:?[X6]:~(join(composition(meet(X4,converse(X5)),meet(X5,X6)),composition(X4,meet(X5,X6)))=composition(X4,meet(X5,X6))),inference(variable_rename,[status(thm)],[42])).
% fof(44, negated_conjecture,~(join(composition(meet(esk1_0,converse(esk2_0)),meet(esk2_0,esk3_0)),composition(esk1_0,meet(esk2_0,esk3_0)))=composition(esk1_0,meet(esk2_0,esk3_0))),inference(skolemize,[status(esa)],[43])).
% cnf(45,negated_conjecture,(join(composition(meet(esk1_0,converse(esk2_0)),meet(esk2_0,esk3_0)),composition(esk1_0,meet(esk2_0,esk3_0)))!=composition(esk1_0,meet(esk2_0,esk3_0))),inference(split_conjunct,[status(thm)],[44])).
% cnf(46,plain,(complement(join(complement(X1),complement(complement(X1))))=zero),inference(rw,[status(thm)],[39,33,theory(equality)]),['unfolding']).
% cnf(47,negated_conjecture,(join(composition(complement(join(complement(esk1_0),complement(converse(esk2_0)))),complement(join(complement(esk2_0),complement(esk3_0)))),composition(esk1_0,complement(join(complement(esk2_0),complement(esk3_0)))))!=composition(esk1_0,complement(join(complement(esk2_0),complement(esk3_0))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[45,33,theory(equality)]),33,theory(equality)]),33,theory(equality)]),33,theory(equality)]),['unfolding']).
% cnf(48,negated_conjecture,(join(composition(esk1_0,complement(join(complement(esk3_0),complement(esk2_0)))),composition(complement(join(complement(esk1_0),complement(converse(esk2_0)))),complement(join(complement(esk3_0),complement(esk2_0)))))!=composition(esk1_0,complement(join(complement(esk2_0),complement(esk3_0))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[47,17,theory(equality)]),17,theory(equality)]),17,theory(equality)])).
% cnf(49,negated_conjecture,(join(composition(esk1_0,complement(join(complement(esk3_0),complement(esk2_0)))),composition(complement(join(complement(esk1_0),complement(converse(esk2_0)))),complement(join(complement(esk3_0),complement(esk2_0)))))!=composition(esk1_0,complement(join(complement(esk3_0),complement(esk2_0))))),inference(rw,[status(thm)],[48,17,theory(equality)])).
% cnf(58,plain,(converse(X1)=composition(converse(one),converse(X1))),inference(spm,[status(thm)],[29,37,theory(equality)])).
% cnf(60,plain,(complement(top)=zero),inference(rw,[status(thm)],[46,41,theory(equality)])).
% cnf(101,plain,(join(complement(X2),composition(converse(X1),complement(composition(X1,X2))))=complement(X2)),inference(rw,[status(thm)],[31,17,theory(equality)])).
% cnf(118,plain,(join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2))))=X1),inference(rw,[status(thm)],[35,17,theory(equality)])).
% cnf(155,plain,(composition(converse(one),X1)=X1),inference(spm,[status(thm)],[58,25,theory(equality)])).
% cnf(161,plain,(one=converse(one)),inference(spm,[status(thm)],[37,155,theory(equality)])).
% cnf(174,plain,(composition(one,X1)=X1),inference(rw,[status(thm)],[155,161,theory(equality)])).
% cnf(178,plain,(join(complement(X1),composition(converse(one),complement(X1)))=complement(X1)),inference(spm,[status(thm)],[101,174,theory(equality)])).
% cnf(182,plain,(join(complement(X1),complement(X1))=complement(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[178,161,theory(equality)]),174,theory(equality)])).
% cnf(188,plain,(join(complement(complement(X1)),complement(join(complement(X1),complement(complement(X1)))))=X1),inference(spm,[status(thm)],[118,182,theory(equality)])).
% cnf(190,plain,(join(zero,zero)=zero),inference(spm,[status(thm)],[182,60,theory(equality)])).
% cnf(194,plain,(join(complement(complement(X1)),zero)=X1),inference(rw,[status(thm)],[inference(rw,[status(thm)],[188,41,theory(equality)]),60,theory(equality)])).
% cnf(197,plain,(join(zero,X1)=join(zero,join(zero,X1))),inference(spm,[status(thm)],[19,190,theory(equality)])).
% cnf(229,plain,(join(zero,complement(complement(X1)))=X1),inference(rw,[status(thm)],[194,17,theory(equality)])).
% cnf(250,plain,(join(zero,X1)=X1),inference(spm,[status(thm)],[197,229,theory(equality)])).
% cnf(270,plain,(complement(complement(X1))=X1),inference(rw,[status(thm)],[229,250,theory(equality)])).
% cnf(283,plain,(join(X1,X1)=X1),inference(spm,[status(thm)],[182,270,theory(equality)])).
% cnf(316,plain,(join(X1,X2)=join(X1,join(X1,X2))),inference(spm,[status(thm)],[19,283,theory(equality)])).
% cnf(336,plain,(join(complement(join(complement(X1),X2)),X1)=X1),inference(spm,[status(thm)],[316,118,theory(equality)])).
% cnf(815,plain,(join(X1,complement(join(complement(X1),X2)))=X1),inference(rw,[status(thm)],[336,17,theory(equality)])).
% cnf(824,plain,(composition(X1,X3)=join(composition(X1,X3),composition(complement(join(complement(X1),X2)),X3))),inference(spm,[status(thm)],[23,815,theory(equality)])).
% cnf(40614,negated_conjecture,($false),inference(rw,[status(thm)],[49,824,theory(equality)])).
% cnf(40615,negated_conjecture,($false),inference(cn,[status(thm)],[40614,theory(equality)])).
% cnf(40616,negated_conjecture,($false),40615,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1196
% # ...of these trivial : 679
% # ...subsumed : 175
% # ...remaining for further processing: 342
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 138
% # Generated clauses : 20120
% # ...of the previous two non-trivial : 8189
% # Contextual simplify-reflections : 0
% # Paramodulations : 20120
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 204
% # Positive orientable unit clauses: 200
% # Positive unorientable unit clauses: 4
% # Negative unit clauses : 0
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 4430
% # ...number of literals in the above : 4430
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 8
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 862
% # Indexed BW rewrite successes : 205
% # Backwards rewriting index: 207 leaves, 1.93+/-1.867 terms/leaf
% # Paramod-from index: 119 leaves, 1.73+/-1.538 terms/leaf
% # Paramod-into index: 202 leaves, 1.86+/-1.802 terms/leaf
% # -------------------------------------------------
% # User time : 0.371 s
% # System time : 0.017 s
% # Total time : 0.388 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.90 CPU 0.97 WC
% FINAL PrfWatch: 0.90 CPU 0.97 WC
% SZS output end Solution for /tmp/SystemOnTPTP30033/REL023+1.tptp
%
%------------------------------------------------------------------------------