↑ Up

LisaST---0.9.THM-CRf.s

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

% Result   : Theorem 17.55s 2.62s
% Output   : CNFRefutation 17.55s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   34 (  13 unt;   0 def)
%            Number of atoms       :  109 (   7 equ)
%            Maximal formula atoms :   27 (   3 avg)
%            Number of connectives :  106 (  31   ~;  18   |;  27   &)
%                                         (   2 <=>;  28  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   9 con; 0-1 aty)
%            Number of variables   :   32 (   0 sgn  13   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(successor_1,axiom,
    succ(n0) = n1 ).

fof(totality,axiom,
    ! [X0,X1] :
      ( X0 = X1
      | gt(X1,X0)
      | gt(X0,X1) ) ).

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

fof(reflexivity_leq,axiom,
    ! [X0] : leq(X0,X0) ).

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

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

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

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

fof(gauss_array_0012,conjecture,
    ( ( ( gt(loopcounter,n0)
       => leq('s$uworst7',n3) )
      & ( gt(loopcounter,n0)
       => leq('s$usworst7',n3) )
      & ( gt(loopcounter,n0)
       => leq('s$ubest7',n3) )
      & ( gt(loopcounter,n0)
       => leq(n0,'s$uworst7') )
      & ( gt(loopcounter,n0)
       => leq(n0,'s$usworst7') )
      & ( gt(loopcounter,n0)
       => leq(n0,'s$ubest7') )
      & ( ~ leq('tptp$ufloat$u0$u001',pv1341)
       => leq('s$uworst7',n3) )
      & ( ~ leq('tptp$ufloat$u0$u001',pv1341)
       => leq('s$usworst7',n3) )
      & ( ~ leq('tptp$ufloat$u0$u001',pv1341)
       => leq('s$ubest7',n3) )
      & ( ~ leq('tptp$ufloat$u0$u001',pv1341)
       => leq(n0,'s$uworst7') )
      & ( ~ leq('tptp$ufloat$u0$u001',pv1341)
       => leq(n0,'s$usworst7') )
      & ( ~ leq('tptp$ufloat$u0$u001',pv1341)
       => leq(n0,'s$ubest7') )
      & leq(n1,loopcounter)
      & leq('tptp$ufloat$u0$u001',pv1341) )
   => leq('s$ubest7',n3) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ( ( ( gt(loopcounter,n0)
         => leq('s$uworst7',n3) )
        & ( gt(loopcounter,n0)
         => leq('s$usworst7',n3) )
        & ( gt(loopcounter,n0)
         => leq('s$ubest7',n3) )
        & ( gt(loopcounter,n0)
         => leq(n0,'s$uworst7') )
        & ( gt(loopcounter,n0)
         => leq(n0,'s$usworst7') )
        & ( gt(loopcounter,n0)
         => leq(n0,'s$ubest7') )
        & ( ~ leq('tptp$ufloat$u0$u001',pv1341)
         => leq('s$uworst7',n3) )
        & ( ~ leq('tptp$ufloat$u0$u001',pv1341)
         => leq('s$usworst7',n3) )
        & ( ~ leq('tptp$ufloat$u0$u001',pv1341)
         => leq('s$ubest7',n3) )
        & ( ~ leq('tptp$ufloat$u0$u001',pv1341)
         => leq(n0,'s$uworst7') )
        & ( ~ leq('tptp$ufloat$u0$u001',pv1341)
         => leq(n0,'s$usworst7') )
        & ( ~ leq('tptp$ufloat$u0$u001',pv1341)
         => leq(n0,'s$ubest7') )
        & leq(n1,loopcounter)
        & leq('tptp$ufloat$u0$u001',pv1341) )
     => leq('s$ubest7',n3) ),
    inference(negate_conjecture,[status(cth)],[gauss_array_0012]) ).

cnf(c29,plain,
    succ(n0) = n1,
    inference(clausification,[status(esa)],[successor_1]) ).

cnf(c32,plain,
    ( X0 = X1
    | gt(X1,X0)
    | gt(X0,X1) ),
    inference(clausification,[status(esa)],[totality]) ).

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

cnf(c35,plain,
    leq(X0,X0),
    inference(clausification,[status(esa)],[reflexivity_leq]) ).

cnf(c36,plain,
    ( leq(X0,X2)
    | ~ leq(X1,X2)
    | ~ leq(X0,X1) ),
    inference(clausification,[status(esa)],[transitivity_leq]) ).

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

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

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

cnf(c47,plain,
    ( gt(succ(X1),X0)
    | ~ leq(X0,X1) ),
    inference(clausification,[status(esa)],[leq_succ_gt_equiv]) ).

cnf(c157,plain,
    leq(n1,loopcounter),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c167,plain,
    ( leq('s$ubest7',n3)
    | ~ gt(loopcounter,n0) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c170,plain,
    ~ leq('s$ubest7',n3),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ~ gt(loopcounter,n0),
    inference(resolution,[status(thm)],[c170,c167]) ).

cnf(d1,plain,
    ( gt(n0,loopcounter)
    | n0 = loopcounter ),
    inference(resolution,[status(thm)],[c32,d0]) ).

cnf(d2,plain,
    ( n0 = loopcounter
    | leq(loopcounter,n0) ),
    inference(resolution,[status(thm)],[c41,d1]) ).

cnf(d3,plain,
    ( leq(n1,X0)
    | ~ leq(loopcounter,X0) ),
    inference(resolution,[status(thm)],[c36,c157]) ).

cnf(d4,plain,
    ( leq(n1,pred(X0))
    | ~ gt(X0,loopcounter) ),
    inference(resolution,[status(thm)],[c44,d3]) ).

cnf(d5,plain,
    ( gt(X0,n1)
    | ~ gt(X0,loopcounter) ),
    inference(resolution,[status(thm)],[d4,c43]) ).

cnf(d6,plain,
    ( ~ leq(loopcounter,X0)
    | gt(succ(X0),n1) ),
    inference(resolution,[status(thm)],[d5,c47]) ).

cnf(d7,plain,
    ( ~ leq(loopcounter,n0)
    | gt(n1,n1) ),
    inference(superposition,[status(thm)],[c29,d6]) ).

cnf(d8,plain,
    ~ leq(loopcounter,n0),
    inference(resolution,[status(thm)],[c34,d7]) ).

cnf(d9,plain,
    n0 = loopcounter,
    inference(resolution,[status(thm)],[d8,d2]) ).

cnf(d10,plain,
    ~ leq(n0,n0),
    inference(demodulation,[status(thm)],[d8,d9]) ).

cnf(d11,plain,
    $false,
    inference(resolution,[status(thm)],[c35,d10]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWV142+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.36  % Computer : n005.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Sat Sep 26 13:15:18 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 17.55/2.62  % SZS status Theorem for theBenchmark.p
% 17.55/2.62  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------