TSTP Solution File: GRP659+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GRP659+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 : art01.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:32 EST 2010
% Result : Theorem 1.48s
% Output : Solution 1.48s
% 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/SystemOnTPTP17578/GRP659+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP17578/GRP659+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP17578/GRP659+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 17674
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 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(X2,mult(X1,X3)),X1)=mult(mult(X2,X1),mult(X3,X1)),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,X4)),X5)=mult(mult(X6,X5),mult(X4,X5)),inference(variable_rename,[status(thm)],[5])).
% cnf(17,plain,(mult(mult(X1,mult(X2,X3)),X2)=mult(mult(X1,X2),mult(X3,X2))),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(23,plain,(rd(X2,ld(X1,X2))=X1),inference(spm,[status(thm)],[15,9,theory(equality)])).
% cnf(33,plain,(ld(mult(X1,mult(X2,X3)),mult(mult(X1,X2),mult(X3,X2)))=X2),inference(spm,[status(thm)],[11,17,theory(equality)])).
% cnf(34,plain,(rd(mult(mult(X1,X2),mult(X3,X2)),X2)=mult(X1,mult(X2,X3))),inference(spm,[status(thm)],[15,17,theory(equality)])).
% cnf(37,plain,(mult(mult(X1,X3),X2)=mult(mult(X1,X2),mult(ld(X2,X3),X2))),inference(spm,[status(thm)],[17,9,theory(equality)])).
% cnf(38,plain,(mult(X1,X2)=mult(mult(rd(X1,mult(X2,X3)),X2),mult(X3,X2))),inference(spm,[status(thm)],[17,13,theory(equality)])).
% cnf(41,plain,(rd(mult(mult(X1,X2),X3),X2)=mult(X1,mult(X2,rd(X3,X2)))),inference(spm,[status(thm)],[34,13,theory(equality)])).
% cnf(50,plain,(mult(X1,mult(X2,rd(X2,X2)))=mult(X1,X2)),inference(spm,[status(thm)],[15,41,theory(equality)])).
% cnf(51,plain,(rd(mult(X1,X3),X2)=mult(rd(X1,X2),mult(X2,rd(X3,X2)))),inference(spm,[status(thm)],[41,13,theory(equality)])).
% cnf(61,plain,(ld(X1,mult(X1,X2))=mult(X2,rd(X2,X2))),inference(spm,[status(thm)],[11,50,theory(equality)])).
% cnf(68,plain,(X2=mult(X2,rd(X2,X2))),inference(rw,[status(thm)],[61,11,theory(equality)])).
% cnf(72,plain,(ld(X1,X1)=rd(X1,X1)),inference(spm,[status(thm)],[11,68,theory(equality)])).
% cnf(79,plain,(mult(ld(X1,X1),X1)=X1),inference(spm,[status(thm)],[13,72,theory(equality)])).
% cnf(86,plain,(mult(mult(X1,X2),ld(X2,X2))=mult(mult(X1,ld(X2,X2)),mult(X2,ld(X2,X2)))),inference(spm,[status(thm)],[17,79,theory(equality)])).
% cnf(88,plain,(mult(mult(X1,X2),ld(X2,X2))=mult(mult(X1,ld(X2,X2)),X2)),inference(rw,[status(thm)],[86,9,theory(equality)])).
% cnf(104,plain,(mult(X1,X1)=mult(mult(X1,X1),ld(X1,X1))),inference(spm,[status(thm)],[88,9,theory(equality)])).
% cnf(109,plain,(ld(mult(X1,X1),mult(X1,X1))=ld(X1,X1)),inference(spm,[status(thm)],[11,104,theory(equality)])).
% cnf(114,plain,(rd(mult(X1,X1),X1)=mult(X1,mult(X1,rd(ld(X1,X1),X1)))),inference(spm,[status(thm)],[41,104,theory(equality)])).
% cnf(115,plain,(X1=mult(X1,mult(X1,rd(ld(X1,X1),X1)))),inference(rw,[status(thm)],[114,15,theory(equality)])).
% cnf(118,plain,(mult(ld(X1,X1),mult(X1,X1))=mult(X1,X1)),inference(spm,[status(thm)],[79,109,theory(equality)])).
% cnf(211,plain,(ld(X1,X1)=mult(X1,rd(ld(X1,X1),X1))),inference(spm,[status(thm)],[11,115,theory(equality)])).
% cnf(228,plain,(ld(X1,ld(X1,X1))=rd(ld(X1,X1),X1)),inference(spm,[status(thm)],[11,211,theory(equality)])).
% cnf(238,plain,(mult(ld(X1,ld(X1,X1)),X1)=ld(X1,X1)),inference(spm,[status(thm)],[13,228,theory(equality)])).
% cnf(271,plain,(ld(mult(X1,X2),mult(mult(X1,X3),X2))=mult(ld(X2,X3),X2)),inference(spm,[status(thm)],[11,37,theory(equality)])).
% cnf(382,plain,(ld(rd(X1,X2),rd(mult(X1,X3),X2))=mult(X2,rd(X3,X2))),inference(spm,[status(thm)],[11,51,theory(equality)])).
% cnf(395,plain,(mult(rd(X1,X2),mult(X2,X3))=rd(mult(X1,mult(X3,X2)),X2)),inference(spm,[status(thm)],[51,15,theory(equality)])).
% cnf(452,plain,(rd(mult(X1,X1),X1)=mult(rd(ld(X1,X1),X1),mult(X1,X1))),inference(spm,[status(thm)],[395,118,theory(equality)])).
% cnf(471,plain,(X1=mult(rd(ld(X1,X1),X1),mult(X1,X1))),inference(rw,[status(thm)],[452,15,theory(equality)])).
% cnf(472,plain,(X1=mult(ld(X1,ld(X1,X1)),mult(X1,X1))),inference(rw,[status(thm)],[471,228,theory(equality)])).
% cnf(474,plain,(rd(X1,mult(X1,X1))=ld(X1,ld(X1,X1))),inference(spm,[status(thm)],[15,472,theory(equality)])).
% cnf(494,plain,(mult(rd(X1,mult(X1,X1)),X1)=ld(X1,X1)),inference(rw,[status(thm)],[238,474,theory(equality)])).
% cnf(816,plain,(mult(ld(mult(X2,X2),X2),mult(X2,X2))=X2),inference(spm,[status(thm)],[33,271,theory(equality)])).
% cnf(834,plain,(ld(mult(X1,X2),mult(X3,X2))=mult(ld(X2,ld(X1,X3)),X2)),inference(spm,[status(thm)],[271,9,theory(equality)])).
% cnf(882,plain,(rd(X1,mult(X1,X1))=ld(mult(X1,X1),X1)),inference(spm,[status(thm)],[15,816,theory(equality)])).
% cnf(925,plain,(mult(ld(mult(X1,X1),X1),X1)=ld(X1,X1)),inference(rw,[status(thm)],[494,882,theory(equality)])).
% cnf(994,plain,(rd(ld(mult(X2,X1),mult(X3,X1)),X1)=ld(X1,ld(X2,X3))),inference(spm,[status(thm)],[15,834,theory(equality)])).
% cnf(1102,plain,(mult(ld(X1,X1),mult(ld(X1,X2),X1))=mult(mult(ld(mult(X1,X1),X1),X2),X1)),inference(spm,[status(thm)],[37,925,theory(equality)])).
% cnf(1400,plain,(ld(rd(X1,X2),rd(X3,X2))=mult(X2,rd(ld(X1,X3),X2))),inference(spm,[status(thm)],[382,9,theory(equality)])).
% cnf(1469,plain,(ld(rd(X1,X2),ld(X2,X2))=mult(X2,rd(ld(X1,X2),X2))),inference(spm,[status(thm)],[1400,72,theory(equality)])).
% cnf(2869,plain,(rd(mult(X1,X2),mult(X3,X2))=mult(rd(X1,mult(X2,X3)),X2)),inference(spm,[status(thm)],[15,38,theory(equality)])).
% cnf(3034,plain,(mult(rd(X1,mult(X2,X1)),X2)=ld(mult(X1,X2),mult(X1,X2))),inference(spm,[status(thm)],[72,2869,theory(equality)])).
% cnf(3153,plain,(rd(mult(rd(X1,mult(X2,X1)),X2),X2)=ld(X2,ld(X1,X1))),inference(spm,[status(thm)],[994,3034,theory(equality)])).
% cnf(3220,plain,(rd(X1,mult(X2,X1))=ld(X2,ld(X1,X1))),inference(rw,[status(thm)],[3153,15,theory(equality)])).
% cnf(3300,plain,(mult(X1,rd(X2,mult(X1,X2)))=ld(X2,X2)),inference(spm,[status(thm)],[9,3220,theory(equality)])).
% cnf(3340,plain,(rd(X2,X1)=mult(X2,rd(ld(X1,X2),X2))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1469,3220,theory(equality)]),13,theory(equality)])).
% cnf(3402,plain,(ld(X1,rd(X1,X2))=rd(ld(X2,X1),X1)),inference(spm,[status(thm)],[11,3340,theory(equality)])).
% cnf(3489,plain,(mult(ld(X2,rd(X2,X1)),X2)=ld(X1,X2)),inference(spm,[status(thm)],[13,3402,theory(equality)])).
% cnf(3504,plain,(rd(X2,X1)=ld(X1,rd(X1,rd(X1,X2)))),inference(spm,[status(thm)],[3402,22,theory(equality)])).
% cnf(3578,plain,(mult(rd(X1,X2),rd(X2,X1))=ld(X2,X2)),inference(spm,[status(thm)],[3300,13,theory(equality)])).
% cnf(3661,plain,(mult(ld(X1,rd(X1,X2)),rd(X1,ld(X2,X1)))=ld(X1,X1)),inference(spm,[status(thm)],[3300,3489,theory(equality)])).
% cnf(3705,plain,(mult(ld(X1,rd(X1,X2)),X2)=ld(X1,X1)),inference(rw,[status(thm)],[3661,23,theory(equality)])).
% cnf(3781,plain,(mult(X1,rd(X2,X1))=rd(X1,rd(X1,X2))),inference(spm,[status(thm)],[9,3504,theory(equality)])).
% cnf(3856,plain,(rd(ld(X1,X2),ld(X2,rd(X2,X1)))=mult(ld(X1,X2),rd(X2,ld(X1,X2)))),inference(spm,[status(thm)],[3781,3402,theory(equality)])).
% cnf(3874,plain,(rd(ld(X1,X2),ld(X2,rd(X2,X1)))=mult(ld(X1,X2),X1)),inference(rw,[status(thm)],[3856,23,theory(equality)])).
% cnf(3943,plain,(mult(rd(X1,ld(X2,X1)),ld(X1,rd(X1,X2)))=ld(ld(X2,X1),ld(X2,X1))),inference(spm,[status(thm)],[3578,3402,theory(equality)])).
% cnf(4040,plain,(mult(X2,ld(X1,rd(X1,X2)))=ld(ld(X2,X1),ld(X2,X1))),inference(rw,[status(thm)],[3943,23,theory(equality)])).
% cnf(4073,plain,(rd(ld(X1,X1),X2)=ld(X1,rd(X1,X2))),inference(spm,[status(thm)],[15,3705,theory(equality)])).
% cnf(4116,plain,(mult(ld(X1,X2),ld(X2,X1))=ld(X1,X1)),inference(spm,[status(thm)],[3705,23,theory(equality)])).
% cnf(4175,plain,(ld(mult(X1,X2),rd(mult(X1,X2),X2))=ld(X2,ld(X1,X1))),inference(spm,[status(thm)],[994,4073,theory(equality)])).
% cnf(4200,plain,(ld(mult(X1,X2),X1)=ld(X2,ld(X1,X1))),inference(rw,[status(thm)],[4175,15,theory(equality)])).
% cnf(4201,plain,(ld(mult(X1,X2),X1)=rd(X1,mult(X2,X1))),inference(rw,[status(thm)],[4200,3220,theory(equality)])).
% cnf(4253,plain,(rd(X1,ld(X2,X2))=ld(mult(X1,ld(X2,rd(X2,X1))),X1)),inference(spm,[status(thm)],[4201,3705,theory(equality)])).
% cnf(4260,plain,(ld(X1,ld(X2,X2))=ld(mult(X2,X1),X2)),inference(rw,[status(thm)],[3220,4201,theory(equality)])).
% cnf(4329,plain,(rd(ld(mult(X1,ld(X1,X1)),X1),X2)=ld(ld(X1,X1),rd(ld(X1,X1),X2))),inference(spm,[status(thm)],[4073,4260,theory(equality)])).
% cnf(4372,plain,(ld(X1,rd(X1,X2))=ld(ld(X1,X1),rd(ld(X1,X1),X2))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[4329,9,theory(equality)]),4073,theory(equality)])).
% cnf(4373,plain,(ld(X1,rd(X1,X2))=ld(ld(X1,X1),ld(X1,rd(X1,X2)))),inference(rw,[status(thm)],[4372,4073,theory(equality)])).
% cnf(12852,plain,(ld(ld(ld(X1,X2),ld(X1,X2)),ld(ld(X1,X2),mult(ld(X1,X2),X1)))=ld(ld(X1,X2),mult(ld(X1,X2),X1))),inference(spm,[status(thm)],[4373,3874,theory(equality)])).
% cnf(12919,plain,(rd(X1,ld(X2,X2))=ld(ld(X1,X2),mult(ld(X1,X2),X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[12852,4040,theory(equality)]),11,theory(equality)]),4253,theory(equality)])).
% cnf(12920,plain,(rd(X1,ld(X2,X2))=X1),inference(rw,[status(thm)],[12919,11,theory(equality)])).
% cnf(12952,plain,(mult(X1,ld(X2,X2))=X1),inference(spm,[status(thm)],[15,12920,theory(equality)])).
% cnf(13127,plain,(mult(ld(ld(X1,X1),ld(X1,X1)),ld(ld(X1,X1),X2))=mult(mult(ld(mult(ld(X1,X1),ld(X1,X1)),ld(X1,X1)),X2),ld(X1,X1))),inference(spm,[status(thm)],[1102,12952,theory(equality)])).
% cnf(13270,plain,(X2=mult(mult(ld(mult(ld(X1,X1),ld(X1,X1)),ld(X1,X1)),X2),ld(X1,X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[13127,3220,theory(equality)]),79,theory(equality)]),72,theory(equality)]),9,theory(equality)])).
% cnf(13271,plain,(X2=mult(ld(X1,X1),X2)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[13270,4116,theory(equality)]),3220,theory(equality)]),79,theory(equality)]),72,theory(equality)]),12952,theory(equality)])).
% cnf(13539,negated_conjecture,(mult(esk1_1(ld(X1,X1)),ld(X1,X1))!=esk1_1(ld(X1,X1))),inference(spm,[status(thm)],[21,13271,theory(equality)])).
% cnf(13659,negated_conjecture,($false),inference(rw,[status(thm)],[13539,12952,theory(equality)])).
% cnf(13660,negated_conjecture,($false),inference(cn,[status(thm)],[13659,theory(equality)])).
% cnf(13661,negated_conjecture,($false),13660,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 251
% # ...of these trivial : 77
% # ...subsumed : 0
% # ...remaining for further processing: 174
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 78
% # Generated clauses : 8281
% # ...of the previous two non-trivial : 6890
% # Contextual simplify-reflections : 0
% # Paramodulations : 8281
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 96
% # Positive orientable unit clauses: 95
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 0
% # Non-unit-clauses : 1
% # Current number of unprocessed clauses: 3917
% # ...number of literals in the above : 3917
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 266
% # Indexed BW rewrite successes : 68
% # Backwards rewriting index: 119 leaves, 2.03+/-1.761 terms/leaf
% # Paramod-from index: 81 leaves, 1.17+/-0.439 terms/leaf
% # Paramod-into index: 102 leaves, 1.76+/-1.496 terms/leaf
% # -------------------------------------------------
% # User time : 0.230 s
% # System time : 0.012 s
% # Total time : 0.242 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.53 CPU 0.63 WC
% FINAL PrfWatch: 0.53 CPU 0.63 WC
% SZS output end Solution for /tmp/SystemOnTPTP17578/GRP659+1.tptp
%
%------------------------------------------------------------------------------