TSTP Solution File: NUM840+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM840+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 : 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:45:44 EST 2010
% Result : Theorem 0.99s
% Output : Solution 0.99s
% 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/SystemOnTPTP15047/NUM840+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP15047/NUM840+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP15047/NUM840+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 15143
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X4]:![X5]:(~(X4=X5)|~(less(X4,X5))),file('/tmp/SRASS.s.p', 'ass(cond(goal(130), 0), 1)')).
% fof(3, axiom,less(vplus(vd328,vd330),vplus(vd329,vd330)),file('/tmp/SRASS.s.p', 'holds(antec(conjunct2(conjunct2(204))), 335, 0)')).
% fof(4, axiom,![X6]:![X7]:![X8]:(less(X6,X7)=>less(vplus(X6,X8),vplus(X7,X8))),file('/tmp/SRASS.s.p', 'ass(cond(goal(193), 0), 0)')).
% fof(7, axiom,![X12]:![X13]:(less(X12,X13)=>greater(X13,X12)),file('/tmp/SRASS.s.p', 'ass(cond(147, 0), 0)')).
% fof(8, axiom,![X14]:![X15]:(greater(X14,X15)=>less(X15,X14)),file('/tmp/SRASS.s.p', 'ass(cond(140, 0), 0)')).
% fof(9, axiom,![X4]:![X5]:(~(greater(X4,X5))|~(less(X4,X5))),file('/tmp/SRASS.s.p', 'ass(cond(goal(130), 0), 2)')).
% fof(13, axiom,![X4]:![X5]:((X4=X5|greater(X4,X5))|less(X4,X5)),file('/tmp/SRASS.s.p', 'ass(cond(goal(130), 0), 0)')).
% fof(28, axiom,![X40]:![X41]:vplus(X41,X40)=vplus(X40,X41),file('/tmp/SRASS.s.p', 'ass(cond(61, 0), 0)')).
% fof(39, conjecture,less(vd328,vd329),file('/tmp/SRASS.s.p', 'holds(conseq(conjunct2(conjunct2(204))), 336, 0)')).
% fof(40, negated_conjecture,~(less(vd328,vd329)),inference(assume_negation,[status(cth)],[39])).
% fof(41, plain,![X4]:![X5]:(~(X4=X5)|~(less(X4,X5))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(42, plain,![X4]:![X5]:(~(greater(X4,X5))|~(less(X4,X5))),inference(fof_simplification,[status(thm)],[9,theory(equality)])).
% fof(44, negated_conjecture,~(less(vd328,vd329)),inference(fof_simplification,[status(thm)],[40,theory(equality)])).
% fof(48, plain,![X6]:![X7]:(~(X6=X7)|~(less(X6,X7))),inference(variable_rename,[status(thm)],[41])).
% cnf(49,plain,(~less(X1,X2)|X1!=X2),inference(split_conjunct,[status(thm)],[48])).
% cnf(50,plain,(less(vplus(vd328,vd330),vplus(vd329,vd330))),inference(split_conjunct,[status(thm)],[3])).
% fof(51, plain,![X6]:![X7]:![X8]:(~(less(X6,X7))|less(vplus(X6,X8),vplus(X7,X8))),inference(fof_nnf,[status(thm)],[4])).
% fof(52, plain,![X9]:![X10]:![X11]:(~(less(X9,X10))|less(vplus(X9,X11),vplus(X10,X11))),inference(variable_rename,[status(thm)],[51])).
% cnf(53,plain,(less(vplus(X1,X2),vplus(X3,X2))|~less(X1,X3)),inference(split_conjunct,[status(thm)],[52])).
% fof(59, plain,![X12]:![X13]:(~(less(X12,X13))|greater(X13,X12)),inference(fof_nnf,[status(thm)],[7])).
% fof(60, plain,![X14]:![X15]:(~(less(X14,X15))|greater(X15,X14)),inference(variable_rename,[status(thm)],[59])).
% cnf(61,plain,(greater(X1,X2)|~less(X2,X1)),inference(split_conjunct,[status(thm)],[60])).
% fof(62, plain,![X14]:![X15]:(~(greater(X14,X15))|less(X15,X14)),inference(fof_nnf,[status(thm)],[8])).
% fof(63, plain,![X16]:![X17]:(~(greater(X16,X17))|less(X17,X16)),inference(variable_rename,[status(thm)],[62])).
% cnf(64,plain,(less(X1,X2)|~greater(X2,X1)),inference(split_conjunct,[status(thm)],[63])).
% fof(65, plain,![X6]:![X7]:(~(greater(X6,X7))|~(less(X6,X7))),inference(variable_rename,[status(thm)],[42])).
% cnf(66,plain,(~less(X1,X2)|~greater(X1,X2)),inference(split_conjunct,[status(thm)],[65])).
% fof(80, plain,![X6]:![X7]:((X6=X7|greater(X6,X7))|less(X6,X7)),inference(variable_rename,[status(thm)],[13])).
% cnf(81,plain,(less(X1,X2)|greater(X1,X2)|X1=X2),inference(split_conjunct,[status(thm)],[80])).
% fof(127, plain,![X42]:![X43]:vplus(X43,X42)=vplus(X42,X43),inference(variable_rename,[status(thm)],[28])).
% cnf(128,plain,(vplus(X1,X2)=vplus(X2,X1)),inference(split_conjunct,[status(thm)],[127])).
% cnf(161,negated_conjecture,(~less(vd328,vd329)),inference(split_conjunct,[status(thm)],[44])).
% cnf(170,plain,(~less(X1,X1)),inference(er,[status(thm)],[49,theory(equality)])).
% cnf(179,plain,(~less(X1,X2)|~less(X2,X1)),inference(spm,[status(thm)],[66,61,theory(equality)])).
% cnf(213,plain,(less(vplus(vd328,vd330),vplus(vd330,vd329))),inference(rw,[status(thm)],[50,128,theory(equality)])).
% cnf(220,plain,(less(X1,X2)|X2=X1|less(X2,X1)),inference(spm,[status(thm)],[64,81,theory(equality)])).
% cnf(255,plain,(less(vplus(X2,X1),vplus(X3,X2))|~less(X1,X3)),inference(spm,[status(thm)],[53,128,theory(equality)])).
% cnf(398,plain,(~less(vplus(vd330,vd329),vplus(vd328,vd330))),inference(spm,[status(thm)],[179,213,theory(equality)])).
% cnf(1522,plain,(~less(vd329,vd328)),inference(spm,[status(thm)],[398,255,theory(equality)])).
% cnf(1546,plain,(vd329=vd328|less(vd328,vd329)),inference(spm,[status(thm)],[1522,220,theory(equality)])).
% cnf(1548,plain,(vd329=vd328),inference(sr,[status(thm)],[1546,161,theory(equality)])).
% cnf(1628,plain,(less(vplus(vd328,vd330),vplus(vd328,vd330))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[213,1548,theory(equality)]),128,theory(equality)])).
% cnf(1629,plain,($false),inference(sr,[status(thm)],[1628,170,theory(equality)])).
% cnf(1630,plain,($false),1629,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 492
% # ...of these trivial : 6
% # ...subsumed : 308
% # ...remaining for further processing: 178
% # Other redundant clauses eliminated : 54
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 15
% # Backward-rewritten : 63
% # Generated clauses : 1205
% # ...of the previous two non-trivial : 1130
% # Contextual simplify-reflections : 45
% # Paramodulations : 1135
% # Factorizations : 3
% # Equation resolutions : 67
% # Current number of processed clauses: 94
% # Positive orientable unit clauses: 10
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 23
% # Non-unit-clauses : 60
% # Current number of unprocessed clauses: 426
% # ...number of literals in the above : 1071
% # Clause-clause subsumption calls (NU) : 2024
% # Rec. Clause-clause subsumption calls : 1893
% # Unit Clause-clause subsumption calls : 161
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 28
% # Indexed BW rewrite successes : 15
% # Backwards rewriting index: 43 leaves, 1.93+/-1.704 terms/leaf
% # Paramod-from index: 23 leaves, 1.39+/-0.570 terms/leaf
% # Paramod-into index: 41 leaves, 1.80+/-1.329 terms/leaf
% # -------------------------------------------------
% # User time : 0.056 s
% # System time : 0.006 s
% # Total time : 0.062 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.15 CPU 0.24 WC
% FINAL PrfWatch: 0.15 CPU 0.24 WC
% SZS output end Solution for /tmp/SystemOnTPTP15047/NUM840+1.tptp
%
%------------------------------------------------------------------------------