TSTP Solution File: SWV050+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV050+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 : 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 : Thu Dec 30 08:17:34 EST 2010
% Result : Theorem 1.45s
% Output : Solution 1.45s
% 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/SystemOnTPTP4689/SWV050+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP4689/SWV050+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP4689/SWV050+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 4785
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.032 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:plus(X1,n1)=succ(X1),file('/tmp/SRASS.s.p', succ_plus_1_r)).
% fof(2, axiom,![X1]:plus(n1,X1)=succ(X1),file('/tmp/SRASS.s.p', succ_plus_1_l)).
% fof(10, axiom,![X3]:sum(n0,tptp_minus_1,X3)=n0,file('/tmp/SRASS.s.p', sum_plus_base)).
% fof(11, axiom,![X1]:minus(X1,n1)=pred(X1),file('/tmp/SRASS.s.p', pred_minus_1)).
% fof(27, axiom,succ(tptp_minus_1)=n0,file('/tmp/SRASS.s.p', succ_tptp_minus_1)).
% fof(39, axiom,![X1]:pred(succ(X1))=X1,file('/tmp/SRASS.s.p', pred_succ)).
% fof(85, conjecture,((pv86=sum(n0,minus(n5,n1),divide(abs(minus(a_select2(mu,pv87),a_select2(muold,pv87))),plus(abs(a_select2(mu,pv87)),abs(a_select2(muold,pv87)))))&pv88=sum(n0,minus(n5,n1),divide(abs(minus(a_select2(rho,pv89),a_select2(rhoold,pv89))),plus(abs(a_select2(rho,pv89)),abs(a_select2(rhoold,pv89))))))=>((n0=sum(n0,minus(n0,n1),divide(abs(minus(a_select2(sigma,pv91),a_select2(sigmaold,pv91))),plus(abs(a_select2(sigma,pv91)),abs(a_select2(sigmaold,pv91)))))&pv86=sum(n0,minus(n5,n1),divide(abs(minus(a_select2(mu,pv87),a_select2(muold,pv87))),plus(abs(a_select2(mu,pv87)),abs(a_select2(muold,pv87))))))&pv88=sum(n0,minus(n5,n1),divide(abs(minus(a_select2(rho,pv89),a_select2(rhoold,pv89))),plus(abs(a_select2(rho,pv89)),abs(a_select2(rhoold,pv89))))))),file('/tmp/SRASS.s.p', cl5_nebula_norm_0022)).
% fof(86, negated_conjecture,~(((pv86=sum(n0,minus(n5,n1),divide(abs(minus(a_select2(mu,pv87),a_select2(muold,pv87))),plus(abs(a_select2(mu,pv87)),abs(a_select2(muold,pv87)))))&pv88=sum(n0,minus(n5,n1),divide(abs(minus(a_select2(rho,pv89),a_select2(rhoold,pv89))),plus(abs(a_select2(rho,pv89)),abs(a_select2(rhoold,pv89))))))=>((n0=sum(n0,minus(n0,n1),divide(abs(minus(a_select2(sigma,pv91),a_select2(sigmaold,pv91))),plus(abs(a_select2(sigma,pv91)),abs(a_select2(sigmaold,pv91)))))&pv86=sum(n0,minus(n5,n1),divide(abs(minus(a_select2(mu,pv87),a_select2(muold,pv87))),plus(abs(a_select2(mu,pv87)),abs(a_select2(muold,pv87))))))&pv88=sum(n0,minus(n5,n1),divide(abs(minus(a_select2(rho,pv89),a_select2(rhoold,pv89))),plus(abs(a_select2(rho,pv89)),abs(a_select2(rhoold,pv89)))))))),inference(assume_negation,[status(cth)],[85])).
% fof(90, plain,![X2]:plus(X2,n1)=succ(X2),inference(variable_rename,[status(thm)],[1])).
% cnf(91,plain,(plus(X1,n1)=succ(X1)),inference(split_conjunct,[status(thm)],[90])).
% fof(92, plain,![X2]:plus(n1,X2)=succ(X2),inference(variable_rename,[status(thm)],[2])).
% cnf(93,plain,(plus(n1,X1)=succ(X1)),inference(split_conjunct,[status(thm)],[92])).
% fof(107, plain,![X4]:sum(n0,tptp_minus_1,X4)=n0,inference(variable_rename,[status(thm)],[10])).
% cnf(108,plain,(sum(n0,tptp_minus_1,X1)=n0),inference(split_conjunct,[status(thm)],[107])).
% fof(109, plain,![X2]:minus(X2,n1)=pred(X2),inference(variable_rename,[status(thm)],[11])).
% cnf(110,plain,(minus(X1,n1)=pred(X1)),inference(split_conjunct,[status(thm)],[109])).
% cnf(151,plain,(succ(tptp_minus_1)=n0),inference(split_conjunct,[status(thm)],[27])).
% fof(171, plain,![X2]:pred(succ(X2))=X2,inference(variable_rename,[status(thm)],[39])).
% cnf(172,plain,(pred(succ(X1))=X1),inference(split_conjunct,[status(thm)],[171])).
% fof(374, negated_conjecture,((pv86=sum(n0,minus(n5,n1),divide(abs(minus(a_select2(mu,pv87),a_select2(muold,pv87))),plus(abs(a_select2(mu,pv87)),abs(a_select2(muold,pv87)))))&pv88=sum(n0,minus(n5,n1),divide(abs(minus(a_select2(rho,pv89),a_select2(rhoold,pv89))),plus(abs(a_select2(rho,pv89)),abs(a_select2(rhoold,pv89))))))&((~(n0=sum(n0,minus(n0,n1),divide(abs(minus(a_select2(sigma,pv91),a_select2(sigmaold,pv91))),plus(abs(a_select2(sigma,pv91)),abs(a_select2(sigmaold,pv91))))))|~(pv86=sum(n0,minus(n5,n1),divide(abs(minus(a_select2(mu,pv87),a_select2(muold,pv87))),plus(abs(a_select2(mu,pv87)),abs(a_select2(muold,pv87)))))))|~(pv88=sum(n0,minus(n5,n1),divide(abs(minus(a_select2(rho,pv89),a_select2(rhoold,pv89))),plus(abs(a_select2(rho,pv89)),abs(a_select2(rhoold,pv89)))))))),inference(fof_nnf,[status(thm)],[86])).
% cnf(375,negated_conjecture,(pv88!=sum(n0,minus(n5,n1),divide(abs(minus(a_select2(rho,pv89),a_select2(rhoold,pv89))),plus(abs(a_select2(rho,pv89)),abs(a_select2(rhoold,pv89)))))|pv86!=sum(n0,minus(n5,n1),divide(abs(minus(a_select2(mu,pv87),a_select2(muold,pv87))),plus(abs(a_select2(mu,pv87)),abs(a_select2(muold,pv87)))))|n0!=sum(n0,minus(n0,n1),divide(abs(minus(a_select2(sigma,pv91),a_select2(sigmaold,pv91))),plus(abs(a_select2(sigma,pv91)),abs(a_select2(sigmaold,pv91)))))),inference(split_conjunct,[status(thm)],[374])).
% cnf(376,negated_conjecture,(pv88=sum(n0,minus(n5,n1),divide(abs(minus(a_select2(rho,pv89),a_select2(rhoold,pv89))),plus(abs(a_select2(rho,pv89)),abs(a_select2(rhoold,pv89)))))),inference(split_conjunct,[status(thm)],[374])).
% cnf(377,negated_conjecture,(pv86=sum(n0,minus(n5,n1),divide(abs(minus(a_select2(mu,pv87),a_select2(muold,pv87))),plus(abs(a_select2(mu,pv87)),abs(a_select2(muold,pv87)))))),inference(split_conjunct,[status(thm)],[374])).
% cnf(408,plain,(plus(tptp_minus_1,n1)=n0),inference(rw,[status(thm)],[151,91,theory(equality)]),['unfolding']).
% cnf(410,plain,(pred(plus(X1,n1))=X1),inference(rw,[status(thm)],[172,91,theory(equality)]),['unfolding']).
% cnf(411,plain,(plus(n1,X1)=plus(X1,n1)),inference(rw,[status(thm)],[93,91,theory(equality)]),['unfolding']).
% cnf(432,plain,(minus(plus(X1,n1),n1)=X1),inference(rw,[status(thm)],[410,110,theory(equality)]),['unfolding']).
% cnf(436,plain,(plus(n1,tptp_minus_1)=n0),inference(rw,[status(thm)],[408,411,theory(equality)])).
% cnf(451,negated_conjecture,($false|sum(n0,minus(n5,n1),divide(abs(minus(a_select2(rho,pv89),a_select2(rhoold,pv89))),plus(abs(a_select2(rho,pv89)),abs(a_select2(rhoold,pv89)))))!=pv88|sum(n0,minus(n0,n1),divide(abs(minus(a_select2(sigma,pv91),a_select2(sigmaold,pv91))),plus(abs(a_select2(sigma,pv91)),abs(a_select2(sigmaold,pv91)))))!=n0),inference(rw,[status(thm)],[375,377,theory(equality)])).
% cnf(452,negated_conjecture,($false|$false|sum(n0,minus(n0,n1),divide(abs(minus(a_select2(sigma,pv91),a_select2(sigmaold,pv91))),plus(abs(a_select2(sigma,pv91)),abs(a_select2(sigmaold,pv91)))))!=n0),inference(rw,[status(thm)],[451,376,theory(equality)])).
% cnf(453,negated_conjecture,(sum(n0,minus(n0,n1),divide(abs(minus(a_select2(sigma,pv91),a_select2(sigmaold,pv91))),plus(abs(a_select2(sigma,pv91)),abs(a_select2(sigmaold,pv91)))))!=n0),inference(cn,[status(thm)],[452,theory(equality)])).
% cnf(457,plain,(minus(plus(n1,X1),n1)=X1),inference(spm,[status(thm)],[432,411,theory(equality)])).
% cnf(4745,plain,(minus(n0,n1)=tptp_minus_1),inference(spm,[status(thm)],[457,436,theory(equality)])).
% cnf(4777,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[453,4745,theory(equality)]),108,theory(equality)])).
% cnf(4778,negated_conjecture,($false),inference(cn,[status(thm)],[4777,theory(equality)])).
% cnf(4779,negated_conjecture,($false),4778,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 410
% # ...of these trivial : 3
% # ...subsumed : 5
% # ...remaining for further processing: 402
% # Other redundant clauses eliminated : 7
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 4
% # Generated clauses : 2963
% # ...of the previous two non-trivial : 2927
% # Contextual simplify-reflections : 0
% # Paramodulations : 2952
% # Factorizations : 2
% # Equation resolutions : 9
% # Current number of processed clauses: 204
% # Positive orientable unit clauses: 48
% # Positive unorientable unit clauses: 5
% # Negative unit clauses : 8
% # Non-unit-clauses : 143
% # Current number of unprocessed clauses: 2903
% # ...number of literals in the above : 21180
% # Clause-clause subsumption calls (NU) : 4811
% # Rec. Clause-clause subsumption calls : 1403
% # Unit Clause-clause subsumption calls : 7
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 27
% # Indexed BW rewrite successes : 24
% # Backwards rewriting index: 247 leaves, 1.26+/-1.487 terms/leaf
% # Paramod-from index: 80 leaves, 1.04+/-0.190 terms/leaf
% # Paramod-into index: 142 leaves, 1.15+/-0.569 terms/leaf
% # -------------------------------------------------
% # User time : 0.229 s
% # System time : 0.007 s
% # Total time : 0.236 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.43 CPU 0.51 WC
% FINAL PrfWatch: 0.43 CPU 0.51 WC
% SZS output end Solution for /tmp/SystemOnTPTP4689/SWV050+1.tptp
%
%------------------------------------------------------------------------------