TSTP Solution File: GRP702+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GRP702+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 : art04.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:20:16 EST 2010
% Result : Theorem 0.88s
% Output : Solution 0.88s
% 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/SystemOnTPTP5559/GRP702+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP5559/GRP702+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP5559/GRP702+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 5655
% 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(2, axiom,![X1]:![X2]:ld(X2,mult(X2,X1))=X1,file('/tmp/SRASS.s.p', f02)).
% fof(3, axiom,![X1]:![X2]:mult(op_c,mult(X2,X1))=mult(mult(op_c,X2),X1),file('/tmp/SRASS.s.p', f08)).
% fof(4, axiom,![X1]:![X2]:mult(X2,mult(X1,op_c))=mult(mult(X2,X1),op_c),file('/tmp/SRASS.s.p', f09)).
% fof(5, axiom,![X1]:![X2]:mult(X2,mult(op_c,X1))=mult(mult(X2,op_c),X1),file('/tmp/SRASS.s.p', f10)).
% fof(6, axiom,![X2]:op_d=ld(X2,mult(op_c,X2)),file('/tmp/SRASS.s.p', f11)).
% fof(14, conjecture,![X4]:![X5]:((mult(op_d,mult(X4,X5))=mult(mult(op_d,X4),X5)&mult(X4,mult(X5,op_d))=mult(mult(X4,X5),op_d))&mult(X4,mult(op_d,X5))=mult(mult(X4,op_d),X5)),file('/tmp/SRASS.s.p', goals)).
% fof(15, negated_conjecture,~(![X4]:![X5]:((mult(op_d,mult(X4,X5))=mult(mult(op_d,X4),X5)&mult(X4,mult(X5,op_d))=mult(mult(X4,X5),op_d))&mult(X4,mult(op_d,X5))=mult(mult(X4,op_d),X5))),inference(assume_negation,[status(cth)],[14])).
% fof(18, plain,![X3]:![X4]:ld(X4,mult(X4,X3))=X3,inference(variable_rename,[status(thm)],[2])).
% cnf(19,plain,(ld(X1,mult(X1,X2))=X2),inference(split_conjunct,[status(thm)],[18])).
% fof(20, plain,![X3]:![X4]:mult(op_c,mult(X4,X3))=mult(mult(op_c,X4),X3),inference(variable_rename,[status(thm)],[3])).
% cnf(21,plain,(mult(op_c,mult(X1,X2))=mult(mult(op_c,X1),X2)),inference(split_conjunct,[status(thm)],[20])).
% fof(22, plain,![X3]:![X4]:mult(X4,mult(X3,op_c))=mult(mult(X4,X3),op_c),inference(variable_rename,[status(thm)],[4])).
% cnf(23,plain,(mult(X1,mult(X2,op_c))=mult(mult(X1,X2),op_c)),inference(split_conjunct,[status(thm)],[22])).
% fof(24, plain,![X3]:![X4]:mult(X4,mult(op_c,X3))=mult(mult(X4,op_c),X3),inference(variable_rename,[status(thm)],[5])).
% cnf(25,plain,(mult(X1,mult(op_c,X2))=mult(mult(X1,op_c),X2)),inference(split_conjunct,[status(thm)],[24])).
% fof(26, plain,![X3]:op_d=ld(X3,mult(op_c,X3)),inference(variable_rename,[status(thm)],[6])).
% cnf(27,plain,(op_d=ld(X1,mult(op_c,X1))),inference(split_conjunct,[status(thm)],[26])).
% fof(42, negated_conjecture,?[X4]:?[X5]:((~(mult(op_d,mult(X4,X5))=mult(mult(op_d,X4),X5))|~(mult(X4,mult(X5,op_d))=mult(mult(X4,X5),op_d)))|~(mult(X4,mult(op_d,X5))=mult(mult(X4,op_d),X5))),inference(fof_nnf,[status(thm)],[15])).
% fof(43, negated_conjecture,?[X6]:?[X7]:((~(mult(op_d,mult(X6,X7))=mult(mult(op_d,X6),X7))|~(mult(X6,mult(X7,op_d))=mult(mult(X6,X7),op_d)))|~(mult(X6,mult(op_d,X7))=mult(mult(X6,op_d),X7))),inference(variable_rename,[status(thm)],[42])).
% fof(44, negated_conjecture,((~(mult(op_d,mult(esk1_0,esk2_0))=mult(mult(op_d,esk1_0),esk2_0))|~(mult(esk1_0,mult(esk2_0,op_d))=mult(mult(esk1_0,esk2_0),op_d)))|~(mult(esk1_0,mult(op_d,esk2_0))=mult(mult(esk1_0,op_d),esk2_0))),inference(skolemize,[status(esa)],[43])).
% cnf(45,negated_conjecture,(mult(esk1_0,mult(op_d,esk2_0))!=mult(mult(esk1_0,op_d),esk2_0)|mult(esk1_0,mult(esk2_0,op_d))!=mult(mult(esk1_0,esk2_0),op_d)|mult(op_d,mult(esk1_0,esk2_0))!=mult(mult(op_d,esk1_0),esk2_0)),inference(split_conjunct,[status(thm)],[44])).
% cnf(47,plain,(op_c=op_d),inference(spm,[status(thm)],[27,19,theory(equality)])).
% cnf(193,negated_conjecture,(mult(op_c,mult(esk1_0,esk2_0))!=mult(op_d,mult(esk1_0,esk2_0))|mult(mult(esk1_0,op_d),esk2_0)!=mult(esk1_0,mult(op_d,esk2_0))|mult(mult(esk1_0,esk2_0),op_d)!=mult(esk1_0,mult(esk2_0,op_d))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[45,47,theory(equality)]),21,theory(equality)])).
% cnf(194,negated_conjecture,($false|mult(mult(esk1_0,op_d),esk2_0)!=mult(esk1_0,mult(op_d,esk2_0))|mult(mult(esk1_0,esk2_0),op_d)!=mult(esk1_0,mult(esk2_0,op_d))),inference(rw,[status(thm)],[193,47,theory(equality)])).
% cnf(195,negated_conjecture,($false|mult(esk1_0,mult(op_c,esk2_0))!=mult(esk1_0,mult(op_d,esk2_0))|mult(mult(esk1_0,esk2_0),op_d)!=mult(esk1_0,mult(esk2_0,op_d))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[194,47,theory(equality)]),25,theory(equality)])).
% cnf(196,negated_conjecture,($false|$false|mult(mult(esk1_0,esk2_0),op_d)!=mult(esk1_0,mult(esk2_0,op_d))),inference(rw,[status(thm)],[195,47,theory(equality)])).
% cnf(197,negated_conjecture,($false|$false|mult(esk1_0,mult(esk2_0,op_c))!=mult(esk1_0,mult(esk2_0,op_d))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[196,47,theory(equality)]),23,theory(equality)])).
% cnf(198,negated_conjecture,($false|$false|$false),inference(rw,[status(thm)],[197,47,theory(equality)])).
% cnf(199,negated_conjecture,($false),inference(cn,[status(thm)],[198,theory(equality)])).
% cnf(200,negated_conjecture,($false),199,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 15
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 15
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 2
% # Generated clauses : 101
% # ...of the previous two non-trivial : 87
% # Contextual simplify-reflections : 0
% # Paramodulations : 101
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 13
% # Positive orientable unit clauses: 13
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 0
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 82
% # ...number of literals in the above : 82
% # 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 : 2
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 32 leaves, 1.09+/-0.291 terms/leaf
% # Paramod-from index: 13 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 25 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.010 s
% # System time : 0.003 s
% # Total time : 0.013 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.17 WC
% FINAL PrfWatch: 0.10 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP5559/GRP702+1.tptp
%
%------------------------------------------------------------------------------