TSTP Solution File: SWV132+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV132+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 : art01.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:35:05 EST 2010
% Result : Theorem 1.34s
% Output : Solution 1.34s
% 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/SystemOnTPTP3719/SWV132+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP3719/SWV132+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP3719/SWV132+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 3815
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.033 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(85, conjecture,(((((((((((((~(leq(tptp_float_0_001,pv1341))&(~(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_0002)).
% fof(86, negated_conjecture,~((((((((((((((~(leq(tptp_float_0_001,pv1341))&(~(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(88, negated_conjecture,~((((((((((((((~(leq(tptp_float_0_001,pv1341))&(~(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(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(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(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(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(419,plain,(leq(s_best7,n3)|leq(tptp_float_0_001,pv1341)|~epred2_0),inference(split_conjunct,[status(thm)],[410])).
% cnf(423,plain,(~epred2_0|~leq(tptp_float_0_001,pv1341)),inference(split_conjunct,[status(thm)],[410])).
% cnf(452,plain,(leq(tptp_float_0_001,pv1341)|leq(s_best7,n3)|$false),inference(rw,[status(thm)],[419,379,theory(equality)])).
% cnf(453,plain,(leq(tptp_float_0_001,pv1341)|leq(s_best7,n3)),inference(cn,[status(thm)],[452,theory(equality)])).
% cnf(454,plain,(leq(tptp_float_0_001,pv1341)),inference(sr,[status(thm)],[453,378,theory(equality)])).
% cnf(467,plain,($false|~leq(tptp_float_0_001,pv1341)),inference(rw,[status(thm)],[423,379,theory(equality)])).
% cnf(468,plain,($false|$false),inference(rw,[status(thm)],[467,454,theory(equality)])).
% cnf(469,plain,($false),inference(cn,[status(thm)],[468,theory(equality)])).
% cnf(470,plain,($false),469,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 35
% # ...of these trivial : 4
% # ...subsumed : 0
% # ...remaining for further processing: 31
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 0
% # ...of the previous two non-trivial : 0
% # Contextual simplify-reflections : 0
% # Paramodulations : 0
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 30
% # Positive orientable unit clauses: 27
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 170
% # ...number of literals in the above : 795
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 42 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 27 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 40 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.029 s
% # System time : 0.005 s
% # Total time : 0.034 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.17 CPU 0.22 WC
% FINAL PrfWatch: 0.17 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP3719/SWV132+1.tptp
%
%------------------------------------------------------------------------------