%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GRP658+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:17:26 EST 2010
% Result : Theorem 0.94s
% Output : Solution 0.94s
% 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/SystemOnTPTP496/GRP658+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP496/GRP658+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP496/GRP658+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 593
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.009 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(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,![X3]:![X1]:![X2]:mult(mult(X2,mult(X1,X1)),X3)=mult(mult(X2,X1),mult(X1,X3)),file('/tmp/SRASS.s.p', f05)).
% fof(6, conjecture,?[X4]:![X5]:(mult(X5,X4)=X5&mult(X4,X5)=X5),file('/tmp/SRASS.s.p', goals)).
% fof(7, negated_conjecture,~(?[X4]:![X5]:(mult(X5,X4)=X5&mult(X4,X5)=X5)),inference(assume_negation,[status(cth)],[6])).
% fof(8, plain,![X3]:![X4]:mult(X4,ld(X4,X3))=X3,inference(variable_rename,[status(thm)],[1])).
% cnf(9,plain,(mult(X1,ld(X1,X2))=X2),inference(split_conjunct,[status(thm)],[8])).
% fof(10, plain,![X3]:![X4]:ld(X4,mult(X4,X3))=X3,inference(variable_rename,[status(thm)],[2])).
% cnf(11,plain,(ld(X1,mult(X1,X2))=X2),inference(split_conjunct,[status(thm)],[10])).
% fof(12, plain,![X3]:![X4]:mult(rd(X4,X3),X3)=X4,inference(variable_rename,[status(thm)],[3])).
% cnf(13,plain,(mult(rd(X1,X2),X2)=X1),inference(split_conjunct,[status(thm)],[12])).
% fof(14, plain,![X3]:![X4]:rd(mult(X4,X3),X3)=X4,inference(variable_rename,[status(thm)],[4])).
% cnf(15,plain,(rd(mult(X1,X2),X2)=X1),inference(split_conjunct,[status(thm)],[14])).
% fof(16, plain,![X4]:![X5]:![X6]:mult(mult(X6,mult(X5,X5)),X4)=mult(mult(X6,X5),mult(X5,X4)),inference(variable_rename,[status(thm)],[5])).
% cnf(17,plain,(mult(mult(X1,mult(X2,X2)),X3)=mult(mult(X1,X2),mult(X2,X3))),inference(split_conjunct,[status(thm)],[16])).
% fof(18, negated_conjecture,![X4]:?[X5]:(~(mult(X5,X4)=X5)|~(mult(X4,X5)=X5)),inference(fof_nnf,[status(thm)],[7])).
% fof(19, negated_conjecture,![X6]:?[X7]:(~(mult(X7,X6)=X7)|~(mult(X6,X7)=X7)),inference(variable_rename,[status(thm)],[18])).
% fof(20, negated_conjecture,![X6]:(~(mult(esk1_1(X6),X6)=esk1_1(X6))|~(mult(X6,esk1_1(X6))=esk1_1(X6))),inference(skolemize,[status(esa)],[19])).
% cnf(21,negated_conjecture,(mult(X1,esk1_1(X1))!=esk1_1(X1)|mult(esk1_1(X1),X1)!=esk1_1(X1)),inference(split_conjunct,[status(thm)],[20])).
% cnf(22,plain,(ld(rd(X1,X2),X1)=X2),inference(spm,[status(thm)],[11,13,theory(equality)])).
% cnf(32,negated_conjecture,(mult(mult(X1,X2),mult(X2,esk1_1(mult(X1,mult(X2,X2)))))!=esk1_1(mult(X1,mult(X2,X2)))|mult(esk1_1(mult(X1,mult(X2,X2))),mult(X1,mult(X2,X2)))!=esk1_1(mult(X1,mult(X2,X2)))),inference(spm,[status(thm)],[21,17,theory(equality)])).
% cnf(36,plain,(rd(mult(mult(X1,X2),mult(X2,X3)),X3)=mult(X1,mult(X2,X2))),inference(spm,[status(thm)],[15,17,theory(equality)])).
% cnf(38,plain,(mult(X1,X3)=mult(mult(rd(X1,mult(X2,X2)),X2),mult(X2,X3))),inference(spm,[status(thm)],[17,13,theory(equality)])).
% cnf(63,plain,(rd(mult(mult(X1,X2),X3),ld(X2,X3))=mult(X1,mult(X2,X2))),inference(spm,[status(thm)],[36,9,theory(equality)])).
% cnf(72,plain,(ld(mult(X1,mult(X2,X2)),mult(mult(X1,X2),X3))=ld(X2,X3)),inference(spm,[status(thm)],[22,63,theory(equality)])).
% cnf(176,plain,(mult(mult(rd(X1,mult(X2,X2)),X2),X3)=mult(X1,ld(X2,X3))),inference(spm,[status(thm)],[38,9,theory(equality)])).
% cnf(196,plain,(mult(mult(X1,ld(X2,mult(X3,X3))),X4)=mult(mult(mult(rd(X1,mult(X2,X2)),X2),X3),mult(X3,X4))),inference(spm,[status(thm)],[17,176,theory(equality)])).
% cnf(197,negated_conjecture,(mult(mult(mult(rd(X1,mult(X2,X2)),X2),X3),mult(X3,esk1_1(mult(X1,ld(X2,mult(X3,X3))))))!=esk1_1(mult(X1,ld(X2,mult(X3,X3))))|mult(esk1_1(mult(X1,ld(X2,mult(X3,X3)))),mult(X1,ld(X2,mult(X3,X3))))!=esk1_1(mult(X1,ld(X2,mult(X3,X3))))),inference(spm,[status(thm)],[32,176,theory(equality)])).
% cnf(226,plain,(mult(mult(X1,ld(X2,mult(X3,X3))),X4)=mult(mult(X1,ld(X2,X3)),mult(X3,X4))),inference(rw,[status(thm)],[196,176,theory(equality)])).
% cnf(227,negated_conjecture,(mult(mult(X1,ld(X2,X3)),mult(X3,esk1_1(mult(X1,ld(X2,mult(X3,X3))))))!=esk1_1(mult(X1,ld(X2,mult(X3,X3))))|mult(esk1_1(mult(X1,ld(X2,mult(X3,X3)))),mult(X1,ld(X2,mult(X3,X3))))!=esk1_1(mult(X1,ld(X2,mult(X3,X3))))),inference(rw,[status(thm)],[197,176,theory(equality)])).
% cnf(364,plain,(mult(mult(X2,X2),X3)=mult(mult(X1,ld(X1,X2)),mult(X2,X3))),inference(spm,[status(thm)],[226,9,theory(equality)])).
% cnf(397,plain,(mult(mult(X2,X2),X3)=mult(X2,mult(X2,X3))),inference(rw,[status(thm)],[364,9,theory(equality)])).
% cnf(607,negated_conjecture,(mult(mult(X1,ld(X1,X2)),mult(X2,esk1_1(mult(X2,X2))))!=esk1_1(mult(X2,X2))|mult(esk1_1(mult(X2,X2)),mult(X2,X2))!=esk1_1(mult(X2,X2))),inference(spm,[status(thm)],[227,9,theory(equality)])).
% cnf(638,negated_conjecture,(mult(X2,mult(X2,esk1_1(mult(X2,X2))))!=esk1_1(mult(X2,X2))|mult(esk1_1(mult(X2,X2)),mult(X2,X2))!=esk1_1(mult(X2,X2))),inference(rw,[status(thm)],[607,9,theory(equality)])).
% cnf(777,plain,(rd(mult(X1,mult(X1,X2)),X2)=mult(X1,X1)),inference(spm,[status(thm)],[15,397,theory(equality)])).
% cnf(889,plain,(rd(mult(rd(X1,X2),X1),X2)=mult(rd(X1,X2),rd(X1,X2))),inference(spm,[status(thm)],[777,13,theory(equality)])).
% cnf(896,plain,(rd(mult(X1,X2),ld(X1,X2))=mult(X1,X1)),inference(spm,[status(thm)],[777,9,theory(equality)])).
% cnf(937,plain,(ld(mult(X1,X1),mult(X1,X2))=ld(X1,X2)),inference(spm,[status(thm)],[22,896,theory(equality)])).
% cnf(992,plain,(ld(mult(X1,X1),X2)=ld(X1,ld(X1,X2))),inference(spm,[status(thm)],[937,9,theory(equality)])).
% cnf(1021,plain,(mult(X1,ld(mult(X1,X1),X2))=ld(X1,X2)),inference(spm,[status(thm)],[9,992,theory(equality)])).
% cnf(1070,plain,(mult(ld(X1,mult(X2,X2)),X3)=mult(mult(X1,ld(mult(X1,X1),X2)),mult(X2,X3))),inference(spm,[status(thm)],[226,1021,theory(equality)])).
% cnf(1097,plain,(mult(ld(X1,mult(X2,X2)),X3)=mult(ld(X1,X2),mult(X2,X3))),inference(rw,[status(thm)],[1070,1021,theory(equality)])).
% cnf(1129,plain,(mult(rd(X1,X1),rd(X1,X1))=rd(X1,X1)),inference(spm,[status(thm)],[15,889,theory(equality)])).
% cnf(1292,plain,(ld(mult(rd(X1,X1),mult(rd(X1,X1),rd(X1,X1))),mult(rd(X1,X1),X2))=ld(rd(X1,X1),X2)),inference(spm,[status(thm)],[72,1129,theory(equality)])).
% cnf(1327,plain,(X2=ld(rd(X1,X1),X2)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[1292,1129,theory(equality)]),1129,theory(equality)]),11,theory(equality)])).
% cnf(1359,plain,(mult(rd(X1,X1),X2)=X2),inference(spm,[status(thm)],[11,1327,theory(equality)])).
% cnf(1401,negated_conjecture,(mult(rd(X1,X1),esk1_1(mult(rd(X1,X1),rd(X1,X1))))!=esk1_1(mult(rd(X1,X1),rd(X1,X1)))|mult(esk1_1(mult(rd(X1,X1),rd(X1,X1))),mult(rd(X1,X1),rd(X1,X1)))!=esk1_1(mult(rd(X1,X1),rd(X1,X1)))),inference(spm,[status(thm)],[638,1359,theory(equality)])).
% cnf(1470,negated_conjecture,(esk1_1(rd(X1,X1))!=esk1_1(mult(rd(X1,X1),rd(X1,X1)))|mult(esk1_1(mult(rd(X1,X1),rd(X1,X1))),mult(rd(X1,X1),rd(X1,X1)))!=esk1_1(mult(rd(X1,X1),rd(X1,X1)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1401,1359,theory(equality)]),1359,theory(equality)])).
% cnf(1471,negated_conjecture,($false|mult(esk1_1(mult(rd(X1,X1),rd(X1,X1))),mult(rd(X1,X1),rd(X1,X1)))!=esk1_1(mult(rd(X1,X1),rd(X1,X1)))),inference(rw,[status(thm)],[1470,1359,theory(equality)])).
% cnf(1472,negated_conjecture,($false|mult(esk1_1(rd(X1,X1)),rd(X1,X1))!=esk1_1(mult(rd(X1,X1),rd(X1,X1)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1471,1359,theory(equality)]),1359,theory(equality)])).
% cnf(1473,negated_conjecture,($false|mult(esk1_1(rd(X1,X1)),rd(X1,X1))!=esk1_1(rd(X1,X1))),inference(rw,[status(thm)],[1472,1359,theory(equality)])).
% cnf(1474,negated_conjecture,(mult(esk1_1(rd(X1,X1)),rd(X1,X1))!=esk1_1(rd(X1,X1))),inference(cn,[status(thm)],[1473,theory(equality)])).
% cnf(1765,plain,(mult(X1,X2)=mult(ld(X1,X1),mult(X1,X2))),inference(spm,[status(thm)],[1097,11,theory(equality)])).
% cnf(1879,plain,(mult(ld(X1,X1),X2)=X2),inference(spm,[status(thm)],[1765,9,theory(equality)])).
% cnf(1920,plain,(rd(mult(ld(X1,X1),X2),X2)=mult(ld(X1,X1),ld(X1,X1))),inference(spm,[status(thm)],[777,1879,theory(equality)])).
% cnf(2000,plain,(rd(X2,X2)=mult(ld(X1,X1),ld(X1,X1))),inference(rw,[status(thm)],[1920,1879,theory(equality)])).
% cnf(2001,plain,(rd(X2,X2)=ld(X1,X1)),inference(rw,[status(thm)],[2000,1879,theory(equality)])).
% cnf(2402,plain,(mult(X1,rd(X2,X2))=ld(X1,mult(X1,X1))),inference(spm,[status(thm)],[1021,2001,theory(equality)])).
% cnf(2435,plain,(mult(X1,rd(X2,X2))=X1),inference(rw,[status(thm)],[2402,11,theory(equality)])).
% cnf(2531,negated_conjecture,($false),inference(rw,[status(thm)],[1474,2435,theory(equality)])).
% cnf(2532,negated_conjecture,($false),inference(cn,[status(thm)],[2531,theory(equality)])).
% cnf(2533,negated_conjecture,($false),2532,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 118
% # ...of these trivial : 20
% # ...subsumed : 40
% # ...remaining for further processing: 58
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 7
% # Generated clauses : 1190
% # ...of the previous two non-trivial : 932
% # Contextual simplify-reflections : 0
% # Paramodulations : 1190
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 51
% # Positive orientable unit clauses: 35
% # Positive unorientable unit clauses: 2
% # Negative unit clauses : 1
% # Non-unit-clauses : 13
% # Current number of unprocessed clauses: 743
% # ...number of literals in the above : 967
% # Clause-clause subsumption calls (NU) : 75
% # Rec. Clause-clause subsumption calls : 75
% # Unit Clause-clause subsumption calls : 18
% # Rewrite failures with RHS unbound : 15
% # Indexed BW rewrite attempts : 144
% # Indexed BW rewrite successes : 14
% # Backwards rewriting index: 83 leaves, 1.84+/-1.331 terms/leaf
% # Paramod-from index: 33 leaves, 1.15+/-0.359 terms/leaf
% # Paramod-into index: 62 leaves, 1.69+/-1.172 terms/leaf
% # -------------------------------------------------
% # User time : 0.044 s
% # System time : 0.003 s
% # Total time : 0.047 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.17 CPU 0.24 WC
% FINAL PrfWatch: 0.17 CPU 0.24 WC
% SZS output end Solution for /tmp/SystemOnTPTP496/GRP658+1.tptp
%
%------------------------------------------------------------------------------