%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM838+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 : art03.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:23 EST 2010
% Result : Theorem 0.90s
% Output : Solution 0.90s
% 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/SystemOnTPTP21075/NUM838+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP21075/NUM838+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21075/NUM838+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 21171
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,greater(vd301,vd302),file('/tmp/SRASS.s.p', 'holds(antec(195), 304, 0)')).
% fof(2, axiom,![X1]:![X2]:![X3]:(greater(X2,X3)=>greater(vplus(X2,X1),vplus(X3,X1))),file('/tmp/SRASS.s.p', 'ass(cond(proof(196), 0), 4)')).
% fof(30, conjecture,greater(vplus(vd301,vd303),vplus(vd302,vd303)),file('/tmp/SRASS.s.p', 'holds(conseq(195), 305, 0)')).
% fof(31, negated_conjecture,~(greater(vplus(vd301,vd303),vplus(vd302,vd303))),inference(assume_negation,[status(cth)],[30])).
% fof(35, negated_conjecture,~(greater(vplus(vd301,vd303),vplus(vd302,vd303))),inference(fof_simplification,[status(thm)],[31,theory(equality)])).
% cnf(36,plain,(greater(vd301,vd302)),inference(split_conjunct,[status(thm)],[1])).
% fof(37, plain,![X1]:![X2]:![X3]:(~(greater(X2,X3))|greater(vplus(X2,X1),vplus(X3,X1))),inference(fof_nnf,[status(thm)],[2])).
% fof(38, plain,![X4]:![X5]:![X6]:(~(greater(X5,X6))|greater(vplus(X5,X4),vplus(X6,X4))),inference(variable_rename,[status(thm)],[37])).
% cnf(39,plain,(greater(vplus(X1,X2),vplus(X3,X2))|~greater(X1,X3)),inference(split_conjunct,[status(thm)],[38])).
% cnf(122,negated_conjecture,(~greater(vplus(vd301,vd303),vplus(vd302,vd303))),inference(split_conjunct,[status(thm)],[35])).
% cnf(205,negated_conjecture,(~greater(vd301,vd302)),inference(spm,[status(thm)],[122,39,theory(equality)])).
% cnf(218,negated_conjecture,($false),inference(rw,[status(thm)],[205,36,theory(equality)])).
% cnf(219,negated_conjecture,($false),inference(cn,[status(thm)],[218,theory(equality)])).
% cnf(220,negated_conjecture,($false),219,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 55
% # ...of these trivial : 5
% # ...subsumed : 2
% # ...remaining for further processing: 48
% # Other redundant clauses eliminated : 16
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 79
% # ...of the previous two non-trivial : 45
% # Contextual simplify-reflections : 0
% # Paramodulations : 60
% # Factorizations : 0
% # Equation resolutions : 19
% # Current number of processed clauses: 20
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 4
% # Non-unit-clauses : 12
% # Current number of unprocessed clauses: 45
% # ...number of literals in the above : 75
% # Clause-clause subsumption calls (NU) : 19
% # Rec. Clause-clause subsumption calls : 19
% # Unit Clause-clause subsumption calls : 17
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 20
% # Indexed BW rewrite successes : 18
% # Backwards rewriting index: 22 leaves, 1.55+/-1.269 terms/leaf
% # Paramod-from index: 9 leaves, 1.11+/-0.314 terms/leaf
% # Paramod-into index: 20 leaves, 1.30+/-0.954 terms/leaf
% # -------------------------------------------------
% # User time : 0.014 s
% # System time : 0.003 s
% # Total time : 0.017 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.18 WC
% FINAL PrfWatch: 0.10 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP21075/NUM838+2.tptp
%
%------------------------------------------------------------------------------