TSTP Solution File: REL015+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : REL015+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 : art07.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:37:38 EST 2010
% Result : Theorem 1.14s
% Output : Solution 1.14s
% 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/SystemOnTPTP1835/REL015+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP1835/REL015+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP1835/REL015+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 1940
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:![X3]:composition(join(X1,X2),X3)=join(composition(X1,X3),composition(X2,X3)),file('/tmp/SRASS.s.p', composition_distributivity)).
% fof(3, axiom,![X1]:![X2]:join(X1,X2)=join(X2,X1),file('/tmp/SRASS.s.p', maddux1_join_commutativity)).
% fof(4, axiom,![X1]:![X2]:![X3]:join(X1,join(X2,X3))=join(join(X1,X2),X3),file('/tmp/SRASS.s.p', maddux2_join_associativity)).
% fof(5, 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(6, axiom,![X1]:converse(converse(X1))=X1,file('/tmp/SRASS.s.p', converse_idempotence)).
% fof(7, axiom,![X1]:top=join(X1,complement(X1)),file('/tmp/SRASS.s.p', def_top)).
% fof(8, axiom,![X1]:![X2]:converse(composition(X1,X2))=composition(converse(X2),converse(X1)),file('/tmp/SRASS.s.p', converse_multiplicativity)).
% fof(9, axiom,![X1]:composition(X1,one)=X1,file('/tmp/SRASS.s.p', composition_identity)).
% fof(10, axiom,![X1]:![X2]:converse(join(X1,X2))=join(converse(X1),converse(X2)),file('/tmp/SRASS.s.p', converse_additivity)).
% 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]:meet(X1,X2)=complement(join(complement(X1),complement(X2))),file('/tmp/SRASS.s.p', maddux4_definiton_of_meet)).
% fof(13, axiom,![X1]:zero=meet(X1,complement(X1)),file('/tmp/SRASS.s.p', def_zero)).
% fof(14, conjecture,composition(top,top)=top,file('/tmp/SRASS.s.p', goals)).
% fof(15, negated_conjecture,~(composition(top,top)=top),inference(assume_negation,[status(cth)],[14])).
% fof(16, negated_conjecture,~(composition(top,top)=top),inference(fof_simplification,[status(thm)],[15,theory(equality)])).
% fof(19, plain,![X4]:![X5]:![X6]:composition(join(X4,X5),X6)=join(composition(X4,X6),composition(X5,X6)),inference(variable_rename,[status(thm)],[2])).
% cnf(20,plain,(composition(join(X1,X2),X3)=join(composition(X1,X3),composition(X2,X3))),inference(split_conjunct,[status(thm)],[19])).
% fof(21, plain,![X3]:![X4]:join(X3,X4)=join(X4,X3),inference(variable_rename,[status(thm)],[3])).
% cnf(22,plain,(join(X1,X2)=join(X2,X1)),inference(split_conjunct,[status(thm)],[21])).
% fof(23, plain,![X4]:![X5]:![X6]:join(X4,join(X5,X6))=join(join(X4,X5),X6),inference(variable_rename,[status(thm)],[4])).
% cnf(24,plain,(join(X1,join(X2,X3))=join(join(X1,X2),X3)),inference(split_conjunct,[status(thm)],[23])).
% fof(25, plain,![X3]:![X4]:X3=join(complement(join(complement(X3),complement(X4))),complement(join(complement(X3),X4))),inference(variable_rename,[status(thm)],[5])).
% cnf(26,plain,(X1=join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2)))),inference(split_conjunct,[status(thm)],[25])).
% fof(27, plain,![X2]:converse(converse(X2))=X2,inference(variable_rename,[status(thm)],[6])).
% cnf(28,plain,(converse(converse(X1))=X1),inference(split_conjunct,[status(thm)],[27])).
% fof(29, plain,![X2]:top=join(X2,complement(X2)),inference(variable_rename,[status(thm)],[7])).
% cnf(30,plain,(top=join(X1,complement(X1))),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)],[8])).
% cnf(32,plain,(converse(composition(X1,X2))=composition(converse(X2),converse(X1))),inference(split_conjunct,[status(thm)],[31])).
% fof(33, plain,![X2]:composition(X2,one)=X2,inference(variable_rename,[status(thm)],[9])).
% cnf(34,plain,(composition(X1,one)=X1),inference(split_conjunct,[status(thm)],[33])).
% fof(35, plain,![X3]:![X4]:converse(join(X3,X4))=join(converse(X3),converse(X4)),inference(variable_rename,[status(thm)],[10])).
% cnf(36,plain,(converse(join(X1,X2))=join(converse(X1),converse(X2))),inference(split_conjunct,[status(thm)],[35])).
% fof(37, plain,![X3]:![X4]:join(composition(converse(X3),complement(composition(X3,X4))),complement(X4))=complement(X4),inference(variable_rename,[status(thm)],[11])).
% cnf(38,plain,(join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2)),inference(split_conjunct,[status(thm)],[37])).
% fof(39, plain,![X3]:![X4]:meet(X3,X4)=complement(join(complement(X3),complement(X4))),inference(variable_rename,[status(thm)],[12])).
% cnf(40,plain,(meet(X1,X2)=complement(join(complement(X1),complement(X2)))),inference(split_conjunct,[status(thm)],[39])).
% fof(41, plain,![X2]:zero=meet(X2,complement(X2)),inference(variable_rename,[status(thm)],[13])).
% cnf(42,plain,(zero=meet(X1,complement(X1))),inference(split_conjunct,[status(thm)],[41])).
% cnf(43,negated_conjecture,(composition(top,top)!=top),inference(split_conjunct,[status(thm)],[16])).
% cnf(44,plain,(complement(join(complement(X1),complement(complement(X1))))=zero),inference(rw,[status(thm)],[42,40,theory(equality)]),['unfolding']).
% cnf(45,plain,(composition(converse(X1),X2)=converse(composition(converse(X2),X1))),inference(spm,[status(thm)],[32,28,theory(equality)])).
% cnf(50,plain,(join(X1,converse(X2))=converse(join(converse(X1),X2))),inference(spm,[status(thm)],[36,28,theory(equality)])).
% cnf(60,plain,(converse(converse(X1))=composition(converse(one),X1)),inference(spm,[status(thm)],[45,34,theory(equality)])).
% cnf(64,plain,(X1=composition(converse(one),X1)),inference(rw,[status(thm)],[60,28,theory(equality)])).
% cnf(67,plain,(one=converse(one)),inference(spm,[status(thm)],[34,64,theory(equality)])).
% cnf(78,plain,(composition(one,X1)=X1),inference(rw,[status(thm)],[64,67,theory(equality)])).
% cnf(96,plain,(join(X1,join(X2,complement(join(X1,X2))))=top),inference(spm,[status(thm)],[30,24,theory(equality)])).
% cnf(101,plain,(join(top,X2)=join(X1,join(complement(X1),X2))),inference(spm,[status(thm)],[24,30,theory(equality)])).
% cnf(221,plain,(converse(top)=join(X1,converse(complement(converse(X1))))),inference(spm,[status(thm)],[50,30,theory(equality)])).
% cnf(246,plain,(complement(top)=zero),inference(rw,[status(thm)],[44,30,theory(equality)])).
% cnf(306,plain,(join(X1,top)=join(top,complement(complement(X1)))),inference(spm,[status(thm)],[101,30,theory(equality)])).
% cnf(715,plain,(join(complement(X2),composition(converse(X1),complement(composition(X1,X2))))=complement(X2)),inference(rw,[status(thm)],[38,22,theory(equality)])).
% cnf(723,plain,(join(complement(X1),composition(converse(one),complement(X1)))=complement(X1)),inference(spm,[status(thm)],[715,78,theory(equality)])).
% cnf(737,plain,(join(zero,composition(converse(X1),complement(composition(X1,top))))=zero),inference(spm,[status(thm)],[715,246,theory(equality)])).
% cnf(742,plain,(join(complement(X1),complement(X1))=complement(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[723,67,theory(equality)]),78,theory(equality)])).
% cnf(749,plain,(join(complement(X1),join(complement(X1),complement(complement(X1))))=top),inference(spm,[status(thm)],[96,742,theory(equality)])).
% cnf(758,plain,(join(zero,zero)=zero),inference(spm,[status(thm)],[742,246,theory(equality)])).
% cnf(761,plain,(join(complement(X1),top)=top),inference(rw,[status(thm)],[749,30,theory(equality)])).
% cnf(771,plain,(join(zero,X1)=join(zero,join(zero,X1))),inference(spm,[status(thm)],[24,758,theory(equality)])).
% cnf(782,plain,(join(top,complement(X1))=top),inference(rw,[status(thm)],[761,22,theory(equality)])).
% cnf(793,plain,(top=join(X1,top)),inference(rw,[status(thm)],[306,782,theory(equality)])).
% cnf(804,plain,(top=join(top,X1)),inference(spm,[status(thm)],[22,793,theory(equality)])).
% cnf(827,plain,(top=converse(top)),inference(spm,[status(thm)],[221,804,theory(equality)])).
% cnf(977,plain,(join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2))))=X1),inference(rw,[status(thm)],[26,22,theory(equality)])).
% cnf(989,plain,(join(complement(join(complement(X1),complement(X1))),complement(top))=X1),inference(spm,[status(thm)],[977,30,theory(equality)])).
% cnf(1003,plain,(join(complement(complement(X1)),zero)=X1),inference(rw,[status(thm)],[inference(rw,[status(thm)],[989,742,theory(equality)]),246,theory(equality)])).
% cnf(1010,plain,(join(zero,complement(complement(X1)))=X1),inference(rw,[status(thm)],[1003,22,theory(equality)])).
% cnf(1041,plain,(join(zero,X1)=X1),inference(spm,[status(thm)],[771,1010,theory(equality)])).
% cnf(1067,plain,(X1=join(X1,zero)),inference(spm,[status(thm)],[22,1041,theory(equality)])).
% cnf(10988,plain,(composition(converse(X1),complement(composition(X1,top)))=zero),inference(rw,[status(thm)],[737,1041,theory(equality)])).
% cnf(11003,plain,(composition(top,complement(composition(top,top)))=zero),inference(spm,[status(thm)],[10988,827,theory(equality)])).
% cnf(11081,plain,(join(zero,composition(X1,complement(composition(top,top))))=composition(join(top,X1),complement(composition(top,top)))),inference(spm,[status(thm)],[20,11003,theory(equality)])).
% cnf(11085,plain,(composition(X1,complement(composition(top,top)))=composition(join(top,X1),complement(composition(top,top)))),inference(rw,[status(thm)],[11081,1041,theory(equality)])).
% cnf(11086,plain,(composition(X1,complement(composition(top,top)))=zero),inference(rw,[status(thm)],[inference(rw,[status(thm)],[11085,804,theory(equality)]),11003,theory(equality)])).
% cnf(11093,plain,(zero=complement(composition(top,top))),inference(spm,[status(thm)],[78,11086,theory(equality)])).
% cnf(11246,plain,(join(composition(top,top),zero)=top),inference(spm,[status(thm)],[30,11093,theory(equality)])).
% cnf(11269,plain,(composition(top,top)=top),inference(rw,[status(thm)],[11246,1067,theory(equality)])).
% cnf(11270,plain,($false),inference(sr,[status(thm)],[11269,43,theory(equality)])).
% cnf(11271,plain,($false),11270,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 563
% # ...of these trivial : 283
% # ...subsumed : 124
% # ...remaining for further processing: 156
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 55
% # Generated clauses : 5979
% # ...of the previous two non-trivial : 3574
% # Contextual simplify-reflections : 0
% # Paramodulations : 5979
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 101
% # Positive orientable unit clauses: 96
% # Positive unorientable unit clauses: 4
% # Negative unit clauses : 1
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 2144
% # ...number of literals in the above : 2144
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 18
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 354
% # Indexed BW rewrite successes : 164
% # Backwards rewriting index: 162 leaves, 1.49+/-1.112 terms/leaf
% # Paramod-from index: 71 leaves, 1.44+/-1.017 terms/leaf
% # Paramod-into index: 134 leaves, 1.51+/-1.056 terms/leaf
% # -------------------------------------------------
% # User time : 0.123 s
% # System time : 0.015 s
% # Total time : 0.138 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.34 CPU 0.44 WC
% FINAL PrfWatch: 0.34 CPU 0.44 WC
% SZS output end Solution for /tmp/SystemOnTPTP1835/REL015+1.tptp
%
%------------------------------------------------------------------------------