TSTP Solution File: LCL893+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : LCL893+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:08 EDT 2012
% Result : Theorem 0.60s
% Output : Solution 0.60s
% 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/SystemOnTPTP23408/LCL893+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP23408/LCL893+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP23408/LCL893+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 23522
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.03 WC
% # No SinE strategy applied
% # Auto-Ordering is analysing problem.
% # Problem is type HUSMGFFSF21MS
% # 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 HUSMGFFSF21MS
% # Auto-Mode selected heuristic G_E___200_C45_F1_AE_CS_SP_PI_S0S
% # and selection function SelectComplexG.
% #
% # Initializing proof state
% # Scanning for AC axioms
% # '+' is AC
% # AC handling enabled
% # Proof found!
% # SZS status Theorem
% # Parsed axioms : 15
% # Removed by relevancy pruning/SinE : 0
% # Initial clauses : 17
% # Removed in clause preprocessing : 0
% # Initial clauses in saturation : 17
% # Processed clauses : 56
% # ...of these trivial : 7
% # ...subsumed : 5
% # ...remaining for further processing: 44
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 204
% # ...of the previous two non-trivial : 137
% # Contextual simplify-reflections : 0
% # Paramodulations : 204
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 43
% # Positive orientable unit clauses: 21
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 1
% # Non-unit-clauses : 18
% # Current number of unprocessed clauses: 92
% # ...number of literals in the above : 108
% # Clause-clause subsumption calls (NU) : 14
% # Rec. Clause-clause subsumption calls : 14
% # Non-unit clause-clause subsumptions: 4
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound : 0
% # BW rewrite match attempts : 9
% # BW rewrite match successes : 7
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:'+'(X1,'0')=X1,file('/tmp/SRASS.s.p', sos_03)).
% fof(2, axiom,![X1]:h(X1)='==>'(h(X1),X1),file('/tmp/SRASS.s.p', sos_14)).
% fof(3, axiom,![X1]:'>='(X1,'0'),file('/tmp/SRASS.s.p', sos_09)).
% fof(4, axiom,![X2]:![X3]:(('>='(X2,X3)&'>='(X3,X2))=>X2=X3),file('/tmp/SRASS.s.p', sos_07)).
% fof(7, axiom,![X1]:'>='(X1,X1),file('/tmp/SRASS.s.p', sos_05)).
% fof(14, axiom,![X18]:![X19]:![X20]:('>='('+'(X18,X19),X20)<=>'>='(X19,'==>'(X18,X20))),file('/tmp/SRASS.s.p', sos_08)).
% fof(15, conjecture,![X21]:(h(X21)=X21=>X21='0'),file('/tmp/SRASS.s.p', goals_15)).
% fof(16, negated_conjecture,~(![X21]:(h(X21)=X21=>X21='0')),inference(assume_negation,[status(cth)],[15])).
% fof(17, plain,![X2]:'+'(X2,'0')=X2,inference(variable_rename,[status(thm)],[1])).
% cnf(18,plain,('+'(X1,'0')=X1),inference(split_conjunct,[status(thm)],[17])).
% fof(19, plain,![X2]:h(X2)='==>'(h(X2),X2),inference(variable_rename,[status(thm)],[2])).
% cnf(20,plain,(h(X1)='==>'(h(X1),X1)),inference(split_conjunct,[status(thm)],[19])).
% fof(21, plain,![X2]:'>='(X2,'0'),inference(variable_rename,[status(thm)],[3])).
% cnf(22,plain,('>='(X1,'0')),inference(split_conjunct,[status(thm)],[21])).
% fof(23, plain,![X2]:![X3]:((~('>='(X2,X3))|~('>='(X3,X2)))|X2=X3),inference(fof_nnf,[status(thm)],[4])).
% fof(24, plain,![X4]:![X5]:((~('>='(X4,X5))|~('>='(X5,X4)))|X4=X5),inference(variable_rename,[status(thm)],[23])).
% cnf(25,plain,(X1=X2|~'>='(X2,X1)|~'>='(X1,X2)),inference(split_conjunct,[status(thm)],[24])).
% fof(30, plain,![X2]:'>='(X2,X2),inference(variable_rename,[status(thm)],[7])).
% cnf(31,plain,('>='(X1,X1)),inference(split_conjunct,[status(thm)],[30])).
% fof(54, plain,![X18]:![X19]:![X20]:((~('>='('+'(X18,X19),X20))|'>='(X19,'==>'(X18,X20)))&(~('>='(X19,'==>'(X18,X20)))|'>='('+'(X18,X19),X20))),inference(fof_nnf,[status(thm)],[14])).
% fof(55, plain,(![X18]:![X19]:![X20]:(~('>='('+'(X18,X19),X20))|'>='(X19,'==>'(X18,X20)))&![X18]:![X19]:![X20]:(~('>='(X19,'==>'(X18,X20)))|'>='('+'(X18,X19),X20))),inference(shift_quantors,[status(thm)],[54])).
% fof(56, plain,(![X21]:![X22]:![X23]:(~('>='('+'(X21,X22),X23))|'>='(X22,'==>'(X21,X23)))&![X24]:![X25]:![X26]:(~('>='(X25,'==>'(X24,X26)))|'>='('+'(X24,X25),X26))),inference(variable_rename,[status(thm)],[55])).
% fof(57, plain,![X21]:![X22]:![X23]:![X24]:![X25]:![X26]:((~('>='('+'(X21,X22),X23))|'>='(X22,'==>'(X21,X23)))&(~('>='(X25,'==>'(X24,X26)))|'>='('+'(X24,X25),X26))),inference(shift_quantors,[status(thm)],[56])).
% cnf(59,plain,('>='(X1,'==>'(X2,X3))|~'>='('+'(X2,X1),X3)),inference(split_conjunct,[status(thm)],[57])).
% fof(60, negated_conjecture,?[X21]:(h(X21)=X21&~(X21='0')),inference(fof_nnf,[status(thm)],[16])).
% fof(61, negated_conjecture,?[X22]:(h(X22)=X22&~(X22='0')),inference(variable_rename,[status(thm)],[60])).
% fof(62, negated_conjecture,(h(esk1_0)=esk1_0&~(esk1_0='0')),inference(skolemize,[status(esa)],[61])).
% cnf(63,negated_conjecture,(esk1_0!='0'),inference(split_conjunct,[status(thm)],[62])).
% cnf(64,negated_conjecture,(h(esk1_0)=esk1_0),inference(split_conjunct,[status(thm)],[62])).
% cnf(65,negated_conjecture,('==>'(esk1_0,esk1_0)=esk1_0),inference(spm,[status(thm)],[20,64,theory(equality)])).
% cnf(93,plain,('>='('0','==>'(X1,X2))|~'>='(X1,X2)),inference(spm,[status(thm)],[59,18,theory(equality)])).
% cnf(324,plain,('>='('0','==>'(X1,X1))),inference(spm,[status(thm)],[93,31,theory(equality)])).
% cnf(365,negated_conjecture,('>='('0',esk1_0)),inference(spm,[status(thm)],[324,65,theory(equality)])).
% cnf(379,negated_conjecture,(esk1_0='0'|~'>='(esk1_0,'0')),inference(spm,[status(thm)],[25,365,theory(equality)])).
% cnf(387,negated_conjecture,(esk1_0='0'|$false),inference(rw,[status(thm)],[379,22,theory(equality)])).
% cnf(388,negated_conjecture,(esk1_0='0'),inference(cn,[status(thm)],[387,theory(equality)])).
% cnf(389,negated_conjecture,($false),inference(sr,[status(thm)],[388,63,theory(equality)])).
% cnf(390,negated_conjecture,($false),389,['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/SystemOnTPTP23408/LCL893+1.tptp
%
%------------------------------------------------------------------------------