TSTP Solution File: LCL901+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : LCL901+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 : art11.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:09:12 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/SystemOnTPTP3158/LCL901+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP3158/LCL901+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP3158/LCL901+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 3273
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 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 : 15
% # Removed by relevancy pruning/SinE : 0
% # Initial clauses : 16
% # Removed in clause preprocessing : 0
% # Initial clauses in saturation : 16
% # Processed clauses : 806
% # ...of these trivial : 212
% # ...subsumed : 380
% # ...remaining for further processing: 214
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 45
% # Generated clauses : 9691
% # ...of the previous two non-trivial : 4535
% # Contextual simplify-reflections : 0
% # Paramodulations : 9691
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 151
% # Positive orientable unit clauses: 105
% # Positive unorientable unit clauses: 4
% # Negative unit clauses : 0
% # Non-unit-clauses : 42
% # Current number of unprocessed clauses: 2761
% # ...number of literals in the above : 3372
% # Clause-clause subsumption calls (NU) : 1049
% # Rec. Clause-clause subsumption calls : 1049
% # Non-unit clause-clause subsumptions: 322
% # Unit Clause-clause subsumption calls : 52
% # Rewrite failures with RHS unbound : 0
% # BW rewrite match attempts : 347
% # BW rewrite match successes : 74
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:'==>'('==>'(X1,X2),X2)='==>'('==>'(X2,X1),X1),file('/tmp/SRASS.s.p', sos_13)).
% fof(2, axiom,![X1]:'+'(X1,'1')='1',file('/tmp/SRASS.s.p', sos_12)).
% fof(3, axiom,![X1]:'+'(X1,'0')=X1,file('/tmp/SRASS.s.p', sos_03)).
% fof(4, axiom,![X1]:'>='(X1,'0'),file('/tmp/SRASS.s.p', sos_08)).
% fof(6, axiom,![X6]:![X7]:![X8]:('>='(X6,X7)=>'>='('==>'(X8,X6),'==>'(X8,X7))),file('/tmp/SRASS.s.p', sos_11)).
% fof(7, axiom,![X9]:![X10]:(('>='(X9,X10)&'>='(X10,X9))=>X9=X10),file('/tmp/SRASS.s.p', sos_06)).
% fof(8, axiom,![X1]:![X2]:![X11]:'+'('+'(X1,X2),X11)='+'(X1,'+'(X2,X11)),file('/tmp/SRASS.s.p', sos_01)).
% fof(9, axiom,![X1]:![X2]:'+'(X1,X2)='+'(X2,X1),file('/tmp/SRASS.s.p', sos_02)).
% fof(10, axiom,![X1]:'>='(X1,X1),file('/tmp/SRASS.s.p', sos_04)).
% fof(12, axiom,![X1]:'+'(X1,X1)=X1,file('/tmp/SRASS.s.p', sos_14)).
% fof(13, axiom,![X15]:![X16]:![X17]:('>='('+'(X15,X16),X17)<=>'>='(X16,'==>'(X15,X17))),file('/tmp/SRASS.s.p', sos_07)).
% fof(14, axiom,![X18]:![X19]:![X20]:('>='(X18,X19)=>'>='('+'(X18,X20),'+'(X19,X20))),file('/tmp/SRASS.s.p', sos_09)).
% fof(15, conjecture,![X21]:'==>'('==>'('==>'(X21,'1'),X21),X21)='0',file('/tmp/SRASS.s.p', goals_15)).
% fof(16, negated_conjecture,~(![X21]:'==>'('==>'('==>'(X21,'1'),X21),X21)='0'),inference(assume_negation,[status(cth)],[15])).
% fof(17, plain,![X3]:![X4]:'==>'('==>'(X3,X4),X4)='==>'('==>'(X4,X3),X3),inference(variable_rename,[status(thm)],[1])).
% cnf(18,plain,('==>'('==>'(X1,X2),X2)='==>'('==>'(X2,X1),X1)),inference(split_conjunct,[status(thm)],[17])).
% fof(19, plain,![X2]:'+'(X2,'1')='1',inference(variable_rename,[status(thm)],[2])).
% cnf(20,plain,('+'(X1,'1')='1'),inference(split_conjunct,[status(thm)],[19])).
% fof(21, plain,![X2]:'+'(X2,'0')=X2,inference(variable_rename,[status(thm)],[3])).
% cnf(22,plain,('+'(X1,'0')=X1),inference(split_conjunct,[status(thm)],[21])).
% fof(23, plain,![X2]:'>='(X2,'0'),inference(variable_rename,[status(thm)],[4])).
% cnf(24,plain,('>='(X1,'0')),inference(split_conjunct,[status(thm)],[23])).
% fof(30, plain,![X6]:![X7]:![X8]:(~('>='(X6,X7))|'>='('==>'(X8,X6),'==>'(X8,X7))),inference(fof_nnf,[status(thm)],[6])).
% fof(31, plain,![X6]:![X7]:(~('>='(X6,X7))|![X8]:'>='('==>'(X8,X6),'==>'(X8,X7))),inference(shift_quantors,[status(thm)],[30])).
% fof(32, plain,![X9]:![X10]:(~('>='(X9,X10))|![X11]:'>='('==>'(X11,X9),'==>'(X11,X10))),inference(variable_rename,[status(thm)],[31])).
% fof(33, plain,![X9]:![X10]:![X11]:(~('>='(X9,X10))|'>='('==>'(X11,X9),'==>'(X11,X10))),inference(shift_quantors,[status(thm)],[32])).
% cnf(34,plain,('>='('==>'(X1,X2),'==>'(X1,X3))|~'>='(X2,X3)),inference(split_conjunct,[status(thm)],[33])).
% fof(35, plain,![X9]:![X10]:((~('>='(X9,X10))|~('>='(X10,X9)))|X9=X10),inference(fof_nnf,[status(thm)],[7])).
% fof(36, plain,![X11]:![X12]:((~('>='(X11,X12))|~('>='(X12,X11)))|X11=X12),inference(variable_rename,[status(thm)],[35])).
% cnf(37,plain,(X1=X2|~'>='(X2,X1)|~'>='(X1,X2)),inference(split_conjunct,[status(thm)],[36])).
% fof(38, plain,![X12]:![X13]:![X14]:'+'('+'(X12,X13),X14)='+'(X12,'+'(X13,X14)),inference(variable_rename,[status(thm)],[8])).
% cnf(39,plain,('+'('+'(X1,X2),X3)='+'(X1,'+'(X2,X3))),inference(split_conjunct,[status(thm)],[38])).
% fof(40, plain,![X3]:![X4]:'+'(X3,X4)='+'(X4,X3),inference(variable_rename,[status(thm)],[9])).
% cnf(41,plain,('+'(X1,X2)='+'(X2,X1)),inference(split_conjunct,[status(thm)],[40])).
% fof(42, plain,![X2]:'>='(X2,X2),inference(variable_rename,[status(thm)],[10])).
% cnf(43,plain,('>='(X1,X1)),inference(split_conjunct,[status(thm)],[42])).
% fof(47, plain,![X2]:'+'(X2,X2)=X2,inference(variable_rename,[status(thm)],[12])).
% cnf(48,plain,('+'(X1,X1)=X1),inference(split_conjunct,[status(thm)],[47])).
% fof(49, plain,![X15]:![X16]:![X17]:((~('>='('+'(X15,X16),X17))|'>='(X16,'==>'(X15,X17)))&(~('>='(X16,'==>'(X15,X17)))|'>='('+'(X15,X16),X17))),inference(fof_nnf,[status(thm)],[13])).
% fof(50, plain,(![X15]:![X16]:![X17]:(~('>='('+'(X15,X16),X17))|'>='(X16,'==>'(X15,X17)))&![X15]:![X16]:![X17]:(~('>='(X16,'==>'(X15,X17)))|'>='('+'(X15,X16),X17))),inference(shift_quantors,[status(thm)],[49])).
% fof(51, plain,(![X18]:![X19]:![X20]:(~('>='('+'(X18,X19),X20))|'>='(X19,'==>'(X18,X20)))&![X21]:![X22]:![X23]:(~('>='(X22,'==>'(X21,X23)))|'>='('+'(X21,X22),X23))),inference(variable_rename,[status(thm)],[50])).
% fof(52, plain,![X18]:![X19]:![X20]:![X21]:![X22]:![X23]:((~('>='('+'(X18,X19),X20))|'>='(X19,'==>'(X18,X20)))&(~('>='(X22,'==>'(X21,X23)))|'>='('+'(X21,X22),X23))),inference(shift_quantors,[status(thm)],[51])).
% cnf(53,plain,('>='('+'(X1,X2),X3)|~'>='(X2,'==>'(X1,X3))),inference(split_conjunct,[status(thm)],[52])).
% cnf(54,plain,('>='(X1,'==>'(X2,X3))|~'>='('+'(X2,X1),X3)),inference(split_conjunct,[status(thm)],[52])).
% fof(55, plain,![X18]:![X19]:![X20]:(~('>='(X18,X19))|'>='('+'(X18,X20),'+'(X19,X20))),inference(fof_nnf,[status(thm)],[14])).
% fof(56, plain,![X18]:![X19]:(~('>='(X18,X19))|![X20]:'>='('+'(X18,X20),'+'(X19,X20))),inference(shift_quantors,[status(thm)],[55])).
% fof(57, plain,![X21]:![X22]:(~('>='(X21,X22))|![X23]:'>='('+'(X21,X23),'+'(X22,X23))),inference(variable_rename,[status(thm)],[56])).
% fof(58, plain,![X21]:![X22]:![X23]:(~('>='(X21,X22))|'>='('+'(X21,X23),'+'(X22,X23))),inference(shift_quantors,[status(thm)],[57])).
% cnf(59,plain,('>='('+'(X1,X2),'+'(X3,X2))|~'>='(X1,X3)),inference(split_conjunct,[status(thm)],[58])).
% fof(60, negated_conjecture,?[X21]:~('==>'('==>'('==>'(X21,'1'),X21),X21)='0'),inference(fof_nnf,[status(thm)],[16])).
% fof(61, negated_conjecture,?[X22]:~('==>'('==>'('==>'(X22,'1'),X22),X22)='0'),inference(variable_rename,[status(thm)],[60])).
% fof(62, negated_conjecture,~('==>'('==>'('==>'(esk1_0,'1'),esk1_0),esk1_0)='0'),inference(skolemize,[status(esa)],[61])).
% cnf(63,negated_conjecture,('==>'('==>'('==>'(esk1_0,'1'),esk1_0),esk1_0)!='0'),inference(split_conjunct,[status(thm)],[62])).
% cnf(65,plain,('+'('0',X1)=X1),inference(spm,[status(thm)],[22,41,theory(equality)])).
% cnf(99,plain,('>='('+'(X1,'==>'(X1,X2)),X2)),inference(spm,[status(thm)],[53,43,theory(equality)])).
% cnf(106,plain,('>='('0','==>'(X1,X2))|~'>='(X1,X2)),inference(spm,[status(thm)],[54,22,theory(equality)])).
% cnf(109,plain,('>='(X1,'==>'(X2,X3))|~'>='('+'(X1,X2),X3)),inference(spm,[status(thm)],[54,41,theory(equality)])).
% cnf(112,plain,('>='(X1,'==>'(X2,'+'(X2,X1)))),inference(spm,[status(thm)],[54,43,theory(equality)])).
% cnf(125,plain,('>='(X1,'==>'('0',X2))|~'>='(X1,X2)),inference(spm,[status(thm)],[54,65,theory(equality)])).
% cnf(132,plain,('>='('0','==>'(X1,X1))),inference(spm,[status(thm)],[106,43,theory(equality)])).
% cnf(134,plain,('>='(X1,'==>'('0',X1))),inference(spm,[status(thm)],[125,43,theory(equality)])).
% cnf(243,plain,('==>'(X1,X1)='0'|~'>='('==>'(X1,X1),'0')),inference(spm,[status(thm)],[37,132,theory(equality)])).
% cnf(255,plain,('==>'(X1,X1)='0'|$false),inference(rw,[status(thm)],[243,24,theory(equality)])).
% cnf(256,plain,('==>'(X1,X1)='0'),inference(cn,[status(thm)],[255,theory(equality)])).
% cnf(269,plain,('>='('+'(X1,X2),X1)|~'>='(X2,'0')),inference(spm,[status(thm)],[53,256,theory(equality)])).
% cnf(277,plain,('>='('+'(X1,X2),X1)|$false),inference(rw,[status(thm)],[269,24,theory(equality)])).
% cnf(278,plain,('>='('+'(X1,X2),X1)),inference(cn,[status(thm)],[277,theory(equality)])).
% cnf(314,plain,('>='(X1,'==>'(X2,X1))),inference(spm,[status(thm)],[109,278,theory(equality)])).
% cnf(319,plain,('>='('1',X1)),inference(spm,[status(thm)],[278,20,theory(equality)])).
% cnf(321,plain,('>='('+'(X2,X1),X1)),inference(spm,[status(thm)],[278,41,theory(equality)])).
% cnf(334,plain,('>='('0','==>'('1',X1))),inference(spm,[status(thm)],[106,319,theory(equality)])).
% cnf(351,plain,('==>'('1',X1)='0'|~'>='('==>'('1',X1),'0')),inference(spm,[status(thm)],[37,334,theory(equality)])).
% cnf(363,plain,('==>'('1',X1)='0'|$false),inference(rw,[status(thm)],[351,24,theory(equality)])).
% cnf(364,plain,('==>'('1',X1)='0'),inference(cn,[status(thm)],[363,theory(equality)])).
% cnf(372,plain,('==>'('0',X1)='==>'('==>'(X1,'1'),'1')),inference(spm,[status(thm)],[18,364,theory(equality)])).
% cnf(386,plain,('>='('0','==>'('+'(X1,'==>'(X1,X2)),X2))),inference(spm,[status(thm)],[106,99,theory(equality)])).
% cnf(399,plain,('>='('==>'('0',X1),X1)),inference(spm,[status(thm)],[99,65,theory(equality)])).
% cnf(411,plain,(X1='==>'('0',X1)|~'>='(X1,'==>'('0',X1))),inference(spm,[status(thm)],[37,399,theory(equality)])).
% cnf(422,plain,(X1='==>'('0',X1)|$false),inference(rw,[status(thm)],[411,134,theory(equality)])).
% cnf(423,plain,(X1='==>'('0',X1)),inference(cn,[status(thm)],[422,theory(equality)])).
% cnf(453,plain,('>='('+'(X1,X2),'+'('==>'(X3,X1),X2))),inference(spm,[status(thm)],[59,314,theory(equality)])).
% cnf(476,plain,('>='('==>'(X1,'+'(X2,X3)),'==>'(X1,X3))),inference(spm,[status(thm)],[34,321,theory(equality)])).
% cnf(557,plain,('==>'('==>'(X1,'1'),'1')=X1),inference(rw,[status(thm)],[372,423,theory(equality)])).
% cnf(772,plain,('==>'(X1,'+'(X1,X2))=X2|~'>='('==>'(X1,'+'(X1,X2)),X2)),inference(spm,[status(thm)],[37,112,theory(equality)])).
% cnf(3427,plain,('==>'('+'(X1,'==>'(X1,X2)),X2)='0'|~'>='('==>'('+'(X1,'==>'(X1,X2)),X2),'0')),inference(spm,[status(thm)],[37,386,theory(equality)])).
% cnf(3458,plain,('==>'('+'(X1,'==>'(X1,X2)),X2)='0'|$false),inference(rw,[status(thm)],[3427,24,theory(equality)])).
% cnf(3459,plain,('==>'('+'(X1,'==>'(X1,X2)),X2)='0'),inference(cn,[status(thm)],[3458,theory(equality)])).
% cnf(4394,plain,('>='(X1,'+'('==>'(X2,X1),X1))),inference(spm,[status(thm)],[453,48,theory(equality)])).
% cnf(4525,plain,('>='(X1,'+'(X1,'==>'(X2,X1)))),inference(rw,[status(thm)],[4394,41,theory(equality)])).
% cnf(4531,plain,('+'(X1,'==>'(X2,X1))=X1|~'>='('+'(X1,'==>'(X2,X1)),X1)),inference(spm,[status(thm)],[37,4525,theory(equality)])).
% cnf(4574,plain,('+'(X1,'==>'(X2,X1))=X1|$false),inference(rw,[status(thm)],[4531,278,theory(equality)])).
% cnf(4575,plain,('+'(X1,'==>'(X2,X1))=X1),inference(cn,[status(thm)],[4574,theory(equality)])).
% cnf(4665,plain,('+'(X1,'==>'('==>'(X1,X2),X2))=X1),inference(spm,[status(thm)],[4575,18,theory(equality)])).
% cnf(5820,plain,('+'('+'(X1,'==>'(X1,X2)),'==>'('0',X2))='+'(X1,'==>'(X1,X2))),inference(spm,[status(thm)],[4665,3459,theory(equality)])).
% cnf(5873,plain,('+'(X1,X2)='+'(X1,'==>'(X1,X2))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[5820,423,theory(equality)]),39,theory(equality)]),41,theory(equality)]),4575,theory(equality)])).
% cnf(15711,plain,('==>'(X1,'+'(X1,X2))='==>'(X1,X2)|~'>='('==>'(X1,'+'(X1,X2)),'==>'(X1,X2))),inference(spm,[status(thm)],[772,5873,theory(equality)])).
% cnf(15740,plain,('==>'(X1,'+'(X1,X2))='==>'(X1,X2)|$false),inference(rw,[status(thm)],[15711,476,theory(equality)])).
% cnf(15741,plain,('==>'(X1,'+'(X1,X2))='==>'(X1,X2)),inference(cn,[status(thm)],[15740,theory(equality)])).
% cnf(15861,plain,('==>'(X1,'+'(X1,X2))='==>'(X1,'==>'(X1,X2))),inference(spm,[status(thm)],[15741,5873,theory(equality)])).
% cnf(15964,plain,('==>'(X1,X2)='==>'(X1,'==>'(X1,X2))),inference(rw,[status(thm)],[15861,15741,theory(equality)])).
% cnf(16076,plain,('==>'('==>'(X1,'1'),X1)=X1),inference(spm,[status(thm)],[15964,557,theory(equality)])).
% cnf(16351,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[63,16076,theory(equality)]),256,theory(equality)])).
% cnf(16352,negated_conjecture,($false),inference(cn,[status(thm)],[16351,theory(equality)])).
% cnf(16353,negated_conjecture,($false),16352,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 0.35 CPU 0.46 WC
% FINAL PrfWatch: 0.35 CPU 0.46 WC
% SZS output end Solution for /tmp/SystemOnTPTP3158/LCL901+1.tptp
%
%------------------------------------------------------------------------------