TSTP Solution File: NUM853+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM853+1 : TPTP v5.0.0. Released v4.1.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Wed Dec 29 20:53:33 EST 2010
% Result : Theorem 1.28s
% Output : Solution 1.28s
% 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/SystemOnTPTP27084/NUM853+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP27084/NUM853+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP27084/NUM853+1.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 27216
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.017 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(8, axiom,![X18]:![X19]:(less(X18,X19)=>greater(X19,X18)),file('/tmp/SRASS.s.p', 'ass(cond(147, 0), 0)')).
% fof(9, axiom,![X20]:![X21]:(greater(X20,X21)=>less(X21,X20)),file('/tmp/SRASS.s.p', 'ass(cond(140, 0), 0)')).
% fof(10, axiom,![X1]:![X2]:(~(greater(X1,X2))|~(less(X1,X2))),file('/tmp/SRASS.s.p', 'ass(cond(goal(130), 0), 2)')).
% fof(11, axiom,![X22]:![X23]:![X24]:(greater(X23,X24)=>greater(vmul(X23,X22),vmul(X24,X22))),file('/tmp/SRASS.s.p', 'ass(cond(299, 0), 2)')).
% fof(15, axiom,![X33]:![X34]:vmul(X33,X34)=vmul(X34,X33),file('/tmp/SRASS.s.p', 'ass(cond(270, 0), 0)')).
% fof(24, axiom,![X1]:![X2]:((X1=X2|greater(X1,X2))|less(X1,X2)),file('/tmp/SRASS.s.p', 'ass(cond(goal(130), 0), 0)')).
% fof(55, conjecture,greater(vd486,vd488),file('/tmp/SRASS.s.p', 'holds(conseq(307), 490, 0)')).
% fof(56, negated_conjecture,~(greater(vd486,vd488)),inference(assume_negation,[status(cth)],[55])).
% fof(57, plain,![X1]:![X2]:(~(X1=X2)|~(greater(X1,X2))),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(58, plain,![X1]:![X2]:(~(greater(X1,X2))|~(less(X1,X2))),inference(fof_simplification,[status(thm)],[10,theory(equality)])).
% fof(60, negated_conjecture,~(greater(vd486,vd488)),inference(fof_simplification,[status(thm)],[56,theory(equality)])).
% fof(61, plain,![X3]:![X4]:(~(X3=X4)|~(greater(X3,X4))),inference(variable_rename,[status(thm)],[57])).
% cnf(62,plain,(~greater(X1,X2)|X1!=X2),inference(split_conjunct,[status(thm)],[61])).
% cnf(63,plain,(greater(vmul(vd486,vd487),vmul(vd488,vd487))),inference(split_conjunct,[status(thm)],[2])).
% fof(78, plain,![X18]:![X19]:(~(less(X18,X19))|greater(X19,X18)),inference(fof_nnf,[status(thm)],[8])).
% fof(79, plain,![X20]:![X21]:(~(less(X20,X21))|greater(X21,X20)),inference(variable_rename,[status(thm)],[78])).
% cnf(80,plain,(greater(X1,X2)|~less(X2,X1)),inference(split_conjunct,[status(thm)],[79])).
% fof(81, plain,![X20]:![X21]:(~(greater(X20,X21))|less(X21,X20)),inference(fof_nnf,[status(thm)],[9])).
% fof(82, plain,![X22]:![X23]:(~(greater(X22,X23))|less(X23,X22)),inference(variable_rename,[status(thm)],[81])).
% cnf(83,plain,(less(X1,X2)|~greater(X2,X1)),inference(split_conjunct,[status(thm)],[82])).
% fof(84, plain,![X3]:![X4]:(~(greater(X3,X4))|~(less(X3,X4))),inference(variable_rename,[status(thm)],[58])).
% cnf(85,plain,(~less(X1,X2)|~greater(X1,X2)),inference(split_conjunct,[status(thm)],[84])).
% fof(86, plain,![X22]:![X23]:![X24]:(~(greater(X23,X24))|greater(vmul(X23,X22),vmul(X24,X22))),inference(fof_nnf,[status(thm)],[11])).
% fof(87, plain,![X25]:![X26]:![X27]:(~(greater(X26,X27))|greater(vmul(X26,X25),vmul(X27,X25))),inference(variable_rename,[status(thm)],[86])).
% cnf(88,plain,(greater(vmul(X1,X2),vmul(X3,X2))|~greater(X1,X3)),inference(split_conjunct,[status(thm)],[87])).
% fof(100, plain,![X35]:![X36]:vmul(X35,X36)=vmul(X36,X35),inference(variable_rename,[status(thm)],[15])).
% cnf(101,plain,(vmul(X1,X2)=vmul(X2,X1)),inference(split_conjunct,[status(thm)],[100])).
% fof(124, plain,![X3]:![X4]:((X3=X4|greater(X3,X4))|less(X3,X4)),inference(variable_rename,[status(thm)],[24])).
% cnf(125,plain,(less(X1,X2)|greater(X1,X2)|X1=X2),inference(split_conjunct,[status(thm)],[124])).
% cnf(223,negated_conjecture,(~greater(vd486,vd488)),inference(split_conjunct,[status(thm)],[60])).
% cnf(234,plain,(~greater(X1,X1)),inference(er,[status(thm)],[62,theory(equality)])).
% cnf(240,plain,(~greater(X1,X2)|~greater(X2,X1)),inference(spm,[status(thm)],[85,83,theory(equality)])).
% cnf(263,plain,(greater(vmul(vd486,vd487),vmul(vd487,vd488))),inference(rw,[status(thm)],[63,101,theory(equality)])).
% cnf(329,plain,(greater(X1,X2)|X2=X1|greater(X2,X1)),inference(spm,[status(thm)],[80,125,theory(equality)])).
% cnf(350,plain,(greater(vmul(X2,X1),vmul(X3,X2))|~greater(X1,X3)),inference(spm,[status(thm)],[88,101,theory(equality)])).
% cnf(808,plain,(~greater(vmul(vd487,vd488),vmul(vd486,vd487))),inference(spm,[status(thm)],[240,263,theory(equality)])).
% cnf(2418,plain,(~greater(vd488,vd486)),inference(spm,[status(thm)],[808,350,theory(equality)])).
% cnf(2441,plain,(vd488=vd486|greater(vd486,vd488)),inference(spm,[status(thm)],[2418,329,theory(equality)])).
% cnf(2443,plain,(vd488=vd486),inference(sr,[status(thm)],[2441,223,theory(equality)])).
% cnf(2489,plain,(greater(vmul(vd486,vd487),vmul(vd486,vd487))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[263,2443,theory(equality)]),101,theory(equality)])).
% cnf(2490,plain,($false),inference(sr,[status(thm)],[2489,234,theory(equality)])).
% cnf(2491,plain,($false),2490,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 688
% # ...of these trivial : 6
% # ...subsumed : 459
% # ...remaining for further processing: 223
% # Other redundant clauses eliminated : 58
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 7
% # Backward-rewritten : 35
% # Generated clauses : 1896
% # ...of the previous two non-trivial : 1781
% # Contextual simplify-reflections : 24
% # Paramodulations : 1822
% # Factorizations : 2
% # Equation resolutions : 72
% # Current number of processed clauses: 175
% # Positive orientable unit clauses: 17
% # Positive unorientable unit clauses: 4
% # Negative unit clauses : 47
% # Non-unit-clauses : 107
% # Current number of unprocessed clauses: 1067
% # ...number of literals in the above : 2459
% # Clause-clause subsumption calls (NU) : 2024
% # Rec. Clause-clause subsumption calls : 1826
% # Unit Clause-clause subsumption calls : 219
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 44
% # Indexed BW rewrite successes : 20
% # Backwards rewriting index: 86 leaves, 1.79+/-1.432 terms/leaf
% # Paramod-from index: 40 leaves, 1.30+/-0.510 terms/leaf
% # Paramod-into index: 83 leaves, 1.70+/-1.268 terms/leaf
% # -------------------------------------------------
% # User time : 0.067 s
% # System time : 0.005 s
% # Total time : 0.072 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.18 CPU 0.25 WC
% FINAL PrfWatch: 0.18 CPU 0.25 WC
% SZS output end Solution for /tmp/SystemOnTPTP27084/NUM853+1.tptp
%
%------------------------------------------------------------------------------