TSTP Solution File: NUM853+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM853+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 : art04.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:48:55 EST 2010
% Result : Theorem 0.97s
% Output : Solution 0.97s
% 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/SystemOnTPTP20531/NUM853+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP20531/NUM853+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP20531/NUM853+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 20627
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(~(X1=X2)|~(greater(X1,X2))),file('/tmp/SRASS.s.p', 'ass(cond(goal(130), 0), 3)')).
% fof(2, axiom,greater(vmul(vd486,vd487),vmul(vd488,vd487)),file('/tmp/SRASS.s.p', 'holds(antec(307), 489, 0)')).
% fof(3, axiom,![X3]:![X4]:![X5]:(greater(X4,X5)=>greater(vmul(X4,X3),vmul(X5,X3))),file('/tmp/SRASS.s.p', 'ass(cond(299, 0), 2)')).
% fof(13, axiom,![X23]:![X24]:(less(X23,X24)=>greater(X24,X23)),file('/tmp/SRASS.s.p', 'ass(cond(147, 0), 0)')).
% fof(14, axiom,![X25]:![X26]:(greater(X25,X26)=>less(X26,X25)),file('/tmp/SRASS.s.p', 'ass(cond(140, 0), 0)')).
% fof(15, axiom,![X1]:![X2]:(~(greater(X1,X2))|~(less(X1,X2))),file('/tmp/SRASS.s.p', 'ass(cond(goal(130), 0), 2)')).
% fof(16, axiom,![X1]:![X2]:((X1=X2|greater(X1,X2))|less(X1,X2)),file('/tmp/SRASS.s.p', 'ass(cond(goal(130), 0), 0)')).
% fof(20, axiom,![X32]:![X33]:vmul(X32,X33)=vmul(X33,X32),file('/tmp/SRASS.s.p', 'ass(cond(270, 0), 0)')).
% fof(37, conjecture,greater(vd486,vd488),file('/tmp/SRASS.s.p', 'holds(conseq(307), 490, 0)')).
% fof(38, negated_conjecture,~(greater(vd486,vd488)),inference(assume_negation,[status(cth)],[37])).
% fof(39, plain,![X1]:![X2]:(~(X1=X2)|~(greater(X1,X2))),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(40, plain,![X1]:![X2]:(~(greater(X1,X2))|~(less(X1,X2))),inference(fof_simplification,[status(thm)],[15,theory(equality)])).
% fof(42, negated_conjecture,~(greater(vd486,vd488)),inference(fof_simplification,[status(thm)],[38,theory(equality)])).
% fof(43, plain,![X3]:![X4]:(~(X3=X4)|~(greater(X3,X4))),inference(variable_rename,[status(thm)],[39])).
% cnf(44,plain,(~greater(X1,X2)|X1!=X2),inference(split_conjunct,[status(thm)],[43])).
% cnf(45,plain,(greater(vmul(vd486,vd487),vmul(vd488,vd487))),inference(split_conjunct,[status(thm)],[2])).
% fof(46, plain,![X3]:![X4]:![X5]:(~(greater(X4,X5))|greater(vmul(X4,X3),vmul(X5,X3))),inference(fof_nnf,[status(thm)],[3])).
% fof(47, plain,![X6]:![X7]:![X8]:(~(greater(X7,X8))|greater(vmul(X7,X6),vmul(X8,X6))),inference(variable_rename,[status(thm)],[46])).
% cnf(48,plain,(greater(vmul(X1,X2),vmul(X3,X2))|~greater(X1,X3)),inference(split_conjunct,[status(thm)],[47])).
% fof(80, plain,![X23]:![X24]:(~(less(X23,X24))|greater(X24,X23)),inference(fof_nnf,[status(thm)],[13])).
% fof(81, plain,![X25]:![X26]:(~(less(X25,X26))|greater(X26,X25)),inference(variable_rename,[status(thm)],[80])).
% cnf(82,plain,(greater(X1,X2)|~less(X2,X1)),inference(split_conjunct,[status(thm)],[81])).
% fof(83, plain,![X25]:![X26]:(~(greater(X25,X26))|less(X26,X25)),inference(fof_nnf,[status(thm)],[14])).
% fof(84, plain,![X27]:![X28]:(~(greater(X27,X28))|less(X28,X27)),inference(variable_rename,[status(thm)],[83])).
% cnf(85,plain,(less(X1,X2)|~greater(X2,X1)),inference(split_conjunct,[status(thm)],[84])).
% fof(86, plain,![X3]:![X4]:(~(greater(X3,X4))|~(less(X3,X4))),inference(variable_rename,[status(thm)],[40])).
% cnf(87,plain,(~less(X1,X2)|~greater(X1,X2)),inference(split_conjunct,[status(thm)],[86])).
% fof(88, plain,![X3]:![X4]:((X3=X4|greater(X3,X4))|less(X3,X4)),inference(variable_rename,[status(thm)],[16])).
% cnf(89,plain,(less(X1,X2)|greater(X1,X2)|X1=X2),inference(split_conjunct,[status(thm)],[88])).
% fof(97, plain,![X34]:![X35]:vmul(X34,X35)=vmul(X35,X34),inference(variable_rename,[status(thm)],[20])).
% cnf(98,plain,(vmul(X1,X2)=vmul(X2,X1)),inference(split_conjunct,[status(thm)],[97])).
% cnf(143,negated_conjecture,(~greater(vd486,vd488)),inference(split_conjunct,[status(thm)],[42])).
% cnf(152,plain,(~greater(X1,X1)),inference(er,[status(thm)],[44,theory(equality)])).
% cnf(155,plain,(~greater(X1,X2)|~greater(X2,X1)),inference(spm,[status(thm)],[87,85,theory(equality)])).
% cnf(184,plain,(greater(vmul(vd486,vd487),vmul(vd487,vd488))),inference(rw,[status(thm)],[45,98,theory(equality)])).
% cnf(210,plain,(greater(X1,X2)|X2=X1|greater(X2,X1)),inference(spm,[status(thm)],[82,89,theory(equality)])).
% cnf(237,plain,(greater(vmul(X2,X1),vmul(X3,X2))|~greater(X1,X3)),inference(spm,[status(thm)],[48,98,theory(equality)])).
% cnf(555,plain,(~greater(vmul(vd487,vd488),vmul(vd486,vd487))),inference(spm,[status(thm)],[155,184,theory(equality)])).
% cnf(1621,plain,(~greater(vd488,vd486)),inference(spm,[status(thm)],[555,237,theory(equality)])).
% cnf(1643,plain,(vd488=vd486|greater(vd486,vd488)),inference(spm,[status(thm)],[1621,210,theory(equality)])).
% cnf(1645,plain,(vd488=vd486),inference(sr,[status(thm)],[1643,143,theory(equality)])).
% cnf(1675,plain,(greater(vmul(vd486,vd487),vmul(vd486,vd487))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[184,1645,theory(equality)]),98,theory(equality)])).
% cnf(1676,plain,($false),inference(sr,[status(thm)],[1675,152,theory(equality)])).
% cnf(1677,plain,($false),1676,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 464
% # ...of these trivial : 8
% # ...subsumed : 295
% # ...remaining for further processing: 161
% # Other redundant clauses eliminated : 64
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 9
% # Backward-rewritten : 23
% # Generated clauses : 1277
% # ...of the previous two non-trivial : 1163
% # Contextual simplify-reflections : 24
% # Paramodulations : 1196
% # Factorizations : 2
% # Equation resolutions : 79
% # Current number of processed clauses: 125
% # Positive orientable unit clauses: 17
% # Positive unorientable unit clauses: 4
% # Negative unit clauses : 36
% # Non-unit-clauses : 68
% # Current number of unprocessed clauses: 661
% # ...number of literals in the above : 1352
% # Clause-clause subsumption calls (NU) : 1192
% # Rec. Clause-clause subsumption calls : 1098
% # Unit Clause-clause subsumption calls : 107
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 30
% # Indexed BW rewrite successes : 23
% # Backwards rewriting index: 73 leaves, 1.63+/-1.255 terms/leaf
% # Paramod-from index: 38 leaves, 1.26+/-0.497 terms/leaf
% # Paramod-into index: 69 leaves, 1.58+/-1.122 terms/leaf
% # -------------------------------------------------
% # User time : 0.050 s
% # System time : 0.002 s
% # Total time : 0.052 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.16 CPU 0.24 WC
% FINAL PrfWatch: 0.16 CPU 0.24 WC
% SZS output end Solution for /tmp/SystemOnTPTP20531/NUM853+2.tptp
%
%------------------------------------------------------------------------------