TSTP Solution File: LCL899+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : LCL899+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:08:51 EDT 2012
% Result : Theorem 0.57s
% Output : Solution 0.57s
% 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/SystemOnTPTP1525/LCL899+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP1525/LCL899+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP1525/LCL899+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 1639
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # No SinE strategy applied
% # Auto-Ordering is analysing problem.
% # Problem is type HUSMGFFSF22MS
% # 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 HUSMGFFSF22MS
% # 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 : 108
% # ...of these trivial : 20
% # ...subsumed : 16
% # ...remaining for further processing: 72
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 22
% # Generated clauses : 374
% # ...of the previous two non-trivial : 229
% # Contextual simplify-reflections : 0
% # Paramodulations : 374
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 33
% # Positive orientable unit clauses: 15
% # Positive unorientable unit clauses: 2
% # Negative unit clauses : 0
% # Non-unit-clauses : 16
% # Current number of unprocessed clauses: 46
% # ...number of literals in the above : 57
% # Clause-clause subsumption calls (NU) : 62
% # Rec. Clause-clause subsumption calls : 62
% # Non-unit clause-clause subsumptions: 18
% # Unit Clause-clause subsumption calls : 22
% # Rewrite failures with RHS unbound : 0
% # BW rewrite match attempts : 69
% # BW rewrite match successes : 37
% # 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,![X3]:![X4]:![X5]:('>='(X3,X4)=>'>='('==>'(X4,X5),'==>'(X3,X5))),file('/tmp/SRASS.s.p', sos_10)).
% fof(5, axiom,![X9]:![X10]:(('>='(X9,X10)&'>='(X10,X9))=>X9=X10),file('/tmp/SRASS.s.p', sos_06)).
% fof(7, axiom,![X1]:![X2]:'+'(X1,X2)='+'(X2,X1),file('/tmp/SRASS.s.p', sos_02)).
% fof(8, axiom,![X1]:'>='(X1,X1),file('/tmp/SRASS.s.p', sos_04)).
% fof(10, axiom,![X15]:![X16]:![X17]:('>='('+'(X15,X16),X17)<=>'>='(X16,'==>'(X15,X17))),file('/tmp/SRASS.s.p', sos_07)).
% fof(12, axiom,![X1]:'+'(X1,'0')=X1,file('/tmp/SRASS.s.p', sos_03)).
% fof(13, axiom,![X1]:'>='(X1,'0'),file('/tmp/SRASS.s.p', sos_08)).
% fof(14, conjecture,![X21]:'==>'('==>'(X21,'1'),'1')=X21,file('/tmp/SRASS.s.p', goals_14)).
% fof(15, negated_conjecture,~(![X21]:'==>'('==>'(X21,'1'),'1')=X21),inference(assume_negation,[status(cth)],[14])).
% fof(16, plain,![X3]:![X4]:'==>'('==>'(X3,X4),X4)='==>'('==>'(X4,X3),X3),inference(variable_rename,[status(thm)],[1])).
% cnf(17,plain,('==>'('==>'(X1,X2),X2)='==>'('==>'(X2,X1),X1)),inference(split_conjunct,[status(thm)],[16])).
% fof(18, plain,![X2]:'+'(X2,'1')='1',inference(variable_rename,[status(thm)],[2])).
% cnf(19,plain,('+'(X1,'1')='1'),inference(split_conjunct,[status(thm)],[18])).
% fof(20, plain,![X3]:![X4]:![X5]:(~('>='(X3,X4))|'>='('==>'(X4,X5),'==>'(X3,X5))),inference(fof_nnf,[status(thm)],[3])).
% fof(21, plain,![X3]:![X4]:(~('>='(X3,X4))|![X5]:'>='('==>'(X4,X5),'==>'(X3,X5))),inference(shift_quantors,[status(thm)],[20])).
% fof(22, plain,![X6]:![X7]:(~('>='(X6,X7))|![X8]:'>='('==>'(X7,X8),'==>'(X6,X8))),inference(variable_rename,[status(thm)],[21])).
% fof(23, plain,![X6]:![X7]:![X8]:(~('>='(X6,X7))|'>='('==>'(X7,X8),'==>'(X6,X8))),inference(shift_quantors,[status(thm)],[22])).
% cnf(24,plain,('>='('==>'(X1,X2),'==>'(X3,X2))|~'>='(X3,X1)),inference(split_conjunct,[status(thm)],[23])).
% fof(30, plain,![X9]:![X10]:((~('>='(X9,X10))|~('>='(X10,X9)))|X9=X10),inference(fof_nnf,[status(thm)],[5])).
% fof(31, plain,![X11]:![X12]:((~('>='(X11,X12))|~('>='(X12,X11)))|X11=X12),inference(variable_rename,[status(thm)],[30])).
% cnf(32,plain,(X1=X2|~'>='(X2,X1)|~'>='(X1,X2)),inference(split_conjunct,[status(thm)],[31])).
% fof(35, plain,![X3]:![X4]:'+'(X3,X4)='+'(X4,X3),inference(variable_rename,[status(thm)],[7])).
% cnf(36,plain,('+'(X1,X2)='+'(X2,X1)),inference(split_conjunct,[status(thm)],[35])).
% fof(37, plain,![X2]:'>='(X2,X2),inference(variable_rename,[status(thm)],[8])).
% cnf(38,plain,('>='(X1,X1)),inference(split_conjunct,[status(thm)],[37])).
% fof(42, plain,![X15]:![X16]:![X17]:((~('>='('+'(X15,X16),X17))|'>='(X16,'==>'(X15,X17)))&(~('>='(X16,'==>'(X15,X17)))|'>='('+'(X15,X16),X17))),inference(fof_nnf,[status(thm)],[10])).
% fof(43, plain,(![X15]:![X16]:![X17]:(~('>='('+'(X15,X16),X17))|'>='(X16,'==>'(X15,X17)))&![X15]:![X16]:![X17]:(~('>='(X16,'==>'(X15,X17)))|'>='('+'(X15,X16),X17))),inference(shift_quantors,[status(thm)],[42])).
% fof(44, plain,(![X18]:![X19]:![X20]:(~('>='('+'(X18,X19),X20))|'>='(X19,'==>'(X18,X20)))&![X21]:![X22]:![X23]:(~('>='(X22,'==>'(X21,X23)))|'>='('+'(X21,X22),X23))),inference(variable_rename,[status(thm)],[43])).
% fof(45, plain,![X18]:![X19]:![X20]:![X21]:![X22]:![X23]:((~('>='('+'(X18,X19),X20))|'>='(X19,'==>'(X18,X20)))&(~('>='(X22,'==>'(X21,X23)))|'>='('+'(X21,X22),X23))),inference(shift_quantors,[status(thm)],[44])).
% cnf(46,plain,('>='('+'(X1,X2),X3)|~'>='(X2,'==>'(X1,X3))),inference(split_conjunct,[status(thm)],[45])).
% cnf(47,plain,('>='(X1,'==>'(X2,X3))|~'>='('+'(X2,X1),X3)),inference(split_conjunct,[status(thm)],[45])).
% fof(53, plain,![X2]:'+'(X2,'0')=X2,inference(variable_rename,[status(thm)],[12])).
% cnf(54,plain,('+'(X1,'0')=X1),inference(split_conjunct,[status(thm)],[53])).
% fof(55, plain,![X2]:'>='(X2,'0'),inference(variable_rename,[status(thm)],[13])).
% cnf(56,plain,('>='(X1,'0')),inference(split_conjunct,[status(thm)],[55])).
% fof(57, negated_conjecture,?[X21]:~('==>'('==>'(X21,'1'),'1')=X21),inference(fof_nnf,[status(thm)],[15])).
% fof(58, negated_conjecture,?[X22]:~('==>'('==>'(X22,'1'),'1')=X22),inference(variable_rename,[status(thm)],[57])).
% fof(59, negated_conjecture,~('==>'('==>'(esk1_0,'1'),'1')=esk1_0),inference(skolemize,[status(esa)],[58])).
% cnf(60,negated_conjecture,('==>'('==>'(esk1_0,'1'),'1')!=esk1_0),inference(split_conjunct,[status(thm)],[59])).
% cnf(61,negated_conjecture,('==>'('==>'('1',esk1_0),esk1_0)!=esk1_0),inference(rw,[status(thm)],[60,17,theory(equality)])).
% cnf(73,plain,('+'('0',X1)=X1),inference(spm,[status(thm)],[54,36,theory(equality)])).
% cnf(85,plain,('>='('==>'('0',X1),'==>'(X2,X1))),inference(spm,[status(thm)],[24,56,theory(equality)])).
% cnf(98,plain,('>='('0','==>'(X1,X2))|~'>='(X1,X2)),inference(spm,[status(thm)],[47,54,theory(equality)])).
% cnf(100,plain,('>='(X1,'==>'(X2,X3))|~'>='('+'(X1,X2),X3)),inference(spm,[status(thm)],[47,36,theory(equality)])).
% cnf(122,plain,('>='('0','==>'(X1,X1))),inference(spm,[status(thm)],[98,38,theory(equality)])).
% cnf(175,plain,('>='('+'(X1,'==>'('0',X2)),X2)),inference(spm,[status(thm)],[46,85,theory(equality)])).
% cnf(226,plain,('==>'(X1,X1)='0'|~'>='('==>'(X1,X1),'0')),inference(spm,[status(thm)],[32,122,theory(equality)])).
% cnf(237,plain,('==>'(X1,X1)='0'|$false),inference(rw,[status(thm)],[226,56,theory(equality)])).
% cnf(238,plain,('==>'(X1,X1)='0'),inference(cn,[status(thm)],[237,theory(equality)])).
% cnf(251,plain,('>='('+'(X1,X2),X1)|~'>='(X2,'0')),inference(spm,[status(thm)],[46,238,theory(equality)])).
% cnf(259,plain,('>='('+'(X1,X2),X1)|$false),inference(rw,[status(thm)],[251,56,theory(equality)])).
% cnf(260,plain,('>='('+'(X1,X2),X1)),inference(cn,[status(thm)],[259,theory(equality)])).
% cnf(308,plain,('>='(X1,'==>'(X2,X1))),inference(spm,[status(thm)],[100,260,theory(equality)])).
% cnf(313,plain,('>='('1',X1)),inference(spm,[status(thm)],[260,19,theory(equality)])).
% cnf(326,plain,('>='('0','==>'('1',X1))),inference(spm,[status(thm)],[98,313,theory(equality)])).
% cnf(363,plain,('==>'('1',X1)='0'|~'>='('==>'('1',X1),'0')),inference(spm,[status(thm)],[32,326,theory(equality)])).
% cnf(374,plain,('==>'('1',X1)='0'|$false),inference(rw,[status(thm)],[363,56,theory(equality)])).
% cnf(375,plain,('==>'('1',X1)='0'),inference(cn,[status(thm)],[374,theory(equality)])).
% cnf(388,negated_conjecture,('==>'('0',esk1_0)!=esk1_0),inference(rw,[status(thm)],[61,375,theory(equality)])).
% cnf(625,plain,('>='('==>'('0',X1),X1)),inference(spm,[status(thm)],[175,73,theory(equality)])).
% cnf(644,plain,(X1='==>'('0',X1)|~'>='(X1,'==>'('0',X1))),inference(spm,[status(thm)],[32,625,theory(equality)])).
% cnf(656,plain,(X1='==>'('0',X1)|$false),inference(rw,[status(thm)],[644,308,theory(equality)])).
% cnf(657,plain,(X1='==>'('0',X1)),inference(cn,[status(thm)],[656,theory(equality)])).
% cnf(675,negated_conjecture,($false),inference(rw,[status(thm)],[388,657,theory(equality)])).
% cnf(676,negated_conjecture,($false),inference(cn,[status(thm)],[675,theory(equality)])).
% cnf(677,negated_conjecture,($false),676,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 0.04 CPU 0.16 WC
% FINAL PrfWatch: 0.04 CPU 0.16 WC
% SZS output end Solution for /tmp/SystemOnTPTP1525/LCL899+1.tptp
%
%------------------------------------------------------------------------------