↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : MGT085+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 : n004.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 17.85s 6.17s
% Output   : CNFRefutation 17.85s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   46 (  20 unt;   0 def)
%            Number of atoms       :   94 (  18 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   65 (  17   ~;  35   |;   9   &)
%                                         (   2 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   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   :   31 (   1 sgn  11   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(ord_v50_v100,axiom,
    less(v50,v100) ).

fof(ord_v100_v200,axiom,
    less(v100,v200) ).

fof(ord_v200_v400,axiom,
    less(v200,v400) ).

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

fof(negated_conjecture,negated_conjecture,
    ~ ~ ? [X0,X1,X2] :
          ( leq(v100,X2)
          & leq(v200,X1)
          & leq(v400,X0)
          & ( 'in$ulopen'(X2,v0,v50)
            | 'in$ulopen'(X1,v0,v100)
            | 'in$ulopen'(X0,v0,v200) ) ),
    inference(negate_conjecture,[status(cth)],[odrl445]) ).

cnf(c9,plain,
    less(v50,v100),
    inference(clausification,[status(esa)],[ord_v50_v100]) ).

cnf(c12,plain,
    less(v100,v200),
    inference(clausification,[status(esa)],[ord_v100_v200]) ).

cnf(c14,plain,
    less(v200,v400),
    inference(clausification,[status(esa)],[ord_v200_v400]) ).

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'(sK62,v0,v50)
    | 'in$ulopen'(sK61,v0,v100)
    | 'in$ulopen'(sK60,v0,v200) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

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

cnf(c72,plain,
    leq(v200,sK61),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c73,plain,
    leq(v100,sK62),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

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

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

cnf(d2,plain,
    ( ~ less(X0,v200)
    | less(X0,sK61) ),
    inference(resolution,[status(thm)],[c34,c72]) ).

cnf(d3,plain,
    less(v100,sK61),
    inference(resolution,[status(thm)],[d2,c12]) ).

cnf(d4,plain,
    ( ~ less(X0,v100)
    | less(X0,sK62) ),
    inference(resolution,[status(thm)],[c34,c73]) ).

cnf(d5,plain,
    less(v50,sK62),
    inference(resolution,[status(thm)],[d4,c9]) ).

cnf(d6,plain,
    leq(v50,sK62),
    inference(resolution,[status(thm)],[d5,c29]) ).

cnf(d7,plain,
    ( ~ leq(sK62,v50)
    | sK62 = v50 ),
    inference(resolution,[status(thm)],[d6,c31]) ).

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

cnf(d9,plain,
    ( ~ leq(sK60,v200)
    | sK60 = v200 ),
    inference(resolution,[status(thm)],[d8,c31]) ).

cnf(d10,plain,
    leq(v100,sK61),
    inference(resolution,[status(thm)],[d3,c29]) ).

cnf(d11,plain,
    ( ~ leq(sK61,v100)
    | sK61 = v100 ),
    inference(resolution,[status(thm)],[d10,c31]) ).

cnf(d12,plain,
    ( 'in$ulopen'(sK60,v0,v200)
    | 'in$ulopen'(sK62,v0,v50)
    | leq(sK61,v100) ),
    inference(resolution,[status(thm)],[c40,c70]) ).

cnf(d13,plain,
    ( leq(sK60,v200)
    | 'in$ulopen'(sK62,v0,v50)
    | leq(sK61,v100) ),
    inference(resolution,[status(thm)],[d12,c40]) ).

cnf(d14,plain,
    ( leq(sK62,v50)
    | leq(sK61,v100)
    | leq(sK60,v200) ),
    inference(resolution,[status(thm)],[d13,c40]) ).

cnf(d15,plain,
    ( sK61 = v100
    | leq(sK60,v200)
    | leq(sK62,v50) ),
    inference(resolution,[status(thm)],[d14,d11]) ).

cnf(d16,plain,
    ( sK60 = v200
    | leq(sK62,v50)
    | sK61 = v100 ),
    inference(resolution,[status(thm)],[d15,d9]) ).

cnf(d17,plain,
    ( sK62 = v50
    | sK61 = v100
    | sK60 = v200 ),
    inference(resolution,[status(thm)],[d16,d7]) ).

cnf(d18,plain,
    ( sK60 = v200
    | sK62 = v50
    | less(v100,v100) ),
    inference(superposition,[status(thm)],[d17,d3]) ).

cnf(d19,plain,
    ( sK60 = v200
    | sK62 = v50 ),
    inference(resolution,[status(thm)],[c25,d18]) ).

cnf(d20,plain,
    ( sK62 = v50
    | less(v200,v200) ),
    inference(superposition,[status(thm)],[d19,d1]) ).

cnf(d21,plain,
    sK62 = v50,
    inference(resolution,[status(thm)],[c25,d20]) ).

cnf(d22,plain,
    less(v50,v50),
    inference(demodulation,[status(thm)],[d5,d21]) ).

cnf(d23,plain,
    $false,
    inference(resolution,[status(thm)],[c25,d22]) ).

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