TSTP Solution File: GRP711+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GRP711+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:21:05 EST 2010
% Result : Theorem 0.92s
% Output : Solution 0.92s
% 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/SystemOnTPTP2076/GRP711+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP2076/GRP711+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP2076/GRP711+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 2244
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 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]:mult(X1,unit)=X1,file('/tmp/SRASS.s.p', f01)).
% fof(2, axiom,![X1]:mult(unit,X1)=X1,file('/tmp/SRASS.s.p', f02)).
% fof(3, axiom,![X2]:![X3]:![X1]:mult(X1,mult(X3,mult(X3,X2)))=mult(mult(mult(X1,X3),X3),X2),file('/tmp/SRASS.s.p', f03)).
% fof(4, axiom,![X1]:mult(X1,i(X1))=unit,file('/tmp/SRASS.s.p', f04)).
% fof(5, axiom,![X1]:mult(i(X1),X1)=unit,file('/tmp/SRASS.s.p', f05)).
% fof(6, conjecture,![X4]:![X5]:![X6]:((mult(X4,X5)=mult(X4,X6)=>X5=X6)&(mult(X5,X4)=mult(X6,X4)=>X5=X6)),file('/tmp/SRASS.s.p', goals)).
% fof(7, negated_conjecture,~(![X4]:![X5]:![X6]:((mult(X4,X5)=mult(X4,X6)=>X5=X6)&(mult(X5,X4)=mult(X6,X4)=>X5=X6))),inference(assume_negation,[status(cth)],[6])).
% fof(8, plain,![X2]:mult(X2,unit)=X2,inference(variable_rename,[status(thm)],[1])).
% cnf(9,plain,(mult(X1,unit)=X1),inference(split_conjunct,[status(thm)],[8])).
% fof(10, plain,![X2]:mult(unit,X2)=X2,inference(variable_rename,[status(thm)],[2])).
% cnf(11,plain,(mult(unit,X1)=X1),inference(split_conjunct,[status(thm)],[10])).
% fof(12, plain,![X4]:![X5]:![X6]:mult(X6,mult(X5,mult(X5,X4)))=mult(mult(mult(X6,X5),X5),X4),inference(variable_rename,[status(thm)],[3])).
% cnf(13,plain,(mult(X1,mult(X2,mult(X2,X3)))=mult(mult(mult(X1,X2),X2),X3)),inference(split_conjunct,[status(thm)],[12])).
% fof(14, plain,![X2]:mult(X2,i(X2))=unit,inference(variable_rename,[status(thm)],[4])).
% cnf(15,plain,(mult(X1,i(X1))=unit),inference(split_conjunct,[status(thm)],[14])).
% fof(16, plain,![X2]:mult(i(X2),X2)=unit,inference(variable_rename,[status(thm)],[5])).
% cnf(17,plain,(mult(i(X1),X1)=unit),inference(split_conjunct,[status(thm)],[16])).
% fof(18, negated_conjecture,?[X4]:?[X5]:?[X6]:((mult(X4,X5)=mult(X4,X6)&~(X5=X6))|(mult(X5,X4)=mult(X6,X4)&~(X5=X6))),inference(fof_nnf,[status(thm)],[7])).
% fof(19, negated_conjecture,?[X7]:?[X8]:?[X9]:((mult(X7,X8)=mult(X7,X9)&~(X8=X9))|(mult(X8,X7)=mult(X9,X7)&~(X8=X9))),inference(variable_rename,[status(thm)],[18])).
% fof(20, negated_conjecture,((mult(esk1_0,esk2_0)=mult(esk1_0,esk3_0)&~(esk2_0=esk3_0))|(mult(esk2_0,esk1_0)=mult(esk3_0,esk1_0)&~(esk2_0=esk3_0))),inference(skolemize,[status(esa)],[19])).
% fof(21, negated_conjecture,(((mult(esk2_0,esk1_0)=mult(esk3_0,esk1_0)|mult(esk1_0,esk2_0)=mult(esk1_0,esk3_0))&(~(esk2_0=esk3_0)|mult(esk1_0,esk2_0)=mult(esk1_0,esk3_0)))&((mult(esk2_0,esk1_0)=mult(esk3_0,esk1_0)|~(esk2_0=esk3_0))&(~(esk2_0=esk3_0)|~(esk2_0=esk3_0)))),inference(distribute,[status(thm)],[20])).
% cnf(22,negated_conjecture,(esk2_0!=esk3_0|esk2_0!=esk3_0),inference(split_conjunct,[status(thm)],[21])).
% cnf(25,negated_conjecture,(mult(esk1_0,esk2_0)=mult(esk1_0,esk3_0)|mult(esk2_0,esk1_0)=mult(esk3_0,esk1_0)),inference(split_conjunct,[status(thm)],[21])).
% cnf(29,plain,(mult(X1,mult(X2,mult(X2,unit)))=mult(mult(X1,X2),X2)),inference(spm,[status(thm)],[9,13,theory(equality)])).
% cnf(38,plain,(mult(X1,mult(X2,X2))=mult(mult(X1,X2),X2)),inference(rw,[status(thm)],[29,9,theory(equality)])).
% cnf(56,plain,(mult(unit,X1)=mult(i(X1),mult(X1,X1))),inference(spm,[status(thm)],[38,17,theory(equality)])).
% cnf(58,plain,(mult(unit,i(X1))=mult(X1,mult(i(X1),i(X1)))),inference(spm,[status(thm)],[38,15,theory(equality)])).
% cnf(60,plain,(mult(mult(X1,mult(X2,X2)),X3)=mult(X1,mult(X2,mult(X2,X3)))),inference(rw,[status(thm)],[13,38,theory(equality)])).
% cnf(64,plain,(X1=mult(i(X1),mult(X1,X1))),inference(rw,[status(thm)],[56,11,theory(equality)])).
% cnf(66,plain,(i(X1)=mult(X1,mult(i(X1),i(X1)))),inference(rw,[status(thm)],[58,11,theory(equality)])).
% cnf(72,plain,(mult(mult(X1,mult(X2,mult(X2,X3))),X3)=mult(mult(X1,mult(X2,X2)),mult(X3,X3))),inference(spm,[status(thm)],[38,60,theory(equality)])).
% cnf(77,plain,(mult(unit,X2)=mult(i(mult(X1,X1)),mult(X1,mult(X1,X2)))),inference(spm,[status(thm)],[60,17,theory(equality)])).
% cnf(79,plain,(mult(mult(X1,X1),X2)=mult(unit,mult(X1,mult(X1,X2)))),inference(spm,[status(thm)],[60,11,theory(equality)])).
% cnf(82,plain,(mult(mult(X1,mult(X2,mult(X2,X3))),X3)=mult(X1,mult(X2,mult(X2,mult(X3,X3))))),inference(rw,[status(thm)],[72,60,theory(equality)])).
% cnf(88,plain,(X2=mult(i(mult(X1,X1)),mult(X1,mult(X1,X2)))),inference(rw,[status(thm)],[77,11,theory(equality)])).
% cnf(91,plain,(mult(mult(X1,X1),X2)=mult(X1,mult(X1,X2))),inference(rw,[status(thm)],[79,11,theory(equality)])).
% cnf(93,plain,(mult(X1,X2)=mult(i(X1),mult(X1,mult(X1,X2)))),inference(spm,[status(thm)],[60,64,theory(equality)])).
% cnf(101,plain,(mult(X1,mult(X1,i(mult(X1,X1))))=unit),inference(spm,[status(thm)],[15,91,theory(equality)])).
% cnf(161,plain,(mult(i(i(X1)),mult(i(X1),X1))=X1),inference(spm,[status(thm)],[93,64,theory(equality)])).
% cnf(174,plain,(mult(i(X1),unit)=mult(X1,i(mult(X1,X1)))),inference(spm,[status(thm)],[93,101,theory(equality)])).
% cnf(176,plain,(i(i(X1))=X1),inference(rw,[status(thm)],[inference(rw,[status(thm)],[161,17,theory(equality)]),9,theory(equality)])).
% cnf(191,plain,(i(X1)=mult(X1,i(mult(X1,X1)))),inference(rw,[status(thm)],[174,9,theory(equality)])).
% cnf(295,plain,(mult(i(i(mult(X1,X1))),mult(i(mult(X1,X1)),X2))=X2),inference(spm,[status(thm)],[93,88,theory(equality)])).
% cnf(309,plain,(mult(i(mult(X1,X1)),mult(X1,i(X1)))=mult(i(X1),i(X1))),inference(spm,[status(thm)],[88,66,theory(equality)])).
% cnf(319,plain,(mult(X1,mult(X1,mult(i(mult(X1,X1)),X2)))=X2),inference(rw,[status(thm)],[inference(rw,[status(thm)],[295,176,theory(equality)]),91,theory(equality)])).
% cnf(327,plain,(i(mult(X1,X1))=mult(i(X1),i(X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[309,15,theory(equality)]),9,theory(equality)])).
% cnf(526,plain,(mult(i(X1),mult(X1,X2))=X2),inference(spm,[status(thm)],[93,319,theory(equality)])).
% cnf(1197,plain,(mult(mult(X1,mult(X2,unit)),i(X2))=mult(X1,mult(X2,mult(X2,mult(i(X2),i(X2)))))),inference(spm,[status(thm)],[82,15,theory(equality)])).
% cnf(1256,plain,(mult(mult(X1,X2),i(X2))=mult(X1,mult(X2,mult(X2,mult(i(X2),i(X2)))))),inference(rw,[status(thm)],[1197,9,theory(equality)])).
% cnf(1257,plain,(mult(mult(X1,X2),i(X2))=X1),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[1256,327,theory(equality)]),191,theory(equality)]),15,theory(equality)]),9,theory(equality)])).
% cnf(1349,negated_conjecture,(mult(mult(esk3_0,esk1_0),i(esk1_0))=esk2_0|mult(esk1_0,esk2_0)=mult(esk1_0,esk3_0)),inference(spm,[status(thm)],[1257,25,theory(equality)])).
% cnf(1385,negated_conjecture,(esk3_0=esk2_0|mult(esk1_0,esk2_0)=mult(esk1_0,esk3_0)),inference(rw,[status(thm)],[1349,1257,theory(equality)])).
% cnf(1386,negated_conjecture,(mult(esk1_0,esk2_0)=mult(esk1_0,esk3_0)),inference(sr,[status(thm)],[1385,22,theory(equality)])).
% cnf(1405,negated_conjecture,(mult(i(esk1_0),mult(esk1_0,esk3_0))=esk2_0),inference(spm,[status(thm)],[526,1386,theory(equality)])).
% cnf(1413,negated_conjecture,(esk3_0=esk2_0),inference(rw,[status(thm)],[1405,526,theory(equality)])).
% cnf(1414,negated_conjecture,($false),inference(sr,[status(thm)],[1413,22,theory(equality)])).
% cnf(1415,negated_conjecture,($false),1414,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 47
% # ...of these trivial : 4
% # ...subsumed : 5
% # ...remaining for further processing: 38
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 11
% # Generated clauses : 698
% # ...of the previous two non-trivial : 460
% # Contextual simplify-reflections : 0
% # Paramodulations : 698
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 27
% # Positive orientable unit clauses: 26
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 299
% # ...number of literals in the above : 299
% # Clause-clause subsumption calls (NU) : 9
% # Rec. Clause-clause subsumption calls : 9
% # Unit Clause-clause subsumption calls : 6
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 35
% # Indexed BW rewrite successes : 8
% # Backwards rewriting index: 31 leaves, 2.03+/-1.909 terms/leaf
% # Paramod-from index: 20 leaves, 1.30+/-0.714 terms/leaf
% # Paramod-into index: 29 leaves, 1.83+/-1.205 terms/leaf
% # -------------------------------------------------
% # User time : 0.024 s
% # System time : 0.004 s
% # Total time : 0.028 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.20 WC
% FINAL PrfWatch: 0.12 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP2076/GRP711+1.tptp
%
%------------------------------------------------------------------------------