TSTP Solution File: GRP660+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GRP660+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 : 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:38 EST 2010
% Result : Theorem 1.38s
% Output : Solution 1.38s
% 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/SystemOnTPTP6913/GRP660+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP6913/GRP660+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP6913/GRP660+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 7009
% 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]:![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(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(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(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(32,plain,(ld(mult(mult(X1,X2),X3),mult(X1,mult(X2,mult(X3,X1))))=X1),inference(spm,[status(thm)],[11,17,theory(equality)])).
% cnf(33,plain,(rd(mult(X1,mult(X2,mult(X3,X1))),X1)=mult(mult(X1,X2),X3)),inference(spm,[status(thm)],[15,17,theory(equality)])).
% cnf(36,plain,(mult(mult(X1,X3),rd(X1,X2))=mult(rd(X1,X2),mult(X2,mult(X3,rd(X1,X2))))),inference(spm,[status(thm)],[17,13,theory(equality)])).
% cnf(37,plain,(mult(mult(X2,X3),X1)=mult(X1,mult(ld(X1,X2),mult(X3,X1)))),inference(spm,[status(thm)],[17,9,theory(equality)])).
% cnf(41,plain,(rd(mult(X1,mult(X2,X3)),X1)=mult(mult(X1,X2),rd(X3,X1))),inference(spm,[status(thm)],[33,13,theory(equality)])).
% cnf(50,plain,(rd(mult(X1,X2),X1)=mult(mult(X1,rd(X2,X3)),rd(X3,X1))),inference(spm,[status(thm)],[41,13,theory(equality)])).
% cnf(52,plain,(rd(mult(X1,X3),X1)=mult(mult(X1,X2),rd(ld(X2,X3),X1))),inference(spm,[status(thm)],[41,9,theory(equality)])).
% cnf(59,plain,(ld(X1,mult(mult(X2,X3),X1))=mult(ld(X1,X2),mult(X3,X1))),inference(spm,[status(thm)],[11,37,theory(equality)])).
% cnf(65,plain,(mult(X1,mult(ld(X1,X2),X3))=mult(mult(X2,rd(X3,X1)),X1)),inference(spm,[status(thm)],[37,13,theory(equality)])).
% cnf(78,plain,(ld(X1,mult(X2,X1))=mult(ld(X1,rd(X2,X3)),mult(X3,X1))),inference(spm,[status(thm)],[59,13,theory(equality)])).
% cnf(81,plain,(ld(X1,mult(X3,X1))=mult(ld(X1,X2),mult(ld(X2,X3),X1))),inference(spm,[status(thm)],[59,9,theory(equality)])).
% cnf(115,plain,(rd(rd(mult(X1,X2),X1),rd(X3,X1))=mult(X1,rd(X2,X3))),inference(spm,[status(thm)],[15,50,theory(equality)])).
% cnf(126,plain,(mult(mult(ld(X1,X2),rd(X3,X2)),X1)=rd(mult(ld(X1,X2),X3),ld(X1,X2))),inference(spm,[status(thm)],[50,23,theory(equality)])).
% cnf(140,plain,(ld(mult(X1,X2),rd(mult(X1,X3),X1))=rd(ld(X2,X3),X1)),inference(spm,[status(thm)],[11,52,theory(equality)])).
% cnf(169,plain,(rd(ld(X1,mult(X2,X1)),mult(X3,X1))=ld(X1,rd(X2,X3))),inference(spm,[status(thm)],[15,78,theory(equality)])).
% cnf(193,plain,(ld(ld(X1,X2),ld(X1,mult(X3,X1)))=mult(ld(X2,X3),X1)),inference(spm,[status(thm)],[11,81,theory(equality)])).
% cnf(238,plain,(rd(X1,rd(X2,X1))=mult(X1,rd(X1,X2))),inference(spm,[status(thm)],[115,15,theory(equality)])).
% cnf(243,plain,(ld(mult(X1,rd(X1,X2)),X1)=rd(X2,X1)),inference(spm,[status(thm)],[22,238,theory(equality)])).
% cnf(252,plain,(rd(X1,X2)=mult(X1,rd(X1,mult(X2,X1)))),inference(spm,[status(thm)],[238,15,theory(equality)])).
% cnf(266,plain,(ld(mult(X1,X2),X1)=rd(ld(X2,X1),X1)),inference(spm,[status(thm)],[243,23,theory(equality)])).
% cnf(269,plain,(mult(ld(mult(X2,X1),X2),X2)=ld(X1,X2)),inference(spm,[status(thm)],[13,266,theory(equality)])).
% cnf(318,plain,(ld(X1,rd(X1,X2))=rd(X1,mult(X2,X1))),inference(spm,[status(thm)],[11,252,theory(equality)])).
% cnf(666,plain,(rd(ld(X2,X2),X1)=rd(mult(X1,X2),mult(X1,mult(X1,X2)))),inference(spm,[status(thm)],[318,140,theory(equality)])).
% cnf(784,plain,(rd(ld(X1,mult(X2,X1)),X3)=ld(X1,rd(X2,rd(X3,X1)))),inference(spm,[status(thm)],[169,13,theory(equality)])).
% cnf(916,plain,(ld(ld(X1,X2),ld(X1,X3))=mult(ld(X2,rd(X3,X1)),X1)),inference(spm,[status(thm)],[193,13,theory(equality)])).
% cnf(2192,plain,(rd(mult(ld(X1,X1),X1),ld(X1,mult(X1,X1)))=rd(ld(X1,X1),ld(X1,X1))),inference(spm,[status(thm)],[666,81,theory(equality)])).
% cnf(2230,plain,(ld(X1,X1)=rd(ld(X1,X1),ld(X1,X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[2192,11,theory(equality)]),15,theory(equality)])).
% cnf(2237,plain,(mult(ld(X1,X1),ld(X1,X1))=ld(X1,X1)),inference(spm,[status(thm)],[13,2230,theory(equality)])).
% cnf(2238,plain,(ld(ld(X1,X1),ld(X1,X1))=ld(X1,X1)),inference(spm,[status(thm)],[22,2230,theory(equality)])).
% cnf(2259,plain,(mult(rd(X1,mult(X1,X1)),X1)=ld(X1,X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[2238,916,theory(equality)]),318,theory(equality)])).
% cnf(2377,plain,(rd(ld(X1,X1),X1)=rd(X1,mult(X1,X1))),inference(spm,[status(thm)],[15,2259,theory(equality)])).
% cnf(2412,plain,(ld(mult(X1,X1),X1)=rd(X1,mult(X1,X1))),inference(rw,[status(thm)],[2377,266,theory(equality)])).
% cnf(2430,plain,(mult(ld(mult(X1,X1),X1),mult(X1,X1))=X1),inference(spm,[status(thm)],[13,2412,theory(equality)])).
% cnf(2719,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)],[41,2430,theory(equality)])).
% cnf(2746,plain,(mult(X1,X1)=mult(mult(ld(mult(X1,X1),X1),X1),rd(X1,ld(mult(X1,X1),X1)))),inference(rw,[status(thm)],[2719,23,theory(equality)])).
% cnf(2747,plain,(mult(X1,X1)=mult(ld(X1,X1),mult(X1,X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[2746,269,theory(equality)]),23,theory(equality)])).
% cnf(2792,plain,(mult(X1,mult(X1,X1))=mult(mult(X1,X1),X1)),inference(spm,[status(thm)],[37,2747,theory(equality)])).
% cnf(2825,plain,(rd(mult(X1,mult(X1,X1)),X1)=mult(X1,X1)),inference(spm,[status(thm)],[15,2792,theory(equality)])).
% cnf(2864,plain,(mult(mult(X1,X1),rd(X1,X1))=mult(X1,X1)),inference(rw,[status(thm)],[2825,41,theory(equality)])).
% cnf(2959,plain,(ld(mult(X1,X1),mult(X1,X1))=rd(X1,X1)),inference(spm,[status(thm)],[11,2864,theory(equality)])).
% cnf(3046,plain,(mult(rd(X1,X1),rd(X1,X1))=rd(X1,X1)),inference(spm,[status(thm)],[2237,2959,theory(equality)])).
% cnf(3514,plain,(mult(rd(X1,X1),mult(X1,rd(X1,X1)))=mult(mult(X1,rd(X1,X1)),rd(X1,X1))),inference(spm,[status(thm)],[36,3046,theory(equality)])).
% cnf(3575,plain,(mult(rd(X1,X1),mult(X1,rd(X1,X1)))=X1),inference(rw,[status(thm)],[inference(rw,[status(thm)],[3514,50,theory(equality)]),15,theory(equality)])).
% cnf(3710,plain,(ld(mult(mult(rd(X1,X1),rd(X1,X1)),X1),mult(rd(X1,X1),X1))=rd(X1,X1)),inference(spm,[status(thm)],[32,3575,theory(equality)])).
% cnf(3743,plain,(ld(X1,X1)=rd(X1,X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[3710,3046,theory(equality)]),13,theory(equality)]),13,theory(equality)])).
% cnf(3772,plain,(ld(X1,ld(X1,X1))=rd(X1,mult(X1,X1))),inference(spm,[status(thm)],[318,3743,theory(equality)])).
% cnf(3776,plain,(ld(X1,rd(X2,ld(X1,X1)))=rd(ld(X1,mult(X2,X1)),X1)),inference(spm,[status(thm)],[784,3743,theory(equality)])).
% cnf(3783,plain,(mult(ld(X1,X1),X1)=X1),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[3575,3743,theory(equality)]),3743,theory(equality)]),9,theory(equality)])).
% cnf(3811,plain,(ld(X1,ld(X1,X1))=ld(mult(X1,X1),X1)),inference(rw,[status(thm)],[3772,2412,theory(equality)])).
% cnf(3830,plain,(ld(X1,rd(mult(ld(X1,X1),X2),ld(X1,X1)))=rd(ld(X1,X2),ld(X1,X1))),inference(spm,[status(thm)],[140,3783,theory(equality)])).
% cnf(3872,plain,(mult(ld(X1,ld(X1,X1)),X2)=rd(ld(X1,X2),ld(X1,X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[3830,126,theory(equality)]),65,theory(equality)]),11,theory(equality)])).
% cnf(5208,plain,(rd(ld(X1,X2),ld(X1,X1))=mult(ld(mult(X1,X1),X1),X2)),inference(rw,[status(thm)],[3872,3811,theory(equality)])).
% cnf(5266,plain,(rd(X2,ld(X1,X1))=mult(ld(mult(X1,X1),X1),mult(X1,X2))),inference(spm,[status(thm)],[5208,11,theory(equality)])).
% cnf(11655,plain,(mult(ld(ld(X1,X1),ld(X1,X1)),mult(ld(X1,X1),X2))=rd(X2,ld(ld(X1,X1),ld(X1,X1)))),inference(spm,[status(thm)],[5266,2237,theory(equality)])).
% cnf(11714,plain,(mult(ld(X1,X1),mult(ld(X1,X1),X2))=rd(X2,ld(ld(X1,X1),ld(X1,X1)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[11655,916,theory(equality)]),318,theory(equality)]),2412,theory(equality)]),269,theory(equality)])).
% cnf(11715,plain,(mult(ld(X1,X1),mult(ld(X1,X1),X2))=rd(X2,ld(X1,X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[11714,916,theory(equality)]),318,theory(equality)]),2412,theory(equality)]),269,theory(equality)])).
% cnf(13734,plain,(ld(mult(mult(ld(X1,X1),ld(X1,X1)),X2),rd(mult(X2,ld(X1,X1)),ld(X1,X1)))=ld(X1,X1)),inference(spm,[status(thm)],[32,11715,theory(equality)])).
% cnf(13819,plain,(ld(mult(ld(X1,X1),X2),X2)=ld(X1,X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[13734,2237,theory(equality)]),15,theory(equality)])).
% cnf(13920,plain,(rd(X1,ld(X2,X2))=mult(ld(X2,X2),X1)),inference(spm,[status(thm)],[23,13819,theory(equality)])).
% cnf(13964,plain,(ld(X2,ld(ld(X1,X1),X2))=ld(X1,X1)),inference(spm,[status(thm)],[13819,9,theory(equality)])).
% cnf(14100,plain,(ld(X1,mult(ld(X1,X1),X2))=rd(ld(X1,mult(X2,X1)),X1)),inference(rw,[status(thm)],[3776,13920,theory(equality)])).
% cnf(14339,plain,(mult(X1,ld(X2,X2))=ld(ld(X2,X2),X1)),inference(spm,[status(thm)],[9,13964,theory(equality)])).
% cnf(14904,plain,(rd(mult(mult(X2,ld(X1,X1)),ld(X1,X1)),ld(X1,X1))=ld(ld(X1,X1),mult(ld(ld(X1,X1),ld(X1,X1)),X2))),inference(spm,[status(thm)],[14100,14339,theory(equality)])).
% cnf(14988,plain,(mult(X2,ld(X1,X1))=ld(ld(X1,X1),mult(ld(ld(X1,X1),ld(X1,X1)),X2))),inference(rw,[status(thm)],[14904,15,theory(equality)])).
% cnf(14989,plain,(mult(X2,ld(X1,X1))=X2),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[14988,916,theory(equality)]),318,theory(equality)]),2412,theory(equality)]),269,theory(equality)]),11,theory(equality)])).
% cnf(15287,plain,(rd(X1,ld(X2,X2))=X1),inference(spm,[status(thm)],[13,14989,theory(equality)])).
% cnf(15423,plain,(mult(ld(X2,X2),X1)=X1),inference(rw,[status(thm)],[15287,13920,theory(equality)])).
% cnf(15765,negated_conjecture,(mult(esk1_1(ld(X1,X1)),ld(X1,X1))!=esk1_1(ld(X1,X1))),inference(spm,[status(thm)],[21,15423,theory(equality)])).
% cnf(15931,negated_conjecture,($false),inference(rw,[status(thm)],[15765,14989,theory(equality)])).
% cnf(15932,negated_conjecture,($false),inference(cn,[status(thm)],[15931,theory(equality)])).
% cnf(15933,negated_conjecture,($false),15932,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 289
% # ...of these trivial : 119
% # ...subsumed : 0
% # ...remaining for further processing: 170
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 52
% # Generated clauses : 10101
% # ...of the previous two non-trivial : 8567
% # Contextual simplify-reflections : 0
% # Paramodulations : 10101
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 118
% # Positive orientable unit clauses: 117
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 0
% # Non-unit-clauses : 1
% # Current number of unprocessed clauses: 5563
% # ...number of literals in the above : 5563
% # 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 : 328
% # Indexed BW rewrite successes : 37
% # Backwards rewriting index: 148 leaves, 2.05+/-1.819 terms/leaf
% # Paramod-from index: 105 leaves, 1.11+/-0.318 terms/leaf
% # Paramod-into index: 123 leaves, 1.82+/-1.471 terms/leaf
% # -------------------------------------------------
% # User time : 0.274 s
% # System time : 0.018 s
% # Total time : 0.292 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.60 CPU 0.69 WC
% FINAL PrfWatch: 0.60 CPU 0.69 WC
% SZS output end Solution for /tmp/SystemOnTPTP6913/GRP660+1.tptp
%
%------------------------------------------------------------------------------