↑ 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  : SEU139+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 : n017.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.10s 0.40s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SEU139+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04  % Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.36  % Computer : n017.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Mon Sep 21 05:47:41 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.38  % Drodi V4.1.1
% 0.10/0.40  % Refutation found
% 0.10/0.40  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.10/0.40  % SZS output start CNFRefutation for theBenchmark
% 0.10/0.40  fof(f5,axiom,(
% 0.10/0.40    (! [A,B] :( A = B<=> ( subset(A,B)& subset(B,A) ) ) )),
% 0.10/0.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.40  fof(f12,axiom,(
% 0.10/0.40    (! [A,B] :( proper_subset(A,B)<=> ( subset(A,B)& A != B ) ) )),
% 0.10/0.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.40  fof(f50,conjecture,(
% 0.10/0.40    (! [A,B] :~ ( subset(A,B)& proper_subset(B,A) ) )),
% 0.10/0.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.40  fof(f51,negated_conjecture,(
% 0.10/0.40    ~((! [A,B] :~ ( subset(A,B)& proper_subset(B,A) ) ))),
% 0.10/0.40    inference(negated_conjecture,[status(cth)],[f50])).
% 0.10/0.40  fof(f63,plain,(
% 0.10/0.40    ![A,B]: ((~A=B|(subset(A,B)&subset(B,A)))&(A=B|(~subset(A,B)|~subset(B,A))))),
% 0.10/0.40    inference(NNF_transformation,[status(thm)],[f5])).
% 0.10/0.40  fof(f64,plain,(
% 0.10/0.40    (![A,B]: (~A=B|(subset(A,B)&subset(B,A))))&(![A,B]: (A=B|(~subset(A,B)|~subset(B,A))))),
% 0.10/0.40    inference(miniscoping,[status(thm)],[f63])).
% 0.10/0.40  fof(f67,plain,(
% 0.10/0.40    ![X0,X1]: (X0=X1|~subset(X0,X1)|~subset(X1,X0))),
% 0.10/0.40    inference(cnf_transformation,[status(thm)],[f64])).
% 0.10/0.40  fof(f111,plain,(
% 0.10/0.40    ![A,B]: ((~proper_subset(A,B)|(subset(A,B)&~A=B))&(proper_subset(A,B)|(~subset(A,B)|A=B)))),
% 0.10/0.40    inference(NNF_transformation,[status(thm)],[f12])).
% 0.10/0.40  fof(f112,plain,(
% 0.10/0.40    (![A,B]: (~proper_subset(A,B)|(subset(A,B)&~A=B)))&(![A,B]: (proper_subset(A,B)|(~subset(A,B)|A=B)))),
% 0.10/0.40    inference(miniscoping,[status(thm)],[f111])).
% 0.10/0.40  fof(f113,plain,(
% 0.10/0.40    ![X0,X1]: (~proper_subset(X0,X1)|subset(X0,X1))),
% 0.10/0.40    inference(cnf_transformation,[status(thm)],[f112])).
% 0.10/0.40  fof(f114,plain,(
% 0.10/0.40    ![X0,X1]: (~proper_subset(X0,X1)|~X0=X1)),
% 0.10/0.40    inference(cnf_transformation,[status(thm)],[f112])).
% 0.10/0.40  fof(f190,plain,(
% 0.10/0.40    (?[A,B]: (subset(A,B)&proper_subset(B,A)))),
% 0.10/0.40    inference(pre_NNF_transformation,[status(thm)],[f51])).
% 0.10/0.40  fof(f191,plain,(
% 0.10/0.40    (subset(sK10_skl,sK11_skl)&proper_subset(sK11_skl,sK10_skl))),
% 0.10/0.40    inference(skolemize,[status(esa),new_symbols(skolem,[sK10_skl,sK11_skl]),skolemize(A,sK10_skl),skolemize(B,sK11_skl)],[f190])).
% 0.10/0.40  fof(f192,plain,(
% 0.10/0.40    subset(sK10_skl,sK11_skl)),
% 0.10/0.40    inference(cnf_transformation,[status(thm)],[f191])).
% 0.10/0.40  fof(f193,plain,(
% 0.10/0.40    proper_subset(sK11_skl,sK10_skl)),
% 0.10/0.40    inference(cnf_transformation,[status(thm)],[f191])).
% 0.10/0.40  fof(f217,plain,(
% 0.10/0.40    ![X0]: (~proper_subset(X0,X0))),
% 0.10/0.40    inference(destructive_equality_resolution,[status(thm)],[f114])).
% 0.10/0.40  fof(f219,plain,(
% 0.10/0.40    subset(sK11_skl,sK10_skl)),
% 0.10/0.40    inference(resolution,[status(thm)],[f113,f193])).
% 0.10/0.40  fof(f221,plain,(
% 0.10/0.40    sK11_skl=sK10_skl|~subset(sK11_skl,sK10_skl)),
% 0.10/0.40    inference(resolution,[status(thm)],[f67,f192])).
% 0.10/0.40  fof(f223,definition,(
% 0.10/0.40    sQ0_spl <=> (sK10_skl=sK11_skl)),
% 0.10/0.40    introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition])).
% 0.10/0.40  fof(f224,plain,(
% 0.10/0.40    sK10_skl=sK11_skl|~sQ0_spl),
% 0.10/0.40    inference(component_clause,[status(thm)],[f223])).
% 0.10/0.40  fof(f230,definition,(
% 0.10/0.40    sQ2_spl <=> (subset(sK11_skl,sK10_skl))),
% 0.10/0.40    introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition])).
% 0.10/0.40  fof(f232,plain,(
% 0.10/0.40    ~subset(sK11_skl,sK10_skl)|sQ2_spl),
% 0.10/0.40    inference(component_clause,[status(thm)],[f230])).
% 0.10/0.40  fof(f233,plain,(
% 0.10/0.40    sQ0_spl|~sQ2_spl),
% 0.10/0.40    inference(split_clause,[status(thm)],[f221,f223,f230])).
% 0.10/0.40  fof(f236,plain,(
% 0.10/0.40    proper_subset(sK11_skl,sK11_skl)|~sQ0_spl),
% 0.10/0.40    inference(backward_demodulation,[status(thm)],[f224,f193])).
% 0.10/0.40  fof(f238,plain,(
% 0.10/0.40    $false|~sQ0_spl),
% 0.10/0.40    inference(forward_subsumption_resolution,[status(thm)],[f236,f217])).
% 0.10/0.40  fof(f239,plain,(
% 0.10/0.40    ~sQ0_spl),
% 0.10/0.40    inference(contradiction_clause,[status(thm)],[f238])).
% 0.10/0.40  fof(f259,plain,(
% 0.10/0.40    $false|sQ2_spl),
% 0.10/0.40    inference(forward_subsumption_resolution,[status(thm)],[f219,f232])).
% 0.10/0.40  fof(f260,plain,(
% 0.10/0.40    sQ2_spl),
% 0.10/0.40    inference(contradiction_clause,[status(thm)],[f259])).
% 0.10/0.40  fof(f261,plain,(
% 0.10/0.40    $false),
% 0.10/0.40    inference(sat_refutation,[status(thm)],[f233,f239,f260])).
% 0.10/0.40  % SZS output end CNFRefutation for theBenchmark.p
% 0.10/0.42  % Elapsed time: 0.051827 seconds
% 0.10/0.42  % CPU time: 0.149490 seconds
% 0.10/0.42  % Total memory used: 84.378 MB
% 0.10/0.42  % Net memory used: 84.329 MB
%------------------------------------------------------------------------------