TSTP Solution File: NUM835+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM835+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:44:35 EST 2010
% Result : Theorem 0.93s
% Output : Solution 0.93s
% 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/SystemOnTPTP14011/NUM835+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP14011/NUM835+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP14011/NUM835+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 14107
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(9, axiom,![X8]:![X9]:(m(X9)<=>((X8=X9|?[X10]:X8=vplus(X9,X10))|?[X11]:X9=vplus(X8,X11))),file('/tmp/SRASS.s.p', 'def(cond(conseq(105), 0), 1)')).
% fof(24, conjecture,((?[X6]:vd165=vplus(vd151,X6)|?[X7]:vd151=vplus(vd165,X7))|vd151=vd165),file('/tmp/SRASS.s.p', 'dis(case_distinction(conseq(110)))')).
% fof(25, negated_conjecture,~(((?[X6]:vd165=vplus(vd151,X6)|?[X7]:vd151=vplus(vd165,X7))|vd151=vd165)),inference(assume_negation,[status(cth)],[24])).
% fof(46, plain,![X8]:![X9]:((~(m(X9))|((X8=X9|?[X10]:X8=vplus(X9,X10))|?[X11]:X9=vplus(X8,X11)))&(((~(X8=X9)&![X10]:~(X8=vplus(X9,X10)))&![X11]:~(X9=vplus(X8,X11)))|m(X9))),inference(fof_nnf,[status(thm)],[9])).
% fof(47, plain,![X12]:![X13]:((~(m(X13))|((X12=X13|?[X14]:X12=vplus(X13,X14))|?[X15]:X13=vplus(X12,X15)))&(((~(X12=X13)&![X16]:~(X12=vplus(X13,X16)))&![X17]:~(X13=vplus(X12,X17)))|m(X13))),inference(variable_rename,[status(thm)],[46])).
% fof(48, plain,![X12]:![X13]:((~(m(X13))|((X12=X13|X12=vplus(X13,esk1_2(X12,X13)))|X13=vplus(X12,esk2_2(X12,X13))))&(((~(X12=X13)&![X16]:~(X12=vplus(X13,X16)))&![X17]:~(X13=vplus(X12,X17)))|m(X13))),inference(skolemize,[status(esa)],[47])).
% fof(49, plain,![X12]:![X13]:![X16]:![X17]:(((~(X13=vplus(X12,X17))&(~(X12=vplus(X13,X16))&~(X12=X13)))|m(X13))&(~(m(X13))|((X12=X13|X12=vplus(X13,esk1_2(X12,X13)))|X13=vplus(X12,esk2_2(X12,X13))))),inference(shift_quantors,[status(thm)],[48])).
% fof(50, plain,![X12]:![X13]:![X16]:![X17]:(((~(X13=vplus(X12,X17))|m(X13))&((~(X12=vplus(X13,X16))|m(X13))&(~(X12=X13)|m(X13))))&(~(m(X13))|((X12=X13|X12=vplus(X13,esk1_2(X12,X13)))|X13=vplus(X12,esk2_2(X12,X13))))),inference(distribute,[status(thm)],[49])).
% cnf(51,plain,(X1=vplus(X2,esk2_2(X2,X1))|X2=vplus(X1,esk1_2(X2,X1))|X2=X1|~m(X1)),inference(split_conjunct,[status(thm)],[50])).
% cnf(52,plain,(m(X1)|X2!=X1),inference(split_conjunct,[status(thm)],[50])).
% fof(93, negated_conjecture,((![X6]:~(vd165=vplus(vd151,X6))&![X7]:~(vd151=vplus(vd165,X7)))&~(vd151=vd165)),inference(fof_nnf,[status(thm)],[25])).
% fof(94, negated_conjecture,((![X8]:~(vd165=vplus(vd151,X8))&![X9]:~(vd151=vplus(vd165,X9)))&~(vd151=vd165)),inference(variable_rename,[status(thm)],[93])).
% fof(95, negated_conjecture,![X8]:![X9]:((~(vd151=vplus(vd165,X9))&~(vd165=vplus(vd151,X8)))&~(vd151=vd165)),inference(shift_quantors,[status(thm)],[94])).
% cnf(96,negated_conjecture,(vd151!=vd165),inference(split_conjunct,[status(thm)],[95])).
% cnf(97,negated_conjecture,(vd165!=vplus(vd151,X1)),inference(split_conjunct,[status(thm)],[95])).
% cnf(98,negated_conjecture,(vd151!=vplus(vd165,X1)),inference(split_conjunct,[status(thm)],[95])).
% cnf(124,plain,(m(X1)),inference(er,[status(thm)],[52,theory(equality)])).
% cnf(190,plain,(vplus(X1,esk1_2(X2,X1))=X2|vplus(X2,esk2_2(X2,X1))=X1|X1=X2|$false),inference(rw,[status(thm)],[51,124,theory(equality)])).
% cnf(191,plain,(vplus(X1,esk1_2(X2,X1))=X2|vplus(X2,esk2_2(X2,X1))=X1|X1=X2),inference(cn,[status(thm)],[190,theory(equality)])).
% cnf(460,negated_conjecture,(vplus(X1,esk2_2(X1,vd151))=vd151|vd151=X1|X1!=vd165),inference(spm,[status(thm)],[97,191,theory(equality)])).
% cnf(1458,negated_conjecture,(vd151=vd165),inference(spm,[status(thm)],[98,460,theory(equality)])).
% cnf(1473,negated_conjecture,($false),inference(sr,[status(thm)],[1458,96,theory(equality)])).
% cnf(1474,negated_conjecture,($false),1473,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 487
% # ...of these trivial : 15
% # ...subsumed : 420
% # ...remaining for further processing: 52
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 3
% # Generated clauses : 980
% # ...of the previous two non-trivial : 961
% # Contextual simplify-reflections : 0
% # Paramodulations : 975
% # Factorizations : 0
% # Equation resolutions : 5
% # Current number of processed clauses: 46
% # Positive orientable unit clauses: 2
% # Positive unorientable unit clauses: 4
% # Negative unit clauses : 29
% # Non-unit-clauses : 11
% # Current number of unprocessed clauses: 483
% # ...number of literals in the above : 760
% # Clause-clause subsumption calls (NU) : 117
% # Rec. Clause-clause subsumption calls : 117
% # Unit Clause-clause subsumption calls : 52
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 144
% # Indexed BW rewrite successes : 144
% # Backwards rewriting index: 35 leaves, 2.77+/-4.106 terms/leaf
% # Paramod-from index: 10 leaves, 1.40+/-0.917 terms/leaf
% # Paramod-into index: 34 leaves, 2.82+/-4.155 terms/leaf
% # -------------------------------------------------
% # User time : 0.034 s
% # System time : 0.005 s
% # Total time : 0.039 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/SystemOnTPTP14011/NUM835+2.tptp
%
%------------------------------------------------------------------------------