TSTP Solution File: NUM842+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM842+1 : TPTP v5.0.0. Released v4.1.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art03.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Wed Dec 29 20:46:15 EST 2010
% Result : Theorem 6.11s
% Output : Solution 6.11s
% 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/SystemOnTPTP21334/NUM842+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP21334/NUM842+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21334/NUM842+1.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 21430
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.93 CPU 2.02 WC
% # Preprocessing time : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 3.91 CPU 4.03 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:![X4]:((greater(X3,X4)&greater(X1,X2))=>greater(vplus(X1,X3),vplus(X2,X4))),file('/tmp/SRASS.s.p', 'ass(cond(209, 0), 0)')).
% fof(3, axiom,![X8]:![X9]:![X10]:(greater(X8,X9)=>greater(vplus(X8,X10),vplus(X9,X10))),file('/tmp/SRASS.s.p', 'ass(cond(goal(193), 0), 2)')).
% fof(4, axiom,![X11]:![X12]:greater(vplus(X11,X12),X11),file('/tmp/SRASS.s.p', 'ass(cond(189, 0), 0)')).
% fof(5, axiom,((greater(vd355,vd356)&geq(vd353,vd354))|(geq(vd355,vd356)&greater(vd353,vd354))),file('/tmp/SRASS.s.p', 'dis(antec(218))')).
% fof(6, axiom,![X13]:![X14]:(greater(X14,X13)<=>?[X15]:X14=vplus(X13,X15)),file('/tmp/SRASS.s.p', 'def(cond(conseq(axiom(3)), 11), 1)')).
% fof(7, axiom,![X16]:![X17]:(~(X16=X17)|~(greater(X16,X17))),file('/tmp/SRASS.s.p', 'ass(cond(goal(130), 0), 3)')).
% fof(13, axiom,![X18]:![X19]:(~(X18=X19)|~(?[X20]:X18=vplus(X19,X20))),file('/tmp/SRASS.s.p', 'ass(cond(goal(88), 0), 3)')).
% fof(16, axiom,![X27]:![X28]:vplus(X28,X27)=vplus(X27,X28),file('/tmp/SRASS.s.p', 'ass(cond(61, 0), 0)')).
% fof(17, axiom,![X29]:![X30]:![X31]:vplus(vplus(X29,X30),X31)=vplus(X29,vplus(X30,X31)),file('/tmp/SRASS.s.p', 'ass(cond(33, 0), 0)')).
% fof(20, axiom,![X37]:![X38]:(greater(X37,X38)=>less(X38,X37)),file('/tmp/SRASS.s.p', 'ass(cond(140, 0), 0)')).
% fof(21, axiom,![X16]:![X17]:(~(greater(X16,X17))|~(less(X16,X17))),file('/tmp/SRASS.s.p', 'ass(cond(goal(130), 0), 2)')).
% fof(22, axiom,![X39]:![X40]:(geq(X40,X39)<=>(greater(X40,X39)|X40=X39)),file('/tmp/SRASS.s.p', 'def(cond(conseq(axiom(3)), 16), 1)')).
% fof(30, axiom,![X16]:![X17]:((X16=X17|greater(X16,X17))|less(X16,X17)),file('/tmp/SRASS.s.p', 'ass(cond(goal(130), 0), 0)')).
% fof(31, axiom,![X49]:![X50]:(less(X50,X49)<=>?[X51]:X49=vplus(X50,X51)),file('/tmp/SRASS.s.p', 'def(cond(conseq(axiom(3)), 12), 1)')).
% fof(41, conjecture,greater(vplus(vd353,vd355),vplus(vd354,vd356)),file('/tmp/SRASS.s.p', 'holds(conseq(218), 361, 0)')).
% fof(42, negated_conjecture,~(greater(vplus(vd353,vd355),vplus(vd354,vd356))),inference(assume_negation,[status(cth)],[41])).
% fof(43, plain,![X16]:![X17]:(~(X16=X17)|~(greater(X16,X17))),inference(fof_simplification,[status(thm)],[7,theory(equality)])).
% fof(44, plain,![X16]:![X17]:(~(greater(X16,X17))|~(less(X16,X17))),inference(fof_simplification,[status(thm)],[21,theory(equality)])).
% fof(46, negated_conjecture,~(greater(vplus(vd353,vd355),vplus(vd354,vd356))),inference(fof_simplification,[status(thm)],[42,theory(equality)])).
% fof(47, plain,![X1]:![X2]:![X3]:![X4]:((~(greater(X3,X4))|~(greater(X1,X2)))|greater(vplus(X1,X3),vplus(X2,X4))),inference(fof_nnf,[status(thm)],[1])).
% fof(48, plain,![X5]:![X6]:![X7]:![X8]:((~(greater(X7,X8))|~(greater(X5,X6)))|greater(vplus(X5,X7),vplus(X6,X8))),inference(variable_rename,[status(thm)],[47])).
% cnf(49,plain,(greater(vplus(X1,X2),vplus(X3,X4))|~greater(X1,X3)|~greater(X2,X4)),inference(split_conjunct,[status(thm)],[48])).
% fof(53, plain,![X8]:![X9]:![X10]:(~(greater(X8,X9))|greater(vplus(X8,X10),vplus(X9,X10))),inference(fof_nnf,[status(thm)],[3])).
% fof(54, plain,![X11]:![X12]:![X13]:(~(greater(X11,X12))|greater(vplus(X11,X13),vplus(X12,X13))),inference(variable_rename,[status(thm)],[53])).
% cnf(55,plain,(greater(vplus(X1,X2),vplus(X3,X2))|~greater(X1,X3)),inference(split_conjunct,[status(thm)],[54])).
% fof(56, plain,![X13]:![X14]:greater(vplus(X13,X14),X13),inference(variable_rename,[status(thm)],[4])).
% cnf(57,plain,(greater(vplus(X1,X2),X1)),inference(split_conjunct,[status(thm)],[56])).
% fof(58, plain,(((geq(vd355,vd356)|greater(vd355,vd356))&(greater(vd353,vd354)|greater(vd355,vd356)))&((geq(vd355,vd356)|geq(vd353,vd354))&(greater(vd353,vd354)|geq(vd353,vd354)))),inference(distribute,[status(thm)],[5])).
% cnf(59,plain,(geq(vd353,vd354)|greater(vd353,vd354)),inference(split_conjunct,[status(thm)],[58])).
% cnf(61,plain,(greater(vd355,vd356)|greater(vd353,vd354)),inference(split_conjunct,[status(thm)],[58])).
% cnf(62,plain,(greater(vd355,vd356)|geq(vd355,vd356)),inference(split_conjunct,[status(thm)],[58])).
% fof(63, plain,![X13]:![X14]:((~(greater(X14,X13))|?[X15]:X14=vplus(X13,X15))&(![X15]:~(X14=vplus(X13,X15))|greater(X14,X13))),inference(fof_nnf,[status(thm)],[6])).
% fof(64, plain,![X16]:![X17]:((~(greater(X17,X16))|?[X18]:X17=vplus(X16,X18))&(![X19]:~(X17=vplus(X16,X19))|greater(X17,X16))),inference(variable_rename,[status(thm)],[63])).
% fof(65, plain,![X16]:![X17]:((~(greater(X17,X16))|X17=vplus(X16,esk1_2(X16,X17)))&(![X19]:~(X17=vplus(X16,X19))|greater(X17,X16))),inference(skolemize,[status(esa)],[64])).
% fof(66, plain,![X16]:![X17]:![X19]:((~(X17=vplus(X16,X19))|greater(X17,X16))&(~(greater(X17,X16))|X17=vplus(X16,esk1_2(X16,X17)))),inference(shift_quantors,[status(thm)],[65])).
% cnf(67,plain,(X1=vplus(X2,esk1_2(X2,X1))|~greater(X1,X2)),inference(split_conjunct,[status(thm)],[66])).
% fof(69, plain,![X18]:![X19]:(~(X18=X19)|~(greater(X18,X19))),inference(variable_rename,[status(thm)],[43])).
% cnf(70,plain,(~greater(X1,X2)|X1!=X2),inference(split_conjunct,[status(thm)],[69])).
% fof(88, plain,![X18]:![X19]:(~(X18=X19)|![X20]:~(X18=vplus(X19,X20))),inference(fof_nnf,[status(thm)],[13])).
% fof(89, plain,![X21]:![X22]:(~(X21=X22)|![X23]:~(X21=vplus(X22,X23))),inference(variable_rename,[status(thm)],[88])).
% fof(90, plain,![X21]:![X22]:![X23]:(~(X21=vplus(X22,X23))|~(X21=X22)),inference(shift_quantors,[status(thm)],[89])).
% cnf(91,plain,(X1!=X2|X1!=vplus(X2,X3)),inference(split_conjunct,[status(thm)],[90])).
% fof(98, plain,![X29]:![X30]:vplus(X30,X29)=vplus(X29,X30),inference(variable_rename,[status(thm)],[16])).
% cnf(99,plain,(vplus(X1,X2)=vplus(X2,X1)),inference(split_conjunct,[status(thm)],[98])).
% fof(100, plain,![X32]:![X33]:![X34]:vplus(vplus(X32,X33),X34)=vplus(X32,vplus(X33,X34)),inference(variable_rename,[status(thm)],[17])).
% cnf(101,plain,(vplus(vplus(X1,X2),X3)=vplus(X1,vplus(X2,X3))),inference(split_conjunct,[status(thm)],[100])).
% fof(108, plain,![X37]:![X38]:(~(greater(X37,X38))|less(X38,X37)),inference(fof_nnf,[status(thm)],[20])).
% fof(109, plain,![X39]:![X40]:(~(greater(X39,X40))|less(X40,X39)),inference(variable_rename,[status(thm)],[108])).
% cnf(110,plain,(less(X1,X2)|~greater(X2,X1)),inference(split_conjunct,[status(thm)],[109])).
% fof(111, plain,![X18]:![X19]:(~(greater(X18,X19))|~(less(X18,X19))),inference(variable_rename,[status(thm)],[44])).
% cnf(112,plain,(~less(X1,X2)|~greater(X1,X2)),inference(split_conjunct,[status(thm)],[111])).
% fof(113, plain,![X39]:![X40]:((~(geq(X40,X39))|(greater(X40,X39)|X40=X39))&((~(greater(X40,X39))&~(X40=X39))|geq(X40,X39))),inference(fof_nnf,[status(thm)],[22])).
% fof(114, plain,![X41]:![X42]:((~(geq(X42,X41))|(greater(X42,X41)|X42=X41))&((~(greater(X42,X41))&~(X42=X41))|geq(X42,X41))),inference(variable_rename,[status(thm)],[113])).
% fof(115, plain,![X41]:![X42]:((~(geq(X42,X41))|(greater(X42,X41)|X42=X41))&((~(greater(X42,X41))|geq(X42,X41))&(~(X42=X41)|geq(X42,X41)))),inference(distribute,[status(thm)],[114])).
% cnf(117,plain,(geq(X1,X2)|~greater(X1,X2)),inference(split_conjunct,[status(thm)],[115])).
% cnf(118,plain,(X1=X2|greater(X1,X2)|~geq(X1,X2)),inference(split_conjunct,[status(thm)],[115])).
% fof(138, plain,![X18]:![X19]:((X18=X19|greater(X18,X19))|less(X18,X19)),inference(variable_rename,[status(thm)],[30])).
% cnf(139,plain,(less(X1,X2)|greater(X1,X2)|X1=X2),inference(split_conjunct,[status(thm)],[138])).
% fof(140, plain,![X49]:![X50]:((~(less(X50,X49))|?[X51]:X49=vplus(X50,X51))&(![X51]:~(X49=vplus(X50,X51))|less(X50,X49))),inference(fof_nnf,[status(thm)],[31])).
% fof(141, plain,![X52]:![X53]:((~(less(X53,X52))|?[X54]:X52=vplus(X53,X54))&(![X55]:~(X52=vplus(X53,X55))|less(X53,X52))),inference(variable_rename,[status(thm)],[140])).
% fof(142, plain,![X52]:![X53]:((~(less(X53,X52))|X52=vplus(X53,esk4_2(X52,X53)))&(![X55]:~(X52=vplus(X53,X55))|less(X53,X52))),inference(skolemize,[status(esa)],[141])).
% fof(143, plain,![X52]:![X53]:![X55]:((~(X52=vplus(X53,X55))|less(X53,X52))&(~(less(X53,X52))|X52=vplus(X53,esk4_2(X52,X53)))),inference(shift_quantors,[status(thm)],[142])).
% cnf(144,plain,(X1=vplus(X2,esk4_2(X1,X2))|~less(X2,X1)),inference(split_conjunct,[status(thm)],[143])).
% cnf(175,negated_conjecture,(~greater(vplus(vd353,vd355),vplus(vd354,vd356))),inference(split_conjunct,[status(thm)],[46])).
% cnf(184,plain,(~greater(X1,X1)),inference(er,[status(thm)],[70,theory(equality)])).
% cnf(186,plain,(vplus(X1,X2)!=X1),inference(er,[status(thm)],[91,theory(equality)])).
% cnf(193,plain,(less(vd354,vd353)|greater(vd355,vd356)),inference(spm,[status(thm)],[110,61,theory(equality)])).
% cnf(194,plain,(geq(vd355,vd356)),inference(csr,[status(thm)],[62,117])).
% cnf(196,plain,(geq(vd353,vd354)),inference(csr,[status(thm)],[59,117])).
% cnf(243,negated_conjecture,(~greater(vplus(vd355,vd353),vplus(vd356,vd354))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[175,99,theory(equality)]),99,theory(equality)])).
% cnf(251,plain,(greater(vplus(X1,vplus(X2,X3)),vplus(X1,X2))),inference(spm,[status(thm)],[57,101,theory(equality)])).
% cnf(262,plain,(vplus(vd354,esk1_2(vd354,vd353))=vd353|greater(vd355,vd356)),inference(spm,[status(thm)],[67,61,theory(equality)])).
% cnf(264,plain,(vplus(X1,esk4_2(X2,X1))=X2|X1=X2|greater(X1,X2)),inference(spm,[status(thm)],[144,139,theory(equality)])).
% cnf(285,plain,(vd353=vd354|greater(vd353,vd354)),inference(spm,[status(thm)],[118,196,theory(equality)])).
% cnf(286,plain,(vd355=vd356|greater(vd355,vd356)),inference(spm,[status(thm)],[118,194,theory(equality)])).
% cnf(402,plain,(greater(vplus(X1,vd353),vplus(X2,vd354))|vd354=vd353|~greater(X1,X2)),inference(spm,[status(thm)],[49,285,theory(equality)])).
% cnf(407,plain,(greater(vplus(vd355,X1),vplus(vd356,X1))|vd356=vd355),inference(spm,[status(thm)],[55,286,theory(equality)])).
% cnf(459,plain,(greater(vd355,vd356)|~greater(vd354,vd353)),inference(spm,[status(thm)],[112,193,theory(equality)])).
% cnf(2055,plain,(greater(vd355,vd356)|vd353!=vd354),inference(spm,[status(thm)],[186,262,theory(equality)])).
% cnf(2285,plain,(greater(vplus(X1,X3),vplus(X1,X2))|X2=X3|greater(X2,X3)),inference(spm,[status(thm)],[251,264,theory(equality)])).
% cnf(11760,plain,(vd354=vd353|greater(vplus(vd355,vd353),vplus(vd356,vd354))|vd356=vd355),inference(spm,[status(thm)],[402,286,theory(equality)])).
% cnf(11780,plain,(vd354=vd353|vd356=vd355),inference(sr,[status(thm)],[11760,243,theory(equality)])).
% cnf(12044,negated_conjecture,(vd356=vd355|~greater(vplus(vd355,vd353),vplus(vd356,vd353))),inference(spm,[status(thm)],[243,11780,theory(equality)])).
% cnf(14847,negated_conjecture,(vd356=vd355),inference(csr,[status(thm)],[12044,407])).
% cnf(15017,plain,(greater(vd355,vd355)|vd354!=vd353),inference(rw,[status(thm)],[2055,14847,theory(equality)])).
% cnf(15018,plain,(vd354!=vd353),inference(sr,[status(thm)],[15017,184,theory(equality)])).
% cnf(15138,plain,(greater(vd355,vd355)|~greater(vd354,vd353)),inference(rw,[status(thm)],[459,14847,theory(equality)])).
% cnf(15139,plain,(~greater(vd354,vd353)),inference(sr,[status(thm)],[15138,184,theory(equality)])).
% cnf(15169,negated_conjecture,(~greater(vplus(vd355,vd353),vplus(vd355,vd354))),inference(rw,[status(thm)],[243,14847,theory(equality)])).
% cnf(119799,negated_conjecture,(vd354=vd353|greater(vd354,vd353)),inference(spm,[status(thm)],[15169,2285,theory(equality)])).
% cnf(120059,negated_conjecture,(greater(vd354,vd353)),inference(sr,[status(thm)],[119799,15018,theory(equality)])).
% cnf(120060,negated_conjecture,($false),inference(sr,[status(thm)],[120059,15139,theory(equality)])).
% cnf(120061,negated_conjecture,($false),120060,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 15340
% # ...of these trivial : 327
% # ...subsumed : 12615
% # ...remaining for further processing: 2398
% # Other redundant clauses eliminated : 1412
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 133
% # Backward-rewritten : 600
% # Generated clauses : 95566
% # ...of the previous two non-trivial : 90755
% # Contextual simplify-reflections : 399
% # Paramodulations : 93829
% # Factorizations : 2
% # Equation resolutions : 1721
% # Current number of processed clauses: 1645
% # Positive orientable unit clauses: 159
% # Positive unorientable unit clauses: 4
% # Negative unit clauses : 312
% # Non-unit-clauses : 1170
% # Current number of unprocessed clauses: 63695
% # ...number of literals in the above : 188054
% # Clause-clause subsumption calls (NU) : 146163
% # Rec. Clause-clause subsumption calls : 138587
% # Unit Clause-clause subsumption calls : 4857
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 575
% # Indexed BW rewrite successes : 325
% # Backwards rewriting index: 712 leaves, 1.43+/-1.681 terms/leaf
% # Paramod-from index: 299 leaves, 1.17+/-0.589 terms/leaf
% # Paramod-into index: 672 leaves, 1.42+/-1.567 terms/leaf
% # -------------------------------------------------
% # User time : 3.450 s
% # System time : 0.119 s
% # Total time : 3.569 s
% # Maximum resident set size: 0 pages
% PrfWatch: 5.26 CPU 5.38 WC
% FINAL PrfWatch: 5.26 CPU 5.38 WC
% SZS output end Solution for /tmp/SystemOnTPTP21334/NUM842+1.tptp
%
%------------------------------------------------------------------------------