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

% Computer : n020.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:52 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC208+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04  % Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.37  % Computer : n020.cluster.edu
% 0.09/0.37  % Model    : x86_64 x86_64
% 0.09/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37  % Memory   : 8046.5625MB
% 0.09/0.37  % OS       : Linux 6.8.0-71-generic
% 0.09/0.37  % CPULimit : 300
% 0.09/0.37  % WCLimit  : 300
% 0.09/0.37  % DateTime : Mon Sep 21 08:05:32 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.38  % Drodi V4.1.1
% 0.09/0.40  % Refutation found
% 0.09/0.40  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.09/0.40  % SZS output start CNFRefutation for theBenchmark
% 0.09/0.40  fof(f96,conjecture,(
% 0.09/0.40    (! [U] :( ssList(U)=> (! [V] :( ssList(V)=> (! [W] :( ssList(W)=> (! [X] :( ssList(X)=> ( V != X| U != W| ~ neq(V,nil)| neq(U,nil)| ( ( nil != X| nil != W )& ( ~ neq(W,nil)| ~ frontsegP(X,W) ) ) ) ) )) )) )) )),
% 0.09/0.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.09/0.40  fof(f97,negated_conjecture,(
% 0.09/0.40    ~((! [U] :( ssList(U)=> (! [V] :( ssList(V)=> (! [W] :( ssList(W)=> (! [X] :( ssList(X)=> ( V != X| U != W| ~ neq(V,nil)| neq(U,nil)| ( ( nil != X| nil != W )& ( ~ neq(W,nil)| ~ frontsegP(X,W) ) ) ) ) )) )) )) ))),
% 0.09/0.40    inference(negated_conjecture,[status(cth)],[f96])).
% 0.09/0.40  fof(f415,plain,(
% 0.09/0.40    (?[U]: (ssList(U)&(?[V]: (ssList(V)&(?[W]: (ssList(W)&(?[X]: (ssList(X)&((((V=X&U=W)&neq(V,nil))&~neq(U,nil))&((nil=X&nil=W)|(neq(W,nil)&frontsegP(X,W))))))))))))),
% 0.09/0.40    inference(pre_NNF_transformation,[status(thm)],[f97])).
% 0.09/0.40  fof(f416,definition,(
% 0.09/0.40    ![W,X]: (sP0_prd(X,W)<=>(nil=X&nil=W))),
% 0.09/0.40    introduced(definition,[new_symbols(definition,[sP0_prd])],[])).
% 0.09/0.40  fof(f417,plain,(
% 0.09/0.40    ?[U]: (ssList(U)&(?[V]: (ssList(V)&(?[W]: (ssList(W)&(?[X]: (ssList(X)&((((V=X&U=W)&neq(V,nil))&~neq(U,nil))&(sP0_prd(X,W)|(neq(W,nil)&frontsegP(X,W)))))))))))),
% 0.09/0.40    inference(formula_renaming,[status(thm)],[f415,f416])).
% 0.09/0.40  fof(f418,plain,(
% 0.09/0.40    (ssList(sK47_skl)&(ssList(sK48_skl)&(ssList(sK49_skl)&(ssList(sK50_skl)&((((sK48_skl=sK50_skl&sK47_skl=sK49_skl)&neq(sK48_skl,nil))&~neq(sK47_skl,nil))&(sP0_prd(sK50_skl,sK49_skl)|(neq(sK49_skl,nil)&frontsegP(sK50_skl,sK49_skl))))))))),
% 0.09/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.09/0.40  fof(f423,plain,(
% 0.09/0.40    sK48_skl=sK50_skl),
% 0.09/0.40    inference(cnf_transformation,[status(thm)],[f418])).
% 0.09/0.40  fof(f424,plain,(
% 0.09/0.40    sK47_skl=sK49_skl),
% 0.09/0.40    inference(cnf_transformation,[status(thm)],[f418])).
% 0.09/0.40  fof(f425,plain,(
% 0.09/0.40    neq(sK48_skl,nil)),
% 0.09/0.40    inference(cnf_transformation,[status(thm)],[f418])).
% 0.09/0.40  fof(f426,plain,(
% 0.09/0.40    ~neq(sK47_skl,nil)),
% 0.09/0.40    inference(cnf_transformation,[status(thm)],[f418])).
% 0.09/0.40  fof(f427,plain,(
% 0.09/0.40    sP0_prd(sK50_skl,sK49_skl)|neq(sK49_skl,nil)),
% 0.09/0.40    inference(cnf_transformation,[status(thm)],[f418])).
% 0.09/0.40  fof(f429,plain,(
% 0.09/0.40    ![W,X]: ((~sP0_prd(X,W)|(nil=X&nil=W))&(sP0_prd(X,W)|(~nil=X|~nil=W)))),
% 0.09/0.40    inference(NNF_transformation,[status(thm)],[f416])).
% 0.09/0.40  fof(f430,plain,(
% 0.09/0.40    (![W,X]: (~sP0_prd(X,W)|(nil=X&nil=W)))&(![W,X]: (sP0_prd(X,W)|(~nil=X|~nil=W)))),
% 0.09/0.40    inference(miniscoping,[status(thm)],[f429])).
% 0.09/0.40  fof(f431,plain,(
% 0.09/0.40    ![X0,X1]: (~sP0_prd(X0,X1)|nil=X0)),
% 0.09/0.40    inference(cnf_transformation,[status(thm)],[f430])).
% 0.09/0.40  fof(f432,plain,(
% 0.09/0.40    ![X0,X1]: (~sP0_prd(X0,X1)|nil=X1)),
% 0.09/0.40    inference(cnf_transformation,[status(thm)],[f430])).
% 0.09/0.40  fof(f434,definition,(
% 0.09/0.40    sQ0_spl <=> (sP0_prd(sK50_skl,sK49_skl))),
% 0.09/0.40    introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition])).
% 0.09/0.40  fof(f435,plain,(
% 0.09/0.40    sP0_prd(sK50_skl,sK49_skl)|~sQ0_spl),
% 0.09/0.40    inference(component_clause,[status(thm)],[f434])).
% 0.09/0.40  fof(f437,definition,(
% 0.09/0.40    sQ1_spl <=> (neq(sK49_skl,nil))),
% 0.09/0.40    introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition])).
% 0.09/0.40  fof(f438,plain,(
% 0.09/0.40    neq(sK49_skl,nil)|~sQ1_spl),
% 0.09/0.40    inference(component_clause,[status(thm)],[f437])).
% 0.09/0.40  fof(f440,plain,(
% 0.09/0.40    sQ0_spl|sQ1_spl),
% 0.09/0.40    inference(split_clause,[status(thm)],[f427,f434,f437])).
% 0.09/0.40  fof(f478,plain,(
% 0.09/0.40    neq(sK50_skl,nil)),
% 0.09/0.40    inference(forward_demodulation,[status(thm)],[f423,f425])).
% 0.09/0.40  fof(f479,plain,(
% 0.09/0.40    ~neq(sK49_skl,nil)),
% 0.09/0.40    inference(forward_demodulation,[status(thm)],[f424,f426])).
% 0.09/0.40  fof(f487,plain,(
% 0.09/0.40    nil=sK50_skl|~sQ0_spl),
% 0.09/0.40    inference(resolution,[status(thm)],[f431,f435])).
% 0.09/0.40  fof(f500,plain,(
% 0.09/0.40    ~neq(sK49_skl,sK50_skl)|~sQ0_spl),
% 0.09/0.40    inference(backward_demodulation,[status(thm)],[f487,f479])).
% 0.09/0.40  fof(f501,plain,(
% 0.09/0.40    neq(sK50_skl,sK50_skl)|~sQ0_spl),
% 0.09/0.40    inference(backward_demodulation,[status(thm)],[f487,f478])).
% 0.09/0.40  fof(f505,plain,(
% 0.09/0.40    ![X0,X1]: (~sP0_prd(X0,X1)|sK50_skl=X1|~sQ0_spl)),
% 0.09/0.40    inference(forward_demodulation,[status(thm)],[f487,f432])).
% 0.09/0.40  fof(f506,plain,(
% 0.09/0.40    sK50_skl=sK49_skl|~sQ0_spl),
% 0.09/0.40    inference(resolution,[status(thm)],[f505,f435])).
% 0.09/0.40  fof(f513,plain,(
% 0.09/0.40    ~neq(sK50_skl,sK50_skl)|~sQ0_spl),
% 0.09/0.40    inference(forward_demodulation,[status(thm)],[f506,f500])).
% 0.09/0.40  fof(f514,plain,(
% 0.09/0.40    $false|~sQ0_spl),
% 0.09/0.40    inference(forward_subsumption_resolution,[status(thm)],[f501,f513])).
% 0.09/0.40  fof(f515,plain,(
% 0.09/0.40    ~sQ0_spl),
% 0.09/0.40    inference(contradiction_clause,[status(thm)],[f514])).
% 0.09/0.40  fof(f597,plain,(
% 0.09/0.40    $false|~sQ1_spl),
% 0.09/0.40    inference(forward_subsumption_resolution,[status(thm)],[f479,f438])).
% 0.09/0.40  fof(f598,plain,(
% 0.09/0.40    ~sQ1_spl),
% 0.09/0.40    inference(contradiction_clause,[status(thm)],[f597])).
% 0.09/0.40  fof(f599,plain,(
% 0.09/0.40    $false),
% 0.09/0.40    inference(sat_refutation,[status(thm)],[f440,f515,f598])).
% 0.09/0.40  % SZS output end CNFRefutation for theBenchmark.p
% 0.09/0.44  % Elapsed time: 0.057354 seconds
% 0.09/0.44  % CPU time: 0.172291 seconds
% 0.09/0.44  % Total memory used: 110.611 MB
% 0.09/0.44  % Net memory used: 110.472 MB
%------------------------------------------------------------------------------