TSTP Solution File: GRP747+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GRP747+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 : art09.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 07:22:41 EST 2010
% Result : Theorem 2.97s
% Output : Solution 2.97s
% 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/SystemOnTPTP23562/GRP747+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP23562/GRP747+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP23562/GRP747+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 23658
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 1.92 CPU 2.01 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:mult(X2,ld(X2,X1))=X1,file('/tmp/SRASS.s.p', f01)).
% fof(2, axiom,![X1]:![X2]:ld(X2,mult(X2,X1))=X1,file('/tmp/SRASS.s.p', f02)).
% fof(3, axiom,![X1]:![X2]:mult(rd(X2,X1),X1)=X2,file('/tmp/SRASS.s.p', f03)).
% fof(4, axiom,![X1]:![X2]:rd(mult(X2,X1),X1)=X2,file('/tmp/SRASS.s.p', f04)).
% fof(5, axiom,![X2]:mult(X2,unit)=X2,file('/tmp/SRASS.s.p', f05)).
% fof(6, axiom,![X2]:mult(unit,X2)=X2,file('/tmp/SRASS.s.p', f06)).
% fof(7, axiom,![X3]:![X1]:![X2]:mult(mult(mult(X2,X1),X3),X1)=mult(X2,mult(mult(X1,X3),X1)),file('/tmp/SRASS.s.p', f07)).
% fof(8, axiom,![X4]:![X5]:![X6]:((mult(mult(X4,X5),X6)=mult(X4,mult(X6,X5))&mult(mult(X4,X6),X5)=mult(X4,mult(X5,X6)))|(mult(mult(X4,X5),X6)=mult(mult(X4,X6),X5)&mult(X4,mult(X5,X6))=mult(X4,mult(X6,X5)))),file('/tmp/SRASS.s.p', f08)).
% fof(9, conjecture,mult(mult(a,b),c)=mult(a,mult(b,c)),file('/tmp/SRASS.s.p', goals)).
% fof(10, negated_conjecture,~(mult(mult(a,b),c)=mult(a,mult(b,c))),inference(assume_negation,[status(cth)],[9])).
% fof(11, negated_conjecture,~(mult(mult(a,b),c)=mult(a,mult(b,c))),inference(fof_simplification,[status(thm)],[10,theory(equality)])).
% fof(12, plain,![X3]:![X4]:mult(X4,ld(X4,X3))=X3,inference(variable_rename,[status(thm)],[1])).
% cnf(13,plain,(mult(X1,ld(X1,X2))=X2),inference(split_conjunct,[status(thm)],[12])).
% fof(14, plain,![X3]:![X4]:ld(X4,mult(X4,X3))=X3,inference(variable_rename,[status(thm)],[2])).
% cnf(15,plain,(ld(X1,mult(X1,X2))=X2),inference(split_conjunct,[status(thm)],[14])).
% fof(16, plain,![X3]:![X4]:mult(rd(X4,X3),X3)=X4,inference(variable_rename,[status(thm)],[3])).
% cnf(17,plain,(mult(rd(X1,X2),X2)=X1),inference(split_conjunct,[status(thm)],[16])).
% fof(18, plain,![X3]:![X4]:rd(mult(X4,X3),X3)=X4,inference(variable_rename,[status(thm)],[4])).
% cnf(19,plain,(rd(mult(X1,X2),X2)=X1),inference(split_conjunct,[status(thm)],[18])).
% fof(20, plain,![X3]:mult(X3,unit)=X3,inference(variable_rename,[status(thm)],[5])).
% cnf(21,plain,(mult(X1,unit)=X1),inference(split_conjunct,[status(thm)],[20])).
% fof(22, plain,![X3]:mult(unit,X3)=X3,inference(variable_rename,[status(thm)],[6])).
% cnf(23,plain,(mult(unit,X1)=X1),inference(split_conjunct,[status(thm)],[22])).
% fof(24, plain,![X4]:![X5]:![X6]:mult(mult(mult(X6,X5),X4),X5)=mult(X6,mult(mult(X5,X4),X5)),inference(variable_rename,[status(thm)],[7])).
% cnf(25,plain,(mult(mult(mult(X1,X2),X3),X2)=mult(X1,mult(mult(X2,X3),X2))),inference(split_conjunct,[status(thm)],[24])).
% fof(26, plain,![X7]:![X8]:![X9]:((mult(mult(X7,X8),X9)=mult(X7,mult(X9,X8))&mult(mult(X7,X9),X8)=mult(X7,mult(X8,X9)))|(mult(mult(X7,X8),X9)=mult(mult(X7,X9),X8)&mult(X7,mult(X8,X9))=mult(X7,mult(X9,X8)))),inference(variable_rename,[status(thm)],[8])).
% fof(27, plain,![X7]:![X8]:![X9]:(((mult(mult(X7,X8),X9)=mult(mult(X7,X9),X8)|mult(mult(X7,X8),X9)=mult(X7,mult(X9,X8)))&(mult(X7,mult(X8,X9))=mult(X7,mult(X9,X8))|mult(mult(X7,X8),X9)=mult(X7,mult(X9,X8))))&((mult(mult(X7,X8),X9)=mult(mult(X7,X9),X8)|mult(mult(X7,X9),X8)=mult(X7,mult(X8,X9)))&(mult(X7,mult(X8,X9))=mult(X7,mult(X9,X8))|mult(mult(X7,X9),X8)=mult(X7,mult(X8,X9))))),inference(distribute,[status(thm)],[26])).
% cnf(28,plain,(mult(mult(X1,X2),X3)=mult(X1,mult(X3,X2))|mult(X1,mult(X3,X2))=mult(X1,mult(X2,X3))),inference(split_conjunct,[status(thm)],[27])).
% cnf(29,plain,(mult(mult(X1,X2),X3)=mult(X1,mult(X3,X2))|mult(mult(X1,X3),X2)=mult(mult(X1,X2),X3)),inference(split_conjunct,[status(thm)],[27])).
% cnf(32,negated_conjecture,(mult(mult(a,b),c)!=mult(a,mult(b,c))),inference(split_conjunct,[status(thm)],[11])).
% cnf(34,plain,(ld(X1,X1)=unit),inference(spm,[status(thm)],[15,21,theory(equality)])).
% cnf(40,plain,(rd(X2,ld(X1,X2))=X1),inference(spm,[status(thm)],[19,13,theory(equality)])).
% cnf(67,plain,(mult(X1,X2)=mult(unit,mult(X2,X1))|mult(unit,mult(X1,X2))=mult(unit,mult(X2,X1))),inference(spm,[status(thm)],[28,23,theory(equality)])).
% cnf(76,plain,(mult(X1,X2)=mult(X2,X1)|mult(unit,mult(X1,X2))=mult(unit,mult(X2,X1))),inference(rw,[status(thm)],[67,23,theory(equality)])).
% cnf(77,plain,(mult(X1,X2)=mult(X2,X1)|mult(X1,X2)=mult(unit,mult(X2,X1))),inference(rw,[status(thm)],[76,23,theory(equality)])).
% cnf(78,plain,(mult(X1,X2)=mult(X2,X1)|mult(X1,X2)=mult(X2,X1)),inference(rw,[status(thm)],[77,23,theory(equality)])).
% cnf(79,plain,(mult(X1,X2)=mult(X2,X1)),inference(cn,[status(thm)],[78,theory(equality)])).
% cnf(84,plain,(mult(mult(X4,X5),X6)=mult(X4,mult(X6,X5))|mult(mult(X4,X6),X5)!=mult(X4,mult(X6,X5))),inference(ef,[status(thm)],[29,theory(equality)])).
% cnf(146,plain,(mult(X3,mult(X1,X2))=mult(mult(X1,X3),X2)|mult(X3,mult(X1,X2))=mult(X1,mult(X3,X2))),inference(spm,[status(thm)],[29,79,theory(equality)])).
% cnf(149,plain,(ld(X1,mult(X2,X1))=X2),inference(spm,[status(thm)],[15,79,theory(equality)])).
% cnf(161,plain,(mult(X2,mult(mult(X1,X2),X3))=mult(X1,mult(mult(X2,X3),X2))),inference(rw,[status(thm)],[25,79,theory(equality)])).
% cnf(162,plain,(mult(X2,mult(mult(X1,X2),X3))=mult(X1,mult(X2,mult(X2,X3)))),inference(rw,[status(thm)],[161,79,theory(equality)])).
% cnf(163,negated_conjecture,(mult(c,mult(a,b))!=mult(a,mult(b,c))),inference(rw,[status(thm)],[32,79,theory(equality)])).
% cnf(164,plain,(mult(X2,rd(X1,X2))=X1),inference(rw,[status(thm)],[17,79,theory(equality)])).
% cnf(170,plain,(ld(X1,X2)=rd(X2,X1)),inference(spm,[status(thm)],[15,164,theory(equality)])).
% cnf(184,plain,(mult(X2,mult(mult(X1,X2),X3))=mult(mult(X2,mult(X2,X3)),X1)),inference(spm,[status(thm)],[79,162,theory(equality)])).
% cnf(191,plain,(ld(X1,mult(X2,mult(X1,mult(X1,X3))))=mult(mult(X2,X1),X3)),inference(spm,[status(thm)],[15,162,theory(equality)])).
% cnf(200,plain,(mult(X1,mult(mult(X2,X1),unit))=mult(X2,mult(X1,X1))),inference(spm,[status(thm)],[162,21,theory(equality)])).
% cnf(226,plain,(mult(X1,mult(X2,X1))=mult(X2,mult(X1,X1))),inference(rw,[status(thm)],[200,21,theory(equality)])).
% cnf(258,plain,(mult(mult(X1,X2),X3)=mult(X1,mult(X3,X2))|mult(mult(X3,X1),X2)!=mult(X1,mult(X3,X2))),inference(spm,[status(thm)],[84,79,theory(equality)])).
% cnf(320,plain,(ld(ld(X2,X1),X1)=X2),inference(rw,[status(thm)],[40,170,theory(equality)])).
% cnf(343,plain,(ld(X1,mult(X2,mult(X1,X2)))=mult(X2,X2)),inference(spm,[status(thm)],[15,226,theory(equality)])).
% cnf(358,plain,(ld(X1,mult(X2,mult(X1,X1)))=mult(X2,X1)),inference(spm,[status(thm)],[15,226,theory(equality)])).
% cnf(380,plain,(mult(X1,mult(X1,X2))=mult(X2,mult(X1,X1))),inference(spm,[status(thm)],[226,79,theory(equality)])).
% cnf(473,plain,(ld(X1,mult(X1,mult(mult(mult(X1,X2),X1),X2)))=mult(mult(X1,X2),mult(X1,X2))),inference(spm,[status(thm)],[343,162,theory(equality)])).
% cnf(485,plain,(mult(mult(X1,mult(X1,X2)),X2)=mult(mult(X1,X2),mult(X1,X2))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[473,79,theory(equality)]),15,theory(equality)])).
% cnf(4901,plain,(mult(X1,mult(X2,mult(X2,X1)))=mult(mult(X1,X2),mult(X1,X2))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[485,184,theory(equality)]),79,theory(equality)])).
% cnf(5016,plain,(mult(X2,X2)=mult(X1,mult(ld(X1,X2),mult(ld(X1,X2),X1)))),inference(spm,[status(thm)],[4901,13,theory(equality)])).
% cnf(5152,plain,(mult(X2,X2)=mult(X1,mult(ld(X1,X2),X2))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[5016,79,theory(equality)]),13,theory(equality)])).
% cnf(5199,plain,(mult(X1,mult(X2,ld(X1,X2)))=mult(X2,X2)),inference(rw,[status(thm)],[5152,79,theory(equality)])).
% cnf(5217,plain,(ld(X1,mult(X2,X2))=mult(X2,ld(X1,X2))),inference(spm,[status(thm)],[15,5199,theory(equality)])).
% cnf(5282,plain,(mult(ld(X1,X2),mult(X2,X1))=mult(X2,X2)),inference(spm,[status(thm)],[5199,320,theory(equality)])).
% cnf(5412,plain,(mult(mult(X2,X1),ld(X1,X2))=mult(X2,X2)),inference(rw,[status(thm)],[5282,79,theory(equality)])).
% cnf(5413,plain,(ld(mult(X1,X2),mult(X1,X1))=ld(X2,X1)),inference(spm,[status(thm)],[15,5412,theory(equality)])).
% cnf(6183,plain,(mult(X1,ld(mult(X1,X2),X1))=ld(X2,X1)),inference(rw,[status(thm)],[5413,5217,theory(equality)])).
% cnf(6201,plain,(ld(X1,ld(X2,X1))=ld(mult(X1,X2),X1)),inference(spm,[status(thm)],[15,6183,theory(equality)])).
% cnf(6240,plain,(ld(ld(mult(X1,X2),X1),ld(X2,X1))=X1),inference(spm,[status(thm)],[149,6183,theory(equality)])).
% cnf(6289,plain,(mult(X1,ld(X2,X1))=ld(ld(X1,X2),X1)),inference(spm,[status(thm)],[6183,13,theory(equality)])).
% cnf(6687,plain,(ld(X1,X2)=ld(mult(X1,ld(X2,X1)),X1)),inference(spm,[status(thm)],[6201,320,theory(equality)])).
% cnf(6725,plain,(mult(ld(X1,X2),mult(X1,ld(X2,X1)))=X1),inference(spm,[status(thm)],[13,6289,theory(equality)])).
% cnf(13758,plain,(ld(X1,mult(X2,mult(X1,X3)))=mult(mult(X2,X1),ld(X1,X3))),inference(spm,[status(thm)],[191,13,theory(equality)])).
% cnf(24110,plain,(ld(X1,X1)=mult(mult(ld(X1,X2),X1),ld(X1,ld(X2,X1)))),inference(spm,[status(thm)],[13758,6725,theory(equality)])).
% cnf(24186,plain,(unit=mult(mult(ld(X1,X2),X1),ld(X1,ld(X2,X1)))),inference(rw,[status(thm)],[24110,34,theory(equality)])).
% cnf(24187,plain,(unit=mult(X2,ld(mult(X1,X2),X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[24186,79,theory(equality)]),13,theory(equality)]),6201,theory(equality)])).
% cnf(24261,plain,(ld(X1,unit)=ld(mult(X2,X1),X2)),inference(spm,[status(thm)],[15,24187,theory(equality)])).
% cnf(27098,plain,(ld(mult(X2,mult(X1,X1)),X1)=ld(mult(X1,X2),unit)),inference(spm,[status(thm)],[24261,380,theory(equality)])).
% cnf(27109,plain,(ld(ld(X2,unit),ld(X2,X1))=X1),inference(rw,[status(thm)],[6240,24261,theory(equality)])).
% cnf(27113,plain,(ld(ld(X2,X1),unit)=ld(X1,X2)),inference(rw,[status(thm)],[6687,24261,theory(equality)])).
% cnf(27152,plain,(mult(ld(X1,unit),X2)=ld(X1,X2)),inference(spm,[status(thm)],[13,27109,theory(equality)])).
% cnf(28482,plain,(mult(ld(X2,X1),X3)=ld(ld(X1,X2),X3)),inference(spm,[status(thm)],[27152,27113,theory(equality)])).
% cnf(33057,plain,(mult(ld(X2,X1),mult(X3,ld(X1,X2)))=X3),inference(spm,[status(thm)],[149,28482,theory(equality)])).
% cnf(39593,plain,(mult(ld(mult(X2,X1),unit),mult(X3,ld(X2,mult(X1,mult(X2,X2)))))=X3),inference(spm,[status(thm)],[33057,27098,theory(equality)])).
% cnf(39714,plain,(ld(mult(X2,X1),mult(X3,mult(X1,X2)))=X3),inference(rw,[status(thm)],[inference(rw,[status(thm)],[39593,358,theory(equality)]),27152,theory(equality)])).
% cnf(40672,plain,(mult(mult(X1,X2),X3)=mult(X3,mult(X2,X1))),inference(spm,[status(thm)],[13,39714,theory(equality)])).
% cnf(44209,plain,(mult(mult(X1,X2),X3)=mult(X1,mult(X3,X2))|mult(X1,mult(X3,X2))=mult(X3,mult(X1,X2))),inference(spm,[status(thm)],[258,146,theory(equality)])).
% cnf(53297,plain,(mult(mult(X4,X6),X5)=mult(X4,mult(X5,X6))|mult(X5,mult(X4,X6))!=mult(mult(X4,X6),X5)),inference(ef,[status(thm)],[44209,theory(equality)])).
% cnf(54371,plain,(mult(mult(X4,X6),X5)=mult(X4,mult(X5,X6))),inference(ar,[status(thm)],[53297,79,theory(equality)])).
% cnf(54781,plain,(mult(X1,mult(X3,X2))=mult(X3,mult(X2,X1))),inference(rw,[status(thm)],[40672,54371,theory(equality)])).
% cnf(55522,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[163,54781,theory(equality)]),79,theory(equality)]),54781,theory(equality)]),79,theory(equality)])).
% cnf(55523,negated_conjecture,($false),inference(cn,[status(thm)],[55522,theory(equality)])).
% cnf(55524,negated_conjecture,($false),55523,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 596
% # ...of these trivial : 157
% # ...subsumed : 278
% # ...remaining for further processing: 161
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 10
% # Backward-rewritten : 108
% # Generated clauses : 33953
% # ...of the previous two non-trivial : 31821
% # Contextual simplify-reflections : 0
% # Paramodulations : 33919
% # Factorizations : 34
% # Equation resolutions : 0
% # Current number of processed clauses: 43
% # Positive orientable unit clauses: 37
% # Positive unorientable unit clauses: 4
% # Negative unit clauses : 0
% # Non-unit-clauses : 2
% # Current number of unprocessed clauses: 735
% # ...number of literals in the above : 864
% # Clause-clause subsumption calls (NU) : 783
% # Rec. Clause-clause subsumption calls : 651
% # Unit Clause-clause subsumption calls : 510
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1131
% # Indexed BW rewrite successes : 421
% # Backwards rewriting index: 31 leaves, 2.68+/-2.494 terms/leaf
% # Paramod-from index: 27 leaves, 1.70+/-1.048 terms/leaf
% # Paramod-into index: 30 leaves, 2.47+/-2.012 terms/leaf
% # -------------------------------------------------
% # User time : 1.230 s
% # System time : 0.046 s
% # Total time : 1.276 s
% # Maximum resident set size: 0 pages
% PrfWatch: 2.17 CPU 2.27 WC
% FINAL PrfWatch: 2.17 CPU 2.27 WC
% SZS output end Solution for /tmp/SystemOnTPTP23562/GRP747+1.tptp
%
%------------------------------------------------------------------------------