%------------------------------------------------------------------------------
% File : Drodi-SAT---4.1.1
% Problem : SWV374+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 : n013.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:40 PM UTC 2026
% Result : Theorem 0.10s 0.42s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV374+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : drodi -satmode(on) -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.36 % Computer : n013.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 08:43:06 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.37 % Drodi V4.1.1
% 0.10/0.42 % Refutation found
% 0.10/0.42 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.10/0.42 % SZS output start CNFRefutation for theBenchmark
% 0.10/0.42 fof(f2,axiom,(
% 0.10/0.42 (! [U,V] :( less_than(U,V)| less_than(V,U) ) )),
% 0.10/0.42 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.42 fof(f4,axiom,(
% 0.10/0.42 (! [U,V] :( strictly_less_than(U,V)<=> ( less_than(U,V)& ~ less_than(V,U) ) ) )),
% 0.10/0.42 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.42 fof(f28,axiom,(
% 0.10/0.42 (! [U,V] :( ok(triple(U,V,bad))<=> $false ) )),
% 0.10/0.42 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.42 fof(f34,axiom,(
% 0.10/0.42 (! [U,V] : findmin_cpq_eff(triple(U,create_slb,V)) = triple(U,create_slb,bad) )),
% 0.10/0.42 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.42 fof(f35,axiom,(
% 0.10/0.42 (! [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) ) )),
% 0.10/0.42 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.42 fof(f36,axiom,(
% 0.10/0.42 (! [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) ) )),
% 0.10/0.42 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.42 fof(f42,conjecture,(
% 0.10/0.42 (! [U,V,W] :( ok(findmin_cpq_eff(triple(U,V,W)))=> ( V != create_slb& contains_slb(V,findmin_pqp_res(U))& less_than(lookup_slb(V,findmin_pqp_res(U)),findmin_pqp_res(U)) ) ) )),
% 0.10/0.42 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.42 fof(f43,negated_conjecture,(
% 0.10/0.42 ~((! [U,V,W] :( ok(findmin_cpq_eff(triple(U,V,W)))=> ( V != create_slb& contains_slb(V,findmin_pqp_res(U))& less_than(lookup_slb(V,findmin_pqp_res(U)),findmin_pqp_res(U)) ) ) ))),
% 0.10/0.42 inference(negated_conjecture,[status(cth)],[f42])).
% 0.10/0.42 fof(f47,plain,(
% 0.10/0.42 ![X0,X1]: (less_than(X0,X1)|less_than(X1,X0))),
% 0.10/0.42 inference(cnf_transformation,[status(thm)],[f2])).
% 0.10/0.42 fof(f49,plain,(
% 0.10/0.42 ![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))))),
% 0.10/0.42 inference(NNF_transformation,[status(thm)],[f4])).
% 0.10/0.42 fof(f50,plain,(
% 0.10/0.42 (![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))))),
% 0.10/0.42 inference(miniscoping,[status(thm)],[f49])).
% 0.10/0.42 fof(f53,plain,(
% 0.10/0.42 ![X0,X1]: (strictly_less_than(X0,X1)|~less_than(X0,X1)|less_than(X1,X0))),
% 0.10/0.42 inference(cnf_transformation,[status(thm)],[f50])).
% 0.10/0.42 fof(f111,plain,(
% 0.10/0.42 ![U,V]: ((~ok(triple(U,V,bad))|$false)&(ok(triple(U,V,bad))|$true))),
% 0.10/0.42 inference(NNF_transformation,[status(thm)],[f28])).
% 0.10/0.42 fof(f112,plain,(
% 0.10/0.42 ((![U,V]: ~ok(triple(U,V,bad)))|$false)&((![U,V]: ok(triple(U,V,bad)))|$true)),
% 0.10/0.42 inference(miniscoping,[status(thm)],[f111])).
% 0.10/0.42 fof(f113,plain,(
% 0.10/0.42 ![U,V]: ~ok(triple(U,V,bad))),
% 0.10/0.42 inference(true_and_false_simplification,[status(thm)],[f112])).
% 0.10/0.42 fof(f114,plain,(
% 0.10/0.42 ![X0,X1]: (~ok(triple(X0,X1,bad)))),
% 0.10/0.42 inference(cnf_transformation,[status(thm)],[f113])).
% 0.10/0.42 fof(f128,plain,(
% 0.10/0.42 ![X0,X1]: (findmin_cpq_eff(triple(X0,create_slb,X1))=triple(X0,create_slb,bad))),
% 0.10/0.42 inference(cnf_transformation,[status(thm)],[f34])).
% 0.10/0.42 fof(f129,plain,(
% 0.10/0.42 ![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))),
% 0.10/0.42 inference(pre_NNF_transformation,[status(thm)],[f35])).
% 0.10/0.42 fof(f130,plain,(
% 0.10/0.42 ![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)))),
% 0.10/0.42 inference(miniscoping,[status(thm)],[f129])).
% 0.10/0.42 fof(f131,plain,(
% 0.10/0.42 ![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))),
% 0.10/0.42 inference(cnf_transformation,[status(thm)],[f130])).
% 0.10/0.42 fof(f132,plain,(
% 0.10/0.42 ![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))),
% 0.10/0.42 inference(pre_NNF_transformation,[status(thm)],[f36])).
% 0.10/0.42 fof(f133,plain,(
% 0.10/0.42 ![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)))),
% 0.10/0.42 inference(miniscoping,[status(thm)],[f132])).
% 0.10/0.42 fof(f134,plain,(
% 0.10/0.42 ![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))),
% 0.10/0.42 inference(cnf_transformation,[status(thm)],[f133])).
% 0.10/0.42 fof(f144,plain,(
% 0.10/0.42 (?[U,V,W]: (ok(findmin_cpq_eff(triple(U,V,W)))&((V=create_slb|~contains_slb(V,findmin_pqp_res(U)))|~less_than(lookup_slb(V,findmin_pqp_res(U)),findmin_pqp_res(U)))))),
% 0.10/0.42 inference(pre_NNF_transformation,[status(thm)],[f43])).
% 0.10/0.42 fof(f145,plain,(
% 0.10/0.42 ?[U,V]: ((?[W]: ok(findmin_cpq_eff(triple(U,V,W))))&((V=create_slb|~contains_slb(V,findmin_pqp_res(U)))|~less_than(lookup_slb(V,findmin_pqp_res(U)),findmin_pqp_res(U))))),
% 0.10/0.42 inference(miniscoping,[status(thm)],[f144])).
% 0.10/0.42 fof(f146,plain,(
% 0.10/0.42 (ok(findmin_cpq_eff(triple(sK0_skl,sK1_skl,sK2_skl)))&((sK1_skl=create_slb|~contains_slb(sK1_skl,findmin_pqp_res(sK0_skl)))|~less_than(lookup_slb(sK1_skl,findmin_pqp_res(sK0_skl)),findmin_pqp_res(sK0_skl))))),
% 0.10/0.42 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)],[f145])).
% 0.10/0.42 fof(f147,plain,(
% 0.10/0.42 ok(findmin_cpq_eff(triple(sK0_skl,sK1_skl,sK2_skl)))),
% 0.10/0.42 inference(cnf_transformation,[status(thm)],[f146])).
% 0.10/0.42 fof(f148,plain,(
% 0.10/0.42 sK1_skl=create_slb|~contains_slb(sK1_skl,findmin_pqp_res(sK0_skl))|~less_than(lookup_slb(sK1_skl,findmin_pqp_res(sK0_skl)),findmin_pqp_res(sK0_skl))),
% 0.10/0.42 inference(cnf_transformation,[status(thm)],[f146])).
% 0.10/0.42 fof(f149,plain,(
% 0.10/0.42 ![X0,X1]: (strictly_less_than(X0,X1)|less_than(X1,X0))),
% 0.10/0.42 inference(forward_subsumption_resolution,[status(thm)],[f53,f47])).
% 0.10/0.42 fof(f152,plain,(
% 0.10/0.42 ![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))),
% 0.10/0.42 inference(forward_subsumption_resolution,[status(thm)],[f134,f131])).
% 0.10/0.42 fof(f165,plain,(
% 0.10/0.42 strictly_less_than(findmin_pqp_res(sK0_skl),lookup_slb(sK1_skl,findmin_pqp_res(sK0_skl)))|sK1_skl=create_slb|~contains_slb(sK1_skl,findmin_pqp_res(sK0_skl))),
% 0.10/0.42 inference(resolution,[status(thm)],[f149,f148])).
% 0.10/0.42 fof(f290,plain,(
% 0.10/0.42 ![X0]: (sK1_skl=create_slb|findmin_cpq_eff(triple(sK0_skl,sK1_skl,X0))=triple(sK0_skl,update_slb(sK1_skl,findmin_pqp_res(sK0_skl)),bad)|strictly_less_than(findmin_pqp_res(sK0_skl),lookup_slb(sK1_skl,findmin_pqp_res(sK0_skl)))|sK1_skl=create_slb)),
% 0.10/0.42 inference(resolution,[status(thm)],[f131,f165])).
% 0.10/0.42 fof(f297,plain,(
% 0.10/0.42 ![X0]: (sK1_skl=create_slb|findmin_cpq_eff(triple(sK0_skl,sK1_skl,X0))=triple(sK0_skl,update_slb(sK1_skl,findmin_pqp_res(sK0_skl)),bad)|strictly_less_than(findmin_pqp_res(sK0_skl),lookup_slb(sK1_skl,findmin_pqp_res(sK0_skl))))),
% 0.10/0.42 inference(duplicate_literals_removal,[status(thm)],[f290])).
% 0.10/0.42 fof(f298,plain,(
% 0.10/0.42 ![X0]: (sK1_skl=create_slb|findmin_cpq_eff(triple(sK0_skl,sK1_skl,X0))=triple(sK0_skl,update_slb(sK1_skl,findmin_pqp_res(sK0_skl)),bad))),
% 0.10/0.42 inference(forward_subsumption_resolution,[status(thm)],[f297,f152])).
% 0.10/0.42 fof(f378,plain,(
% 0.10/0.42 ![X0]: (~ok(findmin_cpq_eff(triple(sK0_skl,sK1_skl,X0)))|sK1_skl=create_slb)),
% 0.10/0.42 inference(paramodulation,[status(thm)],[f298,f114])).
% 0.10/0.42 fof(f384,plain,(
% 0.10/0.42 sK1_skl=create_slb),
% 0.10/0.42 inference(resolution,[status(thm)],[f378,f147])).
% 0.10/0.42 fof(f392,plain,(
% 0.10/0.42 ![X0,X1]: (findmin_cpq_eff(triple(X0,create_slb,X1))=triple(X0,sK1_skl,bad))),
% 0.10/0.42 inference(backward_demodulation,[status(thm)],[f384,f128])).
% 0.10/0.42 fof(f427,plain,(
% 0.10/0.42 ok(triple(sK0_skl,sK1_skl,bad))),
% 0.10/0.42 inference(backward_demodulation,[status(thm)],[f428,f147])).
% 0.10/0.42 fof(f428,plain,(
% 0.10/0.42 ![X0,X1]: (findmin_cpq_eff(triple(X0,sK1_skl,X1))=triple(X0,sK1_skl,bad))),
% 0.10/0.42 inference(forward_demodulation,[status(thm)],[f384,f392])).
% 0.10/0.42 fof(f434,plain,(
% 0.10/0.42 $false),
% 0.10/0.42 inference(forward_subsumption_resolution,[status(thm)],[f427,f114])).
% 0.10/0.42 % SZS output end CNFRefutation for theBenchmark.p
% 0.10/0.46 % Elapsed time: 0.078520 seconds
% 0.10/0.46 % CPU time: 0.306554 seconds
% 0.10/0.46 % Total memory used: 105.857 MB
% 0.10/0.46 % Net memory used: 105.603 MB
%------------------------------------------------------------------------------