TSTP Solution File: GRP665+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GRP665+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:18:06 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/SystemOnTPTP17840/GRP665+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP17840/GRP665+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP17840/GRP665+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 17936
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 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]:mult(op_c,X1)=mult(X1,op_c),file('/tmp/SRASS.s.p', f09)).
% fof(3, axiom,![X2]:![X1]:ld(X1,mult(X1,X2))=X2,file('/tmp/SRASS.s.p', f02)).
% fof(5, axiom,![X2]:![X1]:rd(mult(X1,X2),X2)=X1,file('/tmp/SRASS.s.p', f04)).
% fof(8, axiom,![X3]:![X2]:![X1]:mult(X1,mult(X2,X3))=mult(rd(mult(X1,X2),X1),mult(X1,X3)),file('/tmp/SRASS.s.p', f07)).
% fof(9, axiom,![X3]:![X2]:![X1]:mult(mult(X1,X2),X3)=mult(mult(X1,X3),ld(X3,mult(X2,X3))),file('/tmp/SRASS.s.p', f08)).
% fof(10, conjecture,![X4]:![X5]:((mult(op_c,mult(X4,X5))=mult(mult(op_c,X4),X5)&mult(mult(X4,op_c),X5)=mult(X4,mult(op_c,X5)))&mult(mult(X4,X5),op_c)=mult(X4,mult(X5,op_c))),file('/tmp/SRASS.s.p', goals)).
% fof(11, negated_conjecture,~(![X4]:![X5]:((mult(op_c,mult(X4,X5))=mult(mult(op_c,X4),X5)&mult(mult(X4,op_c),X5)=mult(X4,mult(op_c,X5)))&mult(mult(X4,X5),op_c)=mult(X4,mult(X5,op_c)))),inference(assume_negation,[status(cth)],[10])).
% fof(12, plain,![X2]:mult(op_c,X2)=mult(X2,op_c),inference(variable_rename,[status(thm)],[1])).
% cnf(13,plain,(mult(op_c,X1)=mult(X1,op_c)),inference(split_conjunct,[status(thm)],[12])).
% fof(16, plain,![X3]:![X4]:ld(X4,mult(X4,X3))=X3,inference(variable_rename,[status(thm)],[3])).
% cnf(17,plain,(ld(X1,mult(X1,X2))=X2),inference(split_conjunct,[status(thm)],[16])).
% fof(20, plain,![X3]:![X4]:rd(mult(X4,X3),X3)=X4,inference(variable_rename,[status(thm)],[5])).
% cnf(21,plain,(rd(mult(X1,X2),X2)=X1),inference(split_conjunct,[status(thm)],[20])).
% fof(26, plain,![X4]:![X5]:![X6]:mult(X6,mult(X5,X4))=mult(rd(mult(X6,X5),X6),mult(X6,X4)),inference(variable_rename,[status(thm)],[8])).
% cnf(27,plain,(mult(X1,mult(X2,X3))=mult(rd(mult(X1,X2),X1),mult(X1,X3))),inference(split_conjunct,[status(thm)],[26])).
% fof(28, plain,![X4]:![X5]:![X6]:mult(mult(X6,X5),X4)=mult(mult(X6,X4),ld(X4,mult(X5,X4))),inference(variable_rename,[status(thm)],[9])).
% cnf(29,plain,(mult(mult(X1,X2),X3)=mult(mult(X1,X3),ld(X3,mult(X2,X3)))),inference(split_conjunct,[status(thm)],[28])).
% fof(30, negated_conjecture,?[X4]:?[X5]:((~(mult(op_c,mult(X4,X5))=mult(mult(op_c,X4),X5))|~(mult(mult(X4,op_c),X5)=mult(X4,mult(op_c,X5))))|~(mult(mult(X4,X5),op_c)=mult(X4,mult(X5,op_c)))),inference(fof_nnf,[status(thm)],[11])).
% fof(31, negated_conjecture,?[X6]:?[X7]:((~(mult(op_c,mult(X6,X7))=mult(mult(op_c,X6),X7))|~(mult(mult(X6,op_c),X7)=mult(X6,mult(op_c,X7))))|~(mult(mult(X6,X7),op_c)=mult(X6,mult(X7,op_c)))),inference(variable_rename,[status(thm)],[30])).
% fof(32, negated_conjecture,((~(mult(op_c,mult(esk1_0,esk2_0))=mult(mult(op_c,esk1_0),esk2_0))|~(mult(mult(esk1_0,op_c),esk2_0)=mult(esk1_0,mult(op_c,esk2_0))))|~(mult(mult(esk1_0,esk2_0),op_c)=mult(esk1_0,mult(esk2_0,op_c)))),inference(skolemize,[status(esa)],[31])).
% cnf(33,negated_conjecture,(mult(mult(esk1_0,esk2_0),op_c)!=mult(esk1_0,mult(esk2_0,op_c))|mult(mult(esk1_0,op_c),esk2_0)!=mult(esk1_0,mult(op_c,esk2_0))|mult(op_c,mult(esk1_0,esk2_0))!=mult(mult(op_c,esk1_0),esk2_0)),inference(split_conjunct,[status(thm)],[32])).
% cnf(34,negated_conjecture,(mult(mult(op_c,esk1_0),esk2_0)!=mult(op_c,mult(esk1_0,esk2_0))|mult(mult(op_c,esk1_0),esk2_0)!=mult(esk1_0,mult(op_c,esk2_0))|mult(mult(esk1_0,esk2_0),op_c)!=mult(esk1_0,mult(esk2_0,op_c))),inference(rw,[status(thm)],[33,13,theory(equality)])).
% cnf(35,negated_conjecture,(mult(mult(op_c,esk1_0),esk2_0)!=mult(op_c,mult(esk1_0,esk2_0))|mult(mult(op_c,esk1_0),esk2_0)!=mult(esk1_0,mult(op_c,esk2_0))|mult(op_c,mult(esk1_0,esk2_0))!=mult(esk1_0,mult(esk2_0,op_c))),inference(rw,[status(thm)],[34,13,theory(equality)])).
% cnf(36,negated_conjecture,(mult(mult(op_c,esk1_0),esk2_0)!=mult(op_c,mult(esk1_0,esk2_0))|mult(mult(op_c,esk1_0),esk2_0)!=mult(esk1_0,mult(op_c,esk2_0))|mult(op_c,mult(esk1_0,esk2_0))!=mult(esk1_0,mult(op_c,esk2_0))),inference(rw,[status(thm)],[35,13,theory(equality)])).
% cnf(58,plain,(mult(mult(X1,X2),ld(X2,mult(X2,op_c)))=mult(mult(X1,op_c),X2)),inference(spm,[status(thm)],[29,13,theory(equality)])).
% cnf(69,plain,(mult(mult(X1,X2),op_c)=mult(mult(X1,op_c),X2)),inference(rw,[status(thm)],[58,17,theory(equality)])).
% cnf(93,plain,(mult(rd(mult(X1,op_c),op_c),mult(op_c,X2))=mult(op_c,mult(X1,X2))),inference(spm,[status(thm)],[27,13,theory(equality)])).
% cnf(103,plain,(mult(X1,mult(op_c,X2))=mult(op_c,mult(X1,X2))),inference(rw,[status(thm)],[93,21,theory(equality)])).
% cnf(216,plain,(mult(op_c,mult(X1,X2))=mult(mult(X1,op_c),X2)),inference(rw,[status(thm)],[69,13,theory(equality)])).
% cnf(232,plain,(mult(mult(op_c,X1),X2)=mult(op_c,mult(X1,X2))),inference(spm,[status(thm)],[216,13,theory(equality)])).
% cnf(264,negated_conjecture,($false|mult(mult(op_c,esk1_0),esk2_0)!=mult(esk1_0,mult(op_c,esk2_0))|mult(esk1_0,mult(op_c,esk2_0))!=mult(op_c,mult(esk1_0,esk2_0))),inference(rw,[status(thm)],[36,232,theory(equality)])).
% cnf(265,negated_conjecture,($false|mult(op_c,mult(esk1_0,esk2_0))!=mult(esk1_0,mult(op_c,esk2_0))|mult(esk1_0,mult(op_c,esk2_0))!=mult(op_c,mult(esk1_0,esk2_0))),inference(rw,[status(thm)],[264,232,theory(equality)])).
% cnf(266,negated_conjecture,(mult(op_c,mult(esk1_0,esk2_0))!=mult(esk1_0,mult(op_c,esk2_0))|mult(esk1_0,mult(op_c,esk2_0))!=mult(op_c,mult(esk1_0,esk2_0))),inference(cn,[status(thm)],[265,theory(equality)])).
% cnf(267,negated_conjecture,(mult(esk1_0,mult(op_c,esk2_0))!=mult(op_c,mult(esk1_0,esk2_0))),inference(cn,[status(thm)],[266,theory(equality)])).
% cnf(436,negated_conjecture,($false),inference(rw,[status(thm)],[267,103,theory(equality)])).
% cnf(437,negated_conjecture,($false),inference(cn,[status(thm)],[436,theory(equality)])).
% cnf(438,negated_conjecture,($false),437,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 55
% # ...of these trivial : 6
% # ...subsumed : 14
% # ...remaining for further processing: 35
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 9
% # Generated clauses : 250
% # ...of the previous two non-trivial : 105
% # Contextual simplify-reflections : 0
% # Paramodulations : 250
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 26
% # Positive orientable unit clauses: 24
% # Positive unorientable unit clauses: 2
% # Negative unit clauses : 0
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 51
% # ...number of literals in the above : 51
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 4
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 37
% # Indexed BW rewrite successes : 25
% # Backwards rewriting index: 36 leaves, 1.33+/-0.707 terms/leaf
% # Paramod-from index: 27 leaves, 1.04+/-0.189 terms/leaf
% # Paramod-into index: 34 leaves, 1.32+/-0.629 terms/leaf
% # -------------------------------------------------
% # User time : 0.011 s
% # System time : 0.005 s
% # Total time : 0.016 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.21 WC
% FINAL PrfWatch: 0.12 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP17840/GRP665+1.tptp
%
%------------------------------------------------------------------------------