TSTP Solution File: LCL896+1 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : LCL896+1 : TPTP v5.5.0. Released v5.5.0.
% Transfm  : none
% Format   : tptp
% Command  : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s

% Computer : art08.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory   : 2005MB
% OS       : Linux 2.6.32.26-175.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Mon Oct 22 19:08:19 EDT 2012

% Result   : Theorem 5.58s
% Output   : Solution 5.58s
% 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/SystemOnTPTP30708/LCL896+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP30708/LCL896+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP30708/LCL896+1.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.6/eproof_ram --print-statistics --auto --cpu-limit=60 --memory-limit=1024 --tstp-format /tmp/SRASS.s.p 
% TreeLimitedRun: CPU time limit is 60s
% TreeLimitedRun: WC  time limit is 120s
% TreeLimitedRun: PID is 30822
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.91 CPU 2.04 WC
% PrfWatch: 3.90 CPU 4.05 WC
% # No SinE strategy applied
% # Auto-Ordering is analysing problem.
% # Problem is type HUSMGFFSF22MM
% # Auto-mode selected ordering type KBO6
% # Auto-mode selected ordering precedence scheme <invfreq>
% # Auto-mode selected weight ordering scheme <invfreqrank>
% #
% # Auto-Heuristic is analysing problem.
% # Problem is type HUSMGFFSF22MM
% # Auto-Mode selected heuristic H_____102_C18_F1_PI_AE_Q4_CS_SP_PS_S2S
% # and selection function SelectNewComplexAHP.
% #
% # Initializing proof state
% # Scanning for AC axioms
% # '+' is AC
% # AC handling enabled
% # Presaturation interreduction done
% # Proof found!
% # SZS status Theorem
% # Parsed axioms                      : 13
% # Removed by relevancy pruning/SinE  : 0
% # Initial clauses                    : 14
% # Removed in clause preprocessing    : 0
% # Initial clauses in saturation      : 14
% # Processed clauses                  : 3510
% # ...of these trivial                : 1228
% # ...subsumed                        : 1534
% # ...remaining for further processing: 748
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 32
% # Generated clauses                  : 122006
% # ...of the previous two non-trivial : 67234
% # Contextual simplify-reflections    : 0
% # Paramodulations                    : 122006
% # Factorizations                     : 0
% # Equation resolutions               : 0
% # Current number of processed clauses: 702
% #    Positive orientable unit clauses: 542
% #    Positive unorientable unit clauses: 5
% #    Negative unit clauses           : 0
% #    Non-unit-clauses                : 155
% # Current number of unprocessed clauses: 62231
% # ...number of literals in the above : 68287
% # Clause-clause subsumption calls (NU) : 11636
% # Rec. Clause-clause subsumption calls : 11636
% # Non-unit clause-clause subsumptions: 1462
% # Unit Clause-clause subsumption calls : 790
% # Rewrite failures with RHS unbound  : 0
% # BW rewrite match attempts          : 8848
% # BW rewrite match successes         : 215
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:'+'('+'(X1,X2),X3)='+'(X1,'+'(X2,X3)),file('/tmp/SRASS.s.p', sos_01)).
% fof(2, axiom,![X1]:![X2]:'+'(X1,X2)='+'(X2,X1),file('/tmp/SRASS.s.p', sos_02)).
% fof(3, axiom,![X1]:![X2]:![X3]:'+'('+'(X1,'==>'(X1,X2)),'==>'('+'(X1,'==>'(X1,X2)),X3))='+'(X1,'==>'(X1,'+'(X2,'==>'(X2,X3)))),file('/tmp/SRASS.s.p', sos_12)).
% fof(4, axiom,![X4]:![X5]:![X6]:('>='('+'(X4,X5),X6)<=>'>='(X5,'==>'(X4,X6))),file('/tmp/SRASS.s.p', sos_07)).
% fof(6, axiom,![X10]:![X11]:![X12]:('>='(X10,X11)=>'>='('==>'(X12,X10),'==>'(X12,X11))),file('/tmp/SRASS.s.p', sos_11)).
% fof(7, axiom,![X13]:![X14]:(('>='(X13,X14)&'>='(X14,X13))=>X13=X14),file('/tmp/SRASS.s.p', sos_06)).
% fof(8, axiom,![X15]:![X16]:![X17]:('>='(X15,X16)=>'>='('+'(X15,X17),'+'(X16,X17))),file('/tmp/SRASS.s.p', sos_09)).
% fof(9, axiom,![X1]:'+'(X1,'0')=X1,file('/tmp/SRASS.s.p', sos_03)).
% fof(10, axiom,![X1]:'>='(X1,X1),file('/tmp/SRASS.s.p', sos_04)).
% fof(12, axiom,![X1]:'>='(X1,'0'),file('/tmp/SRASS.s.p', sos_08)).
% fof(13, conjecture,![X21]:![X22]:'+'(X21,'==>'(X21,X22))='+'(X22,'==>'(X22,X21)),file('/tmp/SRASS.s.p', goals_13)).
% fof(14, negated_conjecture,~(![X21]:![X22]:'+'(X21,'==>'(X21,X22))='+'(X22,'==>'(X22,X21))),inference(assume_negation,[status(cth)],[13])).
% fof(15, plain,![X4]:![X5]:![X6]:'+'('+'(X4,X5),X6)='+'(X4,'+'(X5,X6)),inference(variable_rename,[status(thm)],[1])).
% cnf(16,plain,('+'('+'(X1,X2),X3)='+'(X1,'+'(X2,X3))),inference(split_conjunct,[status(thm)],[15])).
% fof(17, plain,![X3]:![X4]:'+'(X3,X4)='+'(X4,X3),inference(variable_rename,[status(thm)],[2])).
% cnf(18,plain,('+'(X1,X2)='+'(X2,X1)),inference(split_conjunct,[status(thm)],[17])).
% fof(19, plain,![X4]:![X5]:![X6]:'+'('+'(X4,'==>'(X4,X5)),'==>'('+'(X4,'==>'(X4,X5)),X6))='+'(X4,'==>'(X4,'+'(X5,'==>'(X5,X6)))),inference(variable_rename,[status(thm)],[3])).
% cnf(20,plain,('+'('+'(X1,'==>'(X1,X2)),'==>'('+'(X1,'==>'(X1,X2)),X3))='+'(X1,'==>'(X1,'+'(X2,'==>'(X2,X3))))),inference(split_conjunct,[status(thm)],[19])).
% fof(21, plain,![X4]:![X5]:![X6]:((~('>='('+'(X4,X5),X6))|'>='(X5,'==>'(X4,X6)))&(~('>='(X5,'==>'(X4,X6)))|'>='('+'(X4,X5),X6))),inference(fof_nnf,[status(thm)],[4])).
% fof(22, plain,(![X4]:![X5]:![X6]:(~('>='('+'(X4,X5),X6))|'>='(X5,'==>'(X4,X6)))&![X4]:![X5]:![X6]:(~('>='(X5,'==>'(X4,X6)))|'>='('+'(X4,X5),X6))),inference(shift_quantors,[status(thm)],[21])).
% fof(23, plain,(![X7]:![X8]:![X9]:(~('>='('+'(X7,X8),X9))|'>='(X8,'==>'(X7,X9)))&![X10]:![X11]:![X12]:(~('>='(X11,'==>'(X10,X12)))|'>='('+'(X10,X11),X12))),inference(variable_rename,[status(thm)],[22])).
% fof(24, plain,![X7]:![X8]:![X9]:![X10]:![X11]:![X12]:((~('>='('+'(X7,X8),X9))|'>='(X8,'==>'(X7,X9)))&(~('>='(X11,'==>'(X10,X12)))|'>='('+'(X10,X11),X12))),inference(shift_quantors,[status(thm)],[23])).
% cnf(25,plain,('>='('+'(X1,X2),X3)|~'>='(X2,'==>'(X1,X3))),inference(split_conjunct,[status(thm)],[24])).
% cnf(26,plain,('>='(X1,'==>'(X2,X3))|~'>='('+'(X2,X1),X3)),inference(split_conjunct,[status(thm)],[24])).
% fof(32, plain,![X10]:![X11]:![X12]:(~('>='(X10,X11))|'>='('==>'(X12,X10),'==>'(X12,X11))),inference(fof_nnf,[status(thm)],[6])).
% fof(33, plain,![X10]:![X11]:(~('>='(X10,X11))|![X12]:'>='('==>'(X12,X10),'==>'(X12,X11))),inference(shift_quantors,[status(thm)],[32])).
% fof(34, plain,![X13]:![X14]:(~('>='(X13,X14))|![X15]:'>='('==>'(X15,X13),'==>'(X15,X14))),inference(variable_rename,[status(thm)],[33])).
% fof(35, plain,![X13]:![X14]:![X15]:(~('>='(X13,X14))|'>='('==>'(X15,X13),'==>'(X15,X14))),inference(shift_quantors,[status(thm)],[34])).
% cnf(36,plain,('>='('==>'(X1,X2),'==>'(X1,X3))|~'>='(X2,X3)),inference(split_conjunct,[status(thm)],[35])).
% fof(37, plain,![X13]:![X14]:((~('>='(X13,X14))|~('>='(X14,X13)))|X13=X14),inference(fof_nnf,[status(thm)],[7])).
% fof(38, plain,![X15]:![X16]:((~('>='(X15,X16))|~('>='(X16,X15)))|X15=X16),inference(variable_rename,[status(thm)],[37])).
% cnf(39,plain,(X1=X2|~'>='(X2,X1)|~'>='(X1,X2)),inference(split_conjunct,[status(thm)],[38])).
% fof(40, plain,![X15]:![X16]:![X17]:(~('>='(X15,X16))|'>='('+'(X15,X17),'+'(X16,X17))),inference(fof_nnf,[status(thm)],[8])).
% fof(41, plain,![X15]:![X16]:(~('>='(X15,X16))|![X17]:'>='('+'(X15,X17),'+'(X16,X17))),inference(shift_quantors,[status(thm)],[40])).
% fof(42, plain,![X18]:![X19]:(~('>='(X18,X19))|![X20]:'>='('+'(X18,X20),'+'(X19,X20))),inference(variable_rename,[status(thm)],[41])).
% fof(43, plain,![X18]:![X19]:![X20]:(~('>='(X18,X19))|'>='('+'(X18,X20),'+'(X19,X20))),inference(shift_quantors,[status(thm)],[42])).
% cnf(44,plain,('>='('+'(X1,X2),'+'(X3,X2))|~'>='(X1,X3)),inference(split_conjunct,[status(thm)],[43])).
% fof(45, plain,![X2]:'+'(X2,'0')=X2,inference(variable_rename,[status(thm)],[9])).
% cnf(46,plain,('+'(X1,'0')=X1),inference(split_conjunct,[status(thm)],[45])).
% fof(47, plain,![X2]:'>='(X2,X2),inference(variable_rename,[status(thm)],[10])).
% cnf(48,plain,('>='(X1,X1)),inference(split_conjunct,[status(thm)],[47])).
% fof(52, plain,![X2]:'>='(X2,'0'),inference(variable_rename,[status(thm)],[12])).
% cnf(53,plain,('>='(X1,'0')),inference(split_conjunct,[status(thm)],[52])).
% fof(54, negated_conjecture,?[X21]:?[X22]:~('+'(X21,'==>'(X21,X22))='+'(X22,'==>'(X22,X21))),inference(fof_nnf,[status(thm)],[14])).
% fof(55, negated_conjecture,?[X23]:?[X24]:~('+'(X23,'==>'(X23,X24))='+'(X24,'==>'(X24,X23))),inference(variable_rename,[status(thm)],[54])).
% fof(56, negated_conjecture,~('+'(esk1_0,'==>'(esk1_0,esk2_0))='+'(esk2_0,'==>'(esk2_0,esk1_0))),inference(skolemize,[status(esa)],[55])).
% cnf(57,negated_conjecture,('+'(esk1_0,'==>'(esk1_0,esk2_0))!='+'(esk2_0,'==>'(esk2_0,esk1_0))),inference(split_conjunct,[status(thm)],[56])).
% cnf(58,plain,('+'(X1,'+'('==>'(X1,X2),'==>'('+'(X1,'==>'(X1,X2)),X3)))='+'(X1,'==>'(X1,'+'(X2,'==>'(X2,X3))))),inference(rw,[status(thm)],[20,16,theory(equality)])).
% cnf(60,plain,('>='('+'(X1,'==>'(X1,X2)),X2)),inference(spm,[status(thm)],[25,48,theory(equality)])).
% cnf(71,plain,('+'('0',X1)=X1),inference(spm,[status(thm)],[46,18,theory(equality)])).
% cnf(78,plain,('>='('+'(X1,X2),'+'('0',X2))),inference(spm,[status(thm)],[44,53,theory(equality)])).
% cnf(88,plain,('>='('0','==>'(X1,X2))|~'>='(X1,X2)),inference(spm,[status(thm)],[26,46,theory(equality)])).
% cnf(92,plain,('>='(X1,'==>'(X2,'+'(X2,X1)))),inference(spm,[status(thm)],[26,48,theory(equality)])).
% cnf(139,plain,('>='('+'(X1,X2),X2)),inference(rw,[status(thm)],[78,71,theory(equality)])).
% cnf(175,plain,('>='('0','==>'('+'(X1,X2),X2))),inference(spm,[status(thm)],[88,139,theory(equality)])).
% cnf(244,plain,('>='('==>'(X1,'+'(X2,'==>'(X2,X3))),'==>'(X1,X3))),inference(spm,[status(thm)],[36,60,theory(equality)])).
% cnf(373,plain,('==>'('+'(X1,X2),X2)='0'|~'>='('==>'('+'(X1,X2),X2),'0')),inference(spm,[status(thm)],[39,175,theory(equality)])).
% cnf(389,plain,('==>'('+'(X1,X2),X2)='0'|$false),inference(rw,[status(thm)],[373,53,theory(equality)])).
% cnf(390,plain,('==>'('+'(X1,X2),X2)='0'),inference(cn,[status(thm)],[389,theory(equality)])).
% cnf(411,plain,('==>'('+'(X2,X1),X2)='0'),inference(spm,[status(thm)],[390,18,theory(equality)])).
% cnf(427,plain,('==>'(X1,'+'(X1,X2))=X2|~'>='('==>'(X1,'+'(X1,X2)),X2)),inference(spm,[status(thm)],[39,92,theory(equality)])).
% cnf(482,plain,('+'(X1,'+'('==>'(X1,X2),'0'))='+'(X1,'==>'(X1,'+'(X2,'==>'(X2,X1))))),inference(spm,[status(thm)],[58,411,theory(equality)])).
% cnf(496,plain,('+'(X1,'==>'(X1,X2))='+'(X1,'==>'(X1,'+'(X2,'==>'(X2,X1))))),inference(rw,[status(thm)],[482,46,theory(equality)])).
% cnf(14046,plain,('==>'(X1,'+'(X1,'==>'(X1,X2)))='==>'(X1,X2)),inference(spm,[status(thm)],[427,244,theory(equality)])).
% cnf(14424,plain,('==>'(X1,'+'(X1,'==>'(X1,X2)))='==>'(X1,'+'(X2,'==>'(X2,X1)))),inference(spm,[status(thm)],[14046,496,theory(equality)])).
% cnf(14552,plain,('==>'(X1,X2)='==>'(X1,'+'(X2,'==>'(X2,X1)))),inference(rw,[status(thm)],[14424,14046,theory(equality)])).
% cnf(14572,plain,('>='('+'(X1,'==>'(X1,X2)),'+'(X2,'==>'(X2,X1)))),inference(spm,[status(thm)],[60,14552,theory(equality)])).
% cnf(202220,plain,('+'(X1,'==>'(X1,X2))='+'(X2,'==>'(X2,X1))|~'>='('+'(X1,'==>'(X1,X2)),'+'(X2,'==>'(X2,X1)))),inference(spm,[status(thm)],[39,14572,theory(equality)])).
% cnf(202501,plain,('+'(X1,'==>'(X1,X2))='+'(X2,'==>'(X2,X1))|$false),inference(rw,[status(thm)],[202220,14572,theory(equality)])).
% cnf(202502,plain,('+'(X1,'==>'(X1,X2))='+'(X2,'==>'(X2,X1))),inference(cn,[status(thm)],[202501,theory(equality)])).
% cnf(204722,negated_conjecture,($false),inference(rw,[status(thm)],[57,202502,theory(equality)])).
% cnf(204723,negated_conjecture,($false),inference(cn,[status(thm)],[204722,theory(equality)])).
% cnf(204724,negated_conjecture,($false),204723,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 5.04 CPU 5.21 WC
% FINAL PrfWatch: 5.04 CPU 5.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP30708/LCL896+1.tptp
% 
%------------------------------------------------------------------------------