↑ 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  : SWV177+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 : n001.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 0.12s 0.49s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWV177+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04  % Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.35  % Computer : n001.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Mon Sep 21 08:39:29 UTC 2026
% 0.08/0.35  % CPUTime  : 
% 0.08/0.37  % Drodi V4.1.1
% 0.12/0.49  % Refutation found
% 0.12/0.49  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.12/0.49  % SZS output start CNFRefutation for theBenchmark
% 0.12/0.49  fof(f53,conjecture,(
% 0.12/0.49    ( ( leq(n0,pv40)& leq(n0,pv45)& leq(pv40,n4)& leq(pv45,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,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.12/0.49    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.12/0.49  fof(f54,negated_conjecture,(
% 0.12/0.49    ~(( ( leq(n0,pv40)& leq(n0,pv45)& leq(pv40,n4)& leq(pv45,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,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.12/0.49    inference(negated_conjecture,[status(cth)],[f53])).
% 0.12/0.49  fof(f251,plain,(
% 0.12/0.49    (((((((((((((leq(n0,pv40)&leq(n0,pv45))&leq(pv40,n4))&leq(pv45,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,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.12/0.49    inference(pre_NNF_transformation,[status(thm)],[f54])).
% 0.12/0.49  fof(f252,plain,(
% 0.12/0.49    ((((((((((((leq(n0,pv40)&leq(n0,pv45))&leq(pv40,n4))&leq(pv45,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,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.12/0.49    inference(skolemize,[status(esa),new_symbols(skolem,[sK23_skl]),skolemize(J,sK23_skl)],[f251])).
% 0.12/0.49  fof(f257,plain,(
% 0.12/0.49    gt(loopcounter,n1)),
% 0.12/0.49    inference(cnf_transformation,[status(thm)],[f252])).
% 0.12/0.49  fof(f264,plain,(
% 0.12/0.49    ![X0]: (~gt(loopcounter,n1)|~leq(n0,X0)|~leq(X0,n4)|a_select2(rhoold_init,X0)=init)),
% 0.12/0.49    inference(cnf_transformation,[status(thm)],[f252])).
% 0.12/0.50  fof(f266,plain,(
% 0.12/0.50    leq(n0,sK23_skl)),
% 0.12/0.50    inference(cnf_transformation,[status(thm)],[f252])).
% 0.12/0.50  fof(f267,plain,(
% 0.12/0.50    leq(sK23_skl,n4)),
% 0.12/0.50    inference(cnf_transformation,[status(thm)],[f252])).
% 0.12/0.50  fof(f268,plain,(
% 0.12/0.50    ~a_select2(rhoold_init,sK23_skl)=init),
% 0.12/0.50    inference(cnf_transformation,[status(thm)],[f252])).
% 0.12/0.50  fof(f350,definition,(
% 0.12/0.50    sQ0_spl <=> (gt(loopcounter,n1))),
% 0.12/0.50    introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition])).
% 0.12/0.50  fof(f352,plain,(
% 0.12/0.50    ~gt(loopcounter,n1)|sQ0_spl),
% 0.12/0.50    inference(component_clause,[status(thm)],[f350])).
% 0.12/0.50  fof(f357,definition,(
% 0.12/0.50    ![X0]: (sQ2_spl <=> (~leq(n0,X0)|~leq(X0,n4)|a_select2(rhoold_init,X0)=init))),
% 0.12/0.50    introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition])).
% 0.12/0.50  fof(f358,plain,(
% 0.12/0.50    ![X0]: (~leq(n0,X0)|~leq(X0,n4)|a_select2(rhoold_init,X0)=init|~sQ2_spl)),
% 0.12/0.50    inference(component_clause,[status(thm)],[f357])).
% 0.12/0.50  fof(f360,plain,(
% 0.12/0.50    ~sQ0_spl|sQ2_spl),
% 0.12/0.50    inference(split_clause,[status(thm)],[f264,f350,f357])).
% 0.12/0.50  fof(f472,plain,(
% 0.12/0.50    $false|sQ0_spl),
% 0.12/0.50    inference(forward_subsumption_resolution,[status(thm)],[f352,f257])).
% 0.12/0.50  fof(f473,plain,(
% 0.12/0.50    sQ0_spl),
% 0.12/0.50    inference(contradiction_clause,[status(thm)],[f472])).
% 0.12/0.50  fof(f1310,plain,(
% 0.12/0.50    ~leq(sK23_skl,n4)|a_select2(rhoold_init,sK23_skl)=init|~sQ2_spl),
% 0.12/0.50    inference(resolution,[status(thm)],[f266,f358])).
% 0.12/0.50  fof(f1343,definition,(
% 0.12/0.50    sQ82_spl <=> (leq(sK23_skl,n4))),
% 0.12/0.50    introduced(definition,[new_symbols(definition,[sQ82_spl])],[split_symbol_definition])).
% 0.12/0.50  fof(f1345,plain,(
% 0.12/0.50    ~leq(sK23_skl,n4)|sQ82_spl),
% 0.12/0.50    inference(component_clause,[status(thm)],[f1343])).
% 0.12/0.50  fof(f1350,definition,(
% 0.12/0.50    sQ84_spl <=> (a_select2(rhoold_init,sK23_skl)=init)),
% 0.12/0.50    introduced(definition,[new_symbols(definition,[sQ84_spl])],[split_symbol_definition])).
% 0.12/0.50  fof(f1351,plain,(
% 0.12/0.50    a_select2(rhoold_init,sK23_skl)=init|~sQ84_spl),
% 0.12/0.50    inference(component_clause,[status(thm)],[f1350])).
% 0.12/0.50  fof(f1353,plain,(
% 0.12/0.50    ~sQ82_spl|sQ84_spl|~sQ2_spl),
% 0.12/0.50    inference(split_clause,[status(thm)],[f1310,f1343,f1350,f357])).
% 0.12/0.50  fof(f1371,plain,(
% 0.12/0.50    $false|sQ82_spl),
% 0.12/0.50    inference(forward_subsumption_resolution,[status(thm)],[f1345,f267])).
% 0.12/0.50  fof(f1372,plain,(
% 0.12/0.50    sQ82_spl),
% 0.12/0.50    inference(contradiction_clause,[status(thm)],[f1371])).
% 0.12/0.50  fof(f1375,plain,(
% 0.12/0.50    $false|~sQ84_spl),
% 0.12/0.50    inference(forward_subsumption_resolution,[status(thm)],[f1351,f268])).
% 0.12/0.50  fof(f1376,plain,(
% 0.12/0.50    ~sQ84_spl),
% 0.12/0.50    inference(contradiction_clause,[status(thm)],[f1375])).
% 0.12/0.50  fof(f1377,plain,(
% 0.12/0.50    $false),
% 0.12/0.50    inference(sat_refutation,[status(thm)],[f360,f473,f1353,f1372,f1376])).
% 0.12/0.50  % SZS output end CNFRefutation for theBenchmark.p
% 0.12/0.52  % Elapsed time: 0.150657 seconds
% 0.12/0.52  % CPU time: 0.888523 seconds
% 0.12/0.52  % Total memory used: 119.721 MB
% 0.12/0.52  % Net memory used: 117.970 MB
%------------------------------------------------------------------------------