%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV406+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 : art02.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:56:07 EST 2010
% Result : Theorem 1.02s
% Output : Solution 1.02s
% 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/SystemOnTPTP25714/SWV406+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP25714/SWV406+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP25714/SWV406+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 25810
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:(less_than(X1,X2)|less_than(X2,X1)),file('/tmp/SRASS.s.p', totality)).
% fof(4, axiom,![X1]:![X2]:![X3]:![X4]:![X5]:(less_than(X5,X4)=>(check_cpq(triple(X1,insert_slb(X2,pair(X4,X5)),X3))<=>check_cpq(triple(X1,X2,X3)))),file('/tmp/SRASS.s.p', ax37)).
% fof(5, 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(8, axiom,![X1]:![X2]:![X3]:![X4]:![X5]:(strictly_less_than(X4,X5)=>(check_cpq(triple(X1,insert_slb(X2,pair(X4,X5)),X3))<=>~($true))),file('/tmp/SRASS.s.p', ax38)).
% fof(14, 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(42, conjecture,![X1]:(![X2]:![X3]:(check_cpq(triple(X2,X1,X3))<=>![X4]:![X5]:(pair_in_list(X1,X4,X5)=>less_than(X5,X4)))=>![X6]:![X7]:![X8]:![X9]:(check_cpq(triple(X6,insert_slb(X1,pair(X8,X9)),X7))<=>![X10]:![X11]:(pair_in_list(insert_slb(X1,pair(X8,X9)),X10,X11)=>less_than(X11,X10)))),file('/tmp/SRASS.s.p', l42_co)).
% fof(43, negated_conjecture,~(![X1]:(![X2]:![X3]:(check_cpq(triple(X2,X1,X3))<=>![X4]:![X5]:(pair_in_list(X1,X4,X5)=>less_than(X5,X4)))=>![X6]:![X7]:![X8]:![X9]:(check_cpq(triple(X6,insert_slb(X1,pair(X8,X9)),X7))<=>![X10]:![X11]:(pair_in_list(insert_slb(X1,pair(X8,X9)),X10,X11)=>less_than(X11,X10))))),inference(assume_negation,[status(cth)],[42])).
% fof(44, plain,![X1]:![X2]:![X3]:![X4]:![X5]:(strictly_less_than(X4,X5)=>~(check_cpq(triple(X1,insert_slb(X2,pair(X4,X5)),X3)))),inference(fof_simplification,[status(thm)],[8,theory(equality)])).
% fof(46, plain,![X1]:![X2]:(strictly_less_than(X1,X2)<=>(less_than(X1,X2)&~(less_than(X2,X1)))),inference(fof_simplification,[status(thm)],[14,theory(equality)])).
% fof(56, plain,![X3]:![X4]:(less_than(X3,X4)|less_than(X4,X3)),inference(variable_rename,[status(thm)],[2])).
% cnf(57,plain,(less_than(X1,X2)|less_than(X2,X1)),inference(split_conjunct,[status(thm)],[56])).
% fof(60, plain,![X1]:![X2]:![X3]:![X4]:![X5]:(~(less_than(X5,X4))|((~(check_cpq(triple(X1,insert_slb(X2,pair(X4,X5)),X3)))|check_cpq(triple(X1,X2,X3)))&(~(check_cpq(triple(X1,X2,X3)))|check_cpq(triple(X1,insert_slb(X2,pair(X4,X5)),X3))))),inference(fof_nnf,[status(thm)],[4])).
% fof(61, plain,![X6]:![X7]:![X8]:![X9]:![X10]:(~(less_than(X10,X9))|((~(check_cpq(triple(X6,insert_slb(X7,pair(X9,X10)),X8)))|check_cpq(triple(X6,X7,X8)))&(~(check_cpq(triple(X6,X7,X8)))|check_cpq(triple(X6,insert_slb(X7,pair(X9,X10)),X8))))),inference(variable_rename,[status(thm)],[60])).
% fof(62, plain,![X6]:![X7]:![X8]:![X9]:![X10]:(((~(check_cpq(triple(X6,insert_slb(X7,pair(X9,X10)),X8)))|check_cpq(triple(X6,X7,X8)))|~(less_than(X10,X9)))&((~(check_cpq(triple(X6,X7,X8)))|check_cpq(triple(X6,insert_slb(X7,pair(X9,X10)),X8)))|~(less_than(X10,X9)))),inference(distribute,[status(thm)],[61])).
% cnf(63,plain,(check_cpq(triple(X3,insert_slb(X4,pair(X2,X1)),X5))|~less_than(X1,X2)|~check_cpq(triple(X3,X4,X5))),inference(split_conjunct,[status(thm)],[62])).
% cnf(64,plain,(check_cpq(triple(X3,X4,X5))|~less_than(X1,X2)|~check_cpq(triple(X3,insert_slb(X4,pair(X2,X1)),X5))),inference(split_conjunct,[status(thm)],[62])).
% fof(65, 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)],[5])).
% fof(66, 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)],[65])).
% fof(67, 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)],[66])).
% cnf(68,plain,(pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5)|X3!=X5|X2!=X4),inference(split_conjunct,[status(thm)],[67])).
% cnf(69,plain,(pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5)|~pair_in_list(X1,X4,X5)),inference(split_conjunct,[status(thm)],[67])).
% cnf(70,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)],[67])).
% cnf(71,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)],[67])).
% fof(77, plain,![X1]:![X2]:![X3]:![X4]:![X5]:(~(strictly_less_than(X4,X5))|~(check_cpq(triple(X1,insert_slb(X2,pair(X4,X5)),X3)))),inference(fof_nnf,[status(thm)],[44])).
% fof(78, plain,![X6]:![X7]:![X8]:![X9]:![X10]:(~(strictly_less_than(X9,X10))|~(check_cpq(triple(X6,insert_slb(X7,pair(X9,X10)),X8)))),inference(variable_rename,[status(thm)],[77])).
% cnf(79,plain,(~check_cpq(triple(X1,insert_slb(X2,pair(X3,X4)),X5))|~strictly_less_than(X3,X4)),inference(split_conjunct,[status(thm)],[78])).
% fof(94, 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)],[46])).
% fof(95, 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)],[94])).
% fof(96, 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)],[95])).
% cnf(97,plain,(strictly_less_than(X1,X2)|less_than(X2,X1)|~less_than(X1,X2)),inference(split_conjunct,[status(thm)],[96])).
% fof(170, negated_conjecture,?[X1]:(![X2]:![X3]:((~(check_cpq(triple(X2,X1,X3)))|![X4]:![X5]:(~(pair_in_list(X1,X4,X5))|less_than(X5,X4)))&(?[X4]:?[X5]:(pair_in_list(X1,X4,X5)&~(less_than(X5,X4)))|check_cpq(triple(X2,X1,X3))))&?[X6]:?[X7]:?[X8]:?[X9]:((~(check_cpq(triple(X6,insert_slb(X1,pair(X8,X9)),X7)))|?[X10]:?[X11]:(pair_in_list(insert_slb(X1,pair(X8,X9)),X10,X11)&~(less_than(X11,X10))))&(check_cpq(triple(X6,insert_slb(X1,pair(X8,X9)),X7))|![X10]:![X11]:(~(pair_in_list(insert_slb(X1,pair(X8,X9)),X10,X11))|less_than(X11,X10))))),inference(fof_nnf,[status(thm)],[43])).
% fof(171, negated_conjecture,?[X12]:(![X13]:![X14]:((~(check_cpq(triple(X13,X12,X14)))|![X15]:![X16]:(~(pair_in_list(X12,X15,X16))|less_than(X16,X15)))&(?[X17]:?[X18]:(pair_in_list(X12,X17,X18)&~(less_than(X18,X17)))|check_cpq(triple(X13,X12,X14))))&?[X19]:?[X20]:?[X21]:?[X22]:((~(check_cpq(triple(X19,insert_slb(X12,pair(X21,X22)),X20)))|?[X23]:?[X24]:(pair_in_list(insert_slb(X12,pair(X21,X22)),X23,X24)&~(less_than(X24,X23))))&(check_cpq(triple(X19,insert_slb(X12,pair(X21,X22)),X20))|![X25]:![X26]:(~(pair_in_list(insert_slb(X12,pair(X21,X22)),X25,X26))|less_than(X26,X25))))),inference(variable_rename,[status(thm)],[170])).
% fof(172, negated_conjecture,(![X13]:![X14]:((~(check_cpq(triple(X13,esk1_0,X14)))|![X15]:![X16]:(~(pair_in_list(esk1_0,X15,X16))|less_than(X16,X15)))&((pair_in_list(esk1_0,esk2_2(X13,X14),esk3_2(X13,X14))&~(less_than(esk3_2(X13,X14),esk2_2(X13,X14))))|check_cpq(triple(X13,esk1_0,X14))))&((~(check_cpq(triple(esk4_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk5_0)))|(pair_in_list(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk8_0,esk9_0)&~(less_than(esk9_0,esk8_0))))&(check_cpq(triple(esk4_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk5_0))|![X25]:![X26]:(~(pair_in_list(insert_slb(esk1_0,pair(esk6_0,esk7_0)),X25,X26))|less_than(X26,X25))))),inference(skolemize,[status(esa)],[171])).
% fof(173, negated_conjecture,![X13]:![X14]:![X15]:![X16]:![X25]:![X26]:((((~(pair_in_list(insert_slb(esk1_0,pair(esk6_0,esk7_0)),X25,X26))|less_than(X26,X25))|check_cpq(triple(esk4_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk5_0)))&(~(check_cpq(triple(esk4_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk5_0)))|(pair_in_list(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk8_0,esk9_0)&~(less_than(esk9_0,esk8_0)))))&(((~(pair_in_list(esk1_0,X15,X16))|less_than(X16,X15))|~(check_cpq(triple(X13,esk1_0,X14))))&((pair_in_list(esk1_0,esk2_2(X13,X14),esk3_2(X13,X14))&~(less_than(esk3_2(X13,X14),esk2_2(X13,X14))))|check_cpq(triple(X13,esk1_0,X14))))),inference(shift_quantors,[status(thm)],[172])).
% fof(174, negated_conjecture,![X13]:![X14]:![X15]:![X16]:![X25]:![X26]:((((~(pair_in_list(insert_slb(esk1_0,pair(esk6_0,esk7_0)),X25,X26))|less_than(X26,X25))|check_cpq(triple(esk4_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk5_0)))&((pair_in_list(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk8_0,esk9_0)|~(check_cpq(triple(esk4_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk5_0))))&(~(less_than(esk9_0,esk8_0))|~(check_cpq(triple(esk4_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk5_0))))))&(((~(pair_in_list(esk1_0,X15,X16))|less_than(X16,X15))|~(check_cpq(triple(X13,esk1_0,X14))))&((pair_in_list(esk1_0,esk2_2(X13,X14),esk3_2(X13,X14))|check_cpq(triple(X13,esk1_0,X14)))&(~(less_than(esk3_2(X13,X14),esk2_2(X13,X14)))|check_cpq(triple(X13,esk1_0,X14)))))),inference(distribute,[status(thm)],[173])).
% cnf(175,negated_conjecture,(check_cpq(triple(X1,esk1_0,X2))|~less_than(esk3_2(X1,X2),esk2_2(X1,X2))),inference(split_conjunct,[status(thm)],[174])).
% cnf(176,negated_conjecture,(check_cpq(triple(X1,esk1_0,X2))|pair_in_list(esk1_0,esk2_2(X1,X2),esk3_2(X1,X2))),inference(split_conjunct,[status(thm)],[174])).
% cnf(177,negated_conjecture,(less_than(X3,X4)|~check_cpq(triple(X1,esk1_0,X2))|~pair_in_list(esk1_0,X4,X3)),inference(split_conjunct,[status(thm)],[174])).
% cnf(178,negated_conjecture,(~check_cpq(triple(esk4_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk5_0))|~less_than(esk9_0,esk8_0)),inference(split_conjunct,[status(thm)],[174])).
% cnf(179,negated_conjecture,(pair_in_list(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk8_0,esk9_0)|~check_cpq(triple(esk4_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk5_0))),inference(split_conjunct,[status(thm)],[174])).
% cnf(180,negated_conjecture,(check_cpq(triple(esk4_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk5_0))|less_than(X1,X2)|~pair_in_list(insert_slb(esk1_0,pair(esk6_0,esk7_0)),X2,X1)),inference(split_conjunct,[status(thm)],[174])).
% cnf(183,plain,(strictly_less_than(X1,X2)|less_than(X2,X1)),inference(csr,[status(thm)],[97,57])).
% cnf(184,plain,(pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X3)|X2!=X4),inference(er,[status(thm)],[68,theory(equality)])).
% cnf(185,plain,(pair_in_list(insert_slb(X1,pair(X2,X3)),X2,X3)),inference(er,[status(thm)],[184,theory(equality)])).
% cnf(210,negated_conjecture,(check_cpq(triple(esk4_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk5_0))|less_than(X1,X2)|~pair_in_list(esk1_0,X2,X1)),inference(spm,[status(thm)],[180,69,theory(equality)])).
% cnf(211,negated_conjecture,(check_cpq(triple(esk4_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk5_0))|less_than(esk7_0,esk6_0)),inference(spm,[status(thm)],[180,185,theory(equality)])).
% cnf(220,negated_conjecture,(~less_than(esk9_0,esk8_0)|~check_cpq(triple(esk4_0,esk1_0,esk5_0))|~less_than(esk7_0,esk6_0)),inference(spm,[status(thm)],[178,63,theory(equality)])).
% cnf(221,negated_conjecture,(pair_in_list(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk8_0,esk9_0)|~check_cpq(triple(esk4_0,esk1_0,esk5_0))|~less_than(esk7_0,esk6_0)),inference(spm,[status(thm)],[179,63,theory(equality)])).
% cnf(304,negated_conjecture,(less_than(esk7_0,esk6_0)|~strictly_less_than(esk6_0,esk7_0)),inference(spm,[status(thm)],[79,211,theory(equality)])).
% cnf(325,negated_conjecture,(less_than(esk7_0,esk6_0)),inference(csr,[status(thm)],[304,183])).
% cnf(329,negated_conjecture,(~check_cpq(triple(esk4_0,esk1_0,esk5_0))|~less_than(esk9_0,esk8_0)|$false),inference(rw,[status(thm)],[220,325,theory(equality)])).
% cnf(330,negated_conjecture,(~check_cpq(triple(esk4_0,esk1_0,esk5_0))|~less_than(esk9_0,esk8_0)),inference(cn,[status(thm)],[329,theory(equality)])).
% cnf(455,negated_conjecture,(pair_in_list(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk8_0,esk9_0)|~check_cpq(triple(esk4_0,esk1_0,esk5_0))|$false),inference(rw,[status(thm)],[221,325,theory(equality)])).
% cnf(456,negated_conjecture,(pair_in_list(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk8_0,esk9_0)|~check_cpq(triple(esk4_0,esk1_0,esk5_0))),inference(cn,[status(thm)],[455,theory(equality)])).
% cnf(457,negated_conjecture,(esk7_0=esk9_0|pair_in_list(esk1_0,esk8_0,esk9_0)|~check_cpq(triple(esk4_0,esk1_0,esk5_0))),inference(spm,[status(thm)],[70,456,theory(equality)])).
% cnf(458,negated_conjecture,(esk6_0=esk8_0|pair_in_list(esk1_0,esk8_0,esk9_0)|~check_cpq(triple(esk4_0,esk1_0,esk5_0))),inference(spm,[status(thm)],[71,456,theory(equality)])).
% cnf(669,negated_conjecture,(check_cpq(triple(esk4_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk5_0))|less_than(esk3_2(X1,X2),esk2_2(X1,X2))|check_cpq(triple(X1,esk1_0,X2))),inference(spm,[status(thm)],[210,176,theory(equality)])).
% cnf(998,negated_conjecture,(check_cpq(triple(esk4_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk5_0))|check_cpq(triple(X1,esk1_0,X2))),inference(csr,[status(thm)],[669,175])).
% cnf(1002,negated_conjecture,(check_cpq(triple(esk4_0,esk1_0,esk5_0))|check_cpq(triple(X1,esk1_0,X2))|~less_than(esk7_0,esk6_0)),inference(spm,[status(thm)],[64,998,theory(equality)])).
% cnf(1003,negated_conjecture,(check_cpq(triple(X1,esk1_0,X2))|~less_than(esk9_0,esk8_0)),inference(spm,[status(thm)],[178,998,theory(equality)])).
% cnf(1005,negated_conjecture,(check_cpq(triple(esk4_0,esk1_0,esk5_0))|check_cpq(triple(X1,esk1_0,X2))|$false),inference(rw,[status(thm)],[1002,325,theory(equality)])).
% cnf(1006,negated_conjecture,(check_cpq(triple(esk4_0,esk1_0,esk5_0))|check_cpq(triple(X1,esk1_0,X2))),inference(cn,[status(thm)],[1005,theory(equality)])).
% cnf(1007,negated_conjecture,(~less_than(esk9_0,esk8_0)),inference(spm,[status(thm)],[330,1003,theory(equality)])).
% cnf(1316,negated_conjecture,(check_cpq(triple(esk4_0,esk1_0,esk5_0))),inference(ef,[status(thm)],[1006,theory(equality)])).
% cnf(1324,negated_conjecture,(less_than(X1,X2)|~pair_in_list(esk1_0,X2,X1)),inference(spm,[status(thm)],[177,1316,theory(equality)])).
% cnf(1325,negated_conjecture,(esk8_0=esk6_0|pair_in_list(esk1_0,esk8_0,esk9_0)|$false),inference(rw,[status(thm)],[458,1316,theory(equality)])).
% cnf(1326,negated_conjecture,(esk8_0=esk6_0|pair_in_list(esk1_0,esk8_0,esk9_0)),inference(cn,[status(thm)],[1325,theory(equality)])).
% cnf(1331,negated_conjecture,(esk9_0=esk7_0|pair_in_list(esk1_0,esk8_0,esk9_0)|$false),inference(rw,[status(thm)],[457,1316,theory(equality)])).
% cnf(1332,negated_conjecture,(esk9_0=esk7_0|pair_in_list(esk1_0,esk8_0,esk9_0)),inference(cn,[status(thm)],[1331,theory(equality)])).
% cnf(1357,negated_conjecture,(less_than(esk9_0,esk8_0)|esk9_0=esk7_0),inference(spm,[status(thm)],[1324,1332,theory(equality)])).
% cnf(1360,negated_conjecture,(esk9_0=esk7_0),inference(sr,[status(thm)],[1357,1007,theory(equality)])).
% cnf(1375,negated_conjecture,(~less_than(esk7_0,esk8_0)),inference(rw,[status(thm)],[1007,1360,theory(equality)])).
% cnf(1377,negated_conjecture,(esk8_0=esk6_0|pair_in_list(esk1_0,esk8_0,esk7_0)),inference(rw,[status(thm)],[1326,1360,theory(equality)])).
% cnf(1512,negated_conjecture,(less_than(esk7_0,esk8_0)|esk8_0=esk6_0),inference(spm,[status(thm)],[1324,1377,theory(equality)])).
% cnf(1513,negated_conjecture,(esk8_0=esk6_0),inference(sr,[status(thm)],[1512,1375,theory(equality)])).
% cnf(1518,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1375,1513,theory(equality)]),325,theory(equality)])).
% cnf(1519,negated_conjecture,($false),inference(cn,[status(thm)],[1518,theory(equality)])).
% cnf(1520,negated_conjecture,($false),1519,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 353
% # ...of these trivial : 3
% # ...subsumed : 142
% # ...remaining for further processing: 208
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 4
% # Backward-rewritten : 34
% # Generated clauses : 984
% # ...of the previous two non-trivial : 815
% # Contextual simplify-reflections : 73
% # Paramodulations : 922
% # Factorizations : 60
% # Equation resolutions : 3
% # Current number of processed clauses: 114
% # Positive orientable unit clauses: 21
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 9
% # Non-unit-clauses : 84
% # Current number of unprocessed clauses: 414
% # ...number of literals in the above : 1885
% # Clause-clause subsumption calls (NU) : 4781
% # Rec. Clause-clause subsumption calls : 3730
% # Unit Clause-clause subsumption calls : 41
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 14
% # Indexed BW rewrite successes : 5
% # Backwards rewriting index: 135 leaves, 1.83+/-1.766 terms/leaf
% # Paramod-from index: 60 leaves, 1.37+/-1.197 terms/leaf
% # Paramod-into index: 118 leaves, 1.65+/-1.602 terms/leaf
% # -------------------------------------------------
% # User time : 0.071 s
% # System time : 0.006 s
% # Total time : 0.077 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.18 CPU 0.27 WC
% FINAL PrfWatch: 0.18 CPU 0.27 WC
% SZS output end Solution for /tmp/SystemOnTPTP25714/SWV406+1.tptp
%
%------------------------------------------------------------------------------