TSTP Solution File: SWV404+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV404+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 : art01.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:55:52 EST 2010
% Result : Theorem 10.60s
% Output : Solution 10.60s
% 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/SystemOnTPTP12001/SWV404+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP12001/SWV404+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP12001/SWV404+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 12097
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% PrfWatch: 1.95 CPU 2.02 WC
% PrfWatch: 3.94 CPU 4.03 WC
% PrfWatch: 5.93 CPU 6.04 WC
% # Preprocessing time : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 7.89 CPU 8.04 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:![X4]:((check_cpq(remove_cpq(triple(X1,X2,X3),X4))&ok(remove_cpq(triple(X1,X2,X3),X4)))=>check_cpq(triple(X1,X2,X3))),file('/tmp/SRASS.s.p', l40_l27)).
% fof(2, axiom,![X1]:![X2]:check_cpq(triple(X1,create_slb,X2)),file('/tmp/SRASS.s.p', ax36)).
% fof(3, axiom,![X1]:![X2]:![X3]:(~(check_cpq(triple(X1,X2,X3)))=>~(check_cpq(findmin_cpq_eff(triple(X1,X2,X3))))),file('/tmp/SRASS.s.p', l40_l34)).
% fof(7, axiom,![X1]:![X2]:(less_than(X1,X2)|less_than(X2,X1)),file('/tmp/SRASS.s.p', totality)).
% fof(10, axiom,![X1]:![X2]:(ok(triple(X1,X2,bad))<=>~($true)),file('/tmp/SRASS.s.p', ax40)).
% fof(16, 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(24, 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(26, axiom,![X1]:removemin_cpq_eff(X1)=remove_cpq(findmin_cpq_eff(X1),findmin_cpq_res(X1)),file('/tmp/SRASS.s.p', ax52)).
% fof(36, 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(37, 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(39, 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(40, 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(41, 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(43, 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(44, conjecture,![X1]:![X2]:![X3]:((check_cpq(removemin_cpq_eff(triple(X1,X2,X3)))&ok(removemin_cpq_eff(triple(X1,X2,X3))))=>check_cpq(triple(X1,X2,X3))),file('/tmp/SRASS.s.p', l40_co)).
% fof(45, negated_conjecture,~(![X1]:![X2]:![X3]:((check_cpq(removemin_cpq_eff(triple(X1,X2,X3)))&ok(removemin_cpq_eff(triple(X1,X2,X3))))=>check_cpq(triple(X1,X2,X3)))),inference(assume_negation,[status(cth)],[44])).
% fof(46, plain,![X1]:![X2]:![X3]:(~(check_cpq(triple(X1,X2,X3)))=>~(check_cpq(findmin_cpq_eff(triple(X1,X2,X3))))),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(48, plain,![X1]:![X2]:~(ok(triple(X1,X2,bad))),inference(fof_simplification,[status(thm)],[10,theory(equality)])).
% fof(50, 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)],[16,theory(equality)])).
% fof(52, plain,![X1]:![X2]:(strictly_less_than(X1,X2)<=>(less_than(X1,X2)&~(less_than(X2,X1)))),inference(fof_simplification,[status(thm)],[24,theory(equality)])).
% fof(55, 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)],[36,theory(equality)])).
% fof(56, plain,![X1]:![X2]:![X3]:![X4]:((~(check_cpq(remove_cpq(triple(X1,X2,X3),X4)))|~(ok(remove_cpq(triple(X1,X2,X3),X4))))|check_cpq(triple(X1,X2,X3))),inference(fof_nnf,[status(thm)],[1])).
% fof(57, plain,![X5]:![X6]:![X7]:![X8]:((~(check_cpq(remove_cpq(triple(X5,X6,X7),X8)))|~(ok(remove_cpq(triple(X5,X6,X7),X8))))|check_cpq(triple(X5,X6,X7))),inference(variable_rename,[status(thm)],[56])).
% cnf(58,plain,(check_cpq(triple(X1,X2,X3))|~ok(remove_cpq(triple(X1,X2,X3),X4))|~check_cpq(remove_cpq(triple(X1,X2,X3),X4))),inference(split_conjunct,[status(thm)],[57])).
% fof(59, plain,![X3]:![X4]:check_cpq(triple(X3,create_slb,X4)),inference(variable_rename,[status(thm)],[2])).
% cnf(60,plain,(check_cpq(triple(X1,create_slb,X2))),inference(split_conjunct,[status(thm)],[59])).
% fof(61, plain,![X1]:![X2]:![X3]:(check_cpq(triple(X1,X2,X3))|~(check_cpq(findmin_cpq_eff(triple(X1,X2,X3))))),inference(fof_nnf,[status(thm)],[46])).
% fof(62, plain,![X4]:![X5]:![X6]:(check_cpq(triple(X4,X5,X6))|~(check_cpq(findmin_cpq_eff(triple(X4,X5,X6))))),inference(variable_rename,[status(thm)],[61])).
% cnf(63,plain,(check_cpq(triple(X1,X2,X3))|~check_cpq(findmin_cpq_eff(triple(X1,X2,X3)))),inference(split_conjunct,[status(thm)],[62])).
% fof(73, plain,![X3]:![X4]:(less_than(X3,X4)|less_than(X4,X3)),inference(variable_rename,[status(thm)],[7])).
% cnf(74,plain,(less_than(X1,X2)|less_than(X2,X1)),inference(split_conjunct,[status(thm)],[73])).
% fof(79, plain,![X3]:![X4]:~(ok(triple(X3,X4,bad))),inference(variable_rename,[status(thm)],[48])).
% cnf(80,plain,(~ok(triple(X1,X2,bad))),inference(split_conjunct,[status(thm)],[79])).
% fof(100, 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)],[50])).
% fof(101, 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)],[100])).
% cnf(102,plain,(remove_cpq(triple(X1,X2,X3),X4)=triple(X1,X2,bad)|contains_slb(X2,X4)),inference(split_conjunct,[status(thm)],[101])).
% fof(124, 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)],[52])).
% fof(125, 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)],[124])).
% fof(126, 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)],[125])).
% cnf(127,plain,(strictly_less_than(X1,X2)|less_than(X2,X1)|~less_than(X1,X2)),inference(split_conjunct,[status(thm)],[126])).
% fof(133, plain,![X2]:removemin_cpq_eff(X2)=remove_cpq(findmin_cpq_eff(X2),findmin_cpq_res(X2)),inference(variable_rename,[status(thm)],[26])).
% cnf(134,plain,(removemin_cpq_eff(X1)=remove_cpq(findmin_cpq_eff(X1),findmin_cpq_res(X1))),inference(split_conjunct,[status(thm)],[133])).
% fof(157, 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)],[55])).
% fof(158, 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)],[157])).
% cnf(159,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)],[158])).
% fof(160, 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)],[37])).
% fof(161, 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)],[160])).
% cnf(162,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)],[161])).
% fof(165, plain,![X1]:![X2]:![X3]:![X4]:(X2=create_slb|findmin_cpq_res(triple(X1,X2,X3))=findmin_pqp_res(X1)),inference(fof_nnf,[status(thm)],[39])).
% fof(166, plain,![X5]:![X6]:![X7]:![X8]:(X6=create_slb|findmin_cpq_res(triple(X5,X6,X7))=findmin_pqp_res(X5)),inference(variable_rename,[status(thm)],[165])).
% cnf(167,plain,(findmin_cpq_res(triple(X1,X2,X3))=findmin_pqp_res(X1)|X2=create_slb),inference(split_conjunct,[status(thm)],[166])).
% fof(168, 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)],[40])).
% fof(169, 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)],[168])).
% cnf(170,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)],[169])).
% fof(171, 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)],[41])).
% fof(172, 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)],[171])).
% cnf(173,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)],[172])).
% fof(176, 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)],[43])).
% fof(177, 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)],[176])).
% cnf(178,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)],[177])).
% fof(179, negated_conjecture,?[X1]:?[X2]:?[X3]:((check_cpq(removemin_cpq_eff(triple(X1,X2,X3)))&ok(removemin_cpq_eff(triple(X1,X2,X3))))&~(check_cpq(triple(X1,X2,X3)))),inference(fof_nnf,[status(thm)],[45])).
% fof(180, negated_conjecture,?[X4]:?[X5]:?[X6]:((check_cpq(removemin_cpq_eff(triple(X4,X5,X6)))&ok(removemin_cpq_eff(triple(X4,X5,X6))))&~(check_cpq(triple(X4,X5,X6)))),inference(variable_rename,[status(thm)],[179])).
% fof(181, negated_conjecture,((check_cpq(removemin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)))&ok(removemin_cpq_eff(triple(esk1_0,esk2_0,esk3_0))))&~(check_cpq(triple(esk1_0,esk2_0,esk3_0)))),inference(skolemize,[status(esa)],[180])).
% cnf(182,negated_conjecture,(~check_cpq(triple(esk1_0,esk2_0,esk3_0))),inference(split_conjunct,[status(thm)],[181])).
% cnf(183,negated_conjecture,(ok(removemin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)))),inference(split_conjunct,[status(thm)],[181])).
% cnf(184,negated_conjecture,(check_cpq(removemin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)))),inference(split_conjunct,[status(thm)],[181])).
% cnf(185,negated_conjecture,(check_cpq(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)),findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0))))),inference(rw,[status(thm)],[184,134,theory(equality)]),['unfolding']).
% cnf(186,negated_conjecture,(ok(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)),findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0))))),inference(rw,[status(thm)],[183,134,theory(equality)]),['unfolding']).
% cnf(188,plain,(strictly_less_than(X1,X2)|less_than(X2,X1)),inference(csr,[status(thm)],[127,74])).
% cnf(192,plain,(triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)=findmin_cpq_eff(triple(X1,X2,X3))|create_slb=X2|~strictly_less_than(findmin_pqp_res(X1),lookup_slb(X2,findmin_pqp_res(X1)))),inference(csr,[status(thm)],[173,159])).
% cnf(199,negated_conjecture,(ok(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)),findmin_pqp_res(esk1_0)))|create_slb=esk2_0),inference(spm,[status(thm)],[186,167,theory(equality)])).
% cnf(246,plain,(check_cpq(findmin_cpq_eff(triple(X1,X2,X4)))|create_slb=X2|contains_slb(X2,findmin_pqp_res(X1))|~ok(remove_cpq(findmin_cpq_eff(triple(X1,X2,X4)),X3))|~check_cpq(remove_cpq(findmin_cpq_eff(triple(X1,X2,X4)),X3))),inference(spm,[status(thm)],[58,159,theory(equality)])).
% cnf(259,plain,(~ok(remove_cpq(triple(X1,X3,bad),X2))|~contains_slb(X3,X2)|~less_than(lookup_slb(X3,X2),X2)),inference(spm,[status(thm)],[80,178,theory(equality)])).
% cnf(274,plain,(~ok(remove_cpq(triple(X1,X3,X4),X2))|~contains_slb(X3,X2)|~strictly_less_than(X2,lookup_slb(X3,X2))),inference(spm,[status(thm)],[80,170,theory(equality)])).
% cnf(310,plain,(triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)=findmin_cpq_eff(triple(X1,X2,X3))|create_slb=X2|less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1))),inference(spm,[status(thm)],[192,188,theory(equality)])).
% cnf(939,negated_conjecture,(create_slb=esk2_0|contains_slb(esk2_0,findmin_pqp_res(esk1_0))|check_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)))|~check_cpq(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)),findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0))))),inference(spm,[status(thm)],[246,186,theory(equality)])).
% cnf(941,negated_conjecture,(create_slb=esk2_0|contains_slb(esk2_0,findmin_pqp_res(esk1_0))|check_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)))|$false),inference(rw,[status(thm)],[939,185,theory(equality)])).
% cnf(942,negated_conjecture,(create_slb=esk2_0|contains_slb(esk2_0,findmin_pqp_res(esk1_0))|check_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)))),inference(cn,[status(thm)],[941,theory(equality)])).
% cnf(952,negated_conjecture,(check_cpq(triple(esk1_0,esk2_0,esk3_0))|esk2_0=create_slb|contains_slb(esk2_0,findmin_pqp_res(esk1_0))),inference(spm,[status(thm)],[63,942,theory(equality)])).
% cnf(956,negated_conjecture,(esk2_0=create_slb|contains_slb(esk2_0,findmin_pqp_res(esk1_0))),inference(sr,[status(thm)],[952,182,theory(equality)])).
% cnf(2872,plain,(findmin_cpq_eff(triple(X1,X2,X4))=findmin_cpq_eff(triple(X1,X2,X3))|create_slb=X2|less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1))),inference(spm,[status(thm)],[310,310,theory(equality)])).
% cnf(53851,negated_conjecture,(esk2_0=create_slb|ok(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,X1)),findmin_pqp_res(esk1_0)))|less_than(lookup_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0))),inference(spm,[status(thm)],[199,2872,theory(equality)])).
% cnf(54246,negated_conjecture,(esk2_0=create_slb|less_than(lookup_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0))|ok(remove_cpq(triple(esk1_0,update_slb(esk2_0,findmin_pqp_res(esk1_0)),bad),findmin_pqp_res(esk1_0)))),inference(spm,[status(thm)],[53851,310,theory(equality)])).
% cnf(57325,negated_conjecture,(esk2_0=create_slb|less_than(lookup_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0))|~contains_slb(update_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0))|~strictly_less_than(findmin_pqp_res(esk1_0),lookup_slb(update_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0)))),inference(spm,[status(thm)],[274,54246,theory(equality)])).
% cnf(57326,negated_conjecture,(esk2_0=create_slb|less_than(lookup_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0))|~contains_slb(update_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0))|~less_than(lookup_slb(update_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0))),inference(spm,[status(thm)],[259,54246,theory(equality)])).
% cnf(57341,negated_conjecture,(esk2_0=create_slb|less_than(lookup_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0))|ok(triple(esk1_0,update_slb(esk2_0,findmin_pqp_res(esk1_0)),bad))|contains_slb(update_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0))),inference(spm,[status(thm)],[54246,102,theory(equality)])).
% cnf(57342,negated_conjecture,(esk2_0=create_slb|less_than(lookup_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0))|contains_slb(update_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0))),inference(sr,[status(thm)],[57341,80,theory(equality)])).
% cnf(92837,negated_conjecture,(esk2_0=create_slb|less_than(lookup_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0))|~strictly_less_than(findmin_pqp_res(esk1_0),lookup_slb(update_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0)))),inference(csr,[status(thm)],[57325,57342])).
% cnf(92849,negated_conjecture,(esk2_0=create_slb|less_than(lookup_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0))|less_than(lookup_slb(update_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0))),inference(spm,[status(thm)],[92837,188,theory(equality)])).
% cnf(143659,negated_conjecture,(esk2_0=create_slb|less_than(lookup_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0))|~contains_slb(update_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0))),inference(csr,[status(thm)],[57326,92849])).
% cnf(143660,negated_conjecture,(esk2_0=create_slb|less_than(lookup_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0))),inference(csr,[status(thm)],[143659,57342])).
% cnf(143723,negated_conjecture,(triple(esk1_0,update_slb(esk2_0,findmin_pqp_res(esk1_0)),X1)=findmin_cpq_eff(triple(esk1_0,esk2_0,X1))|create_slb=esk2_0|~contains_slb(esk2_0,findmin_pqp_res(esk1_0))),inference(spm,[status(thm)],[162,143660,theory(equality)])).
% cnf(144854,negated_conjecture,(triple(esk1_0,update_slb(esk2_0,findmin_pqp_res(esk1_0)),X1)=findmin_cpq_eff(triple(esk1_0,esk2_0,X1))|esk2_0=create_slb),inference(csr,[status(thm)],[143723,956])).
% cnf(144905,negated_conjecture,(check_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,X1)))|esk2_0=create_slb|~ok(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,X1)),X2))|~check_cpq(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,X1)),X2))),inference(spm,[status(thm)],[58,144854,theory(equality)])).
% cnf(146111,negated_conjecture,(esk2_0=create_slb|check_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)))|~check_cpq(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)),findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0))))),inference(spm,[status(thm)],[144905,186,theory(equality)])).
% cnf(146114,negated_conjecture,(esk2_0=create_slb|check_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)))|$false),inference(rw,[status(thm)],[146111,185,theory(equality)])).
% cnf(146115,negated_conjecture,(esk2_0=create_slb|check_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)))),inference(cn,[status(thm)],[146114,theory(equality)])).
% cnf(146116,negated_conjecture,(check_cpq(triple(esk1_0,esk2_0,esk3_0))|esk2_0=create_slb),inference(spm,[status(thm)],[63,146115,theory(equality)])).
% cnf(146130,negated_conjecture,(esk2_0=create_slb),inference(sr,[status(thm)],[146116,182,theory(equality)])).
% cnf(146536,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[182,146130,theory(equality)]),60,theory(equality)])).
% cnf(146537,negated_conjecture,($false),inference(cn,[status(thm)],[146536,theory(equality)])).
% cnf(146538,negated_conjecture,($false),146537,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 3868
% # ...of these trivial : 10
% # ...subsumed : 2501
% # ...remaining for further processing: 1357
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 256
% # Backward-rewritten : 145
% # Generated clauses : 136191
% # ...of the previous two non-trivial : 132972
% # Contextual simplify-reflections : 1962
% # Paramodulations : 135849
% # Factorizations : 340
% # Equation resolutions : 3
% # Current number of processed clauses: 901
% # Positive orientable unit clauses: 37
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 85
% # Non-unit-clauses : 779
% # Current number of unprocessed clauses: 45333
% # ...number of literals in the above : 256052
% # Clause-clause subsumption calls (NU) : 60880
% # Rec. Clause-clause subsumption calls : 29293
% # Unit Clause-clause subsumption calls : 2007
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 143
% # Indexed BW rewrite successes : 24
% # Backwards rewriting index: 358 leaves, 5.50+/-10.726 terms/leaf
% # Paramod-from index: 161 leaves, 2.32+/-2.779 terms/leaf
% # Paramod-into index: 314 leaves, 5.20+/-10.820 terms/leaf
% # -------------------------------------------------
% # User time : 6.750 s
% # System time : 0.167 s
% # Total time : 6.917 s
% # Maximum resident set size: 0 pages
% PrfWatch: 9.56 CPU 9.71 WC
% FINAL PrfWatch: 9.56 CPU 9.72 WC
% SZS output end Solution for /tmp/SystemOnTPTP12001/SWV404+1.tptp
%
%------------------------------------------------------------------------------