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

% Computer : n017.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:50:12 PM UTC 2026

% Result   : Theorem 0.14s 0.45s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV188+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04  % Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.36  % Computer : n017.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Mon Sep 21 08:29:41 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.38  % Drodi V4.1.1
% 0.14/0.45  % Refutation found
% 0.14/0.45  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.14/0.45  % SZS output start CNFRefutation for theBenchmark
% 0.14/0.45  fof(f3,axiom,(
% 0.14/0.45    (! [X] : ~ gt(X,X) )),
% 0.14/0.45    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.14/0.45  fof(f5,axiom,(
% 0.14/0.45    (! [X,Y,Z] :( ( leq(X,Y)& leq(Y,Z) )=> leq(X,Z) ) )),
% 0.14/0.45    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.14/0.45  fof(f13,axiom,(
% 0.14/0.45    (! [X,Y] :( leq(X,Y)<=> gt(succ(Y),X) ) )),
% 0.14/0.45    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.14/0.45  fof(f28,axiom,(
% 0.14/0.45    succ(tptp_minus_1) = n0 ),
% 0.14/0.45    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.14/0.45  fof(f53,conjecture,(
% 0.14/0.45    ( ( (! [A] :( ( leq(n0,A)& leq(A,n135299) )=> (! [B] :( ( leq(n0,B)& leq(B,n4) )=> a_select3(q_init,A,B) = init ) )))& (! [C] :( ( leq(n0,C)& leq(C,n4) )=> a_select2(rho_init,C) = init ))& (! [D] :( ( leq(n0,D)& leq(D,n4) )=> a_select3(center_init,D,n0) = init ))& ( gt(loopcounter,n1)=> (! [E] :( ( leq(n0,E)& leq(E,n4) )=> a_select2(muold_init,E) = init ) ))& ( gt(loopcounter,n1)=> (! [F] :( ( leq(n0,F)& leq(F,n4) )=> a_select2(rhoold_init,F) = init ) ))& ( gt(loopcounter,n1)=> (! [G] :( ( leq(n0,G)& leq(G,n4) )=> a_select2(sigmaold_init,G) = init ) )) )=> (! [H] :( ( leq(n0,H)& leq(H,tptp_minus_1) )=> a_select2(mu_init,H) = init ) )) ),
% 0.14/0.45    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.14/0.45  fof(f54,negated_conjecture,(
% 0.14/0.45    ~(( ( (! [A] :( ( leq(n0,A)& leq(A,n135299) )=> (! [B] :( ( leq(n0,B)& leq(B,n4) )=> a_select3(q_init,A,B) = init ) )))& (! [C] :( ( leq(n0,C)& leq(C,n4) )=> a_select2(rho_init,C) = init ))& (! [D] :( ( leq(n0,D)& leq(D,n4) )=> a_select3(center_init,D,n0) = init ))& ( gt(loopcounter,n1)=> (! [E] :( ( leq(n0,E)& leq(E,n4) )=> a_select2(muold_init,E) = init ) ))& ( gt(loopcounter,n1)=> (! [F] :( ( leq(n0,F)& leq(F,n4) )=> a_select2(rhoold_init,F) = init ) ))& ( gt(loopcounter,n1)=> (! [G] :( ( leq(n0,G)& leq(G,n4) )=> a_select2(sigmaold_init,G) = init ) )) )=> (! [H] :( ( leq(n0,H)& leq(H,tptp_minus_1) )=> a_select2(mu_init,H) = init ) )) )),
% 0.14/0.45    inference(negated_conjecture,[status(cth)],[f53])).
% 0.14/0.45  fof(f98,plain,(
% 0.14/0.45    ![X0]: (~gt(X0,X0))),
% 0.14/0.45    inference(cnf_transformation,[status(thm)],[f3])).
% 0.14/0.45  fof(f100,plain,(
% 0.14/0.45    ![X,Y,Z]: ((~leq(X,Y)|~leq(Y,Z))|leq(X,Z))),
% 0.14/0.45    inference(pre_NNF_transformation,[status(thm)],[f5])).
% 0.14/0.45  fof(f101,plain,(
% 0.14/0.45    ![X,Z]: ((![Y]: (~leq(X,Y)|~leq(Y,Z)))|leq(X,Z))),
% 0.14/0.45    inference(miniscoping,[status(thm)],[f100])).
% 0.14/0.45  fof(f102,plain,(
% 0.14/0.45    ![X0,X1,X2]: (~leq(X0,X1)|~leq(X1,X2)|leq(X0,X2))),
% 0.14/0.45    inference(cnf_transformation,[status(thm)],[f101])).
% 0.14/0.45  fof(f122,plain,(
% 0.14/0.45    ![X,Y]: ((~leq(X,Y)|gt(succ(Y),X))&(leq(X,Y)|~gt(succ(Y),X)))),
% 0.14/0.45    inference(NNF_transformation,[status(thm)],[f13])).
% 0.14/0.45  fof(f123,plain,(
% 0.14/0.45    (![X,Y]: (~leq(X,Y)|gt(succ(Y),X)))&(![X,Y]: (leq(X,Y)|~gt(succ(Y),X)))),
% 0.14/0.45    inference(miniscoping,[status(thm)],[f122])).
% 0.14/0.45  fof(f124,plain,(
% 0.14/0.45    ![X0,X1]: (~leq(X0,X1)|gt(succ(X1),X0))),
% 0.14/0.45    inference(cnf_transformation,[status(thm)],[f123])).
% 0.14/0.45  fof(f206,plain,(
% 0.14/0.45    succ(tptp_minus_1)=n0),
% 0.14/0.45    inference(cnf_transformation,[status(thm)],[f28])).
% 0.14/0.45  fof(f251,plain,(
% 0.14/0.45    (((((((![A]: ((~leq(n0,A)|~leq(A,n135299))|(![B]: ((~leq(n0,B)|~leq(B,n4))|a_select3(q_init,A,B)=init))))&(![C]: ((~leq(n0,C)|~leq(C,n4))|a_select2(rho_init,C)=init)))&(![D]: ((~leq(n0,D)|~leq(D,n4))|a_select3(center_init,D,n0)=init)))&(~gt(loopcounter,n1)|(![E]: ((~leq(n0,E)|~leq(E,n4))|a_select2(muold_init,E)=init))))&(~gt(loopcounter,n1)|(![F]: ((~leq(n0,F)|~leq(F,n4))|a_select2(rhoold_init,F)=init))))&(~gt(loopcounter,n1)|(![G]: ((~leq(n0,G)|~leq(G,n4))|a_select2(sigmaold_init,G)=init))))&(?[H]: ((leq(n0,H)&leq(H,tptp_minus_1))&~a_select2(mu_init,H)=init)))),
% 0.14/0.45    inference(pre_NNF_transformation,[status(thm)],[f54])).
% 0.14/0.45  fof(f252,plain,(
% 0.14/0.45    ((((((![A]: ((~leq(n0,A)|~leq(A,n135299))|(![B]: ((~leq(n0,B)|~leq(B,n4))|a_select3(q_init,A,B)=init))))&(![C]: ((~leq(n0,C)|~leq(C,n4))|a_select2(rho_init,C)=init)))&(![D]: ((~leq(n0,D)|~leq(D,n4))|a_select3(center_init,D,n0)=init)))&(~gt(loopcounter,n1)|(![E]: ((~leq(n0,E)|~leq(E,n4))|a_select2(muold_init,E)=init))))&(~gt(loopcounter,n1)|(![F]: ((~leq(n0,F)|~leq(F,n4))|a_select2(rhoold_init,F)=init))))&(~gt(loopcounter,n1)|(![G]: ((~leq(n0,G)|~leq(G,n4))|a_select2(sigmaold_init,G)=init))))&((leq(n0,sK23_skl)&leq(sK23_skl,tptp_minus_1))&~a_select2(mu_init,sK23_skl)=init)),
% 0.14/0.46    inference(skolemize,[status(esa),new_symbols(skolem,[sK23_skl]),skolemize(H,sK23_skl)],[f251])).
% 0.14/0.46  fof(f259,plain,(
% 0.14/0.46    leq(n0,sK23_skl)),
% 0.14/0.46    inference(cnf_transformation,[status(thm)],[f252])).
% 0.14/0.46  fof(f260,plain,(
% 0.14/0.46    leq(sK23_skl,tptp_minus_1)),
% 0.14/0.46    inference(cnf_transformation,[status(thm)],[f252])).
% 0.14/0.46  fof(f399,plain,(
% 0.14/0.46    ![X0]: (~leq(sK23_skl,X0)|leq(n0,X0))),
% 0.14/0.46    inference(resolution,[status(thm)],[f102,f259])).
% 0.14/0.46  fof(f423,plain,(
% 0.14/0.46    leq(n0,tptp_minus_1)),
% 0.14/0.46    inference(resolution,[status(thm)],[f399,f260])).
% 0.14/0.46  fof(f558,plain,(
% 0.14/0.46    gt(succ(tptp_minus_1),n0)),
% 0.14/0.46    inference(resolution,[status(thm)],[f124,f423])).
% 0.14/0.46  fof(f562,plain,(
% 0.14/0.46    gt(n0,n0)),
% 0.14/0.46    inference(forward_demodulation,[status(thm)],[f206,f558])).
% 0.14/0.46  fof(f563,plain,(
% 0.14/0.46    $false),
% 0.14/0.46    inference(forward_subsumption_resolution,[status(thm)],[f562,f98])).
% 0.14/0.46  % SZS output end CNFRefutation for theBenchmark.p
% 0.14/0.48  % Elapsed time: 0.105631 seconds
% 0.14/0.48  % CPU time: 0.565468 seconds
% 0.14/0.48  % Total memory used: 114.861 MB
% 0.14/0.48  % Net memory used: 113.601 MB
%------------------------------------------------------------------------------