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

% Computer : n018.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:12:37 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  : SET797+4 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.03  % Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.35  % Computer : n018.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 05:40:43 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.37  % 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(f1,axiom,(
% 0.09/0.40    (! [A,B] :( subset(A,B)<=> (! [X] :( member(X,A)=> member(X,B) ) )) )),
% 0.09/0.40    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.09/0.40  fof(f14,axiom,(
% 0.09/0.40    (! [R,E,M] :( upper_bound(M,R,E)<=> (! [X] :( member(X,E)=> apply(R,X,M) ) )) )),
% 0.09/0.40    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.09/0.40  fof(f22,conjecture,(
% 0.09/0.40    (! [R,E] :( order(R,E)=> (! [X,Y] :( ( subset(X,E)& subset(Y,E)& subset(X,Y) )=> (! [M] :( upper_bound(M,R,Y)=> upper_bound(M,R,X) ) )) )) )),
% 0.09/0.40    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.09/0.40  fof(f23,negated_conjecture,(
% 0.09/0.40    ~((! [R,E] :( order(R,E)=> (! [X,Y] :( ( subset(X,E)& subset(Y,E)& subset(X,Y) )=> (! [M] :( upper_bound(M,R,Y)=> upper_bound(M,R,X) ) )) )) ))),
% 0.09/0.40    inference(negated_conjecture,[status(cth)],[f22])).
% 0.09/0.40  fof(f24,plain,(
% 0.09/0.40    ![A,B]: (subset(A,B)<=>(![X]: (~member(X,A)|member(X,B))))),
% 0.09/0.40    inference(pre_NNF_transformation,[status(thm)],[f1])).
% 0.09/0.40  fof(f25,plain,(
% 0.09/0.40    ![A,B]: ((~subset(A,B)|(![X]: (~member(X,A)|member(X,B))))&(subset(A,B)|(?[X]: (member(X,A)&~member(X,B)))))),
% 0.09/0.40    inference(NNF_transformation,[status(thm)],[f24])).
% 0.09/0.40  fof(f26,plain,(
% 0.09/0.40    (![A,B]: (~subset(A,B)|(![X]: (~member(X,A)|member(X,B)))))&(![A,B]: (subset(A,B)|(?[X]: (member(X,A)&~member(X,B)))))),
% 0.09/0.40    inference(miniscoping,[status(thm)],[f25])).
% 0.09/0.40  fof(f27,plain,(
% 0.09/0.40    (![A,B]: (~subset(A,B)|(![X]: (~member(X,A)|member(X,B)))))&(![A,B]: (subset(A,B)|(member(sK0_skl(B,A),A)&~member(sK0_skl(B,A),B))))),
% 0.09/0.40    inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl]),skolemize(X,sK0_skl(B,A))],[f26])).
% 0.09/0.40  fof(f28,plain,(
% 0.09/0.40    ![X0,X1,X2]: (~subset(X0,X1)|~member(X2,X0)|member(X2,X1))),
% 0.09/0.40    inference(cnf_transformation,[status(thm)],[f27])).
% 0.09/0.40  fof(f102,plain,(
% 0.09/0.40    ![R,E,M]: (upper_bound(M,R,E)<=>(![X]: (~member(X,E)|apply(R,X,M))))),
% 0.09/0.40    inference(pre_NNF_transformation,[status(thm)],[f14])).
% 0.09/0.40  fof(f103,plain,(
% 0.09/0.40    ![R,E,M]: ((~upper_bound(M,R,E)|(![X]: (~member(X,E)|apply(R,X,M))))&(upper_bound(M,R,E)|(?[X]: (member(X,E)&~apply(R,X,M)))))),
% 0.09/0.40    inference(NNF_transformation,[status(thm)],[f102])).
% 0.09/0.40  fof(f104,plain,(
% 0.09/0.40    (![R,E,M]: (~upper_bound(M,R,E)|(![X]: (~member(X,E)|apply(R,X,M)))))&(![R,E,M]: (upper_bound(M,R,E)|(?[X]: (member(X,E)&~apply(R,X,M)))))),
% 0.09/0.40    inference(miniscoping,[status(thm)],[f103])).
% 0.09/0.40  fof(f105,plain,(
% 0.09/0.40    (![R,E,M]: (~upper_bound(M,R,E)|(![X]: (~member(X,E)|apply(R,X,M)))))&(![R,E,M]: (upper_bound(M,R,E)|(member(sK8_skl(M,E,R),E)&~apply(R,sK8_skl(M,E,R),M))))),
% 0.09/0.40    inference(skolemize,[status(esa),new_symbols(skolem,[sK8_skl]),skolemize(X,sK8_skl(M,E,R))],[f104])).
% 0.09/0.40  fof(f106,plain,(
% 0.09/0.40    ![X0,X1,X2,X3]: (~upper_bound(X0,X1,X2)|~member(X3,X2)|apply(X1,X3,X0))),
% 0.09/0.40    inference(cnf_transformation,[status(thm)],[f105])).
% 0.09/0.40  fof(f107,plain,(
% 0.09/0.40    ![X0,X1,X2]: (upper_bound(X0,X1,X2)|member(sK8_skl(X0,X2,X1),X2))),
% 0.09/0.40    inference(cnf_transformation,[status(thm)],[f105])).
% 0.09/0.40  fof(f108,plain,(
% 0.09/0.40    ![X0,X1,X2]: (upper_bound(X0,X1,X2)|~apply(X1,sK8_skl(X0,X2,X1),X0))),
% 0.09/0.40    inference(cnf_transformation,[status(thm)],[f105])).
% 0.09/0.40  fof(f170,plain,(
% 0.09/0.40    (?[R,E]: (order(R,E)&(?[X,Y]: (((subset(X,E)&subset(Y,E))&subset(X,Y))&(?[M]: (upper_bound(M,R,Y)&~upper_bound(M,R,X)))))))),
% 0.09/0.40    inference(pre_NNF_transformation,[status(thm)],[f23])).
% 0.09/0.40  fof(f171,plain,(
% 0.09/0.40    (order(sK16_skl,sK17_skl)&(((subset(sK18_skl,sK17_skl)&subset(sK19_skl,sK17_skl))&subset(sK18_skl,sK19_skl))&(upper_bound(sK20_skl,sK16_skl,sK19_skl)&~upper_bound(sK20_skl,sK16_skl,sK18_skl))))),
% 0.09/0.40    inference(skolemize,[status(esa),new_symbols(skolem,[sK16_skl,sK17_skl,sK18_skl,sK19_skl,sK20_skl]),skolemize(R,sK16_skl),skolemize(E,sK17_skl),skolemize(X,sK18_skl),skolemize(Y,sK19_skl),skolemize(M,sK20_skl)],[f170])).
% 0.09/0.40  fof(f175,plain,(
% 0.09/0.40    subset(sK18_skl,sK19_skl)),
% 0.09/0.40    inference(cnf_transformation,[status(thm)],[f171])).
% 0.09/0.40  fof(f176,plain,(
% 0.09/0.40    upper_bound(sK20_skl,sK16_skl,sK19_skl)),
% 0.09/0.40    inference(cnf_transformation,[status(thm)],[f171])).
% 0.09/0.40  fof(f177,plain,(
% 0.09/0.40    ~upper_bound(sK20_skl,sK16_skl,sK18_skl)),
% 0.09/0.40    inference(cnf_transformation,[status(thm)],[f171])).
% 0.09/0.40  fof(f347,plain,(
% 0.09/0.40    ![X0,X1,X2,X3]: (upper_bound(X0,X1,X2)|~upper_bound(X0,X1,X3)|~member(sK8_skl(X0,X2,X1),X3))),
% 0.09/0.40    inference(resolution,[status(thm)],[f108,f106])).
% 0.09/0.40  fof(f399,plain,(
% 0.09/0.40    ![X0]: (upper_bound(sK20_skl,sK16_skl,X0)|~member(sK8_skl(sK20_skl,X0,sK16_skl),sK19_skl))),
% 0.09/0.40    inference(resolution,[status(thm)],[f347,f176])).
% 0.09/0.40  fof(f451,plain,(
% 0.09/0.40    ![X0,X1]: (upper_bound(sK20_skl,sK16_skl,X0)|~subset(X1,sK19_skl)|~member(sK8_skl(sK20_skl,X0,sK16_skl),X1))),
% 0.09/0.40    inference(resolution,[status(thm)],[f399,f28])).
% 0.09/0.40  fof(f578,plain,(
% 0.09/0.40    ![X0]: (upper_bound(sK20_skl,sK16_skl,X0)|~member(sK8_skl(sK20_skl,X0,sK16_skl),sK18_skl))),
% 0.09/0.40    inference(resolution,[status(thm)],[f451,f175])).
% 0.09/0.40  fof(f581,plain,(
% 0.09/0.40    upper_bound(sK20_skl,sK16_skl,sK18_skl)|upper_bound(sK20_skl,sK16_skl,sK18_skl)),
% 0.09/0.40    inference(resolution,[status(thm)],[f578,f107])).
% 0.09/0.40  fof(f583,plain,(
% 0.09/0.40    upper_bound(sK20_skl,sK16_skl,sK18_skl)),
% 0.09/0.40    inference(duplicate_literals_removal,[status(thm)],[f581])).
% 0.09/0.40  fof(f584,plain,(
% 0.09/0.40    $false),
% 0.09/0.40    inference(forward_subsumption_resolution,[status(thm)],[f583,f177])).
% 0.09/0.40  % SZS output end CNFRefutation for theBenchmark.p
% 0.13/0.44  % Elapsed time: 0.073753 seconds
% 0.13/0.44  % CPU time: 0.245610 seconds
% 0.13/0.44  % Total memory used: 34.096 MB
% 0.13/0.44  % Net memory used: 33.745 MB
%------------------------------------------------------------------------------