%------------------------------------------------------------------------------
% File : Drodi-SAT---4.1.1
% Problem : SWC040+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 : n011.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:25 PM UTC 2026
% Result : Theorem 0.10s 0.42s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC040+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.10/0.37 % Computer : n011.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 07:50:42 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.39 % Drodi V4.1.1
% 0.10/0.42 % Refutation found
% 0.10/0.42 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.10/0.42 % SZS output start CNFRefutation for theBenchmark
% 0.10/0.42 fof(f96,conjecture,(
% 0.10/0.42 (! [U] :( ssList(U)=> (! [V] :( ssList(V)=> (! [W] :( ssList(W)=> (! [X] :( ssList(X)=> ( nil != V| V != X| U != W| nil = U| ( nil != W& nil = X )| ( (! [Y] :( ssItem(Y)=> (! [Z] :( ssList(Z)=> ( app(cons(Y,nil),Z) != W| app(Z,cons(Y,nil)) != X ) ) )))& neq(X,nil) ) ) ) )) )) )) )),
% 0.10/0.42 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.42 fof(f97,negated_conjecture,(
% 0.10/0.42 ~((! [U] :( ssList(U)=> (! [V] :( ssList(V)=> (! [W] :( ssList(W)=> (! [X] :( ssList(X)=> ( nil != V| V != X| U != W| nil = U| ( nil != W& nil = X )| ( (! [Y] :( ssItem(Y)=> (! [Z] :( ssList(Z)=> ( app(cons(Y,nil),Z) != W| app(Z,cons(Y,nil)) != X ) ) )))& neq(X,nil) ) ) ) )) )) )) ))),
% 0.10/0.42 inference(negated_conjecture,[status(cth)],[f96])).
% 0.10/0.42 fof(f415,plain,(
% 0.10/0.42 (?[U]: (ssList(U)&(?[V]: (ssList(V)&(?[W]: (ssList(W)&(?[X]: (ssList(X)&(((((nil=V&V=X)&U=W)&~nil=U)&(nil=W|~nil=X))&((?[Y]: (ssItem(Y)&(?[Z]: (ssList(Z)&(app(cons(Y,nil),Z)=W&app(Z,cons(Y,nil))=X)))))|~neq(X,nil)))))))))))),
% 0.10/0.42 inference(pre_NNF_transformation,[status(thm)],[f97])).
% 0.10/0.42 fof(f416,plain,(
% 0.10/0.42 (ssList(sK47_skl)&(ssList(sK48_skl)&(ssList(sK49_skl)&(ssList(sK50_skl)&(((((nil=sK48_skl&sK48_skl=sK50_skl)&sK47_skl=sK49_skl)&~nil=sK47_skl)&(nil=sK49_skl|~nil=sK50_skl))&((ssItem(sK51_skl)&(ssList(sK52_skl)&(app(cons(sK51_skl,nil),sK52_skl)=sK49_skl&app(sK52_skl,cons(sK51_skl,nil))=sK50_skl)))|~neq(sK50_skl,nil)))))))),
% 0.10/0.42 inference(skolemize,[status(esa),new_symbols(skolem,[sK47_skl,sK48_skl,sK49_skl,sK50_skl,sK51_skl,sK52_skl]),skolemize(U,sK47_skl),skolemize(V,sK48_skl),skolemize(W,sK49_skl),skolemize(X,sK50_skl),skolemize(Y,sK51_skl),skolemize(Z,sK52_skl)],[f415])).
% 0.10/0.42 fof(f421,plain,(
% 0.10/0.42 nil=sK48_skl),
% 0.10/0.42 inference(cnf_transformation,[status(thm)],[f416])).
% 0.10/0.42 fof(f422,plain,(
% 0.10/0.42 sK48_skl=sK50_skl),
% 0.10/0.42 inference(cnf_transformation,[status(thm)],[f416])).
% 0.10/0.42 fof(f423,plain,(
% 0.10/0.42 sK47_skl=sK49_skl),
% 0.10/0.42 inference(cnf_transformation,[status(thm)],[f416])).
% 0.10/0.42 fof(f424,plain,(
% 0.10/0.42 ~nil=sK47_skl),
% 0.10/0.42 inference(cnf_transformation,[status(thm)],[f416])).
% 0.10/0.42 fof(f425,plain,(
% 0.10/0.42 nil=sK49_skl|~nil=sK50_skl),
% 0.10/0.42 inference(cnf_transformation,[status(thm)],[f416])).
% 0.10/0.42 fof(f430,definition,(
% 0.10/0.42 sQ0_spl <=> (nil=sK49_skl)),
% 0.10/0.42 introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition])).
% 0.10/0.42 fof(f431,plain,(
% 0.10/0.42 nil=sK49_skl|~sQ0_spl),
% 0.10/0.42 inference(component_clause,[status(thm)],[f430])).
% 0.10/0.42 fof(f433,definition,(
% 0.10/0.42 sQ1_spl <=> (nil=sK50_skl)),
% 0.10/0.42 introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition])).
% 0.10/0.42 fof(f435,plain,(
% 0.10/0.42 ~nil=sK50_skl|sQ1_spl),
% 0.10/0.42 inference(component_clause,[status(thm)],[f433])).
% 0.10/0.42 fof(f436,plain,(
% 0.10/0.42 sQ0_spl|~sQ1_spl),
% 0.10/0.42 inference(split_clause,[status(thm)],[f425,f430,f433])).
% 0.10/0.42 fof(f486,plain,(
% 0.10/0.42 nil=sK50_skl),
% 0.10/0.42 inference(backward_demodulation,[status(thm)],[f422,f421])).
% 0.10/0.42 fof(f489,plain,(
% 0.10/0.42 ~nil=sK49_skl),
% 0.10/0.42 inference(forward_demodulation,[status(thm)],[f423,f424])).
% 0.10/0.42 fof(f490,plain,(
% 0.10/0.42 $false|~sQ0_spl),
% 0.10/0.42 inference(forward_subsumption_resolution,[status(thm)],[f431,f489])).
% 0.10/0.42 fof(f491,plain,(
% 0.10/0.42 ~sQ0_spl),
% 0.10/0.42 inference(contradiction_clause,[status(thm)],[f490])).
% 0.10/0.42 fof(f494,plain,(
% 0.10/0.42 ~sK50_skl=sK50_skl|sQ1_spl),
% 0.10/0.42 inference(forward_demodulation,[status(thm)],[f486,f435])).
% 0.10/0.42 fof(f495,plain,(
% 0.10/0.42 $false|sQ1_spl),
% 0.10/0.42 inference(trivial_equality_resolution,[status(thm)],[f494])).
% 0.10/0.42 fof(f496,plain,(
% 0.10/0.42 sQ1_spl),
% 0.10/0.42 inference(contradiction_clause,[status(thm)],[f495])).
% 0.10/0.42 fof(f497,plain,(
% 0.10/0.42 $false),
% 0.10/0.42 inference(sat_refutation,[status(thm)],[f436,f491,f496])).
% 0.10/0.42 % SZS output end CNFRefutation for theBenchmark.p
% 0.10/0.44 % Elapsed time: 0.064240 seconds
% 0.10/0.44 % CPU time: 0.170566 seconds
% 0.10/0.44 % Total memory used: 110.432 MB
% 0.10/0.44 % Net memory used: 110.295 MB
%------------------------------------------------------------------------------