TSTP Solution File: LCL894+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : LCL894+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 : art01.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2800MHz
% Memory : 2005MB
% OS : Linux 2.6.32.26-175.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Mon Oct 22 19:06:17 EDT 2012
% Result : Theorem 0.87s
% Output : Solution 0.87s
% 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/SystemOnTPTP23688/LCL894+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP23688/LCL894+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP23688/LCL894+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 23802
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.03 WC
% # No SinE strategy applied
% # Auto-Ordering is analysing problem.
% # Problem is type GHSMGFFSF22MS
% # Auto-mode selected ordering type KBO6
% # Auto-mode selected ordering precedence scheme <invfreqconjmax>
% # Auto-mode selected weight ordering scheme <invfreqrank>
% #
% # Auto-Heuristic is analysing problem.
% # Problem is type GHSMGFFSF22MS
% # Auto-Mode selected heuristic G_E___200_C45_F1_AE_CS_SP_PI_S0Y
% # and selection function SelectMaxLComplexAvoidPosPred.
% #
% # Initializing proof state
% # Scanning for AC axioms
% # '+' is AC
% # AC handling enabled
% # Proof found!
% # SZS status Theorem
% # Parsed axioms : 13
% # Removed by relevancy pruning/SinE : 0
% # Initial clauses : 16
% # Removed in clause preprocessing : 0
% # Initial clauses in saturation : 16
% # Processed clauses : 1408
% # ...of these trivial : 76
% # ...subsumed : 1027
% # ...remaining for further processing: 305
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 17
% # Backward-rewritten : 47
% # Generated clauses : 6367
% # ...of the previous two non-trivial : 5559
% # Contextual simplify-reflections : 237
% # Paramodulations : 6367
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 241
% # Positive orientable unit clauses: 42
% # Positive unorientable unit clauses: 9
% # Negative unit clauses : 28
% # Non-unit-clauses : 162
% # Current number of unprocessed clauses: 3801
% # ...number of literals in the above : 7130
% # Clause-clause subsumption calls (NU) : 18253
% # Rec. Clause-clause subsumption calls : 14558
% # Non-unit clause-clause subsumptions: 680
% # Unit Clause-clause subsumption calls : 635
% # Rewrite failures with RHS unbound : 0
% # BW rewrite match attempts : 195
% # BW rewrite match successes : 66
% # SZS output start CNFRefutation.
% fof(2, axiom,![X2]:![X3]:![X4]:(('>='(X2,X3)&'>='(X3,X4))=>'>='(X2,X4)),file('/tmp/SRASS.s.p', sos_05)).
% fof(3, axiom,![X5]:![X6]:![X7]:('>='('+'(X5,X6),X7)<=>'>='(X6,'==>'(X5,X7))),file('/tmp/SRASS.s.p', sos_07)).
% fof(4, axiom,![X8]:![X9]:![X10]:('>='(X8,X9)=>'>='('+'(X8,X10),'+'(X9,X10))),file('/tmp/SRASS.s.p', sos_09)).
% fof(6, axiom,![X14]:![X15]:![X16]:('>='(X14,X15)=>'>='('==>'(X16,X14),'==>'(X16,X15))),file('/tmp/SRASS.s.p', sos_11)).
% fof(7, axiom,![X1]:![X17]:'+'(X1,'==>'(X1,X17))='+'(X17,'==>'(X17,X1)),file('/tmp/SRASS.s.p', sos_12)).
% fof(9, axiom,![X1]:![X17]:'+'(X1,X17)='+'(X17,X1),file('/tmp/SRASS.s.p', sos_02)).
% fof(10, axiom,![X19]:![X20]:(('>='(X19,X20)&'>='(X20,X19))=>X19=X20),file('/tmp/SRASS.s.p', sos_06)).
% fof(11, axiom,![X1]:'>='(X1,'0'),file('/tmp/SRASS.s.p', sos_08)).
% fof(12, axiom,![X1]:'+'(X1,'0')=X1,file('/tmp/SRASS.s.p', sos_03)).
% fof(13, conjecture,(('>='(c,a)&'>='(c,b))<=>'>='(c,'+'(a,'==>'(a,b)))),file('/tmp/SRASS.s.p', goals_13)).
% fof(14, negated_conjecture,~((('>='(c,a)&'>='(c,b))<=>'>='(c,'+'(a,'==>'(a,b))))),inference(assume_negation,[status(cth)],[13])).
% fof(17, plain,![X2]:![X3]:![X4]:((~('>='(X2,X3))|~('>='(X3,X4)))|'>='(X2,X4)),inference(fof_nnf,[status(thm)],[2])).
% fof(18, plain,![X5]:![X6]:![X7]:((~('>='(X5,X6))|~('>='(X6,X7)))|'>='(X5,X7)),inference(variable_rename,[status(thm)],[17])).
% cnf(19,plain,('>='(X1,X2)|~'>='(X3,X2)|~'>='(X1,X3)),inference(split_conjunct,[status(thm)],[18])).
% fof(20, plain,![X5]:![X6]:![X7]:((~('>='('+'(X5,X6),X7))|'>='(X6,'==>'(X5,X7)))&(~('>='(X6,'==>'(X5,X7)))|'>='('+'(X5,X6),X7))),inference(fof_nnf,[status(thm)],[3])).
% fof(21, plain,(![X5]:![X6]:![X7]:(~('>='('+'(X5,X6),X7))|'>='(X6,'==>'(X5,X7)))&![X5]:![X6]:![X7]:(~('>='(X6,'==>'(X5,X7)))|'>='('+'(X5,X6),X7))),inference(shift_quantors,[status(thm)],[20])).
% fof(22, plain,(![X8]:![X9]:![X10]:(~('>='('+'(X8,X9),X10))|'>='(X9,'==>'(X8,X10)))&![X11]:![X12]:![X13]:(~('>='(X12,'==>'(X11,X13)))|'>='('+'(X11,X12),X13))),inference(variable_rename,[status(thm)],[21])).
% fof(23, plain,![X8]:![X9]:![X10]:![X11]:![X12]:![X13]:((~('>='('+'(X8,X9),X10))|'>='(X9,'==>'(X8,X10)))&(~('>='(X12,'==>'(X11,X13)))|'>='('+'(X11,X12),X13))),inference(shift_quantors,[status(thm)],[22])).
% cnf(25,plain,('>='(X1,'==>'(X2,X3))|~'>='('+'(X2,X1),X3)),inference(split_conjunct,[status(thm)],[23])).
% fof(26, plain,![X8]:![X9]:![X10]:(~('>='(X8,X9))|'>='('+'(X8,X10),'+'(X9,X10))),inference(fof_nnf,[status(thm)],[4])).
% fof(27, plain,![X8]:![X9]:(~('>='(X8,X9))|![X10]:'>='('+'(X8,X10),'+'(X9,X10))),inference(shift_quantors,[status(thm)],[26])).
% fof(28, plain,![X11]:![X12]:(~('>='(X11,X12))|![X13]:'>='('+'(X11,X13),'+'(X12,X13))),inference(variable_rename,[status(thm)],[27])).
% fof(29, plain,![X11]:![X12]:![X13]:(~('>='(X11,X12))|'>='('+'(X11,X13),'+'(X12,X13))),inference(shift_quantors,[status(thm)],[28])).
% cnf(30,plain,('>='('+'(X1,X2),'+'(X3,X2))|~'>='(X1,X3)),inference(split_conjunct,[status(thm)],[29])).
% fof(36, plain,![X14]:![X15]:![X16]:(~('>='(X14,X15))|'>='('==>'(X16,X14),'==>'(X16,X15))),inference(fof_nnf,[status(thm)],[6])).
% fof(37, plain,![X14]:![X15]:(~('>='(X14,X15))|![X16]:'>='('==>'(X16,X14),'==>'(X16,X15))),inference(shift_quantors,[status(thm)],[36])).
% fof(38, plain,![X17]:![X18]:(~('>='(X17,X18))|![X19]:'>='('==>'(X19,X17),'==>'(X19,X18))),inference(variable_rename,[status(thm)],[37])).
% fof(39, plain,![X17]:![X18]:![X19]:(~('>='(X17,X18))|'>='('==>'(X19,X17),'==>'(X19,X18))),inference(shift_quantors,[status(thm)],[38])).
% cnf(40,plain,('>='('==>'(X1,X2),'==>'(X1,X3))|~'>='(X2,X3)),inference(split_conjunct,[status(thm)],[39])).
% fof(41, plain,![X18]:![X19]:'+'(X18,'==>'(X18,X19))='+'(X19,'==>'(X19,X18)),inference(variable_rename,[status(thm)],[7])).
% cnf(42,plain,('+'(X1,'==>'(X1,X2))='+'(X2,'==>'(X2,X1))),inference(split_conjunct,[status(thm)],[41])).
% fof(45, plain,![X18]:![X19]:'+'(X18,X19)='+'(X19,X18),inference(variable_rename,[status(thm)],[9])).
% cnf(46,plain,('+'(X1,X2)='+'(X2,X1)),inference(split_conjunct,[status(thm)],[45])).
% fof(47, plain,![X19]:![X20]:((~('>='(X19,X20))|~('>='(X20,X19)))|X19=X20),inference(fof_nnf,[status(thm)],[10])).
% fof(48, plain,![X21]:![X22]:((~('>='(X21,X22))|~('>='(X22,X21)))|X21=X22),inference(variable_rename,[status(thm)],[47])).
% cnf(49,plain,(X1=X2|~'>='(X2,X1)|~'>='(X1,X2)),inference(split_conjunct,[status(thm)],[48])).
% fof(50, plain,![X2]:'>='(X2,'0'),inference(variable_rename,[status(thm)],[11])).
% cnf(51,plain,('>='(X1,'0')),inference(split_conjunct,[status(thm)],[50])).
% fof(52, plain,![X2]:'+'(X2,'0')=X2,inference(variable_rename,[status(thm)],[12])).
% cnf(53,plain,('+'(X1,'0')=X1),inference(split_conjunct,[status(thm)],[52])).
% fof(54, negated_conjecture,(((~('>='(c,a))|~('>='(c,b)))|~('>='(c,'+'(a,'==>'(a,b)))))&(('>='(c,a)&'>='(c,b))|'>='(c,'+'(a,'==>'(a,b))))),inference(fof_nnf,[status(thm)],[14])).
% fof(55, negated_conjecture,(((~('>='(c,a))|~('>='(c,b)))|~('>='(c,'+'(a,'==>'(a,b)))))&(('>='(c,a)|'>='(c,'+'(a,'==>'(a,b))))&('>='(c,b)|'>='(c,'+'(a,'==>'(a,b)))))),inference(distribute,[status(thm)],[54])).
% cnf(56,negated_conjecture,('>='(c,'+'(a,'==>'(a,b)))|'>='(c,b)),inference(split_conjunct,[status(thm)],[55])).
% cnf(57,negated_conjecture,('>='(c,'+'(a,'==>'(a,b)))|'>='(c,a)),inference(split_conjunct,[status(thm)],[55])).
% cnf(58,negated_conjecture,(~'>='(c,'+'(a,'==>'(a,b)))|~'>='(c,b)|~'>='(c,a)),inference(split_conjunct,[status(thm)],[55])).
% cnf(61,plain,('+'('0',X1)=X1),inference(spm,[status(thm)],[53,46,theory(equality)])).
% cnf(65,plain,('0'=X1|~'>='('0',X1)),inference(spm,[status(thm)],[49,51,theory(equality)])).
% cnf(85,plain,('>='(X1,'==>'(X2,X3))|~'>='(X1,X4)|~'>='('+'(X2,X4),X3)),inference(spm,[status(thm)],[19,25,theory(equality)])).
% cnf(95,plain,('>='('+'(X2,X1),'+'(X3,X2))|~'>='(X1,X3)),inference(spm,[status(thm)],[30,46,theory(equality)])).
% cnf(123,plain,('>='('+'(X1,X2),X2)|~'>='(X1,'0')),inference(spm,[status(thm)],[30,61,theory(equality)])).
% cnf(127,plain,('>='('+'(X1,X2),X2)|$false),inference(rw,[status(thm)],[123,51,theory(equality)])).
% cnf(128,plain,('>='('+'(X1,X2),X2)),inference(cn,[status(thm)],[127,theory(equality)])).
% cnf(223,plain,('>='(X1,X2)|~'>='(X1,'+'(X3,X2))),inference(spm,[status(thm)],[19,128,theory(equality)])).
% cnf(244,plain,('>='(X1,X2)|~'>='(X1,'+'(X2,X3))),inference(spm,[status(thm)],[223,46,theory(equality)])).
% cnf(262,plain,('>='(X1,X2)|~'>='(X1,'+'(X3,'==>'(X3,X2)))),inference(spm,[status(thm)],[244,42,theory(equality)])).
% cnf(268,negated_conjecture,('>='(c,a)),inference(spm,[status(thm)],[244,57,theory(equality)])).
% cnf(279,negated_conjecture,('>='(X1,a)|~'>='(X1,c)),inference(spm,[status(thm)],[19,268,theory(equality)])).
% cnf(283,negated_conjecture,(~'>='(c,'+'(a,'==>'(a,b)))|$false|~'>='(c,b)),inference(rw,[status(thm)],[58,268,theory(equality)])).
% cnf(284,negated_conjecture,(~'>='(c,'+'(a,'==>'(a,b)))|~'>='(c,b)),inference(cn,[status(thm)],[283,theory(equality)])).
% cnf(290,negated_conjecture,('>='('+'(X1,c),a)),inference(spm,[status(thm)],[279,128,theory(equality)])).
% cnf(303,negated_conjecture,('>='('+'(c,X1),a)),inference(spm,[status(thm)],[290,46,theory(equality)])).
% cnf(668,negated_conjecture,('>='(X1,'==>'(c,a))|~'>='(X1,X2)),inference(spm,[status(thm)],[85,303,theory(equality)])).
% cnf(729,negated_conjecture,('>='(X1,'==>'(c,a))),inference(spm,[status(thm)],[668,51,theory(equality)])).
% cnf(930,negated_conjecture,('0'='==>'(c,a)),inference(spm,[status(thm)],[65,729,theory(equality)])).
% cnf(973,negated_conjecture,('+'(c,'0')='+'(a,'==>'(a,c))),inference(spm,[status(thm)],[42,930,theory(equality)])).
% cnf(988,negated_conjecture,(c='+'(a,'==>'(a,c))),inference(rw,[status(thm)],[973,53,theory(equality)])).
% cnf(1302,negated_conjecture,('>='(c,'+'(X1,a))|~'>='('==>'(a,c),X1)),inference(spm,[status(thm)],[95,988,theory(equality)])).
% cnf(3865,negated_conjecture,('>='(c,'+'('==>'(a,X1),a))|~'>='(c,X1)),inference(spm,[status(thm)],[1302,40,theory(equality)])).
% cnf(5646,negated_conjecture,('>='(c,b)),inference(spm,[status(thm)],[262,56,theory(equality)])).
% cnf(5713,negated_conjecture,(~'>='(c,'+'(a,'==>'(a,b)))|$false),inference(rw,[status(thm)],[284,5646,theory(equality)])).
% cnf(5714,negated_conjecture,(~'>='(c,'+'(a,'==>'(a,b)))),inference(cn,[status(thm)],[5713,theory(equality)])).
% cnf(9023,negated_conjecture,('>='(c,'+'(a,'==>'(a,X1)))|~'>='(c,X1)),inference(rw,[status(thm)],[3865,46,theory(equality)])).
% cnf(9032,negated_conjecture,(~'>='(c,b)),inference(spm,[status(thm)],[5714,9023,theory(equality)])).
% cnf(9049,negated_conjecture,($false),inference(rw,[status(thm)],[9032,5646,theory(equality)])).
% cnf(9050,negated_conjecture,($false),inference(cn,[status(thm)],[9049,theory(equality)])).
% cnf(9051,negated_conjecture,($false),9050,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 0.33 CPU 0.44 WC
% FINAL PrfWatch: 0.33 CPU 0.44 WC
% SZS output end Solution for /tmp/SystemOnTPTP23688/LCL894+1.tptp
%
%------------------------------------------------------------------------------