%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV407+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 : art03.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:14 EST 2010
% Result : Theorem 29.53s
% Output : Solution 29.53s
% 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/SystemOnTPTP31446/SWV407+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP31446/SWV407+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31446/SWV407+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 31542
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% PrfWatch: 1.93 CPU 2.01 WC
% PrfWatch: 3.92 CPU 4.01 WC
% PrfWatch: 5.91 CPU 6.02 WC
% PrfWatch: 7.90 CPU 8.02 WC
% PrfWatch: 9.89 CPU 10.03 WC
% PrfWatch: 11.89 CPU 12.03 WC
% PrfWatch: 13.87 CPU 14.04 WC
% PrfWatch: 15.87 CPU 16.04 WC
% PrfWatch: 17.47 CPU 18.05 WC
% PrfWatch: 19.11 CPU 20.05 WC
% # Preprocessing time : 0.017 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 21.10 CPU 22.06 WC
% PrfWatch: 23.10 CPU 24.06 WC
% PrfWatch: 25.09 CPU 26.07 WC
% PrfWatch: 27.08 CPU 28.07 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:![X4]:(contains_cpq(triple(X1,X2,X3),X4)<=>contains_slb(X2,X4)),file('/tmp/SRASS.s.p', ax39)).
% fof(3, 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(4, axiom,![X1]:![X2]:![X3]:((less_than(X1,X2)&less_than(X2,X3))=>less_than(X1,X3)),file('/tmp/SRASS.s.p', transitivity)).
% fof(5, axiom,![X1]:![X2]:(less_than(X1,X2)|less_than(X2,X1)),file('/tmp/SRASS.s.p', totality)).
% fof(10, axiom,![X1]:![X2]:![X3]:(check_cpq(triple(X1,X2,X3))<=>![X4]:![X5]:(pair_in_list(X2,X4,X5)=>less_than(X5,X4))),file('/tmp/SRASS.s.p', l43_li4142)).
% fof(14, 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(17, axiom,![X1]:![X2]:![X3]:![X4]:((contains_slb(X2,X4)&strictly_less_than(X4,findmin_cpq_res(triple(X1,X2,X3))))=>(pair_in_list(update_slb(X2,findmin_pqp_res(X1)),X4,findmin_pqp_res(X1))|?[X5]:(pair_in_list(update_slb(X2,findmin_pqp_res(X1)),X4,X5)&less_than(findmin_pqp_res(X1),X5)))),file('/tmp/SRASS.s.p', l43_l44)).
% fof(21, axiom,![X1]:update_slb(create_slb,X1)=create_slb,file('/tmp/SRASS.s.p', ax28)).
% fof(22, axiom,![X1]:![X2]:![X3]:![X4]:(((~(X2=create_slb)&contains_slb(X2,findmin_pqp_res(X1)))&strictly_less_than(findmin_pqp_res(X1),lookup_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', ax48)).
% fof(23, 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(25, axiom,![X1]:![X2]:~(pair_in_list(create_slb,X1,X2)),file('/tmp/SRASS.s.p', ax22)).
% fof(40, axiom,![X1]:![X2]:![X3]:![X4]:(((~(X2=create_slb)&contains_slb(X2,findmin_pqp_res(X1)))&less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1)))=>findmin_cpq_eff(triple(X1,X2,X3))=triple(X1,update_slb(X2,findmin_pqp_res(X1)),X3)),file('/tmp/SRASS.s.p', ax49)).
% fof(44, conjecture,![X1]:![X2]:![X3]:(?[X4]:(contains_cpq(triple(X1,X2,X3),X4)&strictly_less_than(X4,findmin_cpq_res(triple(X1,X2,X3))))=>~(check_cpq(findmin_cpq_eff(triple(X1,X2,X3))))),file('/tmp/SRASS.s.p', l43_co)).
% fof(45, negated_conjecture,~(![X1]:![X2]:![X3]:(?[X4]:(contains_cpq(triple(X1,X2,X3),X4)&strictly_less_than(X4,findmin_cpq_res(triple(X1,X2,X3))))=>~(check_cpq(findmin_cpq_eff(triple(X1,X2,X3)))))),inference(assume_negation,[status(cth)],[44])).
% fof(46, plain,![X1]:![X2]:(strictly_less_than(X1,X2)<=>(less_than(X1,X2)&~(less_than(X2,X1)))),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(49, 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)],[23,theory(equality)])).
% fof(50, plain,![X1]:![X2]:~(pair_in_list(create_slb,X1,X2)),inference(fof_simplification,[status(thm)],[25,theory(equality)])).
% fof(55, negated_conjecture,~(![X1]:![X2]:![X3]:(?[X4]:(contains_cpq(triple(X1,X2,X3),X4)&strictly_less_than(X4,findmin_cpq_res(triple(X1,X2,X3))))=>~(check_cpq(findmin_cpq_eff(triple(X1,X2,X3)))))),inference(fof_simplification,[status(thm)],[45,theory(equality)])).
% fof(56, 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)],[1])).
% fof(57, 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)],[56])).
% cnf(59,plain,(contains_slb(X1,X2)|~contains_cpq(triple(X3,X1,X4),X2)),inference(split_conjunct,[status(thm)],[57])).
% fof(62, 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(63, 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)],[62])).
% fof(64, 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)],[63])).
% cnf(65,plain,(strictly_less_than(X1,X2)|less_than(X2,X1)|~less_than(X1,X2)),inference(split_conjunct,[status(thm)],[64])).
% cnf(66,plain,(~strictly_less_than(X1,X2)|~less_than(X2,X1)),inference(split_conjunct,[status(thm)],[64])).
% fof(68, plain,![X1]:![X2]:![X3]:((~(less_than(X1,X2))|~(less_than(X2,X3)))|less_than(X1,X3)),inference(fof_nnf,[status(thm)],[4])).
% fof(69, plain,![X4]:![X5]:![X6]:((~(less_than(X4,X5))|~(less_than(X5,X6)))|less_than(X4,X6)),inference(variable_rename,[status(thm)],[68])).
% cnf(70,plain,(less_than(X1,X2)|~less_than(X3,X2)|~less_than(X1,X3)),inference(split_conjunct,[status(thm)],[69])).
% fof(71, plain,![X3]:![X4]:(less_than(X3,X4)|less_than(X4,X3)),inference(variable_rename,[status(thm)],[5])).
% cnf(72,plain,(less_than(X1,X2)|less_than(X2,X1)),inference(split_conjunct,[status(thm)],[71])).
% fof(83, plain,![X1]:![X2]:![X3]:((~(check_cpq(triple(X1,X2,X3)))|![X4]:![X5]:(~(pair_in_list(X2,X4,X5))|less_than(X5,X4)))&(?[X4]:?[X5]:(pair_in_list(X2,X4,X5)&~(less_than(X5,X4)))|check_cpq(triple(X1,X2,X3)))),inference(fof_nnf,[status(thm)],[10])).
% fof(84, plain,![X6]:![X7]:![X8]:((~(check_cpq(triple(X6,X7,X8)))|![X9]:![X10]:(~(pair_in_list(X7,X9,X10))|less_than(X10,X9)))&(?[X11]:?[X12]:(pair_in_list(X7,X11,X12)&~(less_than(X12,X11)))|check_cpq(triple(X6,X7,X8)))),inference(variable_rename,[status(thm)],[83])).
% fof(85, plain,![X6]:![X7]:![X8]:((~(check_cpq(triple(X6,X7,X8)))|![X9]:![X10]:(~(pair_in_list(X7,X9,X10))|less_than(X10,X9)))&((pair_in_list(X7,esk1_3(X6,X7,X8),esk2_3(X6,X7,X8))&~(less_than(esk2_3(X6,X7,X8),esk1_3(X6,X7,X8))))|check_cpq(triple(X6,X7,X8)))),inference(skolemize,[status(esa)],[84])).
% fof(86, plain,![X6]:![X7]:![X8]:![X9]:![X10]:(((~(pair_in_list(X7,X9,X10))|less_than(X10,X9))|~(check_cpq(triple(X6,X7,X8))))&((pair_in_list(X7,esk1_3(X6,X7,X8),esk2_3(X6,X7,X8))&~(less_than(esk2_3(X6,X7,X8),esk1_3(X6,X7,X8))))|check_cpq(triple(X6,X7,X8)))),inference(shift_quantors,[status(thm)],[85])).
% fof(87, plain,![X6]:![X7]:![X8]:![X9]:![X10]:(((~(pair_in_list(X7,X9,X10))|less_than(X10,X9))|~(check_cpq(triple(X6,X7,X8))))&((pair_in_list(X7,esk1_3(X6,X7,X8),esk2_3(X6,X7,X8))|check_cpq(triple(X6,X7,X8)))&(~(less_than(esk2_3(X6,X7,X8),esk1_3(X6,X7,X8)))|check_cpq(triple(X6,X7,X8))))),inference(distribute,[status(thm)],[86])).
% cnf(90,plain,(less_than(X4,X5)|~check_cpq(triple(X1,X2,X3))|~pair_in_list(X2,X5,X4)),inference(split_conjunct,[status(thm)],[87])).
% fof(100, plain,![X1]:![X2]:![X3]:![X4]:(X2=create_slb|findmin_cpq_res(triple(X1,X2,X3))=findmin_pqp_res(X1)),inference(fof_nnf,[status(thm)],[14])).
% fof(101, plain,![X5]:![X6]:![X7]:![X8]:(X6=create_slb|findmin_cpq_res(triple(X5,X6,X7))=findmin_pqp_res(X5)),inference(variable_rename,[status(thm)],[100])).
% cnf(102,plain,(findmin_cpq_res(triple(X1,X2,X3))=findmin_pqp_res(X1)|X2=create_slb),inference(split_conjunct,[status(thm)],[101])).
% fof(107, plain,![X1]:![X2]:![X3]:![X4]:((~(contains_slb(X2,X4))|~(strictly_less_than(X4,findmin_cpq_res(triple(X1,X2,X3)))))|(pair_in_list(update_slb(X2,findmin_pqp_res(X1)),X4,findmin_pqp_res(X1))|?[X5]:(pair_in_list(update_slb(X2,findmin_pqp_res(X1)),X4,X5)&less_than(findmin_pqp_res(X1),X5)))),inference(fof_nnf,[status(thm)],[17])).
% fof(108, plain,![X6]:![X7]:![X8]:![X9]:((~(contains_slb(X7,X9))|~(strictly_less_than(X9,findmin_cpq_res(triple(X6,X7,X8)))))|(pair_in_list(update_slb(X7,findmin_pqp_res(X6)),X9,findmin_pqp_res(X6))|?[X10]:(pair_in_list(update_slb(X7,findmin_pqp_res(X6)),X9,X10)&less_than(findmin_pqp_res(X6),X10)))),inference(variable_rename,[status(thm)],[107])).
% fof(109, plain,![X6]:![X7]:![X8]:![X9]:((~(contains_slb(X7,X9))|~(strictly_less_than(X9,findmin_cpq_res(triple(X6,X7,X8)))))|(pair_in_list(update_slb(X7,findmin_pqp_res(X6)),X9,findmin_pqp_res(X6))|(pair_in_list(update_slb(X7,findmin_pqp_res(X6)),X9,esk3_4(X6,X7,X8,X9))&less_than(findmin_pqp_res(X6),esk3_4(X6,X7,X8,X9))))),inference(skolemize,[status(esa)],[108])).
% fof(110, plain,![X6]:![X7]:![X8]:![X9]:(((pair_in_list(update_slb(X7,findmin_pqp_res(X6)),X9,esk3_4(X6,X7,X8,X9))|pair_in_list(update_slb(X7,findmin_pqp_res(X6)),X9,findmin_pqp_res(X6)))|(~(contains_slb(X7,X9))|~(strictly_less_than(X9,findmin_cpq_res(triple(X6,X7,X8))))))&((less_than(findmin_pqp_res(X6),esk3_4(X6,X7,X8,X9))|pair_in_list(update_slb(X7,findmin_pqp_res(X6)),X9,findmin_pqp_res(X6)))|(~(contains_slb(X7,X9))|~(strictly_less_than(X9,findmin_cpq_res(triple(X6,X7,X8))))))),inference(distribute,[status(thm)],[109])).
% cnf(111,plain,(pair_in_list(update_slb(X3,findmin_pqp_res(X2)),X1,findmin_pqp_res(X2))|less_than(findmin_pqp_res(X2),esk3_4(X2,X3,X4,X1))|~strictly_less_than(X1,findmin_cpq_res(triple(X2,X3,X4)))|~contains_slb(X3,X1)),inference(split_conjunct,[status(thm)],[110])).
% cnf(112,plain,(pair_in_list(update_slb(X3,findmin_pqp_res(X2)),X1,findmin_pqp_res(X2))|pair_in_list(update_slb(X3,findmin_pqp_res(X2)),X1,esk3_4(X2,X3,X4,X1))|~strictly_less_than(X1,findmin_cpq_res(triple(X2,X3,X4)))|~contains_slb(X3,X1)),inference(split_conjunct,[status(thm)],[110])).
% fof(121, plain,![X2]:update_slb(create_slb,X2)=create_slb,inference(variable_rename,[status(thm)],[21])).
% cnf(122,plain,(update_slb(create_slb,X1)=create_slb),inference(split_conjunct,[status(thm)],[121])).
% fof(123, plain,![X1]:![X2]:![X3]:![X4]:(((X2=create_slb|~(contains_slb(X2,findmin_pqp_res(X1))))|~(strictly_less_than(findmin_pqp_res(X1),lookup_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)],[22])).
% fof(124, plain,![X5]:![X6]:![X7]:![X8]:(((X6=create_slb|~(contains_slb(X6,findmin_pqp_res(X5))))|~(strictly_less_than(findmin_pqp_res(X5),lookup_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)],[123])).
% cnf(125,plain,(findmin_cpq_eff(triple(X1,X2,X3))=triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)|X2=create_slb|~strictly_less_than(findmin_pqp_res(X1),lookup_slb(X2,findmin_pqp_res(X1)))|~contains_slb(X2,findmin_pqp_res(X1))),inference(split_conjunct,[status(thm)],[124])).
% fof(126, 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)],[49])).
% fof(127, 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)],[126])).
% cnf(128,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)],[127])).
% fof(135, plain,![X3]:![X4]:~(pair_in_list(create_slb,X3,X4)),inference(variable_rename,[status(thm)],[50])).
% cnf(136,plain,(~pair_in_list(create_slb,X1,X2)),inference(split_conjunct,[status(thm)],[135])).
% fof(176, plain,![X1]:![X2]:![X3]:![X4]:(((X2=create_slb|~(contains_slb(X2,findmin_pqp_res(X1))))|~(less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1))))|findmin_cpq_eff(triple(X1,X2,X3))=triple(X1,update_slb(X2,findmin_pqp_res(X1)),X3)),inference(fof_nnf,[status(thm)],[40])).
% fof(177, plain,![X5]:![X6]:![X7]:![X8]:(((X6=create_slb|~(contains_slb(X6,findmin_pqp_res(X5))))|~(less_than(lookup_slb(X6,findmin_pqp_res(X5)),findmin_pqp_res(X5))))|findmin_cpq_eff(triple(X5,X6,X7))=triple(X5,update_slb(X6,findmin_pqp_res(X5)),X7)),inference(variable_rename,[status(thm)],[176])).
% cnf(178,plain,(findmin_cpq_eff(triple(X1,X2,X3))=triple(X1,update_slb(X2,findmin_pqp_res(X1)),X3)|X2=create_slb|~less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1))|~contains_slb(X2,findmin_pqp_res(X1))),inference(split_conjunct,[status(thm)],[177])).
% fof(187, negated_conjecture,?[X1]:?[X2]:?[X3]:(?[X4]:(contains_cpq(triple(X1,X2,X3),X4)&strictly_less_than(X4,findmin_cpq_res(triple(X1,X2,X3))))&check_cpq(findmin_cpq_eff(triple(X1,X2,X3)))),inference(fof_nnf,[status(thm)],[55])).
% fof(188, negated_conjecture,?[X5]:?[X6]:?[X7]:(?[X8]:(contains_cpq(triple(X5,X6,X7),X8)&strictly_less_than(X8,findmin_cpq_res(triple(X5,X6,X7))))&check_cpq(findmin_cpq_eff(triple(X5,X6,X7)))),inference(variable_rename,[status(thm)],[187])).
% fof(189, negated_conjecture,((contains_cpq(triple(esk4_0,esk5_0,esk6_0),esk7_0)&strictly_less_than(esk7_0,findmin_cpq_res(triple(esk4_0,esk5_0,esk6_0))))&check_cpq(findmin_cpq_eff(triple(esk4_0,esk5_0,esk6_0)))),inference(skolemize,[status(esa)],[188])).
% cnf(190,negated_conjecture,(check_cpq(findmin_cpq_eff(triple(esk4_0,esk5_0,esk6_0)))),inference(split_conjunct,[status(thm)],[189])).
% cnf(191,negated_conjecture,(strictly_less_than(esk7_0,findmin_cpq_res(triple(esk4_0,esk5_0,esk6_0)))),inference(split_conjunct,[status(thm)],[189])).
% cnf(192,negated_conjecture,(contains_cpq(triple(esk4_0,esk5_0,esk6_0),esk7_0)),inference(split_conjunct,[status(thm)],[189])).
% cnf(194,plain,(less_than(X2,X1)|strictly_less_than(X1,X2)),inference(csr,[status(thm)],[65,72])).
% cnf(198,plain,(findmin_cpq_eff(triple(X1,X2,X3))=triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)|create_slb=X2|~strictly_less_than(findmin_pqp_res(X1),lookup_slb(X2,findmin_pqp_res(X1)))),inference(csr,[status(thm)],[125,128])).
% cnf(200,negated_conjecture,(~less_than(findmin_cpq_res(triple(esk4_0,esk5_0,esk6_0)),esk7_0)),inference(spm,[status(thm)],[66,191,theory(equality)])).
% cnf(204,negated_conjecture,(contains_slb(esk5_0,esk7_0)),inference(spm,[status(thm)],[59,192,theory(equality)])).
% cnf(206,negated_conjecture,(strictly_less_than(esk7_0,findmin_pqp_res(esk4_0))|create_slb=esk5_0),inference(spm,[status(thm)],[191,102,theory(equality)])).
% cnf(273,negated_conjecture,(check_cpq(triple(esk4_0,update_slb(esk5_0,findmin_pqp_res(esk4_0)),bad))|create_slb=esk5_0|contains_slb(esk5_0,findmin_pqp_res(esk4_0))),inference(spm,[status(thm)],[190,128,theory(equality)])).
% cnf(278,negated_conjecture,(check_cpq(triple(esk4_0,update_slb(esk5_0,findmin_pqp_res(esk4_0)),bad))|create_slb=esk5_0|~strictly_less_than(findmin_pqp_res(esk4_0),lookup_slb(esk5_0,findmin_pqp_res(esk4_0)))),inference(spm,[status(thm)],[190,198,theory(equality)])).
% cnf(302,negated_conjecture,(check_cpq(triple(esk4_0,update_slb(esk5_0,findmin_pqp_res(esk4_0)),esk6_0))|create_slb=esk5_0|~less_than(lookup_slb(esk5_0,findmin_pqp_res(esk4_0)),findmin_pqp_res(esk4_0))|~contains_slb(esk5_0,findmin_pqp_res(esk4_0))),inference(spm,[status(thm)],[190,178,theory(equality)])).
% cnf(312,plain,(pair_in_list(update_slb(X1,findmin_pqp_res(X2)),X3,findmin_pqp_res(X2))|less_than(findmin_pqp_res(X2),esk3_4(X2,X1,X4,X3))|create_slb=X1|~strictly_less_than(X3,findmin_pqp_res(X2))|~contains_slb(X1,X3)),inference(spm,[status(thm)],[111,102,theory(equality)])).
% cnf(314,plain,(pair_in_list(update_slb(X1,findmin_pqp_res(X2)),X3,findmin_pqp_res(X2))|less_than(findmin_pqp_res(X2),esk3_4(X2,X1,X4,X3))|less_than(findmin_cpq_res(triple(X2,X1,X4)),X3)|~contains_slb(X1,X3)),inference(spm,[status(thm)],[111,194,theory(equality)])).
% cnf(328,negated_conjecture,(pair_in_list(update_slb(esk5_0,findmin_pqp_res(esk4_0)),esk7_0,esk3_4(esk4_0,esk5_0,esk6_0,esk7_0))|pair_in_list(update_slb(esk5_0,findmin_pqp_res(esk4_0)),esk7_0,findmin_pqp_res(esk4_0))|~contains_slb(esk5_0,esk7_0)),inference(spm,[status(thm)],[112,191,theory(equality)])).
% cnf(336,negated_conjecture,(create_slb=esk5_0|~less_than(findmin_pqp_res(esk4_0),esk7_0)),inference(spm,[status(thm)],[200,102,theory(equality)])).
% cnf(651,negated_conjecture,(less_than(X1,X2)|esk5_0=create_slb|contains_slb(esk5_0,findmin_pqp_res(esk4_0))|~pair_in_list(update_slb(esk5_0,findmin_pqp_res(esk4_0)),X2,X1)),inference(spm,[status(thm)],[90,273,theory(equality)])).
% cnf(1643,negated_conjecture,(esk5_0=create_slb|check_cpq(triple(esk4_0,update_slb(esk5_0,findmin_pqp_res(esk4_0)),bad))|less_than(lookup_slb(esk5_0,findmin_pqp_res(esk4_0)),findmin_pqp_res(esk4_0))),inference(spm,[status(thm)],[278,194,theory(equality)])).
% cnf(1644,negated_conjecture,(less_than(X1,X2)|esk5_0=create_slb|less_than(lookup_slb(esk5_0,findmin_pqp_res(esk4_0)),findmin_pqp_res(esk4_0))|~pair_in_list(update_slb(esk5_0,findmin_pqp_res(esk4_0)),X2,X1)),inference(spm,[status(thm)],[90,1643,theory(equality)])).
% cnf(3689,negated_conjecture,(less_than(X1,X2)|esk5_0=create_slb|~pair_in_list(update_slb(esk5_0,findmin_pqp_res(esk4_0)),X2,X1)|~less_than(lookup_slb(esk5_0,findmin_pqp_res(esk4_0)),findmin_pqp_res(esk4_0))|~contains_slb(esk5_0,findmin_pqp_res(esk4_0))),inference(spm,[status(thm)],[90,302,theory(equality)])).
% cnf(4496,negated_conjecture,(create_slb=X1|pair_in_list(update_slb(X1,findmin_pqp_res(esk4_0)),esk7_0,findmin_pqp_res(esk4_0))|less_than(findmin_pqp_res(esk4_0),esk3_4(esk4_0,X1,X2,esk7_0))|esk5_0=create_slb|~contains_slb(X1,esk7_0)),inference(spm,[status(thm)],[312,206,theory(equality)])).
% cnf(4588,negated_conjecture,(pair_in_list(update_slb(esk5_0,findmin_pqp_res(X1)),esk7_0,findmin_pqp_res(X1))|less_than(findmin_pqp_res(X1),esk3_4(X1,esk5_0,X2,esk7_0))|less_than(findmin_cpq_res(triple(X1,esk5_0,X2)),esk7_0)),inference(spm,[status(thm)],[314,204,theory(equality)])).
% cnf(6210,negated_conjecture,(pair_in_list(update_slb(esk5_0,findmin_pqp_res(esk4_0)),esk7_0,esk3_4(esk4_0,esk5_0,esk6_0,esk7_0))|pair_in_list(update_slb(esk5_0,findmin_pqp_res(esk4_0)),esk7_0,findmin_pqp_res(esk4_0))|$false),inference(rw,[status(thm)],[328,204,theory(equality)])).
% cnf(6211,negated_conjecture,(pair_in_list(update_slb(esk5_0,findmin_pqp_res(esk4_0)),esk7_0,esk3_4(esk4_0,esk5_0,esk6_0,esk7_0))|pair_in_list(update_slb(esk5_0,findmin_pqp_res(esk4_0)),esk7_0,findmin_pqp_res(esk4_0))),inference(cn,[status(thm)],[6210,theory(equality)])).
% cnf(6214,negated_conjecture,(esk5_0=create_slb|less_than(esk3_4(esk4_0,esk5_0,esk6_0,esk7_0),esk7_0)|contains_slb(esk5_0,findmin_pqp_res(esk4_0))|pair_in_list(update_slb(esk5_0,findmin_pqp_res(esk4_0)),esk7_0,findmin_pqp_res(esk4_0))),inference(spm,[status(thm)],[651,6211,theory(equality)])).
% cnf(6295,negated_conjecture,(less_than(X1,esk7_0)|esk5_0=create_slb|pair_in_list(update_slb(esk5_0,findmin_pqp_res(esk4_0)),esk7_0,findmin_pqp_res(esk4_0))|contains_slb(esk5_0,findmin_pqp_res(esk4_0))|~less_than(X1,esk3_4(esk4_0,esk5_0,esk6_0,esk7_0))),inference(spm,[status(thm)],[70,6214,theory(equality)])).
% cnf(101215,negated_conjecture,(esk5_0=create_slb|pair_in_list(update_slb(esk5_0,findmin_pqp_res(esk4_0)),esk7_0,findmin_pqp_res(esk4_0))|less_than(findmin_pqp_res(esk4_0),esk7_0)|contains_slb(esk5_0,findmin_pqp_res(esk4_0))|less_than(findmin_cpq_res(triple(esk4_0,esk5_0,esk6_0)),esk7_0)),inference(spm,[status(thm)],[6295,4588,theory(equality)])).
% cnf(101280,negated_conjecture,(esk5_0=create_slb|pair_in_list(update_slb(esk5_0,findmin_pqp_res(esk4_0)),esk7_0,findmin_pqp_res(esk4_0))|less_than(findmin_pqp_res(esk4_0),esk7_0)|contains_slb(esk5_0,findmin_pqp_res(esk4_0))),inference(sr,[status(thm)],[101215,200,theory(equality)])).
% cnf(101285,negated_conjecture,(esk5_0=create_slb|pair_in_list(update_slb(esk5_0,findmin_pqp_res(esk4_0)),esk7_0,findmin_pqp_res(esk4_0))|contains_slb(esk5_0,findmin_pqp_res(esk4_0))),inference(csr,[status(thm)],[101280,336])).
% cnf(101297,negated_conjecture,(esk5_0=create_slb|less_than(findmin_pqp_res(esk4_0),esk7_0)|contains_slb(esk5_0,findmin_pqp_res(esk4_0))),inference(spm,[status(thm)],[651,101285,theory(equality)])).
% cnf(101341,negated_conjecture,(esk5_0=create_slb|contains_slb(esk5_0,findmin_pqp_res(esk4_0))),inference(csr,[status(thm)],[101297,336])).
% cnf(469893,negated_conjecture,(esk5_0=create_slb|less_than(X1,X2)|~pair_in_list(update_slb(esk5_0,findmin_pqp_res(esk4_0)),X2,X1)|~less_than(lookup_slb(esk5_0,findmin_pqp_res(esk4_0)),findmin_pqp_res(esk4_0))),inference(csr,[status(thm)],[3689,101341])).
% cnf(469894,negated_conjecture,(esk5_0=create_slb|less_than(X1,X2)|~pair_in_list(update_slb(esk5_0,findmin_pqp_res(esk4_0)),X2,X1)),inference(csr,[status(thm)],[469893,1644])).
% cnf(469942,negated_conjecture,(esk5_0=create_slb|less_than(esk3_4(esk4_0,esk5_0,esk6_0,esk7_0),esk7_0)|pair_in_list(update_slb(esk5_0,findmin_pqp_res(esk4_0)),esk7_0,findmin_pqp_res(esk4_0))),inference(spm,[status(thm)],[469894,6211,theory(equality)])).
% cnf(469946,negated_conjecture,(less_than(X1,esk7_0)|esk5_0=create_slb|pair_in_list(update_slb(esk5_0,findmin_pqp_res(esk4_0)),esk7_0,findmin_pqp_res(esk4_0))|~less_than(X1,esk3_4(esk4_0,esk5_0,esk6_0,esk7_0))),inference(spm,[status(thm)],[70,469942,theory(equality)])).
% cnf(502534,negated_conjecture,(esk5_0=create_slb|pair_in_list(update_slb(esk5_0,findmin_pqp_res(esk4_0)),esk7_0,findmin_pqp_res(esk4_0))|less_than(findmin_pqp_res(esk4_0),esk7_0)|~contains_slb(esk5_0,esk7_0)),inference(spm,[status(thm)],[469946,4496,theory(equality)])).
% cnf(502782,negated_conjecture,(esk5_0=create_slb|pair_in_list(update_slb(esk5_0,findmin_pqp_res(esk4_0)),esk7_0,findmin_pqp_res(esk4_0))|less_than(findmin_pqp_res(esk4_0),esk7_0)|$false),inference(rw,[status(thm)],[502534,204,theory(equality)])).
% cnf(502783,negated_conjecture,(esk5_0=create_slb|pair_in_list(update_slb(esk5_0,findmin_pqp_res(esk4_0)),esk7_0,findmin_pqp_res(esk4_0))|less_than(findmin_pqp_res(esk4_0),esk7_0)),inference(cn,[status(thm)],[502782,theory(equality)])).
% cnf(502789,negated_conjecture,(esk5_0=create_slb|pair_in_list(update_slb(esk5_0,findmin_pqp_res(esk4_0)),esk7_0,findmin_pqp_res(esk4_0))),inference(csr,[status(thm)],[502783,336])).
% cnf(502808,negated_conjecture,(esk5_0=create_slb|less_than(findmin_pqp_res(esk4_0),esk7_0)),inference(spm,[status(thm)],[469894,502789,theory(equality)])).
% cnf(502894,negated_conjecture,(esk5_0=create_slb),inference(csr,[status(thm)],[502808,336])).
% cnf(503634,negated_conjecture,(pair_in_list(create_slb,esk7_0,esk3_4(esk4_0,create_slb,esk6_0,esk7_0))|pair_in_list(update_slb(esk5_0,findmin_pqp_res(esk4_0)),esk7_0,findmin_pqp_res(esk4_0))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[6211,502894,theory(equality)]),122,theory(equality)]),502894,theory(equality)])).
% cnf(503635,negated_conjecture,(pair_in_list(create_slb,esk7_0,esk3_4(esk4_0,create_slb,esk6_0,esk7_0))|pair_in_list(create_slb,esk7_0,findmin_pqp_res(esk4_0))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[503634,502894,theory(equality)]),122,theory(equality)])).
% cnf(503636,negated_conjecture,(pair_in_list(create_slb,esk7_0,findmin_pqp_res(esk4_0))),inference(sr,[status(thm)],[503635,136,theory(equality)])).
% cnf(503637,negated_conjecture,($false),inference(sr,[status(thm)],[503636,136,theory(equality)])).
% cnf(503638,negated_conjecture,($false),503637,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 10529
% # ...of these trivial : 665
% # ...subsumed : 7305
% # ...remaining for further processing: 2559
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 182
% # Backward-rewritten : 748
% # Generated clauses : 405840
% # ...of the previous two non-trivial : 367081
% # Contextual simplify-reflections : 3905
% # Paramodulations : 404816
% # Factorizations : 1022
% # Equation resolutions : 3
% # Current number of processed clauses: 1571
% # Positive orientable unit clauses: 334
% # Positive unorientable unit clauses: 9
% # Negative unit clauses : 134
% # Non-unit-clauses : 1094
% # Current number of unprocessed clauses: 173521
% # ...number of literals in the above : 776706
% # Clause-clause subsumption calls (NU) : 252681
% # Rec. Clause-clause subsumption calls : 143036
% # Unit Clause-clause subsumption calls : 4817
% # Rewrite failures with RHS unbound : 765
% # Indexed BW rewrite attempts : 5762
% # Indexed BW rewrite successes : 396
% # Backwards rewriting index: 490 leaves, 7.84+/-15.812 terms/leaf
% # Paramod-from index: 203 leaves, 4.46+/-7.472 terms/leaf
% # Paramod-into index: 357 leaves, 8.68+/-17.727 terms/leaf
% # -------------------------------------------------
% # User time : 19.859 s
% # System time : 0.527 s
% # Total time : 20.386 s
% # Maximum resident set size: 0 pages
% PrfWatch: 28.60 CPU 29.60 WC
% FINAL PrfWatch: 28.60 CPU 29.60 WC
% SZS output end Solution for /tmp/SystemOnTPTP31446/SWV407+1.tptp
%
%------------------------------------------------------------------------------