TSTP Solution File: NUM852+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM852+2 : TPTP v5.0.0. Released v4.1.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 : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Wed Dec 29 20:53:25 EST 2010
% Result : Theorem 1.17s
% Output : Solution 1.17s
% 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/SystemOnTPTP26735/NUM852+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP26735/NUM852+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP26735/NUM852+2.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=60 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 60s
% TreeLimitedRun: WC time limit is 120s
% TreeLimitedRun: PID is 26867
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,less(vd480,vd481),file('/tmp/SRASS.s.p', 'holds(antec(304), 482, 0)')).
% fof(5, axiom,![X6]:![X7]:vmul(X6,X7)=vmul(X7,X6),file('/tmp/SRASS.s.p', 'ass(cond(270, 0), 0)')).
% fof(7, axiom,![X10]:![X11]:(~(X10=X11)|~(greater(X10,X11))),file('/tmp/SRASS.s.p', 'ass(cond(goal(130), 0), 3)')).
% fof(11, axiom,![X12]:![X13]:(less(X12,X13)=>greater(X13,X12)),file('/tmp/SRASS.s.p', 'ass(cond(147, 0), 0)')).
% fof(13, axiom,![X10]:![X11]:(~(greater(X10,X11))|~(less(X10,X11))),file('/tmp/SRASS.s.p', 'ass(cond(goal(130), 0), 2)')).
% fof(14, axiom,![X16]:![X17]:(greater(X17,X16)<=>?[X18]:X17=vplus(X16,X18)),file('/tmp/SRASS.s.p', 'def(cond(conseq(axiom(3)), 11), 1)')).
% fof(16, axiom,![X19]:![X20]:![X21]:vmul(X19,vplus(X20,X21))=vplus(vmul(X19,X20),vmul(X19,X21)),file('/tmp/SRASS.s.p', 'ass(cond(281, 0), 0)')).
% fof(18, axiom,![X24]:![X25]:(less(X25,X24)<=>?[X26]:X24=vplus(X25,X26)),file('/tmp/SRASS.s.p', 'def(cond(conseq(axiom(3)), 12), 1)')).
% fof(19, axiom,![X10]:![X11]:((X10=X11|greater(X10,X11))|less(X10,X11)),file('/tmp/SRASS.s.p', 'ass(cond(goal(130), 0), 0)')).
% fof(20, conjecture,greater(vmul(vd481,vd469),vmul(vd480,vd469)),file('/tmp/SRASS.s.p', 'holds(conseq_conjunct1(conseq_conjunct2(conseq(304))), 484, 0)')).
% fof(21, negated_conjecture,~(greater(vmul(vd481,vd469),vmul(vd480,vd469))),inference(assume_negation,[status(cth)],[20])).
% fof(22, plain,![X10]:![X11]:(~(X10=X11)|~(greater(X10,X11))),inference(fof_simplification,[status(thm)],[7,theory(equality)])).
% fof(23, plain,![X10]:![X11]:(~(greater(X10,X11))|~(less(X10,X11))),inference(fof_simplification,[status(thm)],[13,theory(equality)])).
% fof(25, negated_conjecture,~(greater(vmul(vd481,vd469),vmul(vd480,vd469))),inference(fof_simplification,[status(thm)],[21,theory(equality)])).
% cnf(30,plain,(less(vd480,vd481)),inference(split_conjunct,[status(thm)],[3])).
% fof(33, plain,![X8]:![X9]:vmul(X8,X9)=vmul(X9,X8),inference(variable_rename,[status(thm)],[5])).
% cnf(34,plain,(vmul(X1,X2)=vmul(X2,X1)),inference(split_conjunct,[status(thm)],[33])).
% fof(38, plain,![X12]:![X13]:(~(X12=X13)|~(greater(X12,X13))),inference(variable_rename,[status(thm)],[22])).
% cnf(39,plain,(~greater(X1,X2)|X1!=X2),inference(split_conjunct,[status(thm)],[38])).
% fof(49, plain,![X12]:![X13]:(~(less(X12,X13))|greater(X13,X12)),inference(fof_nnf,[status(thm)],[11])).
% fof(50, plain,![X14]:![X15]:(~(less(X14,X15))|greater(X15,X14)),inference(variable_rename,[status(thm)],[49])).
% cnf(51,plain,(greater(X1,X2)|~less(X2,X1)),inference(split_conjunct,[status(thm)],[50])).
% fof(55, plain,![X12]:![X13]:(~(greater(X12,X13))|~(less(X12,X13))),inference(variable_rename,[status(thm)],[23])).
% cnf(56,plain,(~less(X1,X2)|~greater(X1,X2)),inference(split_conjunct,[status(thm)],[55])).
% fof(57, plain,![X16]:![X17]:((~(greater(X17,X16))|?[X18]:X17=vplus(X16,X18))&(![X18]:~(X17=vplus(X16,X18))|greater(X17,X16))),inference(fof_nnf,[status(thm)],[14])).
% fof(58, plain,![X19]:![X20]:((~(greater(X20,X19))|?[X21]:X20=vplus(X19,X21))&(![X22]:~(X20=vplus(X19,X22))|greater(X20,X19))),inference(variable_rename,[status(thm)],[57])).
% fof(59, plain,![X19]:![X20]:((~(greater(X20,X19))|X20=vplus(X19,esk1_2(X19,X20)))&(![X22]:~(X20=vplus(X19,X22))|greater(X20,X19))),inference(skolemize,[status(esa)],[58])).
% fof(60, plain,![X19]:![X20]:![X22]:((~(X20=vplus(X19,X22))|greater(X20,X19))&(~(greater(X20,X19))|X20=vplus(X19,esk1_2(X19,X20)))),inference(shift_quantors,[status(thm)],[59])).
% cnf(62,plain,(greater(X1,X2)|X1!=vplus(X2,X3)),inference(split_conjunct,[status(thm)],[60])).
% fof(65, plain,![X22]:![X23]:![X24]:vmul(X22,vplus(X23,X24))=vplus(vmul(X22,X23),vmul(X22,X24)),inference(variable_rename,[status(thm)],[16])).
% cnf(66,plain,(vmul(X1,vplus(X2,X3))=vplus(vmul(X1,X2),vmul(X1,X3))),inference(split_conjunct,[status(thm)],[65])).
% fof(69, plain,![X24]:![X25]:((~(less(X25,X24))|?[X26]:X24=vplus(X25,X26))&(![X26]:~(X24=vplus(X25,X26))|less(X25,X24))),inference(fof_nnf,[status(thm)],[18])).
% fof(70, plain,![X27]:![X28]:((~(less(X28,X27))|?[X29]:X27=vplus(X28,X29))&(![X30]:~(X27=vplus(X28,X30))|less(X28,X27))),inference(variable_rename,[status(thm)],[69])).
% fof(71, plain,![X27]:![X28]:((~(less(X28,X27))|X27=vplus(X28,esk2_2(X27,X28)))&(![X30]:~(X27=vplus(X28,X30))|less(X28,X27))),inference(skolemize,[status(esa)],[70])).
% fof(72, plain,![X27]:![X28]:![X30]:((~(X27=vplus(X28,X30))|less(X28,X27))&(~(less(X28,X27))|X27=vplus(X28,esk2_2(X27,X28)))),inference(shift_quantors,[status(thm)],[71])).
% cnf(73,plain,(X1=vplus(X2,esk2_2(X1,X2))|~less(X2,X1)),inference(split_conjunct,[status(thm)],[72])).
% cnf(74,plain,(less(X1,X2)|X2!=vplus(X1,X3)),inference(split_conjunct,[status(thm)],[72])).
% fof(75, plain,![X12]:![X13]:((X12=X13|greater(X12,X13))|less(X12,X13)),inference(variable_rename,[status(thm)],[19])).
% cnf(76,plain,(less(X1,X2)|greater(X1,X2)|X1=X2),inference(split_conjunct,[status(thm)],[75])).
% cnf(77,negated_conjecture,(~greater(vmul(vd481,vd469),vmul(vd480,vd469))),inference(split_conjunct,[status(thm)],[25])).
% cnf(78,plain,(~greater(X1,X1)),inference(er,[status(thm)],[39,theory(equality)])).
% cnf(85,plain,(greater(X1,X2)|X2=X1|greater(X2,X1)),inference(spm,[status(thm)],[51,76,theory(equality)])).
% cnf(86,negated_conjecture,(~greater(vmul(vd469,vd481),vmul(vd469,vd480))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[77,34,theory(equality)]),34,theory(equality)])).
% cnf(89,plain,(less(X1,vplus(X1,X2))),inference(er,[status(thm)],[74,theory(equality)])).
% cnf(110,plain,(vplus(vd480,esk2_2(vd481,vd480))=vd481),inference(spm,[status(thm)],[73,30,theory(equality)])).
% cnf(112,plain,(greater(X1,vmul(X2,X3))|vmul(X2,vplus(X3,X4))!=X1),inference(spm,[status(thm)],[62,66,theory(equality)])).
% cnf(167,plain,(~greater(X1,vplus(X1,X2))),inference(spm,[status(thm)],[56,89,theory(equality)])).
% cnf(175,plain,(~greater(vmul(X1,X2),vmul(X1,vplus(X2,X3)))),inference(spm,[status(thm)],[167,66,theory(equality)])).
% cnf(667,plain,(~greater(vmul(X1,vd480),vmul(X1,vd481))),inference(spm,[status(thm)],[175,110,theory(equality)])).
% cnf(698,plain,(vmul(X1,vd480)=vmul(X1,vd481)|greater(vmul(X1,vd481),vmul(X1,vd480))),inference(spm,[status(thm)],[667,85,theory(equality)])).
% cnf(850,negated_conjecture,(vmul(vd469,vd480)=vmul(vd469,vd481)),inference(spm,[status(thm)],[86,698,theory(equality)])).
% cnf(1660,plain,(greater(X1,vmul(X2,vd480))|vmul(X2,vd481)!=X1),inference(spm,[status(thm)],[112,110,theory(equality)])).
% cnf(1690,plain,(greater(vmul(X1,vd481),vmul(X1,vd480))),inference(er,[status(thm)],[1660,theory(equality)])).
% cnf(1712,negated_conjecture,(greater(vmul(vd469,vd481),vmul(vd469,vd481))),inference(spm,[status(thm)],[1690,850,theory(equality)])).
% cnf(1727,negated_conjecture,($false),inference(sr,[status(thm)],[1712,78,theory(equality)])).
% cnf(1728,negated_conjecture,($false),1727,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 178
% # ...of these trivial : 31
% # ...subsumed : 68
% # ...remaining for further processing: 79
% # Other redundant clauses eliminated : 4
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 4
% # Generated clauses : 1271
% # ...of the previous two non-trivial : 1192
% # Contextual simplify-reflections : 0
% # Paramodulations : 1257
% # Factorizations : 2
% # Equation resolutions : 12
% # Current number of processed clauses: 72
% # Positive orientable unit clauses: 21
% # Positive unorientable unit clauses: 9
% # Negative unit clauses : 14
% # Non-unit-clauses : 28
% # Current number of unprocessed clauses: 884
% # ...number of literals in the above : 1121
% # Clause-clause subsumption calls (NU) : 50
% # Rec. Clause-clause subsumption calls : 50
% # Unit Clause-clause subsumption calls : 42
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 31
% # Indexed BW rewrite successes : 21
% # Backwards rewriting index: 85 leaves, 1.35+/-0.807 terms/leaf
% # Paramod-from index: 37 leaves, 1.27+/-0.501 terms/leaf
% # Paramod-into index: 69 leaves, 1.41+/-0.873 terms/leaf
% # -------------------------------------------------
% # User time : 0.032 s
% # System time : 0.005 s
% # Total time : 0.037 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.15 CPU 0.22 WC
% FINAL PrfWatch: 0.15 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP26735/NUM852+2.tptp
%
%------------------------------------------------------------------------------