TSTP Solution File: NUM843+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM843+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 : 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:46:28 EST 2010
% Result : Theorem 0.95s
% Output : Solution 0.95s
% 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/SystemOnTPTP19494/NUM843+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP19494/NUM843+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP19494/NUM843+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 19590
% 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,~(leq(vd390,vd391)),file('/tmp/SRASS.s.p', 'holds(conjunct2(243), 393, 0)')).
% fof(20, axiom,![X13]:![X14]:((X13=X14|greater(X13,X14))|less(X13,X14)),file('/tmp/SRASS.s.p', 'ass(cond(goal(130), 0), 0)')).
% fof(45, axiom,![X77]:![X78]:(leq(X78,X77)<=>(less(X78,X77)|X78=X77)),file('/tmp/SRASS.s.p', 'def(cond(conseq(axiom(3)), 17), 1)')).
% fof(46, conjecture,greater(vd390,vd391),file('/tmp/SRASS.s.p', 'holds(244, 394, 0)')).
% fof(47, negated_conjecture,~(greater(vd390,vd391)),inference(assume_negation,[status(cth)],[46])).
% fof(48, plain,~(leq(vd390,vd391)),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(52, negated_conjecture,~(greater(vd390,vd391)),inference(fof_simplification,[status(thm)],[47,theory(equality)])).
% cnf(53,plain,(~leq(vd390,vd391)),inference(split_conjunct,[status(thm)],[48])).
% fof(108, plain,![X15]:![X16]:((X15=X16|greater(X15,X16))|less(X15,X16)),inference(variable_rename,[status(thm)],[20])).
% cnf(109,plain,(less(X1,X2)|greater(X1,X2)|X1=X2),inference(split_conjunct,[status(thm)],[108])).
% fof(185, plain,![X77]:![X78]:((~(leq(X78,X77))|(less(X78,X77)|X78=X77))&((~(less(X78,X77))&~(X78=X77))|leq(X78,X77))),inference(fof_nnf,[status(thm)],[45])).
% fof(186, plain,![X79]:![X80]:((~(leq(X80,X79))|(less(X80,X79)|X80=X79))&((~(less(X80,X79))&~(X80=X79))|leq(X80,X79))),inference(variable_rename,[status(thm)],[185])).
% fof(187, plain,![X79]:![X80]:((~(leq(X80,X79))|(less(X80,X79)|X80=X79))&((~(less(X80,X79))|leq(X80,X79))&(~(X80=X79)|leq(X80,X79)))),inference(distribute,[status(thm)],[186])).
% cnf(188,plain,(leq(X1,X2)|X1!=X2),inference(split_conjunct,[status(thm)],[187])).
% cnf(189,plain,(leq(X1,X2)|~less(X1,X2)),inference(split_conjunct,[status(thm)],[187])).
% cnf(191,negated_conjecture,(~greater(vd390,vd391)),inference(split_conjunct,[status(thm)],[52])).
% cnf(203,plain,(leq(X1,X1)),inference(er,[status(thm)],[188,theory(equality)])).
% cnf(218,plain,(~less(vd390,vd391)),inference(spm,[status(thm)],[53,189,theory(equality)])).
% cnf(492,plain,(vd390=vd391|greater(vd390,vd391)),inference(spm,[status(thm)],[218,109,theory(equality)])).
% cnf(494,plain,(vd391=vd390),inference(sr,[status(thm)],[492,191,theory(equality)])).
% cnf(497,plain,(~leq(vd390,vd390)),inference(rw,[status(thm)],[53,494,theory(equality)])).
% cnf(512,plain,($false),inference(rw,[status(thm)],[497,203,theory(equality)])).
% cnf(513,plain,($false),inference(cn,[status(thm)],[512,theory(equality)])).
% cnf(514,plain,($false),513,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 67
% # ...of these trivial : 2
% # ...subsumed : 7
% # ...remaining for further processing: 58
% # Other redundant clauses eliminated : 20
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 6
% # Generated clauses : 296
% # ...of the previous two non-trivial : 263
% # Contextual simplify-reflections : 0
% # Paramodulations : 270
% # Factorizations : 0
% # Equation resolutions : 26
% # Current number of processed clauses: 44
% # Positive orientable unit clauses: 5
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 7
% # Non-unit-clauses : 31
% # Current number of unprocessed clauses: 225
% # ...number of literals in the above : 634
% # Clause-clause subsumption calls (NU) : 47
% # Rec. Clause-clause subsumption calls : 43
% # Unit Clause-clause subsumption calls : 27
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 19
% # Indexed BW rewrite successes : 15
% # Backwards rewriting index: 28 leaves, 1.89+/-1.655 terms/leaf
% # Paramod-from index: 16 leaves, 1.19+/-0.390 terms/leaf
% # Paramod-into index: 26 leaves, 1.65+/-1.466 terms/leaf
% # -------------------------------------------------
% # User time : 0.019 s
% # System time : 0.005 s
% # Total time : 0.024 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.19 WC
% FINAL PrfWatch: 0.11 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP19494/NUM843+1.tptp
%
%------------------------------------------------------------------------------