↑ Up

LisaST---0.9.THM-CRf.s

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

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

% Comments : 
%------------------------------------------------------------------------------
fof(ord_v0_v400,axiom,
    less(v0,v400) ).

fof(ord_v400_v800,axiom,
    less(v400,v800) ).

fof(ord_v800_v1200,axiom,
    less(v800,v1200) ).

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

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

fof(sharpness_conflict,axiom,
    ! [X0,X1,X2,X3] :
      ( ( leq(X1,X3)
        & less(X0,X1)
        & leq(X0,X3)
        & leq(X2,X0) )
     => 'completion$uconflict'(X0,X1,X2,X3) ) ).

fof(odrl633,conjecture,
    'completion$uconflict'(v400,v800,v0,v1200) ).

fof(negated_conjecture,negated_conjecture,
    ~ 'completion$uconflict'(v400,v800,v0,v1200),
    inference(negate_conjecture,[status(cth)],[odrl633]) ).

cnf(c4,plain,
    less(v0,v400),
    inference(clausification,[status(esa)],[ord_v0_v400]) ).

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

cnf(c6,plain,
    less(v800,v1200),
    inference(clausification,[status(esa)],[ord_v800_v1200]) ).

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

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

cnf(c27,plain,
    ( ~ leq(X2,X0)
    | ~ less(X0,X1)
    | ~ leq(X0,X3)
    | ~ leq(X1,X3)
    | 'completion$uconflict'(X0,X1,X2,X3) ),
    inference(clausification,[status(esa)],[sharpness_conflict]) ).

cnf(c64,plain,
    ~ 'completion$uconflict'(v400,v800,v0,v1200),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ( ~ leq(v400,v1200)
    | ~ leq(v800,v1200)
    | ~ leq(v0,v400)
    | ~ less(v400,v800) ),
    inference(resolution,[status(thm)],[c27,c64]) ).

cnf(d1,plain,
    ( ~ leq(v800,v1200)
    | ~ leq(v400,v1200)
    | ~ leq(v0,v400) ),
    inference(resolution,[status(thm)],[c5,d0]) ).

cnf(d2,plain,
    leq(v0,v400),
    inference(resolution,[status(thm)],[c17,c4]) ).

cnf(d3,plain,
    ( ~ leq(v800,v1200)
    | ~ leq(v400,v1200) ),
    inference(resolution,[status(thm)],[d2,d1]) ).

cnf(d4,plain,
    leq(v800,v1200),
    inference(resolution,[status(thm)],[c17,c6]) ).

cnf(d5,plain,
    ~ leq(v400,v1200),
    inference(resolution,[status(thm)],[d4,d3]) ).

cnf(d6,plain,
    ( ~ less(X0,v800)
    | less(X0,v1200) ),
    inference(resolution,[status(thm)],[c14,c6]) ).

cnf(d7,plain,
    less(v400,v1200),
    inference(resolution,[status(thm)],[d6,c5]) ).

cnf(d8,plain,
    leq(v400,v1200),
    inference(resolution,[status(thm)],[d7,c17]) ).

cnf(d9,plain,
    $false,
    inference(resolution,[status(thm)],[d8,d5]) ).

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