TSTP Solution File: SWV135+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV135+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:35:28 EST 2010
% Result : Theorem 1.62s
% Output : Solution 1.62s
% 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/SystemOnTPTP19897/SWV135+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP19897/SWV135+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP19897/SWV135+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 19993
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 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(5, axiom,gt(n2,n0),file('/tmp/SRASS.s.p', gt_2_0)).
% fof(17, axiom,![X1]:![X2]:(gt(X2,X1)=>leq(X1,X2)),file('/tmp/SRASS.s.p', leq_gt1)).
% 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))=>leq(n0,pv1325)),file('/tmp/SRASS.s.p', gauss_array_0005)).
% 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))=>leq(n0,pv1325))),inference(assume_negation,[status(cth)],[85])).
% fof(92, plain,![X1]:![X2]:![X3]:((~(leq(X1,X2))|~(leq(X2,X3)))|leq(X1,X3)),inference(fof_nnf,[status(thm)],[2])).
% fof(93, plain,![X4]:![X5]:![X6]:((~(leq(X4,X5))|~(leq(X5,X6)))|leq(X4,X6)),inference(variable_rename,[status(thm)],[92])).
% cnf(94,plain,(leq(X1,X2)|~leq(X3,X2)|~leq(X1,X3)),inference(split_conjunct,[status(thm)],[93])).
% cnf(99,plain,(gt(n2,n0)),inference(split_conjunct,[status(thm)],[5])).
% fof(126, plain,![X1]:![X2]:(~(gt(X2,X1))|leq(X1,X2)),inference(fof_nnf,[status(thm)],[17])).
% fof(127, plain,![X3]:![X4]:(~(gt(X4,X3))|leq(X3,X4)),inference(variable_rename,[status(thm)],[126])).
% cnf(128,plain,(leq(X1,X2)|~gt(X2,X1)),inference(split_conjunct,[status(thm)],[127])).
% 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))&~(leq(n0,pv1325))),inference(fof_nnf,[status(thm)],[86])).
% cnf(375,negated_conjecture,(~leq(n0,pv1325)),inference(split_conjunct,[status(thm)],[374])).
% cnf(380,negated_conjecture,(leq(n2,pv1325)),inference(split_conjunct,[status(thm)],[374])).
% cnf(482,plain,(leq(n0,n2)),inference(spm,[status(thm)],[128,99,theory(equality)])).
% cnf(503,negated_conjecture,(leq(X1,pv1325)|~leq(X1,n2)),inference(spm,[status(thm)],[94,380,theory(equality)])).
% cnf(10192,negated_conjecture,(~leq(n0,n2)),inference(spm,[status(thm)],[375,503,theory(equality)])).
% cnf(10277,negated_conjecture,($false),inference(rw,[status(thm)],[10192,482,theory(equality)])).
% cnf(10278,negated_conjecture,($false),inference(cn,[status(thm)],[10277,theory(equality)])).
% cnf(10279,negated_conjecture,($false),10278,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 474
% # ...of these trivial : 5
% # ...subsumed : 20
% # ...remaining for further processing: 449
% # Other redundant clauses eliminated : 9
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 5714
% # ...of the previous two non-trivial : 5584
% # Contextual simplify-reflections : 0
% # Paramodulations : 5701
% # Factorizations : 2
% # Equation resolutions : 11
% # Current number of processed clauses: 248
% # Positive orientable unit clauses: 72
% # Positive unorientable unit clauses: 5
% # Negative unit clauses : 17
% # Non-unit-clauses : 154
% # Current number of unprocessed clauses: 5508
% # ...number of literals in the above : 34406
% # Clause-clause subsumption calls (NU) : 3723
% # Rec. Clause-clause subsumption calls : 1301
% # Unit Clause-clause subsumption calls : 110
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 41
% # Indexed BW rewrite successes : 21
% # Backwards rewriting index: 272 leaves, 1.24+/-1.421 terms/leaf
% # Paramod-from index: 106 leaves, 1.04+/-0.191 terms/leaf
% # Paramod-into index: 168 leaves, 1.12+/-0.537 terms/leaf
% # -------------------------------------------------
% # User time : 0.312 s
% # System time : 0.021 s
% # Total time : 0.333 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.60 CPU 0.67 WC
% FINAL PrfWatch: 0.60 CPU 0.67 WC
% SZS output end Solution for /tmp/SystemOnTPTP19897/SWV135+1.tptp
%
%------------------------------------------------------------------------------