%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GRP660+3 : 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:52 EST 2010
% Result : Theorem 2.40s
% Output : Solution 2.40s
% 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/SystemOnTPTP7431/GRP660+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP7431/GRP660+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP7431/GRP660+3.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 7527
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 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(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(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,ld(X5,X5))=X4&mult(ld(X5,X5),X4)=X4),file('/tmp/SRASS.s.p', goals)).
% fof(7, negated_conjecture,~(![X4]:![X5]:(mult(X4,ld(X5,X5))=X4&mult(ld(X5,X5),X4)=X4)),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(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,ld(X5,X5))=X4)|~(mult(ld(X5,X5),X4)=X4)),inference(fof_nnf,[status(thm)],[7])).
% fof(19, negated_conjecture,?[X6]:?[X7]:(~(mult(X6,ld(X7,X7))=X6)|~(mult(ld(X7,X7),X6)=X6)),inference(variable_rename,[status(thm)],[18])).
% fof(20, negated_conjecture,(~(mult(esk1_0,ld(esk2_0,esk2_0))=esk1_0)|~(mult(ld(esk2_0,esk2_0),esk1_0)=esk1_0)),inference(skolemize,[status(esa)],[19])).
% cnf(21,negated_conjecture,(mult(ld(esk2_0,esk2_0),esk1_0)!=esk1_0|mult(esk1_0,ld(esk2_0,esk2_0))!=esk1_0),inference(split_conjunct,[status(thm)],[20])).
% cnf(22,plain,(ld(rd(X1,X2),X1)=X2),inference(spm,[status(thm)],[11,13,theory(equality)])).
% cnf(23,plain,(rd(X2,ld(X1,X2))=X1),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)],[15,17,theory(equality)])).
% cnf(29,plain,(mult(mult(X2,X3),X1)=mult(X1,mult(ld(X1,X2),mult(X3,X1)))),inference(spm,[status(thm)],[17,9,theory(equality)])).
% cnf(40,plain,(ld(X1,mult(mult(X2,X3),X1))=mult(ld(X1,X2),mult(X3,X1))),inference(spm,[status(thm)],[11,29,theory(equality)])).
% cnf(44,plain,(mult(X1,mult(ld(X1,X2),X3))=mult(mult(X2,rd(X3,X1)),X1)),inference(spm,[status(thm)],[29,13,theory(equality)])).
% cnf(57,plain,(ld(X1,mult(X3,X1))=mult(ld(X1,X2),mult(ld(X2,X3),X1))),inference(spm,[status(thm)],[40,9,theory(equality)])).
% cnf(66,plain,(ld(ld(X1,X2),ld(X1,mult(X3,X1)))=mult(ld(X2,X3),X1)),inference(spm,[status(thm)],[11,57,theory(equality)])).
% cnf(80,plain,(mult(X2,mult(ld(mult(X1,X2),X3),X1))=ld(X1,mult(X3,X1))),inference(spm,[status(thm)],[57,11,theory(equality)])).
% cnf(97,plain,(ld(ld(X1,X2),X1)=mult(ld(X2,X1),X1)),inference(spm,[status(thm)],[66,11,theory(equality)])).
% cnf(100,plain,(ld(X2,ld(X1,mult(X3,X1)))=mult(ld(mult(X1,X2),X3),X1)),inference(spm,[status(thm)],[66,11,theory(equality)])).
% cnf(108,plain,(rd(X1,mult(ld(X2,X1),X1))=ld(X1,X2)),inference(spm,[status(thm)],[23,97,theory(equality)])).
% cnf(113,plain,(ld(X2,X1)=mult(ld(mult(X1,X2),X1),X1)),inference(spm,[status(thm)],[97,11,theory(equality)])).
% cnf(115,plain,(ld(ld(mult(X1,X2),X1),ld(X2,X1))=X1),inference(spm,[status(thm)],[11,113,theory(equality)])).
% cnf(116,plain,(rd(ld(X2,X1),X1)=ld(mult(X1,X2),X1)),inference(spm,[status(thm)],[15,113,theory(equality)])).
% cnf(120,plain,(mult(X1,mult(ld(X1,X2),ld(X3,X1)))=mult(mult(X2,ld(mult(X1,X3),X1)),X1)),inference(spm,[status(thm)],[29,113,theory(equality)])).
% cnf(169,plain,(rd(X1,mult(X2,X1))=ld(X1,rd(X1,X2))),inference(spm,[status(thm)],[108,22,theory(equality)])).
% cnf(293,plain,(ld(X1,ld(X2,X3))=mult(ld(mult(X2,X1),rd(X3,X2)),X2)),inference(spm,[status(thm)],[100,13,theory(equality)])).
% cnf(832,plain,(rd(mult(X1,mult(X2,X3)),X1)=mult(mult(X1,X2),rd(X3,X1))),inference(spm,[status(thm)],[25,13,theory(equality)])).
% cnf(1103,plain,(ld(ld(mult(X1,X2),rd(X3,X1)),ld(X2,ld(X1,X3)))=X1),inference(spm,[status(thm)],[11,293,theory(equality)])).
% cnf(1147,plain,(mult(ld(X2,rd(X3,X1)),X1)=ld(ld(X1,X2),ld(X1,X3))),inference(spm,[status(thm)],[293,9,theory(equality)])).
% cnf(1148,plain,(mult(rd(mult(X1,X2),mult(X1,mult(X1,X2))),X1)=ld(X2,ld(X1,mult(X1,X2)))),inference(spm,[status(thm)],[293,169,theory(equality)])).
% cnf(1155,plain,(mult(rd(mult(X1,X2),mult(X1,mult(X1,X2))),X1)=ld(X2,X2)),inference(rw,[status(thm)],[1148,11,theory(equality)])).
% cnf(1180,plain,(ld(ld(X1,X2),X3)=mult(ld(X2,rd(mult(X1,X3),X1)),X1)),inference(spm,[status(thm)],[1147,11,theory(equality)])).
% cnf(1208,plain,(rd(ld(ld(X2,X1),X3),X2)=ld(X1,rd(mult(X2,X3),X2))),inference(spm,[status(thm)],[15,1180,theory(equality)])).
% cnf(1813,plain,(mult(rd(mult(ld(X1,X1),X1),ld(X1,mult(X1,X1))),ld(X1,X1))=ld(X1,X1)),inference(spm,[status(thm)],[1155,57,theory(equality)])).
% cnf(1837,plain,(mult(ld(X1,X1),ld(X1,X1))=ld(X1,X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1813,11,theory(equality)]),15,theory(equality)])).
% cnf(1842,plain,(ld(ld(X1,X1),ld(X1,X1))=ld(X1,X1)),inference(spm,[status(thm)],[11,1837,theory(equality)])).
% cnf(1869,plain,(mult(ld(ld(X1,X1),X1),ld(X1,X1))=ld(ld(X1,X1),mult(X1,ld(X1,X1)))),inference(spm,[status(thm)],[57,1837,theory(equality)])).
% cnf(1875,plain,(mult(rd(X1,mult(X1,X1)),X1)=ld(X1,X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1842,1147,theory(equality)]),169,theory(equality)])).
% cnf(1893,plain,(mult(mult(ld(X1,X1),X1),ld(X1,X1))=ld(ld(X1,X1),mult(X1,ld(X1,X1)))),inference(rw,[status(thm)],[1869,97,theory(equality)])).
% cnf(1894,plain,(mult(mult(ld(X1,X1),X1),ld(X1,X1))=mult(ld(X1,X1),X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1893,9,theory(equality)]),97,theory(equality)])).
% cnf(1910,plain,(rd(ld(X1,X1),X1)=rd(X1,mult(X1,X1))),inference(spm,[status(thm)],[15,1875,theory(equality)])).
% cnf(1937,plain,(ld(mult(X1,X1),X1)=rd(X1,mult(X1,X1))),inference(rw,[status(thm)],[1910,116,theory(equality)])).
% cnf(1951,plain,(mult(ld(mult(X1,X1),X1),mult(X1,X1))=X1),inference(spm,[status(thm)],[13,1937,theory(equality)])).
% cnf(2040,plain,(rd(X1,ld(mult(X1,X1),X1))=mult(mult(ld(mult(X1,X1),X1),X1),rd(X1,ld(mult(X1,X1),X1)))),inference(spm,[status(thm)],[832,1951,theory(equality)])).
% cnf(2056,plain,(mult(X1,X1)=mult(mult(ld(mult(X1,X1),X1),X1),rd(X1,ld(mult(X1,X1),X1)))),inference(rw,[status(thm)],[2040,23,theory(equality)])).
% cnf(2057,plain,(mult(X1,X1)=mult(ld(X1,X1),mult(X1,X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[2056,113,theory(equality)]),23,theory(equality)])).
% cnf(2092,plain,(mult(X1,mult(X1,X1))=mult(mult(X1,X1),X1)),inference(spm,[status(thm)],[29,2057,theory(equality)])).
% cnf(2132,plain,(mult(ld(X1,rd(mult(X2,mult(X2,X2)),mult(X2,X2))),mult(X2,X2))=ld(ld(mult(X2,X2),X1),X2)),inference(spm,[status(thm)],[1180,2092,theory(equality)])).
% cnf(2154,plain,(mult(ld(X1,X2),mult(X2,X2))=ld(ld(mult(X2,X2),X1),X2)),inference(rw,[status(thm)],[2132,15,theory(equality)])).
% cnf(2868,plain,(ld(ld(X1,X1),mult(ld(X1,X1),X1))=mult(ld(ld(X1,X1),ld(X1,X1)),mult(X1,ld(X1,X1)))),inference(spm,[status(thm)],[40,1894,theory(equality)])).
% cnf(2893,plain,(X1=mult(ld(ld(X1,X1),ld(X1,X1)),mult(X1,ld(X1,X1)))),inference(rw,[status(thm)],[2868,11,theory(equality)])).
% cnf(2894,plain,(X1=mult(ld(X1,X1),X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[2893,1147,theory(equality)]),169,theory(equality)]),1937,theory(equality)]),113,theory(equality)]),9,theory(equality)])).
% cnf(2933,plain,(mult(X1,mult(ld(X1,X2),ld(X1,X1)))=ld(ld(X1,X1),mult(X2,ld(X1,X1)))),inference(spm,[status(thm)],[80,2894,theory(equality)])).
% cnf(13986,plain,(ld(ld(X1,X1),mult(X2,ld(X1,X1)))=mult(mult(X2,ld(mult(X1,X1),X1)),X1)),inference(rw,[status(thm)],[2933,120,theory(equality)])).
% cnf(14043,plain,(rd(mult(mult(X2,ld(mult(X1,X1),X1)),X1),X1)=ld(X1,rd(mult(X1,mult(X2,ld(X1,X1))),X1))),inference(spm,[status(thm)],[1208,13986,theory(equality)])).
% cnf(14111,plain,(mult(X2,ld(mult(X1,X1),X1))=ld(X1,rd(mult(X1,mult(X2,ld(X1,X1))),X1))),inference(rw,[status(thm)],[14043,15,theory(equality)])).
% cnf(14112,plain,(mult(X2,ld(mult(X1,X1),X1))=ld(X1,mult(mult(X1,X2),ld(mult(X1,X1),X1)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[14111,832,theory(equality)]),116,theory(equality)])).
% cnf(21225,plain,(ld(ld(mult(X1,ld(mult(X2,X1),X2)),rd(X2,X1)),X2)=X1),inference(spm,[status(thm)],[1103,115,theory(equality)])).
% cnf(40015,plain,(ld(X1,mult(ld(mult(X1,X1),X1),mult(ld(ld(mult(X1,X1),X1),X1),X2)))=mult(rd(X2,ld(mult(X1,X1),X1)),ld(mult(X1,X1),X1))),inference(spm,[status(thm)],[14112,44,theory(equality)])).
% cnf(40099,plain,(ld(X1,mult(ld(mult(X1,X1),X1),mult(mult(X1,X1),X2)))=mult(rd(X2,ld(mult(X1,X1),X1)),ld(mult(X1,X1),X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[40015,2154,theory(equality)]),2057,theory(equality)])).
% cnf(40100,plain,(ld(X1,mult(ld(mult(X1,X1),X1),mult(mult(X1,X1),X2)))=X2),inference(rw,[status(thm)],[40099,13,theory(equality)])).
% cnf(40199,plain,(ld(ld(X1,X1),mult(ld(ld(X1,X1),ld(X1,X1)),mult(ld(X1,X1),X2)))=X2),inference(spm,[status(thm)],[40100,1837,theory(equality)])).
% cnf(40256,plain,(mult(ld(X1,X1),X2)=X2),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[40199,1147,theory(equality)]),169,theory(equality)]),1937,theory(equality)]),113,theory(equality)]),11,theory(equality)])).
% cnf(40490,plain,(ld(ld(mult(X1,ld(X1,ld(X2,X2))),rd(ld(X2,X2),X1)),ld(X2,X2))=X1),inference(spm,[status(thm)],[21225,40256,theory(equality)])).
% cnf(40649,negated_conjecture,(mult(esk1_0,ld(esk2_0,esk2_0))!=esk1_0|$false),inference(rw,[status(thm)],[21,40256,theory(equality)])).
% cnf(40650,negated_conjecture,(mult(esk1_0,ld(esk2_0,esk2_0))!=esk1_0),inference(cn,[status(thm)],[40649,theory(equality)])).
% cnf(40854,plain,(mult(X1,ld(X2,X2))=X1),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[40490,9,theory(equality)]),169,theory(equality)]),22,theory(equality)])).
% cnf(41682,negated_conjecture,($false),inference(rw,[status(thm)],[40650,40854,theory(equality)])).
% cnf(41683,negated_conjecture,($false),inference(cn,[status(thm)],[41682,theory(equality)])).
% cnf(41684,negated_conjecture,($false),41683,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 537
% # ...of these trivial : 266
% # ...subsumed : 9
% # ...remaining for further processing: 262
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 72
% # Generated clauses : 27275
% # ...of the previous two non-trivial : 23654
% # Contextual simplify-reflections : 0
% # Paramodulations : 27275
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 190
% # Positive orientable unit clauses: 188
% # Positive unorientable unit clauses: 2
% # Negative unit clauses : 0
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 15929
% # ...number of literals in the above : 15929
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 7
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 727
% # Indexed BW rewrite successes : 57
% # Backwards rewriting index: 190 leaves, 2.33+/-2.070 terms/leaf
% # Paramod-from index: 151 leaves, 1.27+/-0.608 terms/leaf
% # Paramod-into index: 177 leaves, 2.01+/-1.722 terms/leaf
% # -------------------------------------------------
% # User time : 0.852 s
% # System time : 0.032 s
% # Total time : 0.884 s
% # Maximum resident set size: 0 pages
% PrfWatch: 1.61 CPU 1.69 WC
% FINAL PrfWatch: 1.61 CPU 1.69 WC
% SZS output end Solution for /tmp/SystemOnTPTP7431/GRP660+3.tptp
%
%------------------------------------------------------------------------------