TSTP Solution File: SWV156+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV156+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 : art05.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:38:37 EST 2010
% Result : Theorem 1.24s
% Output : Solution 1.24s
% 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/SystemOnTPTP23168/SWV156+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP23168/SWV156+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP23168/SWV156+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 23264
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.032 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:minus(X1,n1)=pred(X1),file('/tmp/SRASS.s.p', pred_minus_1)).
% fof(12, axiom,![X1]:![X2]:(leq(X1,pred(X2))<=>gt(X2,X1)),file('/tmp/SRASS.s.p', leq_gt_pred)).
% fof(44, axiom,![X1]:~(gt(X1,X1)),file('/tmp/SRASS.s.p', irreflexivity_gt)).
% fof(92, conjecture,(((((((pv70=sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))&leq(n0,pv10))&leq(n0,pv12))&leq(pv10,n135299))&leq(pv12,n4))&![X8]:((leq(n0,X8)&leq(X8,pred(pv12)))=>a_select3(q,pv10,X8)=divide(sqrt(times(minus(a_select3(center,X8,n0),a_select2(x,pv10)),minus(a_select3(center,X8,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10))))))))&![X12]:((leq(n0,X12)&leq(X12,pred(pv10)))=>sum(n0,n4,a_select3(q,X12,tptp_sum_index))=n1))=>![X18]:((leq(n0,X18)&leq(X18,pred(pv10)))=>(pv10=X18=>sum(n0,n4,cond(tptp_term_equals(pv12,tptp_sum_index),divide(sqrt(times(minus(a_select3(center,pv12,n0),a_select2(x,pv10)),minus(a_select3(center,pv12,n0),a_select2(x,pv10)))),pv70),a_select3(q,X18,tptp_sum_index)))=n1))),file('/tmp/SRASS.s.p', cl5_nebula_norm_0006)).
% fof(93, negated_conjecture,~((((((((pv70=sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))&leq(n0,pv10))&leq(n0,pv12))&leq(pv10,n135299))&leq(pv12,n4))&![X8]:((leq(n0,X8)&leq(X8,pred(pv12)))=>a_select3(q,pv10,X8)=divide(sqrt(times(minus(a_select3(center,X8,n0),a_select2(x,pv10)),minus(a_select3(center,X8,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10))))))))&![X12]:((leq(n0,X12)&leq(X12,pred(pv10)))=>sum(n0,n4,a_select3(q,X12,tptp_sum_index))=n1))=>![X18]:((leq(n0,X18)&leq(X18,pred(pv10)))=>(pv10=X18=>sum(n0,n4,cond(tptp_term_equals(pv12,tptp_sum_index),divide(sqrt(times(minus(a_select3(center,pv12,n0),a_select2(x,pv10)),minus(a_select3(center,pv12,n0),a_select2(x,pv10)))),pv70),a_select3(q,X18,tptp_sum_index)))=n1)))),inference(assume_negation,[status(cth)],[92])).
% fof(94, plain,![X1]:~(gt(X1,X1)),inference(fof_simplification,[status(thm)],[44,theory(equality)])).
% fof(102, plain,![X2]:minus(X2,n1)=pred(X2),inference(variable_rename,[status(thm)],[3])).
% cnf(103,plain,(minus(X1,n1)=pred(X1)),inference(split_conjunct,[status(thm)],[102])).
% fof(126, plain,![X1]:![X2]:((~(leq(X1,pred(X2)))|gt(X2,X1))&(~(gt(X2,X1))|leq(X1,pred(X2)))),inference(fof_nnf,[status(thm)],[12])).
% fof(127, plain,![X3]:![X4]:((~(leq(X3,pred(X4)))|gt(X4,X3))&(~(gt(X4,X3))|leq(X3,pred(X4)))),inference(variable_rename,[status(thm)],[126])).
% cnf(129,plain,(gt(X1,X2)|~leq(X2,pred(X1))),inference(split_conjunct,[status(thm)],[127])).
% fof(302, plain,![X2]:~(gt(X2,X2)),inference(variable_rename,[status(thm)],[94])).
% cnf(303,plain,(~gt(X1,X1)),inference(split_conjunct,[status(thm)],[302])).
% fof(388, negated_conjecture,(((((((pv70=sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))&leq(n0,pv10))&leq(n0,pv12))&leq(pv10,n135299))&leq(pv12,n4))&![X8]:((~(leq(n0,X8))|~(leq(X8,pred(pv12))))|a_select3(q,pv10,X8)=divide(sqrt(times(minus(a_select3(center,X8,n0),a_select2(x,pv10)),minus(a_select3(center,X8,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10))))))))&![X12]:((~(leq(n0,X12))|~(leq(X12,pred(pv10))))|sum(n0,n4,a_select3(q,X12,tptp_sum_index))=n1))&?[X18]:((leq(n0,X18)&leq(X18,pred(pv10)))&(pv10=X18&~(sum(n0,n4,cond(tptp_term_equals(pv12,tptp_sum_index),divide(sqrt(times(minus(a_select3(center,pv12,n0),a_select2(x,pv10)),minus(a_select3(center,pv12,n0),a_select2(x,pv10)))),pv70),a_select3(q,X18,tptp_sum_index)))=n1)))),inference(fof_nnf,[status(thm)],[93])).
% fof(389, negated_conjecture,(((((((pv70=sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))&leq(n0,pv10))&leq(n0,pv12))&leq(pv10,n135299))&leq(pv12,n4))&![X19]:((~(leq(n0,X19))|~(leq(X19,pred(pv12))))|a_select3(q,pv10,X19)=divide(sqrt(times(minus(a_select3(center,X19,n0),a_select2(x,pv10)),minus(a_select3(center,X19,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10))))))))&![X20]:((~(leq(n0,X20))|~(leq(X20,pred(pv10))))|sum(n0,n4,a_select3(q,X20,tptp_sum_index))=n1))&?[X21]:((leq(n0,X21)&leq(X21,pred(pv10)))&(pv10=X21&~(sum(n0,n4,cond(tptp_term_equals(pv12,tptp_sum_index),divide(sqrt(times(minus(a_select3(center,pv12,n0),a_select2(x,pv10)),minus(a_select3(center,pv12,n0),a_select2(x,pv10)))),pv70),a_select3(q,X21,tptp_sum_index)))=n1)))),inference(variable_rename,[status(thm)],[388])).
% fof(390, negated_conjecture,(((((((pv70=sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))&leq(n0,pv10))&leq(n0,pv12))&leq(pv10,n135299))&leq(pv12,n4))&![X19]:((~(leq(n0,X19))|~(leq(X19,pred(pv12))))|a_select3(q,pv10,X19)=divide(sqrt(times(minus(a_select3(center,X19,n0),a_select2(x,pv10)),minus(a_select3(center,X19,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10))))))))&![X20]:((~(leq(n0,X20))|~(leq(X20,pred(pv10))))|sum(n0,n4,a_select3(q,X20,tptp_sum_index))=n1))&((leq(n0,esk24_0)&leq(esk24_0,pred(pv10)))&(pv10=esk24_0&~(sum(n0,n4,cond(tptp_term_equals(pv12,tptp_sum_index),divide(sqrt(times(minus(a_select3(center,pv12,n0),a_select2(x,pv10)),minus(a_select3(center,pv12,n0),a_select2(x,pv10)))),pv70),a_select3(q,esk24_0,tptp_sum_index)))=n1)))),inference(skolemize,[status(esa)],[389])).
% fof(391, negated_conjecture,![X19]:![X20]:((((~(leq(n0,X20))|~(leq(X20,pred(pv10))))|sum(n0,n4,a_select3(q,X20,tptp_sum_index))=n1)&(((~(leq(n0,X19))|~(leq(X19,pred(pv12))))|a_select3(q,pv10,X19)=divide(sqrt(times(minus(a_select3(center,X19,n0),a_select2(x,pv10)),minus(a_select3(center,X19,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))))&((((pv70=sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))&leq(n0,pv10))&leq(n0,pv12))&leq(pv10,n135299))&leq(pv12,n4))))&((leq(n0,esk24_0)&leq(esk24_0,pred(pv10)))&(pv10=esk24_0&~(sum(n0,n4,cond(tptp_term_equals(pv12,tptp_sum_index),divide(sqrt(times(minus(a_select3(center,pv12,n0),a_select2(x,pv10)),minus(a_select3(center,pv12,n0),a_select2(x,pv10)))),pv70),a_select3(q,esk24_0,tptp_sum_index)))=n1)))),inference(shift_quantors,[status(thm)],[390])).
% cnf(393,negated_conjecture,(pv10=esk24_0),inference(split_conjunct,[status(thm)],[391])).
% cnf(394,negated_conjecture,(leq(esk24_0,pred(pv10))),inference(split_conjunct,[status(thm)],[391])).
% cnf(434,negated_conjecture,(leq(esk24_0,minus(pv10,n1))),inference(rw,[status(thm)],[394,103,theory(equality)]),['unfolding']).
% cnf(435,plain,(gt(X1,X2)|~leq(X2,minus(X1,n1))),inference(rw,[status(thm)],[129,103,theory(equality)]),['unfolding']).
% cnf(464,negated_conjecture,(leq(pv10,minus(pv10,n1))),inference(rw,[status(thm)],[434,393,theory(equality)])).
% cnf(534,negated_conjecture,(gt(pv10,pv10)),inference(spm,[status(thm)],[435,464,theory(equality)])).
% cnf(537,negated_conjecture,($false),inference(sr,[status(thm)],[534,303,theory(equality)])).
% cnf(538,negated_conjecture,($false),537,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 273
% # ...of these trivial : 1
% # ...subsumed : 0
% # ...remaining for further processing: 272
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 2
% # Generated clauses : 49
% # ...of the previous two non-trivial : 42
% # Contextual simplify-reflections : 0
% # Paramodulations : 48
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 62
% # Positive orientable unit clauses: 49
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 2
% # Non-unit-clauses : 10
% # Current number of unprocessed clauses: 184
% # ...number of literals in the above : 789
% # Clause-clause subsumption calls (NU) : 2418
% # Rec. Clause-clause subsumption calls : 717
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 29
% # Indexed BW rewrite successes : 20
% # Backwards rewriting index: 79 leaves, 1.10+/-0.376 terms/leaf
% # Paramod-from index: 54 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 76 leaves, 1.05+/-0.223 terms/leaf
% # -------------------------------------------------
% # User time : 0.059 s
% # System time : 0.007 s
% # Total time : 0.066 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.16 CPU 0.24 WC
% FINAL PrfWatch: 0.16 CPU 0.24 WC
% SZS output end Solution for /tmp/SystemOnTPTP23168/SWV156+1.tptp
%
%------------------------------------------------------------------------------