↑ 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  : NUM531+2 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n004.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:43:08 PM UTC 2026

% Result   : Theorem 0.10s 0.41s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM531+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.37  % Computer : n004.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Mon Sep 21 02:37:35 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.38  % Drodi V4.1.1
% 0.10/0.41  % Refutation found
% 0.10/0.41  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.10/0.41  % SZS output start CNFRefutation for theBenchmark
% 0.10/0.41  fof(f6,axiom,(
% 0.10/0.41    isFinite0(slcrc0) ),
% 0.10/0.41    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.41  fof(f8,axiom,(
% 0.10/0.41    (! [W0] :( ( aSet0(W0)& isCountable0(W0) )=> ~ isFinite0(W0) ) )),
% 0.10/0.41    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.41  fof(f9,conjecture,(
% 0.10/0.41    (! [W0] :( ( aSet0(W0)& isCountable0(W0) )=> ~ ( ~ (? [W1] : aElementOf0(W1,W0))& W0 = slcrc0 ) ) )),
% 0.10/0.41    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.41  fof(f10,negated_conjecture,(
% 0.10/0.41    ~((! [W0] :( ( aSet0(W0)& isCountable0(W0) )=> ~ ( ~ (? [W1] : aElementOf0(W1,W0))& W0 = slcrc0 ) ) ))),
% 0.10/0.41    inference(negated_conjecture,[status(cth)],[f9])).
% 0.10/0.41  fof(f28,plain,(
% 0.10/0.41    isFinite0(slcrc0)),
% 0.10/0.41    inference(cnf_transformation,[status(thm)],[f6])).
% 0.10/0.41  fof(f31,plain,(
% 0.10/0.41    ![W0]: ((~aSet0(W0)|~isCountable0(W0))|~isFinite0(W0))),
% 0.10/0.41    inference(pre_NNF_transformation,[status(thm)],[f8])).
% 0.10/0.41  fof(f32,plain,(
% 0.10/0.41    ![X0]: (~aSet0(X0)|~isCountable0(X0)|~isFinite0(X0))),
% 0.10/0.41    inference(cnf_transformation,[status(thm)],[f31])).
% 0.10/0.41  fof(f33,plain,(
% 0.10/0.41    (?[W0]: ((aSet0(W0)&isCountable0(W0))&((![W1]: ~aElementOf0(W1,W0))&W0=slcrc0)))),
% 0.10/0.41    inference(pre_NNF_transformation,[status(thm)],[f10])).
% 0.10/0.41  fof(f34,plain,(
% 0.10/0.41    ((aSet0(sK1_skl)&isCountable0(sK1_skl))&((![W1]: ~aElementOf0(W1,sK1_skl))&sK1_skl=slcrc0))),
% 0.10/0.41    inference(skolemize,[status(esa),new_symbols(skolem,[sK1_skl]),skolemize(W0,sK1_skl)],[f33])).
% 0.10/0.41  fof(f35,plain,(
% 0.10/0.41    aSet0(sK1_skl)),
% 0.10/0.41    inference(cnf_transformation,[status(thm)],[f34])).
% 0.10/0.41  fof(f36,plain,(
% 0.10/0.41    isCountable0(sK1_skl)),
% 0.10/0.41    inference(cnf_transformation,[status(thm)],[f34])).
% 0.10/0.41  fof(f38,plain,(
% 0.10/0.41    sK1_skl=slcrc0),
% 0.10/0.41    inference(cnf_transformation,[status(thm)],[f34])).
% 0.10/0.41  fof(f43,plain,(
% 0.10/0.41    ~isCountable0(sK1_skl)|~isFinite0(sK1_skl)),
% 0.10/0.41    inference(resolution,[status(thm)],[f32,f35])).
% 0.10/0.41  fof(f44,definition,(
% 0.10/0.41    sQ0_spl <=> (isCountable0(sK1_skl))),
% 0.10/0.41    introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition])).
% 0.10/0.41  fof(f46,plain,(
% 0.10/0.41    ~isCountable0(sK1_skl)|sQ0_spl),
% 0.10/0.41    inference(component_clause,[status(thm)],[f44])).
% 0.10/0.41  fof(f47,definition,(
% 0.10/0.41    sQ1_spl <=> (isFinite0(sK1_skl))),
% 0.10/0.41    introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition])).
% 0.10/0.41  fof(f49,plain,(
% 0.10/0.41    ~isFinite0(sK1_skl)|sQ1_spl),
% 0.10/0.41    inference(component_clause,[status(thm)],[f47])).
% 0.10/0.41  fof(f50,plain,(
% 0.10/0.41    ~sQ0_spl|~sQ1_spl),
% 0.10/0.41    inference(split_clause,[status(thm)],[f43,f44,f47])).
% 0.10/0.41  fof(f51,plain,(
% 0.10/0.41    $false|sQ0_spl),
% 0.10/0.41    inference(forward_subsumption_resolution,[status(thm)],[f46,f36])).
% 0.10/0.41  fof(f52,plain,(
% 0.10/0.41    sQ0_spl),
% 0.10/0.41    inference(contradiction_clause,[status(thm)],[f51])).
% 0.10/0.41  fof(f53,plain,(
% 0.10/0.41    isFinite0(sK1_skl)),
% 0.10/0.41    inference(forward_demodulation,[status(thm)],[f38,f28])).
% 0.10/0.41  fof(f54,plain,(
% 0.10/0.41    $false|sQ1_spl),
% 0.10/0.41    inference(forward_subsumption_resolution,[status(thm)],[f53,f49])).
% 0.10/0.41  fof(f55,plain,(
% 0.10/0.41    sQ1_spl),
% 0.10/0.41    inference(contradiction_clause,[status(thm)],[f54])).
% 0.10/0.41  fof(f56,plain,(
% 0.10/0.41    $false),
% 0.10/0.41    inference(sat_refutation,[status(thm)],[f50,f52,f55])).
% 0.10/0.41  % SZS output end CNFRefutation for theBenchmark.p
% 0.10/0.44  % Elapsed time: 0.065705 seconds
% 0.10/0.44  % CPU time: 0.189840 seconds
% 0.10/0.44  % Total memory used: 101.303 MB
% 0.10/0.44  % Net memory used: 100.767 MB
%------------------------------------------------------------------------------