TSTP Solution File: SWV164+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV164+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 : 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 : Thu Dec 30 08:39:35 EST 2010
% Result : Theorem 1.58s
% Output : Solution 1.58s
% 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/SystemOnTPTP8860/SWV164+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP8860/SWV164+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP8860/SWV164+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 8956
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.031 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:![X3]:((leq(X1,X2)&leq(X2,X3))=>leq(X1,X3)),file('/tmp/SRASS.s.p', transitivity_leq)).
% fof(3, axiom,![X4]:sum(n0,tptp_minus_1,X4)=n0,file('/tmp/SRASS.s.p', sum_plus_base)).
% fof(21, axiom,![X4]:tptp_float_0_0=sum(n0,tptp_minus_1,X4),file('/tmp/SRASS.s.p', sum_plus_base_float)).
% fof(40, axiom,succ(tptp_minus_1)=n0,file('/tmp/SRASS.s.p', succ_tptp_minus_1)).
% fof(62, axiom,![X1]:~(gt(X1,X1)),file('/tmp/SRASS.s.p', irreflexivity_gt)).
% fof(78, axiom,![X1]:plus(X1,n1)=succ(X1),file('/tmp/SRASS.s.p', succ_plus_1_r)).
% fof(79, axiom,![X1]:plus(n1,X1)=succ(X1),file('/tmp/SRASS.s.p', succ_plus_1_l)).
% fof(84, axiom,![X1]:![X2]:(leq(X1,X2)<=>gt(succ(X2),X1)),file('/tmp/SRASS.s.p', leq_succ_gt_equiv)).
% fof(100, conjecture,(((leq(n0,pv10)&leq(pv10,n135299))&![X5]:((leq(n0,X5)&leq(X5,pred(pv10)))=>sum(n0,n4,a_select3(q,X5,tptp_sum_index))=n1))=>![X11]:((leq(n0,X11)&leq(X11,tptp_minus_1))=>a_select3(q,pv10,X11)=divide(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,X11)),minus(a_select2(x,pv10),a_select2(mu,X11))),tptp_minus_2),times(a_select2(sigma,X11),a_select2(sigma,X11)))),a_select2(rho,X11)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,X11))),sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index))))))),file('/tmp/SRASS.s.p', cl5_nebula_norm_0014)).
% fof(101, negated_conjecture,~((((leq(n0,pv10)&leq(pv10,n135299))&![X5]:((leq(n0,X5)&leq(X5,pred(pv10)))=>sum(n0,n4,a_select3(q,X5,tptp_sum_index))=n1))=>![X11]:((leq(n0,X11)&leq(X11,tptp_minus_1))=>a_select3(q,pv10,X11)=divide(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,X11)),minus(a_select2(x,pv10),a_select2(mu,X11))),tptp_minus_2),times(a_select2(sigma,X11),a_select2(sigma,X11)))),a_select2(rho,X11)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,X11))),sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index)))))))),inference(assume_negation,[status(cth)],[100])).
% fof(102, plain,![X1]:~(gt(X1,X1)),inference(fof_simplification,[status(thm)],[62,theory(equality)])).
% fof(107, plain,![X1]:![X2]:![X3]:((~(leq(X1,X2))|~(leq(X2,X3)))|leq(X1,X3)),inference(fof_nnf,[status(thm)],[2])).
% fof(108, plain,![X4]:![X5]:![X6]:((~(leq(X4,X5))|~(leq(X5,X6)))|leq(X4,X6)),inference(variable_rename,[status(thm)],[107])).
% cnf(109,plain,(leq(X1,X2)|~leq(X3,X2)|~leq(X1,X3)),inference(split_conjunct,[status(thm)],[108])).
% fof(110, plain,![X5]:sum(n0,tptp_minus_1,X5)=n0,inference(variable_rename,[status(thm)],[3])).
% cnf(111,plain,(sum(n0,tptp_minus_1,X1)=n0),inference(split_conjunct,[status(thm)],[110])).
% fof(142, plain,![X5]:tptp_float_0_0=sum(n0,tptp_minus_1,X5),inference(variable_rename,[status(thm)],[21])).
% cnf(143,plain,(tptp_float_0_0=sum(n0,tptp_minus_1,X1)),inference(split_conjunct,[status(thm)],[142])).
% cnf(264,plain,(succ(tptp_minus_1)=n0),inference(split_conjunct,[status(thm)],[40])).
% fof(329, plain,![X2]:~(gt(X2,X2)),inference(variable_rename,[status(thm)],[102])).
% cnf(330,plain,(~gt(X1,X1)),inference(split_conjunct,[status(thm)],[329])).
% fof(363, plain,![X2]:plus(X2,n1)=succ(X2),inference(variable_rename,[status(thm)],[78])).
% cnf(364,plain,(plus(X1,n1)=succ(X1)),inference(split_conjunct,[status(thm)],[363])).
% fof(365, plain,![X2]:plus(n1,X2)=succ(X2),inference(variable_rename,[status(thm)],[79])).
% cnf(366,plain,(plus(n1,X1)=succ(X1)),inference(split_conjunct,[status(thm)],[365])).
% fof(375, plain,![X1]:![X2]:((~(leq(X1,X2))|gt(succ(X2),X1))&(~(gt(succ(X2),X1))|leq(X1,X2))),inference(fof_nnf,[status(thm)],[84])).
% fof(376, plain,![X3]:![X4]:((~(leq(X3,X4))|gt(succ(X4),X3))&(~(gt(succ(X4),X3))|leq(X3,X4))),inference(variable_rename,[status(thm)],[375])).
% cnf(378,plain,(gt(succ(X1),X2)|~leq(X2,X1)),inference(split_conjunct,[status(thm)],[376])).
% fof(404, negated_conjecture,(((leq(n0,pv10)&leq(pv10,n135299))&![X5]:((~(leq(n0,X5))|~(leq(X5,pred(pv10))))|sum(n0,n4,a_select3(q,X5,tptp_sum_index))=n1))&?[X11]:((leq(n0,X11)&leq(X11,tptp_minus_1))&~(a_select3(q,pv10,X11)=divide(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,X11)),minus(a_select2(x,pv10),a_select2(mu,X11))),tptp_minus_2),times(a_select2(sigma,X11),a_select2(sigma,X11)))),a_select2(rho,X11)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,X11))),sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index)))))))),inference(fof_nnf,[status(thm)],[101])).
% fof(405, negated_conjecture,(((leq(n0,pv10)&leq(pv10,n135299))&![X12]:((~(leq(n0,X12))|~(leq(X12,pred(pv10))))|sum(n0,n4,a_select3(q,X12,tptp_sum_index))=n1))&?[X13]:((leq(n0,X13)&leq(X13,tptp_minus_1))&~(a_select3(q,pv10,X13)=divide(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,X13)),minus(a_select2(x,pv10),a_select2(mu,X13))),tptp_minus_2),times(a_select2(sigma,X13),a_select2(sigma,X13)))),a_select2(rho,X13)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,X13))),sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index)))))))),inference(variable_rename,[status(thm)],[404])).
% fof(406, negated_conjecture,(((leq(n0,pv10)&leq(pv10,n135299))&![X12]:((~(leq(n0,X12))|~(leq(X12,pred(pv10))))|sum(n0,n4,a_select3(q,X12,tptp_sum_index))=n1))&((leq(n0,esk24_0)&leq(esk24_0,tptp_minus_1))&~(a_select3(q,pv10,esk24_0)=divide(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,esk24_0)),minus(a_select2(x,pv10),a_select2(mu,esk24_0))),tptp_minus_2),times(a_select2(sigma,esk24_0),a_select2(sigma,esk24_0)))),a_select2(rho,esk24_0)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,esk24_0))),sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index)))))))),inference(skolemize,[status(esa)],[405])).
% fof(407, negated_conjecture,![X12]:((((~(leq(n0,X12))|~(leq(X12,pred(pv10))))|sum(n0,n4,a_select3(q,X12,tptp_sum_index))=n1)&(leq(n0,pv10)&leq(pv10,n135299)))&((leq(n0,esk24_0)&leq(esk24_0,tptp_minus_1))&~(a_select3(q,pv10,esk24_0)=divide(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,esk24_0)),minus(a_select2(x,pv10),a_select2(mu,esk24_0))),tptp_minus_2),times(a_select2(sigma,esk24_0),a_select2(sigma,esk24_0)))),a_select2(rho,esk24_0)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,esk24_0))),sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index)))))))),inference(shift_quantors,[status(thm)],[406])).
% cnf(409,negated_conjecture,(leq(esk24_0,tptp_minus_1)),inference(split_conjunct,[status(thm)],[407])).
% cnf(410,negated_conjecture,(leq(n0,esk24_0)),inference(split_conjunct,[status(thm)],[407])).
% cnf(449,plain,(plus(tptp_minus_1,n1)=n0),inference(rw,[status(thm)],[264,364,theory(equality)]),['unfolding']).
% cnf(452,plain,(plus(n1,X1)=plus(X1,n1)),inference(rw,[status(thm)],[366,364,theory(equality)]),['unfolding']).
% cnf(469,plain,(gt(plus(X1,n1),X2)|~leq(X2,X1)),inference(rw,[status(thm)],[378,364,theory(equality)]),['unfolding']).
% cnf(472,plain,(n0=tptp_float_0_0),inference(rw,[status(thm)],[143,111,theory(equality)])).
% cnf(482,negated_conjecture,(leq(tptp_float_0_0,esk24_0)),inference(rw,[status(thm)],[410,472,theory(equality)])).
% cnf(484,plain,(plus(tptp_minus_1,n1)=tptp_float_0_0),inference(rw,[status(thm)],[449,472,theory(equality)])).
% cnf(776,plain,(plus(n1,tptp_minus_1)=tptp_float_0_0),inference(rw,[status(thm)],[484,452,theory(equality)])).
% cnf(837,plain,(~leq(plus(X1,n1),X1)),inference(spm,[status(thm)],[330,469,theory(equality)])).
% cnf(849,negated_conjecture,(leq(X1,tptp_minus_1)|~leq(X1,esk24_0)),inference(spm,[status(thm)],[109,409,theory(equality)])).
% cnf(6219,negated_conjecture,(~leq(plus(tptp_minus_1,n1),esk24_0)),inference(spm,[status(thm)],[837,849,theory(equality)])).
% cnf(6304,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[6219,452,theory(equality)]),776,theory(equality)]),482,theory(equality)])).
% cnf(6305,negated_conjecture,($false),inference(cn,[status(thm)],[6304,theory(equality)])).
% cnf(6306,negated_conjecture,($false),6305,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 455
% # ...of these trivial : 0
% # ...subsumed : 1
% # ...remaining for further processing: 454
% # Other redundant clauses eliminated : 7
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 16
% # Generated clauses : 3569
% # ...of the previous two non-trivial : 3469
% # Contextual simplify-reflections : 0
% # Paramodulations : 3558
% # Factorizations : 2
% # Equation resolutions : 9
% # Current number of processed clauses: 226
% # Positive orientable unit clauses: 66
% # Positive unorientable unit clauses: 5
% # Negative unit clauses : 10
% # Non-unit-clauses : 145
% # Current number of unprocessed clauses: 3436
% # ...number of literals in the above : 24099
% # Clause-clause subsumption calls (NU) : 5199
% # Rec. Clause-clause subsumption calls : 1431
% # Unit Clause-clause subsumption calls : 261
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 27
% # Indexed BW rewrite successes : 20
% # Backwards rewriting index: 286 leaves, 1.23+/-1.386 terms/leaf
% # Paramod-from index: 100 leaves, 1.03+/-0.171 terms/leaf
% # Paramod-into index: 178 leaves, 1.13+/-0.631 terms/leaf
% # -------------------------------------------------
% # User time : 0.259 s
% # System time : 0.011 s
% # Total time : 0.270 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.47 CPU 0.55 WC
% FINAL PrfWatch: 0.47 CPU 0.55 WC
% SZS output end Solution for /tmp/SystemOnTPTP8860/SWV164+1.tptp
%
%------------------------------------------------------------------------------