%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM836+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:44:52 EST 2010
% Result : Theorem 0.89s
% Output : Solution 0.89s
% 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/SystemOnTPTP14529/NUM836+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP14529/NUM836+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP14529/NUM836+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 14625
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.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,![X1]:![X2]:(less(X2,X1)<=>?[X3]:X1=vplus(X2,X3)),file('/tmp/SRASS.s.p', 'def(cond(conseq(axiom(3)), 12), 1)')).
% fof(3, axiom,![X4]:![X5]:(greater(X5,X4)<=>?[X6]:X5=vplus(X4,X6)),file('/tmp/SRASS.s.p', 'def(cond(conseq(axiom(3)), 11), 1)')).
% fof(6, axiom,![X7]:![X8]:(~(?[X9]:X7=vplus(X8,X9))|~(?[X10]:X8=vplus(X7,X10))),file('/tmp/SRASS.s.p', 'ass(cond(goal(88), 0), 2)')).
% fof(11, conjecture,(~(greater(vd203,vd204))|~(less(vd203,vd204))),file('/tmp/SRASS.s.p', 'dis(ex(cond(conseq(131), 0), 1))')).
% fof(12, negated_conjecture,~((~(greater(vd203,vd204))|~(less(vd203,vd204)))),inference(assume_negation,[status(cth)],[11])).
% fof(14, negated_conjecture,~((~(greater(vd203,vd204))|~(less(vd203,vd204)))),inference(fof_simplification,[status(thm)],[12,theory(equality)])).
% fof(16, plain,![X1]:![X2]:((~(less(X2,X1))|?[X3]:X1=vplus(X2,X3))&(![X3]:~(X1=vplus(X2,X3))|less(X2,X1))),inference(fof_nnf,[status(thm)],[2])).
% fof(17, plain,![X4]:![X5]:((~(less(X5,X4))|?[X6]:X4=vplus(X5,X6))&(![X7]:~(X4=vplus(X5,X7))|less(X5,X4))),inference(variable_rename,[status(thm)],[16])).
% fof(18, plain,![X4]:![X5]:((~(less(X5,X4))|X4=vplus(X5,esk1_2(X4,X5)))&(![X7]:~(X4=vplus(X5,X7))|less(X5,X4))),inference(skolemize,[status(esa)],[17])).
% fof(19, plain,![X4]:![X5]:![X7]:((~(X4=vplus(X5,X7))|less(X5,X4))&(~(less(X5,X4))|X4=vplus(X5,esk1_2(X4,X5)))),inference(shift_quantors,[status(thm)],[18])).
% cnf(20,plain,(X1=vplus(X2,esk1_2(X1,X2))|~less(X2,X1)),inference(split_conjunct,[status(thm)],[19])).
% fof(22, plain,![X4]:![X5]:((~(greater(X5,X4))|?[X6]:X5=vplus(X4,X6))&(![X6]:~(X5=vplus(X4,X6))|greater(X5,X4))),inference(fof_nnf,[status(thm)],[3])).
% fof(23, plain,![X7]:![X8]:((~(greater(X8,X7))|?[X9]:X8=vplus(X7,X9))&(![X10]:~(X8=vplus(X7,X10))|greater(X8,X7))),inference(variable_rename,[status(thm)],[22])).
% fof(24, plain,![X7]:![X8]:((~(greater(X8,X7))|X8=vplus(X7,esk2_2(X7,X8)))&(![X10]:~(X8=vplus(X7,X10))|greater(X8,X7))),inference(skolemize,[status(esa)],[23])).
% fof(25, plain,![X7]:![X8]:![X10]:((~(X8=vplus(X7,X10))|greater(X8,X7))&(~(greater(X8,X7))|X8=vplus(X7,esk2_2(X7,X8)))),inference(shift_quantors,[status(thm)],[24])).
% cnf(26,plain,(X1=vplus(X2,esk2_2(X2,X1))|~greater(X1,X2)),inference(split_conjunct,[status(thm)],[25])).
% fof(35, plain,![X7]:![X8]:(![X9]:~(X7=vplus(X8,X9))|![X10]:~(X8=vplus(X7,X10))),inference(fof_nnf,[status(thm)],[6])).
% fof(36, plain,![X11]:![X12]:(![X13]:~(X11=vplus(X12,X13))|![X14]:~(X12=vplus(X11,X14))),inference(variable_rename,[status(thm)],[35])).
% fof(37, plain,![X11]:![X12]:![X13]:![X14]:(~(X12=vplus(X11,X14))|~(X11=vplus(X12,X13))),inference(shift_quantors,[status(thm)],[36])).
% cnf(38,plain,(X1!=vplus(X2,X3)|X2!=vplus(X1,X4)),inference(split_conjunct,[status(thm)],[37])).
% fof(52, negated_conjecture,(greater(vd203,vd204)&less(vd203,vd204)),inference(fof_nnf,[status(thm)],[14])).
% cnf(53,negated_conjecture,(less(vd203,vd204)),inference(split_conjunct,[status(thm)],[52])).
% cnf(54,negated_conjecture,(greater(vd203,vd204)),inference(split_conjunct,[status(thm)],[52])).
% cnf(68,plain,(X2!=X3|vplus(X3,X4)!=X1|~less(X1,X2)),inference(spm,[status(thm)],[38,20,theory(equality)])).
% cnf(71,plain,(vplus(X1,X2)!=X3|~less(X3,X1)),inference(er,[status(thm)],[68,theory(equality)])).
% cnf(151,plain,(X2!=X3|~less(X3,X1)|~greater(X2,X1)),inference(spm,[status(thm)],[71,26,theory(equality)])).
% cnf(155,plain,(~less(X1,X2)|~greater(X1,X2)),inference(er,[status(thm)],[151,theory(equality)])).
% cnf(157,negated_conjecture,(~greater(vd203,vd204)),inference(spm,[status(thm)],[155,53,theory(equality)])).
% cnf(160,negated_conjecture,($false),inference(rw,[status(thm)],[157,54,theory(equality)])).
% cnf(161,negated_conjecture,($false),inference(cn,[status(thm)],[160,theory(equality)])).
% cnf(162,negated_conjecture,($false),161,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 29
% # ...of these trivial : 0
% # ...subsumed : 5
% # ...remaining for further processing: 24
% # Other redundant clauses eliminated : 20
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 94
% # ...of the previous two non-trivial : 63
% # Contextual simplify-reflections : 0
% # Paramodulations : 69
% # Factorizations : 0
% # Equation resolutions : 25
% # Current number of processed clauses: 21
% # Positive orientable unit clauses: 6
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 11
% # Current number of unprocessed clauses: 40
% # ...number of literals in the above : 104
% # Clause-clause subsumption calls (NU) : 5
% # Rec. Clause-clause subsumption calls : 5
% # Unit Clause-clause subsumption calls : 6
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 21 leaves, 1.48+/-1.258 terms/leaf
% # Paramod-from index: 11 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 19 leaves, 1.32+/-0.976 terms/leaf
% # -------------------------------------------------
% # User time : 0.013 s
% # System time : 0.002 s
% # Total time : 0.015 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.17 WC
% FINAL PrfWatch: 0.09 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP14529/NUM836+2.tptp
%
%------------------------------------------------------------------------------