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

% Computer : n005.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:18:50 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN058+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04  % Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.36  % Computer : n005.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:41:03 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.37  % Drodi V4.1.1
% 0.14/0.39  % Refutation found
% 0.14/0.39  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.14/0.39  % SZS output start CNFRefutation for theBenchmark
% 0.14/0.39  fof(f1,axiom,(
% 0.14/0.39    (! [X] :( big_p(X)=> (! [Z] : big_q(Z) )) )),
% 0.14/0.39    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.14/0.39  fof(f2,axiom,(
% 0.14/0.39    ( (! [X] :( big_q(X)| big_r(X) ))=> (? [X1] :( big_q(X1)& big_s(X1) ) )) ),
% 0.14/0.39    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.14/0.39  fof(f3,axiom,(
% 0.14/0.39    ( (? [X] : big_s(X))=> (! [X1] :( big_f(X1)=> big_g(X1) ) )) ),
% 0.14/0.39    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.14/0.39  fof(f4,conjecture,(
% 0.14/0.39    (! [X] :( ( big_p(X)& big_f(X) )=> big_g(X) ) )),
% 0.14/0.39    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.14/0.39  fof(f5,negated_conjecture,(
% 0.14/0.39    ~((! [X] :( ( big_p(X)& big_f(X) )=> big_g(X) ) ))),
% 0.14/0.39    inference(negated_conjecture,[status(cth)],[f4])).
% 0.14/0.39  fof(f6,plain,(
% 0.14/0.39    ![X]: (~big_p(X)|(![Z]: big_q(Z)))),
% 0.14/0.39    inference(pre_NNF_transformation,[status(thm)],[f1])).
% 0.14/0.39  fof(f7,plain,(
% 0.14/0.39    (![X]: ~big_p(X))|(![Z]: big_q(Z))),
% 0.14/0.39    inference(miniscoping,[status(thm)],[f6])).
% 0.14/0.39  fof(f8,plain,(
% 0.14/0.39    ![X0,X1]: (~big_p(X0)|big_q(X1))),
% 0.14/0.39    inference(cnf_transformation,[status(thm)],[f7])).
% 0.14/0.39  fof(f9,plain,(
% 0.14/0.39    (?[X]: (~big_q(X)&~big_r(X)))|(?[X1]: (big_q(X1)&big_s(X1)))),
% 0.14/0.39    inference(pre_NNF_transformation,[status(thm)],[f2])).
% 0.14/0.39  fof(f10,definition,(
% 0.14/0.39    ![X]: (sP0_prd(X)<=>(~big_q(X)&~big_r(X)))),
% 0.14/0.39    introduced(definition,[new_symbols(definition,[sP0_prd])],[])).
% 0.14/0.39  fof(f11,plain,(
% 0.14/0.39    (?[X]: sP0_prd(X))|(?[X1]: (big_q(X1)&big_s(X1)))),
% 0.14/0.39    inference(formula_renaming,[status(thm)],[f9,f10])).
% 0.14/0.39  fof(f12,plain,(
% 0.14/0.39    sP0_prd(sK0_skl)|(big_q(sK1_skl)&big_s(sK1_skl))),
% 0.14/0.39    inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl,sK1_skl]),skolemize(X,sK0_skl),skolemize(X1,sK1_skl)],[f11])).
% 0.14/0.39  fof(f14,plain,(
% 0.14/0.39    sP0_prd(sK0_skl)|big_s(sK1_skl)),
% 0.14/0.39    inference(cnf_transformation,[status(thm)],[f12])).
% 0.14/0.39  fof(f15,plain,(
% 0.14/0.39    (![X]: ~big_s(X))|(![X1]: (~big_f(X1)|big_g(X1)))),
% 0.14/0.39    inference(pre_NNF_transformation,[status(thm)],[f3])).
% 0.14/0.39  fof(f16,plain,(
% 0.14/0.39    ![X0,X1]: (~big_s(X0)|~big_f(X1)|big_g(X1))),
% 0.14/0.39    inference(cnf_transformation,[status(thm)],[f15])).
% 0.14/0.39  fof(f17,plain,(
% 0.14/0.39    (?[X]: ((big_p(X)&big_f(X))&~big_g(X)))),
% 0.14/0.39    inference(pre_NNF_transformation,[status(thm)],[f5])).
% 0.14/0.39  fof(f18,plain,(
% 0.14/0.39    ((big_p(sK2_skl)&big_f(sK2_skl))&~big_g(sK2_skl))),
% 0.14/0.39    inference(skolemize,[status(esa),new_symbols(skolem,[sK2_skl]),skolemize(X,sK2_skl)],[f17])).
% 0.14/0.39  fof(f19,plain,(
% 0.14/0.39    big_p(sK2_skl)),
% 0.14/0.39    inference(cnf_transformation,[status(thm)],[f18])).
% 0.14/0.39  fof(f20,plain,(
% 0.14/0.39    big_f(sK2_skl)),
% 0.14/0.39    inference(cnf_transformation,[status(thm)],[f18])).
% 0.14/0.39  fof(f21,plain,(
% 0.14/0.39    ~big_g(sK2_skl)),
% 0.14/0.39    inference(cnf_transformation,[status(thm)],[f18])).
% 0.14/0.39  fof(f22,plain,(
% 0.14/0.39    ![X]: ((~sP0_prd(X)|(~big_q(X)&~big_r(X)))&(sP0_prd(X)|(big_q(X)|big_r(X))))),
% 0.14/0.39    inference(NNF_transformation,[status(thm)],[f10])).
% 0.14/0.39  fof(f23,plain,(
% 0.14/0.39    (![X]: (~sP0_prd(X)|(~big_q(X)&~big_r(X))))&(![X]: (sP0_prd(X)|(big_q(X)|big_r(X))))),
% 0.14/0.39    inference(miniscoping,[status(thm)],[f22])).
% 0.14/0.39  fof(f24,plain,(
% 0.14/0.39    ![X0]: (~sP0_prd(X0)|~big_q(X0))),
% 0.14/0.39    inference(cnf_transformation,[status(thm)],[f23])).
% 0.14/0.39  fof(f27,definition,(
% 0.14/0.39    ![X0]: (sQ0_spl <=> (~big_p(X0)))),
% 0.14/0.39    introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition])).
% 0.14/0.39  fof(f28,plain,(
% 0.14/0.39    ![X0]: (~big_p(X0)|~sQ0_spl)),
% 0.14/0.39    inference(component_clause,[status(thm)],[f27])).
% 0.14/0.39  fof(f30,definition,(
% 0.14/0.39    ![X1]: (sQ1_spl <=> (big_q(X1)))),
% 0.14/0.39    introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition])).
% 0.14/0.39  fof(f31,plain,(
% 0.14/0.39    ![X0]: (big_q(X0)|~sQ1_spl)),
% 0.14/0.39    inference(component_clause,[status(thm)],[f30])).
% 0.14/0.39  fof(f33,plain,(
% 0.14/0.39    sQ0_spl|sQ1_spl),
% 0.14/0.39    inference(split_clause,[status(thm)],[f8,f27,f30])).
% 0.14/0.39  fof(f34,definition,(
% 0.14/0.39    sQ2_spl <=> (sP0_prd(sK0_skl))),
% 0.14/0.39    introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition])).
% 0.14/0.39  fof(f35,plain,(
% 0.14/0.39    sP0_prd(sK0_skl)|~sQ2_spl),
% 0.14/0.39    inference(component_clause,[status(thm)],[f34])).
% 0.14/0.39  fof(f41,definition,(
% 0.14/0.39    sQ4_spl <=> (big_s(sK1_skl))),
% 0.14/0.39    introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition])).
% 0.14/0.39  fof(f42,plain,(
% 0.14/0.39    big_s(sK1_skl)|~sQ4_spl),
% 0.14/0.39    inference(component_clause,[status(thm)],[f41])).
% 0.14/0.39  fof(f44,plain,(
% 0.14/0.39    sQ2_spl|sQ4_spl),
% 0.14/0.39    inference(split_clause,[status(thm)],[f14,f34,f41])).
% 0.14/0.39  fof(f45,definition,(
% 0.14/0.39    ![X0]: (sQ5_spl <=> (~big_s(X0)))),
% 0.14/0.39    introduced(definition,[new_symbols(definition,[sQ5_spl])],[split_symbol_definition])).
% 0.14/0.39  fof(f46,plain,(
% 0.14/0.39    ![X0]: (~big_s(X0)|~sQ5_spl)),
% 0.14/0.39    inference(component_clause,[status(thm)],[f45])).
% 0.14/0.39  fof(f48,definition,(
% 0.14/0.39    ![X1]: (sQ6_spl <=> (~big_f(X1)|big_g(X1)))),
% 0.14/0.39    introduced(definition,[new_symbols(definition,[sQ6_spl])],[split_symbol_definition])).
% 0.14/0.39  fof(f49,plain,(
% 0.14/0.39    ![X0]: (~big_f(X0)|big_g(X0)|~sQ6_spl)),
% 0.14/0.39    inference(component_clause,[status(thm)],[f48])).
% 0.14/0.39  fof(f51,plain,(
% 0.14/0.39    sQ5_spl|sQ6_spl),
% 0.14/0.39    inference(split_clause,[status(thm)],[f16,f45,f48])).
% 0.14/0.39  fof(f52,plain,(
% 0.14/0.39    $false|~sQ0_spl),
% 0.14/0.39    inference(backward_subsumption_resolution,[status(thm)],[f19,f28])).
% 0.14/0.39  fof(f53,plain,(
% 0.14/0.39    ~sQ0_spl),
% 0.14/0.39    inference(contradiction_clause,[status(thm)],[f52])).
% 0.14/0.39  fof(f54,plain,(
% 0.14/0.39    $false|~sQ1_spl|~sQ2_spl),
% 0.14/0.39    inference(backward_subsumption_resolution,[status(thm)],[f35,f55])).
% 0.14/0.39  fof(f55,plain,(
% 0.14/0.39    ![X0]: (~sP0_prd(X0)|~sQ1_spl)),
% 0.14/0.39    inference(forward_subsumption_resolution,[status(thm)],[f24,f31])).
% 0.14/0.39  fof(f56,plain,(
% 0.14/0.39    ~sQ1_spl|~sQ2_spl),
% 0.14/0.39    inference(contradiction_clause,[status(thm)],[f54])).
% 0.14/0.39  fof(f57,plain,(
% 0.14/0.39    $false|~sQ5_spl|~sQ4_spl),
% 0.14/0.39    inference(forward_subsumption_resolution,[status(thm)],[f42,f46])).
% 0.14/0.39  fof(f58,plain,(
% 0.14/0.39    ~sQ5_spl|~sQ4_spl),
% 0.14/0.39    inference(contradiction_clause,[status(thm)],[f57])).
% 0.14/0.39  fof(f59,plain,(
% 0.14/0.39    ~big_f(sK2_skl)|~sQ6_spl),
% 0.14/0.39    inference(resolution,[status(thm)],[f49,f21])).
% 0.14/0.39  fof(f60,plain,(
% 0.14/0.39    $false|~sQ6_spl),
% 0.14/0.39    inference(forward_subsumption_resolution,[status(thm)],[f59,f20])).
% 0.14/0.39  fof(f61,plain,(
% 0.14/0.39    ~sQ6_spl),
% 0.14/0.39    inference(contradiction_clause,[status(thm)],[f60])).
% 0.14/0.39  fof(f62,plain,(
% 0.14/0.39    $false),
% 0.14/0.39    inference(sat_refutation,[status(thm)],[f33,f44,f51,f53,f56,f58,f61])).
% 0.14/0.39  % SZS output end CNFRefutation for theBenchmark.p
% 0.14/0.41  % Elapsed time: 0.039832 seconds
% 0.14/0.41  % CPU time: 0.101870 seconds
% 0.14/0.41  % Total memory used: 16.630 MB
% 0.14/0.41  % Net memory used: 16.104 MB
%------------------------------------------------------------------------------