↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : MGT071+1 : TPTP v9.3.1. Released v9.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n010.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 13.33s 12.56s
% Output   : CNFRefutation 13.33s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   30 (  14 unt;   0 def)
%            Number of atoms       :   54 (   5 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   41 (  17   ~;  13   |;   6   &)
%                                         (   2 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   35 (   2 sgn  14   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(order_5_10,hypothesis,
    less(n5,n10) ).

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

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

fof(no_false_conflict,conjecture,
    ~ ? [X0] :
        ( 'in$uclosed'(X0,n10,n15)
        & 'in$uclosed'(X0,n0,n5) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ~ ? [X0] :
          ( 'in$uclosed'(X0,n10,n15)
          & 'in$uclosed'(X0,n0,n5) ),
    inference(negate_conjecture,[status(cth)],[no_false_conflict]) ).

cnf(c1,plain,
    less(n5,n10),
    inference(clausification,[status(esa)],[order_5_10]) ).

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

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

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

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

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

cnf(c15,plain,
    ( leq(X1,X0)
    | ~ 'in$uclosed'(X0,X1,X2) ),
    inference(clausification,[status(esa)],[in_closed]) ).

cnf(c16,plain,
    ( leq(X0,X2)
    | ~ 'in$uclosed'(X0,X1,X2) ),
    inference(clausification,[status(esa)],[in_closed]) ).

cnf(c76,plain,
    'in$uclosed'(sK105,n0,n5),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c77,plain,
    'in$uclosed'(sK105,n10,n15),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    leq(sK105,n5),
    inference(resolution,[status(thm)],[c16,c76]) ).

cnf(d1,plain,
    ( ~ leq(n5,sK105)
    | n5 = sK105 ),
    inference(resolution,[status(thm)],[d0,c10]) ).

cnf(d2,plain,
    leq(n5,n10),
    inference(resolution,[status(thm)],[c8,c1]) ).

cnf(d3,plain,
    leq(n10,sK105),
    inference(resolution,[status(thm)],[c15,c77]) ).

cnf(d4,plain,
    ( ~ leq(X0,n10)
    | leq(X0,sK105) ),
    inference(resolution,[status(thm)],[d3,c14]) ).

cnf(d5,plain,
    leq(n5,sK105),
    inference(resolution,[status(thm)],[d4,d2]) ).

cnf(d6,plain,
    n5 = sK105,
    inference(resolution,[status(thm)],[d5,d1]) ).

cnf(d7,plain,
    ( ~ less(X0,n10)
    | less(X0,sK105) ),
    inference(resolution,[status(thm)],[d3,c13]) ).

cnf(d8,plain,
    less(n5,sK105),
    inference(resolution,[status(thm)],[d7,c1]) ).

cnf(d9,plain,
    less(n5,n5),
    inference(demodulation,[status(thm)],[d8,d6]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : MGT071+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.07  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/10.81  % Computer : n010.cluster.edu
% 0.17/10.81  % Model    : x86_64 x86_64
% 0.17/10.81  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/10.81  % Memory   : 8046.5625MB
% 0.17/10.81  % OS       : Linux 6.8.0-71-generic
% 0.17/10.81  % CPULimit : 300
% 0.17/10.81  % WCLimit  : 300
% 0.17/10.81  % DateTime : Sat Sep 26 00:11:55 UTC 2026
% 0.17/10.81  % CPUTime  : 
% 0.17/10.81  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 13.33/12.56  % SZS status Theorem for theBenchmark.p
% 13.33/12.56  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------