↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : MGT081+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 12.90s 2.08s
% Output   : CNFRefutation 12.90s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   24 (  12 unt;   0 def)
%            Number of atoms       :   46 (   5 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   35 (  13   ~;   9   |;   9   &)
%                                         (   2 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   6 con; 0-0 aty)
%            Number of variables   :   27 (   1 sgn  11   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(ord_v400_v800,axiom,
    less(v400,v800) ).

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(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(odrl402,conjecture,
    ~ ? [X0,X1] :
        ( leq(v200,X1)
        & 'in$ulopen'(X1,v0,v600)
        & leq(v800,X0)
        & 'in$ulopen'(X0,v0,v400) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ~ ? [X0,X1] :
          ( leq(v200,X1)
          & 'in$ulopen'(X1,v0,v600)
          & leq(v800,X0)
          & 'in$ulopen'(X0,v0,v400) ),
    inference(negate_conjecture,[status(cth)],[odrl402]) ).

cnf(c13,plain,
    less(v400,v800),
    inference(clausification,[status(esa)],[ord_v400_v800]) ).

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

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

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

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

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

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

cnf(c71,plain,
    leq(v800,sK60),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ( ~ less(X0,v800)
    | less(X0,sK60) ),
    inference(resolution,[status(thm)],[c34,c71]) ).

cnf(d1,plain,
    less(v400,sK60),
    inference(resolution,[status(thm)],[d0,c13]) ).

cnf(d2,plain,
    leq(v400,sK60),
    inference(resolution,[status(thm)],[d1,c29]) ).

cnf(d3,plain,
    ( ~ leq(sK60,v400)
    | sK60 = v400 ),
    inference(resolution,[status(thm)],[d2,c31]) ).

cnf(d4,plain,
    leq(sK60,v400),
    inference(resolution,[status(thm)],[c40,c70]) ).

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

cnf(d6,plain,
    less(v400,v400),
    inference(demodulation,[status(thm)],[d1,d5]) ).

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

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