TSTP Solution File: SWV181+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV181+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:41:02 EST 2010
% Result : Theorem 1.87s
% Output : Solution 1.87s
% 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/SystemOnTPTP19896/SWV181+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP19896/SWV181+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP19896/SWV181+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 19992
% 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(3, axiom,![X1]:~(gt(X1,X1)),file('/tmp/SRASS.s.p', irreflexivity_gt)).
% fof(5, axiom,![X1]:![X2]:![X3]:((leq(X1,X2)&leq(X2,X3))=>leq(X1,X3)),file('/tmp/SRASS.s.p', transitivity_leq)).
% fof(25, axiom,succ(n0)=n1,file('/tmp/SRASS.s.p', successor_1)).
% fof(33, axiom,![X1]:![X2]:(leq(X1,X2)<=>gt(succ(X2),X1)),file('/tmp/SRASS.s.p', leq_succ_gt_equiv)).
% fof(56, axiom,![X1]:![X2]:(leq(X1,pred(X2))<=>gt(X2,X1)),file('/tmp/SRASS.s.p', leq_gt_pred)).
% fof(63, axiom,![X1]:minus(X1,n1)=pred(X1),file('/tmp/SRASS.s.p', pred_minus_1)).
% fof(69, axiom,![X1]:plus(X1,n1)=succ(X1),file('/tmp/SRASS.s.p', succ_plus_1_r)).
% fof(82, axiom,![X1]:pred(succ(X1))=X1,file('/tmp/SRASS.s.p', pred_succ)).
% fof(92, conjecture,((((((((leq(tptp_float_0_001,pv76)&leq(n1,loopcounter))>(n1,loopcounter))&![X8]:((leq(n0,X8)&leq(X8,n135299))=>![X12]:((leq(n0,X12)&leq(X12,n4))=>a_select3(q_init,X8,X12)=init)))&![X17]:((leq(n0,X17)&leq(X17,n4))=>a_select3(center_init,X17,n0)=init))&(gt(loopcounter,n0)=>![X24]:((leq(n0,X24)&leq(X24,n4))=>a_select2(mu_init,X24)=init)))&(gt(loopcounter,n0)=>![X25]:((leq(n0,X25)&leq(X25,n4))=>a_select2(rho_init,X25)=init)))&(gt(loopcounter,n0)=>![X26]:((leq(n0,X26)&leq(X26,n4))=>a_select2(sigma_init,X26)=init)))=>![X28]:((leq(n0,X28)&leq(X28,n4))=>a_select2(muold_init,X28)=init)),file('/tmp/SRASS.s.p', cl5_nebula_init_0081)).
% fof(93, negated_conjecture,~(((((((((leq(tptp_float_0_001,pv76)&leq(n1,loopcounter))>(n1,loopcounter))&![X8]:((leq(n0,X8)&leq(X8,n135299))=>![X12]:((leq(n0,X12)&leq(X12,n4))=>a_select3(q_init,X8,X12)=init)))&![X17]:((leq(n0,X17)&leq(X17,n4))=>a_select3(center_init,X17,n0)=init))&(gt(loopcounter,n0)=>![X24]:((leq(n0,X24)&leq(X24,n4))=>a_select2(mu_init,X24)=init)))&(gt(loopcounter,n0)=>![X25]:((leq(n0,X25)&leq(X25,n4))=>a_select2(rho_init,X25)=init)))&(gt(loopcounter,n0)=>![X26]:((leq(n0,X26)&leq(X26,n4))=>a_select2(sigma_init,X26)=init)))=>![X28]:((leq(n0,X28)&leq(X28,n4))=>a_select2(muold_init,X28)=init))),inference(assume_negation,[status(cth)],[92])).
% fof(94, plain,![X1]:~(gt(X1,X1)),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(96, plain,(epred2_0=>(((((((leq(tptp_float_0_001,pv76)&leq(n1,loopcounter))>(n1,loopcounter))&![X8]:((leq(n0,X8)&leq(X8,n135299))=>![X12]:((leq(n0,X12)&leq(X12,n4))=>a_select3(q_init,X8,X12)=init)))&![X17]:((leq(n0,X17)&leq(X17,n4))=>a_select3(center_init,X17,n0)=init))&(gt(loopcounter,n0)=>![X24]:((leq(n0,X24)&leq(X24,n4))=>a_select2(mu_init,X24)=init)))&(gt(loopcounter,n0)=>![X25]:((leq(n0,X25)&leq(X25,n4))=>a_select2(rho_init,X25)=init)))&(gt(loopcounter,n0)=>![X26]:((leq(n0,X26)&leq(X26,n4))=>a_select2(sigma_init,X26)=init)))),introduced(definition)).
% fof(98, negated_conjecture,~((epred2_0=>![X28]:((leq(n0,X28)&leq(X28,n4))=>a_select2(muold_init,X28)=init))),inference(apply_def,[status(esa)],[93,96,theory(equality)])).
% fof(104, plain,![X2]:~(gt(X2,X2)),inference(variable_rename,[status(thm)],[94])).
% cnf(105,plain,(~gt(X1,X1)),inference(split_conjunct,[status(thm)],[104])).
% fof(108, plain,![X1]:![X2]:![X3]:((~(leq(X1,X2))|~(leq(X2,X3)))|leq(X1,X3)),inference(fof_nnf,[status(thm)],[5])).
% fof(109, plain,![X4]:![X5]:![X6]:((~(leq(X4,X5))|~(leq(X5,X6)))|leq(X4,X6)),inference(variable_rename,[status(thm)],[108])).
% cnf(110,plain,(leq(X1,X2)|~leq(X3,X2)|~leq(X1,X3)),inference(split_conjunct,[status(thm)],[109])).
% cnf(239,plain,(succ(n0)=n1),inference(split_conjunct,[status(thm)],[25])).
% fof(249, plain,![X1]:![X2]:((~(leq(X1,X2))|gt(succ(X2),X1))&(~(gt(succ(X2),X1))|leq(X1,X2))),inference(fof_nnf,[status(thm)],[33])).
% fof(250, plain,![X3]:![X4]:((~(leq(X3,X4))|gt(succ(X4),X3))&(~(gt(succ(X4),X3))|leq(X3,X4))),inference(variable_rename,[status(thm)],[249])).
% cnf(252,plain,(gt(succ(X1),X2)|~leq(X2,X1)),inference(split_conjunct,[status(thm)],[250])).
% fof(311, plain,![X1]:![X2]:((~(leq(X1,pred(X2)))|gt(X2,X1))&(~(gt(X2,X1))|leq(X1,pred(X2)))),inference(fof_nnf,[status(thm)],[56])).
% fof(312, plain,![X3]:![X4]:((~(leq(X3,pred(X4)))|gt(X4,X3))&(~(gt(X4,X3))|leq(X3,pred(X4)))),inference(variable_rename,[status(thm)],[311])).
% cnf(313,plain,(leq(X1,pred(X2))|~gt(X2,X1)),inference(split_conjunct,[status(thm)],[312])).
% fof(340, plain,![X2]:minus(X2,n1)=pred(X2),inference(variable_rename,[status(thm)],[63])).
% cnf(341,plain,(minus(X1,n1)=pred(X1)),inference(split_conjunct,[status(thm)],[340])).
% fof(354, plain,![X2]:plus(X2,n1)=succ(X2),inference(variable_rename,[status(thm)],[69])).
% cnf(355,plain,(plus(X1,n1)=succ(X1)),inference(split_conjunct,[status(thm)],[354])).
% fof(372, plain,![X2]:pred(succ(X2))=X2,inference(variable_rename,[status(thm)],[82])).
% cnf(373,plain,(pred(succ(X1))=X1),inference(split_conjunct,[status(thm)],[372])).
% fof(390, negated_conjecture,(epred2_0&?[X28]:((leq(n0,X28)&leq(X28,n4))&~(a_select2(muold_init,X28)=init))),inference(fof_nnf,[status(thm)],[98])).
% fof(391, negated_conjecture,(epred2_0&?[X29]:((leq(n0,X29)&leq(X29,n4))&~(a_select2(muold_init,X29)=init))),inference(variable_rename,[status(thm)],[390])).
% fof(392, negated_conjecture,(epred2_0&((leq(n0,esk24_0)&leq(esk24_0,n4))&~(a_select2(muold_init,esk24_0)=init))),inference(skolemize,[status(esa)],[391])).
% cnf(396,negated_conjecture,(epred2_0),inference(split_conjunct,[status(thm)],[392])).
% fof(426, plain,(~(epred2_0)|(((((((leq(tptp_float_0_001,pv76)&leq(n1,loopcounter))>(n1,loopcounter))&![X8]:((~(leq(n0,X8))|~(leq(X8,n135299)))|![X12]:((~(leq(n0,X12))|~(leq(X12,n4)))|a_select3(q_init,X8,X12)=init)))&![X17]:((~(leq(n0,X17))|~(leq(X17,n4)))|a_select3(center_init,X17,n0)=init))&(~(gt(loopcounter,n0))|![X24]:((~(leq(n0,X24))|~(leq(X24,n4)))|a_select2(mu_init,X24)=init)))&(~(gt(loopcounter,n0))|![X25]:((~(leq(n0,X25))|~(leq(X25,n4)))|a_select2(rho_init,X25)=init)))&(~(gt(loopcounter,n0))|![X26]:((~(leq(n0,X26))|~(leq(X26,n4)))|a_select2(sigma_init,X26)=init)))),inference(fof_nnf,[status(thm)],[96])).
% fof(427, plain,(~(epred2_0)|(((((((leq(tptp_float_0_001,pv76)&leq(n1,loopcounter))>(n1,loopcounter))&![X27]:((~(leq(n0,X27))|~(leq(X27,n135299)))|![X28]:((~(leq(n0,X28))|~(leq(X28,n4)))|a_select3(q_init,X27,X28)=init)))&![X29]:((~(leq(n0,X29))|~(leq(X29,n4)))|a_select3(center_init,X29,n0)=init))&(~(gt(loopcounter,n0))|![X30]:((~(leq(n0,X30))|~(leq(X30,n4)))|a_select2(mu_init,X30)=init)))&(~(gt(loopcounter,n0))|![X31]:((~(leq(n0,X31))|~(leq(X31,n4)))|a_select2(rho_init,X31)=init)))&(~(gt(loopcounter,n0))|![X32]:((~(leq(n0,X32))|~(leq(X32,n4)))|a_select2(sigma_init,X32)=init)))),inference(variable_rename,[status(thm)],[426])).
% fof(428, plain,![X27]:![X28]:![X29]:![X30]:![X31]:![X32]:(((((~(leq(n0,X32))|~(leq(X32,n4)))|a_select2(sigma_init,X32)=init)|~(gt(loopcounter,n0)))&((((~(leq(n0,X31))|~(leq(X31,n4)))|a_select2(rho_init,X31)=init)|~(gt(loopcounter,n0)))&((((~(leq(n0,X30))|~(leq(X30,n4)))|a_select2(mu_init,X30)=init)|~(gt(loopcounter,n0)))&(((~(leq(n0,X29))|~(leq(X29,n4)))|a_select3(center_init,X29,n0)=init)&((((~(leq(n0,X28))|~(leq(X28,n4)))|a_select3(q_init,X27,X28)=init)|(~(leq(n0,X27))|~(leq(X27,n135299))))&((leq(tptp_float_0_001,pv76)&leq(n1,loopcounter))>(n1,loopcounter)))))))|~(epred2_0)),inference(shift_quantors,[status(thm)],[427])).
% fof(429, plain,![X27]:![X28]:![X29]:![X30]:![X31]:![X32]:(((((~(leq(n0,X32))|~(leq(X32,n4)))|a_select2(sigma_init,X32)=init)|~(gt(loopcounter,n0)))|~(epred2_0))&(((((~(leq(n0,X31))|~(leq(X31,n4)))|a_select2(rho_init,X31)=init)|~(gt(loopcounter,n0)))|~(epred2_0))&(((((~(leq(n0,X30))|~(leq(X30,n4)))|a_select2(mu_init,X30)=init)|~(gt(loopcounter,n0)))|~(epred2_0))&((((~(leq(n0,X29))|~(leq(X29,n4)))|a_select3(center_init,X29,n0)=init)|~(epred2_0))&(((((~(leq(n0,X28))|~(leq(X28,n4)))|a_select3(q_init,X27,X28)=init)|(~(leq(n0,X27))|~(leq(X27,n135299))))|~(epred2_0))&(((leq(tptp_float_0_001,pv76)|~(epred2_0))&(leq(n1,loopcounter)|~(epred2_0)))&(gt(n1,loopcounter)|~(epred2_0)))))))),inference(distribute,[status(thm)],[428])).
% cnf(430,plain,(gt(n1,loopcounter)|~epred2_0),inference(split_conjunct,[status(thm)],[429])).
% cnf(431,plain,(leq(n1,loopcounter)|~epred2_0),inference(split_conjunct,[status(thm)],[429])).
% cnf(439,plain,(minus(succ(X1),n1)=X1),inference(rw,[status(thm)],[373,341,theory(equality)]),['unfolding']).
% cnf(441,plain,(leq(X1,minus(X2,n1))|~gt(X2,X1)),inference(rw,[status(thm)],[313,341,theory(equality)]),['unfolding']).
% cnf(442,plain,(plus(n0,n1)=n1),inference(rw,[status(thm)],[239,355,theory(equality)]),['unfolding']).
% cnf(445,plain,(minus(plus(X1,n1),n1)=X1),inference(rw,[status(thm)],[439,355,theory(equality)]),['unfolding']).
% cnf(463,plain,(gt(plus(X1,n1),X2)|~leq(X2,X1)),inference(rw,[status(thm)],[252,355,theory(equality)]),['unfolding']).
% cnf(466,plain,(leq(n1,loopcounter)|$false),inference(rw,[status(thm)],[431,396,theory(equality)])).
% cnf(467,plain,(leq(n1,loopcounter)),inference(cn,[status(thm)],[466,theory(equality)])).
% cnf(470,plain,(gt(n1,loopcounter)|$false),inference(rw,[status(thm)],[430,396,theory(equality)])).
% cnf(471,plain,(gt(n1,loopcounter)),inference(cn,[status(thm)],[470,theory(equality)])).
% cnf(541,plain,(minus(n1,n1)=n0),inference(spm,[status(thm)],[445,442,theory(equality)])).
% cnf(573,plain,(leq(X1,minus(X2,n1))|~leq(X1,X3)|~gt(X2,X3)),inference(spm,[status(thm)],[110,441,theory(equality)])).
% cnf(609,plain,(~leq(plus(X1,n1),X1)),inference(spm,[status(thm)],[105,463,theory(equality)])).
% cnf(5832,plain,(~leq(n1,n0)),inference(spm,[status(thm)],[609,442,theory(equality)])).
% cnf(14696,plain,(leq(X1,minus(n1,n1))|~leq(X1,loopcounter)),inference(spm,[status(thm)],[573,471,theory(equality)])).
% cnf(14732,plain,(leq(X1,n0)|~leq(X1,loopcounter)),inference(rw,[status(thm)],[14696,541,theory(equality)])).
% cnf(14769,plain,(leq(n1,n0)),inference(spm,[status(thm)],[14732,467,theory(equality)])).
% cnf(14772,plain,($false),inference(sr,[status(thm)],[14769,5832,theory(equality)])).
% cnf(14773,plain,($false),14772,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 681
% # ...of these trivial : 8
% # ...subsumed : 112
% # ...remaining for further processing: 561
% # Other redundant clauses eliminated : 7
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 3
% # Generated clauses : 9451
% # ...of the previous two non-trivial : 9303
% # Contextual simplify-reflections : 0
% # Paramodulations : 9440
% # Factorizations : 2
% # Equation resolutions : 9
% # Current number of processed clauses: 348
% # Positive orientable unit clauses: 112
% # Positive unorientable unit clauses: 5
% # Negative unit clauses : 44
% # Non-unit-clauses : 187
% # Current number of unprocessed clauses: 9038
% # ...number of literals in the above : 55452
% # Clause-clause subsumption calls (NU) : 3882
% # Rec. Clause-clause subsumption calls : 1444
% # Unit Clause-clause subsumption calls : 135
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 29
% # Indexed BW rewrite successes : 23
% # Backwards rewriting index: 374 leaves, 1.19+/-1.231 terms/leaf
% # Paramod-from index: 156 leaves, 1.03+/-0.158 terms/leaf
% # Paramod-into index: 263 leaves, 1.10+/-0.521 terms/leaf
% # -------------------------------------------------
% # User time : 0.462 s
% # System time : 0.021 s
% # Total time : 0.483 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.81 CPU 0.89 WC
% FINAL PrfWatch: 0.81 CPU 0.89 WC
% SZS output end Solution for /tmp/SystemOnTPTP19896/SWV181+1.tptp
%
%------------------------------------------------------------------------------