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

% Computer : n019.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:21:33 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN918+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04  % Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.36  % Computer : n019.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 11:29:49 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.37  % Drodi V4.1.1
% 0.10/0.38  % Refutation found
% 0.10/0.38  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.10/0.38  % SZS output start CNFRefutation for theBenchmark
% 0.10/0.38  fof(f1,conjecture,(
% 0.10/0.38    ( ( (! [X] :( ( ( f(X)& g(X) )=> h(X) )=> (? [Y] :( f(Y)& ~ g(Y) ) )))& ( (! [W] :( f(W)=> g(W) ))| (! [Z] :( f(Z)=> h(Z) ) )) )=> ( (! [R] :( ( f(R)& h(R) )=> g(R) ))=> (? [V] :( f(V)& g(V)& ~ h(V) ) )) ) ),
% 0.10/0.38    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.38  fof(f2,negated_conjecture,(
% 0.10/0.38    ~(( ( (! [X] :( ( ( f(X)& g(X) )=> h(X) )=> (? [Y] :( f(Y)& ~ g(Y) ) )))& ( (! [W] :( f(W)=> g(W) ))| (! [Z] :( f(Z)=> h(Z) ) )) )=> ( (! [R] :( ( f(R)& h(R) )=> g(R) ))=> (? [V] :( f(V)& g(V)& ~ h(V) ) )) ) )),
% 0.10/0.38    inference(negated_conjecture,[status(cth)],[f1])).
% 0.10/0.38  fof(f3,plain,(
% 0.10/0.38    (((![X]: (((f(X)&g(X))&~h(X))|(?[Y]: (f(Y)&~g(Y)))))&((![W]: (~f(W)|g(W)))|(![Z]: (~f(Z)|h(Z)))))&((![R]: ((~f(R)|~h(R))|g(R)))&(![V]: ((~f(V)|~g(V))|h(V)))))),
% 0.10/0.38    inference(pre_NNF_transformation,[status(thm)],[f2])).
% 0.10/0.38  fof(f4,definition,(
% 0.10/0.38    ![X]: (sP0_prd(X)<=>((f(X)&g(X))&~h(X)))),
% 0.10/0.38    introduced(definition,[new_symbols(definition,[sP0_prd])],[])).
% 0.10/0.38  fof(f5,plain,(
% 0.10/0.38    ((![X]: (sP0_prd(X)|(?[Y]: (f(Y)&~g(Y)))))&((![W]: (~f(W)|g(W)))|(![Z]: (~f(Z)|h(Z)))))&((![R]: ((~f(R)|~h(R))|g(R)))&(![V]: ((~f(V)|~g(V))|h(V))))),
% 0.10/0.38    inference(formula_renaming,[status(thm)],[f3,f4])).
% 0.10/0.38  fof(f6,plain,(
% 0.10/0.38    (((![X]: sP0_prd(X))|(?[Y]: (f(Y)&~g(Y))))&((![W]: (~f(W)|g(W)))|(![Z]: (~f(Z)|h(Z)))))&((![R]: ((~f(R)|~h(R))|g(R)))&(![V]: ((~f(V)|~g(V))|h(V))))),
% 0.10/0.38    inference(miniscoping,[status(thm)],[f5])).
% 0.10/0.38  fof(f7,plain,(
% 0.10/0.38    (((![X]: sP0_prd(X))|(f(sK0_skl)&~g(sK0_skl)))&((![W]: (~f(W)|g(W)))|(![Z]: (~f(Z)|h(Z)))))&((![R]: ((~f(R)|~h(R))|g(R)))&(![V]: ((~f(V)|~g(V))|h(V))))),
% 0.10/0.38    inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl]),skolemize(Y,sK0_skl)],[f6])).
% 0.10/0.38  fof(f8,plain,(
% 0.10/0.38    ![X0]: (sP0_prd(X0)|f(sK0_skl))),
% 0.10/0.38    inference(cnf_transformation,[status(thm)],[f7])).
% 0.10/0.38  fof(f9,plain,(
% 0.10/0.38    ![X0]: (sP0_prd(X0)|~g(sK0_skl))),
% 0.10/0.38    inference(cnf_transformation,[status(thm)],[f7])).
% 0.10/0.38  fof(f10,plain,(
% 0.10/0.38    ![X0,X1]: (~f(X0)|g(X0)|~f(X1)|h(X1))),
% 0.10/0.38    inference(cnf_transformation,[status(thm)],[f7])).
% 0.10/0.38  fof(f11,plain,(
% 0.10/0.38    ![X0]: (~f(X0)|~h(X0)|g(X0))),
% 0.10/0.38    inference(cnf_transformation,[status(thm)],[f7])).
% 0.10/0.38  fof(f12,plain,(
% 0.10/0.38    ![X0]: (~f(X0)|~g(X0)|h(X0))),
% 0.10/0.38    inference(cnf_transformation,[status(thm)],[f7])).
% 0.10/0.38  fof(f13,plain,(
% 0.10/0.38    ![X]: ((~sP0_prd(X)|((f(X)&g(X))&~h(X)))&(sP0_prd(X)|((~f(X)|~g(X))|h(X))))),
% 0.10/0.38    inference(NNF_transformation,[status(thm)],[f4])).
% 0.10/0.38  fof(f14,plain,(
% 0.10/0.38    (![X]: (~sP0_prd(X)|((f(X)&g(X))&~h(X))))&(![X]: (sP0_prd(X)|((~f(X)|~g(X))|h(X))))),
% 0.10/0.38    inference(miniscoping,[status(thm)],[f13])).
% 0.10/0.38  fof(f15,plain,(
% 0.10/0.38    ![X0]: (~sP0_prd(X0)|f(X0))),
% 0.10/0.38    inference(cnf_transformation,[status(thm)],[f14])).
% 0.10/0.38  fof(f16,plain,(
% 0.10/0.38    ![X0]: (~sP0_prd(X0)|g(X0))),
% 0.10/0.38    inference(cnf_transformation,[status(thm)],[f14])).
% 0.10/0.38  fof(f17,plain,(
% 0.10/0.38    ![X0]: (~sP0_prd(X0)|~h(X0))),
% 0.10/0.38    inference(cnf_transformation,[status(thm)],[f14])).
% 0.10/0.38  fof(f19,definition,(
% 0.10/0.38    ![X0]: (sQ0_spl <=> (sP0_prd(X0)))),
% 0.10/0.38    introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition])).
% 0.10/0.38  fof(f20,plain,(
% 0.10/0.38    ![X0]: (sP0_prd(X0)|~sQ0_spl)),
% 0.10/0.38    inference(component_clause,[status(thm)],[f19])).
% 0.10/0.38  fof(f22,definition,(
% 0.10/0.38    sQ1_spl <=> (f(sK0_skl))),
% 0.10/0.38    introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition])).
% 0.10/0.38  fof(f23,plain,(
% 0.10/0.38    f(sK0_skl)|~sQ1_spl),
% 0.10/0.38    inference(component_clause,[status(thm)],[f22])).
% 0.10/0.38  fof(f25,plain,(
% 0.10/0.38    sQ0_spl|sQ1_spl),
% 0.10/0.38    inference(split_clause,[status(thm)],[f8,f19,f22])).
% 0.10/0.38  fof(f26,definition,(
% 0.10/0.38    sQ2_spl <=> (g(sK0_skl))),
% 0.10/0.38    introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition])).
% 0.10/0.38  fof(f28,plain,(
% 0.10/0.38    ~g(sK0_skl)|sQ2_spl),
% 0.10/0.38    inference(component_clause,[status(thm)],[f26])).
% 0.10/0.38  fof(f29,plain,(
% 0.10/0.38    sQ0_spl|~sQ2_spl),
% 0.10/0.38    inference(split_clause,[status(thm)],[f9,f19,f26])).
% 0.10/0.38  fof(f30,definition,(
% 0.10/0.38    ![X0]: (sQ3_spl <=> (~f(X0)|g(X0)))),
% 0.10/0.38    introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition])).
% 0.10/0.38  fof(f31,plain,(
% 0.10/0.38    ![X0]: (~f(X0)|g(X0)|~sQ3_spl)),
% 0.10/0.38    inference(component_clause,[status(thm)],[f30])).
% 0.10/0.38  fof(f33,definition,(
% 0.10/0.38    ![X1]: (sQ4_spl <=> (~f(X1)|h(X1)))),
% 0.10/0.39    introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition])).
% 0.10/0.39  fof(f34,plain,(
% 0.10/0.39    ![X0]: (~f(X0)|h(X0)|~sQ4_spl)),
% 0.10/0.39    inference(component_clause,[status(thm)],[f33])).
% 0.10/0.39  fof(f36,plain,(
% 0.10/0.39    sQ3_spl|sQ4_spl),
% 0.10/0.39    inference(split_clause,[status(thm)],[f10,f30,f33])).
% 0.10/0.39  fof(f37,plain,(
% 0.10/0.39    ![X0]: (f(X0)|~sQ0_spl)),
% 0.10/0.39    inference(forward_subsumption_resolution,[status(thm)],[f15,f20])).
% 0.10/0.39  fof(f38,plain,(
% 0.10/0.39    ![X0]: (g(X0)|~sQ0_spl)),
% 0.10/0.39    inference(forward_subsumption_resolution,[status(thm)],[f16,f20])).
% 0.10/0.39  fof(f39,plain,(
% 0.10/0.39    ![X0]: (~h(X0)|~sQ0_spl)),
% 0.10/0.39    inference(forward_subsumption_resolution,[status(thm)],[f17,f20])).
% 0.10/0.39  fof(f40,plain,(
% 0.10/0.39    ![X0]: (~g(X0)|h(X0)|~sQ0_spl)),
% 0.10/0.39    inference(forward_subsumption_resolution,[status(thm)],[f12,f37])).
% 0.10/0.39  fof(f41,plain,(
% 0.10/0.39    ![X0]: (~g(X0)|~sQ0_spl)),
% 0.10/0.39    inference(resolution,[status(thm)],[f40,f39])).
% 0.10/0.39  fof(f42,plain,(
% 0.10/0.39    $false|~sQ0_spl),
% 0.10/0.39    inference(forward_subsumption_resolution,[status(thm)],[f41,f38])).
% 0.10/0.39  fof(f43,plain,(
% 0.10/0.39    ~sQ0_spl),
% 0.10/0.39    inference(contradiction_clause,[status(thm)],[f42])).
% 0.10/0.39  fof(f44,plain,(
% 0.10/0.39    ~f(sK0_skl)|~sQ3_spl|sQ2_spl),
% 0.10/0.39    inference(resolution,[status(thm)],[f31,f28])).
% 0.10/0.39  fof(f45,plain,(
% 0.10/0.39    $false|~sQ1_spl|~sQ3_spl|sQ2_spl),
% 0.10/0.39    inference(forward_subsumption_resolution,[status(thm)],[f44,f23])).
% 0.10/0.39  fof(f46,plain,(
% 0.10/0.39    ~sQ1_spl|~sQ3_spl|sQ2_spl),
% 0.10/0.39    inference(contradiction_clause,[status(thm)],[f45])).
% 0.10/0.39  fof(f47,plain,(
% 0.10/0.39    ![X0]: (~f(X0)|g(X0)|~sQ4_spl)),
% 0.10/0.39    inference(forward_subsumption_resolution,[status(thm)],[f11,f34])).
% 0.10/0.39  fof(f48,plain,(
% 0.10/0.39    ~f(sK0_skl)|~sQ4_spl|sQ2_spl),
% 0.10/0.39    inference(resolution,[status(thm)],[f47,f28])).
% 0.10/0.39  fof(f49,plain,(
% 0.10/0.39    $false|~sQ1_spl|~sQ4_spl|sQ2_spl),
% 0.10/0.39    inference(forward_subsumption_resolution,[status(thm)],[f48,f23])).
% 0.10/0.39  fof(f50,plain,(
% 0.10/0.39    ~sQ1_spl|~sQ4_spl|sQ2_spl),
% 0.10/0.39    inference(contradiction_clause,[status(thm)],[f49])).
% 0.10/0.39  fof(f51,plain,(
% 0.10/0.39    $false),
% 0.10/0.39    inference(sat_refutation,[status(thm)],[f25,f29,f36,f43,f46,f50])).
% 0.10/0.39  % SZS output end CNFRefutation for theBenchmark.p
% 0.10/0.40  % Elapsed time: 0.029618 seconds
% 0.10/0.40  % CPU time: 0.065054 seconds
% 0.10/0.40  % Total memory used: 7.797 MB
% 0.10/0.40  % Net memory used: 7.585 MB
%------------------------------------------------------------------------------