↑ 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  : SWV417+1 : 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 : 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:44 PM UTC 2026

% Result   : Theorem 0.09s 0.40s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWV417+1 : 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.09/0.35  % Computer : n010.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Mon Sep 21 08:45:40 UTC 2026
% 0.09/0.35  % CPUTime  : 
% 0.09/0.38  % Drodi V4.1.1
% 0.09/0.40  % Refutation found
% 0.09/0.40  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.09/0.40  % SZS output start CNFRefutation for theBenchmark
% 0.09/0.40  fof(f14,axiom,(
% 0.09/0.40    (! [U,V] :( ( contains_pq(U,V)& issmallestelement_pq(U,V) )=> findmin_pq_res(U,V) = V ) )),
% 0.09/0.40    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.09/0.40  fof(f58,axiom,(
% 0.09/0.40    (! [U,V] :( pi_sharp_find_min(U,V)<=> ( contains_pq(U,V)& issmallestelement_pq(U,V) ) ) )),
% 0.09/0.40    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.09/0.40  fof(f63,lemma,(
% 0.09/0.40    (! [U,V,W] :( phi(findmin_cpq_eff(triple(U,V,W)))=> pi_sharp_find_min(i(triple(U,V,W)),findmin_cpq_res(triple(U,V,W))) ) )),
% 0.09/0.40    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.09/0.40  fof(f64,conjecture,(
% 0.09/0.40    (! [U,V,W] :( pi_find_min(triple(U,V,W))=> ( phi(findmin_cpq_eff(triple(U,V,W)))=> (? [X] :( pi_sharp_find_min(i(triple(U,V,W)),X)& findmin_cpq_res(triple(U,V,W)) = findmin_pq_res(i(triple(U,V,W)),X) ) )) ) )),
% 0.09/0.40    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.09/0.40  fof(f65,negated_conjecture,(
% 0.09/0.40    ~((! [U,V,W] :( pi_find_min(triple(U,V,W))=> ( phi(findmin_cpq_eff(triple(U,V,W)))=> (? [X] :( pi_sharp_find_min(i(triple(U,V,W)),X)& findmin_cpq_res(triple(U,V,W)) = findmin_pq_res(i(triple(U,V,W)),X) ) )) ) ))),
% 0.09/0.40    inference(negated_conjecture,[status(cth)],[f64])).
% 0.09/0.40  fof(f97,plain,(
% 0.09/0.40    ![U,V]: ((~contains_pq(U,V)|~issmallestelement_pq(U,V))|findmin_pq_res(U,V)=V)),
% 0.09/0.40    inference(pre_NNF_transformation,[status(thm)],[f14])).
% 0.09/0.40  fof(f98,plain,(
% 0.09/0.40    ![X0,X1]: (~contains_pq(X0,X1)|~issmallestelement_pq(X0,X1)|findmin_pq_res(X0,X1)=X1)),
% 0.09/0.40    inference(cnf_transformation,[status(thm)],[f97])).
% 0.09/0.40  fof(f203,plain,(
% 0.09/0.40    ![U,V]: ((~pi_sharp_find_min(U,V)|(contains_pq(U,V)&issmallestelement_pq(U,V)))&(pi_sharp_find_min(U,V)|(~contains_pq(U,V)|~issmallestelement_pq(U,V))))),
% 0.09/0.40    inference(NNF_transformation,[status(thm)],[f58])).
% 0.09/0.40  fof(f204,plain,(
% 0.09/0.40    (![U,V]: (~pi_sharp_find_min(U,V)|(contains_pq(U,V)&issmallestelement_pq(U,V))))&(![U,V]: (pi_sharp_find_min(U,V)|(~contains_pq(U,V)|~issmallestelement_pq(U,V))))),
% 0.09/0.40    inference(miniscoping,[status(thm)],[f203])).
% 0.09/0.40  fof(f205,plain,(
% 0.09/0.40    ![X0,X1]: (~pi_sharp_find_min(X0,X1)|contains_pq(X0,X1))),
% 0.09/0.40    inference(cnf_transformation,[status(thm)],[f204])).
% 0.09/0.40  fof(f206,plain,(
% 0.09/0.40    ![X0,X1]: (~pi_sharp_find_min(X0,X1)|issmallestelement_pq(X0,X1))),
% 0.09/0.40    inference(cnf_transformation,[status(thm)],[f204])).
% 0.09/0.40  fof(f230,plain,(
% 0.09/0.40    ![U,V,W]: (~phi(findmin_cpq_eff(triple(U,V,W)))|pi_sharp_find_min(i(triple(U,V,W)),findmin_cpq_res(triple(U,V,W))))),
% 0.09/0.40    inference(pre_NNF_transformation,[status(thm)],[f63])).
% 0.09/0.40  fof(f231,plain,(
% 0.09/0.40    ![X0,X1,X2]: (~phi(findmin_cpq_eff(triple(X0,X1,X2)))|pi_sharp_find_min(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2))))),
% 0.09/0.40    inference(cnf_transformation,[status(thm)],[f230])).
% 0.09/0.40  fof(f232,plain,(
% 0.09/0.40    (?[U,V,W]: (pi_find_min(triple(U,V,W))&(phi(findmin_cpq_eff(triple(U,V,W)))&(![X]: (~pi_sharp_find_min(i(triple(U,V,W)),X)|~findmin_cpq_res(triple(U,V,W))=findmin_pq_res(i(triple(U,V,W)),X))))))),
% 0.09/0.40    inference(pre_NNF_transformation,[status(thm)],[f65])).
% 0.09/0.40  fof(f233,plain,(
% 0.09/0.40    (pi_find_min(triple(sK4_skl,sK5_skl,sK6_skl))&(phi(findmin_cpq_eff(triple(sK4_skl,sK5_skl,sK6_skl)))&(![X]: (~pi_sharp_find_min(i(triple(sK4_skl,sK5_skl,sK6_skl)),X)|~findmin_cpq_res(triple(sK4_skl,sK5_skl,sK6_skl))=findmin_pq_res(i(triple(sK4_skl,sK5_skl,sK6_skl)),X)))))),
% 0.09/0.40    inference(skolemize,[status(esa),new_symbols(skolem,[sK4_skl,sK5_skl,sK6_skl]),skolemize(U,sK4_skl),skolemize(V,sK5_skl),skolemize(W,sK6_skl)],[f232])).
% 0.09/0.40  fof(f235,plain,(
% 0.09/0.40    phi(findmin_cpq_eff(triple(sK4_skl,sK5_skl,sK6_skl)))),
% 0.09/0.40    inference(cnf_transformation,[status(thm)],[f233])).
% 0.09/0.40  fof(f236,plain,(
% 0.09/0.40    ![X0]: (~pi_sharp_find_min(i(triple(sK4_skl,sK5_skl,sK6_skl)),X0)|~findmin_cpq_res(triple(sK4_skl,sK5_skl,sK6_skl))=findmin_pq_res(i(triple(sK4_skl,sK5_skl,sK6_skl)),X0))),
% 0.09/0.40    inference(cnf_transformation,[status(thm)],[f233])).
% 0.09/0.40  fof(f244,plain,(
% 0.09/0.40    pi_sharp_find_min(i(triple(sK4_skl,sK5_skl,sK6_skl)),findmin_cpq_res(triple(sK4_skl,sK5_skl,sK6_skl)))),
% 0.09/0.40    inference(resolution,[status(thm)],[f231,f235])).
% 0.09/0.40  fof(f246,plain,(
% 0.09/0.40    issmallestelement_pq(i(triple(sK4_skl,sK5_skl,sK6_skl)),findmin_cpq_res(triple(sK4_skl,sK5_skl,sK6_skl)))),
% 0.09/0.41    inference(resolution,[status(thm)],[f244,f206])).
% 0.09/0.41  fof(f247,plain,(
% 0.09/0.41    contains_pq(i(triple(sK4_skl,sK5_skl,sK6_skl)),findmin_cpq_res(triple(sK4_skl,sK5_skl,sK6_skl)))),
% 0.09/0.41    inference(resolution,[status(thm)],[f244,f205])).
% 0.09/0.41  fof(f253,plain,(
% 0.09/0.41    ~contains_pq(i(triple(sK4_skl,sK5_skl,sK6_skl)),findmin_cpq_res(triple(sK4_skl,sK5_skl,sK6_skl)))|findmin_pq_res(i(triple(sK4_skl,sK5_skl,sK6_skl)),findmin_cpq_res(triple(sK4_skl,sK5_skl,sK6_skl)))=findmin_cpq_res(triple(sK4_skl,sK5_skl,sK6_skl))),
% 0.09/0.41    inference(resolution,[status(thm)],[f246,f98])).
% 0.09/0.41  fof(f262,plain,(
% 0.09/0.41    findmin_pq_res(i(triple(sK4_skl,sK5_skl,sK6_skl)),findmin_cpq_res(triple(sK4_skl,sK5_skl,sK6_skl)))=findmin_cpq_res(triple(sK4_skl,sK5_skl,sK6_skl))),
% 0.09/0.41    inference(forward_subsumption_resolution,[status(thm)],[f253,f247])).
% 0.09/0.41  fof(f263,plain,(
% 0.09/0.41    ~pi_sharp_find_min(i(triple(sK4_skl,sK5_skl,sK6_skl)),findmin_cpq_res(triple(sK4_skl,sK5_skl,sK6_skl)))),
% 0.09/0.41    inference(resolution,[status(thm)],[f262,f236])).
% 0.09/0.41  fof(f266,plain,(
% 0.09/0.41    $false),
% 0.09/0.41    inference(forward_subsumption_resolution,[status(thm)],[f263,f244])).
% 0.09/0.41  % SZS output end CNFRefutation for theBenchmark.p
% 0.12/0.43  % Elapsed time: 0.064080 seconds
% 0.12/0.43  % CPU time: 0.156237 seconds
% 0.12/0.43  % Total memory used: 49.279 MB
% 0.12/0.43  % Net memory used: 49.235 MB
%------------------------------------------------------------------------------