TSTP Solution File: SWV173+1 by Drodi---3.6.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Drodi---3.6.0
% Problem  : SWV173+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s

% Computer : n020.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Apr 30 20:46:09 EDT 2024

% Result   : Theorem 0.16s 0.35s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : SWV173+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.03/0.12  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.11/0.32  % Computer : n020.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 300
% 0.11/0.32  % DateTime : Tue Apr 30 00:46:47 EDT 2024
% 0.11/0.33  % CPUTime  : 
% 0.11/0.34  % Drodi V3.6.0
% 0.16/0.35  % Refutation found
% 0.16/0.35  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.16/0.35  % SZS output start CNFRefutation for theBenchmark
% 0.16/0.35  fof(f53,conjecture,(
% 0.16/0.35    ( ( leq(n0,pv10)& leq(pv10,n135299)& 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,n4) )=> a_select2(mu_init,D) = init ))& (! [E] :( ( leq(n0,E)& leq(E,n4) )=> 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.16/0.35    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.16/0.35  fof(f54,negated_conjecture,(
% 0.16/0.35    ~(( ( leq(n0,pv10)& leq(pv10,n135299)& 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,n4) )=> a_select2(mu_init,D) = init ))& (! [E] :( ( leq(n0,E)& leq(E,n4) )=> 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.16/0.35    inference(negated_conjecture,[status(cth)],[f53])).
% 0.16/0.35  fof(f251,plain,(
% 0.16/0.35    (((((((((((leq(n0,pv10)&leq(pv10,n135299))>(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,n4))|a_select2(mu_init,D)=init)))&(![E]: ((~leq(n0,E)|~leq(E,n4))|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.16/0.35    inference(pre_NNF_transformation,[status(esa)],[f54])).
% 0.16/0.35  fof(f252,plain,(
% 0.16/0.35    ((((((((((leq(n0,pv10)&leq(pv10,n135299))>(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,n4))|a_select2(mu_init,D)=init)))&(![E]: ((~leq(n0,E)|~leq(E,n4))|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,sk0_23)&leq(sk0_23,n4))&~a_select2(rhoold_init,sk0_23)=init)),
% 0.16/0.35    inference(skolemization,[status(esa)],[f251])).
% 0.16/0.35  fof(f255,plain,(
% 0.16/0.35    gt(loopcounter,n1)),
% 0.16/0.35    inference(cnf_transformation,[status(esa)],[f252])).
% 0.16/0.35  fof(f262,plain,(
% 0.16/0.35    ![X0]: (~gt(loopcounter,n1)|~leq(n0,X0)|~leq(X0,n4)|a_select2(rhoold_init,X0)=init)),
% 0.16/0.35    inference(cnf_transformation,[status(esa)],[f252])).
% 0.16/0.35  fof(f264,plain,(
% 0.16/0.35    leq(n0,sk0_23)),
% 0.16/0.35    inference(cnf_transformation,[status(esa)],[f252])).
% 0.16/0.35  fof(f265,plain,(
% 0.16/0.35    leq(sk0_23,n4)),
% 0.16/0.35    inference(cnf_transformation,[status(esa)],[f252])).
% 0.16/0.35  fof(f266,plain,(
% 0.16/0.35    ~a_select2(rhoold_init,sk0_23)=init),
% 0.16/0.35    inference(cnf_transformation,[status(esa)],[f252])).
% 0.16/0.35  fof(f339,plain,(
% 0.16/0.35    spl0_0 <=> gt(loopcounter,n1)),
% 0.16/0.35    introduced(split_symbol_definition)).
% 0.16/0.35  fof(f341,plain,(
% 0.16/0.35    ~gt(loopcounter,n1)|spl0_0),
% 0.16/0.35    inference(component_clause,[status(thm)],[f339])).
% 0.16/0.35  fof(f346,plain,(
% 0.16/0.35    spl0_2 <=> ~leq(n0,X0)|~leq(X0,n4)|a_select2(rhoold_init,X0)=init),
% 0.16/0.35    introduced(split_symbol_definition)).
% 0.16/0.35  fof(f347,plain,(
% 0.16/0.35    ![X0]: (~leq(n0,X0)|~leq(X0,n4)|a_select2(rhoold_init,X0)=init|~spl0_2)),
% 0.16/0.35    inference(component_clause,[status(thm)],[f346])).
% 0.16/0.35  fof(f349,plain,(
% 0.16/0.35    ~spl0_0|spl0_2),
% 0.16/0.35    inference(split_clause,[status(thm)],[f262,f339,f346])).
% 0.16/0.35  fof(f403,plain,(
% 0.16/0.35    $false|spl0_0),
% 0.16/0.35    inference(forward_subsumption_resolution,[status(thm)],[f341,f255])).
% 0.16/0.35  fof(f404,plain,(
% 0.16/0.35    spl0_0),
% 0.16/0.35    inference(contradiction_clause,[status(thm)],[f403])).
% 0.16/0.35  fof(f406,plain,(
% 0.16/0.35    spl0_4 <=> leq(n0,sk0_23)),
% 0.16/0.35    introduced(split_symbol_definition)).
% 0.16/0.35  fof(f408,plain,(
% 0.16/0.35    ~leq(n0,sk0_23)|spl0_4),
% 0.16/0.35    inference(component_clause,[status(thm)],[f406])).
% 0.16/0.35  fof(f409,plain,(
% 0.16/0.35    spl0_5 <=> leq(sk0_23,n4)),
% 0.16/0.35    introduced(split_symbol_definition)).
% 0.16/0.35  fof(f411,plain,(
% 0.16/0.35    ~leq(sk0_23,n4)|spl0_5),
% 0.16/0.35    inference(component_clause,[status(thm)],[f409])).
% 0.16/0.35  fof(f412,plain,(
% 0.16/0.35    ~leq(n0,sk0_23)|~leq(sk0_23,n4)|~spl0_2),
% 0.16/0.35    inference(resolution,[status(thm)],[f266,f347])).
% 0.16/0.35  fof(f413,plain,(
% 0.16/0.35    ~spl0_4|~spl0_5|~spl0_2),
% 0.16/0.35    inference(split_clause,[status(thm)],[f412,f406,f409,f346])).
% 0.16/0.35  fof(f414,plain,(
% 0.16/0.35    $false|spl0_4),
% 0.16/0.35    inference(forward_subsumption_resolution,[status(thm)],[f408,f264])).
% 0.16/0.35  fof(f415,plain,(
% 0.16/0.35    spl0_4),
% 0.16/0.35    inference(contradiction_clause,[status(thm)],[f414])).
% 0.16/0.35  fof(f416,plain,(
% 0.16/0.35    $false|spl0_5),
% 0.16/0.35    inference(forward_subsumption_resolution,[status(thm)],[f411,f265])).
% 0.16/0.35  fof(f417,plain,(
% 0.16/0.35    spl0_5),
% 0.16/0.35    inference(contradiction_clause,[status(thm)],[f416])).
% 0.16/0.35  fof(f418,plain,(
% 0.16/0.35    $false),
% 0.16/0.35    inference(sat_refutation,[status(thm)],[f349,f404,f413,f415,f417])).
% 0.16/0.35  % SZS output end CNFRefutation for theBenchmark.p
% 0.16/0.37  % Elapsed time: 0.025334 seconds
% 0.16/0.37  % CPU time: 0.033124 seconds
% 0.16/0.37  % Total memory used: 14.409 MB
% 0.16/0.37  % Net memory used: 14.368 MB
%------------------------------------------------------------------------------