TSTP Solution File: NUM835+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM835+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 : art03.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:29 EST 2010
% Result : Theorem 1.05s
% Output : Solution 1.05s
% 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/SystemOnTPTP20816/NUM835+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP20816/NUM835+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP20816/NUM835+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 20912
% 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(21, axiom,![X25]:![X26]:(m(X26)<=>((X25=X26|?[X27]:X25=vplus(X26,X27))|?[X28]:X26=vplus(X25,X28))),file('/tmp/SRASS.s.p', 'def(cond(conseq(105), 0), 1)')).
% fof(39, conjecture,((?[X23]:vd165=vplus(vd151,X23)|?[X24]:vd151=vplus(vd165,X24))|vd151=vd165),file('/tmp/SRASS.s.p', 'dis(case_distinction(conseq(110)))')).
% fof(40, negated_conjecture,~(((?[X23]:vd165=vplus(vd151,X23)|?[X24]:vd151=vplus(vd165,X24))|vd151=vd165)),inference(assume_negation,[status(cth)],[39])).
% fof(100, plain,![X25]:![X26]:((~(m(X26))|((X25=X26|?[X27]:X25=vplus(X26,X27))|?[X28]:X26=vplus(X25,X28)))&(((~(X25=X26)&![X27]:~(X25=vplus(X26,X27)))&![X28]:~(X26=vplus(X25,X28)))|m(X26))),inference(fof_nnf,[status(thm)],[21])).
% fof(101, plain,![X29]:![X30]:((~(m(X30))|((X29=X30|?[X31]:X29=vplus(X30,X31))|?[X32]:X30=vplus(X29,X32)))&(((~(X29=X30)&![X33]:~(X29=vplus(X30,X33)))&![X34]:~(X30=vplus(X29,X34)))|m(X30))),inference(variable_rename,[status(thm)],[100])).
% fof(102, plain,![X29]:![X30]:((~(m(X30))|((X29=X30|X29=vplus(X30,esk1_2(X29,X30)))|X30=vplus(X29,esk2_2(X29,X30))))&(((~(X29=X30)&![X33]:~(X29=vplus(X30,X33)))&![X34]:~(X30=vplus(X29,X34)))|m(X30))),inference(skolemize,[status(esa)],[101])).
% fof(103, plain,![X29]:![X30]:![X33]:![X34]:(((~(X30=vplus(X29,X34))&(~(X29=vplus(X30,X33))&~(X29=X30)))|m(X30))&(~(m(X30))|((X29=X30|X29=vplus(X30,esk1_2(X29,X30)))|X30=vplus(X29,esk2_2(X29,X30))))),inference(shift_quantors,[status(thm)],[102])).
% fof(104, plain,![X29]:![X30]:![X33]:![X34]:(((~(X30=vplus(X29,X34))|m(X30))&((~(X29=vplus(X30,X33))|m(X30))&(~(X29=X30)|m(X30))))&(~(m(X30))|((X29=X30|X29=vplus(X30,esk1_2(X29,X30)))|X30=vplus(X29,esk2_2(X29,X30))))),inference(distribute,[status(thm)],[103])).
% cnf(105,plain,(X1=vplus(X2,esk2_2(X2,X1))|X2=vplus(X1,esk1_2(X2,X1))|X2=X1|~m(X1)),inference(split_conjunct,[status(thm)],[104])).
% cnf(106,plain,(m(X1)|X2!=X1),inference(split_conjunct,[status(thm)],[104])).
% fof(158, negated_conjecture,((![X23]:~(vd165=vplus(vd151,X23))&![X24]:~(vd151=vplus(vd165,X24)))&~(vd151=vd165)),inference(fof_nnf,[status(thm)],[40])).
% fof(159, negated_conjecture,((![X25]:~(vd165=vplus(vd151,X25))&![X26]:~(vd151=vplus(vd165,X26)))&~(vd151=vd165)),inference(variable_rename,[status(thm)],[158])).
% fof(160, negated_conjecture,![X25]:![X26]:((~(vd151=vplus(vd165,X26))&~(vd165=vplus(vd151,X25)))&~(vd151=vd165)),inference(shift_quantors,[status(thm)],[159])).
% cnf(161,negated_conjecture,(vd151!=vd165),inference(split_conjunct,[status(thm)],[160])).
% cnf(162,negated_conjecture,(vd165!=vplus(vd151,X1)),inference(split_conjunct,[status(thm)],[160])).
% cnf(163,negated_conjecture,(vd151!=vplus(vd165,X1)),inference(split_conjunct,[status(thm)],[160])).
% cnf(203,plain,(m(X1)),inference(er,[status(thm)],[106,theory(equality)])).
% cnf(314,plain,(vplus(X1,esk1_2(X2,X1))=X2|vplus(X2,esk2_2(X2,X1))=X1|X1=X2|$false),inference(rw,[status(thm)],[105,203,theory(equality)])).
% cnf(315,plain,(vplus(X1,esk1_2(X2,X1))=X2|vplus(X2,esk2_2(X2,X1))=X1|X1=X2),inference(cn,[status(thm)],[314,theory(equality)])).
% cnf(1940,negated_conjecture,(vplus(X1,esk2_2(X1,vd151))=vd151|vd151=X1|X1!=vd165),inference(spm,[status(thm)],[162,315,theory(equality)])).
% cnf(3352,negated_conjecture,(vd151=vd165),inference(spm,[status(thm)],[163,1940,theory(equality)])).
% cnf(3417,negated_conjecture,($false),inference(sr,[status(thm)],[3352,161,theory(equality)])).
% cnf(3418,negated_conjecture,($false),3417,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1075
% # ...of these trivial : 8
% # ...subsumed : 925
% # ...remaining for further processing: 142
% # Other redundant clauses eliminated : 15
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 11
% # Backward-rewritten : 5
% # Generated clauses : 2519
% # ...of the previous two non-trivial : 2406
% # Contextual simplify-reflections : 23
% # Paramodulations : 2487
% # Factorizations : 0
% # Equation resolutions : 32
% # Current number of processed clauses: 121
% # Positive orientable unit clauses: 6
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 66
% # Non-unit-clauses : 46
% # Current number of unprocessed clauses: 1312
% # ...number of literals in the above : 2866
% # Clause-clause subsumption calls (NU) : 1993
% # Rec. Clause-clause subsumption calls : 1953
% # Unit Clause-clause subsumption calls : 433
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 225
% # Indexed BW rewrite successes : 224
% # Backwards rewriting index: 43 leaves, 3.26+/-5.243 terms/leaf
% # Paramod-from index: 17 leaves, 1.24+/-0.546 terms/leaf
% # Paramod-into index: 42 leaves, 3.14+/-5.074 terms/leaf
% # -------------------------------------------------
% # User time : 0.083 s
% # System time : 0.003 s
% # Total time : 0.086 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.21 CPU 0.29 WC
% FINAL PrfWatch: 0.21 CPU 0.29 WC
% SZS output end Solution for /tmp/SystemOnTPTP20816/NUM835+1.tptp
%
%------------------------------------------------------------------------------