TSTP Solution File: SWV417+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV417+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art07.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:58:09 EST 2010
% Result : Theorem 1.06s
% Output : Solution 1.06s
% 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/SystemOnTPTP3098/SWV417+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP3098/SWV417+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP3098/SWV417+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 3194
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.018 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:![X3]:(phi(findmin_cpq_eff(triple(X1,X2,X3)))=>pi_sharp_find_min(i(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3)))),file('/tmp/SRASS.s.p', main4_l7)).
% fof(12, axiom,![X1]:![X2]:((contains_pq(X1,X2)&issmallestelement_pq(X1,X2))=>findmin_pq_res(X1,X2)=X2),file('/tmp/SRASS.s.p', ax14)).
% fof(20, axiom,![X1]:![X2]:(pi_sharp_find_min(X1,X2)<=>(contains_pq(X1,X2)&issmallestelement_pq(X1,X2))),file('/tmp/SRASS.s.p', ax58)).
% fof(64, conjecture,![X1]:![X2]:![X3]:(pi_find_min(triple(X1,X2,X3))=>(phi(findmin_cpq_eff(triple(X1,X2,X3)))=>?[X4]:(pi_sharp_find_min(i(triple(X1,X2,X3)),X4)&findmin_cpq_res(triple(X1,X2,X3))=findmin_pq_res(i(triple(X1,X2,X3)),X4)))),file('/tmp/SRASS.s.p', co4)).
% fof(65, negated_conjecture,~(![X1]:![X2]:![X3]:(pi_find_min(triple(X1,X2,X3))=>(phi(findmin_cpq_eff(triple(X1,X2,X3)))=>?[X4]:(pi_sharp_find_min(i(triple(X1,X2,X3)),X4)&findmin_cpq_res(triple(X1,X2,X3))=findmin_pq_res(i(triple(X1,X2,X3)),X4))))),inference(assume_negation,[status(cth)],[64])).
% fof(83, plain,![X1]:![X2]:![X3]:(~(phi(findmin_cpq_eff(triple(X1,X2,X3))))|pi_sharp_find_min(i(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3)))),inference(fof_nnf,[status(thm)],[2])).
% fof(84, plain,![X4]:![X5]:![X6]:(~(phi(findmin_cpq_eff(triple(X4,X5,X6))))|pi_sharp_find_min(i(triple(X4,X5,X6)),findmin_cpq_res(triple(X4,X5,X6)))),inference(variable_rename,[status(thm)],[83])).
% cnf(85,plain,(pi_sharp_find_min(i(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3)))|~phi(findmin_cpq_eff(triple(X1,X2,X3)))),inference(split_conjunct,[status(thm)],[84])).
% fof(110, plain,![X1]:![X2]:((~(contains_pq(X1,X2))|~(issmallestelement_pq(X1,X2)))|findmin_pq_res(X1,X2)=X2),inference(fof_nnf,[status(thm)],[12])).
% fof(111, plain,![X3]:![X4]:((~(contains_pq(X3,X4))|~(issmallestelement_pq(X3,X4)))|findmin_pq_res(X3,X4)=X4),inference(variable_rename,[status(thm)],[110])).
% cnf(112,plain,(findmin_pq_res(X1,X2)=X2|~issmallestelement_pq(X1,X2)|~contains_pq(X1,X2)),inference(split_conjunct,[status(thm)],[111])).
% fof(134, plain,![X1]:![X2]:((~(pi_sharp_find_min(X1,X2))|(contains_pq(X1,X2)&issmallestelement_pq(X1,X2)))&((~(contains_pq(X1,X2))|~(issmallestelement_pq(X1,X2)))|pi_sharp_find_min(X1,X2))),inference(fof_nnf,[status(thm)],[20])).
% fof(135, plain,![X3]:![X4]:((~(pi_sharp_find_min(X3,X4))|(contains_pq(X3,X4)&issmallestelement_pq(X3,X4)))&((~(contains_pq(X3,X4))|~(issmallestelement_pq(X3,X4)))|pi_sharp_find_min(X3,X4))),inference(variable_rename,[status(thm)],[134])).
% fof(136, plain,![X3]:![X4]:(((contains_pq(X3,X4)|~(pi_sharp_find_min(X3,X4)))&(issmallestelement_pq(X3,X4)|~(pi_sharp_find_min(X3,X4))))&((~(contains_pq(X3,X4))|~(issmallestelement_pq(X3,X4)))|pi_sharp_find_min(X3,X4))),inference(distribute,[status(thm)],[135])).
% cnf(138,plain,(issmallestelement_pq(X1,X2)|~pi_sharp_find_min(X1,X2)),inference(split_conjunct,[status(thm)],[136])).
% cnf(139,plain,(contains_pq(X1,X2)|~pi_sharp_find_min(X1,X2)),inference(split_conjunct,[status(thm)],[136])).
% fof(280, negated_conjecture,?[X1]:?[X2]:?[X3]:(pi_find_min(triple(X1,X2,X3))&(phi(findmin_cpq_eff(triple(X1,X2,X3)))&![X4]:(~(pi_sharp_find_min(i(triple(X1,X2,X3)),X4))|~(findmin_cpq_res(triple(X1,X2,X3))=findmin_pq_res(i(triple(X1,X2,X3)),X4))))),inference(fof_nnf,[status(thm)],[65])).
% fof(281, negated_conjecture,?[X5]:?[X6]:?[X7]:(pi_find_min(triple(X5,X6,X7))&(phi(findmin_cpq_eff(triple(X5,X6,X7)))&![X8]:(~(pi_sharp_find_min(i(triple(X5,X6,X7)),X8))|~(findmin_cpq_res(triple(X5,X6,X7))=findmin_pq_res(i(triple(X5,X6,X7)),X8))))),inference(variable_rename,[status(thm)],[280])).
% fof(282, negated_conjecture,(pi_find_min(triple(esk5_0,esk6_0,esk7_0))&(phi(findmin_cpq_eff(triple(esk5_0,esk6_0,esk7_0)))&![X8]:(~(pi_sharp_find_min(i(triple(esk5_0,esk6_0,esk7_0)),X8))|~(findmin_cpq_res(triple(esk5_0,esk6_0,esk7_0))=findmin_pq_res(i(triple(esk5_0,esk6_0,esk7_0)),X8))))),inference(skolemize,[status(esa)],[281])).
% fof(283, negated_conjecture,![X8]:(((~(pi_sharp_find_min(i(triple(esk5_0,esk6_0,esk7_0)),X8))|~(findmin_cpq_res(triple(esk5_0,esk6_0,esk7_0))=findmin_pq_res(i(triple(esk5_0,esk6_0,esk7_0)),X8)))&phi(findmin_cpq_eff(triple(esk5_0,esk6_0,esk7_0))))&pi_find_min(triple(esk5_0,esk6_0,esk7_0))),inference(shift_quantors,[status(thm)],[282])).
% cnf(285,negated_conjecture,(phi(findmin_cpq_eff(triple(esk5_0,esk6_0,esk7_0)))),inference(split_conjunct,[status(thm)],[283])).
% cnf(286,negated_conjecture,(findmin_cpq_res(triple(esk5_0,esk6_0,esk7_0))!=findmin_pq_res(i(triple(esk5_0,esk6_0,esk7_0)),X1)|~pi_sharp_find_min(i(triple(esk5_0,esk6_0,esk7_0)),X1)),inference(split_conjunct,[status(thm)],[283])).
% cnf(400,negated_conjecture,(X1!=findmin_cpq_res(triple(esk5_0,esk6_0,esk7_0))|~pi_sharp_find_min(i(triple(esk5_0,esk6_0,esk7_0)),X1)|~issmallestelement_pq(i(triple(esk5_0,esk6_0,esk7_0)),X1)|~contains_pq(i(triple(esk5_0,esk6_0,esk7_0)),X1)),inference(spm,[status(thm)],[286,112,theory(equality)])).
% cnf(642,negated_conjecture,(X1!=findmin_cpq_res(triple(esk5_0,esk6_0,esk7_0))|~issmallestelement_pq(i(triple(esk5_0,esk6_0,esk7_0)),X1)|~pi_sharp_find_min(i(triple(esk5_0,esk6_0,esk7_0)),X1)),inference(csr,[status(thm)],[400,139])).
% cnf(643,negated_conjecture,(X1!=findmin_cpq_res(triple(esk5_0,esk6_0,esk7_0))|~pi_sharp_find_min(i(triple(esk5_0,esk6_0,esk7_0)),X1)),inference(csr,[status(thm)],[642,138])).
% cnf(647,negated_conjecture,(~phi(findmin_cpq_eff(triple(esk5_0,esk6_0,esk7_0)))),inference(spm,[status(thm)],[643,85,theory(equality)])).
% cnf(652,negated_conjecture,($false),inference(rw,[status(thm)],[647,285,theory(equality)])).
% cnf(653,negated_conjecture,($false),inference(cn,[status(thm)],[652,theory(equality)])).
% cnf(654,negated_conjecture,($false),653,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 238
% # ...of these trivial : 0
% # ...subsumed : 15
% # ...remaining for further processing: 223
% # Other redundant clauses eliminated : 4
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 307
% # ...of the previous two non-trivial : 267
% # Contextual simplify-reflections : 6
% # Paramodulations : 302
% # Factorizations : 2
% # Equation resolutions : 4
% # Current number of processed clauses: 132
% # Positive orientable unit clauses: 23
% # Positive unorientable unit clauses: 2
% # Negative unit clauses : 14
% # Non-unit-clauses : 93
% # Current number of unprocessed clauses: 205
% # ...number of literals in the above : 644
% # Clause-clause subsumption calls (NU) : 287
% # Rec. Clause-clause subsumption calls : 249
% # Unit Clause-clause subsumption calls : 12
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 7
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 158 leaves, 1.68+/-1.481 terms/leaf
% # Paramod-from index: 65 leaves, 1.17+/-0.414 terms/leaf
% # Paramod-into index: 136 leaves, 1.56+/-1.464 terms/leaf
% # -------------------------------------------------
% # User time : 0.039 s
% # System time : 0.003 s
% # Total time : 0.042 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.14 CPU 0.21 WC
% FINAL PrfWatch: 0.14 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP3098/SWV417+1.tptp
%
%------------------------------------------------------------------------------