↑ 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  : SWV408+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n009.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:43 PM UTC 2026

% Result   : Theorem 0.11s 0.51s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV408+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04  % Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.34  % Computer : n009.cluster.edu
% 0.08/0.34  % Model    : x86_64 x86_64
% 0.08/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34  % Memory   : 8046.5625MB
% 0.08/0.34  % OS       : Linux 6.8.0-71-generic
% 0.08/0.34  % CPULimit : 300
% 0.08/0.34  % WCLimit  : 300
% 0.08/0.34  % DateTime : Mon Sep 21 08:45:12 UTC 2026
% 0.08/0.34  % CPUTime  : 
% 0.11/0.36  % Drodi V4.1.1
% 0.11/0.51  % Refutation found
% 0.11/0.51  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.11/0.51  % SZS output start CNFRefutation for theBenchmark
% 0.11/0.51  fof(f2,axiom,(
% 0.11/0.51    (! [U,V] :( less_than(U,V)| less_than(V,U) ) )),
% 0.11/0.51    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.11/0.51  fof(f4,axiom,(
% 0.11/0.51    (! [U,V] :( strictly_less_than(U,V)<=> ( less_than(U,V)& ~ less_than(V,U) ) ) )),
% 0.11/0.51    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.11/0.51  fof(f42,lemma,(
% 0.11/0.51    (! [U,V] :( contains_slb(U,V)=> (? [W] : pair_in_list(U,V,W) )) )),
% 0.11/0.51    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.11/0.51  fof(f43,lemma,(
% 0.11/0.51    (! [U,V,W,X] :( ( pair_in_list(U,V,W)& strictly_less_than(W,X) )=> pair_in_list(update_slb(U,X),V,X) ) )),
% 0.11/0.51    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.11/0.51  fof(f44,lemma,(
% 0.11/0.51    (! [U,V,W,X] :( ( pair_in_list(U,V,W)& less_than(X,W) )=> pair_in_list(update_slb(U,X),V,W) ) )),
% 0.11/0.51    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.11/0.51  fof(f45,conjecture,(
% 0.11/0.51    (! [U,V,W,X] :( ( contains_slb(V,X)& strictly_less_than(X,findmin_cpq_res(triple(U,V,W))) )=> ( pair_in_list(update_slb(V,findmin_pqp_res(U)),X,findmin_pqp_res(U))| (? [Y] :( pair_in_list(update_slb(V,findmin_pqp_res(U)),X,Y)& less_than(findmin_pqp_res(U),Y) ) )) ) )),
% 0.11/0.51    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.11/0.51  fof(f46,negated_conjecture,(
% 0.11/0.51    ~((! [U,V,W,X] :( ( contains_slb(V,X)& strictly_less_than(X,findmin_cpq_res(triple(U,V,W))) )=> ( pair_in_list(update_slb(V,findmin_pqp_res(U)),X,findmin_pqp_res(U))| (? [Y] :( pair_in_list(update_slb(V,findmin_pqp_res(U)),X,Y)& less_than(findmin_pqp_res(U),Y) ) )) ) ))),
% 0.11/0.51    inference(negated_conjecture,[status(cth)],[f45])).
% 0.11/0.51  fof(f50,plain,(
% 0.11/0.51    ![X0,X1]: (less_than(X0,X1)|less_than(X1,X0))),
% 0.11/0.51    inference(cnf_transformation,[status(thm)],[f2])).
% 0.11/0.51  fof(f52,plain,(
% 0.11/0.51    ![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.11/0.51    inference(NNF_transformation,[status(thm)],[f4])).
% 0.11/0.51  fof(f53,plain,(
% 0.11/0.51    (![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.11/0.51    inference(miniscoping,[status(thm)],[f52])).
% 0.11/0.51  fof(f56,plain,(
% 0.11/0.51    ![X0,X1]: (strictly_less_than(X0,X1)|~less_than(X0,X1)|less_than(X1,X0))),
% 0.11/0.51    inference(cnf_transformation,[status(thm)],[f53])).
% 0.11/0.51  fof(f147,plain,(
% 0.11/0.51    ![U,V]: (~contains_slb(U,V)|(?[W]: pair_in_list(U,V,W)))),
% 0.11/0.51    inference(pre_NNF_transformation,[status(thm)],[f42])).
% 0.11/0.51  fof(f148,plain,(
% 0.11/0.51    ![U,V]: (~contains_slb(U,V)|pair_in_list(U,V,sK0_skl(V,U)))),
% 0.11/0.51    inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl]),skolemize(W,sK0_skl(V,U))],[f147])).
% 0.11/0.51  fof(f149,plain,(
% 0.11/0.51    ![X0,X1]: (~contains_slb(X0,X1)|pair_in_list(X0,X1,sK0_skl(X1,X0)))),
% 0.11/0.51    inference(cnf_transformation,[status(thm)],[f148])).
% 0.11/0.51  fof(f150,plain,(
% 0.11/0.51    ![U,V,W,X]: ((~pair_in_list(U,V,W)|~strictly_less_than(W,X))|pair_in_list(update_slb(U,X),V,X))),
% 0.11/0.51    inference(pre_NNF_transformation,[status(thm)],[f43])).
% 0.11/0.51  fof(f151,plain,(
% 0.11/0.51    ![U,V,X]: ((![W]: (~pair_in_list(U,V,W)|~strictly_less_than(W,X)))|pair_in_list(update_slb(U,X),V,X))),
% 0.11/0.51    inference(miniscoping,[status(thm)],[f150])).
% 0.11/0.51  fof(f152,plain,(
% 0.11/0.51    ![X0,X1,X2,X3]: (~pair_in_list(X0,X1,X2)|~strictly_less_than(X2,X3)|pair_in_list(update_slb(X0,X3),X1,X3))),
% 0.11/0.51    inference(cnf_transformation,[status(thm)],[f151])).
% 0.11/0.51  fof(f153,plain,(
% 0.11/0.51    ![U,V,W,X]: ((~pair_in_list(U,V,W)|~less_than(X,W))|pair_in_list(update_slb(U,X),V,W))),
% 0.11/0.51    inference(pre_NNF_transformation,[status(thm)],[f44])).
% 0.11/0.51  fof(f154,plain,(
% 0.11/0.51    ![X0,X1,X2,X3]: (~pair_in_list(X0,X1,X2)|~less_than(X3,X2)|pair_in_list(update_slb(X0,X3),X1,X2))),
% 0.11/0.51    inference(cnf_transformation,[status(thm)],[f153])).
% 0.11/0.51  fof(f155,plain,(
% 0.11/0.51    (?[U,V,W,X]: ((contains_slb(V,X)&strictly_less_than(X,findmin_cpq_res(triple(U,V,W))))&(~pair_in_list(update_slb(V,findmin_pqp_res(U)),X,findmin_pqp_res(U))&(![Y]: (~pair_in_list(update_slb(V,findmin_pqp_res(U)),X,Y)|~less_than(findmin_pqp_res(U),Y))))))),
% 0.11/0.51    inference(pre_NNF_transformation,[status(thm)],[f46])).
% 0.11/0.51  fof(f156,plain,(
% 0.11/0.51    ?[U,V,X]: ((contains_slb(V,X)&(?[W]: strictly_less_than(X,findmin_cpq_res(triple(U,V,W)))))&(~pair_in_list(update_slb(V,findmin_pqp_res(U)),X,findmin_pqp_res(U))&(![Y]: (~pair_in_list(update_slb(V,findmin_pqp_res(U)),X,Y)|~less_than(findmin_pqp_res(U),Y)))))),
% 0.11/0.52    inference(miniscoping,[status(thm)],[f155])).
% 0.11/0.52  fof(f157,plain,(
% 0.11/0.52    ((contains_slb(sK2_skl,sK3_skl)&strictly_less_than(sK3_skl,findmin_cpq_res(triple(sK1_skl,sK2_skl,sK4_skl))))&(~pair_in_list(update_slb(sK2_skl,findmin_pqp_res(sK1_skl)),sK3_skl,findmin_pqp_res(sK1_skl))&(![Y]: (~pair_in_list(update_slb(sK2_skl,findmin_pqp_res(sK1_skl)),sK3_skl,Y)|~less_than(findmin_pqp_res(sK1_skl),Y)))))),
% 0.11/0.52    inference(skolemize,[status(esa),new_symbols(skolem,[sK1_skl,sK2_skl,sK3_skl,sK4_skl]),skolemize(U,sK1_skl),skolemize(V,sK2_skl),skolemize(X,sK3_skl),skolemize(W,sK4_skl)],[f156])).
% 0.11/0.52  fof(f158,plain,(
% 0.11/0.52    contains_slb(sK2_skl,sK3_skl)),
% 0.11/0.52    inference(cnf_transformation,[status(thm)],[f157])).
% 0.11/0.52  fof(f160,plain,(
% 0.11/0.52    ~pair_in_list(update_slb(sK2_skl,findmin_pqp_res(sK1_skl)),sK3_skl,findmin_pqp_res(sK1_skl))),
% 0.11/0.52    inference(cnf_transformation,[status(thm)],[f157])).
% 0.11/0.52  fof(f161,plain,(
% 0.11/0.52    ![X0]: (~pair_in_list(update_slb(sK2_skl,findmin_pqp_res(sK1_skl)),sK3_skl,X0)|~less_than(findmin_pqp_res(sK1_skl),X0))),
% 0.11/0.52    inference(cnf_transformation,[status(thm)],[f157])).
% 0.11/0.52  fof(f170,plain,(
% 0.11/0.52    ![X0,X1]: (strictly_less_than(X0,X1)|less_than(X1,X0))),
% 0.11/0.52    inference(forward_subsumption_resolution,[status(thm)],[f56,f50])).
% 0.11/0.52  fof(f288,plain,(
% 0.11/0.52    ![X0,X1,X2,X3]: (~pair_in_list(X0,X1,X2)|pair_in_list(update_slb(X0,X3),X1,X3)|less_than(X3,X2))),
% 0.11/0.52    inference(resolution,[status(thm)],[f152,f170])).
% 0.11/0.52  fof(f290,plain,(
% 0.11/0.52    ![X0]: (~pair_in_list(sK2_skl,sK3_skl,X0)|~less_than(findmin_pqp_res(sK1_skl),X0)|~less_than(findmin_pqp_res(sK1_skl),X0))),
% 0.11/0.52    inference(resolution,[status(thm)],[f154,f161])).
% 0.11/0.52  fof(f300,plain,(
% 0.11/0.52    ![X0]: (~pair_in_list(sK2_skl,sK3_skl,X0)|~less_than(findmin_pqp_res(sK1_skl),X0))),
% 0.11/0.52    inference(duplicate_literals_removal,[status(thm)],[f290])).
% 0.11/0.52  fof(f485,plain,(
% 0.11/0.52    pair_in_list(sK2_skl,sK3_skl,sK0_skl(sK3_skl,sK2_skl))),
% 0.11/0.52    inference(resolution,[status(thm)],[f149,f158])).
% 0.11/0.52  fof(f488,plain,(
% 0.11/0.52    ~less_than(findmin_pqp_res(sK1_skl),sK0_skl(sK3_skl,sK2_skl))),
% 0.11/0.52    inference(resolution,[status(thm)],[f485,f300])).
% 0.11/0.52  fof(f489,plain,(
% 0.11/0.52    ![X0]: (pair_in_list(update_slb(sK2_skl,X0),sK3_skl,X0)|less_than(X0,sK0_skl(sK3_skl,sK2_skl)))),
% 0.11/0.52    inference(resolution,[status(thm)],[f485,f288])).
% 0.11/0.52  fof(f654,plain,(
% 0.11/0.52    less_than(findmin_pqp_res(sK1_skl),sK0_skl(sK3_skl,sK2_skl))),
% 0.11/0.52    inference(resolution,[status(thm)],[f489,f160])).
% 0.11/0.52  fof(f658,plain,(
% 0.11/0.52    $false),
% 0.11/0.52    inference(forward_subsumption_resolution,[status(thm)],[f654,f488])).
% 0.11/0.52  % SZS output end CNFRefutation for theBenchmark.p
% 0.18/0.55  % Elapsed time: 0.189700 seconds
% 0.18/0.55  % CPU time: 1.180816 seconds
% 0.18/0.55  % Total memory used: 122.196 MB
% 0.18/0.55  % Net memory used: 120.240 MB
%------------------------------------------------------------------------------