TSTP Solution File: NUM857+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM857+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:50:02 EST 2010
% Result : Theorem 1.01s
% Output : Solution 1.01s
% 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/SystemOnTPTP17637/NUM857+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP17637/NUM857+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP17637/NUM857+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 17733
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,geq(vd529,vd530),file('/tmp/SRASS.s.p', 'holds(conjunct2(antec(323)), 531, 0)')).
% fof(2, axiom,geq(vd526,vd527),file('/tmp/SRASS.s.p', 'holds(conjunct1(antec(323)), 528, 0)')).
% fof(3, axiom,![X1]:![X2]:![X3]:![X4]:(((greater(X3,X4)&geq(X1,X2))|(geq(X3,X4)&greater(X1,X2)))=>greater(vmul(X1,X3),vmul(X2,X4))),file('/tmp/SRASS.s.p', 'ass(cond(318, 0), 0)')).
% fof(7, axiom,![X14]:![X15]:vmul(X14,X15)=vmul(X15,X14),file('/tmp/SRASS.s.p', 'ass(cond(270, 0), 0)')).
% fof(20, axiom,![X48]:![X49]:(geq(X49,X48)<=>(greater(X49,X48)|X49=X48)),file('/tmp/SRASS.s.p', 'def(cond(conseq(axiom(3)), 16), 1)')).
% fof(61, conjecture,geq(vmul(vd526,vd529),vmul(vd527,vd530)),file('/tmp/SRASS.s.p', 'holds(conseq(323), 532, 0)')).
% fof(62, negated_conjecture,~(geq(vmul(vd526,vd529),vmul(vd527,vd530))),inference(assume_negation,[status(cth)],[61])).
% fof(66, negated_conjecture,~(geq(vmul(vd526,vd529),vmul(vd527,vd530))),inference(fof_simplification,[status(thm)],[62,theory(equality)])).
% cnf(67,plain,(geq(vd529,vd530)),inference(split_conjunct,[status(thm)],[1])).
% cnf(68,plain,(geq(vd526,vd527)),inference(split_conjunct,[status(thm)],[2])).
% fof(69, plain,![X1]:![X2]:![X3]:![X4]:(((~(greater(X3,X4))|~(geq(X1,X2)))&(~(geq(X3,X4))|~(greater(X1,X2))))|greater(vmul(X1,X3),vmul(X2,X4))),inference(fof_nnf,[status(thm)],[3])).
% fof(70, plain,![X5]:![X6]:![X7]:![X8]:(((~(greater(X7,X8))|~(geq(X5,X6)))&(~(geq(X7,X8))|~(greater(X5,X6))))|greater(vmul(X5,X7),vmul(X6,X8))),inference(variable_rename,[status(thm)],[69])).
% fof(71, plain,![X5]:![X6]:![X7]:![X8]:(((~(greater(X7,X8))|~(geq(X5,X6)))|greater(vmul(X5,X7),vmul(X6,X8)))&((~(geq(X7,X8))|~(greater(X5,X6)))|greater(vmul(X5,X7),vmul(X6,X8)))),inference(distribute,[status(thm)],[70])).
% cnf(72,plain,(greater(vmul(X1,X2),vmul(X3,X4))|~greater(X1,X3)|~geq(X2,X4)),inference(split_conjunct,[status(thm)],[71])).
% cnf(73,plain,(greater(vmul(X1,X2),vmul(X3,X4))|~geq(X1,X3)|~greater(X2,X4)),inference(split_conjunct,[status(thm)],[71])).
% fof(82, plain,![X16]:![X17]:vmul(X16,X17)=vmul(X17,X16),inference(variable_rename,[status(thm)],[7])).
% cnf(83,plain,(vmul(X1,X2)=vmul(X2,X1)),inference(split_conjunct,[status(thm)],[82])).
% fof(118, plain,![X48]:![X49]:((~(geq(X49,X48))|(greater(X49,X48)|X49=X48))&((~(greater(X49,X48))&~(X49=X48))|geq(X49,X48))),inference(fof_nnf,[status(thm)],[20])).
% fof(119, plain,![X50]:![X51]:((~(geq(X51,X50))|(greater(X51,X50)|X51=X50))&((~(greater(X51,X50))&~(X51=X50))|geq(X51,X50))),inference(variable_rename,[status(thm)],[118])).
% fof(120, plain,![X50]:![X51]:((~(geq(X51,X50))|(greater(X51,X50)|X51=X50))&((~(greater(X51,X50))|geq(X51,X50))&(~(X51=X50)|geq(X51,X50)))),inference(distribute,[status(thm)],[119])).
% cnf(121,plain,(geq(X1,X2)|X1!=X2),inference(split_conjunct,[status(thm)],[120])).
% cnf(122,plain,(geq(X1,X2)|~greater(X1,X2)),inference(split_conjunct,[status(thm)],[120])).
% cnf(123,plain,(X1=X2|greater(X1,X2)|~geq(X1,X2)),inference(split_conjunct,[status(thm)],[120])).
% cnf(247,negated_conjecture,(~geq(vmul(vd526,vd529),vmul(vd527,vd530))),inference(split_conjunct,[status(thm)],[66])).
% cnf(259,plain,(geq(X1,X1)),inference(er,[status(thm)],[121,theory(equality)])).
% cnf(264,negated_conjecture,(~geq(vmul(vd529,vd526),vmul(vd530,vd527))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[247,83,theory(equality)]),83,theory(equality)])).
% cnf(355,plain,(vd526=vd527|greater(vd526,vd527)),inference(spm,[status(thm)],[123,68,theory(equality)])).
% cnf(356,plain,(vd529=vd530|greater(vd529,vd530)),inference(spm,[status(thm)],[123,67,theory(equality)])).
% cnf(853,negated_conjecture,(~greater(vmul(vd529,vd526),vmul(vd530,vd527))),inference(spm,[status(thm)],[264,122,theory(equality)])).
% cnf(854,negated_conjecture,(~greater(vd529,vd530)|~geq(vd526,vd527)),inference(spm,[status(thm)],[853,72,theory(equality)])).
% cnf(857,negated_conjecture,(~greater(vd529,vd530)|$false),inference(rw,[status(thm)],[854,68,theory(equality)])).
% cnf(858,negated_conjecture,(~greater(vd529,vd530)),inference(cn,[status(thm)],[857,theory(equality)])).
% cnf(861,plain,(vd530=vd529),inference(sr,[status(thm)],[356,858,theory(equality)])).
% cnf(863,negated_conjecture,(~greater(vmul(vd529,vd526),vmul(vd529,vd527))),inference(rw,[status(thm)],[853,861,theory(equality)])).
% cnf(864,negated_conjecture,(~geq(vmul(vd529,vd526),vmul(vd529,vd527))),inference(rw,[status(thm)],[264,861,theory(equality)])).
% cnf(865,plain,(geq(vd529,vd529)),inference(rw,[status(thm)],[67,861,theory(equality)])).
% cnf(868,negated_conjecture,(~greater(vd526,vd527)|~geq(vd529,vd529)),inference(spm,[status(thm)],[863,73,theory(equality)])).
% cnf(872,negated_conjecture,(~greater(vd526,vd527)|$false),inference(rw,[status(thm)],[868,865,theory(equality)])).
% cnf(873,negated_conjecture,(~greater(vd526,vd527)),inference(cn,[status(thm)],[872,theory(equality)])).
% cnf(874,plain,(vd527=vd526),inference(sr,[status(thm)],[355,873,theory(equality)])).
% cnf(877,negated_conjecture,(~geq(vmul(vd529,vd526),vmul(vd529,vd526))),inference(rw,[status(thm)],[864,874,theory(equality)])).
% cnf(881,negated_conjecture,($false),inference(rw,[status(thm)],[877,259,theory(equality)])).
% cnf(882,negated_conjecture,($false),inference(cn,[status(thm)],[881,theory(equality)])).
% cnf(883,negated_conjecture,($false),882,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 86
% # ...of these trivial : 3
% # ...subsumed : 3
% # ...remaining for further processing: 80
% # Other redundant clauses eliminated : 18
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 11
% # Generated clauses : 552
% # ...of the previous two non-trivial : 503
% # Contextual simplify-reflections : 0
% # Paramodulations : 525
% # Factorizations : 0
% # Equation resolutions : 25
% # Current number of processed clauses: 58
% # Positive orientable unit clauses: 10
% # Positive unorientable unit clauses: 4
% # Negative unit clauses : 4
% # Non-unit-clauses : 40
% # Current number of unprocessed clauses: 468
% # ...number of literals in the above : 1133
% # Clause-clause subsumption calls (NU) : 63
% # Rec. Clause-clause subsumption calls : 59
% # Unit Clause-clause subsumption calls : 26
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 27
% # Indexed BW rewrite successes : 19
% # Backwards rewriting index: 41 leaves, 1.80+/-1.534 terms/leaf
% # Paramod-from index: 27 leaves, 1.22+/-0.416 terms/leaf
% # Paramod-into index: 34 leaves, 1.74+/-1.421 terms/leaf
% # -------------------------------------------------
% # User time : 0.024 s
% # System time : 0.006 s
% # Total time : 0.030 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.21 WC
% FINAL PrfWatch: 0.12 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP17637/NUM857+2.tptp
%
%------------------------------------------------------------------------------