TSTP Solution File: GRP715+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GRP715+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 : art02.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:21:22 EST 2010
% Result : Theorem 3.83s
% Output : Solution 3.83s
% 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/SystemOnTPTP2416/GRP715+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP2416/GRP715+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP2416/GRP715+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 2512
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 1.93 CPU 2.02 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:mult(mult(mult(X3,X2),X1),X2)=mult(X3,mult(mult(X2,X1),X2)),file('/tmp/SRASS.s.p', f06)).
% fof(2, axiom,![X2]:![X3]:mult(X3,mult(X2,X2))=mult(mult(X3,X2),X2),file('/tmp/SRASS.s.p', f07)).
% fof(3, axiom,mult(op_a,op_b)=unit,file('/tmp/SRASS.s.p', f10)).
% fof(4, axiom,mult(op_b,op_a)=unit,file('/tmp/SRASS.s.p', f11)).
% fof(7, axiom,![X3]:mult(X3,unit)=X3,file('/tmp/SRASS.s.p', f08)).
% fof(8, axiom,![X3]:mult(unit,X3)=X3,file('/tmp/SRASS.s.p', f09)).
% fof(12, conjecture,![X4]:(mult(mult(X4,op_a),op_b)=X4&mult(mult(X4,op_b),op_a)=X4),file('/tmp/SRASS.s.p', goals)).
% fof(13, negated_conjecture,~(![X4]:(mult(mult(X4,op_a),op_b)=X4&mult(mult(X4,op_b),op_a)=X4)),inference(assume_negation,[status(cth)],[12])).
% fof(14, plain,![X4]:![X5]:![X6]:mult(mult(mult(X6,X5),X4),X5)=mult(X6,mult(mult(X5,X4),X5)),inference(variable_rename,[status(thm)],[1])).
% cnf(15,plain,(mult(mult(mult(X1,X2),X3),X2)=mult(X1,mult(mult(X2,X3),X2))),inference(split_conjunct,[status(thm)],[14])).
% fof(16, plain,![X4]:![X5]:mult(X5,mult(X4,X4))=mult(mult(X5,X4),X4),inference(variable_rename,[status(thm)],[2])).
% cnf(17,plain,(mult(X1,mult(X2,X2))=mult(mult(X1,X2),X2)),inference(split_conjunct,[status(thm)],[16])).
% cnf(18,plain,(mult(op_a,op_b)=unit),inference(split_conjunct,[status(thm)],[3])).
% cnf(19,plain,(mult(op_b,op_a)=unit),inference(split_conjunct,[status(thm)],[4])).
% fof(24, plain,![X4]:mult(X4,unit)=X4,inference(variable_rename,[status(thm)],[7])).
% cnf(25,plain,(mult(X1,unit)=X1),inference(split_conjunct,[status(thm)],[24])).
% fof(26, plain,![X4]:mult(unit,X4)=X4,inference(variable_rename,[status(thm)],[8])).
% cnf(27,plain,(mult(unit,X1)=X1),inference(split_conjunct,[status(thm)],[26])).
% fof(34, negated_conjecture,?[X4]:(~(mult(mult(X4,op_a),op_b)=X4)|~(mult(mult(X4,op_b),op_a)=X4)),inference(fof_nnf,[status(thm)],[13])).
% fof(35, negated_conjecture,?[X5]:(~(mult(mult(X5,op_a),op_b)=X5)|~(mult(mult(X5,op_b),op_a)=X5)),inference(variable_rename,[status(thm)],[34])).
% fof(36, negated_conjecture,(~(mult(mult(esk1_0,op_a),op_b)=esk1_0)|~(mult(mult(esk1_0,op_b),op_a)=esk1_0)),inference(skolemize,[status(esa)],[35])).
% cnf(37,negated_conjecture,(mult(mult(esk1_0,op_b),op_a)!=esk1_0|mult(mult(esk1_0,op_a),op_b)!=esk1_0),inference(split_conjunct,[status(thm)],[36])).
% cnf(51,plain,(mult(unit,op_a)=mult(op_b,mult(op_a,op_a))),inference(spm,[status(thm)],[17,19,theory(equality)])).
% cnf(52,plain,(mult(unit,op_b)=mult(op_a,mult(op_b,op_b))),inference(spm,[status(thm)],[17,18,theory(equality)])).
% cnf(57,plain,(op_a=mult(op_b,mult(op_a,op_a))),inference(rw,[status(thm)],[51,27,theory(equality)])).
% cnf(58,plain,(op_b=mult(op_a,mult(op_b,op_b))),inference(rw,[status(thm)],[52,27,theory(equality)])).
% cnf(499,plain,(mult(mult(X1,mult(mult(X2,X3),X2)),X2)=mult(mult(mult(X1,X2),X3),mult(X2,X2))),inference(spm,[status(thm)],[17,15,theory(equality)])).
% cnf(514,plain,(mult(mult(mult(X1,mult(X2,X2)),X3),X2)=mult(mult(X1,X2),mult(mult(X2,X3),X2))),inference(spm,[status(thm)],[15,17,theory(equality)])).
% cnf(23715,plain,(mult(mult(X1,mult(unit,op_b)),op_b)=mult(mult(mult(X1,op_b),op_a),mult(op_b,op_b))),inference(spm,[status(thm)],[499,19,theory(equality)])).
% cnf(23979,plain,(mult(X1,mult(op_b,op_b))=mult(mult(mult(X1,op_b),op_a),mult(op_b,op_b))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[23715,27,theory(equality)]),17,theory(equality)])).
% cnf(91132,plain,(mult(mult(X1,mult(op_b,op_b)),op_a)=mult(mult(X1,op_b),mult(mult(op_a,mult(op_b,op_b)),op_a))),inference(spm,[status(thm)],[15,23979,theory(equality)])).
% cnf(91252,plain,(mult(mult(X1,mult(op_b,op_b)),op_a)=mult(X1,op_b)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[91132,58,theory(equality)]),19,theory(equality)]),25,theory(equality)])).
% cnf(91340,plain,(mult(mult(X1,op_a),op_b)=mult(X1,mult(mult(op_a,mult(op_b,op_b)),op_a))),inference(spm,[status(thm)],[15,91252,theory(equality)])).
% cnf(91344,plain,(mult(mult(X1,mult(op_a,op_a)),op_b)=mult(mult(X1,op_a),mult(mult(op_a,mult(op_b,op_b)),op_a))),inference(spm,[status(thm)],[514,91252,theory(equality)])).
% cnf(91414,plain,(mult(mult(X1,op_a),op_b)=X1),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[91340,58,theory(equality)]),19,theory(equality)]),25,theory(equality)])).
% cnf(91416,plain,(mult(mult(X1,mult(op_a,op_a)),op_b)=mult(X1,op_a)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[91344,58,theory(equality)]),19,theory(equality)]),25,theory(equality)])).
% cnf(91615,negated_conjecture,($false|mult(mult(esk1_0,op_b),op_a)!=esk1_0),inference(rw,[status(thm)],[37,91414,theory(equality)])).
% cnf(91616,negated_conjecture,(mult(mult(esk1_0,op_b),op_a)!=esk1_0),inference(cn,[status(thm)],[91615,theory(equality)])).
% cnf(91963,plain,(mult(mult(X1,op_b),op_a)=mult(X1,mult(mult(op_b,mult(op_a,op_a)),op_b))),inference(spm,[status(thm)],[15,91416,theory(equality)])).
% cnf(92038,plain,(mult(mult(X1,op_b),op_a)=X1),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[91963,57,theory(equality)]),18,theory(equality)]),25,theory(equality)])).
% cnf(92231,negated_conjecture,($false),inference(rw,[status(thm)],[91616,92038,theory(equality)])).
% cnf(92232,negated_conjecture,($false),inference(cn,[status(thm)],[92231,theory(equality)])).
% cnf(92233,negated_conjecture,($false),92232,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 2608
% # ...of these trivial : 1148
% # ...subsumed : 753
% # ...remaining for further processing: 707
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 126
% # Generated clauses : 47642
% # ...of the previous two non-trivial : 39796
% # Contextual simplify-reflections : 0
% # Paramodulations : 47642
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 581
% # Positive orientable unit clauses: 564
% # Positive unorientable unit clauses: 17
% # Negative unit clauses : 0
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 31518
% # ...number of literals in the above : 31518
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 574
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2732
% # Indexed BW rewrite successes : 300
% # Backwards rewriting index: 644 leaves, 2.05+/-2.295 terms/leaf
% # Paramod-from index: 262 leaves, 2.25+/-2.223 terms/leaf
% # Paramod-into index: 544 leaves, 1.91+/-2.094 terms/leaf
% # -------------------------------------------------
% # User time : 1.557 s
% # System time : 0.067 s
% # Total time : 1.624 s
% # Maximum resident set size: 0 pages
% PrfWatch: 3.04 CPU 3.38 WC
% FINAL PrfWatch: 3.04 CPU 3.38 WC
% SZS output end Solution for /tmp/SystemOnTPTP2416/GRP715+1.tptp
%
%------------------------------------------------------------------------------