TSTP Solution File: SWV142+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV142+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 : art03.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:36:41 EST 2010
% Result : Theorem 1.59s
% Output : Solution 1.59s
% 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/SystemOnTPTP20674/SWV142+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP20674/SWV142+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP20674/SWV142+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 20770
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.033 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:~(gt(X1,X1)),file('/tmp/SRASS.s.p', irreflexivity_gt)).
% fof(4, axiom,![X1]:![X2]:![X3]:((leq(X1,X2)&leq(X2,X3))=>leq(X1,X3)),file('/tmp/SRASS.s.p', transitivity_leq)).
% fof(5, axiom,![X1]:![X2]:(gt(X2,X1)=>leq(X1,X2)),file('/tmp/SRASS.s.p', leq_gt1)).
% fof(6, axiom,gt(n1,n0),file('/tmp/SRASS.s.p', gt_1_0)).
% fof(10, axiom,![X1]:![X2]:((leq(X1,X2)&~(X1=X2))=>gt(X2,X1)),file('/tmp/SRASS.s.p', leq_gt2)).
% fof(14, axiom,![X1]:![X2]:(leq(X1,X2)<=>gt(succ(X2),X1)),file('/tmp/SRASS.s.p', leq_succ_gt_equiv)).
% fof(34, axiom,succ(n0)=n1,file('/tmp/SRASS.s.p', successor_1)).
% fof(53, axiom,![X1]:plus(X1,n1)=succ(X1),file('/tmp/SRASS.s.p', succ_plus_1_r)).
% fof(85, conjecture,((((((((((((((leq(tptp_float_0_001,pv1341)&leq(n1,loopcounter))&(~(leq(tptp_float_0_001,pv1341))=>leq(n0,s_best7)))&(~(leq(tptp_float_0_001,pv1341))=>leq(n0,s_sworst7)))&(~(leq(tptp_float_0_001,pv1341))=>leq(n0,s_worst7)))&(~(leq(tptp_float_0_001,pv1341))=>leq(s_best7,n3)))&(~(leq(tptp_float_0_001,pv1341))=>leq(s_sworst7,n3)))&(~(leq(tptp_float_0_001,pv1341))=>leq(s_worst7,n3)))&(gt(loopcounter,n0)=>leq(n0,s_best7)))&(gt(loopcounter,n0)=>leq(n0,s_sworst7)))&(gt(loopcounter,n0)=>leq(n0,s_worst7)))&(gt(loopcounter,n0)=>leq(s_best7,n3)))&(gt(loopcounter,n0)=>leq(s_sworst7,n3)))&(gt(loopcounter,n0)=>leq(s_worst7,n3)))=>leq(s_best7,n3)),file('/tmp/SRASS.s.p', gauss_array_0012)).
% fof(86, negated_conjecture,~(((((((((((((((leq(tptp_float_0_001,pv1341)&leq(n1,loopcounter))&(~(leq(tptp_float_0_001,pv1341))=>leq(n0,s_best7)))&(~(leq(tptp_float_0_001,pv1341))=>leq(n0,s_sworst7)))&(~(leq(tptp_float_0_001,pv1341))=>leq(n0,s_worst7)))&(~(leq(tptp_float_0_001,pv1341))=>leq(s_best7,n3)))&(~(leq(tptp_float_0_001,pv1341))=>leq(s_sworst7,n3)))&(~(leq(tptp_float_0_001,pv1341))=>leq(s_worst7,n3)))&(gt(loopcounter,n0)=>leq(n0,s_best7)))&(gt(loopcounter,n0)=>leq(n0,s_sworst7)))&(gt(loopcounter,n0)=>leq(n0,s_worst7)))&(gt(loopcounter,n0)=>leq(s_best7,n3)))&(gt(loopcounter,n0)=>leq(s_sworst7,n3)))&(gt(loopcounter,n0)=>leq(s_worst7,n3)))=>leq(s_best7,n3))),inference(assume_negation,[status(cth)],[85])).
% fof(87, plain,![X1]:~(gt(X1,X1)),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(88, negated_conjecture,~(((((((((((((((leq(tptp_float_0_001,pv1341)&leq(n1,loopcounter))&(~(leq(tptp_float_0_001,pv1341))=>leq(n0,s_best7)))&(~(leq(tptp_float_0_001,pv1341))=>leq(n0,s_sworst7)))&(~(leq(tptp_float_0_001,pv1341))=>leq(n0,s_worst7)))&(~(leq(tptp_float_0_001,pv1341))=>leq(s_best7,n3)))&(~(leq(tptp_float_0_001,pv1341))=>leq(s_sworst7,n3)))&(~(leq(tptp_float_0_001,pv1341))=>leq(s_worst7,n3)))&(gt(loopcounter,n0)=>leq(n0,s_best7)))&(gt(loopcounter,n0)=>leq(n0,s_sworst7)))&(gt(loopcounter,n0)=>leq(n0,s_worst7)))&(gt(loopcounter,n0)=>leq(s_best7,n3)))&(gt(loopcounter,n0)=>leq(s_sworst7,n3)))&(gt(loopcounter,n0)=>leq(s_worst7,n3)))=>leq(s_best7,n3))),inference(fof_simplification,[status(thm)],[86,theory(equality)])).
% fof(90, plain,(epred2_0=>(((((((((((((leq(tptp_float_0_001,pv1341)&leq(n1,loopcounter))&(~(leq(tptp_float_0_001,pv1341))=>leq(n0,s_best7)))&(~(leq(tptp_float_0_001,pv1341))=>leq(n0,s_sworst7)))&(~(leq(tptp_float_0_001,pv1341))=>leq(n0,s_worst7)))&(~(leq(tptp_float_0_001,pv1341))=>leq(s_best7,n3)))&(~(leq(tptp_float_0_001,pv1341))=>leq(s_sworst7,n3)))&(~(leq(tptp_float_0_001,pv1341))=>leq(s_worst7,n3)))&(gt(loopcounter,n0)=>leq(n0,s_best7)))&(gt(loopcounter,n0)=>leq(n0,s_sworst7)))&(gt(loopcounter,n0)=>leq(n0,s_worst7)))&(gt(loopcounter,n0)=>leq(s_best7,n3)))&(gt(loopcounter,n0)=>leq(s_sworst7,n3)))&(gt(loopcounter,n0)=>leq(s_worst7,n3)))),introduced(definition)).
% fof(92, negated_conjecture,~((epred2_0=>leq(s_best7,n3))),inference(apply_def,[status(esa)],[88,90,theory(equality)])).
% fof(96, plain,![X2]:~(gt(X2,X2)),inference(variable_rename,[status(thm)],[87])).
% cnf(97,plain,(~gt(X1,X1)),inference(split_conjunct,[status(thm)],[96])).
% fof(100, plain,![X1]:![X2]:![X3]:((~(leq(X1,X2))|~(leq(X2,X3)))|leq(X1,X3)),inference(fof_nnf,[status(thm)],[4])).
% fof(101, plain,![X4]:![X5]:![X6]:((~(leq(X4,X5))|~(leq(X5,X6)))|leq(X4,X6)),inference(variable_rename,[status(thm)],[100])).
% cnf(102,plain,(leq(X1,X2)|~leq(X3,X2)|~leq(X1,X3)),inference(split_conjunct,[status(thm)],[101])).
% fof(103, plain,![X1]:![X2]:(~(gt(X2,X1))|leq(X1,X2)),inference(fof_nnf,[status(thm)],[5])).
% fof(104, plain,![X3]:![X4]:(~(gt(X4,X3))|leq(X3,X4)),inference(variable_rename,[status(thm)],[103])).
% cnf(105,plain,(leq(X1,X2)|~gt(X2,X1)),inference(split_conjunct,[status(thm)],[104])).
% cnf(106,plain,(gt(n1,n0)),inference(split_conjunct,[status(thm)],[6])).
% fof(112, plain,![X1]:![X2]:((~(leq(X1,X2))|X1=X2)|gt(X2,X1)),inference(fof_nnf,[status(thm)],[10])).
% fof(113, plain,![X3]:![X4]:((~(leq(X3,X4))|X3=X4)|gt(X4,X3)),inference(variable_rename,[status(thm)],[112])).
% cnf(114,plain,(gt(X1,X2)|X2=X1|~leq(X2,X1)),inference(split_conjunct,[status(thm)],[113])).
% fof(122, plain,![X1]:![X2]:((~(leq(X1,X2))|gt(succ(X2),X1))&(~(gt(succ(X2),X1))|leq(X1,X2))),inference(fof_nnf,[status(thm)],[14])).
% fof(123, plain,![X3]:![X4]:((~(leq(X3,X4))|gt(succ(X4),X3))&(~(gt(succ(X4),X3))|leq(X3,X4))),inference(variable_rename,[status(thm)],[122])).
% cnf(125,plain,(gt(succ(X1),X2)|~leq(X2,X1)),inference(split_conjunct,[status(thm)],[123])).
% cnf(161,plain,(succ(n0)=n1),inference(split_conjunct,[status(thm)],[34])).
% fof(285, plain,![X2]:plus(X2,n1)=succ(X2),inference(variable_rename,[status(thm)],[53])).
% cnf(286,plain,(plus(X1,n1)=succ(X1)),inference(split_conjunct,[status(thm)],[285])).
% fof(377, negated_conjecture,(epred2_0&~(leq(s_best7,n3))),inference(fof_nnf,[status(thm)],[92])).
% cnf(378,negated_conjecture,(~leq(s_best7,n3)),inference(split_conjunct,[status(thm)],[377])).
% cnf(379,negated_conjecture,(epred2_0),inference(split_conjunct,[status(thm)],[377])).
% fof(409, plain,(~(epred2_0)|(((((((((((((leq(tptp_float_0_001,pv1341)&leq(n1,loopcounter))&(leq(tptp_float_0_001,pv1341)|leq(n0,s_best7)))&(leq(tptp_float_0_001,pv1341)|leq(n0,s_sworst7)))&(leq(tptp_float_0_001,pv1341)|leq(n0,s_worst7)))&(leq(tptp_float_0_001,pv1341)|leq(s_best7,n3)))&(leq(tptp_float_0_001,pv1341)|leq(s_sworst7,n3)))&(leq(tptp_float_0_001,pv1341)|leq(s_worst7,n3)))&(~(gt(loopcounter,n0))|leq(n0,s_best7)))&(~(gt(loopcounter,n0))|leq(n0,s_sworst7)))&(~(gt(loopcounter,n0))|leq(n0,s_worst7)))&(~(gt(loopcounter,n0))|leq(s_best7,n3)))&(~(gt(loopcounter,n0))|leq(s_sworst7,n3)))&(~(gt(loopcounter,n0))|leq(s_worst7,n3)))),inference(fof_nnf,[status(thm)],[90])).
% fof(410, plain,((((((((((((((leq(tptp_float_0_001,pv1341)|~(epred2_0))&(leq(n1,loopcounter)|~(epred2_0)))&((leq(tptp_float_0_001,pv1341)|leq(n0,s_best7))|~(epred2_0)))&((leq(tptp_float_0_001,pv1341)|leq(n0,s_sworst7))|~(epred2_0)))&((leq(tptp_float_0_001,pv1341)|leq(n0,s_worst7))|~(epred2_0)))&((leq(tptp_float_0_001,pv1341)|leq(s_best7,n3))|~(epred2_0)))&((leq(tptp_float_0_001,pv1341)|leq(s_sworst7,n3))|~(epred2_0)))&((leq(tptp_float_0_001,pv1341)|leq(s_worst7,n3))|~(epred2_0)))&((~(gt(loopcounter,n0))|leq(n0,s_best7))|~(epred2_0)))&((~(gt(loopcounter,n0))|leq(n0,s_sworst7))|~(epred2_0)))&((~(gt(loopcounter,n0))|leq(n0,s_worst7))|~(epred2_0)))&((~(gt(loopcounter,n0))|leq(s_best7,n3))|~(epred2_0)))&((~(gt(loopcounter,n0))|leq(s_sworst7,n3))|~(epred2_0)))&((~(gt(loopcounter,n0))|leq(s_worst7,n3))|~(epred2_0))),inference(distribute,[status(thm)],[409])).
% cnf(413,plain,(leq(s_best7,n3)|~epred2_0|~gt(loopcounter,n0)),inference(split_conjunct,[status(thm)],[410])).
% cnf(423,plain,(leq(n1,loopcounter)|~epred2_0),inference(split_conjunct,[status(thm)],[410])).
% cnf(429,plain,(plus(n0,n1)=n1),inference(rw,[status(thm)],[161,286,theory(equality)]),['unfolding']).
% cnf(450,plain,(gt(plus(X1,n1),X2)|~leq(X2,X1)),inference(rw,[status(thm)],[125,286,theory(equality)]),['unfolding']).
% cnf(453,plain,(leq(n1,loopcounter)|$false),inference(rw,[status(thm)],[423,379,theory(equality)])).
% cnf(454,plain,(leq(n1,loopcounter)),inference(cn,[status(thm)],[453,theory(equality)])).
% cnf(475,plain,(leq(s_best7,n3)|$false|~gt(loopcounter,n0)),inference(rw,[status(thm)],[413,379,theory(equality)])).
% cnf(476,plain,(leq(s_best7,n3)|~gt(loopcounter,n0)),inference(cn,[status(thm)],[475,theory(equality)])).
% cnf(477,plain,(~gt(loopcounter,n0)),inference(sr,[status(thm)],[476,378,theory(equality)])).
% cnf(531,plain,(leq(n0,n1)),inference(spm,[status(thm)],[105,106,theory(equality)])).
% cnf(533,plain,(loopcounter=n0|~leq(n0,loopcounter)),inference(spm,[status(thm)],[477,114,theory(equality)])).
% cnf(540,plain,(leq(X1,loopcounter)|~leq(X1,n1)),inference(spm,[status(thm)],[102,454,theory(equality)])).
% cnf(599,plain,(~leq(plus(X1,n1),X1)),inference(spm,[status(thm)],[97,450,theory(equality)])).
% cnf(5093,plain,(~leq(n1,n0)),inference(spm,[status(thm)],[599,429,theory(equality)])).
% cnf(8147,plain,(loopcounter=n0|~leq(n0,n1)),inference(spm,[status(thm)],[533,540,theory(equality)])).
% cnf(8229,plain,(loopcounter=n0|$false),inference(rw,[status(thm)],[8147,531,theory(equality)])).
% cnf(8230,plain,(loopcounter=n0),inference(cn,[status(thm)],[8229,theory(equality)])).
% cnf(8236,plain,(leq(n1,n0)),inference(rw,[status(thm)],[454,8230,theory(equality)])).
% cnf(8237,plain,($false),inference(sr,[status(thm)],[8236,5093,theory(equality)])).
% cnf(8238,plain,($false),8237,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 487
% # ...of these trivial : 12
% # ...subsumed : 28
% # ...remaining for further processing: 447
% # Other redundant clauses eliminated : 7
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 5
% # Generated clauses : 5542
% # ...of the previous two non-trivial : 5498
% # Contextual simplify-reflections : 0
% # Paramodulations : 5531
% # Factorizations : 2
% # Equation resolutions : 9
% # Current number of processed clauses: 246
% # Positive orientable unit clauses: 70
% # Positive unorientable unit clauses: 5
% # Negative unit clauses : 19
% # Non-unit-clauses : 152
% # Current number of unprocessed clauses: 5243
% # ...number of literals in the above : 34419
% # Clause-clause subsumption calls (NU) : 3651
% # Rec. Clause-clause subsumption calls : 1295
% # Unit Clause-clause subsumption calls : 171
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 24
% # Indexed BW rewrite successes : 20
% # Backwards rewriting index: 270 leaves, 1.24+/-1.426 terms/leaf
% # Paramod-from index: 105 leaves, 1.03+/-0.167 terms/leaf
% # Paramod-into index: 166 leaves, 1.12+/-0.535 terms/leaf
% # -------------------------------------------------
% # User time : 0.312 s
% # System time : 0.014 s
% # Total time : 0.326 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.57 CPU 0.65 WC
% FINAL PrfWatch: 0.57 CPU 0.65 WC
% SZS output end Solution for /tmp/SystemOnTPTP20674/SWV142+1.tptp
%
%------------------------------------------------------------------------------