TSTP Solution File: SWV163+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV163+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:39:28 EST 2010
% Result : Theorem 1.67s
% Output : Solution 1.67s
% 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/SystemOnTPTP19378/SWV163+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP19378/SWV163+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP19378/SWV163+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 19474
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 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(23, axiom,succ(tptp_minus_1)=n0,file('/tmp/SRASS.s.p', succ_tptp_minus_1)).
% fof(49, axiom,![X1]:~(gt(X1,X1)),file('/tmp/SRASS.s.p', irreflexivity_gt)).
% fof(65, axiom,![X1]:plus(X1,n1)=succ(X1),file('/tmp/SRASS.s.p', succ_plus_1_r)).
% fof(66, axiom,![X1]:plus(n1,X1)=succ(X1),file('/tmp/SRASS.s.p', succ_plus_1_l)).
% fof(76, axiom,![X1]:![X2]:(leq(X1,X2)<=>gt(succ(X2),X1)),file('/tmp/SRASS.s.p', leq_succ_gt_equiv)).
% fof(92, conjecture,(((leq(n0,pv10)&leq(pv10,n135299))&![X9]:((leq(n0,X9)&leq(X9,pred(pv10)))=>sum(n0,n4,a_select3(q,X9,tptp_sum_index))=n1))=>![X13]:((leq(n0,X13)&leq(X13,tptp_minus_1))=>a_select3(q,pv10,X13)=divide(sqrt(times(minus(a_select3(center,X13,n0),a_select2(x,pv10)),minus(a_select3(center,X13,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)))))))),file('/tmp/SRASS.s.p', cl5_nebula_norm_0013)).
% fof(93, negated_conjecture,~((((leq(n0,pv10)&leq(pv10,n135299))&![X9]:((leq(n0,X9)&leq(X9,pred(pv10)))=>sum(n0,n4,a_select3(q,X9,tptp_sum_index))=n1))=>![X13]:((leq(n0,X13)&leq(X13,tptp_minus_1))=>a_select3(q,pv10,X13)=divide(sqrt(times(minus(a_select3(center,X13,n0),a_select2(x,pv10)),minus(a_select3(center,X13,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))))))))),inference(assume_negation,[status(cth)],[92])).
% fof(94, plain,![X1]:~(gt(X1,X1)),inference(fof_simplification,[status(thm)],[49,theory(equality)])).
% fof(99, plain,![X1]:![X2]:![X3]:((~(leq(X1,X2))|~(leq(X2,X3)))|leq(X1,X3)),inference(fof_nnf,[status(thm)],[2])).
% fof(100, plain,![X4]:![X5]:![X6]:((~(leq(X4,X5))|~(leq(X5,X6)))|leq(X4,X6)),inference(variable_rename,[status(thm)],[99])).
% cnf(101,plain,(leq(X1,X2)|~leq(X3,X2)|~leq(X1,X3)),inference(split_conjunct,[status(thm)],[100])).
% cnf(227,plain,(succ(tptp_minus_1)=n0),inference(split_conjunct,[status(thm)],[23])).
% fof(307, plain,![X2]:~(gt(X2,X2)),inference(variable_rename,[status(thm)],[94])).
% cnf(308,plain,(~gt(X1,X1)),inference(split_conjunct,[status(thm)],[307])).
% fof(342, plain,![X2]:plus(X2,n1)=succ(X2),inference(variable_rename,[status(thm)],[65])).
% cnf(343,plain,(plus(X1,n1)=succ(X1)),inference(split_conjunct,[status(thm)],[342])).
% fof(344, plain,![X2]:plus(n1,X2)=succ(X2),inference(variable_rename,[status(thm)],[66])).
% cnf(345,plain,(plus(n1,X1)=succ(X1)),inference(split_conjunct,[status(thm)],[344])).
% fof(357, plain,![X1]:![X2]:((~(leq(X1,X2))|gt(succ(X2),X1))&(~(gt(succ(X2),X1))|leq(X1,X2))),inference(fof_nnf,[status(thm)],[76])).
% fof(358, plain,![X3]:![X4]:((~(leq(X3,X4))|gt(succ(X4),X3))&(~(gt(succ(X4),X3))|leq(X3,X4))),inference(variable_rename,[status(thm)],[357])).
% cnf(360,plain,(gt(succ(X1),X2)|~leq(X2,X1)),inference(split_conjunct,[status(thm)],[358])).
% fof(388, negated_conjecture,(((leq(n0,pv10)&leq(pv10,n135299))&![X9]:((~(leq(n0,X9))|~(leq(X9,pred(pv10))))|sum(n0,n4,a_select3(q,X9,tptp_sum_index))=n1))&?[X13]:((leq(n0,X13)&leq(X13,tptp_minus_1))&~(a_select3(q,pv10,X13)=divide(sqrt(times(minus(a_select3(center,X13,n0),a_select2(x,pv10)),minus(a_select3(center,X13,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))))))))),inference(fof_nnf,[status(thm)],[93])).
% fof(389, negated_conjecture,(((leq(n0,pv10)&leq(pv10,n135299))&![X14]:((~(leq(n0,X14))|~(leq(X14,pred(pv10))))|sum(n0,n4,a_select3(q,X14,tptp_sum_index))=n1))&?[X15]:((leq(n0,X15)&leq(X15,tptp_minus_1))&~(a_select3(q,pv10,X15)=divide(sqrt(times(minus(a_select3(center,X15,n0),a_select2(x,pv10)),minus(a_select3(center,X15,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))))))))),inference(variable_rename,[status(thm)],[388])).
% fof(390, negated_conjecture,(((leq(n0,pv10)&leq(pv10,n135299))&![X14]:((~(leq(n0,X14))|~(leq(X14,pred(pv10))))|sum(n0,n4,a_select3(q,X14,tptp_sum_index))=n1))&((leq(n0,esk24_0)&leq(esk24_0,tptp_minus_1))&~(a_select3(q,pv10,esk24_0)=divide(sqrt(times(minus(a_select3(center,esk24_0,n0),a_select2(x,pv10)),minus(a_select3(center,esk24_0,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))))))))),inference(skolemize,[status(esa)],[389])).
% fof(391, negated_conjecture,![X14]:((((~(leq(n0,X14))|~(leq(X14,pred(pv10))))|sum(n0,n4,a_select3(q,X14,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(sqrt(times(minus(a_select3(center,esk24_0,n0),a_select2(x,pv10)),minus(a_select3(center,esk24_0,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))))))))),inference(shift_quantors,[status(thm)],[390])).
% cnf(393,negated_conjecture,(leq(esk24_0,tptp_minus_1)),inference(split_conjunct,[status(thm)],[391])).
% cnf(394,negated_conjecture,(leq(n0,esk24_0)),inference(split_conjunct,[status(thm)],[391])).
% cnf(433,plain,(plus(tptp_minus_1,n1)=n0),inference(rw,[status(thm)],[227,343,theory(equality)]),['unfolding']).
% cnf(436,plain,(plus(n1,X1)=plus(X1,n1)),inference(rw,[status(thm)],[345,343,theory(equality)]),['unfolding']).
% cnf(453,plain,(gt(plus(X1,n1),X2)|~leq(X2,X1)),inference(rw,[status(thm)],[360,343,theory(equality)]),['unfolding']).
% cnf(457,plain,(plus(n1,tptp_minus_1)=n0),inference(rw,[status(thm)],[433,436,theory(equality)])).
% cnf(536,negated_conjecture,(leq(X1,tptp_minus_1)|~leq(X1,esk24_0)),inference(spm,[status(thm)],[101,393,theory(equality)])).
% cnf(556,plain,(~leq(plus(X1,n1),X1)),inference(spm,[status(thm)],[308,453,theory(equality)])).
% cnf(6195,plain,(~leq(plus(n1,X1),X1)),inference(spm,[status(thm)],[556,436,theory(equality)])).
% cnf(7827,plain,(~leq(n0,tptp_minus_1)),inference(spm,[status(thm)],[6195,457,theory(equality)])).
% cnf(10828,negated_conjecture,(leq(n0,tptp_minus_1)),inference(spm,[status(thm)],[536,394,theory(equality)])).
% cnf(10832,negated_conjecture,($false),inference(sr,[status(thm)],[10828,7827,theory(equality)])).
% cnf(10833,negated_conjecture,($false),10832,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 482
% # ...of these trivial : 2
% # ...subsumed : 22
% # ...remaining for further processing: 458
% # Other redundant clauses eliminated : 7
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 2
% # Generated clauses : 5781
% # ...of the previous two non-trivial : 5737
% # Contextual simplify-reflections : 0
% # Paramodulations : 5770
% # Factorizations : 2
% # Equation resolutions : 9
% # Current number of processed clauses: 252
% # Positive orientable unit clauses: 84
% # Positive unorientable unit clauses: 5
% # Negative unit clauses : 17
% # Non-unit-clauses : 146
% # Current number of unprocessed clauses: 5661
% # ...number of literals in the above : 35604
% # Clause-clause subsumption calls (NU) : 4834
% # Rec. Clause-clause subsumption calls : 1426
% # Unit Clause-clause subsumption calls : 112
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 32
% # Indexed BW rewrite successes : 22
% # Backwards rewriting index: 290 leaves, 1.23+/-1.378 terms/leaf
% # Paramod-from index: 118 leaves, 1.03+/-0.157 terms/leaf
% # Paramod-into index: 183 leaves, 1.12+/-0.519 terms/leaf
% # -------------------------------------------------
% # User time : 0.336 s
% # System time : 0.009 s
% # Total time : 0.345 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.62 CPU 0.71 WC
% FINAL PrfWatch: 0.62 CPU 0.71 WC
% SZS output end Solution for /tmp/SystemOnTPTP19378/SWV163+1.tptp
%
%------------------------------------------------------------------------------