↑ 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  : SYN376+1 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n003.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 03:19:30 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN376+1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.03  % Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36  % Computer : n003.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 10:53:47 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.37  % Drodi V4.1.1
% 0.09/0.39  % Refutation found
% 0.09/0.39  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.09/0.39  % SZS output start CNFRefutation for theBenchmark
% 0.09/0.39  fof(f1,conjecture,(
% 0.09/0.39    ( (? [X] :(! [Y] :( big_p(Y)<=> big_p(X) )))=> ( (! [X] : big_p(X))| (! [X] : ~ big_p(X) )) ) ),
% 0.09/0.39    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.09/0.39  fof(f2,negated_conjecture,(
% 0.09/0.39    ~(( (? [X] :(! [Y] :( big_p(Y)<=> big_p(X) )))=> ( (! [X] : big_p(X))| (! [X] : ~ big_p(X) )) ) )),
% 0.09/0.39    inference(negated_conjecture,[status(cth)],[f1])).
% 0.09/0.39  fof(f3,plain,(
% 0.09/0.39    ((?[X]: ![Y]: (big_p(Y)<=>big_p(X)))&((?[X]: ~big_p(X))&(?[X]: big_p(X))))),
% 0.09/0.39    inference(pre_NNF_transformation,[status(thm)],[f2])).
% 0.09/0.39  fof(f4,plain,(
% 0.09/0.39    (?[X]: ![Y]: ((~big_p(Y)|big_p(X))&(big_p(Y)|~big_p(X))))&((?[X]: ~big_p(X))&(?[X]: big_p(X)))),
% 0.09/0.39    inference(NNF_transformation,[status(thm)],[f3])).
% 0.09/0.39  fof(f5,plain,(
% 0.09/0.39    (?[X]: (((![Y]: ~big_p(Y))|big_p(X))&((![Y]: big_p(Y))|~big_p(X))))&((?[X]: ~big_p(X))&(?[X]: big_p(X)))),
% 0.09/0.39    inference(miniscoping,[status(thm)],[f4])).
% 0.09/0.39  fof(f6,plain,(
% 0.09/0.39    (((![Y]: ~big_p(Y))|big_p(sK0_skl))&((![Y]: big_p(Y))|~big_p(sK0_skl)))&(~big_p(sK1_skl)&big_p(sK2_skl))),
% 0.09/0.39    inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl,sK1_skl,sK2_skl]),skolemize(X,sK0_skl),skolemize(X,sK1_skl),skolemize(X,sK2_skl)],[f5])).
% 0.09/0.39  fof(f7,plain,(
% 0.09/0.39    ![X0]: (~big_p(X0)|big_p(sK0_skl))),
% 0.09/0.39    inference(cnf_transformation,[status(thm)],[f6])).
% 0.09/0.39  fof(f8,plain,(
% 0.09/0.39    ![X0]: (big_p(X0)|~big_p(sK0_skl))),
% 0.09/0.39    inference(cnf_transformation,[status(thm)],[f6])).
% 0.09/0.39  fof(f9,plain,(
% 0.09/0.39    ~big_p(sK1_skl)),
% 0.09/0.39    inference(cnf_transformation,[status(thm)],[f6])).
% 0.09/0.39  fof(f10,plain,(
% 0.09/0.39    big_p(sK2_skl)),
% 0.09/0.39    inference(cnf_transformation,[status(thm)],[f6])).
% 0.09/0.39  fof(f11,definition,(
% 0.09/0.39    ![X0]: (sQ0_spl <=> (~big_p(X0)))),
% 0.09/0.39    introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition])).
% 0.09/0.39  fof(f12,plain,(
% 0.09/0.39    ![X0]: (~big_p(X0)|~sQ0_spl)),
% 0.09/0.39    inference(component_clause,[status(thm)],[f11])).
% 0.09/0.39  fof(f14,definition,(
% 0.09/0.39    sQ1_spl <=> (big_p(sK0_skl))),
% 0.09/0.39    introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition])).
% 0.09/0.39  fof(f17,plain,(
% 0.09/0.39    sQ0_spl|sQ1_spl),
% 0.09/0.39    inference(split_clause,[status(thm)],[f7,f11,f14])).
% 0.09/0.39  fof(f18,definition,(
% 0.09/0.39    ![X0]: (sQ2_spl <=> (big_p(X0)))),
% 0.09/0.39    introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition])).
% 0.09/0.39  fof(f19,plain,(
% 0.09/0.39    ![X0]: (big_p(X0)|~sQ2_spl)),
% 0.09/0.39    inference(component_clause,[status(thm)],[f18])).
% 0.09/0.39  fof(f21,plain,(
% 0.09/0.39    sQ2_spl|~sQ1_spl),
% 0.09/0.39    inference(split_clause,[status(thm)],[f8,f18,f14])).
% 0.09/0.39  fof(f22,plain,(
% 0.09/0.39    $false|~sQ2_spl),
% 0.09/0.39    inference(backward_subsumption_resolution,[status(thm)],[f9,f19])).
% 0.09/0.39  fof(f25,plain,(
% 0.09/0.39    $false|~sQ0_spl),
% 0.09/0.39    inference(backward_subsumption_resolution,[status(thm)],[f10,f12])).
% 0.09/0.39  fof(f26,plain,(
% 0.09/0.39    ~sQ0_spl),
% 0.09/0.39    inference(contradiction_clause,[status(thm)],[f25])).
% 0.09/0.39  fof(f27,plain,(
% 0.09/0.39    ~sQ2_spl),
% 0.09/0.39    inference(contradiction_clause,[status(thm)],[f22])).
% 0.09/0.39  fof(f28,plain,(
% 0.09/0.39    $false),
% 0.09/0.39    inference(sat_refutation,[status(thm)],[f17,f21,f26,f27])).
% 0.09/0.39  % SZS output end CNFRefutation for theBenchmark.p
% 0.09/0.41  % Elapsed time: 0.044124 seconds
% 0.09/0.41  % CPU time: 0.136330 seconds
% 0.09/0.41  % Total memory used: 55.269 MB
% 0.09/0.41  % Net memory used: 54.606 MB
%------------------------------------------------------------------------------