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

% Computer : n008.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:11:42 PM UTC 2026

% Result   : Theorem 0.18s 5.89s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET173+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.04  % Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/5.60  % Computer : n008.cluster.edu
% 0.12/5.60  % Model    : x86_64 x86_64
% 0.12/5.60  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.60  % Memory   : 8046.5625MB
% 0.12/5.60  % OS       : Linux 6.8.0-71-generic
% 0.12/5.60  % CPULimit : 300
% 0.12/5.60  % WCLimit  : 300
% 0.12/5.60  % DateTime : Mon Sep 21 04:59:48 UTC 2026
% 0.12/5.60  % CPUTime  : 
% 0.12/5.62  % Drodi V4.1.1
% 0.18/5.89  % Refutation found
% 0.18/5.89  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.18/5.89  % SZS output start CNFRefutation for theBenchmark
% 0.18/5.89  fof(f1,axiom,(
% 0.18/5.89    (! [B,C,D] :( member(D,union(B,C))<=> ( member(D,B)| member(D,C) ) ) )),
% 0.18/5.89    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.18/5.89  fof(f2,axiom,(
% 0.18/5.89    (! [B,C,D] :( member(D,intersection(B,C))<=> ( member(D,B)& member(D,C) ) ) )),
% 0.18/5.89    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.18/5.89  fof(f3,axiom,(
% 0.18/5.89    (! [B,C] :( B = C<=> ( subset(B,C)& subset(C,B) ) ) )),
% 0.18/5.89    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.18/5.89  fof(f4,axiom,(
% 0.18/5.89    (! [B,C] : union(B,C) = union(C,B) )),
% 0.18/5.89    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.18/5.89  fof(f5,axiom,(
% 0.18/5.89    (! [B,C] : intersection(B,C) = intersection(C,B) )),
% 0.18/5.89    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.18/5.89  fof(f6,axiom,(
% 0.18/5.89    (! [B,C] :( subset(B,C)<=> (! [D] :( member(D,B)=> member(D,C) ) )) )),
% 0.18/5.89    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.18/5.89  fof(f9,conjecture,(
% 0.18/5.89    (! [B,C] : intersection(B,union(B,C)) = B )),
% 0.18/5.89    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.18/5.89  fof(f10,negated_conjecture,(
% 0.18/5.89    ~((! [B,C] : intersection(B,union(B,C)) = B ))),
% 0.18/5.89    inference(negated_conjecture,[status(cth)],[f9])).
% 0.18/5.89  fof(f11,plain,(
% 0.18/5.89    ![B,C,D]: ((~member(D,union(B,C))|(member(D,B)|member(D,C)))&(member(D,union(B,C))|(~member(D,B)&~member(D,C))))),
% 0.18/5.89    inference(NNF_transformation,[status(thm)],[f1])).
% 0.18/5.89  fof(f12,plain,(
% 0.18/5.89    (![B,C,D]: (~member(D,union(B,C))|(member(D,B)|member(D,C))))&(![B,C,D]: (member(D,union(B,C))|(~member(D,B)&~member(D,C))))),
% 0.18/5.89    inference(miniscoping,[status(thm)],[f11])).
% 0.18/5.89  fof(f15,plain,(
% 0.18/5.89    ![X0,X1,X2]: (member(X0,union(X1,X2))|~member(X0,X2))),
% 0.18/5.89    inference(cnf_transformation,[status(thm)],[f12])).
% 0.18/5.89  fof(f16,plain,(
% 0.18/5.89    ![B,C,D]: ((~member(D,intersection(B,C))|(member(D,B)&member(D,C)))&(member(D,intersection(B,C))|(~member(D,B)|~member(D,C))))),
% 0.18/5.89    inference(NNF_transformation,[status(thm)],[f2])).
% 0.18/5.89  fof(f17,plain,(
% 0.18/5.89    (![B,C,D]: (~member(D,intersection(B,C))|(member(D,B)&member(D,C))))&(![B,C,D]: (member(D,intersection(B,C))|(~member(D,B)|~member(D,C))))),
% 0.18/5.89    inference(miniscoping,[status(thm)],[f16])).
% 0.18/5.89  fof(f18,plain,(
% 0.18/5.89    ![X0,X1,X2]: (~member(X0,intersection(X1,X2))|member(X0,X1))),
% 0.18/5.89    inference(cnf_transformation,[status(thm)],[f17])).
% 0.18/5.89  fof(f20,plain,(
% 0.18/5.89    ![X0,X1,X2]: (member(X0,intersection(X1,X2))|~member(X0,X1)|~member(X0,X2))),
% 0.18/5.89    inference(cnf_transformation,[status(thm)],[f17])).
% 0.18/5.89  fof(f21,plain,(
% 0.18/5.89    ![B,C]: ((~B=C|(subset(B,C)&subset(C,B)))&(B=C|(~subset(B,C)|~subset(C,B))))),
% 0.18/5.89    inference(NNF_transformation,[status(thm)],[f3])).
% 0.18/5.89  fof(f22,plain,(
% 0.18/5.89    (![B,C]: (~B=C|(subset(B,C)&subset(C,B))))&(![B,C]: (B=C|(~subset(B,C)|~subset(C,B))))),
% 0.18/5.89    inference(miniscoping,[status(thm)],[f21])).
% 0.18/5.89  fof(f25,plain,(
% 0.18/5.89    ![X0,X1]: (X0=X1|~subset(X0,X1)|~subset(X1,X0))),
% 0.18/5.89    inference(cnf_transformation,[status(thm)],[f22])).
% 0.18/5.89  fof(f26,plain,(
% 0.18/5.89    ![X0,X1]: (union(X0,X1)=union(X1,X0))),
% 0.18/5.89    inference(cnf_transformation,[status(thm)],[f4])).
% 0.18/5.89  fof(f27,plain,(
% 0.18/5.89    ![X0,X1]: (intersection(X0,X1)=intersection(X1,X0))),
% 0.18/5.89    inference(cnf_transformation,[status(thm)],[f5])).
% 0.18/5.89  fof(f28,plain,(
% 0.18/5.89    ![B,C]: (subset(B,C)<=>(![D]: (~member(D,B)|member(D,C))))),
% 0.18/5.89    inference(pre_NNF_transformation,[status(thm)],[f6])).
% 0.18/5.89  fof(f29,plain,(
% 0.18/5.89    ![B,C]: ((~subset(B,C)|(![D]: (~member(D,B)|member(D,C))))&(subset(B,C)|(?[D]: (member(D,B)&~member(D,C)))))),
% 0.18/5.89    inference(NNF_transformation,[status(thm)],[f28])).
% 0.18/5.89  fof(f30,plain,(
% 0.18/5.89    (![B,C]: (~subset(B,C)|(![D]: (~member(D,B)|member(D,C)))))&(![B,C]: (subset(B,C)|(?[D]: (member(D,B)&~member(D,C)))))),
% 0.18/5.89    inference(miniscoping,[status(thm)],[f29])).
% 0.18/5.89  fof(f31,plain,(
% 0.18/5.89    (![B,C]: (~subset(B,C)|(![D]: (~member(D,B)|member(D,C)))))&(![B,C]: (subset(B,C)|(member(sK0_skl(C,B),B)&~member(sK0_skl(C,B),C))))),
% 0.18/5.89    inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl]),skolemize(D,sK0_skl(C,B))],[f30])).
% 0.18/5.89  fof(f33,plain,(
% 0.18/5.89    ![X0,X1]: (subset(X0,X1)|member(sK0_skl(X1,X0),X0))),
% 0.18/5.89    inference(cnf_transformation,[status(thm)],[f31])).
% 0.18/5.89  fof(f34,plain,(
% 0.18/5.89    ![X0,X1]: (subset(X0,X1)|~member(sK0_skl(X1,X0),X1))),
% 0.18/5.89    inference(cnf_transformation,[status(thm)],[f31])).
% 0.18/5.90  fof(f43,plain,(
% 0.18/5.90    (?[B,C]: ~intersection(B,union(B,C))=B)),
% 0.18/5.90    inference(pre_NNF_transformation,[status(thm)],[f10])).
% 0.18/5.90  fof(f44,plain,(
% 0.18/5.90    ~intersection(sK2_skl,union(sK2_skl,sK3_skl))=sK2_skl),
% 0.18/5.90    inference(skolemize,[status(esa),new_symbols(skolem,[sK2_skl,sK3_skl]),skolemize(B,sK2_skl),skolemize(C,sK3_skl)],[f43])).
% 0.18/5.90  fof(f45,plain,(
% 0.18/5.90    ~intersection(sK2_skl,union(sK2_skl,sK3_skl))=sK2_skl),
% 0.18/5.90    inference(cnf_transformation,[status(thm)],[f44])).
% 0.18/5.90  fof(f52,plain,(
% 0.18/5.90    ~intersection(sK2_skl,union(sK3_skl,sK2_skl))=sK2_skl),
% 0.18/5.90    inference(paramodulation,[status(thm)],[f26,f45])).
% 0.18/5.90  fof(f66,plain,(
% 0.18/5.90    ![X0,X1,X2]: (subset(intersection(X0,X1),X2)|member(sK0_skl(X2,intersection(X0,X1)),X0))),
% 0.18/5.90    inference(resolution,[status(thm)],[f33,f18])).
% 0.18/5.90  fof(f68,plain,(
% 0.18/5.90    ![X0,X1,X2]: (subset(X0,X1)|member(sK0_skl(X1,X0),intersection(X2,X0))|~member(sK0_skl(X1,X0),X2))),
% 0.18/5.90    inference(resolution,[status(thm)],[f33,f20])).
% 0.18/5.90  fof(f69,plain,(
% 0.18/5.90    ![X0,X1,X2]: (subset(X0,X1)|member(sK0_skl(X1,X0),union(X2,X0)))),
% 0.18/5.90    inference(resolution,[status(thm)],[f33,f15])).
% 0.18/5.90  fof(f87,plain,(
% 0.18/5.90    ![X0,X1]: (subset(intersection(X0,X1),X0)|subset(intersection(X0,X1),X0))),
% 0.18/5.90    inference(resolution,[status(thm)],[f34,f66])).
% 0.18/5.90  fof(f90,plain,(
% 0.18/5.90    ![X0,X1]: (subset(intersection(X0,X1),X0))),
% 0.18/5.90    inference(duplicate_literals_removal,[status(thm)],[f87])).
% 0.18/5.90  fof(f93,plain,(
% 0.18/5.90    ![X0,X1]: (X0=intersection(X0,X1)|~subset(X0,intersection(X0,X1)))),
% 0.18/5.90    inference(resolution,[status(thm)],[f90,f25])).
% 0.18/5.90  fof(f102,plain,(
% 0.18/5.90    ![X0,X1]: (X0=intersection(X0,X1)|~subset(X0,intersection(X1,X0)))),
% 0.18/5.90    inference(paramodulation,[status(thm)],[f27,f93])).
% 0.18/5.90  fof(f226,plain,(
% 0.18/5.90    ![X0,X1,X2]: (subset(X0,X1)|member(sK0_skl(X1,X0),intersection(union(X2,X0),X0))|subset(X0,X1))),
% 0.18/5.90    inference(resolution,[status(thm)],[f68,f69])).
% 0.18/5.90  fof(f242,plain,(
% 0.18/5.90    ![X0,X1,X2]: (subset(X0,X1)|member(sK0_skl(X1,X0),intersection(union(X2,X0),X0)))),
% 0.18/5.90    inference(duplicate_literals_removal,[status(thm)],[f226])).
% 0.18/5.90  fof(f497,plain,(
% 0.18/5.90    ![X0,X1]: (subset(X0,intersection(union(X1,X0),X0))|subset(X0,intersection(union(X1,X0),X0)))),
% 0.18/5.90    inference(resolution,[status(thm)],[f242,f34])).
% 0.18/5.90  fof(f510,plain,(
% 0.18/5.90    ![X0,X1]: (subset(X0,intersection(union(X1,X0),X0)))),
% 0.18/5.90    inference(duplicate_literals_removal,[status(thm)],[f497])).
% 0.18/5.90  fof(f512,plain,(
% 0.18/5.90    ![X0,X1]: (X0=intersection(X0,union(X1,X0)))),
% 0.18/5.90    inference(resolution,[status(thm)],[f510,f102])).
% 0.18/5.90  fof(f520,plain,(
% 0.18/5.90    ~sK2_skl=sK2_skl),
% 0.18/5.90    inference(backward_demodulation,[status(thm)],[f512,f52])).
% 0.18/5.90  fof(f534,plain,(
% 0.18/5.90    $false),
% 0.18/5.90    inference(trivial_equality_resolution,[status(thm)],[f520])).
% 0.18/5.90  % SZS output end CNFRefutation for theBenchmark.p
% 0.18/5.92  % Elapsed time: 0.294378 seconds
% 0.18/5.92  % CPU time: 2.071402 seconds
% 0.18/5.92  % Total memory used: 118.129 MB
% 0.18/5.92  % Net memory used: 115.230 MB
%------------------------------------------------------------------------------