↑ 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  : SWC255+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/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 02:41:59 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWC255+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04  % Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.35  % Computer : n010.cluster.edu
% 0.07/0.35  % Model    : x86_64 x86_64
% 0.07/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35  % Memory   : 8046.5625MB
% 0.07/0.35  % OS       : Linux 6.8.0-71-generic
% 0.07/0.35  % CPULimit : 300
% 0.07/0.35  % WCLimit  : 300
% 0.07/0.35  % DateTime : Mon Sep 21 08:09:40 UTC 2026
% 0.07/0.35  % CPUTime  : 
% 0.12/0.37  % Drodi V4.1.1
% 0.12/0.39  % Refutation found
% 0.12/0.39  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.12/0.39  % SZS output start CNFRefutation for theBenchmark
% 0.12/0.39  fof(f96,conjecture,(
% 0.12/0.39    (! [U] :( ssList(U)=> (! [V] :( ssList(V)=> (! [W] :( ssList(W)=> (! [X] :( ssList(X)=> ( V != X| U != W| ( ( ~ neq(V,nil)| ~ singletonP(W)| singletonP(U) )& ( ~ neq(V,nil)| neq(X,nil) ) ) ) ) )) )) )) )),
% 0.12/0.39    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.12/0.39  fof(f97,negated_conjecture,(
% 0.12/0.39    ~((! [U] :( ssList(U)=> (! [V] :( ssList(V)=> (! [W] :( ssList(W)=> (! [X] :( ssList(X)=> ( V != X| U != W| ( ( ~ neq(V,nil)| ~ singletonP(W)| singletonP(U) )& ( ~ neq(V,nil)| neq(X,nil) ) ) ) ) )) )) )) ))),
% 0.12/0.39    inference(negated_conjecture,[status(cth)],[f96])).
% 0.12/0.39  fof(f415,plain,(
% 0.12/0.39    (?[U]: (ssList(U)&(?[V]: (ssList(V)&(?[W]: (ssList(W)&(?[X]: (ssList(X)&((V=X&U=W)&(((neq(V,nil)&singletonP(W))&~singletonP(U))|(neq(V,nil)&~neq(X,nil))))))))))))),
% 0.12/0.39    inference(pre_NNF_transformation,[status(thm)],[f97])).
% 0.12/0.39  fof(f416,definition,(
% 0.12/0.39    ![U,V,W]: (sP0_prd(W,V,U)<=>((neq(V,nil)&singletonP(W))&~singletonP(U)))),
% 0.12/0.40    introduced(definition,[new_symbols(definition,[sP0_prd])],[])).
% 0.12/0.40  fof(f417,plain,(
% 0.12/0.40    ?[U]: (ssList(U)&(?[V]: (ssList(V)&(?[W]: (ssList(W)&(?[X]: (ssList(X)&((V=X&U=W)&(sP0_prd(W,V,U)|(neq(V,nil)&~neq(X,nil)))))))))))),
% 0.12/0.40    inference(formula_renaming,[status(thm)],[f415,f416])).
% 0.12/0.40  fof(f418,plain,(
% 0.12/0.40    (ssList(sK47_skl)&(ssList(sK48_skl)&(ssList(sK49_skl)&(ssList(sK50_skl)&((sK48_skl=sK50_skl&sK47_skl=sK49_skl)&(sP0_prd(sK49_skl,sK48_skl,sK47_skl)|(neq(sK48_skl,nil)&~neq(sK50_skl,nil))))))))),
% 0.12/0.40    inference(skolemize,[status(esa),new_symbols(skolem,[sK47_skl,sK48_skl,sK49_skl,sK50_skl]),skolemize(U,sK47_skl),skolemize(V,sK48_skl),skolemize(W,sK49_skl),skolemize(X,sK50_skl)],[f417])).
% 0.12/0.40  fof(f423,plain,(
% 0.12/0.40    sK48_skl=sK50_skl),
% 0.12/0.40    inference(cnf_transformation,[status(thm)],[f418])).
% 0.12/0.40  fof(f424,plain,(
% 0.12/0.40    sK47_skl=sK49_skl),
% 0.12/0.40    inference(cnf_transformation,[status(thm)],[f418])).
% 0.12/0.40  fof(f425,plain,(
% 0.12/0.40    sP0_prd(sK49_skl,sK48_skl,sK47_skl)|neq(sK48_skl,nil)),
% 0.12/0.40    inference(cnf_transformation,[status(thm)],[f418])).
% 0.12/0.40  fof(f426,plain,(
% 0.12/0.40    sP0_prd(sK49_skl,sK48_skl,sK47_skl)|~neq(sK50_skl,nil)),
% 0.12/0.40    inference(cnf_transformation,[status(thm)],[f418])).
% 0.12/0.40  fof(f427,plain,(
% 0.12/0.40    ![U,V,W]: ((~sP0_prd(W,V,U)|((neq(V,nil)&singletonP(W))&~singletonP(U)))&(sP0_prd(W,V,U)|((~neq(V,nil)|~singletonP(W))|singletonP(U))))),
% 0.12/0.40    inference(NNF_transformation,[status(thm)],[f416])).
% 0.12/0.40  fof(f428,plain,(
% 0.12/0.40    (![U,V,W]: (~sP0_prd(W,V,U)|((neq(V,nil)&singletonP(W))&~singletonP(U))))&(![U,V,W]: (sP0_prd(W,V,U)|((~neq(V,nil)|~singletonP(W))|singletonP(U))))),
% 0.12/0.40    inference(miniscoping,[status(thm)],[f427])).
% 0.12/0.40  fof(f430,plain,(
% 0.12/0.40    ![X0,X1,X2]: (~sP0_prd(X0,X1,X2)|singletonP(X0))),
% 0.12/0.40    inference(cnf_transformation,[status(thm)],[f428])).
% 0.12/0.40  fof(f431,plain,(
% 0.12/0.40    ![X0,X1,X2]: (~sP0_prd(X0,X1,X2)|~singletonP(X2))),
% 0.12/0.40    inference(cnf_transformation,[status(thm)],[f428])).
% 0.12/0.40  fof(f433,definition,(
% 0.12/0.40    sQ0_spl <=> (sP0_prd(sK49_skl,sK48_skl,sK47_skl))),
% 0.12/0.40    introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition])).
% 0.12/0.40  fof(f434,plain,(
% 0.12/0.40    sP0_prd(sK49_skl,sK48_skl,sK47_skl)|~sQ0_spl),
% 0.12/0.40    inference(component_clause,[status(thm)],[f433])).
% 0.12/0.40  fof(f436,definition,(
% 0.12/0.40    sQ1_spl <=> (neq(sK48_skl,nil))),
% 0.12/0.40    introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition])).
% 0.12/0.40  fof(f437,plain,(
% 0.12/0.40    neq(sK48_skl,nil)|~sQ1_spl),
% 0.12/0.40    inference(component_clause,[status(thm)],[f436])).
% 0.12/0.40  fof(f439,plain,(
% 0.12/0.40    sQ0_spl|sQ1_spl),
% 0.12/0.40    inference(split_clause,[status(thm)],[f425,f433,f436])).
% 0.12/0.40  fof(f440,definition,(
% 0.12/0.40    sQ2_spl <=> (neq(sK50_skl,nil))),
% 0.12/0.40    introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition])).
% 0.12/0.40  fof(f442,plain,(
% 0.12/0.40    ~neq(sK50_skl,nil)|sQ2_spl),
% 0.12/0.40    inference(component_clause,[status(thm)],[f440])).
% 0.12/0.40  fof(f443,plain,(
% 0.12/0.40    sQ0_spl|~sQ2_spl),
% 0.12/0.40    inference(split_clause,[status(thm)],[f426,f433,f440])).
% 0.12/0.40  fof(f476,plain,(
% 0.12/0.40    sP0_prd(sK49_skl,sK50_skl,sK47_skl)|~sQ0_spl),
% 0.12/0.40    inference(forward_demodulation,[status(thm)],[f423,f434])).
% 0.12/0.40  fof(f477,plain,(
% 0.12/0.40    sP0_prd(sK49_skl,sK50_skl,sK49_skl)|~sQ0_spl),
% 0.12/0.40    inference(forward_demodulation,[status(thm)],[f424,f476])).
% 0.12/0.40  fof(f478,plain,(
% 0.12/0.40    ~singletonP(sK49_skl)|~sQ0_spl),
% 0.12/0.40    inference(resolution,[status(thm)],[f477,f431])).
% 0.12/0.40  fof(f479,plain,(
% 0.12/0.40    singletonP(sK49_skl)|~sQ0_spl),
% 0.12/0.40    inference(resolution,[status(thm)],[f477,f430])).
% 0.12/0.40  fof(f480,plain,(
% 0.12/0.40    $false|~sQ0_spl),
% 0.12/0.40    inference(forward_subsumption_resolution,[status(thm)],[f479,f478])).
% 0.12/0.40  fof(f481,plain,(
% 0.12/0.40    ~sQ0_spl),
% 0.12/0.40    inference(contradiction_clause,[status(thm)],[f480])).
% 0.12/0.40  fof(f482,plain,(
% 0.12/0.40    neq(sK50_skl,nil)|~sQ1_spl),
% 0.12/0.40    inference(forward_demodulation,[status(thm)],[f423,f437])).
% 0.12/0.40  fof(f487,plain,(
% 0.12/0.40    $false|~sQ1_spl|sQ2_spl),
% 0.12/0.40    inference(forward_subsumption_resolution,[status(thm)],[f442,f482])).
% 0.12/0.40  fof(f488,plain,(
% 0.12/0.40    ~sQ1_spl|sQ2_spl),
% 0.12/0.40    inference(contradiction_clause,[status(thm)],[f487])).
% 0.12/0.40  fof(f489,plain,(
% 0.12/0.40    $false),
% 0.12/0.40    inference(sat_refutation,[status(thm)],[f439,f443,f481,f488])).
% 0.12/0.40  % SZS output end CNFRefutation for theBenchmark.p
% 0.12/0.42  % Elapsed time: 0.067155 seconds
% 0.12/0.42  % CPU time: 0.181430 seconds
% 0.12/0.42  % Total memory used: 110.374 MB
% 0.12/0.42  % Net memory used: 110.233 MB
%------------------------------------------------------------------------------