TSTP Solution File: GRP001+6 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : GRP001+6 : TPTP v5.0.0. Released v3.1.0.
% Transfm  : none
% Format   : tptp
% Command  : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s

% Computer : art07.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 05:48:41 EST 2010

% Result   : Theorem 1.22s
% Output   : Solution 1.22s
% 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/SystemOnTPTP1280/GRP001+6.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP1280/GRP001+6.tptp
% SZS output start Solution for /tmp/SystemOnTPTP1280/GRP001+6.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 1377
% 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, conjecture,![X1]:(((((((![X2]:![X3]:?[X4]:product(X2,X3,X4)&![X2]:![X3]:![X4]:![X5]:![X6]:![X7]:(((product(X2,X3,X5)&product(X3,X4,X6))&product(X5,X4,X7))=>product(X2,X6,X7)))&![X2]:![X3]:![X4]:![X5]:![X6]:![X7]:(((product(X2,X3,X5)&product(X3,X4,X6))&product(X2,X6,X7))=>product(X5,X4,X7)))&![X2]:product(X2,X1,X2))&![X2]:product(X1,X2,X2))&![X2]:product(X2,inverse(X2),X1))&![X2]:product(inverse(X2),X2,X1))=>(![X2]:product(X2,X2,X1)=>![X5]:![X6]:![X7]:(product(X5,X6,X7)=>product(X6,X5,X7)))),file('/tmp/SRASS.s.p', commutativity)).
% fof(2, negated_conjecture,~(![X1]:(((((((![X2]:![X3]:?[X4]:product(X2,X3,X4)&![X2]:![X3]:![X4]:![X5]:![X6]:![X7]:(((product(X2,X3,X5)&product(X3,X4,X6))&product(X5,X4,X7))=>product(X2,X6,X7)))&![X2]:![X3]:![X4]:![X5]:![X6]:![X7]:(((product(X2,X3,X5)&product(X3,X4,X6))&product(X2,X6,X7))=>product(X5,X4,X7)))&![X2]:product(X2,X1,X2))&![X2]:product(X1,X2,X2))&![X2]:product(X2,inverse(X2),X1))&![X2]:product(inverse(X2),X2,X1))=>(![X2]:product(X2,X2,X1)=>![X5]:![X6]:![X7]:(product(X5,X6,X7)=>product(X6,X5,X7))))),inference(assume_negation,[status(cth)],[1])).
% fof(3, negated_conjecture,?[X1]:(((((((![X2]:![X3]:?[X4]:product(X2,X3,X4)&![X2]:![X3]:![X4]:![X5]:![X6]:![X7]:(((~(product(X2,X3,X5))|~(product(X3,X4,X6)))|~(product(X5,X4,X7)))|product(X2,X6,X7)))&![X2]:![X3]:![X4]:![X5]:![X6]:![X7]:(((~(product(X2,X3,X5))|~(product(X3,X4,X6)))|~(product(X2,X6,X7)))|product(X5,X4,X7)))&![X2]:product(X2,X1,X2))&![X2]:product(X1,X2,X2))&![X2]:product(X2,inverse(X2),X1))&![X2]:product(inverse(X2),X2,X1))&(![X2]:product(X2,X2,X1)&?[X5]:?[X6]:?[X7]:(product(X5,X6,X7)&~(product(X6,X5,X7))))),inference(fof_nnf,[status(thm)],[2])).
% fof(4, negated_conjecture,?[X8]:(((((((![X9]:![X10]:?[X11]:product(X9,X10,X11)&![X12]:![X13]:![X14]:![X15]:![X16]:![X17]:(((~(product(X12,X13,X15))|~(product(X13,X14,X16)))|~(product(X15,X14,X17)))|product(X12,X16,X17)))&![X18]:![X19]:![X20]:![X21]:![X22]:![X23]:(((~(product(X18,X19,X21))|~(product(X19,X20,X22)))|~(product(X18,X22,X23)))|product(X21,X20,X23)))&![X24]:product(X24,X8,X24))&![X25]:product(X8,X25,X25))&![X26]:product(X26,inverse(X26),X8))&![X27]:product(inverse(X27),X27,X8))&(![X28]:product(X28,X28,X8)&?[X29]:?[X30]:?[X31]:(product(X29,X30,X31)&~(product(X30,X29,X31))))),inference(variable_rename,[status(thm)],[3])).
% fof(5, negated_conjecture,(((((((![X9]:![X10]:product(X9,X10,esk2_2(X9,X10))&![X12]:![X13]:![X14]:![X15]:![X16]:![X17]:(((~(product(X12,X13,X15))|~(product(X13,X14,X16)))|~(product(X15,X14,X17)))|product(X12,X16,X17)))&![X18]:![X19]:![X20]:![X21]:![X22]:![X23]:(((~(product(X18,X19,X21))|~(product(X19,X20,X22)))|~(product(X18,X22,X23)))|product(X21,X20,X23)))&![X24]:product(X24,esk1_0,X24))&![X25]:product(esk1_0,X25,X25))&![X26]:product(X26,inverse(X26),esk1_0))&![X27]:product(inverse(X27),X27,esk1_0))&(![X28]:product(X28,X28,esk1_0)&(product(esk3_0,esk4_0,esk5_0)&~(product(esk4_0,esk3_0,esk5_0))))),inference(skolemize,[status(esa)],[4])).
% fof(6, negated_conjecture,![X9]:![X10]:![X12]:![X13]:![X14]:![X15]:![X16]:![X17]:![X18]:![X19]:![X20]:![X21]:![X22]:![X23]:![X24]:![X25]:![X26]:![X27]:![X28]:((product(X28,X28,esk1_0)&(product(esk3_0,esk4_0,esk5_0)&~(product(esk4_0,esk3_0,esk5_0))))&(product(inverse(X27),X27,esk1_0)&(product(X26,inverse(X26),esk1_0)&(product(esk1_0,X25,X25)&(product(X24,esk1_0,X24)&((((~(product(X18,X19,X21))|~(product(X19,X20,X22)))|~(product(X18,X22,X23)))|product(X21,X20,X23))&((((~(product(X12,X13,X15))|~(product(X13,X14,X16)))|~(product(X15,X14,X17)))|product(X12,X16,X17))&product(X9,X10,esk2_2(X9,X10))))))))),inference(shift_quantors,[status(thm)],[5])).
% cnf(7,negated_conjecture,(product(X1,X2,esk2_2(X1,X2))),inference(split_conjunct,[status(thm)],[6])).
% cnf(8,negated_conjecture,(product(X1,X2,X3)|~product(X4,X5,X3)|~product(X6,X5,X2)|~product(X1,X6,X4)),inference(split_conjunct,[status(thm)],[6])).
% cnf(9,negated_conjecture,(product(X1,X2,X3)|~product(X4,X5,X3)|~product(X6,X2,X5)|~product(X4,X6,X1)),inference(split_conjunct,[status(thm)],[6])).
% cnf(10,negated_conjecture,(product(X1,esk1_0,X1)),inference(split_conjunct,[status(thm)],[6])).
% cnf(11,negated_conjecture,(product(esk1_0,X1,X1)),inference(split_conjunct,[status(thm)],[6])).
% cnf(12,negated_conjecture,(product(X1,inverse(X1),esk1_0)),inference(split_conjunct,[status(thm)],[6])).
% cnf(13,negated_conjecture,(product(inverse(X1),X1,esk1_0)),inference(split_conjunct,[status(thm)],[6])).
% cnf(14,negated_conjecture,(~product(esk4_0,esk3_0,esk5_0)),inference(split_conjunct,[status(thm)],[6])).
% cnf(15,negated_conjecture,(product(esk3_0,esk4_0,esk5_0)),inference(split_conjunct,[status(thm)],[6])).
% cnf(16,negated_conjecture,(product(X1,X1,esk1_0)),inference(split_conjunct,[status(thm)],[6])).
% cnf(17,negated_conjecture,(product(X1,esk5_0,X2)|~product(X3,esk4_0,X2)|~product(X1,esk3_0,X3)),inference(spm,[status(thm)],[8,15,theory(equality)])).
% cnf(22,negated_conjecture,(product(X1,esk1_0,X2)|~product(X4,X3,X2)|~product(X1,X3,X4)),inference(spm,[status(thm)],[8,16,theory(equality)])).
% cnf(26,negated_conjecture,(product(X1,X2,X3)|~product(X4,inverse(X2),X1)|~product(X4,esk1_0,X3)),inference(spm,[status(thm)],[9,13,theory(equality)])).
% cnf(29,negated_conjecture,(product(X1,X2,X3)|~product(X4,X2,X1)|~product(X4,esk1_0,X3)),inference(spm,[status(thm)],[9,16,theory(equality)])).
% cnf(30,negated_conjecture,(product(X1,X2,X3)|~product(X5,X4,X1)|~product(X5,esk2_2(X4,X2),X3)),inference(spm,[status(thm)],[9,7,theory(equality)])).
% cnf(34,negated_conjecture,(product(X1,esk5_0,esk1_0)|~product(X1,esk3_0,esk4_0)),inference(spm,[status(thm)],[17,16,theory(equality)])).
% cnf(272,negated_conjecture,(product(X1,esk1_0,X2)|~product(X1,X2,esk1_0)),inference(spm,[status(thm)],[22,11,theory(equality)])).
% cnf(344,negated_conjecture,(product(X1,esk1_0,esk5_0)|~product(X1,esk3_0,esk4_0)),inference(spm,[status(thm)],[272,34,theory(equality)])).
% cnf(575,negated_conjecture,(product(esk1_0,X1,X2)|~product(X1,esk1_0,X2)),inference(spm,[status(thm)],[26,12,theory(equality)])).
% cnf(966,negated_conjecture,(product(X1,X2,X3)|~product(X3,X2,X1)),inference(spm,[status(thm)],[29,10,theory(equality)])).
% cnf(2420,negated_conjecture,(product(esk2_2(X1,X2),X2,X1)),inference(spm,[status(thm)],[966,7,theory(equality)])).
% cnf(2585,negated_conjecture,(product(esk2_2(esk4_0,esk3_0),esk1_0,esk5_0)),inference(spm,[status(thm)],[344,2420,theory(equality)])).
% cnf(2629,negated_conjecture,(product(esk1_0,esk2_2(esk4_0,esk3_0),esk5_0)),inference(spm,[status(thm)],[575,2585,theory(equality)])).
% cnf(2653,negated_conjecture,(product(X1,esk3_0,esk5_0)|~product(esk1_0,esk4_0,X1)),inference(spm,[status(thm)],[30,2629,theory(equality)])).
% cnf(11564,negated_conjecture,(product(esk4_0,esk3_0,esk5_0)),inference(spm,[status(thm)],[2653,11,theory(equality)])).
% cnf(11588,negated_conjecture,($false),inference(sr,[status(thm)],[11564,14,theory(equality)])).
% cnf(11589,negated_conjecture,($false),11588,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 692
% # ...of these trivial                : 84
% # ...subsumed                        : 54
% # ...remaining for further processing: 554
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 7
% # Backward-rewritten                 : 45
% # Generated clauses                  : 9978
% # ...of the previous two non-trivial : 8489
% # Contextual simplify-reflections    : 0
% # Paramodulations                    : 9978
% # Factorizations                     : 0
% # Equation resolutions               : 0
% # Current number of processed clauses: 492
% #    Positive orientable unit clauses: 337
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 1
% #    Non-unit-clauses                : 154
% # Current number of unprocessed clauses: 7135
% # ...number of literals in the above : 15632
% # Clause-clause subsumption calls (NU) : 2555
% # Rec. Clause-clause subsumption calls : 2507
% # Unit Clause-clause subsumption calls : 118
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 6488
% # Indexed BW rewrite successes       : 45
% # Backwards rewriting index:   250 leaves,   2.66+/-4.504 terms/leaf
% # Paramod-from index:          151 leaves,   2.48+/-3.416 terms/leaf
% # Paramod-into index:          248 leaves,   2.38+/-3.440 terms/leaf
% # -------------------------------------------------
% # User time              : 0.243 s
% # System time            : 0.010 s
% # Total time             : 0.253 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.44 CPU 0.53 WC
% FINAL PrfWatch: 0.44 CPU 0.53 WC
% SZS output end Solution for /tmp/SystemOnTPTP1280/GRP001+6.tptp
% 
%------------------------------------------------------------------------------