TSTP Solution File: NUM841+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM841+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:46:09 EST 2010
% Result : Theorem 3.84s
% Output : Solution 3.84s
% 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/SystemOnTPTP18845/NUM841+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP18845/NUM841+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP18845/NUM841+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 18941
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 1.96 CPU 2.02 WC
% # SZS output start CNFRefutation.
% fof(3, axiom,greater(vd347,vd348),file('/tmp/SRASS.s.p', 'holds(conjunct2(211), 349, 0)')).
% fof(4, axiom,greater(vd344,vd345),file('/tmp/SRASS.s.p', 'holds(conjunct1(211), 346, 0)')).
% fof(6, axiom,![X4]:![X5]:![X6]:(greater(X4,X5)=>greater(vplus(X4,X6),vplus(X5,X6))),file('/tmp/SRASS.s.p', 'ass(cond(goal(193), 0), 2)')).
% fof(7, axiom,![X7]:![X8]:greater(vplus(X7,X8),X7),file('/tmp/SRASS.s.p', 'ass(cond(189, 0), 0)')).
% fof(10, axiom,![X9]:![X10]:(greater(X10,X9)<=>?[X11]:X10=vplus(X9,X11)),file('/tmp/SRASS.s.p', 'def(cond(conseq(axiom(3)), 11), 1)')).
% fof(14, axiom,![X15]:![X16]:vplus(X16,X15)=vplus(X15,X16),file('/tmp/SRASS.s.p', 'ass(cond(61, 0), 0)')).
% fof(15, axiom,![X17]:![X18]:![X19]:vplus(vplus(X17,X18),X19)=vplus(X17,vplus(X18,X19)),file('/tmp/SRASS.s.p', 'ass(cond(33, 0), 0)')).
% fof(26, conjecture,greater(vplus(vd344,vd347),vplus(vd345,vd348)),file('/tmp/SRASS.s.p', 'holds(214, 352, 0)')).
% fof(27, negated_conjecture,~(greater(vplus(vd344,vd347),vplus(vd345,vd348))),inference(assume_negation,[status(cth)],[26])).
% fof(29, negated_conjecture,~(greater(vplus(vd344,vd347),vplus(vd345,vd348))),inference(fof_simplification,[status(thm)],[27,theory(equality)])).
% cnf(32,plain,(greater(vd347,vd348)),inference(split_conjunct,[status(thm)],[3])).
% cnf(33,plain,(greater(vd344,vd345)),inference(split_conjunct,[status(thm)],[4])).
% fof(37, plain,![X4]:![X5]:![X6]:(~(greater(X4,X5))|greater(vplus(X4,X6),vplus(X5,X6))),inference(fof_nnf,[status(thm)],[6])).
% fof(38, plain,![X7]:![X8]:![X9]:(~(greater(X7,X8))|greater(vplus(X7,X9),vplus(X8,X9))),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])).
% fof(40, plain,![X9]:![X10]:greater(vplus(X9,X10),X9),inference(variable_rename,[status(thm)],[7])).
% cnf(41,plain,(greater(vplus(X1,X2),X1)),inference(split_conjunct,[status(thm)],[40])).
% fof(44, plain,![X9]:![X10]:((~(greater(X10,X9))|?[X11]:X10=vplus(X9,X11))&(![X11]:~(X10=vplus(X9,X11))|greater(X10,X9))),inference(fof_nnf,[status(thm)],[10])).
% fof(45, plain,![X12]:![X13]:((~(greater(X13,X12))|?[X14]:X13=vplus(X12,X14))&(![X15]:~(X13=vplus(X12,X15))|greater(X13,X12))),inference(variable_rename,[status(thm)],[44])).
% fof(46, plain,![X12]:![X13]:((~(greater(X13,X12))|X13=vplus(X12,esk1_2(X12,X13)))&(![X15]:~(X13=vplus(X12,X15))|greater(X13,X12))),inference(skolemize,[status(esa)],[45])).
% fof(47, plain,![X12]:![X13]:![X15]:((~(X13=vplus(X12,X15))|greater(X13,X12))&(~(greater(X13,X12))|X13=vplus(X12,esk1_2(X12,X13)))),inference(shift_quantors,[status(thm)],[46])).
% cnf(48,plain,(X1=vplus(X2,esk1_2(X2,X1))|~greater(X1,X2)),inference(split_conjunct,[status(thm)],[47])).
% fof(60, plain,![X17]:![X18]:vplus(X18,X17)=vplus(X17,X18),inference(variable_rename,[status(thm)],[14])).
% cnf(61,plain,(vplus(X1,X2)=vplus(X2,X1)),inference(split_conjunct,[status(thm)],[60])).
% fof(62, plain,![X20]:![X21]:![X22]:vplus(vplus(X20,X21),X22)=vplus(X20,vplus(X21,X22)),inference(variable_rename,[status(thm)],[15])).
% cnf(63,plain,(vplus(vplus(X1,X2),X3)=vplus(X1,vplus(X2,X3))),inference(split_conjunct,[status(thm)],[62])).
% cnf(90,negated_conjecture,(~greater(vplus(vd344,vd347),vplus(vd345,vd348))),inference(split_conjunct,[status(thm)],[29])).
% cnf(150,negated_conjecture,(~greater(vplus(vd347,vd344),vplus(vd345,vd348))),inference(rw,[status(thm)],[90,61,theory(equality)])).
% cnf(157,plain,(vplus(vd345,esk1_2(vd345,vd344))=vd344),inference(pm,[status(thm)],[48,33,theory(equality)])).
% cnf(173,plain,(greater(vplus(X1,vplus(X2,X3)),vplus(X1,X2))),inference(pm,[status(thm)],[41,63,theory(equality)])).
% cnf(189,plain,(greater(vplus(vd347,X1),vplus(vd348,X1))),inference(pm,[status(thm)],[39,32,theory(equality)])).
% cnf(371,plain,(vplus(vd344,X1)=vplus(vd345,vplus(esk1_2(vd345,vd344),X1))),inference(pm,[status(thm)],[63,157,theory(equality)])).
% cnf(582,plain,(vplus(vplus(vd348,X1),esk1_2(vplus(vd348,X1),vplus(vd347,X1)))=vplus(vd347,X1)),inference(pm,[status(thm)],[48,189,theory(equality)])).
% cnf(592,plain,(vplus(vd348,vplus(X1,esk1_2(vplus(vd348,X1),vplus(vd347,X1))))=vplus(vd347,X1)),inference(rw,[status(thm)],[582,63,theory(equality)])).
% cnf(5085,plain,(greater(vplus(X1,vplus(vd344,X2)),vplus(X1,vd345))),inference(pm,[status(thm)],[173,371,theory(equality)])).
% cnf(86108,plain,(greater(vplus(vd347,vd344),vplus(vd348,vd345))),inference(pm,[status(thm)],[5085,592,theory(equality)])).
% cnf(86144,plain,(greater(vplus(vd347,vd344),vplus(vd345,vd348))),inference(rw,[status(thm)],[86108,61,theory(equality)])).
% cnf(86145,plain,($false),inference(sr,[status(thm)],[86144,150,theory(equality)])).
% cnf(86146,plain,($false),86145,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 8189
% # ...of these trivial : 645
% # ...subsumed : 5955
% # ...remaining for further processing: 1589
% # Other redundant clauses eliminated : 31
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 20
% # Backward-rewritten : 48
% # Generated clauses : 61262
% # ...of the previous two non-trivial : 54284
% # Contextual simplify-reflections : 0
% # Paramodulations : 61144
% # Factorizations : 2
% # Equation resolutions : 115
% # Current number of processed clauses: 1519
% # Positive orientable unit clauses: 392
% # Positive unorientable unit clauses: 4
% # Negative unit clauses : 409
% # Non-unit-clauses : 714
% # Current number of unprocessed clauses: 44955
% # ...number of literals in the above : 94745
% # Clause-clause subsumption calls (NU) : 30532
% # Rec. Clause-clause subsumption calls : 30161
% # Unit Clause-clause subsumption calls : 5288
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2306
% # Indexed BW rewrite successes : 330
% # Backwards rewriting index: 834 leaves, 1.67+/-2.824 terms/leaf
% # Paramod-from index: 293 leaves, 1.59+/-1.790 terms/leaf
% # Paramod-into index: 751 leaves, 1.70+/-2.942 terms/leaf
% # -------------------------------------------------
% # User time : 1.809 s
% # System time : 0.059 s
% # Total time : 1.868 s
% # Maximum resident set size: 0 pages
% PrfWatch: 2.89 CPU 3.15 WC
% FINAL PrfWatch: 2.89 CPU 3.15 WC
% SZS output end Solution for /tmp/SystemOnTPTP18845/NUM841+2.tptp
%
%------------------------------------------------------------------------------