↑ 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  : SEU140+2 : TPTP v9.3.1. Released v3.3.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:21:46 PM UTC 2026

% Result   : Theorem 0.29s 1.15s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SEU140+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06  % Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.45  % Computer : n013.cluster.edu
% 0.18/0.45  % Model    : x86_64 x86_64
% 0.18/0.45  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.45  % Memory   : 8046.5625MB
% 0.18/0.45  % OS       : Linux 6.8.0-71-generic
% 0.18/0.45  % CPULimit : 300
% 0.18/0.45  % WCLimit  : 300
% 0.18/0.45  % DateTime : Mon Sep 21 05:51:36 UTC 2026
% 0.18/0.45  % CPUTime  : 
% 0.18/0.49  % Drodi V4.1.1
% 0.29/1.15  % Refutation found
% 0.29/1.15  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.29/1.15  % SZS output start CNFRefutation for theBenchmark
% 0.29/1.15  fof(f4,axiom,(
% 0.29/1.15    (! [A,B] : set_intersection2(A,B) = set_intersection2(B,A) )),
% 0.29/1.15    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.29/1.15  fof(f5,axiom,(
% 0.29/1.15    (! [A,B] :( A = B<=> ( subset(A,B)& subset(B,A) ) ) )),
% 0.29/1.15    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.29/1.15  fof(f11,axiom,(
% 0.29/1.15    (! [A,B] :( disjoint(A,B)<=> set_intersection2(A,B) = empty_set ) )),
% 0.29/1.15    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.29/1.15  fof(f33,lemma,(
% 0.29/1.15    (! [A,B,C] :( subset(A,B)=> subset(set_intersection2(A,C),set_intersection2(B,C)) ) )),
% 0.29/1.15    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.29/1.15  fof(f37,lemma,(
% 0.29/1.15    (! [A] : subset(empty_set,A) )),
% 0.29/1.15    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.29/1.15  fof(f51,conjecture,(
% 0.29/1.15    (! [A,B,C] :( ( subset(A,B)& disjoint(B,C) )=> disjoint(A,C) ) )),
% 0.29/1.15    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.29/1.15  fof(f52,negated_conjecture,(
% 0.29/1.15    ~((! [A,B,C] :( ( subset(A,B)& disjoint(B,C) )=> disjoint(A,C) ) ))),
% 0.29/1.15    inference(negated_conjecture,[status(cth)],[f51])).
% 0.29/1.15  fof(f63,plain,(
% 0.29/1.15    ![X0,X1]: (set_intersection2(X0,X1)=set_intersection2(X1,X0))),
% 0.29/1.15    inference(cnf_transformation,[status(thm)],[f4])).
% 0.29/1.15  fof(f64,plain,(
% 0.29/1.15    ![A,B]: ((~A=B|(subset(A,B)&subset(B,A)))&(A=B|(~subset(A,B)|~subset(B,A))))),
% 0.29/1.15    inference(NNF_transformation,[status(thm)],[f5])).
% 0.29/1.15  fof(f65,plain,(
% 0.29/1.15    (![A,B]: (~A=B|(subset(A,B)&subset(B,A))))&(![A,B]: (A=B|(~subset(A,B)|~subset(B,A))))),
% 0.29/1.15    inference(miniscoping,[status(thm)],[f64])).
% 0.29/1.15  fof(f68,plain,(
% 0.29/1.15    ![X0,X1]: (X0=X1|~subset(X0,X1)|~subset(X1,X0))),
% 0.29/1.15    inference(cnf_transformation,[status(thm)],[f65])).
% 0.29/1.15  fof(f108,plain,(
% 0.29/1.15    ![A,B]: ((~disjoint(A,B)|set_intersection2(A,B)=empty_set)&(disjoint(A,B)|~set_intersection2(A,B)=empty_set))),
% 0.29/1.15    inference(NNF_transformation,[status(thm)],[f11])).
% 0.29/1.15  fof(f109,plain,(
% 0.29/1.15    (![A,B]: (~disjoint(A,B)|set_intersection2(A,B)=empty_set))&(![A,B]: (disjoint(A,B)|~set_intersection2(A,B)=empty_set))),
% 0.29/1.15    inference(miniscoping,[status(thm)],[f108])).
% 0.29/1.15  fof(f110,plain,(
% 0.29/1.15    ![X0,X1]: (~disjoint(X0,X1)|set_intersection2(X0,X1)=empty_set)),
% 0.29/1.15    inference(cnf_transformation,[status(thm)],[f109])).
% 0.29/1.15  fof(f111,plain,(
% 0.29/1.15    ![X0,X1]: (disjoint(X0,X1)|~set_intersection2(X0,X1)=empty_set)),
% 0.29/1.15    inference(cnf_transformation,[status(thm)],[f109])).
% 0.29/1.15  fof(f151,plain,(
% 0.29/1.15    ![A,B,C]: (~subset(A,B)|subset(set_intersection2(A,C),set_intersection2(B,C)))),
% 0.29/1.15    inference(pre_NNF_transformation,[status(thm)],[f33])).
% 0.29/1.15  fof(f152,plain,(
% 0.29/1.15    ![A,B]: (~subset(A,B)|(![C]: subset(set_intersection2(A,C),set_intersection2(B,C))))),
% 0.29/1.15    inference(miniscoping,[status(thm)],[f151])).
% 0.29/1.15  fof(f153,plain,(
% 0.29/1.15    ![X0,X1,X2]: (~subset(X0,X1)|subset(set_intersection2(X0,X2),set_intersection2(X1,X2)))),
% 0.29/1.15    inference(cnf_transformation,[status(thm)],[f152])).
% 0.29/1.15  fof(f162,plain,(
% 0.29/1.15    ![X0]: (subset(empty_set,X0))),
% 0.29/1.15    inference(cnf_transformation,[status(thm)],[f37])).
% 0.29/1.15  fof(f193,plain,(
% 0.29/1.15    (?[A,B,C]: ((subset(A,B)&disjoint(B,C))&~disjoint(A,C)))),
% 0.29/1.15    inference(pre_NNF_transformation,[status(thm)],[f52])).
% 0.29/1.15  fof(f194,plain,(
% 0.29/1.15    ?[A,C]: ((?[B]: (subset(A,B)&disjoint(B,C)))&~disjoint(A,C))),
% 0.29/1.15    inference(miniscoping,[status(thm)],[f193])).
% 0.29/1.15  fof(f195,plain,(
% 0.29/1.15    ((subset(sK10_skl,sK12_skl)&disjoint(sK12_skl,sK11_skl))&~disjoint(sK10_skl,sK11_skl))),
% 0.29/1.15    inference(skolemize,[status(esa),new_symbols(skolem,[sK10_skl,sK11_skl,sK12_skl]),skolemize(A,sK10_skl),skolemize(C,sK11_skl),skolemize(B,sK12_skl)],[f194])).
% 0.29/1.15  fof(f196,plain,(
% 0.29/1.15    subset(sK10_skl,sK12_skl)),
% 0.29/1.15    inference(cnf_transformation,[status(thm)],[f195])).
% 0.29/1.15  fof(f197,plain,(
% 0.29/1.15    disjoint(sK12_skl,sK11_skl)),
% 0.29/1.15    inference(cnf_transformation,[status(thm)],[f195])).
% 0.29/1.15  fof(f198,plain,(
% 0.29/1.15    ~disjoint(sK10_skl,sK11_skl)),
% 0.29/1.15    inference(cnf_transformation,[status(thm)],[f195])).
% 0.29/1.15  fof(f221,plain,(
% 0.29/1.15    set_intersection2(sK12_skl,sK11_skl)=empty_set),
% 0.29/1.15    inference(resolution,[status(thm)],[f110,f197])).
% 0.29/1.15  fof(f243,plain,(
% 0.29/1.15    ![X0]: (X0=empty_set|~subset(X0,empty_set))),
% 0.29/1.15    inference(resolution,[status(thm)],[f162,f68])).
% 0.29/1.15  fof(f359,plain,(
% 0.29/1.15    ![X0,X1]: (disjoint(X0,X1)|~set_intersection2(X1,X0)=empty_set)),
% 0.29/1.17    inference(paramodulation,[status(thm)],[f63,f111])).
% 0.29/1.17  fof(f3332,plain,(
% 0.29/1.17    ![X0]: (subset(set_intersection2(sK10_skl,X0),set_intersection2(sK12_skl,X0)))),
% 0.29/1.17    inference(resolution,[status(thm)],[f153,f196])).
% 0.29/1.17  fof(f4764,plain,(
% 0.29/1.17    subset(set_intersection2(sK10_skl,sK11_skl),empty_set)),
% 0.29/1.17    inference(paramodulation,[status(thm)],[f221,f3332])).
% 0.29/1.17  fof(f4782,plain,(
% 0.29/1.17    subset(set_intersection2(sK11_skl,sK10_skl),empty_set)),
% 0.29/1.17    inference(forward_demodulation,[status(thm)],[f63,f4764])).
% 0.29/1.17  fof(f4789,plain,(
% 0.29/1.17    set_intersection2(sK11_skl,sK10_skl)=empty_set),
% 0.29/1.17    inference(resolution,[status(thm)],[f4782,f243])).
% 0.29/1.17  fof(f4833,plain,(
% 0.29/1.17    disjoint(sK10_skl,sK11_skl)),
% 0.29/1.17    inference(resolution,[status(thm)],[f4789,f359])).
% 0.29/1.17  fof(f4869,plain,(
% 0.29/1.17    $false),
% 0.29/1.17    inference(forward_subsumption_resolution,[status(thm)],[f4833,f198])).
% 0.29/1.17  % SZS output end CNFRefutation for theBenchmark.p
% 4.35/1.20  % Elapsed time: 0.726800 seconds
% 4.35/1.20  % CPU time: 5.221684 seconds
% 4.35/1.20  % Total memory used: 137.941 MB
% 4.35/1.20  % Net memory used: 132.282 MB
%------------------------------------------------------------------------------