%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV396+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 : art05.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:53:57 EST 2010
% Result : Theorem 1.23s
% Output : Solution 1.23s
% 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/SystemOnTPTP31141/SWV396+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP31141/SWV396+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31141/SWV396+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 31237
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, 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(2, axiom,![X1]:![X2]:![X3]:remove_slb(insert_slb(X1,pair(X2,X3)),X2)=X1,file('/tmp/SRASS.s.p', ax24)).
% fof(3, axiom,![X1]:![X2]:![X3]:![X4]:((~(X2=X3)&contains_slb(X1,X3))=>remove_slb(insert_slb(X1,pair(X2,X4)),X3)=insert_slb(remove_slb(X1,X3),pair(X2,X4))),file('/tmp/SRASS.s.p', ax25)).
% fof(8, axiom,![X1]:![X2]:![X3]:(~(ok(triple(X1,X2,X3)))=>X3=bad),file('/tmp/SRASS.s.p', ax41)).
% fof(9, 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(11, 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(12, axiom,![X1]:![X2]:![X3]:lookup_slb(insert_slb(X1,pair(X2,X3)),X2)=X3,file('/tmp/SRASS.s.p', ax26)).
% fof(14, axiom,![X1]:![X2]:(less_than(X1,X2)|less_than(X2,X1)),file('/tmp/SRASS.s.p', totality)).
% fof(18, axiom,![X1]:![X2]:(ok(triple(X1,X2,bad))<=>~($true)),file('/tmp/SRASS.s.p', ax40)).
% fof(19, axiom,![X1]:![X2]:![X3]:![X4]:((contains_slb(X2,X4)&strictly_less_than(X4,lookup_slb(X2,X4)))=>remove_cpq(triple(X1,X2,X3),X4)=triple(remove_pqp(X1,X4),remove_slb(X2,X4),bad)),file('/tmp/SRASS.s.p', ax45)).
% fof(20, axiom,![X1]:![X2]:![X3]:![X4]:(~(contains_slb(X2,X4))=>remove_cpq(triple(X1,X2,X3),X4)=triple(X1,X2,bad)),file('/tmp/SRASS.s.p', ax43)).
% fof(22, axiom,![X1]:![X2]:![X3]:![X4]:((contains_slb(X2,X4)&less_than(lookup_slb(X2,X4),X4))=>remove_cpq(triple(X1,X2,X3),X4)=triple(remove_pqp(X1,X4),remove_slb(X2,X4),X3)),file('/tmp/SRASS.s.p', ax44)).
% fof(23, axiom,![X1]:![X2]:![X3]:![X4]:((~(X2=X3)&contains_slb(X1,X3))=>lookup_slb(insert_slb(X1,pair(X2,X4)),X3)=lookup_slb(X1,X3)),file('/tmp/SRASS.s.p', ax27)).
% fof(42, conjecture,![X1]:(![X2]:![X3]:![X4]:![X5]:(((pair_in_list(X1,X4,X5)&strictly_less_than(X4,X5))&ok(remove_cpq(triple(X2,X1,X3),X4)))=>pair_in_list(remove_slb(X1,X4),X4,X5))=>![X6]:![X7]:![X8]:![X9]:![X10]:![X11]:(((pair_in_list(insert_slb(X1,pair(X10,X11)),X8,X9)&strictly_less_than(X8,X9))&ok(remove_cpq(triple(X6,insert_slb(X1,pair(X10,X11)),X7),X8)))=>pair_in_list(remove_slb(insert_slb(X1,pair(X10,X11)),X8),X8,X9))),file('/tmp/SRASS.s.p', l32_co)).
% fof(43, negated_conjecture,~(![X1]:(![X2]:![X3]:![X4]:![X5]:(((pair_in_list(X1,X4,X5)&strictly_less_than(X4,X5))&ok(remove_cpq(triple(X2,X1,X3),X4)))=>pair_in_list(remove_slb(X1,X4),X4,X5))=>![X6]:![X7]:![X8]:![X9]:![X10]:![X11]:(((pair_in_list(insert_slb(X1,pair(X10,X11)),X8,X9)&strictly_less_than(X8,X9))&ok(remove_cpq(triple(X6,insert_slb(X1,pair(X10,X11)),X7),X8)))=>pair_in_list(remove_slb(insert_slb(X1,pair(X10,X11)),X8),X8,X9)))),inference(assume_negation,[status(cth)],[42])).
% fof(46, plain,![X1]:![X2]:![X3]:(~(ok(triple(X1,X2,X3)))=>X3=bad),inference(fof_simplification,[status(thm)],[8,theory(equality)])).
% fof(47, plain,![X1]:![X2]:(strictly_less_than(X1,X2)<=>(less_than(X1,X2)&~(less_than(X2,X1)))),inference(fof_simplification,[status(thm)],[11,theory(equality)])).
% fof(48, plain,![X1]:![X2]:~(ok(triple(X1,X2,bad))),inference(fof_simplification,[status(thm)],[18,theory(equality)])).
% fof(49, plain,![X1]:![X2]:![X3]:![X4]:(~(contains_slb(X2,X4))=>remove_cpq(triple(X1,X2,X3),X4)=triple(X1,X2,bad)),inference(fof_simplification,[status(thm)],[20,theory(equality)])).
% fof(53, 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)],[1])).
% fof(54, 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)],[53])).
% fof(55, 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)],[54])).
% cnf(57,plain,(pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5)|~pair_in_list(X1,X4,X5)),inference(split_conjunct,[status(thm)],[55])).
% cnf(58,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)],[55])).
% cnf(59,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)],[55])).
% fof(60, plain,![X4]:![X5]:![X6]:remove_slb(insert_slb(X4,pair(X5,X6)),X5)=X4,inference(variable_rename,[status(thm)],[2])).
% cnf(61,plain,(remove_slb(insert_slb(X1,pair(X2,X3)),X2)=X1),inference(split_conjunct,[status(thm)],[60])).
% fof(62, plain,![X1]:![X2]:![X3]:![X4]:((X2=X3|~(contains_slb(X1,X3)))|remove_slb(insert_slb(X1,pair(X2,X4)),X3)=insert_slb(remove_slb(X1,X3),pair(X2,X4))),inference(fof_nnf,[status(thm)],[3])).
% fof(63, plain,![X5]:![X6]:![X7]:![X8]:((X6=X7|~(contains_slb(X5,X7)))|remove_slb(insert_slb(X5,pair(X6,X8)),X7)=insert_slb(remove_slb(X5,X7),pair(X6,X8))),inference(variable_rename,[status(thm)],[62])).
% cnf(64,plain,(remove_slb(insert_slb(X1,pair(X2,X3)),X4)=insert_slb(remove_slb(X1,X4),pair(X2,X3))|X2=X4|~contains_slb(X1,X4)),inference(split_conjunct,[status(thm)],[63])).
% fof(75, plain,![X1]:![X2]:![X3]:(ok(triple(X1,X2,X3))|X3=bad),inference(fof_nnf,[status(thm)],[46])).
% fof(76, plain,![X4]:![X5]:![X6]:(ok(triple(X4,X5,X6))|X6=bad),inference(variable_rename,[status(thm)],[75])).
% cnf(77,plain,(X1=bad|ok(triple(X2,X3,X1))),inference(split_conjunct,[status(thm)],[76])).
% fof(78, 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)],[9])).
% fof(79, 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)],[78])).
% fof(80, 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)],[79])).
% cnf(83,plain,(X1=X2|contains_slb(X3,X2)|~contains_slb(insert_slb(X3,pair(X1,X4)),X2)),inference(split_conjunct,[status(thm)],[80])).
% fof(89, 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)],[47])).
% fof(90, 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)],[89])).
% fof(91, 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)],[90])).
% cnf(92,plain,(strictly_less_than(X1,X2)|less_than(X2,X1)|~less_than(X1,X2)),inference(split_conjunct,[status(thm)],[91])).
% fof(95, plain,![X4]:![X5]:![X6]:lookup_slb(insert_slb(X4,pair(X5,X6)),X5)=X6,inference(variable_rename,[status(thm)],[12])).
% cnf(96,plain,(lookup_slb(insert_slb(X1,pair(X2,X3)),X2)=X3),inference(split_conjunct,[status(thm)],[95])).
% fof(100, plain,![X3]:![X4]:(less_than(X3,X4)|less_than(X4,X3)),inference(variable_rename,[status(thm)],[14])).
% cnf(101,plain,(less_than(X1,X2)|less_than(X2,X1)),inference(split_conjunct,[status(thm)],[100])).
% fof(109, plain,![X3]:![X4]:~(ok(triple(X3,X4,bad))),inference(variable_rename,[status(thm)],[48])).
% cnf(110,plain,(~ok(triple(X1,X2,bad))),inference(split_conjunct,[status(thm)],[109])).
% fof(111, plain,![X1]:![X2]:![X3]:![X4]:((~(contains_slb(X2,X4))|~(strictly_less_than(X4,lookup_slb(X2,X4))))|remove_cpq(triple(X1,X2,X3),X4)=triple(remove_pqp(X1,X4),remove_slb(X2,X4),bad)),inference(fof_nnf,[status(thm)],[19])).
% fof(112, plain,![X5]:![X6]:![X7]:![X8]:((~(contains_slb(X6,X8))|~(strictly_less_than(X8,lookup_slb(X6,X8))))|remove_cpq(triple(X5,X6,X7),X8)=triple(remove_pqp(X5,X8),remove_slb(X6,X8),bad)),inference(variable_rename,[status(thm)],[111])).
% cnf(113,plain,(remove_cpq(triple(X1,X2,X3),X4)=triple(remove_pqp(X1,X4),remove_slb(X2,X4),bad)|~strictly_less_than(X4,lookup_slb(X2,X4))|~contains_slb(X2,X4)),inference(split_conjunct,[status(thm)],[112])).
% fof(114, plain,![X1]:![X2]:![X3]:![X4]:(contains_slb(X2,X4)|remove_cpq(triple(X1,X2,X3),X4)=triple(X1,X2,bad)),inference(fof_nnf,[status(thm)],[49])).
% fof(115, plain,![X5]:![X6]:![X7]:![X8]:(contains_slb(X6,X8)|remove_cpq(triple(X5,X6,X7),X8)=triple(X5,X6,bad)),inference(variable_rename,[status(thm)],[114])).
% cnf(116,plain,(remove_cpq(triple(X1,X2,X3),X4)=triple(X1,X2,bad)|contains_slb(X2,X4)),inference(split_conjunct,[status(thm)],[115])).
% fof(120, plain,![X1]:![X2]:![X3]:![X4]:((~(contains_slb(X2,X4))|~(less_than(lookup_slb(X2,X4),X4)))|remove_cpq(triple(X1,X2,X3),X4)=triple(remove_pqp(X1,X4),remove_slb(X2,X4),X3)),inference(fof_nnf,[status(thm)],[22])).
% fof(121, plain,![X5]:![X6]:![X7]:![X8]:((~(contains_slb(X6,X8))|~(less_than(lookup_slb(X6,X8),X8)))|remove_cpq(triple(X5,X6,X7),X8)=triple(remove_pqp(X5,X8),remove_slb(X6,X8),X7)),inference(variable_rename,[status(thm)],[120])).
% cnf(122,plain,(remove_cpq(triple(X1,X2,X3),X4)=triple(remove_pqp(X1,X4),remove_slb(X2,X4),X3)|~less_than(lookup_slb(X2,X4),X4)|~contains_slb(X2,X4)),inference(split_conjunct,[status(thm)],[121])).
% fof(123, plain,![X1]:![X2]:![X3]:![X4]:((X2=X3|~(contains_slb(X1,X3)))|lookup_slb(insert_slb(X1,pair(X2,X4)),X3)=lookup_slb(X1,X3)),inference(fof_nnf,[status(thm)],[23])).
% fof(124, plain,![X5]:![X6]:![X7]:![X8]:((X6=X7|~(contains_slb(X5,X7)))|lookup_slb(insert_slb(X5,pair(X6,X8)),X7)=lookup_slb(X5,X7)),inference(variable_rename,[status(thm)],[123])).
% cnf(125,plain,(lookup_slb(insert_slb(X1,pair(X2,X3)),X4)=lookup_slb(X1,X4)|X2=X4|~contains_slb(X1,X4)),inference(split_conjunct,[status(thm)],[124])).
% fof(170, negated_conjecture,?[X1]:(![X2]:![X3]:![X4]:![X5]:(((~(pair_in_list(X1,X4,X5))|~(strictly_less_than(X4,X5)))|~(ok(remove_cpq(triple(X2,X1,X3),X4))))|pair_in_list(remove_slb(X1,X4),X4,X5))&?[X6]:?[X7]:?[X8]:?[X9]:?[X10]:?[X11]:(((pair_in_list(insert_slb(X1,pair(X10,X11)),X8,X9)&strictly_less_than(X8,X9))&ok(remove_cpq(triple(X6,insert_slb(X1,pair(X10,X11)),X7),X8)))&~(pair_in_list(remove_slb(insert_slb(X1,pair(X10,X11)),X8),X8,X9)))),inference(fof_nnf,[status(thm)],[43])).
% fof(171, negated_conjecture,?[X12]:(![X13]:![X14]:![X15]:![X16]:(((~(pair_in_list(X12,X15,X16))|~(strictly_less_than(X15,X16)))|~(ok(remove_cpq(triple(X13,X12,X14),X15))))|pair_in_list(remove_slb(X12,X15),X15,X16))&?[X17]:?[X18]:?[X19]:?[X20]:?[X21]:?[X22]:(((pair_in_list(insert_slb(X12,pair(X21,X22)),X19,X20)&strictly_less_than(X19,X20))&ok(remove_cpq(triple(X17,insert_slb(X12,pair(X21,X22)),X18),X19)))&~(pair_in_list(remove_slb(insert_slb(X12,pair(X21,X22)),X19),X19,X20)))),inference(variable_rename,[status(thm)],[170])).
% fof(172, negated_conjecture,(![X13]:![X14]:![X15]:![X16]:(((~(pair_in_list(esk1_0,X15,X16))|~(strictly_less_than(X15,X16)))|~(ok(remove_cpq(triple(X13,esk1_0,X14),X15))))|pair_in_list(remove_slb(esk1_0,X15),X15,X16))&(((pair_in_list(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0,esk5_0)&strictly_less_than(esk4_0,esk5_0))&ok(remove_cpq(triple(esk2_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk3_0),esk4_0)))&~(pair_in_list(remove_slb(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0),esk4_0,esk5_0)))),inference(skolemize,[status(esa)],[171])).
% fof(173, negated_conjecture,![X13]:![X14]:![X15]:![X16]:((((~(pair_in_list(esk1_0,X15,X16))|~(strictly_less_than(X15,X16)))|~(ok(remove_cpq(triple(X13,esk1_0,X14),X15))))|pair_in_list(remove_slb(esk1_0,X15),X15,X16))&(((pair_in_list(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0,esk5_0)&strictly_less_than(esk4_0,esk5_0))&ok(remove_cpq(triple(esk2_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk3_0),esk4_0)))&~(pair_in_list(remove_slb(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0),esk4_0,esk5_0)))),inference(shift_quantors,[status(thm)],[172])).
% cnf(174,negated_conjecture,(~pair_in_list(remove_slb(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0),esk4_0,esk5_0)),inference(split_conjunct,[status(thm)],[173])).
% cnf(175,negated_conjecture,(ok(remove_cpq(triple(esk2_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk3_0),esk4_0))),inference(split_conjunct,[status(thm)],[173])).
% cnf(176,negated_conjecture,(strictly_less_than(esk4_0,esk5_0)),inference(split_conjunct,[status(thm)],[173])).
% cnf(177,negated_conjecture,(pair_in_list(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0,esk5_0)),inference(split_conjunct,[status(thm)],[173])).
% cnf(178,negated_conjecture,(pair_in_list(remove_slb(esk1_0,X1),X1,X2)|~ok(remove_cpq(triple(X3,esk1_0,X4),X1))|~strictly_less_than(X1,X2)|~pair_in_list(esk1_0,X1,X2)),inference(split_conjunct,[status(thm)],[173])).
% cnf(186,plain,(less_than(X2,X1)|strictly_less_than(X1,X2)),inference(csr,[status(thm)],[92,101])).
% cnf(203,negated_conjecture,(esk7_0=esk5_0|pair_in_list(esk1_0,esk4_0,esk5_0)),inference(spm,[status(thm)],[58,177,theory(equality)])).
% cnf(205,negated_conjecture,(esk6_0=esk4_0|pair_in_list(esk1_0,esk4_0,esk5_0)),inference(spm,[status(thm)],[59,177,theory(equality)])).
% cnf(209,negated_conjecture,(ok(triple(esk2_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),bad))|contains_slb(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0)),inference(spm,[status(thm)],[175,116,theory(equality)])).
% cnf(210,negated_conjecture,(contains_slb(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0)),inference(sr,[status(thm)],[209,110,theory(equality)])).
% cnf(242,negated_conjecture,(esk6_0=esk4_0|~pair_in_list(insert_slb(remove_slb(esk1_0,esk4_0),pair(esk6_0,esk7_0)),esk4_0,esk5_0)|~contains_slb(esk1_0,esk4_0)),inference(spm,[status(thm)],[174,64,theory(equality)])).
% cnf(266,plain,(~ok(remove_cpq(triple(X1,X3,X4),X2))|~strictly_less_than(X2,lookup_slb(X3,X2))|~contains_slb(X3,X2)),inference(spm,[status(thm)],[110,113,theory(equality)])).
% cnf(273,plain,(bad=X1|ok(remove_cpq(triple(X2,X4,X1),X3))|~less_than(lookup_slb(X4,X3),X3)|~contains_slb(X4,X3)),inference(spm,[status(thm)],[77,122,theory(equality)])).
% cnf(298,negated_conjecture,(esk6_0=esk4_0|contains_slb(esk1_0,esk4_0)),inference(spm,[status(thm)],[83,210,theory(equality)])).
% cnf(337,negated_conjecture,(esk6_0=esk4_0|~pair_in_list(insert_slb(remove_slb(esk1_0,esk4_0),pair(esk6_0,esk7_0)),esk4_0,esk5_0)),inference(csr,[status(thm)],[242,298])).
% cnf(338,negated_conjecture,(esk6_0=esk4_0|~pair_in_list(remove_slb(esk1_0,esk4_0),esk4_0,esk5_0)),inference(spm,[status(thm)],[337,57,theory(equality)])).
% cnf(388,negated_conjecture,(~strictly_less_than(esk4_0,lookup_slb(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0))|~contains_slb(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0)),inference(spm,[status(thm)],[266,175,theory(equality)])).
% cnf(389,negated_conjecture,(~strictly_less_than(esk4_0,lookup_slb(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0))|$false),inference(rw,[status(thm)],[388,210,theory(equality)])).
% cnf(390,negated_conjecture,(~strictly_less_than(esk4_0,lookup_slb(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0))),inference(cn,[status(thm)],[389,theory(equality)])).
% cnf(391,negated_conjecture,(esk6_0=esk4_0|~strictly_less_than(esk4_0,lookup_slb(esk1_0,esk4_0))|~contains_slb(esk1_0,esk4_0)),inference(spm,[status(thm)],[390,125,theory(equality)])).
% cnf(398,negated_conjecture,(esk6_0=esk4_0|~strictly_less_than(esk4_0,lookup_slb(esk1_0,esk4_0))),inference(csr,[status(thm)],[391,298])).
% cnf(399,negated_conjecture,(esk6_0=esk4_0|less_than(lookup_slb(esk1_0,esk4_0),esk4_0)),inference(spm,[status(thm)],[398,186,theory(equality)])).
% cnf(3409,negated_conjecture,(bad=X1|ok(remove_cpq(triple(X2,esk1_0,X1),esk4_0))|esk6_0=esk4_0|~contains_slb(esk1_0,esk4_0)),inference(spm,[status(thm)],[273,399,theory(equality)])).
% cnf(3456,negated_conjecture,(esk6_0=esk4_0|bad=X1|ok(remove_cpq(triple(X2,esk1_0,X1),esk4_0))),inference(csr,[status(thm)],[3409,298])).
% cnf(3457,negated_conjecture,(pair_in_list(remove_slb(esk1_0,esk4_0),esk4_0,X1)|esk6_0=esk4_0|bad=X3|~strictly_less_than(esk4_0,X1)|~pair_in_list(esk1_0,esk4_0,X1)),inference(spm,[status(thm)],[178,3456,theory(equality)])).
% cnf(3554,negated_conjecture,(esk6_0=esk4_0|bad=X1|pair_in_list(remove_slb(esk1_0,esk4_0),esk4_0,esk5_0)|~strictly_less_than(esk4_0,esk5_0)),inference(spm,[status(thm)],[3457,205,theory(equality)])).
% cnf(3556,negated_conjecture,(esk6_0=esk4_0|bad=X1|pair_in_list(remove_slb(esk1_0,esk4_0),esk4_0,esk5_0)|$false),inference(rw,[status(thm)],[3554,176,theory(equality)])).
% cnf(3557,negated_conjecture,(esk6_0=esk4_0|bad=X1|pair_in_list(remove_slb(esk1_0,esk4_0),esk4_0,esk5_0)),inference(cn,[status(thm)],[3556,theory(equality)])).
% cnf(3560,negated_conjecture,(esk6_0=esk4_0|bad=X1),inference(csr,[status(thm)],[3557,338])).
% cnf(4056,negated_conjecture,(esk6_0=esk4_0|X2=X1),inference(spm,[status(thm)],[3560,3560,theory(equality)])).
% cnf(4094,negated_conjecture,(esk6_0=esk4_0|X4!=esk6_0),inference(ef,[status(thm)],[4056,theory(equality)])).
% cnf(5420,negated_conjecture,(esk6_0=esk4_0),inference(csr,[status(thm)],[4094,4056])).
% cnf(5444,negated_conjecture,(~strictly_less_than(esk4_0,esk7_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[390,5420,theory(equality)]),96,theory(equality)])).
% cnf(5455,negated_conjecture,(~pair_in_list(esk1_0,esk4_0,esk5_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[174,5420,theory(equality)]),61,theory(equality)])).
% cnf(5500,negated_conjecture,(esk7_0=esk5_0),inference(sr,[status(thm)],[203,5455,theory(equality)])).
% cnf(5503,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[5444,5500,theory(equality)]),176,theory(equality)])).
% cnf(5504,negated_conjecture,($false),inference(cn,[status(thm)],[5503,theory(equality)])).
% cnf(5505,negated_conjecture,($false),5504,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 525
% # ...of these trivial : 7
% # ...subsumed : 315
% # ...remaining for further processing: 203
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 4
% # Backward-rewritten : 40
% # Generated clauses : 4493
% # ...of the previous two non-trivial : 4147
% # Contextual simplify-reflections : 227
% # Paramodulations : 4365
% # Factorizations : 125
% # Equation resolutions : 3
% # Current number of processed clauses: 156
% # Positive orientable unit clauses: 20
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 11
% # Non-unit-clauses : 125
% # Current number of unprocessed clauses: 1358
% # ...number of literals in the above : 6793
% # Clause-clause subsumption calls (NU) : 7365
% # Rec. Clause-clause subsumption calls : 5619
% # Unit Clause-clause subsumption calls : 47
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 10
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 175 leaves, 2.35+/-2.618 terms/leaf
% # Paramod-from index: 73 leaves, 1.45+/-1.228 terms/leaf
% # Paramod-into index: 150 leaves, 1.98+/-2.180 terms/leaf
% # -------------------------------------------------
% # User time : 0.195 s
% # System time : 0.008 s
% # Total time : 0.203 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.37 CPU 0.46 WC
% FINAL PrfWatch: 0.37 CPU 0.46 WC
% SZS output end Solution for /tmp/SystemOnTPTP31141/SWV396+1.tptp
%
%------------------------------------------------------------------------------