TSTP Solution File: GRP012+5 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GRP012+5 : TPTP v5.0.0. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art06.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:51 EST 2010
% Result : Theorem 0.99s
% Output : Solution 0.99s
% 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/SystemOnTPTP31963/GRP012+5.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP31963/GRP012+5.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31963/GRP012+5.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 32059
% 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))=>![X5]:![X6]:![X7]:![X2]:((product(inverse(X5),inverse(X6),X7)&product(X6,X5,X2))=>product(inverse(X7),inverse(X2),X1))),file('/tmp/SRASS.s.p', prove_distribution)).
% 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))=>![X5]:![X6]:![X7]:![X2]:((product(inverse(X5),inverse(X6),X7)&product(X6,X5,X2))=>product(inverse(X7),inverse(X2),X1)))),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))&?[X5]:?[X6]:?[X7]:?[X2]:((product(inverse(X5),inverse(X6),X7)&product(X6,X5,X2))&~(product(inverse(X7),inverse(X2),X1)))),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]:?[X29]:?[X30]:?[X31]:((product(inverse(X28),inverse(X29),X30)&product(X29,X28,X31))&~(product(inverse(X30),inverse(X31),X8)))),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))&((product(inverse(esk3_0),inverse(esk4_0),esk5_0)&product(esk4_0,esk3_0,esk6_0))&~(product(inverse(esk5_0),inverse(esk6_0),esk1_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]:((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))))))))&((product(inverse(esk3_0),inverse(esk4_0),esk5_0)&product(esk4_0,esk3_0,esk6_0))&~(product(inverse(esk5_0),inverse(esk6_0),esk1_0)))),inference(shift_quantors,[status(thm)],[5])).
% cnf(7,negated_conjecture,(~product(inverse(esk5_0),inverse(esk6_0),esk1_0)),inference(split_conjunct,[status(thm)],[6])).
% cnf(8,negated_conjecture,(product(esk4_0,esk3_0,esk6_0)),inference(split_conjunct,[status(thm)],[6])).
% cnf(9,negated_conjecture,(product(inverse(esk3_0),inverse(esk4_0),esk5_0)),inference(split_conjunct,[status(thm)],[6])).
% cnf(11,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(12,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(14,negated_conjecture,(product(esk1_0,X1,X1)),inference(split_conjunct,[status(thm)],[6])).
% cnf(15,negated_conjecture,(product(X1,inverse(X1),esk1_0)),inference(split_conjunct,[status(thm)],[6])).
% cnf(16,negated_conjecture,(product(inverse(X1),X1,esk1_0)),inference(split_conjunct,[status(thm)],[6])).
% cnf(19,negated_conjecture,(product(X1,esk5_0,X2)|~product(X3,inverse(esk4_0),X2)|~product(X1,inverse(esk3_0),X3)),inference(spm,[status(thm)],[11,9,theory(equality)])).
% cnf(22,negated_conjecture,(product(X1,esk1_0,X2)|~product(X4,inverse(X3),X2)|~product(X1,X3,X4)),inference(spm,[status(thm)],[11,15,theory(equality)])).
% cnf(27,negated_conjecture,(product(X1,X2,X3)|~product(X4,inverse(X2),X1)|~product(X4,esk1_0,X3)),inference(spm,[status(thm)],[12,16,theory(equality)])).
% cnf(29,negated_conjecture,(product(X1,inverse(X2),X3)|~product(X4,X2,X1)|~product(X4,esk1_0,X3)),inference(spm,[status(thm)],[12,15,theory(equality)])).
% cnf(45,negated_conjecture,(product(X1,esk5_0,inverse(esk4_0))|~product(X1,inverse(esk3_0),esk1_0)),inference(spm,[status(thm)],[19,14,theory(equality)])).
% cnf(63,negated_conjecture,(product(esk3_0,esk5_0,inverse(esk4_0))),inference(spm,[status(thm)],[45,15,theory(equality)])).
% cnf(65,negated_conjecture,(product(X1,esk5_0,X2)|~product(X3,esk3_0,X1)|~product(X3,inverse(esk4_0),X2)),inference(spm,[status(thm)],[12,63,theory(equality)])).
% cnf(188,negated_conjecture,(product(X1,esk1_0,inverse(X2))|~product(X1,X2,esk1_0)),inference(spm,[status(thm)],[22,14,theory(equality)])).
% cnf(515,negated_conjecture,(product(esk1_0,X1,X2)|~product(X1,esk1_0,X2)),inference(spm,[status(thm)],[27,15,theory(equality)])).
% cnf(596,negated_conjecture,(product(esk1_0,X1,inverse(X2))|~product(X1,X2,esk1_0)),inference(spm,[status(thm)],[515,188,theory(equality)])).
% cnf(784,negated_conjecture,(product(X1,inverse(X2),esk1_0)|~product(esk1_0,X2,X1)),inference(spm,[status(thm)],[29,14,theory(equality)])).
% cnf(2373,negated_conjecture,(product(X1,esk5_0,esk1_0)|~product(esk4_0,esk3_0,X1)),inference(spm,[status(thm)],[65,15,theory(equality)])).
% cnf(2400,negated_conjecture,(product(esk6_0,esk5_0,esk1_0)),inference(spm,[status(thm)],[2373,8,theory(equality)])).
% cnf(2866,negated_conjecture,(~product(esk1_0,esk6_0,inverse(esk5_0))),inference(spm,[status(thm)],[7,784,theory(equality)])).
% cnf(2900,negated_conjecture,(~product(esk6_0,esk5_0,esk1_0)),inference(spm,[status(thm)],[2866,596,theory(equality)])).
% cnf(2901,negated_conjecture,($false),inference(rw,[status(thm)],[2900,2400,theory(equality)])).
% cnf(2902,negated_conjecture,($false),inference(cn,[status(thm)],[2901,theory(equality)])).
% cnf(2903,negated_conjecture,($false),2902,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 370
% # ...of these trivial : 7
% # ...subsumed : 63
% # ...remaining for further processing: 300
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 3
% # Backward-rewritten : 2
% # Generated clauses : 2559
% # ...of the previous two non-trivial : 2281
% # Contextual simplify-reflections : 0
% # Paramodulations : 2559
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 285
% # Positive orientable unit clauses: 150
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 133
% # Current number of unprocessed clauses: 1900
% # ...number of literals in the above : 4674
% # Clause-clause subsumption calls (NU) : 1548
% # Rec. Clause-clause subsumption calls : 1513
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2728
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 155 leaves, 3.13+/-5.159 terms/leaf
% # Paramod-from index: 46 leaves, 4.20+/-5.885 terms/leaf
% # Paramod-into index: 153 leaves, 2.69+/-4.112 terms/leaf
% # -------------------------------------------------
% # User time : 0.082 s
% # System time : 0.009 s
% # Total time : 0.091 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.21 CPU 0.29 WC
% FINAL PrfWatch: 0.21 CPU 0.29 WC
% SZS output end Solution for /tmp/SystemOnTPTP31963/GRP012+5.tptp
%
%------------------------------------------------------------------------------