TSTP Solution File: SWV371+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV371+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 : 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:48:37 EST 2010
% Result : Theorem 1.05s
% Output : Solution 1.05s
% 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/SystemOnTPTP24042/SWV371+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP24042/SWV371+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP24042/SWV371+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 24138
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.018 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:(phi(findmin_cpq_eff(triple(X1,X2,X3)))=>contains_pq(i(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3)))),file('/tmp/SRASS.s.p', l7_l8)).
% fof(2, axiom,![X1]:![X2]:![X3]:(phi(findmin_cpq_eff(triple(X1,X2,X3)))=>issmallestelement_pq(i(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3)))),file('/tmp/SRASS.s.p', l7_lX)).
% fof(14, axiom,![X1]:![X2]:(pi_sharp_find_min(X1,X2)<=>(contains_pq(X1,X2)&issmallestelement_pq(X1,X2))),file('/tmp/SRASS.s.p', ax58)).
% fof(65, conjecture,![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', l7_co)).
% fof(66, negated_conjecture,~(![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(assume_negation,[status(cth)],[65])).
% fof(78, plain,![X1]:![X2]:![X3]:(~(phi(findmin_cpq_eff(triple(X1,X2,X3))))|contains_pq(i(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3)))),inference(fof_nnf,[status(thm)],[1])).
% fof(79, plain,![X4]:![X5]:![X6]:(~(phi(findmin_cpq_eff(triple(X4,X5,X6))))|contains_pq(i(triple(X4,X5,X6)),findmin_cpq_res(triple(X4,X5,X6)))),inference(variable_rename,[status(thm)],[78])).
% cnf(80,plain,(contains_pq(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)],[79])).
% fof(81, plain,![X1]:![X2]:![X3]:(~(phi(findmin_cpq_eff(triple(X1,X2,X3))))|issmallestelement_pq(i(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3)))),inference(fof_nnf,[status(thm)],[2])).
% fof(82, plain,![X4]:![X5]:![X6]:(~(phi(findmin_cpq_eff(triple(X4,X5,X6))))|issmallestelement_pq(i(triple(X4,X5,X6)),findmin_cpq_res(triple(X4,X5,X6)))),inference(variable_rename,[status(thm)],[81])).
% cnf(83,plain,(issmallestelement_pq(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)],[82])).
% fof(120, 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)],[14])).
% fof(121, 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)],[120])).
% fof(122, 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)],[121])).
% cnf(123,plain,(pi_sharp_find_min(X1,X2)|~issmallestelement_pq(X1,X2)|~contains_pq(X1,X2)),inference(split_conjunct,[status(thm)],[122])).
% fof(284, negated_conjecture,?[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)],[66])).
% fof(285, negated_conjecture,?[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)],[284])).
% fof(286, negated_conjecture,(phi(findmin_cpq_eff(triple(esk5_0,esk6_0,esk7_0)))&~(pi_sharp_find_min(i(triple(esk5_0,esk6_0,esk7_0)),findmin_cpq_res(triple(esk5_0,esk6_0,esk7_0))))),inference(skolemize,[status(esa)],[285])).
% cnf(287,negated_conjecture,(~pi_sharp_find_min(i(triple(esk5_0,esk6_0,esk7_0)),findmin_cpq_res(triple(esk5_0,esk6_0,esk7_0)))),inference(split_conjunct,[status(thm)],[286])).
% cnf(288,negated_conjecture,(phi(findmin_cpq_eff(triple(esk5_0,esk6_0,esk7_0)))),inference(split_conjunct,[status(thm)],[286])).
% cnf(326,negated_conjecture,(~issmallestelement_pq(i(triple(esk5_0,esk6_0,esk7_0)),findmin_cpq_res(triple(esk5_0,esk6_0,esk7_0)))|~contains_pq(i(triple(esk5_0,esk6_0,esk7_0)),findmin_cpq_res(triple(esk5_0,esk6_0,esk7_0)))),inference(spm,[status(thm)],[287,123,theory(equality)])).
% cnf(596,negated_conjecture,(~contains_pq(i(triple(esk5_0,esk6_0,esk7_0)),findmin_cpq_res(triple(esk5_0,esk6_0,esk7_0)))|~phi(findmin_cpq_eff(triple(esk5_0,esk6_0,esk7_0)))),inference(spm,[status(thm)],[326,83,theory(equality)])).
% cnf(597,negated_conjecture,(~contains_pq(i(triple(esk5_0,esk6_0,esk7_0)),findmin_cpq_res(triple(esk5_0,esk6_0,esk7_0)))|$false),inference(rw,[status(thm)],[596,288,theory(equality)])).
% cnf(598,negated_conjecture,(~contains_pq(i(triple(esk5_0,esk6_0,esk7_0)),findmin_cpq_res(triple(esk5_0,esk6_0,esk7_0)))),inference(cn,[status(thm)],[597,theory(equality)])).
% cnf(600,negated_conjecture,(~phi(findmin_cpq_eff(triple(esk5_0,esk6_0,esk7_0)))),inference(spm,[status(thm)],[598,80,theory(equality)])).
% cnf(601,negated_conjecture,($false),inference(rw,[status(thm)],[600,288,theory(equality)])).
% cnf(602,negated_conjecture,($false),inference(cn,[status(thm)],[601,theory(equality)])).
% cnf(603,negated_conjecture,($false),602,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 228
% # ...of these trivial : 2
% # ...subsumed : 11
% # ...remaining for further processing: 215
% # Other redundant clauses eliminated : 4
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 259
% # ...of the previous two non-trivial : 226
% # Contextual simplify-reflections : 4
% # Paramodulations : 254
% # Factorizations : 2
% # Equation resolutions : 4
% # Current number of processed clauses: 124
% # Positive orientable unit clauses: 20
% # Positive unorientable unit clauses: 2
% # Negative unit clauses : 16
% # Non-unit-clauses : 86
% # Current number of unprocessed clauses: 174
% # ...number of literals in the above : 519
% # Clause-clause subsumption calls (NU) : 357
% # Rec. Clause-clause subsumption calls : 335
% # Unit Clause-clause subsumption calls : 14
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 7
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 150 leaves, 1.59+/-1.228 terms/leaf
% # Paramod-from index: 63 leaves, 1.17+/-0.419 terms/leaf
% # Paramod-into index: 132 leaves, 1.46+/-1.164 terms/leaf
% # -------------------------------------------------
% # User time : 0.037 s
% # System time : 0.003 s
% # Total time : 0.040 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.22 WC
% FINAL PrfWatch: 0.13 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP24042/SWV371+1.tptp
%
%------------------------------------------------------------------------------