TSTP Solution File: SWV372+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV372+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 : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Thu Dec 30 08:53:33 EST 2010
% Result : Theorem 1.29s
% Output : Solution 1.29s
% 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/SystemOnTPTP20412/SWV372+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP20412/SWV372+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP20412/SWV372+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 20544
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.019 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:![X4]:(contains_cpq(triple(X1,X2,X3),X4)<=>contains_pq(i(triple(X1,X2,X3)),X4)),file('/tmp/SRASS.s.p', l8_li56)).
% fof(2, axiom,![X1]:![X2]:![X3]:(~(ok(triple(X1,X2,X3)))=>~(phi(triple(X1,X2,X3)))),file('/tmp/SRASS.s.p', l8_lX)).
% fof(13, axiom,![X1]:![X2]:findmin_cpq_eff(triple(X1,create_slb,X2))=triple(X1,create_slb,bad),file('/tmp/SRASS.s.p', ax46)).
% fof(15, axiom,![X1]:![X2]:![X3]:![X4]:(~(X2=create_slb)=>findmin_cpq_res(triple(X1,X2,X3))=findmin_pqp_res(X1)),file('/tmp/SRASS.s.p', ax51)).
% fof(24, axiom,![X1]:![X2]:![X3]:![X4]:(contains_cpq(triple(X1,X2,X3),X4)<=>contains_slb(X2,X4)),file('/tmp/SRASS.s.p', ax39)).
% fof(34, axiom,![X1]:![X2]:![X3]:![X4]:((~(X2=create_slb)&~(contains_slb(X2,findmin_pqp_res(X1))))=>findmin_cpq_eff(triple(X1,X2,X3))=triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)),file('/tmp/SRASS.s.p', ax47)).
% fof(58, axiom,![X1]:![X2]:(ok(triple(X1,X2,bad))<=>~($true)),file('/tmp/SRASS.s.p', ax40)).
% fof(66, conjecture,![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', l8_co)).
% fof(67, negated_conjecture,~(![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(assume_negation,[status(cth)],[66])).
% fof(68, plain,![X1]:![X2]:![X3]:(~(ok(triple(X1,X2,X3)))=>~(phi(triple(X1,X2,X3)))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(71, plain,![X1]:![X2]:![X3]:![X4]:((~(X2=create_slb)&~(contains_slb(X2,findmin_pqp_res(X1))))=>findmin_cpq_eff(triple(X1,X2,X3))=triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)),inference(fof_simplification,[status(thm)],[34,theory(equality)])).
% fof(79, plain,![X1]:![X2]:~(ok(triple(X1,X2,bad))),inference(fof_simplification,[status(thm)],[58,theory(equality)])).
% fof(81, plain,![X1]:![X2]:![X3]:![X4]:((~(contains_cpq(triple(X1,X2,X3),X4))|contains_pq(i(triple(X1,X2,X3)),X4))&(~(contains_pq(i(triple(X1,X2,X3)),X4))|contains_cpq(triple(X1,X2,X3),X4))),inference(fof_nnf,[status(thm)],[1])).
% fof(82, plain,![X5]:![X6]:![X7]:![X8]:((~(contains_cpq(triple(X5,X6,X7),X8))|contains_pq(i(triple(X5,X6,X7)),X8))&(~(contains_pq(i(triple(X5,X6,X7)),X8))|contains_cpq(triple(X5,X6,X7),X8))),inference(variable_rename,[status(thm)],[81])).
% cnf(84,plain,(contains_pq(i(triple(X1,X2,X3)),X4)|~contains_cpq(triple(X1,X2,X3),X4)),inference(split_conjunct,[status(thm)],[82])).
% fof(85, plain,![X1]:![X2]:![X3]:(ok(triple(X1,X2,X3))|~(phi(triple(X1,X2,X3)))),inference(fof_nnf,[status(thm)],[68])).
% fof(86, plain,![X4]:![X5]:![X6]:(ok(triple(X4,X5,X6))|~(phi(triple(X4,X5,X6)))),inference(variable_rename,[status(thm)],[85])).
% cnf(87,plain,(ok(triple(X1,X2,X3))|~phi(triple(X1,X2,X3))),inference(split_conjunct,[status(thm)],[86])).
% fof(113, plain,![X3]:![X4]:findmin_cpq_eff(triple(X3,create_slb,X4))=triple(X3,create_slb,bad),inference(variable_rename,[status(thm)],[13])).
% cnf(114,plain,(findmin_cpq_eff(triple(X1,create_slb,X2))=triple(X1,create_slb,bad)),inference(split_conjunct,[status(thm)],[113])).
% fof(117, plain,![X1]:![X2]:![X3]:![X4]:(X2=create_slb|findmin_cpq_res(triple(X1,X2,X3))=findmin_pqp_res(X1)),inference(fof_nnf,[status(thm)],[15])).
% fof(118, plain,![X5]:![X6]:![X7]:![X8]:(X6=create_slb|findmin_cpq_res(triple(X5,X6,X7))=findmin_pqp_res(X5)),inference(variable_rename,[status(thm)],[117])).
% cnf(119,plain,(findmin_cpq_res(triple(X1,X2,X3))=findmin_pqp_res(X1)|X2=create_slb),inference(split_conjunct,[status(thm)],[118])).
% fof(149, plain,![X1]:![X2]:![X3]:![X4]:((~(contains_cpq(triple(X1,X2,X3),X4))|contains_slb(X2,X4))&(~(contains_slb(X2,X4))|contains_cpq(triple(X1,X2,X3),X4))),inference(fof_nnf,[status(thm)],[24])).
% fof(150, plain,![X5]:![X6]:![X7]:![X8]:((~(contains_cpq(triple(X5,X6,X7),X8))|contains_slb(X6,X8))&(~(contains_slb(X6,X8))|contains_cpq(triple(X5,X6,X7),X8))),inference(variable_rename,[status(thm)],[149])).
% cnf(151,plain,(contains_cpq(triple(X1,X2,X3),X4)|~contains_slb(X2,X4)),inference(split_conjunct,[status(thm)],[150])).
% fof(195, plain,![X1]:![X2]:![X3]:![X4]:((X2=create_slb|contains_slb(X2,findmin_pqp_res(X1)))|findmin_cpq_eff(triple(X1,X2,X3))=triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)),inference(fof_nnf,[status(thm)],[71])).
% fof(196, plain,![X5]:![X6]:![X7]:![X8]:((X6=create_slb|contains_slb(X6,findmin_pqp_res(X5)))|findmin_cpq_eff(triple(X5,X6,X7))=triple(X5,update_slb(X6,findmin_pqp_res(X5)),bad)),inference(variable_rename,[status(thm)],[195])).
% cnf(197,plain,(findmin_cpq_eff(triple(X1,X2,X3))=triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)|contains_slb(X2,findmin_pqp_res(X1))|X2=create_slb),inference(split_conjunct,[status(thm)],[196])).
% fof(269, plain,![X3]:![X4]:~(ok(triple(X3,X4,bad))),inference(variable_rename,[status(thm)],[79])).
% cnf(270,plain,(~ok(triple(X1,X2,bad))),inference(split_conjunct,[status(thm)],[269])).
% fof(291, negated_conjecture,?[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)],[67])).
% fof(292, negated_conjecture,?[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)],[291])).
% fof(293, negated_conjecture,(phi(findmin_cpq_eff(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(skolemize,[status(esa)],[292])).
% cnf(294,negated_conjecture,(~contains_pq(i(triple(esk5_0,esk6_0,esk7_0)),findmin_cpq_res(triple(esk5_0,esk6_0,esk7_0)))),inference(split_conjunct,[status(thm)],[293])).
% cnf(295,negated_conjecture,(phi(findmin_cpq_eff(triple(esk5_0,esk6_0,esk7_0)))),inference(split_conjunct,[status(thm)],[293])).
% cnf(335,plain,(~phi(triple(X1,X2,bad))),inference(spm,[status(thm)],[270,87,theory(equality)])).
% cnf(360,negated_conjecture,(create_slb=esk6_0|~contains_pq(i(triple(esk5_0,esk6_0,esk7_0)),findmin_pqp_res(esk5_0))),inference(spm,[status(thm)],[294,119,theory(equality)])).
% cnf(369,plain,(contains_pq(i(triple(X1,X2,X3)),X4)|~contains_slb(X2,X4)),inference(spm,[status(thm)],[84,151,theory(equality)])).
% cnf(518,plain,(create_slb=X2|contains_slb(X2,findmin_pqp_res(X1))|~phi(findmin_cpq_eff(triple(X1,X2,X3)))),inference(spm,[status(thm)],[335,197,theory(equality)])).
% cnf(563,negated_conjecture,(create_slb=esk6_0|contains_slb(esk6_0,findmin_pqp_res(esk5_0))),inference(spm,[status(thm)],[518,295,theory(equality)])).
% cnf(569,negated_conjecture,(esk6_0=create_slb|~contains_slb(esk6_0,findmin_pqp_res(esk5_0))),inference(spm,[status(thm)],[360,369,theory(equality)])).
% cnf(580,negated_conjecture,(esk6_0=create_slb),inference(csr,[status(thm)],[569,563])).
% cnf(586,negated_conjecture,(phi(triple(esk5_0,create_slb,bad))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[295,580,theory(equality)]),114,theory(equality)])).
% cnf(587,negated_conjecture,($false),inference(sr,[status(thm)],[586,335,theory(equality)])).
% cnf(588,negated_conjecture,($false),587,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 217
% # ...of these trivial : 0
% # ...subsumed : 6
% # ...remaining for further processing: 211
% # Other redundant clauses eliminated : 4
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 4
% # Generated clauses : 247
% # ...of the previous two non-trivial : 220
% # Contextual simplify-reflections : 4
% # Paramodulations : 242
% # Factorizations : 2
% # Equation resolutions : 4
% # Current number of processed clauses: 114
% # Positive orientable unit clauses: 21
% # Positive unorientable unit clauses: 2
% # Negative unit clauses : 13
% # Non-unit-clauses : 78
% # Current number of unprocessed clauses: 182
% # ...number of literals in the above : 526
% # Clause-clause subsumption calls (NU) : 265
% # Rec. Clause-clause subsumption calls : 253
% # Unit Clause-clause subsumption calls : 10
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 8
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 134 leaves, 1.57+/-1.260 terms/leaf
% # Paramod-from index: 60 leaves, 1.20+/-0.440 terms/leaf
% # Paramod-into index: 115 leaves, 1.44+/-1.210 terms/leaf
% # -------------------------------------------------
% # User time : 0.033 s
% # System time : 0.005 s
% # Total time : 0.038 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.15 CPU 0.20 WC
% FINAL PrfWatch: 0.15 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP20412/SWV372+1.tptp
%
%------------------------------------------------------------------------------