↑ 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  : SET602+4 : TPTP v9.3.1. Released v2.2.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:12:16 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.03  % Problem  : SET602+4 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.04  % Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36  % Computer : n010.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Mon Sep 21 05:28:55 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(f2,axiom,(
% 0.09/0.40    (! [A,B] :( equal_set(A,B)<=> ( subset(A,B)& subset(B,A) ) ) )),
% 0.09/0.40    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.09/0.40  fof(f6,axiom,(
% 0.09/0.40    (! [X] : ~ member(X,empty_set) )),
% 0.09/0.40    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.09/0.40  fof(f7,axiom,(
% 0.09/0.40    (! [B,A,E] :( member(B,difference(E,A))<=> ( member(B,E)& ~ member(B,A) ) ) )),
% 0.09/0.40    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.09/0.40  fof(f12,conjecture,(
% 0.09/0.40    (! [E] : equal_set(difference(E,E),empty_set) )),
% 0.09/0.40    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.09/0.40  fof(f13,negated_conjecture,(
% 0.09/0.40    ~((! [E] : equal_set(difference(E,E),empty_set) ))),
% 0.09/0.40    inference(negated_conjecture,[status(cth)],[f12])).
% 0.09/0.40  fof(f14,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(f15,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)],[f14])).
% 0.09/0.40  fof(f16,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)],[f15])).
% 0.09/0.40  fof(f17,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))],[f16])).
% 0.09/0.40  fof(f19,plain,(
% 0.09/0.40    ![X0,X1]: (subset(X0,X1)|member(sK0_skl(X1,X0),X0))),
% 0.09/0.40    inference(cnf_transformation,[status(thm)],[f17])).
% 0.09/0.40  fof(f21,plain,(
% 0.09/0.40    ![A,B]: ((~equal_set(A,B)|(subset(A,B)&subset(B,A)))&(equal_set(A,B)|(~subset(A,B)|~subset(B,A))))),
% 0.09/0.40    inference(NNF_transformation,[status(thm)],[f2])).
% 0.09/0.40  fof(f22,plain,(
% 0.09/0.40    (![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.09/0.40    inference(miniscoping,[status(thm)],[f21])).
% 0.09/0.40  fof(f25,plain,(
% 0.09/0.40    ![X0,X1]: (equal_set(X0,X1)|~subset(X0,X1)|~subset(X1,X0))),
% 0.09/0.40    inference(cnf_transformation,[status(thm)],[f22])).
% 0.09/0.40  fof(f40,plain,(
% 0.09/0.40    ![X0]: (~member(X0,empty_set))),
% 0.09/0.40    inference(cnf_transformation,[status(thm)],[f6])).
% 0.09/0.40  fof(f41,plain,(
% 0.09/0.40    ![B,A,E]: ((~member(B,difference(E,A))|(member(B,E)&~member(B,A)))&(member(B,difference(E,A))|(~member(B,E)|member(B,A))))),
% 0.09/0.40    inference(NNF_transformation,[status(thm)],[f7])).
% 0.09/0.40  fof(f42,plain,(
% 0.09/0.40    (![B,A,E]: (~member(B,difference(E,A))|(member(B,E)&~member(B,A))))&(![B,A,E]: (member(B,difference(E,A))|(~member(B,E)|member(B,A))))),
% 0.09/0.40    inference(miniscoping,[status(thm)],[f41])).
% 0.09/0.40  fof(f43,plain,(
% 0.09/0.40    ![X0,X1,X2]: (~member(X0,difference(X1,X2))|member(X0,X1))),
% 0.09/0.40    inference(cnf_transformation,[status(thm)],[f42])).
% 0.09/0.40  fof(f44,plain,(
% 0.09/0.40    ![X0,X1,X2]: (~member(X0,difference(X1,X2))|~member(X0,X2))),
% 0.09/0.40    inference(cnf_transformation,[status(thm)],[f42])).
% 0.09/0.40  fof(f68,plain,(
% 0.09/0.40    (?[E]: ~equal_set(difference(E,E),empty_set))),
% 0.09/0.40    inference(pre_NNF_transformation,[status(thm)],[f13])).
% 0.09/0.40  fof(f69,plain,(
% 0.09/0.40    ~equal_set(difference(sK3_skl,sK3_skl),empty_set)),
% 0.09/0.40    inference(skolemize,[status(esa),new_symbols(skolem,[sK3_skl]),skolemize(E,sK3_skl)],[f68])).
% 0.09/0.40  fof(f70,plain,(
% 0.09/0.40    ~equal_set(difference(sK3_skl,sK3_skl),empty_set)),
% 0.09/0.40    inference(cnf_transformation,[status(thm)],[f69])).
% 0.09/0.40  fof(f100,plain,(
% 0.09/0.40    ![X0,X1,X2]: (subset(difference(X0,X1),X2)|~member(sK0_skl(X2,difference(X0,X1)),X1))),
% 0.09/0.40    inference(resolution,[status(thm)],[f19,f44])).
% 0.09/0.40  fof(f101,plain,(
% 0.09/0.40    ![X0,X1,X2]: (subset(difference(X0,X1),X2)|member(sK0_skl(X2,difference(X0,X1)),X0))),
% 0.09/0.40    inference(resolution,[status(thm)],[f19,f43])).
% 0.09/0.40  fof(f102,plain,(
% 0.09/0.40    ![X0]: (subset(empty_set,X0))),
% 0.09/0.40    inference(resolution,[status(thm)],[f19,f40])).
% 0.09/0.40  fof(f104,plain,(
% 0.09/0.40    ![X0]: (equal_set(X0,empty_set)|~subset(X0,empty_set))),
% 0.09/0.40    inference(resolution,[status(thm)],[f102,f25])).
% 0.09/0.40  fof(f136,plain,(
% 0.09/0.40    ![X0,X1]: (subset(difference(X0,X0),X1)|subset(difference(X0,X0),X1))),
% 0.09/0.41    inference(resolution,[status(thm)],[f101,f100])).
% 0.09/0.41  fof(f146,plain,(
% 0.09/0.41    ![X0,X1]: (subset(difference(X0,X0),X1))),
% 0.09/0.41    inference(duplicate_literals_removal,[status(thm)],[f136])).
% 0.09/0.41  fof(f148,plain,(
% 0.09/0.41    ![X0]: (equal_set(difference(X0,X0),empty_set))),
% 0.09/0.41    inference(resolution,[status(thm)],[f146,f104])).
% 0.09/0.41  fof(f152,plain,(
% 0.09/0.41    $false),
% 0.09/0.41    inference(backward_subsumption_resolution,[status(thm)],[f70,f148])).
% 0.09/0.41  % SZS output end CNFRefutation for theBenchmark.p
% 0.09/0.43  % Elapsed time: 0.059047 seconds
% 0.09/0.43  % CPU time: 0.178563 seconds
% 0.09/0.43  % Total memory used: 81.152 MB
% 0.09/0.43  % Net memory used: 80.792 MB
%------------------------------------------------------------------------------