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

% Computer : n012.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:10 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : SWV166+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.02  % Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.03/0.29  % Computer : n012.cluster.edu
% 0.03/0.29  % Model    : x86_64 x86_64
% 0.03/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.29  % Memory   : 8046.5625MB
% 0.03/0.29  % OS       : Linux 6.8.0-71-generic
% 0.03/0.29  % CPULimit : 300
% 0.03/0.29  % WCLimit  : 300
% 0.03/0.29  % DateTime : Mon Sep 21 08:33:21 UTC 2026
% 0.03/0.29  % CPUTime  : 
% 0.03/0.30  % Drodi V4.1.1
% 0.25/0.39  % Refutation found
% 0.25/0.39  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.25/0.39  % SZS output start CNFRefutation for theBenchmark
% 0.25/0.39  fof(f53,conjecture,(
% 0.25/0.39    ( ( n0 != pv90& leq(n0,pv40)& leq(pv40,n4)& gt(loopcounter,n1)& (! [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,pred(pv40)) )=> a_select2(mu_init,D) = init ))& (! [E] :( ( leq(n0,E)& leq(E,pred(pv40)) )=> a_select2(sigma_init,E) = init ))& (! [F] :( ( leq(n0,F)& leq(F,n4) )=> a_select3(center_init,F,n0) = init ))& ( gt(loopcounter,n1)=> (! [G] :( ( leq(n0,G)& leq(G,n4) )=> a_select2(muold_init,G) = init ) ))& ( gt(loopcounter,n1)=> (! [H] :( ( leq(n0,H)& leq(H,n4) )=> a_select2(rhoold_init,H) = init ) ))& ( gt(loopcounter,n1)=> (! [I] :( ( leq(n0,I)& leq(I,n4) )=> a_select2(sigmaold_init,I) = init ) )) )=> (! [J] :( ( leq(n0,J)& leq(J,n4) )=> a_select2(rhoold_init,J) = init ) )) ),
% 0.25/0.39    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.25/0.39  fof(f54,negated_conjecture,(
% 0.25/0.39    ~(( ( n0 != pv90& leq(n0,pv40)& leq(pv40,n4)& gt(loopcounter,n1)& (! [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,pred(pv40)) )=> a_select2(mu_init,D) = init ))& (! [E] :( ( leq(n0,E)& leq(E,pred(pv40)) )=> a_select2(sigma_init,E) = init ))& (! [F] :( ( leq(n0,F)& leq(F,n4) )=> a_select3(center_init,F,n0) = init ))& ( gt(loopcounter,n1)=> (! [G] :( ( leq(n0,G)& leq(G,n4) )=> a_select2(muold_init,G) = init ) ))& ( gt(loopcounter,n1)=> (! [H] :( ( leq(n0,H)& leq(H,n4) )=> a_select2(rhoold_init,H) = init ) ))& ( gt(loopcounter,n1)=> (! [I] :( ( leq(n0,I)& leq(I,n4) )=> a_select2(sigmaold_init,I) = init ) )) )=> (! [J] :( ( leq(n0,J)& leq(J,n4) )=> a_select2(rhoold_init,J) = init ) )) )),
% 0.25/0.39    inference(negated_conjecture,[status(cth)],[f53])).
% 0.25/0.39  fof(f251,plain,(
% 0.25/0.39    ((((((((((((~n0=pv90&leq(n0,pv40))&leq(pv40,n4))&gt(loopcounter,n1))&(![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,pred(pv40)))|a_select2(mu_init,D)=init)))&(![E]: ((~leq(n0,E)|~leq(E,pred(pv40)))|a_select2(sigma_init,E)=init)))&(![F]: ((~leq(n0,F)|~leq(F,n4))|a_select3(center_init,F,n0)=init)))&(~gt(loopcounter,n1)|(![G]: ((~leq(n0,G)|~leq(G,n4))|a_select2(muold_init,G)=init))))&(~gt(loopcounter,n1)|(![H]: ((~leq(n0,H)|~leq(H,n4))|a_select2(rhoold_init,H)=init))))&(~gt(loopcounter,n1)|(![I]: ((~leq(n0,I)|~leq(I,n4))|a_select2(sigmaold_init,I)=init))))&(?[J]: ((leq(n0,J)&leq(J,n4))&~a_select2(rhoold_init,J)=init)))),
% 0.25/0.39    inference(pre_NNF_transformation,[status(thm)],[f54])).
% 0.25/0.39  fof(f252,plain,(
% 0.25/0.39    (((((((((((~n0=pv90&leq(n0,pv40))&leq(pv40,n4))&gt(loopcounter,n1))&(![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,pred(pv40)))|a_select2(mu_init,D)=init)))&(![E]: ((~leq(n0,E)|~leq(E,pred(pv40)))|a_select2(sigma_init,E)=init)))&(![F]: ((~leq(n0,F)|~leq(F,n4))|a_select3(center_init,F,n0)=init)))&(~gt(loopcounter,n1)|(![G]: ((~leq(n0,G)|~leq(G,n4))|a_select2(muold_init,G)=init))))&(~gt(loopcounter,n1)|(![H]: ((~leq(n0,H)|~leq(H,n4))|a_select2(rhoold_init,H)=init))))&(~gt(loopcounter,n1)|(![I]: ((~leq(n0,I)|~leq(I,n4))|a_select2(sigmaold_init,I)=init))))&((leq(n0,sK23_skl)&leq(sK23_skl,n4))&~a_select2(rhoold_init,sK23_skl)=init)),
% 0.25/0.39    inference(skolemize,[status(esa),new_symbols(skolem,[sK23_skl]),skolemize(J,sK23_skl)],[f251])).
% 0.25/0.39  fof(f256,plain,(
% 0.25/0.39    gt(loopcounter,n1)),
% 0.25/0.39    inference(cnf_transformation,[status(thm)],[f252])).
% 0.25/0.39  fof(f263,plain,(
% 0.25/0.39    ![X0]: (~gt(loopcounter,n1)|~leq(n0,X0)|~leq(X0,n4)|a_select2(rhoold_init,X0)=init)),
% 0.25/0.39    inference(cnf_transformation,[status(thm)],[f252])).
% 0.25/0.39  fof(f265,plain,(
% 0.25/0.39    leq(n0,sK23_skl)),
% 0.25/0.39    inference(cnf_transformation,[status(thm)],[f252])).
% 0.25/0.39  fof(f266,plain,(
% 0.25/0.39    leq(sK23_skl,n4)),
% 0.25/0.39    inference(cnf_transformation,[status(thm)],[f252])).
% 0.25/0.39  fof(f267,plain,(
% 0.25/0.39    ~a_select2(rhoold_init,sK23_skl)=init),
% 0.25/0.39    inference(cnf_transformation,[status(thm)],[f252])).
% 0.25/0.39  fof(f349,definition,(
% 0.25/0.39    sQ0_spl <=> (gt(loopcounter,n1))),
% 0.25/0.39    introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition])).
% 0.25/0.39  fof(f351,plain,(
% 0.25/0.39    ~gt(loopcounter,n1)|sQ0_spl),
% 0.25/0.39    inference(component_clause,[status(thm)],[f349])).
% 0.25/0.39  fof(f356,definition,(
% 0.25/0.39    ![X0]: (sQ2_spl <=> (~leq(n0,X0)|~leq(X0,n4)|a_select2(rhoold_init,X0)=init))),
% 0.25/0.39    introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition])).
% 0.25/0.39  fof(f357,plain,(
% 0.25/0.39    ![X0]: (~leq(n0,X0)|~leq(X0,n4)|a_select2(rhoold_init,X0)=init|~sQ2_spl)),
% 0.25/0.39    inference(component_clause,[status(thm)],[f356])).
% 0.25/0.39  fof(f359,plain,(
% 0.25/0.39    ~sQ0_spl|sQ2_spl),
% 0.25/0.39    inference(split_clause,[status(thm)],[f263,f349,f356])).
% 0.25/0.39  fof(f387,plain,(
% 0.25/0.39    $false|sQ0_spl),
% 0.25/0.39    inference(forward_subsumption_resolution,[status(thm)],[f351,f256])).
% 0.25/0.39  fof(f388,plain,(
% 0.25/0.39    sQ0_spl),
% 0.25/0.39    inference(contradiction_clause,[status(thm)],[f387])).
% 0.25/0.39  fof(f962,plain,(
% 0.25/0.39    ~leq(sK23_skl,n4)|a_select2(rhoold_init,sK23_skl)=init|~sQ2_spl),
% 0.25/0.39    inference(resolution,[status(thm)],[f265,f357])).
% 0.25/0.39  fof(f976,definition,(
% 0.25/0.39    sQ38_spl <=> (leq(sK23_skl,n4))),
% 0.25/0.39    introduced(definition,[new_symbols(definition,[sQ38_spl])],[split_symbol_definition])).
% 0.25/0.39  fof(f978,plain,(
% 0.25/0.39    ~leq(sK23_skl,n4)|sQ38_spl),
% 0.25/0.39    inference(component_clause,[status(thm)],[f976])).
% 0.25/0.39  fof(f987,definition,(
% 0.25/0.39    sQ41_spl <=> (a_select2(rhoold_init,sK23_skl)=init)),
% 0.25/0.39    introduced(definition,[new_symbols(definition,[sQ41_spl])],[split_symbol_definition])).
% 0.25/0.39  fof(f988,plain,(
% 0.25/0.39    a_select2(rhoold_init,sK23_skl)=init|~sQ41_spl),
% 0.25/0.39    inference(component_clause,[status(thm)],[f987])).
% 0.25/0.39  fof(f990,plain,(
% 0.25/0.39    ~sQ38_spl|sQ41_spl|~sQ2_spl),
% 0.25/0.39    inference(split_clause,[status(thm)],[f962,f976,f987,f356])).
% 0.25/0.39  fof(f996,plain,(
% 0.25/0.39    $false|sQ38_spl),
% 0.25/0.39    inference(forward_subsumption_resolution,[status(thm)],[f978,f266])).
% 0.25/0.39  fof(f997,plain,(
% 0.25/0.39    sQ38_spl),
% 0.25/0.39    inference(contradiction_clause,[status(thm)],[f996])).
% 0.25/0.39  fof(f998,plain,(
% 0.25/0.39    $false|~sQ41_spl),
% 0.25/0.39    inference(forward_subsumption_resolution,[status(thm)],[f988,f267])).
% 0.25/0.39  fof(f999,plain,(
% 0.25/0.39    ~sQ41_spl),
% 0.25/0.39    inference(contradiction_clause,[status(thm)],[f998])).
% 0.25/0.39  fof(f1000,plain,(
% 0.25/0.39    $false),
% 0.25/0.39    inference(sat_refutation,[status(thm)],[f359,f388,f990,f997,f999])).
% 0.25/0.39  % SZS output end CNFRefutation for theBenchmark.p
% 0.25/0.41  % Elapsed time: 0.100468 seconds
% 0.25/0.41  % CPU time: 0.659124 seconds
% 0.25/0.41  % Total memory used: 122.405 MB
% 0.25/0.41  % Net memory used: 119.924 MB
%------------------------------------------------------------------------------