TSTP Solution File: GRP657+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GRP657+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:14 EST 2010
% Result : Theorem 1.05s
% Output : Solution 1.05s
% 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/SystemOnTPTP17319/GRP657+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP17319/GRP657+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP17319/GRP657+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 17415
% 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(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,X1),mult(X3,X2))=mult(X2,mult(mult(X1,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(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,X5),mult(X4,X6))=mult(X6,mult(mult(X5,X4),X6)),inference(variable_rename,[status(thm)],[5])).
% cnf(17,plain,(mult(mult(X1,X2),mult(X3,X1))=mult(X1,mult(mult(X2,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(39,plain,(mult(X2,mult(X3,X1))=mult(X1,mult(mult(ld(X1,X2),X3),X1))),inference(spm,[status(thm)],[17,9,theory(equality)])).
% cnf(63,plain,(ld(X1,mult(X2,mult(X3,X1)))=mult(mult(ld(X1,X2),X3),X1)),inference(spm,[status(thm)],[11,39,theory(equality)])).
% cnf(81,plain,(mult(mult(ld(X1,X1),X2),X1)=mult(X2,X1)),inference(spm,[status(thm)],[11,63,theory(equality)])).
% cnf(101,plain,(rd(mult(X2,X1),X1)=mult(ld(X1,X1),X2)),inference(spm,[status(thm)],[15,81,theory(equality)])).
% cnf(113,plain,(X2=mult(ld(X1,X1),X2)),inference(rw,[status(thm)],[101,15,theory(equality)])).
% cnf(126,plain,(rd(X2,X2)=ld(X1,X1)),inference(spm,[status(thm)],[15,113,theory(equality)])).
% cnf(152,plain,(mult(X1,rd(X2,X2))=X1),inference(spm,[status(thm)],[9,126,theory(equality)])).
% cnf(155,plain,(mult(rd(X3,X3),X2)=X2),inference(spm,[status(thm)],[113,126,theory(equality)])).
% cnf(196,negated_conjecture,(mult(esk1_1(rd(X1,X1)),rd(X1,X1))!=esk1_1(rd(X1,X1))),inference(spm,[status(thm)],[21,155,theory(equality)])).
% cnf(211,negated_conjecture,($false),inference(rw,[status(thm)],[196,152,theory(equality)])).
% cnf(212,negated_conjecture,($false),inference(cn,[status(thm)],[211,theory(equality)])).
% cnf(213,negated_conjecture,($false),212,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 20
% # ...of these trivial : 1
% # ...subsumed : 0
% # ...remaining for further processing: 19
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 139
% # ...of the previous two non-trivial : 101
% # Contextual simplify-reflections : 0
% # Paramodulations : 139
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 18
% # Positive orientable unit clauses: 16
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 0
% # Non-unit-clauses : 1
% # Current number of unprocessed clauses: 76
% # ...number of literals in the above : 76
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 3
% # Rewrite failures with RHS unbound : 3
% # Indexed BW rewrite attempts : 20
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 24 leaves, 1.58+/-0.954 terms/leaf
% # Paramod-from index: 16 leaves, 1.12+/-0.331 terms/leaf
% # Paramod-into index: 23 leaves, 1.48+/-0.878 terms/leaf
% # -------------------------------------------------
% # User time : 0.012 s
% # System time : 0.003 s
% # Total time : 0.015 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.20 WC
% FINAL PrfWatch: 0.11 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP17319/GRP657+1.tptp
%
%------------------------------------------------------------------------------