↑ 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  : SWV175+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 : n007.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:11 PM UTC 2026

% Result   : Theorem 1.23s 0.63s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV175+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 : n007.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:31:35 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.14/0.39  % Drodi V4.1.1
% 1.23/0.63  % Refutation found
% 1.23/0.63  % SZS status Theorem for theBenchmark: Theorem is valid
% 1.23/0.63  % SZS output start CNFRefutation for theBenchmark
% 1.23/0.63  fof(f53,conjecture,(
% 1.23/0.63    ( ( leq(n0,pv28)& leq(n0,pv30)& leq(pv28,n4)& leq(pv30,n135299)& (! [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,pred(pv28)) )=> 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 ) )) )=> a_select3(q_init,pv30,pv28) = init ) ),
% 1.23/0.63    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 1.23/0.63  fof(f54,negated_conjecture,(
% 1.23/0.63    ~(( ( leq(n0,pv28)& leq(n0,pv30)& leq(pv28,n4)& leq(pv30,n135299)& (! [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,pred(pv28)) )=> 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 ) )) )=> a_select3(q_init,pv30,pv28) = init ) )),
% 1.23/0.63    inference(negated_conjecture,[status(cth)],[f53])).
% 1.23/0.63  fof(f251,plain,(
% 1.23/0.63    ((((((((((leq(n0,pv28)&leq(n0,pv30))&leq(pv28,n4))&leq(pv30,n135299))&(![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,pred(pv28)))|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))))&~a_select3(q_init,pv30,pv28)=init)),
% 1.23/0.63    inference(pre_NNF_transformation,[status(thm)],[f54])).
% 1.23/0.63  fof(f252,plain,(
% 1.23/0.63    leq(n0,pv28)),
% 1.23/0.63    inference(cnf_transformation,[status(thm)],[f251])).
% 1.23/0.63  fof(f253,plain,(
% 1.23/0.63    leq(n0,pv30)),
% 1.23/0.63    inference(cnf_transformation,[status(thm)],[f251])).
% 1.23/0.63  fof(f254,plain,(
% 1.23/0.63    leq(pv28,n4)),
% 1.23/0.63    inference(cnf_transformation,[status(thm)],[f251])).
% 1.23/0.63  fof(f255,plain,(
% 1.23/0.63    leq(pv30,n135299)),
% 1.23/0.63    inference(cnf_transformation,[status(thm)],[f251])).
% 1.23/0.63  fof(f256,plain,(
% 1.23/0.63    ![X0,X1]: (~leq(n0,X0)|~leq(X0,n135299)|~leq(n0,X1)|~leq(X1,n4)|a_select3(q_init,X0,X1)=init)),
% 1.23/0.63    inference(cnf_transformation,[status(thm)],[f251])).
% 1.23/0.63  fof(f262,plain,(
% 1.23/0.63    ~a_select3(q_init,pv30,pv28)=init),
% 1.23/0.63    inference(cnf_transformation,[status(thm)],[f251])).
% 1.23/0.63  fof(f362,plain,(
% 1.23/0.63    ![X0]: (~leq(n0,pv30)|~leq(n0,X0)|~leq(X0,n4)|a_select3(q_init,pv30,X0)=init)),
% 1.23/0.63    inference(resolution,[status(thm)],[f256,f255])).
% 1.23/0.63  fof(f366,plain,(
% 1.23/0.63    ![X0]: (~leq(n0,X0)|~leq(X0,n4)|a_select3(q_init,pv30,X0)=init)),
% 1.23/0.63    inference(forward_subsumption_resolution,[status(thm)],[f362,f253])).
% 1.23/0.63  fof(f624,plain,(
% 1.23/0.63    ~leq(n0,pv28)|a_select3(q_init,pv30,pv28)=init),
% 1.23/0.63    inference(resolution,[status(thm)],[f366,f254])).
% 1.23/0.63  fof(f633,plain,(
% 1.23/0.63    a_select3(q_init,pv30,pv28)=init),
% 1.23/0.63    inference(forward_subsumption_resolution,[status(thm)],[f624,f252])).
% 1.23/0.63  fof(f798,plain,(
% 1.23/0.63    $false),
% 1.23/0.63    inference(forward_subsumption_resolution,[status(thm)],[f633,f262])).
% 1.23/0.63  % SZS output end CNFRefutation for theBenchmark.p
% 1.23/0.66  % Elapsed time: 0.283110 seconds
% 1.23/0.66  % CPU time: 1.870635 seconds
% 1.23/0.66  % Total memory used: 129.697 MB
% 1.23/0.66  % Net memory used: 125.836 MB
%------------------------------------------------------------------------------