↑ Up

LisaST---0.9.THM-CRf.s

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

% Result   : Theorem 14.79s 2.33s
% Output   : CNFRefutation 14.79s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   29 (  14 unt;   0 def)
%            Number of atoms       :   60 (   5 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   47 (  16   ~;  12   |;  14   &)
%                                         (   2 <=>;   3  =>;   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    :    8 (   8 usr;   8 con; 0-0 aty)
%            Number of variables   :   36 (   1 sgn  14   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(ord_v600_v1200,axiom,
    less(v600,v1200) ).

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(leq_less_trans,axiom,
    ! [X0,X1,X2] :
      ( ( less(X1,X2)
        & leq(X0,X1) )
     => less(X0,X2) ) ).

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

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

fof(odrl341,conjecture,
    ~ ? [X0,X1,X2] :
        ( leq(v8,X2)
        & 'in$ulopen'(X2,v0,v32)
        & leq(v200,X1)
        & 'in$ulopen'(X1,v0,v800)
        & leq(v1200,X0)
        & 'in$ulopen'(X0,v0,v600) ) ).

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

cnf(c26,plain,
    less(v600,v1200),
    inference(clausification,[status(esa)],[ord_v600_v1200]) ).

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(c55,plain,
    ( X0 = X1
    | ~ leq(X1,X0)
    | ~ leq(X0,X1) ),
    inference(clausification,[status(esa)],[leq_antisym]) ).

cnf(c57,plain,
    ( less(X0,X2)
    | ~ less(X1,X2)
    | ~ leq(X0,X1) ),
    inference(clausification,[status(esa)],[leq_less_trans]) ).

cnf(c58,plain,
    ( less(X0,X2)
    | ~ leq(X1,X2)
    | ~ less(X0,X1) ),
    inference(clausification,[status(esa)],[less_leq_trans]) ).

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

cnf(c94,plain,
    'in$ulopen'(sK60,v0,v600),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c95,plain,
    leq(v1200,sK60),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    leq(sK60,v600),
    inference(resolution,[status(thm)],[c64,c94]) ).

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

cnf(d2,plain,
    ( ~ less(X0,v1200)
    | less(X0,sK60) ),
    inference(resolution,[status(thm)],[c58,c95]) ).

cnf(d3,plain,
    less(v600,sK60),
    inference(resolution,[status(thm)],[d2,c26]) ).

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

cnf(d5,plain,
    v600 = sK60,
    inference(resolution,[status(thm)],[d4,d1]) ).

cnf(d6,plain,
    ( ~ less(v600,X0)
    | less(sK60,X0) ),
    inference(resolution,[status(thm)],[d0,c57]) ).

cnf(d7,plain,
    less(sK60,sK60),
    inference(resolution,[status(thm)],[d6,d3]) ).

cnf(d8,plain,
    less(v600,sK60),
    inference(demodulation,[status(thm)],[d7,d5]) ).

cnf(d9,plain,
    less(v600,v600),
    inference(demodulation,[status(thm)],[d8,d5]) ).

cnf(d10,plain,
    $false,
    inference(resolution,[status(thm)],[c49,d9]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : MGT078+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.06  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.41  % Computer : n001.cluster.edu
% 0.15/0.41  % Model    : x86_64 x86_64
% 0.15/0.41  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.41  % Memory   : 8046.5625MB
% 0.15/0.41  % OS       : Linux 6.8.0-71-generic
% 0.15/0.41  % CPULimit : 300
% 0.15/0.41  % WCLimit  : 300
% 0.15/0.41  % DateTime : Sat Sep 26 00:17:41 UTC 2026
% 0.15/0.42  % CPUTime  : 
% 0.15/0.42  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 14.79/2.33  % SZS status Theorem for theBenchmark.p
% 14.79/2.33  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------