↑ Up

LisaST---0.9.THM-CRf.s

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

% Computer : n006.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:33 AM UTC 2026

% Result   : Theorem 34.93s 10.34s
% Output   : CNFRefutation 34.93s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   20 (  10 unt;   0 def)
%            Number of atoms       :   48 (  17 equ)
%            Maximal formula atoms :    9 (   2 avg)
%            Number of connectives :   44 (  16   ~;   9   |;  11   &)
%                                         (   1 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   8 con; 0-3 aty)
%            Number of variables   :   13 (   0 sgn   8   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(leq_gt2,axiom,
    ! [X0,X1] :
      ( ( X0 != X1
        & leq(X0,X1) )
     => gt(X1,X0) ) ).

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

fof(cl5_nebula_norm_0012,conjecture,
    ( ( ! [X0] :
          ( ( leq(X0,pred(pv10))
            & leq(n0,X0) )
         => sum(n0,n4,'a$uselect3'(q,X0,'tptp$usum$uindex')) = n1 )
      & leq(pv10,n135299)
      & leq(n0,pv10)
      & sum(n0,n4,'a$uselect3'(q,pv10,'tptp$usum$uindex')) = n1 )
   => ! [X1] :
        ( ( leq(X1,pv10)
          & leq(n0,X1) )
       => sum(n0,n4,'a$uselect3'(q,X1,'tptp$usum$uindex')) = n1 ) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ( ( ! [X0] :
            ( ( leq(X0,pred(pv10))
              & leq(n0,X0) )
           => sum(n0,n4,'a$uselect3'(q,X0,'tptp$usum$uindex')) = n1 )
        & leq(pv10,n135299)
        & leq(n0,pv10)
        & sum(n0,n4,'a$uselect3'(q,pv10,'tptp$usum$uindex')) = n1 )
     => ! [X1] :
          ( ( leq(X1,pv10)
            & leq(n0,X1) )
         => sum(n0,n4,'a$uselect3'(q,X1,'tptp$usum$uindex')) = n1 ) ),
    inference(negate_conjecture,[status(cth)],[cl5_nebula_norm_0012]) ).

cnf(c49,plain,
    ( gt(X1,X0)
    | X0 = X1
    | ~ leq(X0,X1) ),
    inference(clausification,[status(esa)],[leq_gt2]) ).

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

cnf(c163,plain,
    sum(n0,n4,'a$uselect3'(q,pv10,'tptp$usum$uindex')) = n1,
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c166,plain,
    ( sum(n0,n4,'a$uselect3'(q,X0,'tptp$usum$uindex')) = n1
    | ~ leq(X0,pred(pv10))
    | ~ leq(n0,X0) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c167,plain,
    leq(n0,sK182),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c168,plain,
    leq(sK182,pv10),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c169,plain,
    sum(n0,n4,'a$uselect3'(q,sK182,'tptp$usum$uindex')) != n1,
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ( gt(pv10,sK182)
    | sK182 = pv10 ),
    inference(resolution,[status(thm)],[c49,c168]) ).

cnf(d1,plain,
    ( ~ leq(n0,sK182)
    | ~ leq(sK182,pred(pv10))
    | n1 != n1 ),
    inference(superposition,[status(thm)],[c166,c169]) ).

cnf(d2,plain,
    ( ~ leq(sK182,pred(pv10))
    | n1 != n1 ),
    inference(resolution,[status(thm)],[c167,d1]) ).

cnf(d3,plain,
    ~ leq(sK182,pred(pv10)),
    inference(equality_resolution,[status(thm)],[d2]) ).

cnf(d4,plain,
    ~ gt(pv10,sK182),
    inference(resolution,[status(thm)],[c51,d3]) ).

cnf(d5,plain,
    sK182 = pv10,
    inference(resolution,[status(thm)],[d4,d0]) ).

cnf(d6,plain,
    sum(n0,n4,'a$uselect3'(q,pv10,'tptp$usum$uindex')) != n1,
    inference(demodulation,[status(thm)],[c169,d5]) ).

cnf(d7,plain,
    n1 != n1,
    inference(demodulation,[status(thm)],[d6,c163]) ).

cnf(d8,plain,
    $false,
    inference(equality_resolution,[status(thm)],[d7]) ).

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