↑ Up

Drodi-SAT---4.1.1.THM-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Drodi-SAT---4.1.1
% Problem  : SWV380+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n010.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 02:50:41 PM UTC 2026

% Result   : Theorem 2.28s 1.13s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SWV380+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06  % Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.40  % Computer : n010.cluster.edu
% 0.14/0.40  % Model    : x86_64 x86_64
% 0.14/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.40  % Memory   : 8046.5625MB
% 0.14/0.40  % OS       : Linux 6.8.0-71-generic
% 0.14/0.40  % CPULimit : 300
% 0.14/0.40  % WCLimit  : 300
% 0.14/0.40  % DateTime : Mon Sep 21 08:44:10 UTC 2026
% 0.14/0.40  % CPUTime  : 
% 0.19/0.43  % Drodi V4.1.1
% 2.28/1.13  % Refutation found
% 2.28/1.13  % SZS status Theorem for theBenchmark: Theorem is valid
% 2.28/1.13  % SZS output start CNFRefutation for theBenchmark
% 2.28/1.13  fof(f2,axiom,(
% 2.28/1.13    (! [U,V] :( less_than(U,V)| less_than(V,U) ) )),
% 2.28/1.13    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 2.28/1.13  fof(f4,axiom,(
% 2.28/1.13    (! [U,V] :( strictly_less_than(U,V)<=> ( less_than(U,V)& ~ less_than(V,U) ) ) )),
% 2.28/1.13    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 2.28/1.13  fof(f8,axiom,(
% 2.28/1.13    (! [U] : ~ contains_slb(create_slb,U) )),
% 2.28/1.13    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 2.28/1.13  fof(f28,axiom,(
% 2.28/1.13    (! [U,V] :( ok(triple(U,V,bad))<=> $false ) )),
% 2.28/1.13    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 2.28/1.13  fof(f29,axiom,(
% 2.28/1.13    (! [U,V,W] :( ~ ok(triple(U,V,W))=> W = bad ) )),
% 2.28/1.13    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 2.28/1.13  fof(f31,axiom,(
% 2.28/1.13    (! [U,V,W,X] :( ~ contains_slb(V,X)=> remove_cpq(triple(U,V,W),X) = triple(U,V,bad) ) )),
% 2.28/1.13    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 2.28/1.13  fof(f34,axiom,(
% 2.28/1.13    (! [U,V] : findmin_cpq_eff(triple(U,create_slb,V)) = triple(U,create_slb,bad) )),
% 2.28/1.13    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 2.28/1.13  fof(f35,axiom,(
% 2.28/1.13    (! [U,V,W,X] :( ( V != create_slb& ~ contains_slb(V,findmin_pqp_res(U)) )=> findmin_cpq_eff(triple(U,V,W)) = triple(U,update_slb(V,findmin_pqp_res(U)),bad) ) )),
% 2.28/1.13    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 2.28/1.13  fof(f36,axiom,(
% 2.28/1.13    (! [U,V,W,X] :( ( V != create_slb& contains_slb(V,findmin_pqp_res(U))& strictly_less_than(findmin_pqp_res(U),lookup_slb(V,findmin_pqp_res(U))) )=> findmin_cpq_eff(triple(U,V,W)) = triple(U,update_slb(V,findmin_pqp_res(U)),bad) ) )),
% 2.28/1.13    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 2.28/1.13  fof(f37,axiom,(
% 2.28/1.13    (! [U,V,W,X] :( ( V != create_slb& contains_slb(V,findmin_pqp_res(U))& less_than(lookup_slb(V,findmin_pqp_res(U)),findmin_pqp_res(U)) )=> findmin_cpq_eff(triple(U,V,W)) = triple(U,update_slb(V,findmin_pqp_res(U)),W) ) )),
% 2.28/1.13    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 2.28/1.13  fof(f38,axiom,(
% 2.28/1.13    (! [U,V] : findmin_cpq_res(triple(U,create_slb,V)) = bottom )),
% 2.28/1.13    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 2.28/1.13  fof(f39,axiom,(
% 2.28/1.13    (! [U,V,W,X] :( V != create_slb=> findmin_cpq_res(triple(U,V,W)) = findmin_pqp_res(U) ) )),
% 2.28/1.13    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 2.28/1.13  fof(f40,axiom,(
% 2.28/1.13    (! [U] : removemin_cpq_eff(U) = remove_cpq(findmin_cpq_eff(U),findmin_cpq_res(U)) )),
% 2.28/1.13    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 2.28/1.13  fof(f42,lemma,(
% 2.28/1.13    (! [U,V,W,X] :( ~ ok(triple(U,V,W))=> ~ ok(remove_cpq(triple(U,V,W),X)) ) )),
% 2.28/1.13    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 2.28/1.13  fof(f43,conjecture,(
% 2.28/1.13    (! [U,V,W] :( ~ ok(triple(U,V,W))=> ~ ok(removemin_cpq_eff(triple(U,V,W))) ) )),
% 2.28/1.13    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 2.28/1.13  fof(f44,negated_conjecture,(
% 2.28/1.13    ~((! [U,V,W] :( ~ ok(triple(U,V,W))=> ~ ok(removemin_cpq_eff(triple(U,V,W))) ) ))),
% 2.28/1.13    inference(negated_conjecture,[status(cth)],[f43])).
% 2.28/1.13  fof(f48,plain,(
% 2.28/1.13    ![X0,X1]: (less_than(X0,X1)|less_than(X1,X0))),
% 2.28/1.13    inference(cnf_transformation,[status(thm)],[f2])).
% 2.28/1.13  fof(f50,plain,(
% 2.28/1.13    ![U,V]: ((~strictly_less_than(U,V)|(less_than(U,V)&~less_than(V,U)))&(strictly_less_than(U,V)|(~less_than(U,V)|less_than(V,U))))),
% 2.28/1.13    inference(NNF_transformation,[status(thm)],[f4])).
% 2.28/1.13  fof(f51,plain,(
% 2.28/1.13    (![U,V]: (~strictly_less_than(U,V)|(less_than(U,V)&~less_than(V,U))))&(![U,V]: (strictly_less_than(U,V)|(~less_than(U,V)|less_than(V,U))))),
% 2.28/1.13    inference(miniscoping,[status(thm)],[f50])).
% 2.28/1.13  fof(f54,plain,(
% 2.28/1.13    ![X0,X1]: (strictly_less_than(X0,X1)|~less_than(X0,X1)|less_than(X1,X0))),
% 2.28/1.13    inference(cnf_transformation,[status(thm)],[f51])).
% 2.28/1.13  fof(f58,plain,(
% 2.28/1.13    ![X0]: (~contains_slb(create_slb,X0))),
% 2.28/1.13    inference(cnf_transformation,[status(thm)],[f8])).
% 2.28/1.13  fof(f112,plain,(
% 2.28/1.13    ![U,V]: ((~ok(triple(U,V,bad))|$false)&(ok(triple(U,V,bad))|$true))),
% 2.28/1.13    inference(NNF_transformation,[status(thm)],[f28])).
% 2.28/1.13  fof(f113,plain,(
% 2.28/1.13    ((![U,V]: ~ok(triple(U,V,bad)))|$false)&((![U,V]: ok(triple(U,V,bad)))|$true)),
% 2.28/1.13    inference(miniscoping,[status(thm)],[f112])).
% 2.28/1.13  fof(f114,plain,(
% 2.28/1.13    ![U,V]: ~ok(triple(U,V,bad))),
% 2.28/1.13    inference(true_and_false_simplification,[status(thm)],[f113])).
% 2.28/1.14  fof(f115,plain,(
% 2.28/1.14    ![X0,X1]: (~ok(triple(X0,X1,bad)))),
% 2.28/1.14    inference(cnf_transformation,[status(thm)],[f114])).
% 2.28/1.14  fof(f116,plain,(
% 2.28/1.14    ![U,V,W]: (ok(triple(U,V,W))|W=bad)),
% 2.28/1.14    inference(pre_NNF_transformation,[status(thm)],[f29])).
% 2.28/1.14  fof(f117,plain,(
% 2.28/1.14    ![W]: ((![U,V]: ok(triple(U,V,W)))|W=bad)),
% 2.28/1.14    inference(miniscoping,[status(thm)],[f116])).
% 2.28/1.14  fof(f118,plain,(
% 2.28/1.14    ![X0,X1,X2]: (ok(triple(X0,X1,X2))|X2=bad)),
% 2.28/1.14    inference(cnf_transformation,[status(thm)],[f117])).
% 2.28/1.14  fof(f120,plain,(
% 2.28/1.14    ![U,V,W,X]: (contains_slb(V,X)|remove_cpq(triple(U,V,W),X)=triple(U,V,bad))),
% 2.28/1.14    inference(pre_NNF_transformation,[status(thm)],[f31])).
% 2.28/1.14  fof(f121,plain,(
% 2.28/1.14    ![V,X]: (contains_slb(V,X)|(![U,W]: remove_cpq(triple(U,V,W),X)=triple(U,V,bad)))),
% 2.28/1.14    inference(miniscoping,[status(thm)],[f120])).
% 2.28/1.14  fof(f122,plain,(
% 2.28/1.14    ![X0,X1,X2,X3]: (contains_slb(X0,X1)|remove_cpq(triple(X2,X0,X3),X1)=triple(X2,X0,bad))),
% 2.28/1.14    inference(cnf_transformation,[status(thm)],[f121])).
% 2.28/1.14  fof(f129,plain,(
% 2.28/1.14    ![X0,X1]: (findmin_cpq_eff(triple(X0,create_slb,X1))=triple(X0,create_slb,bad))),
% 2.28/1.14    inference(cnf_transformation,[status(thm)],[f34])).
% 2.28/1.14  fof(f130,plain,(
% 2.28/1.14    ![U,V,W,X]: ((V=create_slb|contains_slb(V,findmin_pqp_res(U)))|findmin_cpq_eff(triple(U,V,W))=triple(U,update_slb(V,findmin_pqp_res(U)),bad))),
% 2.28/1.14    inference(pre_NNF_transformation,[status(thm)],[f35])).
% 2.28/1.14  fof(f131,plain,(
% 2.28/1.14    ![U,V]: ((V=create_slb|contains_slb(V,findmin_pqp_res(U)))|(![W]: findmin_cpq_eff(triple(U,V,W))=triple(U,update_slb(V,findmin_pqp_res(U)),bad)))),
% 2.28/1.14    inference(miniscoping,[status(thm)],[f130])).
% 2.28/1.14  fof(f132,plain,(
% 2.28/1.14    ![X0,X1,X2]: (X0=create_slb|contains_slb(X0,findmin_pqp_res(X1))|findmin_cpq_eff(triple(X1,X0,X2))=triple(X1,update_slb(X0,findmin_pqp_res(X1)),bad))),
% 2.28/1.14    inference(cnf_transformation,[status(thm)],[f131])).
% 2.28/1.14  fof(f133,plain,(
% 2.28/1.14    ![U,V,W,X]: (((V=create_slb|~contains_slb(V,findmin_pqp_res(U)))|~strictly_less_than(findmin_pqp_res(U),lookup_slb(V,findmin_pqp_res(U))))|findmin_cpq_eff(triple(U,V,W))=triple(U,update_slb(V,findmin_pqp_res(U)),bad))),
% 2.28/1.14    inference(pre_NNF_transformation,[status(thm)],[f36])).
% 2.28/1.14  fof(f134,plain,(
% 2.28/1.14    ![U,V]: (((V=create_slb|~contains_slb(V,findmin_pqp_res(U)))|~strictly_less_than(findmin_pqp_res(U),lookup_slb(V,findmin_pqp_res(U))))|(![W]: findmin_cpq_eff(triple(U,V,W))=triple(U,update_slb(V,findmin_pqp_res(U)),bad)))),
% 2.28/1.14    inference(miniscoping,[status(thm)],[f133])).
% 2.28/1.14  fof(f135,plain,(
% 2.28/1.14    ![X0,X1,X2]: (X0=create_slb|~contains_slb(X0,findmin_pqp_res(X1))|~strictly_less_than(findmin_pqp_res(X1),lookup_slb(X0,findmin_pqp_res(X1)))|findmin_cpq_eff(triple(X1,X0,X2))=triple(X1,update_slb(X0,findmin_pqp_res(X1)),bad))),
% 2.28/1.14    inference(cnf_transformation,[status(thm)],[f134])).
% 2.28/1.14  fof(f136,plain,(
% 2.28/1.14    ![U,V,W,X]: (((V=create_slb|~contains_slb(V,findmin_pqp_res(U)))|~less_than(lookup_slb(V,findmin_pqp_res(U)),findmin_pqp_res(U)))|findmin_cpq_eff(triple(U,V,W))=triple(U,update_slb(V,findmin_pqp_res(U)),W))),
% 2.28/1.14    inference(pre_NNF_transformation,[status(thm)],[f37])).
% 2.28/1.14  fof(f137,plain,(
% 2.28/1.14    ![U,V]: (((V=create_slb|~contains_slb(V,findmin_pqp_res(U)))|~less_than(lookup_slb(V,findmin_pqp_res(U)),findmin_pqp_res(U)))|(![W]: findmin_cpq_eff(triple(U,V,W))=triple(U,update_slb(V,findmin_pqp_res(U)),W)))),
% 2.28/1.14    inference(miniscoping,[status(thm)],[f136])).
% 2.28/1.14  fof(f138,plain,(
% 2.28/1.14    ![X0,X1,X2]: (X0=create_slb|~contains_slb(X0,findmin_pqp_res(X1))|~less_than(lookup_slb(X0,findmin_pqp_res(X1)),findmin_pqp_res(X1))|findmin_cpq_eff(triple(X1,X0,X2))=triple(X1,update_slb(X0,findmin_pqp_res(X1)),X2))),
% 2.28/1.14    inference(cnf_transformation,[status(thm)],[f137])).
% 2.28/1.14  fof(f139,plain,(
% 2.28/1.14    ![X0,X1]: (findmin_cpq_res(triple(X0,create_slb,X1))=bottom)),
% 2.28/1.14    inference(cnf_transformation,[status(thm)],[f38])).
% 2.28/1.14  fof(f140,plain,(
% 2.28/1.14    ![U,V,W,X]: (V=create_slb|findmin_cpq_res(triple(U,V,W))=findmin_pqp_res(U))),
% 2.28/1.14    inference(pre_NNF_transformation,[status(thm)],[f39])).
% 2.28/1.14  fof(f141,plain,(
% 2.28/1.14    ![V]: (V=create_slb|(![U,W]: findmin_cpq_res(triple(U,V,W))=findmin_pqp_res(U)))),
% 2.28/1.14    inference(miniscoping,[status(thm)],[f140])).
% 2.28/1.14  fof(f142,plain,(
% 2.28/1.14    ![X0,X1,X2]: (X0=create_slb|findmin_cpq_res(triple(X1,X0,X2))=findmin_pqp_res(X1))),
% 2.28/1.14    inference(cnf_transformation,[status(thm)],[f141])).
% 2.28/1.14  fof(f143,plain,(
% 2.28/1.14    ![X0]: (removemin_cpq_eff(X0)=remove_cpq(findmin_cpq_eff(X0),findmin_cpq_res(X0)))),
% 2.28/1.14    inference(cnf_transformation,[status(thm)],[f40])).
% 2.28/1.14  fof(f145,plain,(
% 2.28/1.14    ![U,V,W,X]: (ok(triple(U,V,W))|~ok(remove_cpq(triple(U,V,W),X)))),
% 2.28/1.14    inference(pre_NNF_transformation,[status(thm)],[f42])).
% 2.28/1.14  fof(f146,plain,(
% 2.28/1.14    ![U,V,W]: (ok(triple(U,V,W))|(![X]: ~ok(remove_cpq(triple(U,V,W),X))))),
% 2.28/1.14    inference(miniscoping,[status(thm)],[f145])).
% 2.28/1.14  fof(f147,plain,(
% 2.28/1.14    ![X0,X1,X2,X3]: (ok(triple(X0,X1,X2))|~ok(remove_cpq(triple(X0,X1,X2),X3)))),
% 2.28/1.14    inference(cnf_transformation,[status(thm)],[f146])).
% 2.28/1.14  fof(f148,plain,(
% 2.28/1.14    (?[U,V,W]: (~ok(triple(U,V,W))&ok(removemin_cpq_eff(triple(U,V,W)))))),
% 2.28/1.14    inference(pre_NNF_transformation,[status(thm)],[f44])).
% 2.28/1.14  fof(f149,plain,(
% 2.28/1.14    (~ok(triple(sK0_skl,sK1_skl,sK2_skl))&ok(removemin_cpq_eff(triple(sK0_skl,sK1_skl,sK2_skl))))),
% 2.28/1.14    inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl,sK1_skl,sK2_skl]),skolemize(U,sK0_skl),skolemize(V,sK1_skl),skolemize(W,sK2_skl)],[f148])).
% 2.28/1.14  fof(f150,plain,(
% 2.28/1.14    ~ok(triple(sK0_skl,sK1_skl,sK2_skl))),
% 2.28/1.14    inference(cnf_transformation,[status(thm)],[f149])).
% 2.28/1.14  fof(f151,plain,(
% 2.28/1.14    ok(removemin_cpq_eff(triple(sK0_skl,sK1_skl,sK2_skl)))),
% 2.28/1.14    inference(cnf_transformation,[status(thm)],[f149])).
% 2.28/1.14  fof(f152,plain,(
% 2.28/1.14    ![X0,X1]: (strictly_less_than(X0,X1)|less_than(X1,X0))),
% 2.28/1.14    inference(forward_subsumption_resolution,[status(thm)],[f54,f48])).
% 2.28/1.14  fof(f155,plain,(
% 2.28/1.14    ![X0,X1,X2]: (X0=create_slb|~strictly_less_than(findmin_pqp_res(X1),lookup_slb(X0,findmin_pqp_res(X1)))|findmin_cpq_eff(triple(X1,X0,X2))=triple(X1,update_slb(X0,findmin_pqp_res(X1)),bad))),
% 2.28/1.14    inference(forward_subsumption_resolution,[status(thm)],[f135,f132])).
% 2.28/1.14  fof(f156,plain,(
% 2.28/1.14    sK2_skl=bad),
% 2.28/1.14    inference(resolution,[status(thm)],[f118,f150])).
% 2.28/1.14  fof(f158,plain,(
% 2.28/1.14    ok(removemin_cpq_eff(triple(sK0_skl,sK1_skl,bad)))),
% 2.28/1.14    inference(backward_demodulation,[status(thm)],[f156,f151])).
% 2.28/1.14  fof(f165,plain,(
% 2.28/1.14    ![X0,X1]: (removemin_cpq_eff(triple(X0,create_slb,X1))=remove_cpq(findmin_cpq_eff(triple(X0,create_slb,X1)),bottom))),
% 2.28/1.14    inference(paramodulation,[status(thm)],[f139,f143])).
% 2.28/1.14  fof(f166,plain,(
% 2.28/1.14    ![X0,X1]: (removemin_cpq_eff(triple(X0,create_slb,X1))=remove_cpq(triple(X0,create_slb,bad),bottom))),
% 2.28/1.14    inference(forward_demodulation,[status(thm)],[f129,f165])).
% 2.28/1.14  fof(f211,plain,(
% 2.28/1.14    ![X0,X1,X2]: (removemin_cpq_eff(triple(X0,X1,X2))=remove_cpq(findmin_cpq_eff(triple(X0,X1,X2)),findmin_pqp_res(X0))|X1=create_slb)),
% 2.28/1.14    inference(paramodulation,[status(thm)],[f142,f143])).
% 2.28/1.14  fof(f234,plain,(
% 2.28/1.14    ![X0,X1,X2]: (remove_cpq(triple(X0,create_slb,X1),X2)=triple(X0,create_slb,bad))),
% 2.28/1.14    inference(resolution,[status(thm)],[f122,f58])).
% 2.28/1.14  fof(f240,plain,(
% 2.28/1.14    ![X0,X1]: (removemin_cpq_eff(triple(X0,create_slb,X1))=triple(X0,create_slb,bad))),
% 2.28/1.14    inference(backward_demodulation,[status(thm)],[f234,f166])).
% 2.28/1.14  fof(f312,plain,(
% 2.28/1.14    ![X0,X1,X2]: (X0=create_slb|findmin_cpq_eff(triple(X1,X0,X2))=triple(X1,update_slb(X0,findmin_pqp_res(X1)),bad)|less_than(lookup_slb(X0,findmin_pqp_res(X1)),findmin_pqp_res(X1)))),
% 2.28/1.14    inference(resolution,[status(thm)],[f155,f152])).
% 2.28/1.14  fof(f318,plain,(
% 2.28/1.14    ![X0,X1,X2,X3]: (X0=create_slb|~less_than(lookup_slb(X0,findmin_pqp_res(X1)),findmin_pqp_res(X1))|findmin_cpq_eff(triple(X1,X0,X2))=triple(X1,update_slb(X0,findmin_pqp_res(X1)),X2)|X0=create_slb|findmin_cpq_eff(triple(X1,X0,X3))=triple(X1,update_slb(X0,findmin_pqp_res(X1)),bad))),
% 2.28/1.14    inference(resolution,[status(thm)],[f138,f132])).
% 2.28/1.14  fof(f321,plain,(
% 2.28/1.14    ![X0,X1,X2,X3]: (X0=create_slb|~less_than(lookup_slb(X0,findmin_pqp_res(X1)),findmin_pqp_res(X1))|findmin_cpq_eff(triple(X1,X0,X2))=triple(X1,update_slb(X0,findmin_pqp_res(X1)),X2)|findmin_cpq_eff(triple(X1,X0,X3))=triple(X1,update_slb(X0,findmin_pqp_res(X1)),bad))),
% 2.28/1.14    inference(duplicate_literals_removal,[status(thm)],[f318])).
% 2.28/1.14  fof(f322,plain,(
% 2.28/1.14    ![X0,X1,X2,X3]: (X0=create_slb|findmin_cpq_eff(triple(X1,X0,X2))=triple(X1,update_slb(X0,findmin_pqp_res(X1)),X2)|findmin_cpq_eff(triple(X1,X0,X3))=triple(X1,update_slb(X0,findmin_pqp_res(X1)),bad))),
% 2.28/1.14    inference(forward_subsumption_resolution,[status(thm)],[f321,f312])).
% 2.28/1.17  fof(f1437,plain,(
% 2.28/1.17    ![X0,X1]: (X0=create_slb|findmin_cpq_eff(triple(X1,X0,bad))=triple(X1,update_slb(X0,findmin_pqp_res(X1)),bad))),
% 2.28/1.17    inference(factoring,[status(thm)],[f322])).
% 2.28/1.17  fof(f1695,plain,(
% 2.28/1.17    ![X0,X1,X2]: (ok(triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad))|~ok(remove_cpq(findmin_cpq_eff(triple(X0,X1,bad)),X2))|X1=create_slb)),
% 2.28/1.17    inference(paramodulation,[status(thm)],[f1437,f147])).
% 2.28/1.17  fof(f1718,plain,(
% 2.28/1.17    ![X0,X1,X2]: (~ok(remove_cpq(findmin_cpq_eff(triple(X0,X1,bad)),X2))|X1=create_slb)),
% 2.28/1.17    inference(forward_subsumption_resolution,[status(thm)],[f1695,f115])).
% 2.28/1.17  fof(f1735,plain,(
% 2.28/1.17    ![X0,X1]: (~ok(removemin_cpq_eff(triple(X0,X1,bad)))|X1=create_slb|X1=create_slb)),
% 2.28/1.17    inference(paramodulation,[status(thm)],[f211,f1718])).
% 2.28/1.17  fof(f1745,plain,(
% 2.28/1.17    ![X0,X1]: (~ok(removemin_cpq_eff(triple(X0,X1,bad)))|X1=create_slb)),
% 2.28/1.17    inference(duplicate_literals_removal,[status(thm)],[f1735])).
% 2.28/1.17  fof(f1746,plain,(
% 2.28/1.17    sK1_skl=create_slb),
% 2.28/1.17    inference(resolution,[status(thm)],[f1745,f158])).
% 2.28/1.17  fof(f1755,plain,(
% 2.28/1.17    ok(removemin_cpq_eff(triple(sK0_skl,create_slb,bad)))),
% 2.28/1.17    inference(backward_demodulation,[status(thm)],[f1746,f158])).
% 2.28/1.17  fof(f1756,plain,(
% 2.28/1.17    ok(triple(sK0_skl,create_slb,bad))),
% 2.28/1.17    inference(forward_demodulation,[status(thm)],[f240,f1755])).
% 2.28/1.17  fof(f1757,plain,(
% 2.28/1.17    $false),
% 2.28/1.17    inference(forward_subsumption_resolution,[status(thm)],[f1756,f115])).
% 2.28/1.17  % SZS output end CNFRefutation for theBenchmark.p
% 2.28/1.19  % Elapsed time: 0.765836 seconds
% 2.28/1.19  % CPU time: 4.930805 seconds
% 2.28/1.19  % Total memory used: 166.625 MB
% 2.28/1.19  % Net memory used: 160.587 MB
%------------------------------------------------------------------------------