↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : SWV137+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 : n017.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:29 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(gt_2_0,axiom,
    gt(n2,n0) ).

fof(transitivity_gt,axiom,
    ! [X0,X1,X2] :
      ( ( gt(X1,X2)
        & gt(X0,X1) )
     => gt(X0,X2) ) ).

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

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

fof(gauss_array_0007,conjecture,
    ( ( leq('a$uselect2'('s$uvalues7',pv1325),'a$uselect2'('s$uvalues7','s$uworst7'))
      & leq('a$uselect2'('s$uvalues7',pv1325),'a$uselect2'('s$uvalues7','s$ubest7'))
      & leq(pv1325,n3)
      & leq('s$uworst7',n3)
      & leq('s$usworst7',n3)
      & leq('s$ubest7',n3)
      & leq(n2,pv1325)
      & leq(n0,'s$uworst7')
      & leq(n0,'s$usworst7')
      & leq(n0,'s$ubest7') )
   => leq(n0,pv1325) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ( ( leq('a$uselect2'('s$uvalues7',pv1325),'a$uselect2'('s$uvalues7','s$uworst7'))
        & leq('a$uselect2'('s$uvalues7',pv1325),'a$uselect2'('s$uvalues7','s$ubest7'))
        & leq(pv1325,n3)
        & leq('s$uworst7',n3)
        & leq('s$usworst7',n3)
        & leq('s$ubest7',n3)
        & leq(n2,pv1325)
        & leq(n0,'s$uworst7')
        & leq(n0,'s$usworst7')
        & leq(n0,'s$ubest7') )
     => leq(n0,pv1325) ),
    inference(negate_conjecture,[status(cth)],[gauss_array_0007]) ).

cnf(c10,plain,
    gt(n2,n0),
    inference(clausification,[status(esa)],[gt_2_0]) ).

cnf(c33,plain,
    ( gt(X0,X2)
    | ~ gt(X1,X2)
    | ~ gt(X0,X1) ),
    inference(clausification,[status(esa)],[transitivity_gt]) ).

cnf(c41,plain,
    ( leq(X1,X0)
    | ~ gt(X0,X1) ),
    inference(clausification,[status(esa)],[leq_gt1]) ).

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

cnf(c159,plain,
    leq(n2,pv1325),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c166,plain,
    ~ leq(n0,pv1325),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ( gt(pv1325,n2)
    | n2 = pv1325 ),
    inference(resolution,[status(thm)],[c42,c159]) ).

cnf(d1,plain,
    ( gt(pv1325,X0)
    | ~ gt(n2,X0)
    | n2 = pv1325 ),
    inference(resolution,[status(thm)],[d0,c33]) ).

cnf(d2,plain,
    ( gt(pv1325,n0)
    | n2 = pv1325 ),
    inference(resolution,[status(thm)],[d1,c10]) ).

cnf(d3,plain,
    ( leq(n0,pv1325)
    | n2 = pv1325 ),
    inference(resolution,[status(thm)],[d2,c41]) ).

cnf(d4,plain,
    n2 = pv1325,
    inference(resolution,[status(thm)],[c166,d3]) ).

cnf(d5,plain,
    ~ leq(n0,n2),
    inference(demodulation,[status(thm)],[c166,d4]) ).

cnf(d6,plain,
    leq(n0,n2),
    inference(resolution,[status(thm)],[c41,c10]) ).

cnf(d7,plain,
    $false,
    inference(resolution,[status(thm)],[d6,d5]) ).

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