TSTP Solution File: SWV370+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV370+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 : art09.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:31 EST 2010
% Result : Theorem 1.13s
% Output : Solution 1.13s
% 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/SystemOnTPTP20950/SWV370+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP20950/SWV370+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP20950/SWV370+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 21047
% 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(1, axiom,![X1]:![X2]:![X3]:![X4]:![X5]:i(triple(X1,insert_slb(X2,pair(X4,X5)),X3))=insert_pq(i(triple(X1,X2,X3)),X4),file('/tmp/SRASS.s.p', ax55)).
% fof(2, axiom,![X1]:![X2]:![X3]:![X4]:(contains_cpq(triple(X1,X2,X3),X4)<=>contains_slb(X2,X4)),file('/tmp/SRASS.s.p', ax39)).
% fof(5, axiom,![X1]:![X2]:![X3]:![X4]:(contains_slb(insert_slb(X1,pair(X2,X4)),X3)<=>(contains_slb(X1,X3)|X2=X3)),file('/tmp/SRASS.s.p', ax21)).
% fof(28, axiom,![X1]:![X2]:![X3]:(contains_pq(insert_pq(X1,X2),X3)<=>(contains_pq(X1,X3)|X2=X3)),file('/tmp/SRASS.s.p', ax9)).
% fof(63, conjecture,![X1]:(![X2]:![X3]:![X4]:(contains_cpq(triple(X2,X1,X3),X4)<=>contains_pq(i(triple(X2,X1,X3)),X4))=>![X5]:![X6]:![X7]:![X8]:![X9]:(contains_cpq(triple(X5,insert_slb(X1,pair(X7,X8)),X6),X9)<=>contains_pq(i(triple(X5,insert_slb(X1,pair(X7,X8)),X6)),X9))),file('/tmp/SRASS.s.p', l6_co)).
% fof(64, negated_conjecture,~(![X1]:(![X2]:![X3]:![X4]:(contains_cpq(triple(X2,X1,X3),X4)<=>contains_pq(i(triple(X2,X1,X3)),X4))=>![X5]:![X6]:![X7]:![X8]:![X9]:(contains_cpq(triple(X5,insert_slb(X1,pair(X7,X8)),X6),X9)<=>contains_pq(i(triple(X5,insert_slb(X1,pair(X7,X8)),X6)),X9)))),inference(assume_negation,[status(cth)],[63])).
% fof(76, plain,![X6]:![X7]:![X8]:![X9]:![X10]:i(triple(X6,insert_slb(X7,pair(X9,X10)),X8))=insert_pq(i(triple(X6,X7,X8)),X9),inference(variable_rename,[status(thm)],[1])).
% cnf(77,plain,(i(triple(X1,insert_slb(X2,pair(X3,X4)),X5))=insert_pq(i(triple(X1,X2,X5)),X3)),inference(split_conjunct,[status(thm)],[76])).
% fof(78, 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)],[2])).
% fof(79, 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)],[78])).
% cnf(80,plain,(contains_cpq(triple(X1,X2,X3),X4)|~contains_slb(X2,X4)),inference(split_conjunct,[status(thm)],[79])).
% cnf(81,plain,(contains_slb(X1,X2)|~contains_cpq(triple(X3,X1,X4),X2)),inference(split_conjunct,[status(thm)],[79])).
% fof(89, plain,![X1]:![X2]:![X3]:![X4]:((~(contains_slb(insert_slb(X1,pair(X2,X4)),X3))|(contains_slb(X1,X3)|X2=X3))&((~(contains_slb(X1,X3))&~(X2=X3))|contains_slb(insert_slb(X1,pair(X2,X4)),X3))),inference(fof_nnf,[status(thm)],[5])).
% fof(90, plain,![X5]:![X6]:![X7]:![X8]:((~(contains_slb(insert_slb(X5,pair(X6,X8)),X7))|(contains_slb(X5,X7)|X6=X7))&((~(contains_slb(X5,X7))&~(X6=X7))|contains_slb(insert_slb(X5,pair(X6,X8)),X7))),inference(variable_rename,[status(thm)],[89])).
% fof(91, plain,![X5]:![X6]:![X7]:![X8]:((~(contains_slb(insert_slb(X5,pair(X6,X8)),X7))|(contains_slb(X5,X7)|X6=X7))&((~(contains_slb(X5,X7))|contains_slb(insert_slb(X5,pair(X6,X8)),X7))&(~(X6=X7)|contains_slb(insert_slb(X5,pair(X6,X8)),X7)))),inference(distribute,[status(thm)],[90])).
% cnf(92,plain,(contains_slb(insert_slb(X1,pair(X2,X3)),X4)|X2!=X4),inference(split_conjunct,[status(thm)],[91])).
% cnf(93,plain,(contains_slb(insert_slb(X1,pair(X2,X3)),X4)|~contains_slb(X1,X4)),inference(split_conjunct,[status(thm)],[91])).
% cnf(94,plain,(X1=X2|contains_slb(X3,X2)|~contains_slb(insert_slb(X3,pair(X1,X4)),X2)),inference(split_conjunct,[status(thm)],[91])).
% fof(168, plain,![X1]:![X2]:![X3]:((~(contains_pq(insert_pq(X1,X2),X3))|(contains_pq(X1,X3)|X2=X3))&((~(contains_pq(X1,X3))&~(X2=X3))|contains_pq(insert_pq(X1,X2),X3))),inference(fof_nnf,[status(thm)],[28])).
% fof(169, plain,![X4]:![X5]:![X6]:((~(contains_pq(insert_pq(X4,X5),X6))|(contains_pq(X4,X6)|X5=X6))&((~(contains_pq(X4,X6))&~(X5=X6))|contains_pq(insert_pq(X4,X5),X6))),inference(variable_rename,[status(thm)],[168])).
% fof(170, plain,![X4]:![X5]:![X6]:((~(contains_pq(insert_pq(X4,X5),X6))|(contains_pq(X4,X6)|X5=X6))&((~(contains_pq(X4,X6))|contains_pq(insert_pq(X4,X5),X6))&(~(X5=X6)|contains_pq(insert_pq(X4,X5),X6)))),inference(distribute,[status(thm)],[169])).
% cnf(171,plain,(contains_pq(insert_pq(X1,X2),X3)|X2!=X3),inference(split_conjunct,[status(thm)],[170])).
% cnf(172,plain,(contains_pq(insert_pq(X1,X2),X3)|~contains_pq(X1,X3)),inference(split_conjunct,[status(thm)],[170])).
% cnf(173,plain,(X1=X2|contains_pq(X3,X2)|~contains_pq(insert_pq(X3,X1),X2)),inference(split_conjunct,[status(thm)],[170])).
% fof(276, negated_conjecture,?[X1]:(![X2]:![X3]:![X4]:((~(contains_cpq(triple(X2,X1,X3),X4))|contains_pq(i(triple(X2,X1,X3)),X4))&(~(contains_pq(i(triple(X2,X1,X3)),X4))|contains_cpq(triple(X2,X1,X3),X4)))&?[X5]:?[X6]:?[X7]:?[X8]:?[X9]:((~(contains_cpq(triple(X5,insert_slb(X1,pair(X7,X8)),X6),X9))|~(contains_pq(i(triple(X5,insert_slb(X1,pair(X7,X8)),X6)),X9)))&(contains_cpq(triple(X5,insert_slb(X1,pair(X7,X8)),X6),X9)|contains_pq(i(triple(X5,insert_slb(X1,pair(X7,X8)),X6)),X9)))),inference(fof_nnf,[status(thm)],[64])).
% fof(277, negated_conjecture,?[X10]:(![X11]:![X12]:![X13]:((~(contains_cpq(triple(X11,X10,X12),X13))|contains_pq(i(triple(X11,X10,X12)),X13))&(~(contains_pq(i(triple(X11,X10,X12)),X13))|contains_cpq(triple(X11,X10,X12),X13)))&?[X14]:?[X15]:?[X16]:?[X17]:?[X18]:((~(contains_cpq(triple(X14,insert_slb(X10,pair(X16,X17)),X15),X18))|~(contains_pq(i(triple(X14,insert_slb(X10,pair(X16,X17)),X15)),X18)))&(contains_cpq(triple(X14,insert_slb(X10,pair(X16,X17)),X15),X18)|contains_pq(i(triple(X14,insert_slb(X10,pair(X16,X17)),X15)),X18)))),inference(variable_rename,[status(thm)],[276])).
% fof(278, negated_conjecture,(![X11]:![X12]:![X13]:((~(contains_cpq(triple(X11,esk5_0,X12),X13))|contains_pq(i(triple(X11,esk5_0,X12)),X13))&(~(contains_pq(i(triple(X11,esk5_0,X12)),X13))|contains_cpq(triple(X11,esk5_0,X12),X13)))&((~(contains_cpq(triple(esk6_0,insert_slb(esk5_0,pair(esk8_0,esk9_0)),esk7_0),esk10_0))|~(contains_pq(i(triple(esk6_0,insert_slb(esk5_0,pair(esk8_0,esk9_0)),esk7_0)),esk10_0)))&(contains_cpq(triple(esk6_0,insert_slb(esk5_0,pair(esk8_0,esk9_0)),esk7_0),esk10_0)|contains_pq(i(triple(esk6_0,insert_slb(esk5_0,pair(esk8_0,esk9_0)),esk7_0)),esk10_0)))),inference(skolemize,[status(esa)],[277])).
% fof(279, negated_conjecture,![X11]:![X12]:![X13]:(((~(contains_cpq(triple(X11,esk5_0,X12),X13))|contains_pq(i(triple(X11,esk5_0,X12)),X13))&(~(contains_pq(i(triple(X11,esk5_0,X12)),X13))|contains_cpq(triple(X11,esk5_0,X12),X13)))&((~(contains_cpq(triple(esk6_0,insert_slb(esk5_0,pair(esk8_0,esk9_0)),esk7_0),esk10_0))|~(contains_pq(i(triple(esk6_0,insert_slb(esk5_0,pair(esk8_0,esk9_0)),esk7_0)),esk10_0)))&(contains_cpq(triple(esk6_0,insert_slb(esk5_0,pair(esk8_0,esk9_0)),esk7_0),esk10_0)|contains_pq(i(triple(esk6_0,insert_slb(esk5_0,pair(esk8_0,esk9_0)),esk7_0)),esk10_0)))),inference(shift_quantors,[status(thm)],[278])).
% cnf(280,negated_conjecture,(contains_pq(i(triple(esk6_0,insert_slb(esk5_0,pair(esk8_0,esk9_0)),esk7_0)),esk10_0)|contains_cpq(triple(esk6_0,insert_slb(esk5_0,pair(esk8_0,esk9_0)),esk7_0),esk10_0)),inference(split_conjunct,[status(thm)],[279])).
% cnf(281,negated_conjecture,(~contains_pq(i(triple(esk6_0,insert_slb(esk5_0,pair(esk8_0,esk9_0)),esk7_0)),esk10_0)|~contains_cpq(triple(esk6_0,insert_slb(esk5_0,pair(esk8_0,esk9_0)),esk7_0),esk10_0)),inference(split_conjunct,[status(thm)],[279])).
% cnf(282,negated_conjecture,(contains_cpq(triple(X1,esk5_0,X2),X3)|~contains_pq(i(triple(X1,esk5_0,X2)),X3)),inference(split_conjunct,[status(thm)],[279])).
% cnf(283,negated_conjecture,(contains_pq(i(triple(X1,esk5_0,X2)),X3)|~contains_cpq(triple(X1,esk5_0,X2),X3)),inference(split_conjunct,[status(thm)],[279])).
% cnf(285,plain,(contains_pq(insert_pq(X1,X2),X2)),inference(er,[status(thm)],[171,theory(equality)])).
% cnf(286,plain,(contains_slb(insert_slb(X1,pair(X2,X3)),X2)),inference(er,[status(thm)],[92,theory(equality)])).
% cnf(311,negated_conjecture,(contains_pq(i(triple(X1,esk5_0,X2)),X3)|~contains_slb(esk5_0,X3)),inference(spm,[status(thm)],[283,80,theory(equality)])).
% cnf(319,negated_conjecture,(contains_slb(esk5_0,X1)|~contains_pq(i(triple(X2,esk5_0,X3)),X1)),inference(spm,[status(thm)],[81,282,theory(equality)])).
% cnf(323,negated_conjecture,(contains_slb(insert_slb(esk5_0,pair(esk8_0,esk9_0)),esk10_0)|contains_pq(i(triple(esk6_0,insert_slb(esk5_0,pair(esk8_0,esk9_0)),esk7_0)),esk10_0)),inference(spm,[status(thm)],[81,280,theory(equality)])).
% cnf(365,plain,(contains_pq(i(triple(X1,insert_slb(X2,pair(X4,X5)),X3)),X4)),inference(spm,[status(thm)],[285,77,theory(equality)])).
% cnf(368,plain,(contains_pq(i(triple(X1,insert_slb(X2,pair(X4,X6)),X3)),X5)|~contains_pq(i(triple(X1,X2,X3)),X5)),inference(spm,[status(thm)],[172,77,theory(equality)])).
% cnf(371,plain,(X1=X2|contains_pq(i(triple(X3,X4,X5)),X2)|~contains_pq(i(triple(X3,insert_slb(X4,pair(X1,X6)),X5)),X2)),inference(spm,[status(thm)],[173,77,theory(equality)])).
% cnf(419,negated_conjecture,(~contains_pq(i(triple(esk6_0,insert_slb(esk5_0,pair(esk8_0,esk9_0)),esk7_0)),esk10_0)|~contains_slb(insert_slb(esk5_0,pair(esk8_0,esk9_0)),esk10_0)),inference(spm,[status(thm)],[281,80,theory(equality)])).
% cnf(1231,negated_conjecture,(~contains_slb(insert_slb(esk5_0,pair(esk8_0,esk9_0)),esk10_0)|~contains_pq(i(triple(esk6_0,esk5_0,esk7_0)),esk10_0)),inference(spm,[status(thm)],[419,368,theory(equality)])).
% cnf(1241,negated_conjecture,(~contains_slb(insert_slb(esk5_0,pair(esk8_0,esk9_0)),esk10_0)|~contains_slb(esk5_0,esk10_0)),inference(spm,[status(thm)],[1231,311,theory(equality)])).
% cnf(1242,negated_conjecture,(~contains_slb(esk5_0,esk10_0)),inference(csr,[status(thm)],[1241,93])).
% cnf(1836,negated_conjecture,(esk8_0=esk10_0|contains_pq(i(triple(esk6_0,esk5_0,esk7_0)),esk10_0)|contains_slb(insert_slb(esk5_0,pair(esk8_0,esk9_0)),esk10_0)),inference(spm,[status(thm)],[371,323,theory(equality)])).
% cnf(1885,negated_conjecture,(contains_slb(esk5_0,esk10_0)|esk10_0=esk8_0|contains_slb(insert_slb(esk5_0,pair(esk8_0,esk9_0)),esk10_0)),inference(spm,[status(thm)],[319,1836,theory(equality)])).
% cnf(1887,negated_conjecture,(esk10_0=esk8_0|contains_slb(insert_slb(esk5_0,pair(esk8_0,esk9_0)),esk10_0)),inference(sr,[status(thm)],[1885,1242,theory(equality)])).
% cnf(1888,negated_conjecture,(esk8_0=esk10_0|contains_slb(esk5_0,esk10_0)),inference(spm,[status(thm)],[94,1887,theory(equality)])).
% cnf(1889,negated_conjecture,(esk10_0=esk8_0),inference(sr,[status(thm)],[1888,1242,theory(equality)])).
% cnf(1896,negated_conjecture,($false|~contains_slb(insert_slb(esk5_0,pair(esk8_0,esk9_0)),esk10_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[419,1889,theory(equality)]),365,theory(equality)])).
% cnf(1897,negated_conjecture,($false|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1896,1889,theory(equality)]),286,theory(equality)])).
% cnf(1898,negated_conjecture,($false),inference(cn,[status(thm)],[1897,theory(equality)])).
% cnf(1899,negated_conjecture,($false),1898,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 448
% # ...of these trivial : 10
% # ...subsumed : 108
% # ...remaining for further processing: 330
% # Other redundant clauses eliminated : 6
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 7
% # Generated clauses : 1343
% # ...of the previous two non-trivial : 1152
% # Contextual simplify-reflections : 40
% # Paramodulations : 1286
% # Factorizations : 52
% # Equation resolutions : 6
% # Current number of processed clauses: 231
% # Positive orientable unit clauses: 40
% # Positive unorientable unit clauses: 4
% # Negative unit clauses : 15
% # Non-unit-clauses : 172
% # Current number of unprocessed clauses: 880
% # ...number of literals in the above : 3552
% # Clause-clause subsumption calls (NU) : 3772
% # Rec. Clause-clause subsumption calls : 2958
% # Unit Clause-clause subsumption calls : 94
% # Rewrite failures with RHS unbound : 6
% # Indexed BW rewrite attempts : 42
% # Indexed BW rewrite successes : 6
% # Backwards rewriting index: 223 leaves, 2.00+/-2.082 terms/leaf
% # Paramod-from index: 102 leaves, 1.48+/-1.702 terms/leaf
% # Paramod-into index: 195 leaves, 1.85+/-2.041 terms/leaf
% # -------------------------------------------------
% # User time : 0.095 s
% # System time : 0.005 s
% # Total time : 0.100 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.19 CPU 0.29 WC
% FINAL PrfWatch: 0.19 CPU 0.29 WC
% SZS output end Solution for /tmp/SystemOnTPTP20950/SWV370+1.tptp
%
%------------------------------------------------------------------------------