TSTP Solution File: NUM841+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM841+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 : art02.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:02 EST 2010
% Result : Theorem 2.05s
% Output : Solution 2.05s
% 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/SystemOnTPTP15565/NUM841+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP15565/NUM841+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP15565/NUM841+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 15661
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,greater(vplus(vd344,vd347),vplus(vd345,vd347)),file('/tmp/SRASS.s.p', 'holds(212, 350, 0)')).
% fof(3, axiom,greater(vd347,vd348),file('/tmp/SRASS.s.p', 'holds(conjunct2(211), 349, 0)')).
% fof(4, axiom,greater(vd344,vd345),file('/tmp/SRASS.s.p', 'holds(conjunct1(211), 346, 0)')).
% fof(7, axiom,![X7]:![X8]:greater(vplus(X7,X8),X7),file('/tmp/SRASS.s.p', 'ass(cond(189, 0), 0)')).
% fof(10, axiom,![X9]:![X10]:(greater(X10,X9)<=>?[X11]:X10=vplus(X9,X11)),file('/tmp/SRASS.s.p', 'def(cond(conseq(axiom(3)), 11), 1)')).
% fof(17, axiom,![X17]:![X18]:(~(?[X19]:X17=vplus(X18,X19))|~(?[X20]:X18=vplus(X17,X20))),file('/tmp/SRASS.s.p', 'ass(cond(goal(88), 0), 2)')).
% fof(21, axiom,![X26]:![X27]:vplus(X27,X26)=vplus(X26,X27),file('/tmp/SRASS.s.p', 'ass(cond(61, 0), 0)')).
% fof(22, axiom,![X28]:![X29]:![X30]:vplus(vplus(X28,X29),X30)=vplus(X28,vplus(X29,X30)),file('/tmp/SRASS.s.p', 'ass(cond(33, 0), 0)')).
% fof(23, axiom,![X31]:![X32]:(less(X31,X32)=>greater(X32,X31)),file('/tmp/SRASS.s.p', 'ass(cond(147, 0), 0)')).
% fof(24, axiom,![X33]:![X34]:(greater(X33,X34)=>less(X34,X33)),file('/tmp/SRASS.s.p', 'ass(cond(140, 0), 0)')).
% fof(33, axiom,![X12]:![X13]:((X12=X13|greater(X12,X13))|less(X12,X13)),file('/tmp/SRASS.s.p', 'ass(cond(goal(130), 0), 0)')).
% fof(35, axiom,![X45]:![X46]:(less(X46,X45)<=>?[X47]:X45=vplus(X46,X47)),file('/tmp/SRASS.s.p', 'def(cond(conseq(axiom(3)), 12), 1)')).
% fof(37, axiom,![X50]:![X51]:![X52]:(((less(X51,X52)&leq(X50,X51))|(leq(X51,X52)&less(X50,X51)))=>less(X50,X52)),file('/tmp/SRASS.s.p', 'ass(cond(goal(177), 0), 0)')).
% fof(40, axiom,![X56]:![X57]:(leq(X57,X56)<=>(less(X57,X56)|X57=X56)),file('/tmp/SRASS.s.p', 'def(cond(conseq(axiom(3)), 17), 1)')).
% fof(45, conjecture,greater(vplus(vd344,vd347),vplus(vd345,vd348)),file('/tmp/SRASS.s.p', 'holds(214, 352, 0)')).
% fof(46, negated_conjecture,~(greater(vplus(vd344,vd347),vplus(vd345,vd348))),inference(assume_negation,[status(cth)],[45])).
% fof(50, negated_conjecture,~(greater(vplus(vd344,vd347),vplus(vd345,vd348))),inference(fof_simplification,[status(thm)],[46,theory(equality)])).
% cnf(52,plain,(greater(vplus(vd344,vd347),vplus(vd345,vd347))),inference(split_conjunct,[status(thm)],[2])).
% cnf(53,plain,(greater(vd347,vd348)),inference(split_conjunct,[status(thm)],[3])).
% cnf(54,plain,(greater(vd344,vd345)),inference(split_conjunct,[status(thm)],[4])).
% fof(61, plain,![X9]:![X10]:greater(vplus(X9,X10),X9),inference(variable_rename,[status(thm)],[7])).
% cnf(62,plain,(greater(vplus(X1,X2),X1)),inference(split_conjunct,[status(thm)],[61])).
% fof(65, plain,![X9]:![X10]:((~(greater(X10,X9))|?[X11]:X10=vplus(X9,X11))&(![X11]:~(X10=vplus(X9,X11))|greater(X10,X9))),inference(fof_nnf,[status(thm)],[10])).
% fof(66, plain,![X12]:![X13]:((~(greater(X13,X12))|?[X14]:X13=vplus(X12,X14))&(![X15]:~(X13=vplus(X12,X15))|greater(X13,X12))),inference(variable_rename,[status(thm)],[65])).
% fof(67, plain,![X12]:![X13]:((~(greater(X13,X12))|X13=vplus(X12,esk1_2(X12,X13)))&(![X15]:~(X13=vplus(X12,X15))|greater(X13,X12))),inference(skolemize,[status(esa)],[66])).
% fof(68, plain,![X12]:![X13]:![X15]:((~(X13=vplus(X12,X15))|greater(X13,X12))&(~(greater(X13,X12))|X13=vplus(X12,esk1_2(X12,X13)))),inference(shift_quantors,[status(thm)],[67])).
% cnf(69,plain,(X1=vplus(X2,esk1_2(X2,X1))|~greater(X1,X2)),inference(split_conjunct,[status(thm)],[68])).
% fof(89, plain,![X17]:![X18]:(![X19]:~(X17=vplus(X18,X19))|![X20]:~(X18=vplus(X17,X20))),inference(fof_nnf,[status(thm)],[17])).
% fof(90, plain,![X21]:![X22]:(![X23]:~(X21=vplus(X22,X23))|![X24]:~(X22=vplus(X21,X24))),inference(variable_rename,[status(thm)],[89])).
% fof(91, plain,![X21]:![X22]:![X23]:![X24]:(~(X22=vplus(X21,X24))|~(X21=vplus(X22,X23))),inference(shift_quantors,[status(thm)],[90])).
% cnf(92,plain,(X1!=vplus(X2,X3)|X2!=vplus(X1,X4)),inference(split_conjunct,[status(thm)],[91])).
% fof(103, plain,![X28]:![X29]:vplus(X29,X28)=vplus(X28,X29),inference(variable_rename,[status(thm)],[21])).
% cnf(104,plain,(vplus(X1,X2)=vplus(X2,X1)),inference(split_conjunct,[status(thm)],[103])).
% fof(105, plain,![X31]:![X32]:![X33]:vplus(vplus(X31,X32),X33)=vplus(X31,vplus(X32,X33)),inference(variable_rename,[status(thm)],[22])).
% cnf(106,plain,(vplus(vplus(X1,X2),X3)=vplus(X1,vplus(X2,X3))),inference(split_conjunct,[status(thm)],[105])).
% fof(107, plain,![X31]:![X32]:(~(less(X31,X32))|greater(X32,X31)),inference(fof_nnf,[status(thm)],[23])).
% fof(108, plain,![X33]:![X34]:(~(less(X33,X34))|greater(X34,X33)),inference(variable_rename,[status(thm)],[107])).
% cnf(109,plain,(greater(X1,X2)|~less(X2,X1)),inference(split_conjunct,[status(thm)],[108])).
% fof(110, plain,![X33]:![X34]:(~(greater(X33,X34))|less(X34,X33)),inference(fof_nnf,[status(thm)],[24])).
% fof(111, plain,![X35]:![X36]:(~(greater(X35,X36))|less(X36,X35)),inference(variable_rename,[status(thm)],[110])).
% cnf(112,plain,(less(X1,X2)|~greater(X2,X1)),inference(split_conjunct,[status(thm)],[111])).
% fof(134, plain,![X14]:![X15]:((X14=X15|greater(X14,X15))|less(X14,X15)),inference(variable_rename,[status(thm)],[33])).
% cnf(135,plain,(less(X1,X2)|greater(X1,X2)|X1=X2),inference(split_conjunct,[status(thm)],[134])).
% fof(142, plain,![X45]:![X46]:((~(less(X46,X45))|?[X47]:X45=vplus(X46,X47))&(![X47]:~(X45=vplus(X46,X47))|less(X46,X45))),inference(fof_nnf,[status(thm)],[35])).
% fof(143, plain,![X48]:![X49]:((~(less(X49,X48))|?[X50]:X48=vplus(X49,X50))&(![X51]:~(X48=vplus(X49,X51))|less(X49,X48))),inference(variable_rename,[status(thm)],[142])).
% fof(144, plain,![X48]:![X49]:((~(less(X49,X48))|X48=vplus(X49,esk4_2(X48,X49)))&(![X51]:~(X48=vplus(X49,X51))|less(X49,X48))),inference(skolemize,[status(esa)],[143])).
% fof(145, plain,![X48]:![X49]:![X51]:((~(X48=vplus(X49,X51))|less(X49,X48))&(~(less(X49,X48))|X48=vplus(X49,esk4_2(X48,X49)))),inference(shift_quantors,[status(thm)],[144])).
% cnf(146,plain,(X1=vplus(X2,esk4_2(X1,X2))|~less(X2,X1)),inference(split_conjunct,[status(thm)],[145])).
% fof(150, plain,![X50]:![X51]:![X52]:(((~(less(X51,X52))|~(leq(X50,X51)))&(~(leq(X51,X52))|~(less(X50,X51))))|less(X50,X52)),inference(fof_nnf,[status(thm)],[37])).
% fof(151, plain,![X53]:![X54]:![X55]:(((~(less(X54,X55))|~(leq(X53,X54)))&(~(leq(X54,X55))|~(less(X53,X54))))|less(X53,X55)),inference(variable_rename,[status(thm)],[150])).
% fof(152, plain,![X53]:![X54]:![X55]:(((~(less(X54,X55))|~(leq(X53,X54)))|less(X53,X55))&((~(leq(X54,X55))|~(less(X53,X54)))|less(X53,X55))),inference(distribute,[status(thm)],[151])).
% cnf(154,plain,(less(X1,X2)|~leq(X1,X3)|~less(X3,X2)),inference(split_conjunct,[status(thm)],[152])).
% fof(160, plain,![X56]:![X57]:((~(leq(X57,X56))|(less(X57,X56)|X57=X56))&((~(less(X57,X56))&~(X57=X56))|leq(X57,X56))),inference(fof_nnf,[status(thm)],[40])).
% fof(161, plain,![X58]:![X59]:((~(leq(X59,X58))|(less(X59,X58)|X59=X58))&((~(less(X59,X58))&~(X59=X58))|leq(X59,X58))),inference(variable_rename,[status(thm)],[160])).
% fof(162, plain,![X58]:![X59]:((~(leq(X59,X58))|(less(X59,X58)|X59=X58))&((~(less(X59,X58))|leq(X59,X58))&(~(X59=X58)|leq(X59,X58)))),inference(distribute,[status(thm)],[161])).
% cnf(164,plain,(leq(X1,X2)|~less(X1,X2)),inference(split_conjunct,[status(thm)],[162])).
% cnf(177,negated_conjecture,(~greater(vplus(vd344,vd347),vplus(vd345,vd348))),inference(split_conjunct,[status(thm)],[50])).
% cnf(187,plain,(less(vd345,vd344)),inference(pm,[status(thm)],[112,54,theory(equality)])).
% cnf(189,plain,(less(X1,vplus(X1,X2))),inference(pm,[status(thm)],[112,62,theory(equality)])).
% cnf(235,plain,(vplus(X2,X1)!=X3|vplus(X3,X4)!=X1),inference(pm,[status(thm)],[92,104,theory(equality)])).
% cnf(245,negated_conjecture,(~greater(vplus(vd347,vd344),vplus(vd345,vd348))),inference(rw,[status(thm)],[177,104,theory(equality)])).
% cnf(279,plain,(greater(vplus(vd347,vd344),vplus(vd345,vd347))),inference(rw,[status(thm)],[52,104,theory(equality)])).
% cnf(284,plain,(vplus(vplus(vd345,vd347),esk1_2(vplus(vd345,vd347),vplus(vd347,vd344)))=vplus(vd347,vd344)),inference(pm,[status(thm)],[69,279,theory(equality)])).
% cnf(286,plain,(vplus(vd348,esk1_2(vd348,vd347))=vd347),inference(pm,[status(thm)],[69,53,theory(equality)])).
% cnf(367,plain,(leq(vd345,vd344)),inference(pm,[status(thm)],[164,187,theory(equality)])).
% cnf(385,negated_conjecture,(vplus(vd347,vd344)=vplus(vd345,vd348)|less(vplus(vd347,vd344),vplus(vd345,vd348))),inference(pm,[status(thm)],[245,135,theory(equality)])).
% cnf(434,plain,(less(vd345,X1)|~less(vd344,X1)),inference(pm,[status(thm)],[154,367,theory(equality)])).
% cnf(491,plain,(vplus(vplus(X1,X2),X3)!=X2),inference(er,[status(thm)],[235,theory(equality)])).
% cnf(498,plain,(vplus(X1,vplus(X2,X3))!=X2),inference(rw,[status(thm)],[491,106,theory(equality)])).
% cnf(510,plain,(less(vd345,vplus(vd344,X1))),inference(pm,[status(thm)],[434,189,theory(equality)])).
% cnf(553,plain,(vplus(X1,vplus(X2,vplus(X3,X4)))!=vplus(X2,X3)),inference(pm,[status(thm)],[498,106,theory(equality)])).
% cnf(651,plain,(vplus(vd345,esk4_2(vplus(vd344,X1),vd345))=vplus(vd344,X1)),inference(pm,[status(thm)],[146,510,theory(equality)])).
% cnf(1461,plain,(vplus(vd345,vplus(vd347,esk1_2(vplus(vd345,vd347),vplus(vd347,vd344))))=vplus(vd347,vd344)),inference(rw,[status(thm)],[284,106,theory(equality)])).
% cnf(12528,plain,(vplus(X1,vplus(X2,vd347))!=vplus(X2,vd348)),inference(pm,[status(thm)],[553,286,theory(equality)])).
% cnf(14281,plain,(vplus(X1,vplus(vd347,X2))!=vplus(X2,vd348)),inference(pm,[status(thm)],[12528,104,theory(equality)])).
% cnf(14285,plain,(vplus(vplus(X2,vd347),X1)!=vplus(X2,vd348)),inference(pm,[status(thm)],[12528,104,theory(equality)])).
% cnf(14294,plain,(vplus(X2,vplus(vd347,X1))!=vplus(X2,vd348)),inference(rw,[status(thm)],[14285,106,theory(equality)])).
% cnf(14496,plain,(vplus(vplus(vd347,X2),X1)!=vplus(X2,vd348)),inference(pm,[status(thm)],[14281,104,theory(equality)])).
% cnf(14512,plain,(vplus(vd347,vplus(X2,X1))!=vplus(X2,vd348)),inference(rw,[status(thm)],[14496,106,theory(equality)])).
% cnf(14580,plain,(vplus(vd347,vd344)!=vplus(vd345,vd348)),inference(pm,[status(thm)],[14294,1461,theory(equality)])).
% cnf(14592,negated_conjecture,(less(vplus(vd347,vd344),vplus(vd345,vd348))),inference(sr,[status(thm)],[385,14580,theory(equality)])).
% cnf(14662,negated_conjecture,(greater(vplus(vd345,vd348),vplus(vd347,vd344))),inference(pm,[status(thm)],[109,14592,theory(equality)])).
% cnf(16216,plain,(vplus(vd347,vplus(vd344,X1))!=vplus(vd345,vd348)),inference(pm,[status(thm)],[14512,651,theory(equality)])).
% cnf(30951,negated_conjecture,(vplus(vplus(vd347,vd344),esk1_2(vplus(vd347,vd344),vplus(vd345,vd348)))=vplus(vd345,vd348)),inference(pm,[status(thm)],[69,14662,theory(equality)])).
% cnf(30958,negated_conjecture,(vplus(vd347,vplus(vd344,esk1_2(vplus(vd347,vd344),vplus(vd345,vd348))))=vplus(vd345,vd348)),inference(rw,[status(thm)],[30951,106,theory(equality)])).
% cnf(30959,negated_conjecture,($false),inference(sr,[status(thm)],[30958,16216,theory(equality)])).
% cnf(30960,negated_conjecture,($false),30959,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 3088
% # ...of these trivial : 318
% # ...subsumed : 1792
% # ...remaining for further processing: 978
% # Other redundant clauses eliminated : 394
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 13
% # Backward-rewritten : 209
% # Generated clauses : 25456
% # ...of the previous two non-trivial : 23533
% # Contextual simplify-reflections : 0
% # Paramodulations : 24984
% # Factorizations : 2
% # Equation resolutions : 469
% # Current number of processed clauses: 749
% # Positive orientable unit clauses: 174
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 174
% # Non-unit-clauses : 398
% # Current number of unprocessed clauses: 18265
% # ...number of literals in the above : 51257
% # Clause-clause subsumption calls (NU) : 4742
% # Rec. Clause-clause subsumption calls : 4569
% # Unit Clause-clause subsumption calls : 888
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 176
% # Indexed BW rewrite successes : 94
% # Backwards rewriting index: 450 leaves, 1.31+/-1.015 terms/leaf
% # Paramod-from index: 221 leaves, 1.15+/-0.381 terms/leaf
% # Paramod-into index: 414 leaves, 1.29+/-0.953 terms/leaf
% # -------------------------------------------------
% # User time : 0.714 s
% # System time : 0.033 s
% # Total time : 0.747 s
% # Maximum resident set size: 0 pages
% PrfWatch: 1.18 CPU 1.29 WC
% FINAL PrfWatch: 1.18 CPU 1.29 WC
% SZS output end Solution for /tmp/SystemOnTPTP15565/NUM841+1.tptp
%
%------------------------------------------------------------------------------