TSTP Solution File: GRP667+6 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GRP667+6 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art01.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:18:41 EST 2010
% Result : Theorem 8.71s
% Output : Solution 8.71s
% 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/SystemOnTPTP18099/GRP667+6.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP18099/GRP667+6.tptp
% SZS output start Solution for /tmp/SystemOnTPTP18099/GRP667+6.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 18195
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.93 CPU 2.03 WC
% PrfWatch: 3.52 CPU 4.04 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 5.14 CPU 6.04 WC
% PrfWatch: 7.13 CPU 8.05 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(X2,X1),mult(mult(X3,X1),X3))=mult(mult(X2,mult(mult(X1,X3),X1)),X3),file('/tmp/SRASS.s.p', f07)).
% fof(8, axiom,![X1]:![X2]:mult(mult(X2,X1),X2)=mult(X2,mult(X1,X2)),file('/tmp/SRASS.s.p', f08)).
% fof(9, axiom,![X2]:mult(f(X2),f(X2))=X2,file('/tmp/SRASS.s.p', f09)).
% fof(10, conjecture,(((![X4]:![X5]:![X6]:mult(X6,mult(X4,mult(X6,X5)))=mult(mult(mult(X6,X4),X6),X5)|![X7]:![X8]:![X9]:mult(X7,mult(X9,mult(X8,X9)))=mult(mult(mult(X7,X9),X8),X9))|![X10]:![X11]:![X12]:mult(mult(X12,X10),mult(X11,X12))=mult(mult(X12,mult(X10,X11)),X12))|![X13]:![X14]:![X15]:mult(mult(X15,X13),mult(X14,X15))=mult(X15,mult(mult(X13,X14),X15))),file('/tmp/SRASS.s.p', goals)).
% fof(11, negated_conjecture,~((((![X4]:![X5]:![X6]:mult(X6,mult(X4,mult(X6,X5)))=mult(mult(mult(X6,X4),X6),X5)|![X7]:![X8]:![X9]:mult(X7,mult(X9,mult(X8,X9)))=mult(mult(mult(X7,X9),X8),X9))|![X10]:![X11]:![X12]:mult(mult(X12,X10),mult(X11,X12))=mult(mult(X12,mult(X10,X11)),X12))|![X13]:![X14]:![X15]:mult(mult(X15,X13),mult(X14,X15))=mult(X15,mult(mult(X13,X14),X15)))),inference(assume_negation,[status(cth)],[10])).
% 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(X6,X5),mult(mult(X4,X5),X4))=mult(mult(X6,mult(mult(X5,X4),X5)),X4),inference(variable_rename,[status(thm)],[7])).
% cnf(25,plain,(mult(mult(X1,X2),mult(mult(X3,X2),X3))=mult(mult(X1,mult(mult(X2,X3),X2)),X3)),inference(split_conjunct,[status(thm)],[24])).
% fof(26, plain,![X3]:![X4]:mult(mult(X4,X3),X4)=mult(X4,mult(X3,X4)),inference(variable_rename,[status(thm)],[8])).
% cnf(27,plain,(mult(mult(X1,X2),X1)=mult(X1,mult(X2,X1))),inference(split_conjunct,[status(thm)],[26])).
% fof(28, plain,![X3]:mult(f(X3),f(X3))=X3,inference(variable_rename,[status(thm)],[9])).
% cnf(29,plain,(mult(f(X1),f(X1))=X1),inference(split_conjunct,[status(thm)],[28])).
% fof(30, negated_conjecture,(((?[X4]:?[X5]:?[X6]:~(mult(X6,mult(X4,mult(X6,X5)))=mult(mult(mult(X6,X4),X6),X5))&?[X7]:?[X8]:?[X9]:~(mult(X7,mult(X9,mult(X8,X9)))=mult(mult(mult(X7,X9),X8),X9)))&?[X10]:?[X11]:?[X12]:~(mult(mult(X12,X10),mult(X11,X12))=mult(mult(X12,mult(X10,X11)),X12)))&?[X13]:?[X14]:?[X15]:~(mult(mult(X15,X13),mult(X14,X15))=mult(X15,mult(mult(X13,X14),X15)))),inference(fof_nnf,[status(thm)],[11])).
% fof(31, negated_conjecture,(((?[X16]:?[X17]:?[X18]:~(mult(X18,mult(X16,mult(X18,X17)))=mult(mult(mult(X18,X16),X18),X17))&?[X19]:?[X20]:?[X21]:~(mult(X19,mult(X21,mult(X20,X21)))=mult(mult(mult(X19,X21),X20),X21)))&?[X22]:?[X23]:?[X24]:~(mult(mult(X24,X22),mult(X23,X24))=mult(mult(X24,mult(X22,X23)),X24)))&?[X25]:?[X26]:?[X27]:~(mult(mult(X27,X25),mult(X26,X27))=mult(X27,mult(mult(X25,X26),X27)))),inference(variable_rename,[status(thm)],[30])).
% fof(32, negated_conjecture,(((~(mult(esk3_0,mult(esk1_0,mult(esk3_0,esk2_0)))=mult(mult(mult(esk3_0,esk1_0),esk3_0),esk2_0))&~(mult(esk4_0,mult(esk6_0,mult(esk5_0,esk6_0)))=mult(mult(mult(esk4_0,esk6_0),esk5_0),esk6_0)))&~(mult(mult(esk9_0,esk7_0),mult(esk8_0,esk9_0))=mult(mult(esk9_0,mult(esk7_0,esk8_0)),esk9_0)))&~(mult(mult(esk12_0,esk10_0),mult(esk11_0,esk12_0))=mult(esk12_0,mult(mult(esk10_0,esk11_0),esk12_0)))),inference(skolemize,[status(esa)],[31])).
% cnf(35,negated_conjecture,(mult(esk4_0,mult(esk6_0,mult(esk5_0,esk6_0)))!=mult(mult(mult(esk4_0,esk6_0),esk5_0),esk6_0)),inference(split_conjunct,[status(thm)],[32])).
% cnf(49,plain,(ld(rd(X1,X2),X1)=X2),inference(spm,[status(thm)],[15,17,theory(equality)])).
% cnf(54,plain,(rd(X1,X1)=unit),inference(spm,[status(thm)],[19,23,theory(equality)])).
% cnf(56,plain,(rd(X2,ld(X1,X2))=X1),inference(spm,[status(thm)],[19,13,theory(equality)])).
% cnf(87,plain,(rd(mult(X1,mult(X2,X1)),X1)=mult(X1,X2)),inference(spm,[status(thm)],[19,27,theory(equality)])).
% cnf(91,plain,(mult(X1,rd(X1,X2))=mult(rd(X1,X2),mult(X2,rd(X1,X2)))),inference(spm,[status(thm)],[27,17,theory(equality)])).
% cnf(93,plain,(mult(X2,X1)=mult(X1,mult(ld(X1,X2),X1))),inference(spm,[status(thm)],[27,13,theory(equality)])).
% cnf(120,plain,(mult(mult(X1,mult(X2,mult(X3,X2))),X3)=mult(mult(X1,X2),mult(mult(X3,X2),X3))),inference(rw,[status(thm)],[25,27,theory(equality)])).
% cnf(121,plain,(mult(mult(X1,mult(X2,mult(X3,X2))),X3)=mult(mult(X1,X2),mult(X3,mult(X2,X3)))),inference(rw,[status(thm)],[120,27,theory(equality)])).
% cnf(122,plain,(mult(mult(X1,X2),mult(unit,mult(X2,unit)))=mult(X1,mult(X2,mult(unit,X2)))),inference(spm,[status(thm)],[21,121,theory(equality)])).
% cnf(125,plain,(rd(mult(mult(X1,X2),mult(X3,mult(X2,X3))),X3)=mult(X1,mult(X2,mult(X3,X2)))),inference(spm,[status(thm)],[19,121,theory(equality)])).
% cnf(132,plain,(mult(mult(X1,mult(X2,X3)),rd(X3,X2))=mult(mult(X1,X2),mult(rd(X3,X2),mult(X2,rd(X3,X2))))),inference(spm,[status(thm)],[121,17,theory(equality)])).
% cnf(138,plain,(mult(mult(X1,mult(X2,X1)),X2)=mult(mult(unit,X1),mult(X2,mult(X1,X2)))),inference(spm,[status(thm)],[121,23,theory(equality)])).
% cnf(141,plain,(mult(mult(X1,X2),X2)=mult(X1,mult(X2,mult(unit,X2)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[122,21,theory(equality)]),23,theory(equality)])).
% cnf(142,plain,(mult(mult(X1,X2),X2)=mult(X1,mult(X2,X2))),inference(rw,[status(thm)],[141,23,theory(equality)])).
% cnf(151,plain,(mult(mult(X1,mult(X2,X1)),X2)=mult(X1,mult(X2,mult(X1,X2)))),inference(rw,[status(thm)],[138,23,theory(equality)])).
% cnf(163,plain,(mult(X1,X2)=mult(rd(X1,X2),mult(X2,X2))),inference(spm,[status(thm)],[142,17,theory(equality)])).
% cnf(185,plain,(rd(mult(X1,X2),X1)=mult(X1,rd(X2,X1))),inference(spm,[status(thm)],[87,17,theory(equality)])).
% cnf(214,plain,(rd(X1,X1)=mult(X1,rd(unit,X1))),inference(spm,[status(thm)],[185,21,theory(equality)])).
% cnf(228,plain,(unit=mult(X1,rd(unit,X1))),inference(rw,[status(thm)],[214,54,theory(equality)])).
% cnf(230,plain,(ld(X1,unit)=rd(unit,X1)),inference(spm,[status(thm)],[15,228,theory(equality)])).
% cnf(252,plain,(mult(ld(X1,unit),X1)=unit),inference(spm,[status(thm)],[17,230,theory(equality)])).
% cnf(668,plain,(ld(X1,mult(X2,X1))=mult(ld(X1,X2),X1)),inference(spm,[status(thm)],[15,93,theory(equality)])).
% cnf(677,plain,(mult(mult(X1,mult(X3,X2)),ld(X2,X3))=mult(mult(X1,X2),mult(ld(X2,X3),mult(X2,ld(X2,X3))))),inference(spm,[status(thm)],[121,93,theory(equality)])).
% cnf(704,plain,(mult(mult(X1,mult(X3,X2)),ld(X2,X3))=mult(mult(X1,X2),mult(ld(X2,X3),X3))),inference(rw,[status(thm)],[677,13,theory(equality)])).
% cnf(740,plain,(ld(X1,X2)=mult(ld(X1,rd(X2,X1)),X1)),inference(spm,[status(thm)],[668,17,theory(equality)])).
% cnf(810,plain,(ld(rd(X1,X2),mult(X1,X2))=mult(X2,X2)),inference(spm,[status(thm)],[15,163,theory(equality)])).
% cnf(820,plain,(mult(rd(X1,f(X2)),X2)=mult(X1,f(X2))),inference(spm,[status(thm)],[163,29,theory(equality)])).
% cnf(4322,plain,(rd(mult(unit,mult(X2,mult(X1,X2))),X2)=mult(ld(X1,unit),mult(X1,mult(X2,X1)))),inference(spm,[status(thm)],[125,252,theory(equality)])).
% cnf(4384,plain,(mult(X2,X1)=mult(ld(X1,unit),mult(X1,mult(X2,X1)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[4322,23,theory(equality)]),185,theory(equality)]),19,theory(equality)])).
% cnf(4643,plain,(mult(mult(X1,rd(X1,X2)),X2)=mult(rd(X1,X2),mult(X2,mult(rd(X1,X2),X2)))),inference(spm,[status(thm)],[151,91,theory(equality)])).
% cnf(4695,plain,(mult(mult(X1,rd(X1,X2)),X2)=mult(rd(X1,X2),mult(X2,X1))),inference(rw,[status(thm)],[4643,17,theory(equality)])).
% cnf(10105,plain,(mult(mult(X1,X2),mult(X3,rd(X3,X2)))=mult(mult(X1,mult(X2,X3)),rd(X3,X2))),inference(rw,[status(thm)],[132,91,theory(equality)])).
% cnf(12613,plain,(mult(ld(X1,unit),mult(X1,ld(X1,X2)))=ld(X1,X2)),inference(spm,[status(thm)],[4384,740,theory(equality)])).
% cnf(12700,plain,(mult(ld(X1,unit),X2)=ld(X1,X2)),inference(rw,[status(thm)],[12613,13,theory(equality)])).
% cnf(12797,plain,(rd(ld(X1,X2),X2)=ld(X1,unit)),inference(spm,[status(thm)],[19,12700,theory(equality)])).
% cnf(12801,plain,(mult(ld(X1,X2),X2)=mult(ld(X1,unit),mult(X2,X2))),inference(spm,[status(thm)],[142,12700,theory(equality)])).
% cnf(12876,plain,(mult(X1,X2)=ld(rd(unit,X1),X2)),inference(spm,[status(thm)],[12700,49,theory(equality)])).
% cnf(12974,plain,(mult(ld(X1,X2),X2)=ld(X1,mult(X2,X2))),inference(rw,[status(thm)],[12801,12700,theory(equality)])).
% cnf(13068,plain,(mult(X1,X2)=ld(ld(X1,unit),X2)),inference(rw,[status(thm)],[12876,230,theory(equality)])).
% cnf(13085,plain,(mult(ld(X1,unit),X2)=mult(ld(X1,f(X2)),f(X2))),inference(spm,[status(thm)],[820,12797,theory(equality)])).
% cnf(13128,plain,(rd(X2,X1)=ld(rd(X1,X2),unit)),inference(spm,[status(thm)],[12797,49,theory(equality)])).
% cnf(13160,plain,(rd(X2,mult(X1,X2))=ld(X1,unit)),inference(spm,[status(thm)],[12797,15,theory(equality)])).
% cnf(13168,plain,(ld(X1,X2)=mult(ld(X1,f(X2)),f(X2))),inference(rw,[status(thm)],[13085,12700,theory(equality)])).
% cnf(13914,plain,(ld(rd(X2,X1),X3)=mult(rd(X1,X2),X3)),inference(spm,[status(thm)],[13068,13128,theory(equality)])).
% cnf(14055,plain,(rd(mult(X1,X1),mult(X2,X1))=ld(rd(X2,X1),unit)),inference(spm,[status(thm)],[13160,163,theory(equality)])).
% cnf(14137,plain,(rd(mult(X1,X1),mult(X2,X1))=rd(X1,X2)),inference(rw,[status(thm)],[14055,13128,theory(equality)])).
% cnf(14193,plain,(mult(X1,mult(ld(X1,X2),X2))=mult(X2,X2)),inference(spm,[status(thm)],[13,12974,theory(equality)])).
% cnf(14357,plain,(mult(rd(X2,X1),mult(X1,X2))=mult(X2,X2)),inference(rw,[status(thm)],[810,13914,theory(equality)])).
% cnf(16772,plain,(mult(mult(X2,X2),rd(X2,ld(X1,X2)))=mult(mult(X1,ld(X1,X2)),mult(X2,rd(X2,ld(X1,X2))))),inference(spm,[status(thm)],[10105,14193,theory(equality)])).
% cnf(16888,plain,(mult(mult(X2,X2),X1)=mult(mult(X1,ld(X1,X2)),mult(X2,rd(X2,ld(X1,X2))))),inference(rw,[status(thm)],[16772,56,theory(equality)])).
% cnf(16889,plain,(mult(mult(X2,X2),X1)=mult(X2,mult(X2,X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[16888,13,theory(equality)]),56,theory(equality)])).
% cnf(17082,plain,(mult(X1,X2)=mult(f(X1),mult(f(X1),X2))),inference(spm,[status(thm)],[16889,29,theory(equality)])).
% cnf(17532,plain,(mult(mult(X1,rd(X1,X2)),X2)=mult(X1,X1)),inference(rw,[status(thm)],[4695,14357,theory(equality)])).
% cnf(19224,plain,(rd(mult(X1,X1),X2)=mult(X1,rd(X1,X2))),inference(spm,[status(thm)],[19,17532,theory(equality)])).
% cnf(19459,plain,(mult(X1,ld(X2,unit))=rd(X1,X2)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[14137,19224,theory(equality)]),13160,theory(equality)])).
% cnf(19551,plain,(ld(X1,rd(X1,X2))=ld(X2,unit)),inference(spm,[status(thm)],[15,19459,theory(equality)])).
% cnf(19860,plain,(ld(mult(X1,X2),X1)=ld(X2,unit)),inference(spm,[status(thm)],[19551,19,theory(equality)])).
% cnf(77875,plain,(mult(mult(X1,mult(X2,X3)),ld(mult(f(X2),X3),f(X2)))=mult(mult(X1,mult(f(X2),X3)),mult(ld(mult(f(X2),X3),f(X2)),f(X2)))),inference(spm,[status(thm)],[704,17082,theory(equality)])).
% cnf(78215,plain,(rd(mult(X1,mult(X2,X3)),X3)=mult(mult(X1,mult(f(X2),X3)),mult(ld(mult(f(X2),X3),f(X2)),f(X2)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[77875,19860,theory(equality)]),19459,theory(equality)])).
% cnf(78216,plain,(rd(mult(X1,mult(X2,X3)),X3)=mult(mult(X1,X3),ld(X3,X2))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[78215,19860,theory(equality)]),12700,theory(equality)]),704,theory(equality)]),13168,theory(equality)])).
% cnf(84846,plain,(mult(mult(mult(X1,X3),ld(X3,X2)),X3)=mult(X1,mult(X2,X3))),inference(spm,[status(thm)],[17,78216,theory(equality)])).
% cnf(217580,plain,(mult(mult(mult(X1,X2),X3),X2)=mult(X1,mult(mult(X2,X3),X2))),inference(spm,[status(thm)],[84846,15,theory(equality)])).
% cnf(217982,plain,(mult(mult(mult(X1,X2),X3),X2)=mult(X1,mult(X2,mult(X3,X2)))),inference(rw,[status(thm)],[217580,27,theory(equality)])).
% cnf(221165,negated_conjecture,($false),inference(rw,[status(thm)],[35,217982,theory(equality)])).
% cnf(221166,negated_conjecture,($false),inference(cn,[status(thm)],[221165,theory(equality)])).
% cnf(221167,negated_conjecture,($false),221166,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1951
% # ...of these trivial : 972
% # ...subsumed : 307
% # ...remaining for further processing: 672
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 208
% # Generated clauses : 108733
% # ...of the previous two non-trivial : 88269
% # Contextual simplify-reflections : 0
% # Paramodulations : 108733
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 464
% # Positive orientable unit clauses: 458
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 3
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 69392
% # ...number of literals in the above : 69392
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 6
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1808
% # Indexed BW rewrite successes : 210
% # Backwards rewriting index: 382 leaves, 2.55+/-2.622 terms/leaf
% # Paramod-from index: 263 leaves, 1.76+/-1.278 terms/leaf
% # Paramod-into index: 336 leaves, 2.21+/-2.069 terms/leaf
% # -------------------------------------------------
% # User time : 4.105 s
% # System time : 0.161 s
% # Total time : 4.266 s
% # Maximum resident set size: 0 pages
% PrfWatch: 7.75 CPU 8.68 WC
% FINAL PrfWatch: 7.75 CPU 8.68 WC
% SZS output end Solution for /tmp/SystemOnTPTP18099/GRP667+6.tptp
%
%------------------------------------------------------------------------------