TSTP Solution File: NUM839+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM839+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 : art01.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:45:38 EST 2010
% Result : Theorem 1.16s
% Output : Solution 1.16s
% 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/SystemOnTPTP18583/NUM839+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP18583/NUM839+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP18583/NUM839+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 18679
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 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(vd328,vd330),vplus(vd329,vd330)),file('/tmp/SRASS.s.p', 'holds(antec(204), 331, 0)')).
% fof(3, axiom,![X3]:![X4]:![X5]:(greater(X3,X4)=>greater(vplus(X3,X5),vplus(X4,X5))),file('/tmp/SRASS.s.p', 'ass(cond(goal(193), 0), 2)')).
% fof(7, axiom,![X13]:![X14]:(greater(X13,X14)=>less(X14,X13)),file('/tmp/SRASS.s.p', 'ass(cond(140, 0), 0)')).
% fof(9, axiom,![X15]:![X16]:(greater(X16,X15)<=>?[X17]:X16=vplus(X15,X17)),file('/tmp/SRASS.s.p', 'def(cond(conseq(axiom(3)), 11), 1)')).
% fof(10, axiom,![X1]:![X2]:((X1=X2|greater(X1,X2))|less(X1,X2)),file('/tmp/SRASS.s.p', 'ass(cond(goal(130), 0), 0)')).
% fof(11, axiom,![X18]:![X19]:![X20]:((leq(X19,X20)&leq(X18,X19))=>leq(X18,X20)),file('/tmp/SRASS.s.p', 'ass(cond(184, 0), 0)')).
% fof(12, axiom,![X1]:![X2]:(~(X1=X2)|~(less(X1,X2))),file('/tmp/SRASS.s.p', 'ass(cond(goal(130), 0), 1)')).
% fof(19, axiom,![X24]:![X25]:(~(?[X26]:X24=vplus(X25,X26))|~(?[X27]:X25=vplus(X24,X27))),file('/tmp/SRASS.s.p', 'ass(cond(goal(88), 0), 2)')).
% fof(23, axiom,![X33]:![X34]:vplus(X34,X33)=vplus(X33,X34),file('/tmp/SRASS.s.p', 'ass(cond(61, 0), 0)')).
% fof(25, axiom,![X38]:![X39]:(leq(X39,X38)<=>(less(X39,X38)|X39=X38)),file('/tmp/SRASS.s.p', 'def(cond(conseq(axiom(3)), 17), 1)')).
% fof(26, axiom,![X40]:![X41]:(geq(X41,X40)<=>(greater(X41,X40)|X41=X40)),file('/tmp/SRASS.s.p', 'def(cond(conseq(axiom(3)), 16), 1)')).
% fof(32, axiom,![X53]:![X54]:(leq(X53,X54)=>geq(X54,X53)),file('/tmp/SRASS.s.p', 'ass(cond(163, 0), 0)')).
% fof(35, conjecture,greater(vd328,vd329),file('/tmp/SRASS.s.p', 'holds(conseq(204), 332, 0)')).
% fof(36, negated_conjecture,~(greater(vd328,vd329)),inference(assume_negation,[status(cth)],[35])).
% fof(39, plain,![X1]:![X2]:(~(X1=X2)|~(less(X1,X2))),inference(fof_simplification,[status(thm)],[12,theory(equality)])).
% fof(40, negated_conjecture,~(greater(vd328,vd329)),inference(fof_simplification,[status(thm)],[36,theory(equality)])).
% cnf(43,plain,(greater(vplus(vd328,vd330),vplus(vd329,vd330))),inference(split_conjunct,[status(thm)],[2])).
% fof(44, plain,![X3]:![X4]:![X5]:(~(greater(X3,X4))|greater(vplus(X3,X5),vplus(X4,X5))),inference(fof_nnf,[status(thm)],[3])).
% fof(45, plain,![X6]:![X7]:![X8]:(~(greater(X6,X7))|greater(vplus(X6,X8),vplus(X7,X8))),inference(variable_rename,[status(thm)],[44])).
% cnf(46,plain,(greater(vplus(X1,X2),vplus(X3,X2))|~greater(X1,X3)),inference(split_conjunct,[status(thm)],[45])).
% fof(55, plain,![X13]:![X14]:(~(greater(X13,X14))|less(X14,X13)),inference(fof_nnf,[status(thm)],[7])).
% fof(56, plain,![X15]:![X16]:(~(greater(X15,X16))|less(X16,X15)),inference(variable_rename,[status(thm)],[55])).
% cnf(57,plain,(less(X1,X2)|~greater(X2,X1)),inference(split_conjunct,[status(thm)],[56])).
% fof(60, plain,![X15]:![X16]:((~(greater(X16,X15))|?[X17]:X16=vplus(X15,X17))&(![X17]:~(X16=vplus(X15,X17))|greater(X16,X15))),inference(fof_nnf,[status(thm)],[9])).
% fof(61, plain,![X18]:![X19]:((~(greater(X19,X18))|?[X20]:X19=vplus(X18,X20))&(![X21]:~(X19=vplus(X18,X21))|greater(X19,X18))),inference(variable_rename,[status(thm)],[60])).
% fof(62, plain,![X18]:![X19]:((~(greater(X19,X18))|X19=vplus(X18,esk1_2(X18,X19)))&(![X21]:~(X19=vplus(X18,X21))|greater(X19,X18))),inference(skolemize,[status(esa)],[61])).
% fof(63, plain,![X18]:![X19]:![X21]:((~(X19=vplus(X18,X21))|greater(X19,X18))&(~(greater(X19,X18))|X19=vplus(X18,esk1_2(X18,X19)))),inference(shift_quantors,[status(thm)],[62])).
% cnf(64,plain,(X1=vplus(X2,esk1_2(X2,X1))|~greater(X1,X2)),inference(split_conjunct,[status(thm)],[63])).
% fof(66, plain,![X3]:![X4]:((X3=X4|greater(X3,X4))|less(X3,X4)),inference(variable_rename,[status(thm)],[10])).
% cnf(67,plain,(less(X1,X2)|greater(X1,X2)|X1=X2),inference(split_conjunct,[status(thm)],[66])).
% fof(68, plain,![X18]:![X19]:![X20]:((~(leq(X19,X20))|~(leq(X18,X19)))|leq(X18,X20)),inference(fof_nnf,[status(thm)],[11])).
% fof(69, plain,![X21]:![X22]:![X23]:((~(leq(X22,X23))|~(leq(X21,X22)))|leq(X21,X23)),inference(variable_rename,[status(thm)],[68])).
% cnf(70,plain,(leq(X1,X2)|~leq(X1,X3)|~leq(X3,X2)),inference(split_conjunct,[status(thm)],[69])).
% fof(71, plain,![X3]:![X4]:(~(X3=X4)|~(less(X3,X4))),inference(variable_rename,[status(thm)],[39])).
% cnf(72,plain,(~less(X1,X2)|X1!=X2),inference(split_conjunct,[status(thm)],[71])).
% fof(91, plain,![X24]:![X25]:(![X26]:~(X24=vplus(X25,X26))|![X27]:~(X25=vplus(X24,X27))),inference(fof_nnf,[status(thm)],[19])).
% fof(92, plain,![X28]:![X29]:(![X30]:~(X28=vplus(X29,X30))|![X31]:~(X29=vplus(X28,X31))),inference(variable_rename,[status(thm)],[91])).
% fof(93, plain,![X28]:![X29]:![X30]:![X31]:(~(X29=vplus(X28,X31))|~(X28=vplus(X29,X30))),inference(shift_quantors,[status(thm)],[92])).
% cnf(94,plain,(X1!=vplus(X2,X3)|X2!=vplus(X1,X4)),inference(split_conjunct,[status(thm)],[93])).
% fof(105, plain,![X35]:![X36]:vplus(X36,X35)=vplus(X35,X36),inference(variable_rename,[status(thm)],[23])).
% cnf(106,plain,(vplus(X1,X2)=vplus(X2,X1)),inference(split_conjunct,[status(thm)],[105])).
% fof(109, plain,![X38]:![X39]:((~(leq(X39,X38))|(less(X39,X38)|X39=X38))&((~(less(X39,X38))&~(X39=X38))|leq(X39,X38))),inference(fof_nnf,[status(thm)],[25])).
% fof(110, plain,![X40]:![X41]:((~(leq(X41,X40))|(less(X41,X40)|X41=X40))&((~(less(X41,X40))&~(X41=X40))|leq(X41,X40))),inference(variable_rename,[status(thm)],[109])).
% fof(111, plain,![X40]:![X41]:((~(leq(X41,X40))|(less(X41,X40)|X41=X40))&((~(less(X41,X40))|leq(X41,X40))&(~(X41=X40)|leq(X41,X40)))),inference(distribute,[status(thm)],[110])).
% cnf(112,plain,(leq(X1,X2)|X1!=X2),inference(split_conjunct,[status(thm)],[111])).
% cnf(113,plain,(leq(X1,X2)|~less(X1,X2)),inference(split_conjunct,[status(thm)],[111])).
% fof(115, plain,![X40]:![X41]:((~(geq(X41,X40))|(greater(X41,X40)|X41=X40))&((~(greater(X41,X40))&~(X41=X40))|geq(X41,X40))),inference(fof_nnf,[status(thm)],[26])).
% fof(116, plain,![X42]:![X43]:((~(geq(X43,X42))|(greater(X43,X42)|X43=X42))&((~(greater(X43,X42))&~(X43=X42))|geq(X43,X42))),inference(variable_rename,[status(thm)],[115])).
% fof(117, plain,![X42]:![X43]:((~(geq(X43,X42))|(greater(X43,X42)|X43=X42))&((~(greater(X43,X42))|geq(X43,X42))&(~(X43=X42)|geq(X43,X42)))),inference(distribute,[status(thm)],[116])).
% cnf(120,plain,(X1=X2|greater(X1,X2)|~geq(X1,X2)),inference(split_conjunct,[status(thm)],[117])).
% fof(139, plain,![X53]:![X54]:(~(leq(X53,X54))|geq(X54,X53)),inference(fof_nnf,[status(thm)],[32])).
% fof(140, plain,![X55]:![X56]:(~(leq(X55,X56))|geq(X56,X55)),inference(variable_rename,[status(thm)],[139])).
% cnf(141,plain,(geq(X1,X2)|~leq(X2,X1)),inference(split_conjunct,[status(thm)],[140])).
% cnf(148,negated_conjecture,(~greater(vd328,vd329)),inference(split_conjunct,[status(thm)],[40])).
% cnf(156,plain,(~less(X1,X1)),inference(er,[status(thm)],[72,theory(equality)])).
% cnf(163,plain,(leq(X1,X1)),inference(er,[status(thm)],[112,theory(equality)])).
% cnf(208,plain,(greater(vplus(vd328,vd330),vplus(vd330,vd329))),inference(rw,[status(thm)],[43,106,theory(equality)])).
% cnf(209,negated_conjecture,(vd328=vd329|less(vd328,vd329)),inference(spm,[status(thm)],[148,67,theory(equality)])).
% cnf(213,plain,(X1=X2|greater(X1,X2)|~leq(X2,X1)),inference(spm,[status(thm)],[120,141,theory(equality)])).
% cnf(227,plain,(leq(X1,X2)|~leq(X1,X3)|~less(X3,X2)),inference(spm,[status(thm)],[70,113,theory(equality)])).
% cnf(232,plain,(X2!=X3|vplus(X3,X4)!=X1|~greater(X2,X1)),inference(spm,[status(thm)],[94,64,theory(equality)])).
% cnf(237,plain,(vplus(X1,X2)!=X3|~greater(X1,X3)),inference(er,[status(thm)],[232,theory(equality)])).
% cnf(244,plain,(greater(vplus(X2,X1),vplus(X3,X2))|~greater(X1,X3)),inference(spm,[status(thm)],[46,106,theory(equality)])).
% cnf(421,plain,(less(vplus(vd330,vd329),vplus(vd328,vd330))),inference(spm,[status(thm)],[57,208,theory(equality)])).
% cnf(806,plain,(X2!=X3|~greater(X1,X3)|~greater(X2,X1)),inference(spm,[status(thm)],[237,64,theory(equality)])).
% cnf(813,plain,(~greater(X1,X2)|~greater(X2,X1)),inference(er,[status(thm)],[806,theory(equality)])).
% cnf(841,plain,(~greater(vplus(vd330,vd329),vplus(vd328,vd330))),inference(spm,[status(thm)],[813,208,theory(equality)])).
% cnf(1118,negated_conjecture,(leq(X1,vd329)|vd329=vd328|~leq(X1,vd328)),inference(spm,[status(thm)],[227,209,theory(equality)])).
% cnf(1131,negated_conjecture,(vd329=X1|greater(vd329,X1)|vd329=vd328|~leq(X1,vd328)),inference(spm,[status(thm)],[213,1118,theory(equality)])).
% cnf(1137,negated_conjecture,(vd329=vd328|greater(vd329,vd328)),inference(spm,[status(thm)],[1131,163,theory(equality)])).
% cnf(1599,plain,(~greater(vd329,vd328)),inference(spm,[status(thm)],[841,244,theory(equality)])).
% cnf(1623,negated_conjecture,(vd329=vd328),inference(sr,[status(thm)],[1137,1599,theory(equality)])).
% cnf(1732,plain,(less(vplus(vd328,vd330),vplus(vd328,vd330))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[421,1623,theory(equality)]),106,theory(equality)])).
% cnf(1733,plain,($false),inference(sr,[status(thm)],[1732,156,theory(equality)])).
% cnf(1734,plain,($false),1733,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 506
% # ...of these trivial : 9
% # ...subsumed : 316
% # ...remaining for further processing: 181
% # Other redundant clauses eliminated : 56
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 68
% # Generated clauses : 1281
% # ...of the previous two non-trivial : 1183
% # Contextual simplify-reflections : 47
% # Paramodulations : 1209
% # Factorizations : 2
% # Equation resolutions : 69
% # Current number of processed clauses: 104
% # Positive orientable unit clauses: 13
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 24
% # Non-unit-clauses : 66
% # Current number of unprocessed clauses: 449
% # ...number of literals in the above : 1110
% # Clause-clause subsumption calls (NU) : 2291
% # Rec. Clause-clause subsumption calls : 2080
% # Unit Clause-clause subsumption calls : 122
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 31
% # Indexed BW rewrite successes : 19
% # Backwards rewriting index: 53 leaves, 1.77+/-1.436 terms/leaf
% # Paramod-from index: 27 leaves, 1.33+/-0.544 terms/leaf
% # Paramod-into index: 52 leaves, 1.67+/-1.139 terms/leaf
% # -------------------------------------------------
% # User time : 0.057 s
% # System time : 0.007 s
% # Total time : 0.064 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.19 CPU 0.27 WC
% FINAL PrfWatch: 0.19 CPU 0.27 WC
% SZS output end Solution for /tmp/SystemOnTPTP18583/NUM839+2.tptp
%
%------------------------------------------------------------------------------