↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : SWV160+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n005.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 : Sun Sep 27 09:01:32 AM UTC 2026

% Result   : Theorem 16.45s 2.99s
% Output   : CNFRefutation 16.45s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   11 (   7 unt;   0 def)
%            Number of atoms       :   41 (  11 equ)
%            Maximal formula atoms :   15 (   3 avg)
%            Number of connectives :   34 (   4   ~;   1   |;  18   &)
%                                         (   1 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   4 avg)
%            Maximal term depth    :   12 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   28 (  28 usr;  17 con; 0-3 aty)
%            Number of variables   :   12 (   0 sgn   9   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(irreflexivity_gt,axiom,
    ! [X0] : ~ gt(X0,X0) ).

fof(leq_gt_pred,axiom,
    ! [X0,X1] :
      ( leq(X0,pred(X1))
    <=> gt(X1,X0) ) ).

fof(cl5_nebula_norm_0010,conjecture,
    ( ( ! [X1] :
          ( ( leq(X1,pred(pv10))
            & leq(n0,X1) )
         => sum(n0,n4,'a$uselect3'(q,X1,'tptp$usum$uindex')) = n1 )
      & ! [X0] :
          ( ( leq(X0,pred(pv47))
            & leq(n0,X0) )
         => 'a$uselect3'(q,pv10,X0) = divide(divide(times(exp(divide(divide(times(minus('a$uselect2'(x,pv10),'a$uselect2'(mu,X0)),minus('a$uselect2'(x,pv10),'a$uselect2'(mu,X0))),'tptp$uminus$u2'),times('a$uselect2'(sigma,X0),'a$uselect2'(sigma,X0)))),'a$uselect2'(rho,X0)),times(sqrt(times(n2,'tptp$upi')),'a$uselect2'(sigma,X0))),sum(n0,n4,divide(times(exp(divide(divide(times(minus('a$uselect2'(x,pv10),'a$uselect2'(mu,'tptp$usum$uindex')),minus('a$uselect2'(x,pv10),'a$uselect2'(mu,'tptp$usum$uindex'))),'tptp$uminus$u2'),times('a$uselect2'(sigma,'tptp$usum$uindex'),'a$uselect2'(sigma,'tptp$usum$uindex')))),'a$uselect2'(rho,'tptp$usum$uindex')),times(sqrt(times(n2,'tptp$upi')),'a$uselect2'(sigma,'tptp$usum$uindex'))))) )
      & leq(pv47,n4)
      & leq(pv10,n135299)
      & leq(n0,pv47)
      & leq(n0,pv10)
      & pv84 = sum(n0,n4,divide(times(exp(divide(divide(times(minus('a$uselect2'(x,pv10),'a$uselect2'(mu,'tptp$usum$uindex')),minus('a$uselect2'(x,pv10),'a$uselect2'(mu,'tptp$usum$uindex'))),'tptp$uminus$u2'),times('a$uselect2'(sigma,'tptp$usum$uindex'),'a$uselect2'(sigma,'tptp$usum$uindex')))),'a$uselect2'(rho,'tptp$usum$uindex')),times(sqrt(times(n2,'tptp$upi')),'a$uselect2'(sigma,'tptp$usum$uindex')))) )
   => ! [X2] :
        ( ( leq(X2,pred(pv10))
          & leq(n0,X2) )
       => ( pv10 = X2
         => sum(n0,n4,cond('tptp$uterm$uequals'(pv47,'tptp$usum$uindex'),divide(divide(times(exp(divide(divide(times(minus('a$uselect2'(x,pv10),'a$uselect2'(mu,pv47)),minus('a$uselect2'(x,pv10),'a$uselect2'(mu,pv47))),'tptp$uminus$u2'),times('a$uselect2'(sigma,pv47),'a$uselect2'(sigma,pv47)))),'a$uselect2'(rho,pv47)),times(sqrt(times(n2,'tptp$upi')),'a$uselect2'(sigma,pv47))),pv84),'a$uselect3'(q,X2,'tptp$usum$uindex'))) = n1 ) ) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ( ( ! [X1] :
            ( ( leq(X1,pred(pv10))
              & leq(n0,X1) )
           => sum(n0,n4,'a$uselect3'(q,X1,'tptp$usum$uindex')) = n1 )
        & ! [X0] :
            ( ( leq(X0,pred(pv47))
              & leq(n0,X0) )
           => 'a$uselect3'(q,pv10,X0) = divide(divide(times(exp(divide(divide(times(minus('a$uselect2'(x,pv10),'a$uselect2'(mu,X0)),minus('a$uselect2'(x,pv10),'a$uselect2'(mu,X0))),'tptp$uminus$u2'),times('a$uselect2'(sigma,X0),'a$uselect2'(sigma,X0)))),'a$uselect2'(rho,X0)),times(sqrt(times(n2,'tptp$upi')),'a$uselect2'(sigma,X0))),sum(n0,n4,divide(times(exp(divide(divide(times(minus('a$uselect2'(x,pv10),'a$uselect2'(mu,'tptp$usum$uindex')),minus('a$uselect2'(x,pv10),'a$uselect2'(mu,'tptp$usum$uindex'))),'tptp$uminus$u2'),times('a$uselect2'(sigma,'tptp$usum$uindex'),'a$uselect2'(sigma,'tptp$usum$uindex')))),'a$uselect2'(rho,'tptp$usum$uindex')),times(sqrt(times(n2,'tptp$upi')),'a$uselect2'(sigma,'tptp$usum$uindex'))))) )
        & leq(pv47,n4)
        & leq(pv10,n135299)
        & leq(n0,pv47)
        & leq(n0,pv10)
        & pv84 = sum(n0,n4,divide(times(exp(divide(divide(times(minus('a$uselect2'(x,pv10),'a$uselect2'(mu,'tptp$usum$uindex')),minus('a$uselect2'(x,pv10),'a$uselect2'(mu,'tptp$usum$uindex'))),'tptp$uminus$u2'),times('a$uselect2'(sigma,'tptp$usum$uindex'),'a$uselect2'(sigma,'tptp$usum$uindex')))),'a$uselect2'(rho,'tptp$usum$uindex')),times(sqrt(times(n2,'tptp$upi')),'a$uselect2'(sigma,'tptp$usum$uindex')))) )
     => ! [X2] :
          ( ( leq(X2,pred(pv10))
            & leq(n0,X2) )
         => ( pv10 = X2
           => sum(n0,n4,cond('tptp$uterm$uequals'(pv47,'tptp$usum$uindex'),divide(divide(times(exp(divide(divide(times(minus('a$uselect2'(x,pv10),'a$uselect2'(mu,pv47)),minus('a$uselect2'(x,pv10),'a$uselect2'(mu,pv47))),'tptp$uminus$u2'),times('a$uselect2'(sigma,pv47),'a$uselect2'(sigma,pv47)))),'a$uselect2'(rho,pv47)),times(sqrt(times(n2,'tptp$upi')),'a$uselect2'(sigma,pv47))),pv84),'a$uselect3'(q,X2,'tptp$usum$uindex'))) = n1 ) ) ),
    inference(negate_conjecture,[status(cth)],[cl5_nebula_norm_0010]) ).

cnf(c49,plain,
    ~ gt(X0,X0),
    inference(clausification,[status(esa)],[irreflexivity_gt]) ).

cnf(c58,plain,
    ( gt(X1,X0)
    | ~ leq(X0,pred(X1)) ),
    inference(clausification,[status(esa)],[leq_gt_pred]) ).

cnf(c179,plain,
    leq(sK183,pred(pv10)),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c180,plain,
    pv10 = sK183,
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    leq(pv10,pred(pv10)),
    inference(demodulation,[status(thm)],[c179,c180]) ).

cnf(d1,plain,
    gt(pv10,pv10),
    inference(resolution,[status(thm)],[c58,d0]) ).

cnf(d2,plain,
    $false,
    inference(resolution,[status(thm)],[c49,d1]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWV160+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.03  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.34  % Computer : n005.cluster.edu
% 0.09/0.34  % Model    : x86_64 x86_64
% 0.09/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.34  % Memory   : 8046.5625MB
% 0.09/0.34  % OS       : Linux 6.8.0-71-generic
% 0.09/0.34  % CPULimit : 300
% 0.09/0.34  % WCLimit  : 300
% 0.09/0.34  % DateTime : Sat Sep 26 13:17:02 UTC 2026
% 0.09/0.35  % CPUTime  : 
% 0.09/0.35  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 16.45/2.99  % SZS status Theorem for theBenchmark.p
% 16.45/2.99  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------