↑ 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  : SWV159+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 : n010.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:09 PM UTC 2026

% Result   : Theorem 0.10s 0.41s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV159+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.10/0.36  % Computer : n010.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Mon Sep 21 08:33:40 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.38  % Drodi V4.1.1
% 0.10/0.41  % Refutation found
% 0.10/0.41  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.10/0.41  % SZS output start CNFRefutation for theBenchmark
% 0.10/0.41  fof(f53,conjecture,(
% 0.10/0.41    ( ( pv84 = sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index))))& leq(n0,pv10)& leq(n0,pv47)& leq(pv10,n135299)& leq(pv47,n4)& (! [A] :( ( leq(n0,A)& leq(A,pred(pv47)) )=> a_select3(q,pv10,A) = divide(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,A)),minus(a_select2(x,pv10),a_select2(mu,A))),tptp_minus_2),times(a_select2(sigma,A),a_select2(sigma,A)))),a_select2(rho,A)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,A))),sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index))))) ))& (! [B] :( ( leq(n0,B)& leq(B,pred(pv10)) )=> sum(n0,n4,a_select3(q,B,tptp_sum_index)) = n1 ) ))=> (! [C] :( ( leq(n0,C)& leq(C,pred(pv10)) )=> ( pv10 != C=> sum(n0,n4,a_select3(q,C,tptp_sum_index)) = n1 ) ) )) ),
% 0.10/0.41    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.41  fof(f54,negated_conjecture,(
% 0.10/0.41    ~(( ( pv84 = sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index))))& leq(n0,pv10)& leq(n0,pv47)& leq(pv10,n135299)& leq(pv47,n4)& (! [A] :( ( leq(n0,A)& leq(A,pred(pv47)) )=> a_select3(q,pv10,A) = divide(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,A)),minus(a_select2(x,pv10),a_select2(mu,A))),tptp_minus_2),times(a_select2(sigma,A),a_select2(sigma,A)))),a_select2(rho,A)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,A))),sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index))))) ))& (! [B] :( ( leq(n0,B)& leq(B,pred(pv10)) )=> sum(n0,n4,a_select3(q,B,tptp_sum_index)) = n1 ) ))=> (! [C] :( ( leq(n0,C)& leq(C,pred(pv10)) )=> ( pv10 != C=> sum(n0,n4,a_select3(q,C,tptp_sum_index)) = n1 ) ) )) )),
% 0.10/0.41    inference(negated_conjecture,[status(cth)],[f53])).
% 0.10/0.41  fof(f259,plain,(
% 0.10/0.41    (((((((pv84=sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index))))&leq(n0,pv10))&leq(n0,pv47))&leq(pv10,n135299))&leq(pv47,n4))&(![A]: ((~leq(n0,A)|~leq(A,pred(pv47)))|a_select3(q,pv10,A)=divide(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,A)),minus(a_select2(x,pv10),a_select2(mu,A))),tptp_minus_2),times(a_select2(sigma,A),a_select2(sigma,A)))),a_select2(rho,A)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,A))),sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index))))))))&(![B]: ((~leq(n0,B)|~leq(B,pred(pv10)))|sum(n0,n4,a_select3(q,B,tptp_sum_index))=n1)))&(?[C]: ((leq(n0,C)&leq(C,pred(pv10)))&(~pv10=C&~sum(n0,n4,a_select3(q,C,tptp_sum_index))=n1))))),
% 0.10/0.41    inference(pre_NNF_transformation,[status(thm)],[f54])).
% 0.10/0.41  fof(f260,plain,(
% 0.10/0.41    ((((((pv84=sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index))))&leq(n0,pv10))&leq(n0,pv47))&leq(pv10,n135299))&leq(pv47,n4))&(![A]: ((~leq(n0,A)|~leq(A,pred(pv47)))|a_select3(q,pv10,A)=divide(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,A)),minus(a_select2(x,pv10),a_select2(mu,A))),tptp_minus_2),times(a_select2(sigma,A),a_select2(sigma,A)))),a_select2(rho,A)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,A))),sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index))))))))&(![B]: ((~leq(n0,B)|~leq(B,pred(pv10)))|sum(n0,n4,a_select3(q,B,tptp_sum_index))=n1)))&((leq(n0,sK23_skl)&leq(sK23_skl,pred(pv10)))&(~pv10=sK23_skl&~sum(n0,n4,a_select3(q,sK23_skl,tptp_sum_index))=n1))),
% 0.10/0.41    inference(skolemize,[status(esa),new_symbols(skolem,[sK23_skl]),skolemize(C,sK23_skl)],[f259])).
% 0.10/0.41  fof(f267,plain,(
% 0.10/0.41    ![X0]: (~leq(n0,X0)|~leq(X0,pred(pv10))|sum(n0,n4,a_select3(q,X0,tptp_sum_index))=n1)),
% 0.10/0.41    inference(cnf_transformation,[status(thm)],[f260])).
% 0.10/0.41  fof(f268,plain,(
% 0.10/0.41    leq(n0,sK23_skl)),
% 0.10/0.41    inference(cnf_transformation,[status(thm)],[f260])).
% 0.10/0.41  fof(f269,plain,(
% 0.10/0.41    leq(sK23_skl,pred(pv10))),
% 0.10/0.41    inference(cnf_transformation,[status(thm)],[f260])).
% 0.10/0.41  fof(f271,plain,(
% 0.10/0.41    ~sum(n0,n4,a_select3(q,sK23_skl,tptp_sum_index))=n1),
% 0.10/0.41    inference(cnf_transformation,[status(thm)],[f260])).
% 0.10/0.41  fof(f427,plain,(
% 0.10/0.41    ~leq(n0,sK23_skl)|sum(n0,n4,a_select3(q,sK23_skl,tptp_sum_index))=n1),
% 0.10/0.41    inference(resolution,[status(thm)],[f267,f269])).
% 0.10/0.41  fof(f431,definition,(
% 0.10/0.41    sQ2_spl <=> (leq(n0,sK23_skl))),
% 0.10/0.41    introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition])).
% 0.10/0.41  fof(f433,plain,(
% 0.10/0.41    ~leq(n0,sK23_skl)|sQ2_spl),
% 0.10/0.41    inference(component_clause,[status(thm)],[f431])).
% 0.10/0.41  fof(f434,definition,(
% 0.10/0.41    sQ3_spl <=> (sum(n0,n4,a_select3(q,sK23_skl,tptp_sum_index))=n1)),
% 0.10/0.41    introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition])).
% 0.10/0.41  fof(f435,plain,(
% 0.10/0.41    sum(n0,n4,a_select3(q,sK23_skl,tptp_sum_index))=n1|~sQ3_spl),
% 0.10/0.41    inference(component_clause,[status(thm)],[f434])).
% 0.10/0.41  fof(f437,plain,(
% 0.10/0.41    ~sQ2_spl|sQ3_spl),
% 0.10/0.41    inference(split_clause,[status(thm)],[f427,f431,f434])).
% 0.10/0.41  fof(f445,plain,(
% 0.10/0.41    $false|sQ2_spl),
% 0.10/0.41    inference(forward_subsumption_resolution,[status(thm)],[f433,f268])).
% 0.10/0.41  fof(f446,plain,(
% 0.10/0.41    sQ2_spl),
% 0.10/0.41    inference(contradiction_clause,[status(thm)],[f445])).
% 0.10/0.41  fof(f447,plain,(
% 0.10/0.41    $false|~sQ3_spl),
% 0.10/0.41    inference(forward_subsumption_resolution,[status(thm)],[f435,f271])).
% 0.10/0.41  fof(f448,plain,(
% 0.10/0.41    ~sQ3_spl),
% 0.10/0.41    inference(contradiction_clause,[status(thm)],[f447])).
% 0.10/0.41  fof(f449,plain,(
% 0.10/0.41    $false),
% 0.10/0.41    inference(sat_refutation,[status(thm)],[f437,f446,f448])).
% 0.10/0.41  % SZS output end CNFRefutation for theBenchmark.p
% 0.10/0.44  % Elapsed time: 0.074776 seconds
% 0.10/0.44  % CPU time: 0.265795 seconds
% 0.10/0.44  % Total memory used: 111.432 MB
% 0.10/0.44  % Net memory used: 111.019 MB
%------------------------------------------------------------------------------