↑ 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  : SET148+4 : 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 : 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:11:40 PM UTC 2026

% Result   : Theorem 0.13s 10.65s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET148+4 : 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.09/10.59  % Computer : n013.cluster.edu
% 0.09/10.59  % Model    : x86_64 x86_64
% 0.09/10.59  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/10.59  % Memory   : 8046.5625MB
% 0.09/10.59  % OS       : Linux 6.8.0-71-generic
% 0.09/10.59  % CPULimit : 300
% 0.09/10.59  % WCLimit  : 300
% 0.09/10.59  % DateTime : Mon Sep 21 04:56:48 UTC 2026
% 0.09/10.59  % CPUTime  : 
% 0.13/10.60  % Drodi V4.1.1
% 0.13/10.65  % Refutation found
% 0.13/10.65  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/10.65  % SZS output start CNFRefutation for theBenchmark
% 0.13/10.65  fof(f1,axiom,(
% 0.13/10.65    (! [A,B] :( subset(A,B)<=> (! [X] :( member(X,A)=> member(X,B) ) )) )),
% 0.13/10.65    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.13/10.65  fof(f2,axiom,(
% 0.13/10.65    (! [A,B] :( equal_set(A,B)<=> ( subset(A,B)& subset(B,A) ) ) )),
% 0.13/10.65    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.13/10.65  fof(f4,axiom,(
% 0.13/10.65    (! [X,A,B] :( member(X,intersection(A,B))<=> ( member(X,A)& member(X,B) ) ) )),
% 0.13/10.65    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.13/10.65  fof(f12,conjecture,(
% 0.13/10.65    (! [A] : equal_set(intersection(A,A),A) )),
% 0.13/10.65    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.13/10.65  fof(f13,negated_conjecture,(
% 0.13/10.65    ~((! [A] : equal_set(intersection(A,A),A) ))),
% 0.13/10.65    inference(negated_conjecture,[status(cth)],[f12])).
% 0.13/10.65  fof(f14,plain,(
% 0.13/10.65    ![A,B]: (subset(A,B)<=>(![X]: (~member(X,A)|member(X,B))))),
% 0.13/10.65    inference(pre_NNF_transformation,[status(thm)],[f1])).
% 0.13/10.65  fof(f15,plain,(
% 0.13/10.65    ![A,B]: ((~subset(A,B)|(![X]: (~member(X,A)|member(X,B))))&(subset(A,B)|(?[X]: (member(X,A)&~member(X,B)))))),
% 0.13/10.65    inference(NNF_transformation,[status(thm)],[f14])).
% 0.13/10.65  fof(f16,plain,(
% 0.13/10.65    (![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.13/10.65    inference(miniscoping,[status(thm)],[f15])).
% 0.13/10.65  fof(f17,plain,(
% 0.13/10.65    (![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.13/10.65    inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl]),skolemize(X,sK0_skl(B,A))],[f16])).
% 0.13/10.65  fof(f19,plain,(
% 0.13/10.65    ![X0,X1]: (subset(X0,X1)|member(sK0_skl(X1,X0),X0))),
% 0.13/10.65    inference(cnf_transformation,[status(thm)],[f17])).
% 0.13/10.65  fof(f20,plain,(
% 0.13/10.65    ![X0,X1]: (subset(X0,X1)|~member(sK0_skl(X1,X0),X1))),
% 0.13/10.65    inference(cnf_transformation,[status(thm)],[f17])).
% 0.13/10.65  fof(f21,plain,(
% 0.13/10.65    ![A,B]: ((~equal_set(A,B)|(subset(A,B)&subset(B,A)))&(equal_set(A,B)|(~subset(A,B)|~subset(B,A))))),
% 0.13/10.65    inference(NNF_transformation,[status(thm)],[f2])).
% 0.13/10.65  fof(f22,plain,(
% 0.13/10.65    (![A,B]: (~equal_set(A,B)|(subset(A,B)&subset(B,A))))&(![A,B]: (equal_set(A,B)|(~subset(A,B)|~subset(B,A))))),
% 0.13/10.65    inference(miniscoping,[status(thm)],[f21])).
% 0.13/10.65  fof(f25,plain,(
% 0.13/10.65    ![X0,X1]: (equal_set(X0,X1)|~subset(X0,X1)|~subset(X1,X0))),
% 0.13/10.65    inference(cnf_transformation,[status(thm)],[f22])).
% 0.13/10.65  fof(f30,plain,(
% 0.13/10.65    ![X,A,B]: ((~member(X,intersection(A,B))|(member(X,A)&member(X,B)))&(member(X,intersection(A,B))|(~member(X,A)|~member(X,B))))),
% 0.13/10.65    inference(NNF_transformation,[status(thm)],[f4])).
% 0.13/10.65  fof(f31,plain,(
% 0.13/10.65    (![X,A,B]: (~member(X,intersection(A,B))|(member(X,A)&member(X,B))))&(![X,A,B]: (member(X,intersection(A,B))|(~member(X,A)|~member(X,B))))),
% 0.13/10.65    inference(miniscoping,[status(thm)],[f30])).
% 0.13/10.65  fof(f32,plain,(
% 0.13/10.65    ![X0,X1,X2]: (~member(X0,intersection(X1,X2))|member(X0,X1))),
% 0.13/10.65    inference(cnf_transformation,[status(thm)],[f31])).
% 0.13/10.65  fof(f34,plain,(
% 0.13/10.65    ![X0,X1,X2]: (member(X0,intersection(X1,X2))|~member(X0,X1)|~member(X0,X2))),
% 0.13/10.65    inference(cnf_transformation,[status(thm)],[f31])).
% 0.13/10.65  fof(f68,plain,(
% 0.13/10.65    (?[A]: ~equal_set(intersection(A,A),A))),
% 0.13/10.65    inference(pre_NNF_transformation,[status(thm)],[f13])).
% 0.13/10.65  fof(f69,plain,(
% 0.13/10.65    ~equal_set(intersection(sK3_skl,sK3_skl),sK3_skl)),
% 0.13/10.65    inference(skolemize,[status(esa),new_symbols(skolem,[sK3_skl]),skolemize(A,sK3_skl)],[f68])).
% 0.13/10.65  fof(f70,plain,(
% 0.13/10.65    ~equal_set(intersection(sK3_skl,sK3_skl),sK3_skl)),
% 0.13/10.65    inference(cnf_transformation,[status(thm)],[f69])).
% 0.13/10.65  fof(f75,plain,(
% 0.13/10.65    ![X0,X1,X2]: (subset(intersection(X0,X1),X2)|member(sK0_skl(X2,intersection(X0,X1)),X0))),
% 0.13/10.65    inference(resolution,[status(thm)],[f19,f32])).
% 0.13/10.65  fof(f77,plain,(
% 0.13/10.65    ![X0,X1]: (subset(X0,X1)|member(sK0_skl(X1,X0),intersection(X0,X0)))),
% 0.13/10.65    inference(resolution,[status(thm)],[f19,f34])).
% 0.13/10.65  fof(f134,plain,(
% 0.13/10.65    ![X0,X1]: (subset(intersection(X0,X1),X0)|subset(intersection(X0,X1),X0))),
% 0.13/10.65    inference(resolution,[status(thm)],[f75,f20])).
% 0.13/10.65  fof(f144,plain,(
% 0.13/10.65    ![X0,X1]: (subset(intersection(X0,X1),X0))),
% 0.13/10.65    inference(duplicate_literals_removal,[status(thm)],[f134])).
% 0.13/10.65  fof(f145,plain,(
% 0.13/10.65    ![X0]: (subset(X0,intersection(X0,X0))|subset(X0,intersection(X0,X0)))),
% 0.13/10.65    inference(resolution,[status(thm)],[f77,f20])).
% 0.13/10.65  fof(f153,plain,(
% 0.13/10.65    ![X0]: (subset(X0,intersection(X0,X0)))),
% 0.13/10.65    inference(duplicate_literals_removal,[status(thm)],[f145])).
% 0.13/10.65  fof(f197,plain,(
% 0.13/10.65    ![X0]: (equal_set(intersection(X0,X0),X0)|~subset(intersection(X0,X0),X0))),
% 0.13/10.65    inference(resolution,[status(thm)],[f153,f25])).
% 0.13/10.65  fof(f199,plain,(
% 0.13/10.65    ![X0]: (equal_set(intersection(X0,X0),X0))),
% 0.13/10.65    inference(forward_subsumption_resolution,[status(thm)],[f197,f144])).
% 0.13/10.65  fof(f213,plain,(
% 0.13/10.65    $false),
% 0.13/10.65    inference(backward_subsumption_resolution,[status(thm)],[f70,f199])).
% 0.13/10.65  % SZS output end CNFRefutation for theBenchmark.p
% 0.13/10.68  % Elapsed time: 0.069447 seconds
% 0.13/10.68  % CPU time: 0.289766 seconds
% 0.13/10.68  % Total memory used: 84.019 MB
% 0.13/10.68  % Net memory used: 83.429 MB
%------------------------------------------------------------------------------