TSTP Solution File: SWV056+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV056+1 : TPTP v5.0.0. Bugfixed v3.3.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 08:18:26 EST 2010
% Result : Theorem 1.55s
% Output : Solution 1.55s
% 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/SystemOnTPTP6648/SWV056+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP6648/SWV056+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP6648/SWV056+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 6744
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.031 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(16, axiom,![X15]:sum(n0,tptp_minus_1,X15)=n0,file('/tmp/SRASS.s.p', sum_plus_base)).
% fof(17, axiom,![X1]:minus(X1,n1)=pred(X1),file('/tmp/SRASS.s.p', pred_minus_1)).
% fof(45, axiom,succ(tptp_minus_1)=n0,file('/tmp/SRASS.s.p', succ_tptp_minus_1)).
% fof(49, axiom,![X1]:plus(X1,n1)=succ(X1),file('/tmp/SRASS.s.p', succ_plus_1_r)).
% fof(50, axiom,![X1]:plus(n1,X1)=succ(X1),file('/tmp/SRASS.s.p', succ_plus_1_l)).
% fof(58, axiom,![X1]:pred(succ(X1))=X1,file('/tmp/SRASS.s.p', pred_succ)).
% fof(85, conjecture,((leq(n0,pv25)&leq(pv25,minus(n5,n1)))=>((n0=sum(n0,minus(n0,n1),a_select3(q,pv77,pv25))&leq(n0,pv25))&leq(pv25,minus(n5,n1)))),file('/tmp/SRASS.s.p', cl5_nebula_norm_0040)).
% fof(86, negated_conjecture,~(((leq(n0,pv25)&leq(pv25,minus(n5,n1)))=>((n0=sum(n0,minus(n0,n1),a_select3(q,pv77,pv25))&leq(n0,pv25))&leq(pv25,minus(n5,n1))))),inference(assume_negation,[status(cth)],[85])).
% fof(209, plain,![X16]:sum(n0,tptp_minus_1,X16)=n0,inference(variable_rename,[status(thm)],[16])).
% cnf(210,plain,(sum(n0,tptp_minus_1,X1)=n0),inference(split_conjunct,[status(thm)],[209])).
% fof(211, plain,![X2]:minus(X2,n1)=pred(X2),inference(variable_rename,[status(thm)],[17])).
% cnf(212,plain,(minus(X1,n1)=pred(X1)),inference(split_conjunct,[status(thm)],[211])).
% cnf(308,plain,(succ(tptp_minus_1)=n0),inference(split_conjunct,[status(thm)],[45])).
% fof(312, plain,![X2]:plus(X2,n1)=succ(X2),inference(variable_rename,[status(thm)],[49])).
% cnf(313,plain,(plus(X1,n1)=succ(X1)),inference(split_conjunct,[status(thm)],[312])).
% fof(314, plain,![X2]:plus(n1,X2)=succ(X2),inference(variable_rename,[status(thm)],[50])).
% cnf(315,plain,(plus(n1,X1)=succ(X1)),inference(split_conjunct,[status(thm)],[314])).
% fof(325, plain,![X2]:pred(succ(X2))=X2,inference(variable_rename,[status(thm)],[58])).
% cnf(326,plain,(pred(succ(X1))=X1),inference(split_conjunct,[status(thm)],[325])).
% fof(374, negated_conjecture,((leq(n0,pv25)&leq(pv25,minus(n5,n1)))&((~(n0=sum(n0,minus(n0,n1),a_select3(q,pv77,pv25)))|~(leq(n0,pv25)))|~(leq(pv25,minus(n5,n1))))),inference(fof_nnf,[status(thm)],[86])).
% cnf(375,negated_conjecture,(~leq(pv25,minus(n5,n1))|~leq(n0,pv25)|n0!=sum(n0,minus(n0,n1),a_select3(q,pv77,pv25))),inference(split_conjunct,[status(thm)],[374])).
% cnf(376,negated_conjecture,(leq(pv25,minus(n5,n1))),inference(split_conjunct,[status(thm)],[374])).
% cnf(377,negated_conjecture,(leq(n0,pv25)),inference(split_conjunct,[status(thm)],[374])).
% cnf(408,plain,(minus(succ(X1),n1)=X1),inference(rw,[status(thm)],[326,212,theory(equality)]),['unfolding']).
% cnf(412,plain,(plus(tptp_minus_1,n1)=n0),inference(rw,[status(thm)],[308,313,theory(equality)]),['unfolding']).
% cnf(414,plain,(minus(plus(X1,n1),n1)=X1),inference(rw,[status(thm)],[408,313,theory(equality)]),['unfolding']).
% cnf(415,plain,(plus(n1,X1)=plus(X1,n1)),inference(rw,[status(thm)],[315,313,theory(equality)]),['unfolding']).
% cnf(437,plain,(plus(n1,tptp_minus_1)=n0),inference(rw,[status(thm)],[412,415,theory(equality)])).
% cnf(447,negated_conjecture,(sum(n0,minus(n0,n1),a_select3(q,pv77,pv25))!=n0|$false|~leq(pv25,minus(n5,n1))),inference(rw,[status(thm)],[375,377,theory(equality)])).
% cnf(448,negated_conjecture,(sum(n0,minus(n0,n1),a_select3(q,pv77,pv25))!=n0|$false|$false),inference(rw,[status(thm)],[447,376,theory(equality)])).
% cnf(449,negated_conjecture,(sum(n0,minus(n0,n1),a_select3(q,pv77,pv25))!=n0),inference(cn,[status(thm)],[448,theory(equality)])).
% cnf(486,plain,(minus(plus(n1,X1),n1)=X1),inference(spm,[status(thm)],[414,415,theory(equality)])).
% cnf(8858,plain,(minus(n0,n1)=tptp_minus_1),inference(spm,[status(thm)],[486,437,theory(equality)])).
% cnf(8879,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[449,8858,theory(equality)]),210,theory(equality)])).
% cnf(8880,negated_conjecture,($false),inference(cn,[status(thm)],[8879,theory(equality)])).
% cnf(8881,negated_conjecture,($false),8880,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 455
% # ...of these trivial : 4
% # ...subsumed : 19
% # ...remaining for further processing: 432
% # Other redundant clauses eliminated : 9
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 4
% # Generated clauses : 4961
% # ...of the previous two non-trivial : 4913
% # Contextual simplify-reflections : 0
% # Paramodulations : 4948
% # Factorizations : 2
% # Equation resolutions : 11
% # Current number of processed clauses: 234
% # Positive orientable unit clauses: 71
% # Positive unorientable unit clauses: 5
% # Negative unit clauses : 15
% # Non-unit-clauses : 143
% # Current number of unprocessed clauses: 4763
% # ...number of literals in the above : 30521
% # Clause-clause subsumption calls (NU) : 4824
% # Rec. Clause-clause subsumption calls : 1416
% # Unit Clause-clause subsumption calls : 108
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 29
% # Indexed BW rewrite successes : 25
% # Backwards rewriting index: 256 leaves, 1.25+/-1.462 terms/leaf
% # Paramod-from index: 101 leaves, 1.04+/-0.195 terms/leaf
% # Paramod-into index: 152 leaves, 1.13+/-0.558 terms/leaf
% # -------------------------------------------------
% # User time : 0.300 s
% # System time : 0.013 s
% # Total time : 0.313 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.54 CPU 0.63 WC
% FINAL PrfWatch: 0.54 CPU 0.63 WC
% SZS output end Solution for /tmp/SystemOnTPTP6648/SWV056+1.tptp
%
%------------------------------------------------------------------------------