TSTP Solution File: SWV138+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV138+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:35:55 EST 2010
% Result : Theorem 1.65s
% Output : Solution 1.65s
% 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/SystemOnTPTP21613/SWV138+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP21613/SWV138+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21613/SWV138+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 21709
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.03 WC
% # Preprocessing time : 0.032 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% 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(n2,n0),file('/tmp/SRASS.s.p', gt_2_0)).
% fof(85, conjecture,(((((((((leq(n0,s_best7)&leq(n0,s_sworst7))&leq(n0,s_worst7))&leq(n2,pv1325))&leq(s_best7,n3))&leq(s_sworst7,n3))&leq(s_worst7,n3))&leq(pv1325,n3))>(a_select2(s_values7,pv1325),a_select2(s_values7,s_best7)))=>leq(n0,pv1325)),file('/tmp/SRASS.s.p', gauss_array_0008)).
% fof(86, negated_conjecture,~((((((((((leq(n0,s_best7)&leq(n0,s_sworst7))&leq(n0,s_worst7))&leq(n2,pv1325))&leq(s_best7,n3))&leq(s_sworst7,n3))&leq(s_worst7,n3))&leq(pv1325,n3))>(a_select2(s_values7,pv1325),a_select2(s_values7,s_best7)))=>leq(n0,pv1325))),inference(assume_negation,[status(cth)],[85])).
% fof(97, plain,![X1]:![X2]:![X3]:((~(leq(X1,X2))|~(leq(X2,X3)))|leq(X1,X3)),inference(fof_nnf,[status(thm)],[4])).
% fof(98, plain,![X4]:![X5]:![X6]:((~(leq(X4,X5))|~(leq(X5,X6)))|leq(X4,X6)),inference(variable_rename,[status(thm)],[97])).
% cnf(99,plain,(leq(X1,X2)|~leq(X3,X2)|~leq(X1,X3)),inference(split_conjunct,[status(thm)],[98])).
% fof(100, plain,![X1]:![X2]:(~(gt(X2,X1))|leq(X1,X2)),inference(fof_nnf,[status(thm)],[5])).
% fof(101, plain,![X3]:![X4]:(~(gt(X4,X3))|leq(X3,X4)),inference(variable_rename,[status(thm)],[100])).
% cnf(102,plain,(leq(X1,X2)|~gt(X2,X1)),inference(split_conjunct,[status(thm)],[101])).
% cnf(103,plain,(gt(n2,n0)),inference(split_conjunct,[status(thm)],[6])).
% fof(374, negated_conjecture,(((((((((leq(n0,s_best7)&leq(n0,s_sworst7))&leq(n0,s_worst7))&leq(n2,pv1325))&leq(s_best7,n3))&leq(s_sworst7,n3))&leq(s_worst7,n3))&leq(pv1325,n3))>(a_select2(s_values7,pv1325),a_select2(s_values7,s_best7)))&~(leq(n0,pv1325))),inference(fof_nnf,[status(thm)],[86])).
% cnf(375,negated_conjecture,(~leq(n0,pv1325)),inference(split_conjunct,[status(thm)],[374])).
% cnf(381,negated_conjecture,(leq(n2,pv1325)),inference(split_conjunct,[status(thm)],[374])).
% cnf(478,plain,(leq(n0,n2)),inference(spm,[status(thm)],[102,103,theory(equality)])).
% cnf(559,negated_conjecture,(leq(X1,pv1325)|~leq(X1,n2)),inference(spm,[status(thm)],[99,381,theory(equality)])).
% cnf(10456,negated_conjecture,(~leq(n0,n2)),inference(spm,[status(thm)],[375,559,theory(equality)])).
% cnf(10539,negated_conjecture,($false),inference(rw,[status(thm)],[10456,478,theory(equality)])).
% cnf(10540,negated_conjecture,($false),inference(cn,[status(thm)],[10539,theory(equality)])).
% cnf(10541,negated_conjecture,($false),10540,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 483
% # ...of these trivial : 0
% # ...subsumed : 25
% # ...remaining for further processing: 458
% # Other redundant clauses eliminated : 7
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 5971
% # ...of the previous two non-trivial : 5824
% # Contextual simplify-reflections : 0
% # Paramodulations : 5960
% # Factorizations : 2
% # Equation resolutions : 9
% # Current number of processed clauses: 256
% # Positive orientable unit clauses: 73
% # Positive unorientable unit clauses: 5
% # Negative unit clauses : 18
% # Non-unit-clauses : 160
% # Current number of unprocessed clauses: 5741
% # ...number of literals in the above : 36260
% # Clause-clause subsumption calls (NU) : 3649
% # Rec. Clause-clause subsumption calls : 1303
% # Unit Clause-clause subsumption calls : 111
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 41
% # Indexed BW rewrite successes : 21
% # Backwards rewriting index: 280 leaves, 1.23+/-1.400 terms/leaf
% # Paramod-from index: 111 leaves, 1.03+/-0.162 terms/leaf
% # Paramod-into index: 176 leaves, 1.11+/-0.516 terms/leaf
% # -------------------------------------------------
% # User time : 0.341 s
% # System time : 0.018 s
% # Total time : 0.359 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/SystemOnTPTP21613/SWV138+1.tptp
%
%------------------------------------------------------------------------------