↑ 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  : SWC019+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 : n002.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:21 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWC019+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.08/0.34  % Computer : n002.cluster.edu
% 0.08/0.34  % Model    : x86_64 x86_64
% 0.08/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34  % Memory   : 8046.5625MB
% 0.08/0.34  % OS       : Linux 6.8.0-71-generic
% 0.08/0.34  % CPULimit : 300
% 0.08/0.34  % WCLimit  : 300
% 0.08/0.34  % DateTime : Mon Sep 21 07:52:17 UTC 2026
% 0.08/0.35  % CPUTime  : 
% 0.12/0.36  % Drodi V4.1.1
% 0.12/0.40  % Refutation found
% 0.12/0.40  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.12/0.40  % SZS output start CNFRefutation for theBenchmark
% 0.12/0.40  fof(f15,axiom,(
% 0.12/0.40    (! [U] :( ssList(U)=> (! [V] :( ssList(V)=> ( neq(U,V)<=> U != V ) ) )) )),
% 0.12/0.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.12/0.40  fof(f17,axiom,(
% 0.12/0.40    ssList(nil) ),
% 0.12/0.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.12/0.40  fof(f42,axiom,(
% 0.12/0.40    (! [U] :( ssList(U)=> frontsegP(U,U) ) )),
% 0.12/0.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.12/0.40  fof(f96,conjecture,(
% 0.12/0.40    (! [U] :( ssList(U)=> (! [V] :( ssList(V)=> (! [W] :( ssList(W)=> (! [X] :( ssList(X)=> ( V != X| U != W| X != W| (? [Y] :( ssList(Y)& neq(Y,nil)& frontsegP(V,Y)& frontsegP(U,Y) ))| ( nil = V& nil = U ) ) ) )) )) )) )),
% 0.12/0.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.12/0.40  fof(f97,negated_conjecture,(
% 0.12/0.40    ~((! [U] :( ssList(U)=> (! [V] :( ssList(V)=> (! [W] :( ssList(W)=> (! [X] :( ssList(X)=> ( V != X| U != W| X != W| (? [Y] :( ssList(Y)& neq(Y,nil)& frontsegP(V,Y)& frontsegP(U,Y) ))| ( nil = V& nil = U ) ) ) )) )) )) ))),
% 0.12/0.40    inference(negated_conjecture,[status(cth)],[f96])).
% 0.12/0.40  fof(f217,plain,(
% 0.12/0.40    ![U]: (~ssList(U)|(![V]: (~ssList(V)|(neq(U,V)<=>~U=V))))),
% 0.12/0.40    inference(pre_NNF_transformation,[status(thm)],[f15])).
% 0.12/0.40  fof(f218,plain,(
% 0.12/0.40    ![U]: (~ssList(U)|(![V]: (~ssList(V)|((~neq(U,V)|~U=V)&(neq(U,V)|U=V)))))),
% 0.12/0.40    inference(NNF_transformation,[status(thm)],[f217])).
% 0.12/0.40  fof(f220,plain,(
% 0.12/0.40    ![X0,X1]: (~ssList(X0)|~ssList(X1)|neq(X0,X1)|X0=X1)),
% 0.12/0.40    inference(cnf_transformation,[status(thm)],[f218])).
% 0.12/0.40  fof(f223,plain,(
% 0.12/0.40    ssList(nil)),
% 0.12/0.40    inference(cnf_transformation,[status(thm)],[f17])).
% 0.12/0.40  fof(f285,plain,(
% 0.12/0.40    ![U]: (~ssList(U)|frontsegP(U,U))),
% 0.12/0.40    inference(pre_NNF_transformation,[status(thm)],[f42])).
% 0.12/0.40  fof(f286,plain,(
% 0.12/0.40    ![X0]: (~ssList(X0)|frontsegP(X0,X0))),
% 0.12/0.40    inference(cnf_transformation,[status(thm)],[f285])).
% 0.12/0.40  fof(f415,plain,(
% 0.12/0.40    (?[U]: (ssList(U)&(?[V]: (ssList(V)&(?[W]: (ssList(W)&(?[X]: (ssList(X)&((((V=X&U=W)&X=W)&(![Y]: (((~ssList(Y)|~neq(Y,nil))|~frontsegP(V,Y))|~frontsegP(U,Y))))&(~nil=V|~nil=U))))))))))),
% 0.12/0.40    inference(pre_NNF_transformation,[status(thm)],[f97])).
% 0.12/0.40  fof(f416,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)&sK50_skl=sK49_skl)&(![Y]: (((~ssList(Y)|~neq(Y,nil))|~frontsegP(sK48_skl,Y))|~frontsegP(sK47_skl,Y))))&(~nil=sK48_skl|~nil=sK47_skl))))))),
% 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)],[f415])).
% 0.12/0.40  fof(f417,plain,(
% 0.12/0.40    ssList(sK47_skl)),
% 0.12/0.40    inference(cnf_transformation,[status(thm)],[f416])).
% 0.12/0.40  fof(f421,plain,(
% 0.12/0.40    sK48_skl=sK50_skl),
% 0.12/0.40    inference(cnf_transformation,[status(thm)],[f416])).
% 0.12/0.40  fof(f422,plain,(
% 0.12/0.40    sK47_skl=sK49_skl),
% 0.12/0.40    inference(cnf_transformation,[status(thm)],[f416])).
% 0.12/0.40  fof(f423,plain,(
% 0.12/0.40    sK50_skl=sK49_skl),
% 0.12/0.40    inference(cnf_transformation,[status(thm)],[f416])).
% 0.12/0.40  fof(f424,plain,(
% 0.12/0.40    ![X0]: (~ssList(X0)|~neq(X0,nil)|~frontsegP(sK48_skl,X0)|~frontsegP(sK47_skl,X0))),
% 0.12/0.40    inference(cnf_transformation,[status(thm)],[f416])).
% 0.12/0.40  fof(f425,plain,(
% 0.12/0.40    ~nil=sK48_skl|~nil=sK47_skl),
% 0.12/0.40    inference(cnf_transformation,[status(thm)],[f416])).
% 0.12/0.40  fof(f462,plain,(
% 0.12/0.40    sK48_skl=sK49_skl),
% 0.12/0.40    inference(forward_demodulation,[status(thm)],[f421,f423])).
% 0.12/0.40  fof(f465,plain,(
% 0.12/0.40    sK48_skl=sK47_skl),
% 0.12/0.40    inference(forward_demodulation,[status(thm)],[f422,f462])).
% 0.12/0.40  fof(f480,plain,(
% 0.12/0.40    ~nil=sK47_skl|~nil=sK47_skl),
% 0.12/0.40    inference(forward_demodulation,[status(thm)],[f465,f425])).
% 0.12/0.40  fof(f481,plain,(
% 0.12/0.40    ~nil=sK47_skl),
% 0.12/0.40    inference(duplicate_literals_removal,[status(thm)],[f480])).
% 0.12/0.40  fof(f482,plain,(
% 0.12/0.40    ![X0]: (~ssList(X0)|~neq(X0,nil)|~frontsegP(sK47_skl,X0)|~frontsegP(sK47_skl,X0))),
% 0.12/0.40    inference(forward_demodulation,[status(thm)],[f465,f424])).
% 0.12/0.40  fof(f483,plain,(
% 0.12/0.40    ![X0]: (~ssList(X0)|~neq(X0,nil)|~frontsegP(sK47_skl,X0))),
% 0.12/0.40    inference(duplicate_literals_removal,[status(thm)],[f482])).
% 0.12/0.40  fof(f484,plain,(
% 0.12/0.40    ![X0]: (~ssList(X0)|~frontsegP(sK47_skl,X0)|~ssList(X0)|~ssList(nil)|X0=nil)),
% 0.12/0.40    inference(resolution,[status(thm)],[f483,f220])).
% 0.12/0.40  fof(f485,plain,(
% 0.12/0.40    ![X0]: (~ssList(X0)|~frontsegP(sK47_skl,X0)|~ssList(nil)|X0=nil)),
% 0.12/0.40    inference(duplicate_literals_removal,[status(thm)],[f484])).
% 0.12/0.40  fof(f486,plain,(
% 0.12/0.40    ![X0]: (~ssList(X0)|~frontsegP(sK47_skl,X0)|X0=nil)),
% 0.12/0.40    inference(forward_subsumption_resolution,[status(thm)],[f485,f223])).
% 0.12/0.40  fof(f487,plain,(
% 0.12/0.40    ~ssList(sK47_skl)|sK47_skl=nil|~ssList(sK47_skl)),
% 0.12/0.40    inference(resolution,[status(thm)],[f486,f286])).
% 0.12/0.40  fof(f489,plain,(
% 0.12/0.40    ~ssList(sK47_skl)|sK47_skl=nil),
% 0.12/0.40    inference(duplicate_literals_removal,[status(thm)],[f487])).
% 0.12/0.40  fof(f490,plain,(
% 0.12/0.40    sK47_skl=nil),
% 0.12/0.40    inference(forward_subsumption_resolution,[status(thm)],[f489,f417])).
% 0.12/0.40  fof(f493,plain,(
% 0.12/0.40    $false),
% 0.12/0.40    inference(forward_subsumption_resolution,[status(thm)],[f490,f481])).
% 0.12/0.40  % SZS output end CNFRefutation for theBenchmark.p
% 0.12/0.43  % Elapsed time: 0.067884 seconds
% 0.12/0.43  % CPU time: 0.182829 seconds
% 0.12/0.43  % Total memory used: 110.472 MB
% 0.12/0.43  % Net memory used: 110.326 MB
%------------------------------------------------------------------------------