↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : MGT079+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 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 08:01:28 AM UTC 2026

% Result   : Theorem 13.74s 2.71s
% Output   : CNFRefutation 13.74s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   38 (  18 unt;   0 def)
%            Number of atoms       :   95 (   6 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :  103 (  46   ~;  42   |;  12   &)
%                                         (   2 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   7 con; 0-0 aty)
%            Number of variables   :   46 (   6 sgn   8   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(ord_v0_v32,axiom,
    less(v0,v32) ).

fof(ord_v0_v400,axiom,
    less(v0,v400) ).

fof(ord_v16_v32,axiom,
    less(v16,v32) ).

fof(ord_v32_v600,axiom,
    less(v32,v600) ).

fof(irreflexive,axiom,
    ! [X0] : ~ less(X0,X0) ).

fof(leq_def,axiom,
    ! [X0,X1] :
      ( leq(X0,X1)
    <=> ( X0 = X1
        | less(X0,X1) ) ) ).

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

fof(in_lopen,axiom,
    ! [X0,X1,X2] :
      ( 'in$ulopen'(X0,X1,X2)
    <=> ( leq(X0,X2)
        & less(X1,X0) ) ) ).

fof(odrl350,conjecture,
    ? [X0,X1,X2] :
      ( ~ ( 'in$ulopen'(X2,v0,v16)
          & 'in$ulopen'(X1,v0,v800)
          & 'in$ulopen'(X0,v0,v1200) )
      & 'in$ulopen'(X2,v0,v32)
      & 'in$ulopen'(X1,v0,v400)
      & 'in$ulopen'(X0,v0,v600) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ? [X0,X1,X2] :
        ( ~ ( 'in$ulopen'(X2,v0,v16)
            & 'in$ulopen'(X1,v0,v800)
            & 'in$ulopen'(X0,v0,v1200) )
        & 'in$ulopen'(X2,v0,v32)
        & 'in$ulopen'(X1,v0,v400)
        & 'in$ulopen'(X0,v0,v600) ),
    inference(negate_conjecture,[status(cth)],[odrl350]) ).

cnf(c8,plain,
    less(v0,v32),
    inference(clausification,[status(esa)],[ord_v0_v32]) ).

cnf(c9,plain,
    less(v0,v400),
    inference(clausification,[status(esa)],[ord_v0_v400]) ).

cnf(c13,plain,
    less(v16,v32),
    inference(clausification,[status(esa)],[ord_v16_v32]) ).

cnf(c19,plain,
    less(v32,v600),
    inference(clausification,[status(esa)],[ord_v32_v600]) ).

cnf(c49,plain,
    ~ less(X0,X0),
    inference(clausification,[status(esa)],[irreflexive]) ).

cnf(c53,plain,
    ( ~ less(X0,X1)
    | leq(X0,X1) ),
    inference(clausification,[status(esa)],[leq_def]) ).

cnf(c54,plain,
    ( X0 != X1
    | leq(X0,X1) ),
    inference(clausification,[status(esa)],[leq_def]) ).

cnf(c55,plain,
    ( X0 = X1
    | ~ leq(X1,X0)
    | ~ leq(X0,X1) ),
    inference(clausification,[status(esa)],[leq_antisym]) ).

cnf(c64,plain,
    ( leq(X0,X2)
    | ~ 'in$ulopen'(X0,X1,X2) ),
    inference(clausification,[status(esa)],[in_lopen]) ).

cnf(c65,plain,
    ( ~ leq(X0,X2)
    | ~ less(X1,X0)
    | 'in$ulopen'(X0,X1,X2) ),
    inference(clausification,[status(esa)],[in_lopen]) ).

cnf(c96,plain,
    ( 'in$ulopen'(X2,v0,v16)
    | ~ 'in$ulopen'(X2,v0,v32)
    | ~ 'in$ulopen'(X1,v0,v400)
    | ~ 'in$ulopen'(X0,v0,v600) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    leq(v16,v32),
    inference(resolution,[status(thm)],[c53,c13]) ).

cnf(d1,plain,
    ( ~ leq(v32,v16)
    | v32 = v16 ),
    inference(resolution,[status(thm)],[d0,c55]) ).

cnf(d2,plain,
    leq(X0,X0),
    inference(equality_resolution,[status(thm)],[c54]) ).

cnf(d3,plain,
    leq(v32,v600),
    inference(resolution,[status(thm)],[c53,c19]) ).

cnf(d4,plain,
    ( 'in$ulopen'(X0,v0,v16)
    | ~ 'in$ulopen'(X2,v0,v400)
    | ~ 'in$ulopen'(X1,v0,v600)
    | ~ leq(X0,v32)
    | ~ less(v0,X0) ),
    inference(resolution,[status(thm)],[c65,c96]) ).

cnf(d5,plain,
    ( ~ leq(X2,v600)
    | ~ less(v0,X2)
    | 'in$ulopen'(X0,v0,v16)
    | ~ 'in$ulopen'(X1,v0,v400)
    | ~ leq(X0,v32)
    | ~ less(v0,X0) ),
    inference(resolution,[status(thm)],[d4,c65]) ).

cnf(d6,plain,
    ( ~ leq(X2,v400)
    | ~ less(v0,X2)
    | 'in$ulopen'(X1,v0,v16)
    | ~ leq(X1,v32)
    | ~ leq(X0,v600)
    | ~ less(v0,X1)
    | ~ less(v0,X0) ),
    inference(resolution,[status(thm)],[d5,c65]) ).

cnf(d7,plain,
    ( 'in$ulopen'(X1,v0,v16)
    | ~ leq(X1,v32)
    | ~ leq(X0,v400)
    | ~ less(v0,v32)
    | ~ less(v0,X1)
    | ~ less(v0,X0) ),
    inference(resolution,[status(thm)],[d6,d3]) ).

cnf(d8,plain,
    ( 'in$ulopen'(X0,v0,v16)
    | ~ leq(X1,v400)
    | ~ leq(X0,v32)
    | ~ less(v0,X1)
    | ~ less(v0,X0) ),
    inference(resolution,[status(thm)],[c8,d7]) ).

cnf(d9,plain,
    ( 'in$ulopen'(v32,v0,v16)
    | ~ leq(X0,v400)
    | ~ less(v0,v32)
    | ~ less(v0,X0) ),
    inference(resolution,[status(thm)],[d2,d8]) ).

cnf(d10,plain,
    ( 'in$ulopen'(v32,v0,v16)
    | ~ leq(X0,v400)
    | ~ less(v0,X0) ),
    inference(resolution,[status(thm)],[c8,d9]) ).

cnf(d11,plain,
    ( 'in$ulopen'(v32,v0,v16)
    | ~ less(v0,v400) ),
    inference(resolution,[status(thm)],[d10,d2]) ).

cnf(d12,plain,
    'in$ulopen'(v32,v0,v16),
    inference(resolution,[status(thm)],[c9,d11]) ).

cnf(d13,plain,
    leq(v32,v16),
    inference(resolution,[status(thm)],[d12,c64]) ).

cnf(d14,plain,
    v32 = v16,
    inference(resolution,[status(thm)],[d13,d1]) ).

cnf(d15,plain,
    less(v32,v32),
    inference(demodulation,[status(thm)],[c13,d14]) ).

cnf(d16,plain,
    $false,
    inference(resolution,[status(thm)],[c49,d15]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MGT079+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 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 00:11:46 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 13.74/2.71  % SZS status Theorem for theBenchmark.p
% 13.74/2.71  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------