TSTP Solution File: GRP700+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GRP700+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:05 EST 2010
% Result : Theorem 1.08s
% Output : Solution 1.08s
% 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/SystemOnTPTP5300/GRP700+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP5300/GRP700+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP5300/GRP700+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 5396
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 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]:mult(X1,unit)=X1,file('/tmp/SRASS.s.p', f05)).
% fof(2, axiom,![X1]:mult(unit,X1)=X1,file('/tmp/SRASS.s.p', f06)).
% fof(5, axiom,![X2]:![X1]:mult(rd(X1,X2),X2)=X1,file('/tmp/SRASS.s.p', f03)).
% fof(6, axiom,![X2]:![X1]:rd(mult(X1,X2),X2)=X1,file('/tmp/SRASS.s.p', f04)).
% fof(7, axiom,![X3]:![X2]:![X1]:mult(mult(mult(X1,X2),X1),mult(X1,X3))=mult(X1,mult(mult(mult(X2,X1),X1),X3)),file('/tmp/SRASS.s.p', f07)).
% fof(9, conjecture,![X4]:?[X5]:(mult(X5,X4)=unit&mult(X4,X5)=unit),file('/tmp/SRASS.s.p', goals)).
% fof(10, negated_conjecture,~(![X4]:?[X5]:(mult(X5,X4)=unit&mult(X4,X5)=unit)),inference(assume_negation,[status(cth)],[9])).
% fof(11, plain,![X2]:mult(X2,unit)=X2,inference(variable_rename,[status(thm)],[1])).
% cnf(12,plain,(mult(X1,unit)=X1),inference(split_conjunct,[status(thm)],[11])).
% fof(13, plain,![X2]:mult(unit,X2)=X2,inference(variable_rename,[status(thm)],[2])).
% cnf(14,plain,(mult(unit,X1)=X1),inference(split_conjunct,[status(thm)],[13])).
% fof(19, plain,![X3]:![X4]:mult(rd(X4,X3),X3)=X4,inference(variable_rename,[status(thm)],[5])).
% cnf(20,plain,(mult(rd(X1,X2),X2)=X1),inference(split_conjunct,[status(thm)],[19])).
% fof(21, plain,![X3]:![X4]:rd(mult(X4,X3),X3)=X4,inference(variable_rename,[status(thm)],[6])).
% cnf(22,plain,(rd(mult(X1,X2),X2)=X1),inference(split_conjunct,[status(thm)],[21])).
% fof(23, plain,![X4]:![X5]:![X6]:mult(mult(mult(X6,X5),X6),mult(X6,X4))=mult(X6,mult(mult(mult(X5,X6),X6),X4)),inference(variable_rename,[status(thm)],[7])).
% cnf(24,plain,(mult(mult(mult(X1,X2),X1),mult(X1,X3))=mult(X1,mult(mult(mult(X2,X1),X1),X3))),inference(split_conjunct,[status(thm)],[23])).
% fof(27, negated_conjecture,?[X4]:![X5]:(~(mult(X5,X4)=unit)|~(mult(X4,X5)=unit)),inference(fof_nnf,[status(thm)],[10])).
% fof(28, negated_conjecture,?[X6]:![X7]:(~(mult(X7,X6)=unit)|~(mult(X6,X7)=unit)),inference(variable_rename,[status(thm)],[27])).
% fof(29, negated_conjecture,![X7]:(~(mult(X7,esk1_0)=unit)|~(mult(esk1_0,X7)=unit)),inference(skolemize,[status(esa)],[28])).
% cnf(30,negated_conjecture,(mult(esk1_0,X1)!=unit|mult(X1,esk1_0)!=unit),inference(split_conjunct,[status(thm)],[29])).
% cnf(37,negated_conjecture,(X1!=unit|mult(esk1_0,rd(X1,esk1_0))!=unit),inference(spm,[status(thm)],[30,20,theory(equality)])).
% cnf(40,plain,(rd(X1,X1)=unit),inference(spm,[status(thm)],[22,14,theory(equality)])).
% cnf(51,plain,(mult(mult(mult(X1,X2),X1),X1)=mult(X1,mult(mult(mult(X2,X1),X1),unit))),inference(spm,[status(thm)],[24,12,theory(equality)])).
% cnf(59,plain,(mult(mult(mult(X1,X2),X1),X1)=mult(X1,mult(mult(X2,X1),X1))),inference(rw,[status(thm)],[51,12,theory(equality)])).
% cnf(186,plain,(rd(mult(X1,mult(mult(X2,X1),X1)),X1)=mult(mult(X1,X2),X1)),inference(spm,[status(thm)],[22,59,theory(equality)])).
% cnf(2732,plain,(rd(mult(X1,mult(X2,X1)),X1)=mult(mult(X1,rd(X2,X1)),X1)),inference(spm,[status(thm)],[186,20,theory(equality)])).
% cnf(3157,plain,(rd(mult(X1,X1),X1)=mult(mult(X1,rd(unit,X1)),X1)),inference(spm,[status(thm)],[2732,14,theory(equality)])).
% cnf(3180,plain,(X1=mult(mult(X1,rd(unit,X1)),X1)),inference(rw,[status(thm)],[3157,22,theory(equality)])).
% cnf(3624,plain,(rd(X1,X1)=mult(X1,rd(unit,X1))),inference(spm,[status(thm)],[22,3180,theory(equality)])).
% cnf(3704,plain,(unit=mult(X1,rd(unit,X1))),inference(rw,[status(thm)],[3624,40,theory(equality)])).
% cnf(3942,negated_conjecture,($false),inference(spm,[status(thm)],[37,3704,theory(equality)])).
% cnf(4026,negated_conjecture,($false),3942,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 395
% # ...of these trivial : 8
% # ...subsumed : 192
% # ...remaining for further processing: 195
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 16
% # Backward-rewritten : 40
% # Generated clauses : 2483
% # ...of the previous two non-trivial : 2242
% # Contextual simplify-reflections : 0
% # Paramodulations : 2483
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 139
% # Positive orientable unit clauses: 38
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 11
% # Non-unit-clauses : 90
% # Current number of unprocessed clauses: 1689
% # ...number of literals in the above : 1996
% # Clause-clause subsumption calls (NU) : 6606
% # Rec. Clause-clause subsumption calls : 6606
% # Unit Clause-clause subsumption calls : 346
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 356
% # Indexed BW rewrite successes : 19
% # Backwards rewriting index: 110 leaves, 3.54+/-7.848 terms/leaf
% # Paramod-from index: 34 leaves, 1.12+/-0.403 terms/leaf
% # Paramod-into index: 99 leaves, 2.70+/-4.935 terms/leaf
% # -------------------------------------------------
% # User time : 0.123 s
% # System time : 0.008 s
% # Total time : 0.131 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.28 CPU 0.38 WC
% FINAL PrfWatch: 0.28 CPU 0.38 WC
% SZS output end Solution for /tmp/SystemOnTPTP5300/GRP700+1.tptp
%
%------------------------------------------------------------------------------