TSTP Solution File: LCL903+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : LCL903+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 : art10.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:43 EDT 2012
% Result : Theorem 0.95s
% Output : Solution 0.95s
% 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/SystemOnTPTP2143/LCL903+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP2143/LCL903+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP2143/LCL903+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 2257
% 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 : 14
% # Removed by relevancy pruning/SinE : 0
% # Initial clauses : 15
% # Removed in clause preprocessing : 0
% # Initial clauses in saturation : 15
% # Processed clauses : 785
% # ...of these trivial : 153
% # ...subsumed : 384
% # ...remaining for further processing: 248
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 46
% # Generated clauses : 12013
% # ...of the previous two non-trivial : 5457
% # Contextual simplify-reflections : 0
% # Paramodulations : 12013
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 186
% # Positive orientable unit clauses: 129
% # Positive unorientable unit clauses: 4
% # Negative unit clauses : 0
% # Non-unit-clauses : 53
% # Current number of unprocessed clauses: 4041
% # ...number of literals in the above : 4693
% # Clause-clause subsumption calls (NU) : 1127
% # Rec. Clause-clause subsumption calls : 1127
% # Non-unit clause-clause subsumptions: 361
% # Unit Clause-clause subsumption calls : 125
% # Rewrite failures with RHS unbound : 0
% # BW rewrite match attempts : 598
% # BW rewrite match successes : 123
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:'+'(X1,X2)='+'(X2,X1),file('/tmp/SRASS.s.p', sos_02)).
% fof(3, axiom,![X1]:'+'(X1,'0')=X1,file('/tmp/SRASS.s.p', sos_03)).
% fof(4, axiom,![X4]:![X5]:(('>='(X4,X5)&'>='(X5,X4))=>X4=X5),file('/tmp/SRASS.s.p', sos_06)).
% fof(5, axiom,![X6]:![X7]:![X8]:('>='(X6,X7)=>'>='('+'(X6,X8),'+'(X7,X8))),file('/tmp/SRASS.s.p', sos_09)).
% fof(6, axiom,![X1]:'+'(X1,'1')='1',file('/tmp/SRASS.s.p', sos_12)).
% fof(7, axiom,![X1]:'>='(X1,X1),file('/tmp/SRASS.s.p', sos_04)).
% fof(9, axiom,![X1]:'>='(X1,'0'),file('/tmp/SRASS.s.p', sos_08)).
% fof(10, axiom,![X12]:![X13]:![X14]:('>='(X12,X13)=>'>='('==>'(X13,X14),'==>'(X12,X14))),file('/tmp/SRASS.s.p', sos_10)).
% fof(11, axiom,![X15]:![X16]:![X17]:('>='(X15,X16)=>'>='('==>'(X17,X15),'==>'(X17,X16))),file('/tmp/SRASS.s.p', sos_11)).
% fof(12, axiom,![X18]:![X19]:![X20]:('>='('+'(X18,X19),X20)<=>'>='(X19,'==>'(X18,X20))),file('/tmp/SRASS.s.p', sos_07)).
% fof(13, axiom,![X1]:'==>'('==>'('==>'(X1,'1'),X1),X1)='0',file('/tmp/SRASS.s.p', sos_13)).
% fof(14, conjecture,![X21]:'+'(X21,X21)=X21,file('/tmp/SRASS.s.p', goals_14)).
% fof(15, negated_conjecture,~(![X21]:'+'(X21,X21)=X21),inference(assume_negation,[status(cth)],[14])).
% fof(18, plain,![X3]:![X4]:'+'(X3,X4)='+'(X4,X3),inference(variable_rename,[status(thm)],[2])).
% cnf(19,plain,('+'(X1,X2)='+'(X2,X1)),inference(split_conjunct,[status(thm)],[18])).
% fof(20, plain,![X2]:'+'(X2,'0')=X2,inference(variable_rename,[status(thm)],[3])).
% cnf(21,plain,('+'(X1,'0')=X1),inference(split_conjunct,[status(thm)],[20])).
% fof(22, plain,![X4]:![X5]:((~('>='(X4,X5))|~('>='(X5,X4)))|X4=X5),inference(fof_nnf,[status(thm)],[4])).
% fof(23, plain,![X6]:![X7]:((~('>='(X6,X7))|~('>='(X7,X6)))|X6=X7),inference(variable_rename,[status(thm)],[22])).
% cnf(24,plain,(X1=X2|~'>='(X2,X1)|~'>='(X1,X2)),inference(split_conjunct,[status(thm)],[23])).
% fof(25, plain,![X6]:![X7]:![X8]:(~('>='(X6,X7))|'>='('+'(X6,X8),'+'(X7,X8))),inference(fof_nnf,[status(thm)],[5])).
% fof(26, plain,![X6]:![X7]:(~('>='(X6,X7))|![X8]:'>='('+'(X6,X8),'+'(X7,X8))),inference(shift_quantors,[status(thm)],[25])).
% fof(27, plain,![X9]:![X10]:(~('>='(X9,X10))|![X11]:'>='('+'(X9,X11),'+'(X10,X11))),inference(variable_rename,[status(thm)],[26])).
% fof(28, plain,![X9]:![X10]:![X11]:(~('>='(X9,X10))|'>='('+'(X9,X11),'+'(X10,X11))),inference(shift_quantors,[status(thm)],[27])).
% cnf(29,plain,('>='('+'(X1,X2),'+'(X3,X2))|~'>='(X1,X3)),inference(split_conjunct,[status(thm)],[28])).
% fof(30, plain,![X2]:'+'(X2,'1')='1',inference(variable_rename,[status(thm)],[6])).
% cnf(31,plain,('+'(X1,'1')='1'),inference(split_conjunct,[status(thm)],[30])).
% fof(32, plain,![X2]:'>='(X2,X2),inference(variable_rename,[status(thm)],[7])).
% cnf(33,plain,('>='(X1,X1)),inference(split_conjunct,[status(thm)],[32])).
% fof(37, plain,![X2]:'>='(X2,'0'),inference(variable_rename,[status(thm)],[9])).
% cnf(38,plain,('>='(X1,'0')),inference(split_conjunct,[status(thm)],[37])).
% fof(39, plain,![X12]:![X13]:![X14]:(~('>='(X12,X13))|'>='('==>'(X13,X14),'==>'(X12,X14))),inference(fof_nnf,[status(thm)],[10])).
% fof(40, plain,![X12]:![X13]:(~('>='(X12,X13))|![X14]:'>='('==>'(X13,X14),'==>'(X12,X14))),inference(shift_quantors,[status(thm)],[39])).
% fof(41, plain,![X15]:![X16]:(~('>='(X15,X16))|![X17]:'>='('==>'(X16,X17),'==>'(X15,X17))),inference(variable_rename,[status(thm)],[40])).
% fof(42, plain,![X15]:![X16]:![X17]:(~('>='(X15,X16))|'>='('==>'(X16,X17),'==>'(X15,X17))),inference(shift_quantors,[status(thm)],[41])).
% cnf(43,plain,('>='('==>'(X1,X2),'==>'(X3,X2))|~'>='(X3,X1)),inference(split_conjunct,[status(thm)],[42])).
% fof(44, plain,![X15]:![X16]:![X17]:(~('>='(X15,X16))|'>='('==>'(X17,X15),'==>'(X17,X16))),inference(fof_nnf,[status(thm)],[11])).
% fof(45, plain,![X15]:![X16]:(~('>='(X15,X16))|![X17]:'>='('==>'(X17,X15),'==>'(X17,X16))),inference(shift_quantors,[status(thm)],[44])).
% fof(46, plain,![X18]:![X19]:(~('>='(X18,X19))|![X20]:'>='('==>'(X20,X18),'==>'(X20,X19))),inference(variable_rename,[status(thm)],[45])).
% fof(47, plain,![X18]:![X19]:![X20]:(~('>='(X18,X19))|'>='('==>'(X20,X18),'==>'(X20,X19))),inference(shift_quantors,[status(thm)],[46])).
% cnf(48,plain,('>='('==>'(X1,X2),'==>'(X1,X3))|~'>='(X2,X3)),inference(split_conjunct,[status(thm)],[47])).
% fof(49, plain,![X18]:![X19]:![X20]:((~('>='('+'(X18,X19),X20))|'>='(X19,'==>'(X18,X20)))&(~('>='(X19,'==>'(X18,X20)))|'>='('+'(X18,X19),X20))),inference(fof_nnf,[status(thm)],[12])).
% fof(50, plain,(![X18]:![X19]:![X20]:(~('>='('+'(X18,X19),X20))|'>='(X19,'==>'(X18,X20)))&![X18]:![X19]:![X20]:(~('>='(X19,'==>'(X18,X20)))|'>='('+'(X18,X19),X20))),inference(shift_quantors,[status(thm)],[49])).
% fof(51, plain,(![X21]:![X22]:![X23]:(~('>='('+'(X21,X22),X23))|'>='(X22,'==>'(X21,X23)))&![X24]:![X25]:![X26]:(~('>='(X25,'==>'(X24,X26)))|'>='('+'(X24,X25),X26))),inference(variable_rename,[status(thm)],[50])).
% fof(52, plain,![X21]:![X22]:![X23]:![X24]:![X25]:![X26]:((~('>='('+'(X21,X22),X23))|'>='(X22,'==>'(X21,X23)))&(~('>='(X25,'==>'(X24,X26)))|'>='('+'(X24,X25),X26))),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,![X2]:'==>'('==>'('==>'(X2,'1'),X2),X2)='0',inference(variable_rename,[status(thm)],[13])).
% cnf(56,plain,('==>'('==>'('==>'(X1,'1'),X1),X1)='0'),inference(split_conjunct,[status(thm)],[55])).
% fof(57, negated_conjecture,?[X21]:~('+'(X21,X21)=X21),inference(fof_nnf,[status(thm)],[15])).
% fof(58, negated_conjecture,?[X22]:~('+'(X22,X22)=X22),inference(variable_rename,[status(thm)],[57])).
% fof(59, negated_conjecture,~('+'(esk1_0,esk1_0)=esk1_0),inference(skolemize,[status(esa)],[58])).
% cnf(60,negated_conjecture,('+'(esk1_0,esk1_0)!=esk1_0),inference(split_conjunct,[status(thm)],[59])).
% cnf(74,plain,('+'('1',X1)='1'),inference(spm,[status(thm)],[31,19,theory(equality)])).
% cnf(75,plain,('+'('0',X1)=X1),inference(spm,[status(thm)],[21,19,theory(equality)])).
% cnf(87,plain,('>='('+'(X1,X2),'+'('0',X2))),inference(spm,[status(thm)],[29,38,theory(equality)])).
% cnf(95,plain,('>='('0','==>'(X1,X2))|~'>='(X1,X2)),inference(spm,[status(thm)],[54,21,theory(equality)])).
% cnf(96,plain,('>='(X1,'==>'(X2,X3))|~'>='('+'(X1,X2),X3)),inference(spm,[status(thm)],[54,19,theory(equality)])).
% cnf(99,plain,('>='(X1,'==>'(X2,'+'(X2,X1)))),inference(spm,[status(thm)],[54,33,theory(equality)])).
% cnf(104,plain,('>='('+'(X1,'==>'(X1,X2)),X2)),inference(spm,[status(thm)],[53,33,theory(equality)])).
% cnf(167,plain,('>='('+'(X1,X2),X2)),inference(rw,[status(thm)],[87,75,theory(equality)])).
% cnf(175,plain,('>='('==>'(X1,'+'(X2,X3)),'==>'(X1,X3))),inference(spm,[status(thm)],[48,167,theory(equality)])).
% cnf(176,plain,('>='(X1,'==>'(X2,X1))),inference(spm,[status(thm)],[54,167,theory(equality)])).
% cnf(178,plain,('>='('1',X1)),inference(spm,[status(thm)],[167,74,theory(equality)])).
% cnf(183,plain,('>='('+'(X2,X1),X2)),inference(spm,[status(thm)],[167,19,theory(equality)])).
% cnf(190,plain,(X1='1'|~'>='(X1,'1')),inference(spm,[status(thm)],[24,178,theory(equality)])).
% cnf(196,plain,('>='('==>'(X1,'1'),'==>'(X1,X2))),inference(spm,[status(thm)],[48,178,theory(equality)])).
% cnf(373,plain,('>='('0','==>'(X1,'==>'(X2,'+'(X2,X1))))),inference(spm,[status(thm)],[95,99,theory(equality)])).
% cnf(580,plain,('+'(X1,'==>'(X1,'1'))='1'),inference(spm,[status(thm)],[190,104,theory(equality)])).
% cnf(593,plain,('>='('+'('==>'('==>'(X1,'1'),X1),'0'),X1)),inference(spm,[status(thm)],[104,56,theory(equality)])).
% cnf(605,plain,('>='('==>'('==>'(X1,'1'),X1),X1)),inference(rw,[status(thm)],[593,21,theory(equality)])).
% cnf(738,plain,('>='(X1,'==>'('==>'(X1,'1'),X2))|~'>='('1',X2)),inference(spm,[status(thm)],[96,580,theory(equality)])).
% cnf(760,plain,('>='(X1,'==>'('==>'(X1,'1'),X2))|$false),inference(rw,[status(thm)],[738,178,theory(equality)])).
% cnf(761,plain,('>='(X1,'==>'('==>'(X1,'1'),X2))),inference(cn,[status(thm)],[760,theory(equality)])).
% cnf(783,plain,('>='('==>'('==>'(X1,X2),X3),'==>'('==>'(X1,'1'),X3))),inference(spm,[status(thm)],[43,196,theory(equality)])).
% cnf(888,plain,(X1='==>'('==>'(X1,'1'),X1)|~'>='(X1,'==>'('==>'(X1,'1'),X1))),inference(spm,[status(thm)],[24,605,theory(equality)])).
% cnf(905,plain,(X1='==>'('==>'(X1,'1'),X1)|$false),inference(rw,[status(thm)],[888,176,theory(equality)])).
% cnf(906,plain,(X1='==>'('==>'(X1,'1'),X1)),inference(cn,[status(thm)],[905,theory(equality)])).
% cnf(1857,plain,('>='('==>'('==>'(X1,'1'),'+'(X2,X1)),X1)),inference(spm,[status(thm)],[175,906,theory(equality)])).
% cnf(3862,plain,('==>'(X1,'==>'(X2,'+'(X2,X1)))='0'|~'>='('==>'(X1,'==>'(X2,'+'(X2,X1))),'0')),inference(spm,[status(thm)],[24,373,theory(equality)])).
% cnf(3896,plain,('==>'(X1,'==>'(X2,'+'(X2,X1)))='0'|$false),inference(rw,[status(thm)],[3862,38,theory(equality)])).
% cnf(3897,plain,('==>'(X1,'==>'(X2,'+'(X2,X1)))='0'),inference(cn,[status(thm)],[3896,theory(equality)])).
% cnf(7685,plain,(X1='==>'('==>'(X1,'1'),'+'(X2,X1))|~'>='(X1,'==>'('==>'(X1,'1'),'+'(X2,X1)))),inference(spm,[status(thm)],[24,1857,theory(equality)])).
% cnf(7725,plain,(X1='==>'('==>'(X1,'1'),'+'(X2,X1))|$false),inference(rw,[status(thm)],[7685,761,theory(equality)])).
% cnf(7726,plain,(X1='==>'('==>'(X1,'1'),'+'(X2,X1))),inference(cn,[status(thm)],[7725,theory(equality)])).
% cnf(7795,plain,('==>'('==>'(X1,'1'),'1')=X1),inference(spm,[status(thm)],[7726,74,theory(equality)])).
% cnf(7918,plain,('==>'(X1,'==>'(X1,'1'))='==>'(X1,'1')),inference(spm,[status(thm)],[906,7795,theory(equality)])).
% cnf(18412,plain,('>='('==>'('==>'(X1,X2),'==>'('==>'(X1,'1'),'1')),'==>'('==>'(X1,'1'),'1'))),inference(spm,[status(thm)],[783,7918,theory(equality)])).
% cnf(18514,plain,('>='('==>'('==>'(X1,X2),X1),X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[18412,7795,theory(equality)]),7795,theory(equality)])).
% cnf(18738,plain,(X1='==>'('==>'(X1,X2),X1)|~'>='(X1,'==>'('==>'(X1,X2),X1))),inference(spm,[status(thm)],[24,18514,theory(equality)])).
% cnf(18803,plain,(X1='==>'('==>'(X1,X2),X1)|$false),inference(rw,[status(thm)],[18738,176,theory(equality)])).
% cnf(18804,plain,(X1='==>'('==>'(X1,X2),X1)),inference(cn,[status(thm)],[18803,theory(equality)])).
% cnf(18928,plain,('==>'(X1,'==>'(X1,X2))='==>'(X1,X2)),inference(spm,[status(thm)],[18804,18804,theory(equality)])).
% cnf(19658,plain,('==>'(X1,'+'(X1,X1))='0'),inference(spm,[status(thm)],[3897,18928,theory(equality)])).
% cnf(19857,plain,('>='('+'(X1,'0'),'+'(X1,X1))),inference(spm,[status(thm)],[104,19658,theory(equality)])).
% cnf(19974,plain,('>='(X1,'+'(X1,X1))),inference(rw,[status(thm)],[19857,21,theory(equality)])).
% cnf(20071,plain,('+'(X1,X1)=X1|~'>='('+'(X1,X1),X1)),inference(spm,[status(thm)],[24,19974,theory(equality)])).
% cnf(20123,plain,('+'(X1,X1)=X1|$false),inference(rw,[status(thm)],[20071,183,theory(equality)])).
% cnf(20124,plain,('+'(X1,X1)=X1),inference(cn,[status(thm)],[20123,theory(equality)])).
% cnf(20325,negated_conjecture,($false),inference(rw,[status(thm)],[60,20124,theory(equality)])).
% cnf(20326,negated_conjecture,($false),inference(cn,[status(thm)],[20325,theory(equality)])).
% cnf(20327,negated_conjecture,($false),20326,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 0.43 CPU 0.54 WC
% FINAL PrfWatch: 0.43 CPU 0.54 WC
% SZS output end Solution for /tmp/SystemOnTPTP2143/LCL903+1.tptp
%
%------------------------------------------------------------------------------