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

% Computer : n010.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.40s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN920+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04  % Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.37  % Computer : n010.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 11:30:10 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.38  % Drodi V4.1.1
% 0.10/0.40  % Refutation found
% 0.10/0.40  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.10/0.40  % SZS output start CNFRefutation for theBenchmark
% 0.10/0.40  fof(f1,conjecture,(
% 0.10/0.40    ( ( ( (! [X] :( ( f(X)& g(X) )=> h(X) ))=> (? [X] :( f(X)& ~ g(X) ) ))& ( (! [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.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.40  fof(f2,negated_conjecture,(
% 0.10/0.40    ~(( ( ( (! [X] :( ( f(X)& g(X) )=> h(X) ))=> (? [X] :( f(X)& ~ g(X) ) ))& ( (! [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.40    inference(negated_conjecture,[status(cth)],[f1])).
% 0.10/0.40  fof(f3,plain,(
% 0.10/0.40    ((((?[X]: ((f(X)&g(X))&~h(X)))|(?[X]: (f(X)&~g(X))))&((![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.40    inference(pre_NNF_transformation,[status(thm)],[f2])).
% 0.10/0.40  fof(f4,definition,(
% 0.10/0.40    ![X]: (sP0_prd(X)<=>((f(X)&g(X))&~h(X)))),
% 0.10/0.40    introduced(definition,[new_symbols(definition,[sP0_prd])],[])).
% 0.10/0.40  fof(f5,plain,(
% 0.10/0.40    (((?[X]: sP0_prd(X))|(?[X]: (f(X)&~g(X))))&((![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.40    inference(formula_renaming,[status(thm)],[f3,f4])).
% 0.10/0.40  fof(f6,plain,(
% 0.10/0.40    ((sP0_prd(sK0_skl)|(f(sK1_skl)&~g(sK1_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.40    inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl,sK1_skl]),skolemize(X,sK0_skl),skolemize(X,sK1_skl)],[f5])).
% 0.10/0.40  fof(f7,plain,(
% 0.10/0.40    sP0_prd(sK0_skl)|f(sK1_skl)),
% 0.10/0.40    inference(cnf_transformation,[status(thm)],[f6])).
% 0.10/0.40  fof(f8,plain,(
% 0.10/0.40    sP0_prd(sK0_skl)|~g(sK1_skl)),
% 0.10/0.40    inference(cnf_transformation,[status(thm)],[f6])).
% 0.10/0.40  fof(f9,plain,(
% 0.10/0.40    ![X0,X1]: (~f(X0)|g(X0)|~f(X1)|h(X1))),
% 0.10/0.40    inference(cnf_transformation,[status(thm)],[f6])).
% 0.10/0.40  fof(f10,plain,(
% 0.10/0.40    ![X0]: (~f(X0)|~h(X0)|g(X0))),
% 0.10/0.40    inference(cnf_transformation,[status(thm)],[f6])).
% 0.10/0.40  fof(f11,plain,(
% 0.10/0.40    ![X0]: (~f(X0)|~g(X0)|h(X0))),
% 0.10/0.40    inference(cnf_transformation,[status(thm)],[f6])).
% 0.10/0.40  fof(f12,plain,(
% 0.10/0.40    ![X]: ((~sP0_prd(X)|((f(X)&g(X))&~h(X)))&(sP0_prd(X)|((~f(X)|~g(X))|h(X))))),
% 0.10/0.40    inference(NNF_transformation,[status(thm)],[f4])).
% 0.10/0.40  fof(f13,plain,(
% 0.10/0.40    (![X]: (~sP0_prd(X)|((f(X)&g(X))&~h(X))))&(![X]: (sP0_prd(X)|((~f(X)|~g(X))|h(X))))),
% 0.10/0.40    inference(miniscoping,[status(thm)],[f12])).
% 0.10/0.40  fof(f14,plain,(
% 0.10/0.40    ![X0]: (~sP0_prd(X0)|f(X0))),
% 0.10/0.40    inference(cnf_transformation,[status(thm)],[f13])).
% 0.10/0.40  fof(f16,plain,(
% 0.10/0.40    ![X0]: (~sP0_prd(X0)|~h(X0))),
% 0.10/0.40    inference(cnf_transformation,[status(thm)],[f13])).
% 0.10/0.40  fof(f18,definition,(
% 0.10/0.40    sQ0_spl <=> (sP0_prd(sK0_skl))),
% 0.10/0.40    introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition])).
% 0.10/0.40  fof(f19,plain,(
% 0.10/0.40    sP0_prd(sK0_skl)|~sQ0_spl),
% 0.10/0.40    inference(component_clause,[status(thm)],[f18])).
% 0.10/0.40  fof(f21,definition,(
% 0.10/0.40    sQ1_spl <=> (f(sK1_skl))),
% 0.10/0.40    introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition])).
% 0.10/0.40  fof(f22,plain,(
% 0.10/0.40    f(sK1_skl)|~sQ1_spl),
% 0.10/0.40    inference(component_clause,[status(thm)],[f21])).
% 0.10/0.40  fof(f24,plain,(
% 0.10/0.40    sQ0_spl|sQ1_spl),
% 0.10/0.40    inference(split_clause,[status(thm)],[f7,f18,f21])).
% 0.10/0.40  fof(f25,definition,(
% 0.10/0.40    sQ2_spl <=> (g(sK1_skl))),
% 0.10/0.40    introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition])).
% 0.10/0.40  fof(f27,plain,(
% 0.10/0.40    ~g(sK1_skl)|sQ2_spl),
% 0.10/0.40    inference(component_clause,[status(thm)],[f25])).
% 0.10/0.40  fof(f28,plain,(
% 0.10/0.40    sQ0_spl|~sQ2_spl),
% 0.10/0.40    inference(split_clause,[status(thm)],[f8,f18,f25])).
% 0.10/0.40  fof(f29,definition,(
% 0.10/0.40    ![X0]: (sQ3_spl <=> (~f(X0)|g(X0)))),
% 0.10/0.40    introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition])).
% 0.10/0.40  fof(f30,plain,(
% 0.10/0.40    ![X0]: (~f(X0)|g(X0)|~sQ3_spl)),
% 0.10/0.40    inference(component_clause,[status(thm)],[f29])).
% 0.10/0.40  fof(f32,definition,(
% 0.10/0.40    ![X1]: (sQ4_spl <=> (~f(X1)|h(X1)))),
% 0.10/0.40    introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition])).
% 0.10/0.40  fof(f33,plain,(
% 0.10/0.40    ![X0]: (~f(X0)|h(X0)|~sQ4_spl)),
% 0.10/0.40    inference(component_clause,[status(thm)],[f32])).
% 0.10/0.40  fof(f35,plain,(
% 0.10/0.40    sQ3_spl|sQ4_spl),
% 0.10/0.40    inference(split_clause,[status(thm)],[f9,f29,f32])).
% 0.10/0.40  fof(f36,plain,(
% 0.10/0.40    ![X0]: (~f(X0)|h(X0)|~sQ3_spl)),
% 0.10/0.40    inference(forward_subsumption_resolution,[status(thm)],[f11,f30])).
% 0.10/0.40  fof(f37,plain,(
% 0.10/0.40    ![X0]: (~f(X0)|~sP0_prd(X0)|~sQ3_spl)),
% 0.10/0.40    inference(resolution,[status(thm)],[f36,f16])).
% 0.10/0.40  fof(f38,plain,(
% 0.10/0.40    ![X0]: (~sP0_prd(X0)|~sQ3_spl)),
% 0.10/0.40    inference(forward_subsumption_resolution,[status(thm)],[f37,f14])).
% 0.10/0.40  fof(f39,plain,(
% 0.10/0.40    $false|~sQ3_spl|~sQ0_spl),
% 0.10/0.40    inference(backward_subsumption_resolution,[status(thm)],[f19,f38])).
% 0.10/0.40  fof(f40,plain,(
% 0.10/0.40    ~sQ3_spl|~sQ0_spl),
% 0.10/0.40    inference(contradiction_clause,[status(thm)],[f39])).
% 0.10/0.40  fof(f41,plain,(
% 0.10/0.40    ![X0]: (~f(X0)|g(X0)|~sQ4_spl)),
% 0.10/0.40    inference(forward_subsumption_resolution,[status(thm)],[f10,f33])).
% 0.10/0.40  fof(f42,plain,(
% 0.10/0.40    ~f(sK1_skl)|~sQ4_spl|sQ2_spl),
% 0.10/0.40    inference(resolution,[status(thm)],[f41,f27])).
% 0.10/0.40  fof(f43,plain,(
% 0.10/0.40    $false|~sQ1_spl|~sQ4_spl|sQ2_spl),
% 0.10/0.40    inference(forward_subsumption_resolution,[status(thm)],[f42,f22])).
% 0.10/0.40  fof(f44,plain,(
% 0.10/0.40    ~sQ1_spl|~sQ4_spl|sQ2_spl),
% 0.10/0.40    inference(contradiction_clause,[status(thm)],[f43])).
% 0.10/0.40  fof(f46,plain,(
% 0.10/0.40    ~h(sK0_skl)|~sQ0_spl),
% 0.10/0.40    inference(resolution,[status(thm)],[f19,f16])).
% 0.10/0.40  fof(f48,plain,(
% 0.10/0.40    ~f(sK0_skl)|~sQ0_spl|~sQ4_spl),
% 0.10/0.40    inference(resolution,[status(thm)],[f46,f33])).
% 0.10/0.40  fof(f49,plain,(
% 0.10/0.40    ~sP0_prd(sK0_skl)|~sQ0_spl|~sQ4_spl),
% 0.10/0.40    inference(resolution,[status(thm)],[f48,f14])).
% 0.10/0.40  fof(f50,plain,(
% 0.10/0.40    ~sQ0_spl|~sQ4_spl),
% 0.10/0.40    inference(split_clause,[status(thm)],[f49,f18,f32])).
% 0.10/0.40  fof(f51,plain,(
% 0.10/0.40    sQ4_spl|~sQ3_spl),
% 0.10/0.40    inference(split_clause,[status(thm)],[f36,f32,f29])).
% 0.10/0.40  fof(f52,plain,(
% 0.10/0.40    $false),
% 0.10/0.40    inference(sat_refutation,[status(thm)],[f24,f28,f35,f40,f44,f50,f51])).
% 0.10/0.40  % SZS output end CNFRefutation for theBenchmark.p
% 0.10/0.42  % Elapsed time: 0.043840 seconds
% 0.10/0.42  % CPU time: 0.108985 seconds
% 0.10/0.42  % Total memory used: 16.652 MB
% 0.10/0.42  % Net memory used: 16.095 MB
%------------------------------------------------------------------------------