%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GRP660+2 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art06.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:45 EST 2010
% Result : Theorem 2.47s
% Output : Solution 2.47s
% 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/SystemOnTPTP7172/GRP660+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP7172/GRP660+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP7172/GRP660+2.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 7268
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:mult(rd(X2,X1),X1)=X2,file('/tmp/SRASS.s.p', f03)).
% fof(2, axiom,![X1]:![X2]:rd(mult(X2,X1),X1)=X2,file('/tmp/SRASS.s.p', f04)).
% fof(3, axiom,![X1]:![X2]:mult(X2,ld(X2,X1))=X1,file('/tmp/SRASS.s.p', f01)).
% fof(4, axiom,![X1]:![X2]:ld(X2,mult(X2,X1))=X1,file('/tmp/SRASS.s.p', f02)).
% fof(5, axiom,![X3]:![X1]:![X2]:mult(mult(mult(X2,X1),X3),X2)=mult(X2,mult(X1,mult(X3,X2))),file('/tmp/SRASS.s.p', f05)).
% fof(6, conjecture,![X4]:![X5]:(mult(X4,rd(X5,X5))=X4&mult(rd(X5,X5),X4)=X4),file('/tmp/SRASS.s.p', goals)).
% fof(7, negated_conjecture,~(![X4]:![X5]:(mult(X4,rd(X5,X5))=X4&mult(rd(X5,X5),X4)=X4)),inference(assume_negation,[status(cth)],[6])).
% fof(8, plain,![X3]:![X4]:mult(rd(X4,X3),X3)=X4,inference(variable_rename,[status(thm)],[1])).
% cnf(9,plain,(mult(rd(X1,X2),X2)=X1),inference(split_conjunct,[status(thm)],[8])).
% fof(10, plain,![X3]:![X4]:rd(mult(X4,X3),X3)=X4,inference(variable_rename,[status(thm)],[2])).
% cnf(11,plain,(rd(mult(X1,X2),X2)=X1),inference(split_conjunct,[status(thm)],[10])).
% fof(12, plain,![X3]:![X4]:mult(X4,ld(X4,X3))=X3,inference(variable_rename,[status(thm)],[3])).
% 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)],[4])).
% cnf(15,plain,(ld(X1,mult(X1,X2))=X2),inference(split_conjunct,[status(thm)],[14])).
% fof(16, plain,![X4]:![X5]:![X6]:mult(mult(mult(X6,X5),X4),X6)=mult(X6,mult(X5,mult(X4,X6))),inference(variable_rename,[status(thm)],[5])).
% cnf(17,plain,(mult(mult(mult(X1,X2),X3),X1)=mult(X1,mult(X2,mult(X3,X1)))),inference(split_conjunct,[status(thm)],[16])).
% fof(18, negated_conjecture,?[X4]:?[X5]:(~(mult(X4,rd(X5,X5))=X4)|~(mult(rd(X5,X5),X4)=X4)),inference(fof_nnf,[status(thm)],[7])).
% fof(19, negated_conjecture,?[X6]:?[X7]:(~(mult(X6,rd(X7,X7))=X6)|~(mult(rd(X7,X7),X6)=X6)),inference(variable_rename,[status(thm)],[18])).
% fof(20, negated_conjecture,(~(mult(esk1_0,rd(esk2_0,esk2_0))=esk1_0)|~(mult(rd(esk2_0,esk2_0),esk1_0)=esk1_0)),inference(skolemize,[status(esa)],[19])).
% cnf(21,negated_conjecture,(mult(rd(esk2_0,esk2_0),esk1_0)!=esk1_0|mult(esk1_0,rd(esk2_0,esk2_0))!=esk1_0),inference(split_conjunct,[status(thm)],[20])).
% cnf(22,plain,(rd(X2,ld(X1,X2))=X1),inference(spm,[status(thm)],[11,13,theory(equality)])).
% cnf(23,plain,(ld(rd(X1,X2),X1)=X2),inference(spm,[status(thm)],[15,9,theory(equality)])).
% cnf(25,plain,(rd(mult(X1,mult(X2,mult(X3,X1))),X1)=mult(mult(X1,X2),X3)),inference(spm,[status(thm)],[11,17,theory(equality)])).
% cnf(28,plain,(mult(mult(X1,X3),rd(X1,X2))=mult(rd(X1,X2),mult(X2,mult(X3,rd(X1,X2))))),inference(spm,[status(thm)],[17,9,theory(equality)])).
% cnf(29,plain,(mult(mult(X2,X3),X1)=mult(X1,mult(ld(X1,X2),mult(X3,X1)))),inference(spm,[status(thm)],[17,13,theory(equality)])).
% cnf(42,plain,(rd(mult(X1,mult(X2,X3)),X1)=mult(mult(X1,X2),rd(X3,X1))),inference(spm,[status(thm)],[25,9,theory(equality)])).
% cnf(51,plain,(rd(mult(X1,X2),X1)=mult(mult(X1,rd(X2,X3)),rd(X3,X1))),inference(spm,[status(thm)],[42,9,theory(equality)])).
% cnf(59,plain,(rd(rd(mult(X1,X2),X1),rd(X3,X1))=mult(X1,rd(X2,X3))),inference(spm,[status(thm)],[11,51,theory(equality)])).
% cnf(64,plain,(mult(mult(X1,rd(X2,mult(X1,mult(X3,X4)))),mult(mult(X1,X3),rd(X4,X1)))=rd(mult(X1,X2),X1)),inference(spm,[status(thm)],[51,42,theory(equality)])).
% cnf(65,plain,(mult(mult(X1,rd(X2,mult(X3,X1))),X3)=rd(mult(X1,X2),X1)),inference(spm,[status(thm)],[51,11,theory(equality)])).
% cnf(82,plain,(rd(rd(mult(X1,X2),X1),X3)=mult(X1,rd(X2,mult(X3,X1)))),inference(spm,[status(thm)],[59,11,theory(equality)])).
% cnf(89,plain,(rd(X1,rd(X2,X1))=mult(X1,rd(X1,X2))),inference(spm,[status(thm)],[59,11,theory(equality)])).
% cnf(92,plain,(ld(mult(X1,rd(X1,X2)),X1)=rd(X2,X1)),inference(spm,[status(thm)],[23,89,theory(equality)])).
% cnf(98,plain,(rd(X1,X2)=mult(X1,rd(X1,mult(X2,X1)))),inference(spm,[status(thm)],[89,11,theory(equality)])).
% cnf(103,plain,(ld(X1,rd(X1,X2))=rd(X1,mult(X2,X1))),inference(spm,[status(thm)],[15,98,theory(equality)])).
% cnf(105,plain,(mult(mult(rd(X1,X2),X3),X1)=mult(X1,mult(rd(X1,mult(X2,X1)),mult(X3,X1)))),inference(spm,[status(thm)],[17,98,theory(equality)])).
% cnf(154,plain,(ld(mult(mult(X1,X2),X1),mult(X1,X2))=rd(X2,mult(X1,X2))),inference(spm,[status(thm)],[92,11,theory(equality)])).
% cnf(157,plain,(ld(mult(X1,X2),X1)=rd(ld(X2,X1),X1)),inference(spm,[status(thm)],[92,22,theory(equality)])).
% cnf(263,plain,(rd(rd(X2,X1),X3)=mult(X1,rd(ld(X1,X2),mult(X3,X1)))),inference(spm,[status(thm)],[82,13,theory(equality)])).
% cnf(822,plain,(mult(X1,mult(ld(X1,X2),X3))=mult(mult(X2,rd(X3,X1)),X1)),inference(spm,[status(thm)],[29,9,theory(equality)])).
% cnf(848,plain,(ld(X1,mult(mult(X2,rd(X3,X1)),X1))=mult(ld(X1,X2),X3)),inference(spm,[status(thm)],[15,822,theory(equality)])).
% cnf(877,plain,(mult(X1,mult(rd(X1,mult(X2,X1)),X3))=mult(mult(rd(X1,X2),rd(X3,X1)),X1)),inference(spm,[status(thm)],[822,103,theory(equality)])).
% cnf(1157,plain,(mult(X1,rd(ld(X1,X2),X3))=rd(rd(X2,X1),rd(X3,X1))),inference(spm,[status(thm)],[263,9,theory(equality)])).
% cnf(1170,plain,(mult(X1,ld(mult(mult(X2,X1),X1),mult(X2,X1)))=rd(rd(mult(X2,X1),X1),X2)),inference(spm,[status(thm)],[263,157,theory(equality)])).
% cnf(1176,plain,(mult(X1,ld(mult(mult(X2,X1),X1),mult(X2,X1)))=rd(X2,X2)),inference(rw,[status(thm)],[1170,11,theory(equality)])).
% cnf(1204,plain,(rd(X1,rd(X3,X2))=mult(X2,rd(ld(X2,mult(X1,X2)),X3))),inference(spm,[status(thm)],[1157,11,theory(equality)])).
% cnf(1257,plain,(mult(X1,rd(ld(X1,mult(X1,mult(X2,mult(X3,X1)))),X4))=rd(mult(mult(X1,X2),X3),rd(X4,X1))),inference(spm,[status(thm)],[1204,17,theory(equality)])).
% cnf(1277,plain,(mult(X1,rd(mult(X2,mult(X3,X1)),X4))=rd(mult(mult(X1,X2),X3),rd(X4,X1))),inference(rw,[status(thm)],[1257,15,theory(equality)])).
% cnf(1853,plain,(mult(rd(X1,X1),ld(rd(mult(X1,X1),X1),mult(X1,rd(X1,X1))))=rd(X1,X1)),inference(spm,[status(thm)],[1176,51,theory(equality)])).
% cnf(1866,plain,(mult(rd(X1,X1),rd(X1,X1))=rd(X1,X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1853,11,theory(equality)]),15,theory(equality)])).
% cnf(1869,plain,(rd(rd(X1,X1),rd(X1,X1))=rd(X1,X1)),inference(spm,[status(thm)],[11,1866,theory(equality)])).
% cnf(1902,plain,(mult(X1,ld(mult(X1,X1),X1))=rd(X1,X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1869,1157,theory(equality)]),157,theory(equality)])).
% cnf(1978,plain,(ld(X1,rd(X1,X1))=ld(mult(X1,X1),X1)),inference(spm,[status(thm)],[15,1902,theory(equality)])).
% cnf(2007,plain,(rd(X1,mult(X1,X1))=ld(mult(X1,X1),X1)),inference(rw,[status(thm)],[1978,103,theory(equality)])).
% cnf(2359,plain,(mult(rd(X1,X1),mult(X1,rd(X1,X1)))=mult(mult(X1,rd(X1,X1)),rd(X1,X1))),inference(spm,[status(thm)],[28,1866,theory(equality)])).
% cnf(2391,plain,(mult(rd(X1,X1),mult(X1,rd(X1,X1)))=X1),inference(rw,[status(thm)],[inference(rw,[status(thm)],[2359,51,theory(equality)]),11,theory(equality)])).
% cnf(2394,plain,(ld(rd(X1,X1),X1)=mult(X1,rd(X1,X1))),inference(spm,[status(thm)],[15,2391,theory(equality)])).
% cnf(2432,plain,(X1=mult(X1,rd(X1,X1))),inference(rw,[status(thm)],[2394,23,theory(equality)])).
% cnf(2469,plain,(mult(mult(X1,X2),X1)=mult(X1,mult(rd(X1,X1),mult(X2,X1)))),inference(spm,[status(thm)],[17,2432,theory(equality)])).
% cnf(2479,plain,(ld(mult(X1,X1),X1)=rd(rd(X1,X1),X1)),inference(spm,[status(thm)],[154,2432,theory(equality)])).
% cnf(2486,plain,(mult(mult(rd(X1,X1),rd(X2,X1)),X1)=rd(mult(rd(X1,X1),X2),rd(X1,X1))),inference(spm,[status(thm)],[65,2432,theory(equality)])).
% cnf(2507,plain,(rd(X1,mult(X1,X1))=rd(rd(X1,X1),X1)),inference(rw,[status(thm)],[2479,2007,theory(equality)])).
% cnf(3645,plain,(rd(mult(mult(X1,X2),X1),mult(rd(X1,X1),mult(X2,X1)))=X1),inference(spm,[status(thm)],[11,2469,theory(equality)])).
% cnf(10194,plain,(mult(mult(rd(X1,X1),X1),mult(mult(rd(X1,X1),X2),rd(X1,rd(X1,X1))))=rd(mult(rd(X1,X1),mult(mult(X1,X2),X1)),rd(X1,X1))),inference(spm,[status(thm)],[64,3645,theory(equality)])).
% cnf(10264,plain,(mult(X1,mult(mult(rd(X1,X1),X2),X1))=rd(mult(rd(X1,X1),mult(mult(X1,X2),X1)),rd(X1,X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[10194,9,theory(equality)]),89,theory(equality)]),2432,theory(equality)])).
% cnf(10265,plain,(mult(X1,mult(mult(rd(X1,X1),X2),X1))=mult(mult(rd(X1,X1),mult(X1,X2)),X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[10264,42,theory(equality)]),89,theory(equality)]),2432,theory(equality)])).
% cnf(14896,plain,(rd(mult(X1,X2),rd(X3,X1))=mult(X1,rd(mult(rd(X1,X1),mult(X2,X1)),X3))),inference(spm,[status(thm)],[1277,2432,theory(equality)])).
% cnf(14991,plain,(rd(mult(rd(X1,X1),X2),rd(X1,X1))=mult(X1,mult(rd(X1,mult(X1,X1)),X2))),inference(rw,[status(thm)],[2486,877,theory(equality)])).
% cnf(17124,plain,(rd(mult(X1,mult(mult(rd(X1,X1),X2),X1)),X1)=mult(rd(X1,X1),mult(X1,X2))),inference(spm,[status(thm)],[11,10265,theory(equality)])).
% cnf(17282,plain,(mult(mult(X1,mult(rd(X1,X1),X2)),rd(X1,X1))=mult(rd(X1,X1),mult(X1,X2))),inference(rw,[status(thm)],[17124,42,theory(equality)])).
% cnf(17725,plain,(ld(X1,mult(mult(X2,X3),X1))=mult(ld(X1,X2),mult(X3,X1))),inference(spm,[status(thm)],[848,11,theory(equality)])).
% cnf(39341,plain,(mult(X1,mult(X1,mult(rd(X1,mult(X1,X1)),mult(X2,X1))))=rd(mult(X1,X2),rd(rd(X1,X1),X1))),inference(spm,[status(thm)],[14896,14991,theory(equality)])).
% cnf(39508,plain,(mult(X1,mult(mult(rd(X1,X1),X2),X1))=rd(mult(X1,X2),rd(rd(X1,X1),X1))),inference(rw,[status(thm)],[39341,105,theory(equality)])).
% cnf(39509,plain,(mult(X1,mult(mult(rd(X1,X1),X2),X1))=rd(mult(X1,X2),rd(X1,mult(X1,X1)))),inference(rw,[status(thm)],[39508,2507,theory(equality)])).
% cnf(41027,plain,(ld(rd(X1,X1),mult(rd(X1,X1),mult(X1,X2)))=mult(ld(rd(X1,X1),X1),mult(mult(rd(X1,X1),X2),rd(X1,X1)))),inference(spm,[status(thm)],[17725,17282,theory(equality)])).
% cnf(41137,plain,(mult(X1,X2)=mult(ld(rd(X1,X1),X1),mult(mult(rd(X1,X1),X2),rd(X1,X1)))),inference(rw,[status(thm)],[41027,15,theory(equality)])).
% cnf(41138,plain,(mult(X1,X2)=mult(X1,mult(mult(rd(X1,X1),X2),rd(X1,X1)))),inference(rw,[status(thm)],[41137,23,theory(equality)])).
% cnf(41222,plain,(ld(X1,mult(X1,X2))=mult(mult(rd(X1,X1),X2),rd(X1,X1))),inference(spm,[status(thm)],[15,41138,theory(equality)])).
% cnf(41416,plain,(X2=mult(mult(rd(X1,X1),X2),rd(X1,X1))),inference(rw,[status(thm)],[41222,15,theory(equality)])).
% cnf(41507,plain,(rd(X2,rd(X1,X1))=mult(rd(X1,X1),X2)),inference(spm,[status(thm)],[11,41416,theory(equality)])).
% cnf(41801,plain,(mult(rd(X2,X2),mult(X1,rd(X2,X2)))=X1),inference(spm,[status(thm)],[11,41507,theory(equality)])).
% cnf(42290,plain,(rd(X2,rd(rd(X1,X1),mult(rd(X1,X1),rd(X1,X1))))=mult(rd(X1,X1),mult(mult(rd(rd(X1,X1),rd(X1,X1)),mult(X2,rd(X1,X1))),rd(X1,X1)))),inference(spm,[status(thm)],[39509,41801,theory(equality)])).
% cnf(42498,plain,(mult(rd(X1,X1),X2)=mult(rd(X1,X1),mult(mult(rd(rd(X1,X1),rd(X1,X1)),mult(X2,rd(X1,X1))),rd(X1,X1)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[42290,1866,theory(equality)]),1157,theory(equality)]),157,theory(equality)]),2007,theory(equality)]),98,theory(equality)]),41507,theory(equality)])).
% cnf(42499,plain,(mult(rd(X1,X1),X2)=X2),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[42498,1157,theory(equality)]),157,theory(equality)]),2007,theory(equality)]),98,theory(equality)]),41801,theory(equality)]),41801,theory(equality)])).
% cnf(42990,plain,(mult(X2,rd(X1,X1))=X2),inference(rw,[status(thm)],[41416,42499,theory(equality)])).
% cnf(43017,negated_conjecture,(mult(esk1_0,rd(esk2_0,esk2_0))!=esk1_0|$false),inference(rw,[status(thm)],[21,42499,theory(equality)])).
% cnf(43018,negated_conjecture,(mult(esk1_0,rd(esk2_0,esk2_0))!=esk1_0),inference(cn,[status(thm)],[43017,theory(equality)])).
% cnf(43661,negated_conjecture,($false),inference(rw,[status(thm)],[43018,42990,theory(equality)])).
% cnf(43662,negated_conjecture,($false),inference(cn,[status(thm)],[43661,theory(equality)])).
% cnf(43663,negated_conjecture,($false),43662,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 566
% # ...of these trivial : 291
% # ...subsumed : 9
% # ...remaining for further processing: 266
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 81
% # Generated clauses : 27862
% # ...of the previous two non-trivial : 24045
% # Contextual simplify-reflections : 0
% # Paramodulations : 27862
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 185
% # Positive orientable unit clauses: 183
% # Positive unorientable unit clauses: 2
% # Negative unit clauses : 0
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 14861
% # ...number of literals in the above : 14861
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 8
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 737
% # Indexed BW rewrite successes : 63
% # Backwards rewriting index: 198 leaves, 2.26+/-2.116 terms/leaf
% # Paramod-from index: 155 leaves, 1.21+/-0.517 terms/leaf
% # Paramod-into index: 182 leaves, 1.97+/-1.835 terms/leaf
% # -------------------------------------------------
% # User time : 0.901 s
% # System time : 0.021 s
% # Total time : 0.922 s
% # Maximum resident set size: 0 pages
% PrfWatch: 1.69 CPU 1.77 WC
% FINAL PrfWatch: 1.69 CPU 1.77 WC
% SZS output end Solution for /tmp/SystemOnTPTP7172/GRP660+2.tptp
%
%------------------------------------------------------------------------------