TSTP Solution File: SWV403+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV403+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 09:00:22 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/SystemOnTPTP27174/SWV403+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP27174/SWV403+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP27174/SWV403+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 27306
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:![X4]:(strictly_less_than(X4,X3)=>update_slb(insert_slb(X1,pair(X2,X4)),X3)=insert_slb(update_slb(X1,X3),pair(X2,X3))),file('/tmp/SRASS.s.p', ax29)).
% fof(2, axiom,![X1]:![X2]:![X3]:![X4]:![X5]:(pair_in_list(insert_slb(X1,pair(X2,X4)),X3,X5)<=>(pair_in_list(X1,X3,X5)|(X2=X3&X4=X5))),file('/tmp/SRASS.s.p', ax23)).
% fof(3, axiom,![X1]:![X2]:![X3]:![X4]:(less_than(X3,X4)=>update_slb(insert_slb(X1,pair(X2,X4)),X3)=insert_slb(update_slb(X1,X3),pair(X2,X4))),file('/tmp/SRASS.s.p', ax30)).
% fof(4, axiom,![X1]:![X2]:(strictly_less_than(X1,X2)<=>(less_than(X1,X2)&~(less_than(X2,X1)))),file('/tmp/SRASS.s.p', stricly_smaller_definition)).
% fof(8, axiom,![X1]:![X2]:(less_than(X1,X2)|less_than(X2,X1)),file('/tmp/SRASS.s.p', totality)).
% fof(19, conjecture,![X1]:(![X2]:![X3]:![X4]:((pair_in_list(X1,X2,X3)&strictly_less_than(X3,X4))=>pair_in_list(update_slb(X1,X4),X2,X4))=>![X5]:![X6]:![X7]:![X8]:![X9]:((pair_in_list(insert_slb(X1,pair(X8,X9)),X5,X6)&strictly_less_than(X6,X7))=>pair_in_list(update_slb(insert_slb(X1,pair(X8,X9)),X7),X5,X7))),file('/tmp/SRASS.s.p', l39_co)).
% fof(20, negated_conjecture,~(![X1]:(![X2]:![X3]:![X4]:((pair_in_list(X1,X2,X3)&strictly_less_than(X3,X4))=>pair_in_list(update_slb(X1,X4),X2,X4))=>![X5]:![X6]:![X7]:![X8]:![X9]:((pair_in_list(insert_slb(X1,pair(X8,X9)),X5,X6)&strictly_less_than(X6,X7))=>pair_in_list(update_slb(insert_slb(X1,pair(X8,X9)),X7),X5,X7)))),inference(assume_negation,[status(cth)],[19])).
% fof(21, plain,![X1]:![X2]:(strictly_less_than(X1,X2)<=>(less_than(X1,X2)&~(less_than(X2,X1)))),inference(fof_simplification,[status(thm)],[4,theory(equality)])).
% fof(25, plain,![X1]:![X2]:![X3]:![X4]:(~(strictly_less_than(X4,X3))|update_slb(insert_slb(X1,pair(X2,X4)),X3)=insert_slb(update_slb(X1,X3),pair(X2,X3))),inference(fof_nnf,[status(thm)],[1])).
% fof(26, plain,![X5]:![X6]:![X7]:![X8]:(~(strictly_less_than(X8,X7))|update_slb(insert_slb(X5,pair(X6,X8)),X7)=insert_slb(update_slb(X5,X7),pair(X6,X7))),inference(variable_rename,[status(thm)],[25])).
% cnf(27,plain,(update_slb(insert_slb(X1,pair(X2,X3)),X4)=insert_slb(update_slb(X1,X4),pair(X2,X4))|~strictly_less_than(X3,X4)),inference(split_conjunct,[status(thm)],[26])).
% fof(28, plain,![X1]:![X2]:![X3]:![X4]:![X5]:((~(pair_in_list(insert_slb(X1,pair(X2,X4)),X3,X5))|(pair_in_list(X1,X3,X5)|(X2=X3&X4=X5)))&((~(pair_in_list(X1,X3,X5))&(~(X2=X3)|~(X4=X5)))|pair_in_list(insert_slb(X1,pair(X2,X4)),X3,X5))),inference(fof_nnf,[status(thm)],[2])).
% fof(29, plain,![X6]:![X7]:![X8]:![X9]:![X10]:((~(pair_in_list(insert_slb(X6,pair(X7,X9)),X8,X10))|(pair_in_list(X6,X8,X10)|(X7=X8&X9=X10)))&((~(pair_in_list(X6,X8,X10))&(~(X7=X8)|~(X9=X10)))|pair_in_list(insert_slb(X6,pair(X7,X9)),X8,X10))),inference(variable_rename,[status(thm)],[28])).
% fof(30, plain,![X6]:![X7]:![X8]:![X9]:![X10]:((((X7=X8|pair_in_list(X6,X8,X10))|~(pair_in_list(insert_slb(X6,pair(X7,X9)),X8,X10)))&((X9=X10|pair_in_list(X6,X8,X10))|~(pair_in_list(insert_slb(X6,pair(X7,X9)),X8,X10))))&((~(pair_in_list(X6,X8,X10))|pair_in_list(insert_slb(X6,pair(X7,X9)),X8,X10))&((~(X7=X8)|~(X9=X10))|pair_in_list(insert_slb(X6,pair(X7,X9)),X8,X10)))),inference(distribute,[status(thm)],[29])).
% cnf(31,plain,(pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5)|X3!=X5|X2!=X4),inference(split_conjunct,[status(thm)],[30])).
% cnf(32,plain,(pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5)|~pair_in_list(X1,X4,X5)),inference(split_conjunct,[status(thm)],[30])).
% cnf(33,plain,(pair_in_list(X1,X4,X5)|X3=X5|~pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5)),inference(split_conjunct,[status(thm)],[30])).
% cnf(34,plain,(pair_in_list(X1,X4,X5)|X2=X4|~pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5)),inference(split_conjunct,[status(thm)],[30])).
% fof(35, plain,![X1]:![X2]:![X3]:![X4]:(~(less_than(X3,X4))|update_slb(insert_slb(X1,pair(X2,X4)),X3)=insert_slb(update_slb(X1,X3),pair(X2,X4))),inference(fof_nnf,[status(thm)],[3])).
% fof(36, plain,![X5]:![X6]:![X7]:![X8]:(~(less_than(X7,X8))|update_slb(insert_slb(X5,pair(X6,X8)),X7)=insert_slb(update_slb(X5,X7),pair(X6,X8))),inference(variable_rename,[status(thm)],[35])).
% cnf(37,plain,(update_slb(insert_slb(X1,pair(X2,X3)),X4)=insert_slb(update_slb(X1,X4),pair(X2,X3))|~less_than(X4,X3)),inference(split_conjunct,[status(thm)],[36])).
% fof(38, plain,![X1]:![X2]:((~(strictly_less_than(X1,X2))|(less_than(X1,X2)&~(less_than(X2,X1))))&((~(less_than(X1,X2))|less_than(X2,X1))|strictly_less_than(X1,X2))),inference(fof_nnf,[status(thm)],[21])).
% fof(39, plain,![X3]:![X4]:((~(strictly_less_than(X3,X4))|(less_than(X3,X4)&~(less_than(X4,X3))))&((~(less_than(X3,X4))|less_than(X4,X3))|strictly_less_than(X3,X4))),inference(variable_rename,[status(thm)],[38])).
% fof(40, plain,![X3]:![X4]:(((less_than(X3,X4)|~(strictly_less_than(X3,X4)))&(~(less_than(X4,X3))|~(strictly_less_than(X3,X4))))&((~(less_than(X3,X4))|less_than(X4,X3))|strictly_less_than(X3,X4))),inference(distribute,[status(thm)],[39])).
% cnf(41,plain,(strictly_less_than(X1,X2)|less_than(X2,X1)|~less_than(X1,X2)),inference(split_conjunct,[status(thm)],[40])).
% cnf(42,plain,(~strictly_less_than(X1,X2)|~less_than(X2,X1)),inference(split_conjunct,[status(thm)],[40])).
% fof(51, plain,![X3]:![X4]:(less_than(X3,X4)|less_than(X4,X3)),inference(variable_rename,[status(thm)],[8])).
% cnf(52,plain,(less_than(X1,X2)|less_than(X2,X1)),inference(split_conjunct,[status(thm)],[51])).
% fof(78, negated_conjecture,?[X1]:(![X2]:![X3]:![X4]:((~(pair_in_list(X1,X2,X3))|~(strictly_less_than(X3,X4)))|pair_in_list(update_slb(X1,X4),X2,X4))&?[X5]:?[X6]:?[X7]:?[X8]:?[X9]:((pair_in_list(insert_slb(X1,pair(X8,X9)),X5,X6)&strictly_less_than(X6,X7))&~(pair_in_list(update_slb(insert_slb(X1,pair(X8,X9)),X7),X5,X7)))),inference(fof_nnf,[status(thm)],[20])).
% fof(79, negated_conjecture,?[X10]:(![X11]:![X12]:![X13]:((~(pair_in_list(X10,X11,X12))|~(strictly_less_than(X12,X13)))|pair_in_list(update_slb(X10,X13),X11,X13))&?[X14]:?[X15]:?[X16]:?[X17]:?[X18]:((pair_in_list(insert_slb(X10,pair(X17,X18)),X14,X15)&strictly_less_than(X15,X16))&~(pair_in_list(update_slb(insert_slb(X10,pair(X17,X18)),X16),X14,X16)))),inference(variable_rename,[status(thm)],[78])).
% fof(80, negated_conjecture,(![X11]:![X12]:![X13]:((~(pair_in_list(esk1_0,X11,X12))|~(strictly_less_than(X12,X13)))|pair_in_list(update_slb(esk1_0,X13),X11,X13))&((pair_in_list(insert_slb(esk1_0,pair(esk5_0,esk6_0)),esk2_0,esk3_0)&strictly_less_than(esk3_0,esk4_0))&~(pair_in_list(update_slb(insert_slb(esk1_0,pair(esk5_0,esk6_0)),esk4_0),esk2_0,esk4_0)))),inference(skolemize,[status(esa)],[79])).
% fof(81, negated_conjecture,![X11]:![X12]:![X13]:(((~(pair_in_list(esk1_0,X11,X12))|~(strictly_less_than(X12,X13)))|pair_in_list(update_slb(esk1_0,X13),X11,X13))&((pair_in_list(insert_slb(esk1_0,pair(esk5_0,esk6_0)),esk2_0,esk3_0)&strictly_less_than(esk3_0,esk4_0))&~(pair_in_list(update_slb(insert_slb(esk1_0,pair(esk5_0,esk6_0)),esk4_0),esk2_0,esk4_0)))),inference(shift_quantors,[status(thm)],[80])).
% cnf(82,negated_conjecture,(~pair_in_list(update_slb(insert_slb(esk1_0,pair(esk5_0,esk6_0)),esk4_0),esk2_0,esk4_0)),inference(split_conjunct,[status(thm)],[81])).
% cnf(83,negated_conjecture,(strictly_less_than(esk3_0,esk4_0)),inference(split_conjunct,[status(thm)],[81])).
% cnf(84,negated_conjecture,(pair_in_list(insert_slb(esk1_0,pair(esk5_0,esk6_0)),esk2_0,esk3_0)),inference(split_conjunct,[status(thm)],[81])).
% cnf(85,negated_conjecture,(pair_in_list(update_slb(esk1_0,X1),X2,X1)|~strictly_less_than(X3,X1)|~pair_in_list(esk1_0,X2,X3)),inference(split_conjunct,[status(thm)],[81])).
% cnf(87,plain,(less_than(X2,X1)|strictly_less_than(X1,X2)),inference(csr,[status(thm)],[41,52])).
% cnf(88,plain,(pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X3)|X2!=X4),inference(er,[status(thm)],[31,theory(equality)])).
% cnf(89,plain,(pair_in_list(insert_slb(X1,pair(X2,X3)),X2,X3)),inference(er,[status(thm)],[88,theory(equality)])).
% cnf(95,negated_conjecture,(~less_than(esk4_0,esk3_0)),inference(spm,[status(thm)],[42,83,theory(equality)])).
% cnf(102,negated_conjecture,(~pair_in_list(insert_slb(update_slb(esk1_0,esk4_0),pair(esk5_0,esk6_0)),esk2_0,esk4_0)|~less_than(esk4_0,esk6_0)),inference(spm,[status(thm)],[82,37,theory(equality)])).
% cnf(104,negated_conjecture,(esk6_0=esk3_0|pair_in_list(esk1_0,esk2_0,esk3_0)),inference(spm,[status(thm)],[33,84,theory(equality)])).
% cnf(106,negated_conjecture,(esk5_0=esk2_0|pair_in_list(esk1_0,esk2_0,esk3_0)),inference(spm,[status(thm)],[34,84,theory(equality)])).
% cnf(123,negated_conjecture,(~pair_in_list(insert_slb(update_slb(esk1_0,esk4_0),pair(esk5_0,esk4_0)),esk2_0,esk4_0)|~strictly_less_than(esk6_0,esk4_0)),inference(spm,[status(thm)],[82,27,theory(equality)])).
% cnf(129,negated_conjecture,(pair_in_list(update_slb(esk1_0,X1),esk2_0,X1)|esk6_0=esk3_0|~strictly_less_than(esk3_0,X1)),inference(spm,[status(thm)],[85,104,theory(equality)])).
% cnf(130,negated_conjecture,(pair_in_list(update_slb(esk1_0,X1),esk2_0,X1)|esk2_0=esk5_0|~strictly_less_than(esk3_0,X1)),inference(spm,[status(thm)],[85,106,theory(equality)])).
% cnf(141,negated_conjecture,(~strictly_less_than(esk6_0,esk4_0)|~pair_in_list(update_slb(esk1_0,esk4_0),esk2_0,esk4_0)),inference(spm,[status(thm)],[123,32,theory(equality)])).
% cnf(142,negated_conjecture,(esk6_0=esk3_0|~strictly_less_than(esk6_0,esk4_0)|~strictly_less_than(esk3_0,esk4_0)),inference(spm,[status(thm)],[141,129,theory(equality)])).
% cnf(143,negated_conjecture,(esk2_0=esk5_0|~strictly_less_than(esk6_0,esk4_0)|~strictly_less_than(esk3_0,esk4_0)),inference(spm,[status(thm)],[141,130,theory(equality)])).
% cnf(144,negated_conjecture,(esk6_0=esk3_0|~strictly_less_than(esk6_0,esk4_0)|$false),inference(rw,[status(thm)],[142,83,theory(equality)])).
% cnf(145,negated_conjecture,(esk6_0=esk3_0|~strictly_less_than(esk6_0,esk4_0)),inference(cn,[status(thm)],[144,theory(equality)])).
% cnf(146,negated_conjecture,(esk2_0=esk5_0|~strictly_less_than(esk6_0,esk4_0)|$false),inference(rw,[status(thm)],[143,83,theory(equality)])).
% cnf(147,negated_conjecture,(esk2_0=esk5_0|~strictly_less_than(esk6_0,esk4_0)),inference(cn,[status(thm)],[146,theory(equality)])).
% cnf(148,negated_conjecture,(esk6_0=esk3_0|less_than(esk4_0,esk6_0)),inference(spm,[status(thm)],[145,87,theory(equality)])).
% cnf(149,negated_conjecture,(esk2_0=esk5_0|less_than(esk4_0,esk6_0)),inference(spm,[status(thm)],[147,87,theory(equality)])).
% cnf(162,negated_conjecture,(~less_than(esk4_0,esk6_0)|~pair_in_list(update_slb(esk1_0,esk4_0),esk2_0,esk4_0)),inference(spm,[status(thm)],[102,32,theory(equality)])).
% cnf(163,negated_conjecture,(esk6_0=esk3_0|~less_than(esk4_0,esk6_0)|~strictly_less_than(esk3_0,esk4_0)),inference(spm,[status(thm)],[162,129,theory(equality)])).
% cnf(165,negated_conjecture,(esk6_0=esk3_0|~less_than(esk4_0,esk6_0)|$false),inference(rw,[status(thm)],[163,83,theory(equality)])).
% cnf(166,negated_conjecture,(esk6_0=esk3_0|~less_than(esk4_0,esk6_0)),inference(cn,[status(thm)],[165,theory(equality)])).
% cnf(169,negated_conjecture,(esk6_0=esk3_0),inference(csr,[status(thm)],[166,148])).
% cnf(174,negated_conjecture,(esk2_0=esk5_0|less_than(esk4_0,esk3_0)),inference(rw,[status(thm)],[149,169,theory(equality)])).
% cnf(175,negated_conjecture,(esk2_0=esk5_0),inference(sr,[status(thm)],[174,95,theory(equality)])).
% cnf(183,negated_conjecture,(~pair_in_list(insert_slb(update_slb(esk1_0,esk4_0),pair(esk5_0,esk4_0)),esk2_0,esk4_0)|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[123,169,theory(equality)]),83,theory(equality)])).
% cnf(184,negated_conjecture,(~pair_in_list(insert_slb(update_slb(esk1_0,esk4_0),pair(esk5_0,esk4_0)),esk2_0,esk4_0)),inference(cn,[status(thm)],[183,theory(equality)])).
% cnf(202,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[184,175,theory(equality)]),89,theory(equality)])).
% cnf(203,negated_conjecture,($false),inference(cn,[status(thm)],[202,theory(equality)])).
% cnf(204,negated_conjecture,($false),203,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 89
% # ...of these trivial : 3
% # ...subsumed : 3
% # ...remaining for further processing: 83
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 16
% # Generated clauses : 64
% # ...of the previous two non-trivial : 59
% # Contextual simplify-reflections : 2
% # Paramodulations : 60
% # Factorizations : 2
% # Equation resolutions : 3
% # Current number of processed clauses: 35
% # Positive orientable unit clauses: 12
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 18
% # Current number of unprocessed clauses: 25
% # ...number of literals in the above : 71
% # Clause-clause subsumption calls (NU) : 37
% # Rec. Clause-clause subsumption calls : 32
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 11
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 43 leaves, 1.60+/-1.223 terms/leaf
% # Paramod-from index: 17 leaves, 1.35+/-0.588 terms/leaf
% # Paramod-into index: 35 leaves, 1.51+/-1.079 terms/leaf
% # -------------------------------------------------
% # User time : 0.015 s
% # System time : 0.002 s
% # Total time : 0.017 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.19 WC
% FINAL PrfWatch: 0.11 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP27174/SWV403+1.tptp
%
%------------------------------------------------------------------------------