TSTP Solution File: NUM839+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM839+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 : art09.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:29 EST 2010
% Result : Theorem 0.99s
% Output : Solution 0.99s
% 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/SystemOnTPTP28742/NUM839+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP28742/NUM839+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP28742/NUM839+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 28838
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.014 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]:(geq(X19,X18)<=>(greater(X19,X18)|X19=X18)),file('/tmp/SRASS.s.p', 'def(cond(conseq(axiom(3)), 16), 1)')).
% fof(12, axiom,![X1]:![X2]:(~(X1=X2)|~(less(X1,X2))),file('/tmp/SRASS.s.p', 'ass(cond(goal(130), 0), 1)')).
% fof(13, axiom,![X20]:![X21]:![X22]:((leq(X21,X22)&leq(X20,X21))=>leq(X20,X22)),file('/tmp/SRASS.s.p', 'ass(cond(184, 0), 0)')).
% fof(21, axiom,![X28]:![X29]:(~(?[X30]:X28=vplus(X29,X30))|~(?[X31]:X29=vplus(X28,X31))),file('/tmp/SRASS.s.p', 'ass(cond(goal(88), 0), 2)')).
% fof(25, axiom,![X37]:![X38]:vplus(X38,X37)=vplus(X37,X38),file('/tmp/SRASS.s.p', 'ass(cond(61, 0), 0)')).
% fof(27, axiom,![X42]:![X43]:(leq(X43,X42)<=>(less(X43,X42)|X43=X42)),file('/tmp/SRASS.s.p', 'def(cond(conseq(axiom(3)), 17), 1)')).
% fof(28, axiom,![X44]:![X45]:(leq(X44,X45)=>geq(X45,X44)),file('/tmp/SRASS.s.p', 'ass(cond(163, 0), 0)')).
% fof(37, conjecture,greater(vd328,vd329),file('/tmp/SRASS.s.p', 'holds(conseq(204), 332, 0)')).
% fof(38, negated_conjecture,~(greater(vd328,vd329)),inference(assume_negation,[status(cth)],[37])).
% fof(41, plain,![X1]:![X2]:(~(X1=X2)|~(less(X1,X2))),inference(fof_simplification,[status(thm)],[12,theory(equality)])).
% fof(42, negated_conjecture,~(greater(vd328,vd329)),inference(fof_simplification,[status(thm)],[38,theory(equality)])).
% cnf(45,plain,(greater(vplus(vd328,vd330),vplus(vd329,vd330))),inference(split_conjunct,[status(thm)],[2])).
% fof(46, plain,![X3]:![X4]:![X5]:(~(greater(X3,X4))|greater(vplus(X3,X5),vplus(X4,X5))),inference(fof_nnf,[status(thm)],[3])).
% fof(47, plain,![X6]:![X7]:![X8]:(~(greater(X6,X7))|greater(vplus(X6,X8),vplus(X7,X8))),inference(variable_rename,[status(thm)],[46])).
% cnf(48,plain,(greater(vplus(X1,X2),vplus(X3,X2))|~greater(X1,X3)),inference(split_conjunct,[status(thm)],[47])).
% fof(57, plain,![X13]:![X14]:(~(greater(X13,X14))|less(X14,X13)),inference(fof_nnf,[status(thm)],[7])).
% fof(58, plain,![X15]:![X16]:(~(greater(X15,X16))|less(X16,X15)),inference(variable_rename,[status(thm)],[57])).
% cnf(59,plain,(less(X1,X2)|~greater(X2,X1)),inference(split_conjunct,[status(thm)],[58])).
% fof(62, 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(63, plain,![X18]:![X19]:((~(greater(X19,X18))|?[X20]:X19=vplus(X18,X20))&(![X21]:~(X19=vplus(X18,X21))|greater(X19,X18))),inference(variable_rename,[status(thm)],[62])).
% fof(64, 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)],[63])).
% fof(65, 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)],[64])).
% cnf(66,plain,(X1=vplus(X2,esk1_2(X2,X1))|~greater(X1,X2)),inference(split_conjunct,[status(thm)],[65])).
% fof(68, plain,![X3]:![X4]:((X3=X4|greater(X3,X4))|less(X3,X4)),inference(variable_rename,[status(thm)],[10])).
% cnf(69,plain,(less(X1,X2)|greater(X1,X2)|X1=X2),inference(split_conjunct,[status(thm)],[68])).
% fof(70, plain,![X18]:![X19]:((~(geq(X19,X18))|(greater(X19,X18)|X19=X18))&((~(greater(X19,X18))&~(X19=X18))|geq(X19,X18))),inference(fof_nnf,[status(thm)],[11])).
% fof(71, plain,![X20]:![X21]:((~(geq(X21,X20))|(greater(X21,X20)|X21=X20))&((~(greater(X21,X20))&~(X21=X20))|geq(X21,X20))),inference(variable_rename,[status(thm)],[70])).
% fof(72, plain,![X20]:![X21]:((~(geq(X21,X20))|(greater(X21,X20)|X21=X20))&((~(greater(X21,X20))|geq(X21,X20))&(~(X21=X20)|geq(X21,X20)))),inference(distribute,[status(thm)],[71])).
% cnf(75,plain,(X1=X2|greater(X1,X2)|~geq(X1,X2)),inference(split_conjunct,[status(thm)],[72])).
% fof(76, plain,![X3]:![X4]:(~(X3=X4)|~(less(X3,X4))),inference(variable_rename,[status(thm)],[41])).
% cnf(77,plain,(~less(X1,X2)|X1!=X2),inference(split_conjunct,[status(thm)],[76])).
% fof(78, plain,![X20]:![X21]:![X22]:((~(leq(X21,X22))|~(leq(X20,X21)))|leq(X20,X22)),inference(fof_nnf,[status(thm)],[13])).
% fof(79, plain,![X23]:![X24]:![X25]:((~(leq(X24,X25))|~(leq(X23,X24)))|leq(X23,X25)),inference(variable_rename,[status(thm)],[78])).
% cnf(80,plain,(leq(X1,X2)|~leq(X1,X3)|~leq(X3,X2)),inference(split_conjunct,[status(thm)],[79])).
% fof(102, plain,![X28]:![X29]:(![X30]:~(X28=vplus(X29,X30))|![X31]:~(X29=vplus(X28,X31))),inference(fof_nnf,[status(thm)],[21])).
% fof(103, plain,![X32]:![X33]:(![X34]:~(X32=vplus(X33,X34))|![X35]:~(X33=vplus(X32,X35))),inference(variable_rename,[status(thm)],[102])).
% fof(104, plain,![X32]:![X33]:![X34]:![X35]:(~(X33=vplus(X32,X35))|~(X32=vplus(X33,X34))),inference(shift_quantors,[status(thm)],[103])).
% cnf(105,plain,(X1!=vplus(X2,X3)|X2!=vplus(X1,X4)),inference(split_conjunct,[status(thm)],[104])).
% fof(116, plain,![X39]:![X40]:vplus(X40,X39)=vplus(X39,X40),inference(variable_rename,[status(thm)],[25])).
% cnf(117,plain,(vplus(X1,X2)=vplus(X2,X1)),inference(split_conjunct,[status(thm)],[116])).
% fof(120, plain,![X42]:![X43]:((~(leq(X43,X42))|(less(X43,X42)|X43=X42))&((~(less(X43,X42))&~(X43=X42))|leq(X43,X42))),inference(fof_nnf,[status(thm)],[27])).
% fof(121, plain,![X44]:![X45]:((~(leq(X45,X44))|(less(X45,X44)|X45=X44))&((~(less(X45,X44))&~(X45=X44))|leq(X45,X44))),inference(variable_rename,[status(thm)],[120])).
% fof(122, plain,![X44]:![X45]:((~(leq(X45,X44))|(less(X45,X44)|X45=X44))&((~(less(X45,X44))|leq(X45,X44))&(~(X45=X44)|leq(X45,X44)))),inference(distribute,[status(thm)],[121])).
% cnf(123,plain,(leq(X1,X2)|X1!=X2),inference(split_conjunct,[status(thm)],[122])).
% cnf(124,plain,(leq(X1,X2)|~less(X1,X2)),inference(split_conjunct,[status(thm)],[122])).
% fof(126, plain,![X44]:![X45]:(~(leq(X44,X45))|geq(X45,X44)),inference(fof_nnf,[status(thm)],[28])).
% fof(127, plain,![X46]:![X47]:(~(leq(X46,X47))|geq(X47,X46)),inference(variable_rename,[status(thm)],[126])).
% cnf(128,plain,(geq(X1,X2)|~leq(X2,X1)),inference(split_conjunct,[status(thm)],[127])).
% cnf(155,negated_conjecture,(~greater(vd328,vd329)),inference(split_conjunct,[status(thm)],[42])).
% cnf(165,plain,(~less(X1,X1)),inference(er,[status(thm)],[77,theory(equality)])).
% cnf(171,plain,(leq(X1,X1)),inference(er,[status(thm)],[123,theory(equality)])).
% cnf(222,plain,(greater(vplus(vd328,vd330),vplus(vd330,vd329))),inference(rw,[status(thm)],[45,117,theory(equality)])).
% cnf(223,negated_conjecture,(vd328=vd329|less(vd328,vd329)),inference(spm,[status(thm)],[155,69,theory(equality)])).
% cnf(227,plain,(X1=X2|greater(X1,X2)|~leq(X2,X1)),inference(spm,[status(thm)],[75,128,theory(equality)])).
% cnf(241,plain,(leq(X1,X2)|~leq(X1,X3)|~less(X3,X2)),inference(spm,[status(thm)],[80,124,theory(equality)])).
% cnf(246,plain,(X2!=X3|vplus(X3,X4)!=X1|~greater(X2,X1)),inference(spm,[status(thm)],[105,66,theory(equality)])).
% cnf(251,plain,(vplus(X1,X2)!=X3|~greater(X1,X3)),inference(er,[status(thm)],[246,theory(equality)])).
% cnf(258,plain,(greater(vplus(X2,X1),vplus(X3,X2))|~greater(X1,X3)),inference(spm,[status(thm)],[48,117,theory(equality)])).
% cnf(400,plain,(less(vplus(vd330,vd329),vplus(vd328,vd330))),inference(spm,[status(thm)],[59,222,theory(equality)])).
% cnf(843,plain,(X2!=X3|~greater(X1,X3)|~greater(X2,X1)),inference(spm,[status(thm)],[251,66,theory(equality)])).
% cnf(850,plain,(~greater(X1,X2)|~greater(X2,X1)),inference(er,[status(thm)],[843,theory(equality)])).
% cnf(881,plain,(~greater(vplus(vd330,vd329),vplus(vd328,vd330))),inference(spm,[status(thm)],[850,222,theory(equality)])).
% cnf(1119,negated_conjecture,(leq(X1,vd329)|vd329=vd328|~leq(X1,vd328)),inference(spm,[status(thm)],[241,223,theory(equality)])).
% cnf(1128,negated_conjecture,(vd329=X1|greater(vd329,X1)|vd329=vd328|~leq(X1,vd328)),inference(spm,[status(thm)],[227,1119,theory(equality)])).
% cnf(1134,negated_conjecture,(vd329=vd328|greater(vd329,vd328)),inference(spm,[status(thm)],[1128,171,theory(equality)])).
% cnf(1586,plain,(~greater(vd329,vd328)),inference(spm,[status(thm)],[881,258,theory(equality)])).
% cnf(1610,negated_conjecture,(vd329=vd328),inference(sr,[status(thm)],[1134,1586,theory(equality)])).
% cnf(1715,plain,(less(vplus(vd328,vd330),vplus(vd328,vd330))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[400,1610,theory(equality)]),117,theory(equality)])).
% cnf(1716,plain,($false),inference(sr,[status(thm)],[1715,165,theory(equality)])).
% cnf(1717,plain,($false),1716,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 506
% # ...of these trivial : 10
% # ...subsumed : 317
% # ...remaining for further processing: 179
% # Other redundant clauses eliminated : 56
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 3
% # Backward-rewritten : 64
% # Generated clauses : 1263
% # ...of the previous two non-trivial : 1167
% # Contextual simplify-reflections : 45
% # Paramodulations : 1191
% # Factorizations : 2
% # Equation resolutions : 69
% # Current number of processed clauses: 105
% # Positive orientable unit clauses: 13
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 26
% # Non-unit-clauses : 65
% # Current number of unprocessed clauses: 451
% # ...number of literals in the above : 1110
% # Clause-clause subsumption calls (NU) : 2215
% # Rec. Clause-clause subsumption calls : 2025
% # Unit Clause-clause subsumption calls : 125
% # 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.058 s
% # System time : 0.004 s
% # Total time : 0.062 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.15 CPU 0.25 WC
% FINAL PrfWatch: 0.15 CPU 0.25 WC
% SZS output end Solution for /tmp/SystemOnTPTP28742/NUM839+1.tptp
%
%------------------------------------------------------------------------------