TSTP Solution File: SWV488+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV488+3 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art09.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 : Thu Dec 30 09:13:36 EST 2010
% Result : Theorem 0.89s
% Output : Solution 0.89s
% 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/SystemOnTPTP9376/SWV488+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP9376/SWV488+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP9376/SWV488+3.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 9472
% 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(1, axiom,![X1]:![X2]:(int_leq(X1,X2)<=>(int_less(X1,X2)|X1=X2)),file('/tmp/SRASS.s.p', int_leq)).
% fof(11, axiom,~(real_zero=real_one),file('/tmp/SRASS.s.p', real_constants)).
% fof(12, axiom,![X1]:![X2]:((((int_leq(int_one,X1)&int_leq(X1,n))&int_leq(int_one,X2))&int_leq(X2,n))=>((![X8]:((int_less(int_zero,X8)&X1=plus(X2,X8))=>![X3]:((int_leq(int_one,X3)&int_leq(X3,X2))=>a(plus(X3,X8),X3)=real_zero))&![X3]:((int_leq(int_one,X3)&int_leq(X3,X2))=>a(X3,X3)=real_one))&![X8]:((int_less(int_zero,X8)&X2=plus(X1,X8))=>![X3]:((int_leq(int_one,X3)&int_leq(X3,X1))=>a(X3,plus(X3,X8))=real_zero)))),file('/tmp/SRASS.s.p', qii)).
% fof(13, conjecture,![X1]:![X2]:(((int_leq(int_one,X2)&int_leq(X2,X1))&int_leq(X1,n))=>(X1=X2=>~(a(X1,X2)=real_zero))),file('/tmp/SRASS.s.p', uti)).
% fof(14, negated_conjecture,~(![X1]:![X2]:(((int_leq(int_one,X2)&int_leq(X2,X1))&int_leq(X1,n))=>(X1=X2=>~(a(X1,X2)=real_zero)))),inference(assume_negation,[status(cth)],[13])).
% fof(15, plain,![X2]:![X1]:(epred1_2(X1,X2)=>((![X8]:((int_less(int_zero,X8)&X1=plus(X2,X8))=>![X3]:((int_leq(int_one,X3)&int_leq(X3,X2))=>a(plus(X3,X8),X3)=real_zero))&![X3]:((int_leq(int_one,X3)&int_leq(X3,X2))=>a(X3,X3)=real_one))&![X8]:((int_less(int_zero,X8)&X2=plus(X1,X8))=>![X3]:((int_leq(int_one,X3)&int_leq(X3,X1))=>a(X3,plus(X3,X8))=real_zero)))),introduced(definition)).
% fof(16, plain,![X1]:![X2]:((((int_leq(int_one,X1)&int_leq(X1,n))&int_leq(int_one,X2))&int_leq(X2,n))=>epred1_2(X1,X2)),inference(apply_def,[status(esa)],[12,15,theory(equality)])).
% fof(17, plain,![X1]:![X2]:((~(int_leq(X1,X2))|(int_less(X1,X2)|X1=X2))&((~(int_less(X1,X2))&~(X1=X2))|int_leq(X1,X2))),inference(fof_nnf,[status(thm)],[1])).
% fof(18, plain,![X3]:![X4]:((~(int_leq(X3,X4))|(int_less(X3,X4)|X3=X4))&((~(int_less(X3,X4))&~(X3=X4))|int_leq(X3,X4))),inference(variable_rename,[status(thm)],[17])).
% fof(19, plain,![X3]:![X4]:((~(int_leq(X3,X4))|(int_less(X3,X4)|X3=X4))&((~(int_less(X3,X4))|int_leq(X3,X4))&(~(X3=X4)|int_leq(X3,X4)))),inference(distribute,[status(thm)],[18])).
% cnf(20,plain,(int_leq(X1,X2)|X1!=X2),inference(split_conjunct,[status(thm)],[19])).
% cnf(51,plain,(real_zero!=real_one),inference(split_conjunct,[status(thm)],[11])).
% fof(52, plain,![X1]:![X2]:((((~(int_leq(int_one,X1))|~(int_leq(X1,n)))|~(int_leq(int_one,X2)))|~(int_leq(X2,n)))|epred1_2(X1,X2)),inference(fof_nnf,[status(thm)],[16])).
% fof(53, plain,![X3]:![X4]:((((~(int_leq(int_one,X3))|~(int_leq(X3,n)))|~(int_leq(int_one,X4)))|~(int_leq(X4,n)))|epred1_2(X3,X4)),inference(variable_rename,[status(thm)],[52])).
% cnf(54,plain,(epred1_2(X1,X2)|~int_leq(X2,n)|~int_leq(int_one,X2)|~int_leq(X1,n)|~int_leq(int_one,X1)),inference(split_conjunct,[status(thm)],[53])).
% fof(55, negated_conjecture,?[X1]:?[X2]:(((int_leq(int_one,X2)&int_leq(X2,X1))&int_leq(X1,n))&(X1=X2&a(X1,X2)=real_zero)),inference(fof_nnf,[status(thm)],[14])).
% fof(56, negated_conjecture,?[X3]:?[X4]:(((int_leq(int_one,X4)&int_leq(X4,X3))&int_leq(X3,n))&(X3=X4&a(X3,X4)=real_zero)),inference(variable_rename,[status(thm)],[55])).
% fof(57, negated_conjecture,(((int_leq(int_one,esk3_0)&int_leq(esk3_0,esk2_0))&int_leq(esk2_0,n))&(esk2_0=esk3_0&a(esk2_0,esk3_0)=real_zero)),inference(skolemize,[status(esa)],[56])).
% cnf(58,negated_conjecture,(a(esk2_0,esk3_0)=real_zero),inference(split_conjunct,[status(thm)],[57])).
% cnf(59,negated_conjecture,(esk2_0=esk3_0),inference(split_conjunct,[status(thm)],[57])).
% cnf(60,negated_conjecture,(int_leq(esk2_0,n)),inference(split_conjunct,[status(thm)],[57])).
% cnf(62,negated_conjecture,(int_leq(int_one,esk3_0)),inference(split_conjunct,[status(thm)],[57])).
% fof(63, plain,![X2]:![X1]:(~(epred1_2(X1,X2))|((![X8]:((~(int_less(int_zero,X8))|~(X1=plus(X2,X8)))|![X3]:((~(int_leq(int_one,X3))|~(int_leq(X3,X2)))|a(plus(X3,X8),X3)=real_zero))&![X3]:((~(int_leq(int_one,X3))|~(int_leq(X3,X2)))|a(X3,X3)=real_one))&![X8]:((~(int_less(int_zero,X8))|~(X2=plus(X1,X8)))|![X3]:((~(int_leq(int_one,X3))|~(int_leq(X3,X1)))|a(X3,plus(X3,X8))=real_zero)))),inference(fof_nnf,[status(thm)],[15])).
% fof(64, plain,![X9]:![X10]:(~(epred1_2(X10,X9))|((![X11]:((~(int_less(int_zero,X11))|~(X10=plus(X9,X11)))|![X12]:((~(int_leq(int_one,X12))|~(int_leq(X12,X9)))|a(plus(X12,X11),X12)=real_zero))&![X13]:((~(int_leq(int_one,X13))|~(int_leq(X13,X9)))|a(X13,X13)=real_one))&![X14]:((~(int_less(int_zero,X14))|~(X9=plus(X10,X14)))|![X15]:((~(int_leq(int_one,X15))|~(int_leq(X15,X10)))|a(X15,plus(X15,X14))=real_zero)))),inference(variable_rename,[status(thm)],[63])).
% fof(65, plain,![X9]:![X10]:![X11]:![X12]:![X13]:![X14]:![X15]:(((((~(int_leq(int_one,X15))|~(int_leq(X15,X10)))|a(X15,plus(X15,X14))=real_zero)|(~(int_less(int_zero,X14))|~(X9=plus(X10,X14))))&(((~(int_leq(int_one,X13))|~(int_leq(X13,X9)))|a(X13,X13)=real_one)&(((~(int_leq(int_one,X12))|~(int_leq(X12,X9)))|a(plus(X12,X11),X12)=real_zero)|(~(int_less(int_zero,X11))|~(X10=plus(X9,X11))))))|~(epred1_2(X10,X9))),inference(shift_quantors,[status(thm)],[64])).
% fof(66, plain,![X9]:![X10]:![X11]:![X12]:![X13]:![X14]:![X15]:(((((~(int_leq(int_one,X15))|~(int_leq(X15,X10)))|a(X15,plus(X15,X14))=real_zero)|(~(int_less(int_zero,X14))|~(X9=plus(X10,X14))))|~(epred1_2(X10,X9)))&((((~(int_leq(int_one,X13))|~(int_leq(X13,X9)))|a(X13,X13)=real_one)|~(epred1_2(X10,X9)))&((((~(int_leq(int_one,X12))|~(int_leq(X12,X9)))|a(plus(X12,X11),X12)=real_zero)|(~(int_less(int_zero,X11))|~(X10=plus(X9,X11))))|~(epred1_2(X10,X9))))),inference(distribute,[status(thm)],[65])).
% cnf(68,plain,(a(X3,X3)=real_one|~epred1_2(X1,X2)|~int_leq(X3,X2)|~int_leq(int_one,X3)),inference(split_conjunct,[status(thm)],[66])).
% cnf(70,negated_conjecture,(a(esk2_0,esk2_0)=real_zero),inference(rw,[status(thm)],[58,59,theory(equality)])).
% cnf(71,negated_conjecture,(int_leq(int_one,esk2_0)),inference(rw,[status(thm)],[62,59,theory(equality)])).
% cnf(74,plain,(int_leq(X1,X1)),inference(er,[status(thm)],[20,theory(equality)])).
% cnf(92,plain,(a(X1,X1)=real_one|~int_leq(int_one,X1)|~int_leq(X1,X3)|~int_leq(X3,n)|~int_leq(X2,n)|~int_leq(int_one,X3)|~int_leq(int_one,X2)),inference(spm,[status(thm)],[68,54,theory(equality)])).
% cnf(186,negated_conjecture,(a(X1,X1)=real_one|~int_leq(int_one,X1)|~int_leq(X2,n)|~int_leq(int_one,esk2_0)|~int_leq(int_one,X2)|~int_leq(X1,esk2_0)),inference(spm,[status(thm)],[92,60,theory(equality)])).
% cnf(191,negated_conjecture,(a(X1,X1)=real_one|~int_leq(int_one,X1)|~int_leq(X2,n)|$false|~int_leq(int_one,X2)|~int_leq(X1,esk2_0)),inference(rw,[status(thm)],[186,71,theory(equality)])).
% cnf(192,negated_conjecture,(a(X1,X1)=real_one|~int_leq(int_one,X1)|~int_leq(X2,n)|~int_leq(int_one,X2)|~int_leq(X1,esk2_0)),inference(cn,[status(thm)],[191,theory(equality)])).
% cnf(193,negated_conjecture,(a(X1,X1)=real_one|~int_leq(int_one,X1)|~int_leq(int_one,esk2_0)|~int_leq(X1,esk2_0)),inference(spm,[status(thm)],[192,60,theory(equality)])).
% cnf(198,negated_conjecture,(a(X1,X1)=real_one|~int_leq(int_one,X1)|$false|~int_leq(X1,esk2_0)),inference(rw,[status(thm)],[193,71,theory(equality)])).
% cnf(199,negated_conjecture,(a(X1,X1)=real_one|~int_leq(int_one,X1)|~int_leq(X1,esk2_0)),inference(cn,[status(thm)],[198,theory(equality)])).
% cnf(200,negated_conjecture,(real_one=real_zero|~int_leq(int_one,esk2_0)|~int_leq(esk2_0,esk2_0)),inference(spm,[status(thm)],[70,199,theory(equality)])).
% cnf(201,negated_conjecture,(real_one=real_zero|$false|~int_leq(esk2_0,esk2_0)),inference(rw,[status(thm)],[200,71,theory(equality)])).
% cnf(202,negated_conjecture,(real_one=real_zero|$false|$false),inference(rw,[status(thm)],[201,74,theory(equality)])).
% cnf(203,negated_conjecture,(real_one=real_zero),inference(cn,[status(thm)],[202,theory(equality)])).
% cnf(204,negated_conjecture,($false),inference(sr,[status(thm)],[203,51,theory(equality)])).
% cnf(205,negated_conjecture,($false),204,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 80
% # ...of these trivial : 1
% # ...subsumed : 10
% # ...remaining for further processing: 69
% # Other redundant clauses eliminated : 11
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 1
% # Generated clauses : 99
% # ...of the previous two non-trivial : 71
% # Contextual simplify-reflections : 6
% # Paramodulations : 83
% # Factorizations : 2
% # Equation resolutions : 14
% # Current number of processed clauses: 41
% # Positive orientable unit clauses: 9
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 3
% # Non-unit-clauses : 28
% # Current number of unprocessed clauses: 36
% # ...number of literals in the above : 156
% # Clause-clause subsumption calls (NU) : 106
% # Rec. Clause-clause subsumption calls : 97
% # Unit Clause-clause subsumption calls : 15
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 18
% # Indexed BW rewrite successes : 5
% # Backwards rewriting index: 39 leaves, 1.51+/-1.152 terms/leaf
% # Paramod-from index: 25 leaves, 1.12+/-0.431 terms/leaf
% # Paramod-into index: 34 leaves, 1.26+/-0.816 terms/leaf
% # -------------------------------------------------
% # User time : 0.015 s
% # System time : 0.004 s
% # Total time : 0.019 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.17 WC
% FINAL PrfWatch: 0.10 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP9376/SWV488+3.tptp
%
%------------------------------------------------------------------------------