TSTP Solution File: GRP748+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GRP748+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 : art02.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:45 EST 2010
% Result : Theorem 0.93s
% Output : Solution 0.93s
% 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/SystemOnTPTP3005/GRP748+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP3005/GRP748+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP3005/GRP748+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 3101
% 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]: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(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,![X1]:![X2]:mult(mult(X2,X1),i(X1))=X2,file('/tmp/SRASS.s.p', f08)).
% fof(9, axiom,![X2]:mult(X2,i(X2))=unit,file('/tmp/SRASS.s.p', f09)).
% fof(10, axiom,![X2]:mult(i(X2),X2)=unit,file('/tmp/SRASS.s.p', f10)).
% fof(11, axiom,![X1]:![X2]:(mult(X2,X1)=mult(X1,X2)|mult(i(X2),mult(X2,X1))=X1),file('/tmp/SRASS.s.p', f11)).
% fof(12, 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(13, 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)],[12])).
% fof(14, plain,![X3]:![X4]:mult(X4,ld(X4,X3))=X3,inference(variable_rename,[status(thm)],[1])).
% cnf(15,plain,(mult(X1,ld(X1,X2))=X2),inference(split_conjunct,[status(thm)],[14])).
% fof(16, plain,![X3]:![X4]:ld(X4,mult(X4,X3))=X3,inference(variable_rename,[status(thm)],[2])).
% cnf(17,plain,(ld(X1,mult(X1,X2))=X2),inference(split_conjunct,[status(thm)],[16])).
% fof(22, plain,![X3]:mult(X3,unit)=X3,inference(variable_rename,[status(thm)],[5])).
% cnf(23,plain,(mult(X1,unit)=X1),inference(split_conjunct,[status(thm)],[22])).
% fof(24, plain,![X3]:mult(unit,X3)=X3,inference(variable_rename,[status(thm)],[6])).
% cnf(25,plain,(mult(unit,X1)=X1),inference(split_conjunct,[status(thm)],[24])).
% fof(26, 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(27,plain,(mult(mult(mult(X1,X2),X3),X2)=mult(X1,mult(mult(X2,X3),X2))),inference(split_conjunct,[status(thm)],[26])).
% fof(28, plain,![X3]:![X4]:mult(mult(X4,X3),i(X3))=X4,inference(variable_rename,[status(thm)],[8])).
% cnf(29,plain,(mult(mult(X1,X2),i(X2))=X1),inference(split_conjunct,[status(thm)],[28])).
% fof(30, plain,![X3]:mult(X3,i(X3))=unit,inference(variable_rename,[status(thm)],[9])).
% cnf(31,plain,(mult(X1,i(X1))=unit),inference(split_conjunct,[status(thm)],[30])).
% fof(32, plain,![X3]:mult(i(X3),X3)=unit,inference(variable_rename,[status(thm)],[10])).
% cnf(33,plain,(mult(i(X1),X1)=unit),inference(split_conjunct,[status(thm)],[32])).
% fof(34, plain,![X3]:![X4]:(mult(X4,X3)=mult(X3,X4)|mult(i(X4),mult(X4,X3))=X3),inference(variable_rename,[status(thm)],[11])).
% cnf(35,plain,(mult(i(X1),mult(X1,X2))=X2|mult(X1,X2)=mult(X2,X1)),inference(split_conjunct,[status(thm)],[34])).
% fof(36, 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)],[13])).
% fof(37, 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)],[36])).
% fof(38, 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)],[37])).
% cnf(41,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)],[38])).
% cnf(63,plain,(mult(unit,i(i(X1)))=X1),inference(spm,[status(thm)],[29,31,theory(equality)])).
% cnf(68,plain,(i(i(X1))=X1),inference(rw,[status(thm)],[63,25,theory(equality)])).
% cnf(69,plain,(ld(i(X1),X2)=mult(X1,X2)|mult(X1,X2)=mult(X2,X1)),inference(spm,[status(thm)],[17,35,theory(equality)])).
% cnf(79,plain,(mult(i(X1),X2)=ld(X1,X2)|X2=mult(ld(X1,X2),X1)),inference(spm,[status(thm)],[35,15,theory(equality)])).
% cnf(96,plain,(mult(mult(unit,X2),X1)=mult(i(X1),mult(mult(X1,X2),X1))),inference(spm,[status(thm)],[27,33,theory(equality)])).
% cnf(104,plain,(mult(mult(X1,X2),X2)=mult(X1,mult(mult(X2,unit),X2))),inference(spm,[status(thm)],[27,23,theory(equality)])).
% cnf(107,negated_conjecture,(mult(esk4_0,mult(mult(esk6_0,esk5_0),esk6_0))!=mult(esk4_0,mult(esk6_0,mult(esk5_0,esk6_0)))),inference(rw,[status(thm)],[41,27,theory(equality)])).
% cnf(111,plain,(mult(X2,X1)=mult(i(X1),mult(mult(X1,X2),X1))),inference(rw,[status(thm)],[96,25,theory(equality)])).
% cnf(117,plain,(mult(mult(X1,X2),X2)=mult(X1,mult(X2,X2))),inference(rw,[status(thm)],[104,23,theory(equality)])).
% cnf(655,plain,(ld(i(X1),mult(X2,X1))=mult(mult(X1,X2),X1)),inference(spm,[status(thm)],[17,111,theory(equality)])).
% cnf(679,plain,(mult(i(X1),mult(X2,X1))=mult(ld(X1,X2),X1)),inference(spm,[status(thm)],[111,15,theory(equality)])).
% cnf(1667,plain,(ld(X1,X2)=mult(i(X1),X2)|mult(i(X1),mult(X2,X1))=X2),inference(rw,[status(thm)],[79,679,theory(equality)])).
% cnf(1698,plain,(mult(i(i(X1)),X2)=mult(X2,X1)|ld(i(X1),mult(X2,X1))=mult(i(i(X1)),mult(X2,X1))),inference(spm,[status(thm)],[1667,29,theory(equality)])).
% cnf(1750,plain,(mult(X1,X2)=mult(X2,X1)|ld(i(X1),mult(X2,X1))=mult(i(i(X1)),mult(X2,X1))),inference(rw,[status(thm)],[1698,68,theory(equality)])).
% cnf(1751,plain,(mult(X1,X2)=mult(X2,X1)|mult(mult(X1,X2),X1)=mult(i(i(X1)),mult(X2,X1))),inference(rw,[status(thm)],[1750,655,theory(equality)])).
% cnf(1752,plain,(mult(X1,X2)=mult(X2,X1)|mult(mult(X1,X2),X1)=mult(X1,mult(X2,X1))),inference(rw,[status(thm)],[1751,68,theory(equality)])).
% cnf(1799,negated_conjecture,(mult(esk6_0,esk5_0)=mult(esk5_0,esk6_0)),inference(spm,[status(thm)],[107,1752,theory(equality)])).
% cnf(1918,negated_conjecture,(mult(mult(esk6_0,esk5_0),esk6_0)=mult(esk5_0,mult(esk6_0,esk6_0))),inference(spm,[status(thm)],[117,1799,theory(equality)])).
% cnf(1920,negated_conjecture,(ld(i(esk6_0),mult(esk6_0,esk5_0))=mult(mult(esk6_0,esk5_0),esk6_0)),inference(spm,[status(thm)],[655,1799,theory(equality)])).
% cnf(1922,negated_conjecture,(mult(esk4_0,mult(mult(esk6_0,esk5_0),esk6_0))!=mult(esk4_0,mult(esk6_0,mult(esk6_0,esk5_0)))),inference(rw,[status(thm)],[107,1799,theory(equality)])).
% cnf(2006,negated_conjecture,(mult(esk4_0,mult(esk5_0,mult(esk6_0,esk6_0)))!=mult(esk4_0,mult(esk6_0,mult(esk6_0,esk5_0)))),inference(rw,[status(thm)],[1922,1918,theory(equality)])).
% cnf(2452,negated_conjecture,(ld(i(esk6_0),mult(esk6_0,esk5_0))=mult(esk5_0,mult(esk6_0,esk6_0))),inference(rw,[status(thm)],[1920,1918,theory(equality)])).
% cnf(2461,negated_conjecture,(mult(esk5_0,mult(esk6_0,esk6_0))=mult(esk6_0,mult(esk6_0,esk5_0))|mult(esk6_0,mult(esk6_0,esk5_0))=mult(mult(esk6_0,esk5_0),esk6_0)),inference(spm,[status(thm)],[69,2452,theory(equality)])).
% cnf(2467,negated_conjecture,(mult(esk5_0,mult(esk6_0,esk6_0))=mult(esk6_0,mult(esk6_0,esk5_0))|mult(esk6_0,mult(esk6_0,esk5_0))=mult(esk5_0,mult(esk6_0,esk6_0))),inference(rw,[status(thm)],[2461,1918,theory(equality)])).
% cnf(2468,negated_conjecture,(mult(esk5_0,mult(esk6_0,esk6_0))=mult(esk6_0,mult(esk6_0,esk5_0))),inference(cn,[status(thm)],[2467,theory(equality)])).
% cnf(2494,negated_conjecture,($false),inference(rw,[status(thm)],[2006,2468,theory(equality)])).
% cnf(2495,negated_conjecture,($false),inference(cn,[status(thm)],[2494,theory(equality)])).
% cnf(2496,negated_conjecture,($false),2495,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 116
% # ...of these trivial : 34
% # ...subsumed : 4
% # ...remaining for further processing: 78
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 18
% # Generated clauses : 1350
% # ...of the previous two non-trivial : 897
% # Contextual simplify-reflections : 0
% # Paramodulations : 1350
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 60
% # Positive orientable unit clauses: 49
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 8
% # Current number of unprocessed clauses: 670
% # ...number of literals in the above : 932
% # Clause-clause subsumption calls (NU) : 12
% # Rec. Clause-clause subsumption calls : 12
% # Unit Clause-clause subsumption calls : 66
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 48
% # Indexed BW rewrite successes : 14
% # Backwards rewriting index: 95 leaves, 1.29+/-0.819 terms/leaf
% # Paramod-from index: 47 leaves, 1.21+/-0.543 terms/leaf
% # Paramod-into index: 84 leaves, 1.30+/-0.813 terms/leaf
% # -------------------------------------------------
% # User time : 0.033 s
% # System time : 0.006 s
% # Total time : 0.039 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.14 CPU 0.23 WC
% FINAL PrfWatch: 0.14 CPU 0.23 WC
% SZS output end Solution for /tmp/SystemOnTPTP3005/GRP748+1.tptp
%
%------------------------------------------------------------------------------