TSTP Solution File: NUM840+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM840+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 : 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:45:52 EST 2010
% Result : Theorem 4.70s
% Output : Solution 4.70s
% 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/SystemOnTPTP15306/NUM840+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP15306/NUM840+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP15306/NUM840+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 15402
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.94 CPU 2.02 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X4]:![X5]:(~(X4=X5)|~(less(X4,X5))),file('/tmp/SRASS.s.p', 'ass(cond(goal(130), 0), 1)')).
% fof(3, axiom,less(vplus(vd328,vd330),vplus(vd329,vd330)),file('/tmp/SRASS.s.p', 'holds(antec(conjunct2(conjunct2(204))), 335, 0)')).
% fof(4, axiom,![X6]:![X7]:(less(X7,X6)<=>?[X8]:X6=vplus(X7,X8)),file('/tmp/SRASS.s.p', 'def(cond(conseq(axiom(3)), 12), 1)')).
% fof(10, axiom,![X13]:![X14]:((X13=X14|?[X15]:X13=vplus(X14,X15))|?[X16]:X14=vplus(X13,X16)),file('/tmp/SRASS.s.p', 'ass(cond(goal(88), 0), 0)')).
% fof(13, axiom,![X13]:![X14]:(~(X13=X14)|~(?[X15]:X13=vplus(X14,X15))),file('/tmp/SRASS.s.p', 'ass(cond(goal(88), 0), 3)')).
% fof(16, axiom,![X22]:![X23]:vplus(X23,X22)=vplus(X22,X23),file('/tmp/SRASS.s.p', 'ass(cond(61, 0), 0)')).
% fof(17, axiom,![X24]:![X25]:![X26]:vplus(vplus(X24,X25),X26)=vplus(X24,vplus(X25,X26)),file('/tmp/SRASS.s.p', 'ass(cond(33, 0), 0)')).
% fof(19, axiom,![X4]:![X5]:((X4=X5|greater(X4,X5))|less(X4,X5)),file('/tmp/SRASS.s.p', 'ass(cond(goal(130), 0), 0)')).
% fof(22, axiom,![X27]:![X28]:(greater(X28,X27)<=>?[X29]:X28=vplus(X27,X29)),file('/tmp/SRASS.s.p', 'def(cond(conseq(axiom(3)), 11), 1)')).
% fof(26, conjecture,less(vd328,vd329),file('/tmp/SRASS.s.p', 'holds(conseq(conjunct2(conjunct2(204))), 336, 0)')).
% fof(27, negated_conjecture,~(less(vd328,vd329)),inference(assume_negation,[status(cth)],[26])).
% fof(28, plain,![X4]:![X5]:(~(X4=X5)|~(less(X4,X5))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(31, negated_conjecture,~(less(vd328,vd329)),inference(fof_simplification,[status(thm)],[27,theory(equality)])).
% fof(35, plain,![X6]:![X7]:(~(X6=X7)|~(less(X6,X7))),inference(variable_rename,[status(thm)],[28])).
% cnf(36,plain,(~less(X1,X2)|X1!=X2),inference(split_conjunct,[status(thm)],[35])).
% cnf(37,plain,(less(vplus(vd328,vd330),vplus(vd329,vd330))),inference(split_conjunct,[status(thm)],[3])).
% fof(38, plain,![X6]:![X7]:((~(less(X7,X6))|?[X8]:X6=vplus(X7,X8))&(![X8]:~(X6=vplus(X7,X8))|less(X7,X6))),inference(fof_nnf,[status(thm)],[4])).
% fof(39, plain,![X9]:![X10]:((~(less(X10,X9))|?[X11]:X9=vplus(X10,X11))&(![X12]:~(X9=vplus(X10,X12))|less(X10,X9))),inference(variable_rename,[status(thm)],[38])).
% fof(40, plain,![X9]:![X10]:((~(less(X10,X9))|X9=vplus(X10,esk1_2(X9,X10)))&(![X12]:~(X9=vplus(X10,X12))|less(X10,X9))),inference(skolemize,[status(esa)],[39])).
% fof(41, plain,![X9]:![X10]:![X12]:((~(X9=vplus(X10,X12))|less(X10,X9))&(~(less(X10,X9))|X9=vplus(X10,esk1_2(X9,X10)))),inference(shift_quantors,[status(thm)],[40])).
% cnf(42,plain,(X1=vplus(X2,esk1_2(X1,X2))|~less(X2,X1)),inference(split_conjunct,[status(thm)],[41])).
% cnf(43,plain,(less(X1,X2)|X2!=vplus(X1,X3)),inference(split_conjunct,[status(thm)],[41])).
% fof(57, plain,![X17]:![X18]:((X17=X18|?[X19]:X17=vplus(X18,X19))|?[X20]:X18=vplus(X17,X20)),inference(variable_rename,[status(thm)],[10])).
% fof(58, plain,![X17]:![X18]:((X17=X18|X17=vplus(X18,esk2_2(X17,X18)))|X18=vplus(X17,esk3_2(X17,X18))),inference(skolemize,[status(esa)],[57])).
% cnf(59,plain,(X1=vplus(X2,esk3_2(X2,X1))|X2=vplus(X1,esk2_2(X2,X1))|X2=X1),inference(split_conjunct,[status(thm)],[58])).
% fof(68, plain,![X13]:![X14]:(~(X13=X14)|![X15]:~(X13=vplus(X14,X15))),inference(fof_nnf,[status(thm)],[13])).
% fof(69, plain,![X16]:![X17]:(~(X16=X17)|![X18]:~(X16=vplus(X17,X18))),inference(variable_rename,[status(thm)],[68])).
% fof(70, plain,![X16]:![X17]:![X18]:(~(X16=vplus(X17,X18))|~(X16=X17)),inference(shift_quantors,[status(thm)],[69])).
% cnf(71,plain,(X1!=X2|X1!=vplus(X2,X3)),inference(split_conjunct,[status(thm)],[70])).
% fof(78, plain,![X24]:![X25]:vplus(X25,X24)=vplus(X24,X25),inference(variable_rename,[status(thm)],[16])).
% cnf(79,plain,(vplus(X1,X2)=vplus(X2,X1)),inference(split_conjunct,[status(thm)],[78])).
% fof(80, plain,![X27]:![X28]:![X29]:vplus(vplus(X27,X28),X29)=vplus(X27,vplus(X28,X29)),inference(variable_rename,[status(thm)],[17])).
% cnf(81,plain,(vplus(vplus(X1,X2),X3)=vplus(X1,vplus(X2,X3))),inference(split_conjunct,[status(thm)],[80])).
% fof(84, plain,![X6]:![X7]:((X6=X7|greater(X6,X7))|less(X6,X7)),inference(variable_rename,[status(thm)],[19])).
% cnf(85,plain,(less(X1,X2)|greater(X1,X2)|X1=X2),inference(split_conjunct,[status(thm)],[84])).
% fof(91, plain,![X27]:![X28]:((~(greater(X28,X27))|?[X29]:X28=vplus(X27,X29))&(![X29]:~(X28=vplus(X27,X29))|greater(X28,X27))),inference(fof_nnf,[status(thm)],[22])).
% fof(92, plain,![X30]:![X31]:((~(greater(X31,X30))|?[X32]:X31=vplus(X30,X32))&(![X33]:~(X31=vplus(X30,X33))|greater(X31,X30))),inference(variable_rename,[status(thm)],[91])).
% fof(93, plain,![X30]:![X31]:((~(greater(X31,X30))|X31=vplus(X30,esk4_2(X30,X31)))&(![X33]:~(X31=vplus(X30,X33))|greater(X31,X30))),inference(skolemize,[status(esa)],[92])).
% fof(94, plain,![X30]:![X31]:![X33]:((~(X31=vplus(X30,X33))|greater(X31,X30))&(~(greater(X31,X30))|X31=vplus(X30,esk4_2(X30,X31)))),inference(shift_quantors,[status(thm)],[93])).
% cnf(95,plain,(X1=vplus(X2,esk4_2(X2,X1))|~greater(X1,X2)),inference(split_conjunct,[status(thm)],[94])).
% cnf(104,negated_conjecture,(~less(vd328,vd329)),inference(split_conjunct,[status(thm)],[31])).
% cnf(108,plain,(~less(X1,X1)),inference(er,[status(thm)],[36,theory(equality)])).
% cnf(110,plain,(vplus(X1,X2)!=X1),inference(er,[status(thm)],[71,theory(equality)])).
% cnf(112,plain,(less(vplus(vd330,vd328),vplus(vd330,vd329))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[37,79,theory(equality)]),79,theory(equality)])).
% cnf(121,negated_conjecture,(vd328=vd329|greater(vd328,vd329)),inference(spm,[status(thm)],[104,85,theory(equality)])).
% cnf(125,plain,(less(X1,vplus(X1,X2))),inference(er,[status(thm)],[43,theory(equality)])).
% cnf(126,plain,(less(X1,X2)|vplus(X3,X1)!=X2),inference(spm,[status(thm)],[43,79,theory(equality)])).
% cnf(142,plain,(vplus(X1,vplus(X2,X3))!=vplus(X1,X2)),inference(spm,[status(thm)],[110,81,theory(equality)])).
% cnf(160,plain,(X3=vplus(X1,vplus(X2,esk1_2(X3,vplus(X1,X2))))|~less(vplus(X1,X2),X3)),inference(spm,[status(thm)],[81,42,theory(equality)])).
% cnf(217,plain,(less(X1,X2)|vplus(X3,esk3_2(X3,X1))=X1|X1=X3|X3!=X2),inference(spm,[status(thm)],[43,59,theory(equality)])).
% cnf(242,plain,(less(X1,X2)|vplus(X2,esk3_2(X2,X1))=X1|X1=X2),inference(er,[status(thm)],[217,theory(equality)])).
% cnf(268,plain,(less(X1,vplus(X2,X1))),inference(er,[status(thm)],[126,theory(equality)])).
% cnf(290,plain,(less(X1,vplus(X2,vplus(X3,X1)))),inference(spm,[status(thm)],[268,81,theory(equality)])).
% cnf(374,plain,(less(X1,vplus(X2,vplus(X1,X3)))),inference(spm,[status(thm)],[290,79,theory(equality)])).
% cnf(501,plain,(less(X1,vplus(X2,X3))|~less(X1,X3)),inference(spm,[status(thm)],[374,42,theory(equality)])).
% cnf(527,plain,(less(X1,vplus(X3,X2))|~less(X1,X3)),inference(spm,[status(thm)],[501,79,theory(equality)])).
% cnf(533,plain,(less(X1,X3)|~less(X1,X2)|~greater(X3,X2)),inference(spm,[status(thm)],[527,95,theory(equality)])).
% cnf(534,plain,(less(X1,X3)|vplus(X3,esk2_2(X2,X3))=X2|X3=X2|~less(X1,X2)),inference(spm,[status(thm)],[527,59,theory(equality)])).
% cnf(536,plain,(less(X1,X3)|~less(X1,X2)|~less(X2,X3)),inference(spm,[status(thm)],[527,42,theory(equality)])).
% cnf(592,plain,(less(vplus(vd330,vd328),X1)|~less(vplus(vd330,vd329),X1)),inference(spm,[status(thm)],[536,112,theory(equality)])).
% cnf(1303,plain,(X3!=vplus(X1,X2)|~less(vplus(X1,X2),X3)),inference(spm,[status(thm)],[142,160,theory(equality)])).
% cnf(3099,plain,(less(vplus(vd330,vd328),vplus(vplus(vd330,vd329),X1))),inference(spm,[status(thm)],[592,125,theory(equality)])).
% cnf(3112,plain,(less(vplus(vd330,vd328),vplus(vd330,vplus(vd329,X1)))),inference(rw,[status(thm)],[3099,81,theory(equality)])).
% cnf(3437,plain,(vplus(vd330,vd329)!=vplus(vd330,vd328)),inference(spm,[status(thm)],[1303,112,theory(equality)])).
% cnf(6887,plain,(less(X1,X3)|X3=X2|less(X3,X2)|~less(X1,X2)),inference(spm,[status(thm)],[527,242,theory(equality)])).
% cnf(6898,plain,(less(X1,X2)|X3=X1|less(X3,X1)|X3!=X2),inference(spm,[status(thm)],[43,242,theory(equality)])).
% cnf(6980,plain,(less(X1,X2)|X2=X1|less(X2,X1)),inference(er,[status(thm)],[6898,theory(equality)])).
% cnf(8336,plain,(X1=vplus(X2,X3)|less(X1,vplus(X2,X3))|less(X2,X1)),inference(spm,[status(thm)],[6887,125,theory(equality)])).
% cnf(11694,plain,(less(X1,vplus(X2,X3))|less(X2,X1)),inference(csr,[status(thm)],[8336,43])).
% cnf(11745,plain,(less(X1,X3)|less(X2,X1)|~less(X2,X3)),inference(spm,[status(thm)],[11694,42,theory(equality)])).
% cnf(30484,negated_conjecture,(less(X1,vd328)|vd329=vd328|~less(X1,vd329)),inference(spm,[status(thm)],[533,121,theory(equality)])).
% cnf(30608,negated_conjecture,(vd329=vd328|less(X1,vd328)|X1=vd329|less(vd329,X1)),inference(spm,[status(thm)],[30484,6980,theory(equality)])).
% cnf(30767,negated_conjecture,(less(X1,X2)|less(X2,vd328)|vd329=vd328|X1=vd329|less(vd329,X1)),inference(spm,[status(thm)],[11745,30608,theory(equality)])).
% cnf(32220,negated_conjecture,(vd329=vd328|less(vd329,vd328)|less(vd328,vd329)),inference(ef,[status(thm)],[30767,theory(equality)])).
% cnf(32381,negated_conjecture,(vd329=vd328|less(vd329,vd328)),inference(sr,[status(thm)],[32220,104,theory(equality)])).
% cnf(32739,negated_conjecture,(vplus(X1,esk2_2(vd328,X1))=vd328|X1=vd328|less(vd329,X1)|vd329=vd328),inference(spm,[status(thm)],[534,32381,theory(equality)])).
% cnf(92135,negated_conjecture,(less(vplus(vd330,vd328),vplus(vd330,vd328))|vd329=vd328|less(vd329,vd329)),inference(spm,[status(thm)],[3112,32739,theory(equality)])).
% cnf(92624,negated_conjecture,(vd329=vd328|less(vd329,vd329)),inference(sr,[status(thm)],[92135,108,theory(equality)])).
% cnf(92625,negated_conjecture,(vd329=vd328),inference(sr,[status(thm)],[92624,108,theory(equality)])).
% cnf(93400,plain,($false),inference(rw,[status(thm)],[3437,92625,theory(equality)])).
% cnf(93401,plain,($false),inference(cn,[status(thm)],[93400,theory(equality)])).
% cnf(93402,plain,($false),93401,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 4775
% # ...of these trivial : 130
% # ...subsumed : 3689
% # ...remaining for further processing: 956
% # Other redundant clauses eliminated : 1138
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 30
% # Backward-rewritten : 487
% # Generated clauses : 76414
% # ...of the previous two non-trivial : 69690
% # Contextual simplify-reflections : 1407
% # Paramodulations : 75099
% # Factorizations : 100
% # Equation resolutions : 1215
% # Current number of processed clauses: 413
% # Positive orientable unit clauses: 36
% # Positive unorientable unit clauses: 4
% # Negative unit clauses : 40
% # Non-unit-clauses : 333
% # Current number of unprocessed clauses: 26597
% # ...number of literals in the above : 84526
% # Clause-clause subsumption calls (NU) : 71291
% # Rec. Clause-clause subsumption calls : 53771
% # Unit Clause-clause subsumption calls : 310
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 424
% # Indexed BW rewrite successes : 128
% # Backwards rewriting index: 103 leaves, 3.47+/-4.721 terms/leaf
% # Paramod-from index: 71 leaves, 2.13+/-1.950 terms/leaf
% # Paramod-into index: 101 leaves, 3.26+/-4.348 terms/leaf
% # -------------------------------------------------
% # User time : 2.551 s
% # System time : 0.076 s
% # Total time : 2.627 s
% # Maximum resident set size: 0 pages
% PrfWatch: 3.89 CPU 4.00 WC
% FINAL PrfWatch: 3.89 CPU 4.00 WC
% SZS output end Solution for /tmp/SystemOnTPTP15306/NUM840+2.tptp
%
%------------------------------------------------------------------------------