↑ Up

LisaST---0.9.THM-CRf.s

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

% Computer : n003.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:29 AM UTC 2026

% Result   : Theorem 13.00s 2.75s
% Output   : CNFRefutation 13.00s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   10 (   6 unt;   0 def)
%            Number of atoms       :   15 (   2 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   10 (   5   ~;   3   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-4 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :    9 (   0 sgn   4   !;   0   ?)

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

fof(prec_oo,axiom,
    ! [X0,X1] :
      ( prec(X0,X1,o,o)
    <=> leq(X0,X1) ) ).

fof(odrl604,conjecture,
    prec(v5,v5,o,o) ).

fof(negated_conjecture,negated_conjecture,
    ~ prec(v5,v5,o,o),
    inference(negate_conjecture,[status(cth)],[odrl604]) ).

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

cnf(c57,plain,
    ( ~ leq(X0,X1)
    | prec(X0,X1,o,o) ),
    inference(clausification,[status(esa)],[prec_oo]) ).

cnf(c71,plain,
    ~ prec(v5,v5,o,o),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ~ leq(v5,v5),
    inference(resolution,[status(thm)],[c57,c71]) ).

cnf(d1,plain,
    leq(X0,X0),
    inference(equality_resolution,[status(thm)],[c6]) ).

cnf(d2,plain,
    $false,
    inference(resolution,[status(thm)],[d1,d0]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MGT089+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.35  % Computer : n003.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Sat Sep 26 00:14:08 UTC 2026
% 0.09/0.35  % CPUTime  : 
% 0.09/0.35  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 13.00/2.75  % SZS status Theorem for theBenchmark.p
% 13.00/2.75  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------