↑ 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  : NUM393+1 : TPTP v9.3.1. Released v3.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 01:42:49 PM UTC 2026

% Result   : Theorem 0.12s 0.39s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : NUM393+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04  % Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.36  % Computer : n013.cluster.edu
% 0.08/0.36  % Model    : x86_64 x86_64
% 0.08/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36  % Memory   : 8046.5625MB
% 0.08/0.36  % OS       : Linux 6.8.0-71-generic
% 0.08/0.36  % CPULimit : 300
% 0.08/0.36  % WCLimit  : 300
% 0.08/0.36  % DateTime : Mon Sep 21 02:26:22 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 0.08/0.37  % Drodi V4.1.1
% 0.12/0.39  % Refutation found
% 0.12/0.39  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.12/0.39  % SZS output start CNFRefutation for theBenchmark
% 0.12/0.39  fof(f7,axiom,(
% 0.12/0.39    (! [A,B] :( ( ordinal(A)& ordinal(B) )=> ( ordinal_subset(A,B)| ordinal_subset(B,A) ) ) )),
% 0.12/0.39    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.12/0.39  fof(f8,axiom,(
% 0.12/0.39    (! [A,B] :( inclusion_comparable(A,B)<=> ( subset(A,B)| subset(B,A) ) ) )),
% 0.12/0.39    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.12/0.39  fof(f24,axiom,(
% 0.12/0.39    (! [A,B] :( ( ordinal(A)& ordinal(B) )=> ( ordinal_subset(A,B)<=> subset(A,B) ) ) )),
% 0.12/0.39    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.12/0.39  fof(f30,conjecture,(
% 0.12/0.39    (! [A] :( ordinal(A)=> (! [B] :( ordinal(B)=> inclusion_comparable(A,B) ) )) )),
% 0.12/0.39    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.12/0.39  fof(f31,negated_conjecture,(
% 0.12/0.39    ~((! [A] :( ordinal(A)=> (! [B] :( ordinal(B)=> inclusion_comparable(A,B) ) )) ))),
% 0.12/0.39    inference(negated_conjecture,[status(cth)],[f30])).
% 0.12/0.39  fof(f54,plain,(
% 0.12/0.39    ![A,B]: ((~ordinal(A)|~ordinal(B))|(ordinal_subset(A,B)|ordinal_subset(B,A)))),
% 0.12/0.39    inference(pre_NNF_transformation,[status(thm)],[f7])).
% 0.12/0.39  fof(f55,plain,(
% 0.12/0.39    ![X0,X1]: (~ordinal(X0)|~ordinal(X1)|ordinal_subset(X0,X1)|ordinal_subset(X1,X0))),
% 0.12/0.39    inference(cnf_transformation,[status(thm)],[f54])).
% 0.12/0.39  fof(f56,plain,(
% 0.12/0.39    ![A,B]: ((~inclusion_comparable(A,B)|(subset(A,B)|subset(B,A)))&(inclusion_comparable(A,B)|(~subset(A,B)&~subset(B,A))))),
% 0.12/0.39    inference(NNF_transformation,[status(thm)],[f8])).
% 0.12/0.39  fof(f57,plain,(
% 0.12/0.39    (![A,B]: (~inclusion_comparable(A,B)|(subset(A,B)|subset(B,A))))&(![A,B]: (inclusion_comparable(A,B)|(~subset(A,B)&~subset(B,A))))),
% 0.12/0.39    inference(miniscoping,[status(thm)],[f56])).
% 0.12/0.39  fof(f59,plain,(
% 0.12/0.39    ![X0,X1]: (inclusion_comparable(X0,X1)|~subset(X0,X1))),
% 0.12/0.39    inference(cnf_transformation,[status(thm)],[f57])).
% 0.12/0.39  fof(f60,plain,(
% 0.12/0.39    ![X0,X1]: (inclusion_comparable(X0,X1)|~subset(X1,X0))),
% 0.12/0.39    inference(cnf_transformation,[status(thm)],[f57])).
% 0.12/0.39  fof(f105,plain,(
% 0.12/0.39    ![A,B]: ((~ordinal(A)|~ordinal(B))|(ordinal_subset(A,B)<=>subset(A,B)))),
% 0.12/0.39    inference(pre_NNF_transformation,[status(thm)],[f24])).
% 0.12/0.39  fof(f106,plain,(
% 0.12/0.39    ![A,B]: ((~ordinal(A)|~ordinal(B))|((~ordinal_subset(A,B)|subset(A,B))&(ordinal_subset(A,B)|~subset(A,B))))),
% 0.12/0.39    inference(NNF_transformation,[status(thm)],[f105])).
% 0.12/0.39  fof(f107,plain,(
% 0.12/0.39    ![X0,X1]: (~ordinal(X0)|~ordinal(X1)|~ordinal_subset(X0,X1)|subset(X0,X1))),
% 0.12/0.39    inference(cnf_transformation,[status(thm)],[f106])).
% 0.12/0.39  fof(f120,plain,(
% 0.12/0.39    (?[A]: (ordinal(A)&(?[B]: (ordinal(B)&~inclusion_comparable(A,B)))))),
% 0.12/0.39    inference(pre_NNF_transformation,[status(thm)],[f31])).
% 0.12/0.39  fof(f121,plain,(
% 0.12/0.39    (ordinal(sK12_skl)&(ordinal(sK13_skl)&~inclusion_comparable(sK12_skl,sK13_skl)))),
% 0.12/0.39    inference(skolemize,[status(esa),new_symbols(skolem,[sK12_skl,sK13_skl]),skolemize(A,sK12_skl),skolemize(B,sK13_skl)],[f120])).
% 0.12/0.39  fof(f122,plain,(
% 0.12/0.39    ordinal(sK12_skl)),
% 0.12/0.39    inference(cnf_transformation,[status(thm)],[f121])).
% 0.12/0.39  fof(f123,plain,(
% 0.12/0.39    ordinal(sK13_skl)),
% 0.12/0.39    inference(cnf_transformation,[status(thm)],[f121])).
% 0.12/0.39  fof(f124,plain,(
% 0.12/0.39    ~inclusion_comparable(sK12_skl,sK13_skl)),
% 0.12/0.39    inference(cnf_transformation,[status(thm)],[f121])).
% 0.12/0.39  fof(f159,plain,(
% 0.12/0.39    ![X0]: (~ordinal(X0)|ordinal_subset(sK13_skl,X0)|ordinal_subset(X0,sK13_skl))),
% 0.12/0.39    inference(resolution,[status(thm)],[f55,f123])).
% 0.12/0.39  fof(f162,plain,(
% 0.12/0.39    ordinal_subset(sK13_skl,sK12_skl)|ordinal_subset(sK12_skl,sK13_skl)),
% 0.12/0.39    inference(resolution,[status(thm)],[f159,f122])).
% 0.12/0.39  fof(f189,plain,(
% 0.12/0.39    ~ordinal(sK13_skl)|~ordinal(sK12_skl)|subset(sK13_skl,sK12_skl)|ordinal_subset(sK12_skl,sK13_skl)),
% 0.12/0.39    inference(resolution,[status(thm)],[f107,f162])).
% 0.12/0.39  fof(f194,plain,(
% 0.12/0.39    ~ordinal(sK12_skl)|subset(sK13_skl,sK12_skl)|ordinal_subset(sK12_skl,sK13_skl)),
% 0.12/0.39    inference(forward_subsumption_resolution,[status(thm)],[f189,f123])).
% 0.12/0.39  fof(f223,plain,(
% 0.12/0.39    subset(sK13_skl,sK12_skl)|ordinal_subset(sK12_skl,sK13_skl)),
% 0.12/0.39    inference(forward_subsumption_resolution,[status(thm)],[f194,f122])).
% 0.12/0.39  fof(f226,plain,(
% 0.12/0.39    ordinal_subset(sK12_skl,sK13_skl)|inclusion_comparable(sK12_skl,sK13_skl)),
% 0.12/0.39    inference(resolution,[status(thm)],[f223,f60])).
% 0.12/0.39  fof(f228,plain,(
% 0.12/0.39    ordinal_subset(sK12_skl,sK13_skl)),
% 0.12/0.39    inference(forward_subsumption_resolution,[status(thm)],[f226,f124])).
% 0.12/0.39  fof(f248,plain,(
% 0.12/0.39    ~ordinal(sK12_skl)|~ordinal(sK13_skl)|subset(sK12_skl,sK13_skl)),
% 0.12/0.39    inference(resolution,[status(thm)],[f228,f107])).
% 0.12/0.39  fof(f249,plain,(
% 0.12/0.39    ~ordinal(sK13_skl)|subset(sK12_skl,sK13_skl)),
% 0.12/0.39    inference(forward_subsumption_resolution,[status(thm)],[f248,f122])).
% 0.12/0.39  fof(f256,plain,(
% 0.12/0.39    subset(sK12_skl,sK13_skl)),
% 0.12/0.39    inference(forward_subsumption_resolution,[status(thm)],[f249,f123])).
% 0.12/0.39  fof(f260,plain,(
% 0.12/0.39    inclusion_comparable(sK12_skl,sK13_skl)),
% 0.12/0.39    inference(resolution,[status(thm)],[f256,f59])).
% 0.12/0.39  fof(f261,plain,(
% 0.12/0.39    $false),
% 0.12/0.39    inference(forward_subsumption_resolution,[status(thm)],[f260,f124])).
% 0.12/0.39  % SZS output end CNFRefutation for theBenchmark.p
% 0.12/0.41  % Elapsed time: 0.047508 seconds
% 0.12/0.41  % CPU time: 0.147615 seconds
% 0.12/0.41  % Total memory used: 81.655 MB
% 0.12/0.41  % Net memory used: 81.617 MB
%------------------------------------------------------------------------------