↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : MGT091+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 : n006.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 17.83s 12.89s
% Output   : CNFRefutation 17.83s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   37 (  16 unt;   0 def)
%            Number of atoms       :   73 (   2 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   68 (  32   ~;  27   |;   4   &)
%                                         (   5 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-8 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-4 aty)
%            Number of variables   :   70 (   0 sgn  21   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(ord_v0_v600,axiom,
    less(v0,v600) ).

fof(ord_v400_v600,axiom,
    less(v400,v600) ).

fof(ord_v600_v800,axiom,
    less(v600,v800) ).

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

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

fof(axis_conflict_def,axiom,
    ! [X0,X1,X2,X3] :
      ( 'axis$uconflict'(X0,X1,X2,X3)
    <=> ~ ? [X4] :
            ( 'in$uclosed'(X4,X2,X3)
            & 'in$uclosed'(X4,X0,X1) ) ) ).

fof(axis_compatible_def,axiom,
    ! [X0,X1,X2,X3] :
      ( 'axis$ucompatible'(X0,X1,X2,X3)
    <=> ? [X4] :
          ( 'in$uclosed'(X4,X2,X3)
          & 'in$uclosed'(X4,X0,X1) ) ) ).

fof(box2_overlap,axiom,
    ! [X0,X1,X2,X3,X4,X5,X6,X7] :
      ( 'box2$ucompatible'(X0,X1,X2,X3,X4,X5,X6,X7)
    <=> ( 'axis$ucompatible'(X2,X3,X6,X7)
        & 'axis$ucompatible'(X0,X1,X4,X5) ) ) ).

fof(odrl624,conjecture,
    'box2$ucompatible'(v0,v600,v0,v600,v400,v800,v400,v800) ).

fof(negated_conjecture,negated_conjecture,
    ~ 'box2$ucompatible'(v0,v600,v0,v600,v400,v800,v400,v800),
    inference(negate_conjecture,[status(cth)],[odrl624]) ).

cnf(c5,plain,
    less(v0,v600),
    inference(clausification,[status(esa)],[ord_v0_v600]) ).

cnf(c6,plain,
    less(v400,v600),
    inference(clausification,[status(esa)],[ord_v400_v600]) ).

cnf(c8,plain,
    less(v600,v800),
    inference(clausification,[status(esa)],[ord_v600_v800]) ).

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

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

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

cnf(c38,plain,
    ( ~ 'in$uclosed'(X4,X2,X3)
    | ~ 'in$uclosed'(X4,X0,X1)
    | ~ 'axis$uconflict'(X0,X1,X2,X3) ),
    inference(clausification,[status(esa)],[axis_conflict_def]) ).

cnf(c39,plain,
    ( 'in$uclosed'(sK38(X0,X1,X2,X3),X0,X1)
    | 'axis$uconflict'(X0,X1,X2,X3) ),
    inference(clausification,[status(esa)],[axis_conflict_def]) ).

cnf(c40,plain,
    ( 'in$uclosed'(sK38(X0,X1,X2,X3),X2,X3)
    | 'axis$uconflict'(X0,X1,X2,X3) ),
    inference(clausification,[status(esa)],[axis_conflict_def]) ).

cnf(c43,plain,
    ( ~ 'in$uclosed'(X4,X2,X3)
    | ~ 'in$uclosed'(X4,X0,X1)
    | 'axis$ucompatible'(X0,X1,X2,X3) ),
    inference(clausification,[status(esa)],[axis_compatible_def]) ).

cnf(c69,plain,
    ( ~ 'axis$ucompatible'(X2,X3,X6,X7)
    | ~ 'axis$ucompatible'(X0,X1,X4,X5)
    | 'box2$ucompatible'(X0,X1,X2,X3,X4,X5,X6,X7) ),
    inference(clausification,[status(esa)],[box2_overlap]) ).

cnf(c87,plain,
    ~ 'box2$ucompatible'(v0,v600,v0,v600,v400,v800,v400,v800),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    leq(v400,v600),
    inference(resolution,[status(thm)],[c19,c6]) ).

cnf(d1,plain,
    ( ~ 'axis$ucompatible'(v0,v600,v400,v800)
    | ~ 'axis$ucompatible'(v0,v600,v400,v800) ),
    inference(resolution,[status(thm)],[c69,c87]) ).

cnf(d2,plain,
    ( 'axis$uconflict'(X0,X1,X2,X3)
    | 'axis$ucompatible'(X2,X3,X4,X5)
    | ~ 'in$uclosed'(sK38(X0,X1,X2,X3),X4,X5) ),
    inference(resolution,[status(thm)],[c43,c40]) ).

cnf(d3,plain,
    ( 'axis$uconflict'(X0,X1,X2,X3)
    | 'axis$ucompatible'(X2,X3,X0,X1)
    | 'axis$uconflict'(X0,X1,X2,X3) ),
    inference(resolution,[status(thm)],[d2,c39]) ).

cnf(d4,plain,
    'axis$uconflict'(v400,v800,v0,v600),
    inference(resolution,[status(thm)],[d3,d1]) ).

cnf(d5,plain,
    ( ~ 'in$uclosed'(X0,v400,v800)
    | ~ 'in$uclosed'(X0,v0,v600) ),
    inference(resolution,[status(thm)],[d4,c38]) ).

cnf(d6,plain,
    ( ~ leq(v400,X0)
    | ~ leq(X0,v800)
    | ~ 'in$uclosed'(X0,v0,v600) ),
    inference(resolution,[status(thm)],[d5,c28]) ).

cnf(d7,plain,
    ( ~ leq(v0,X0)
    | ~ leq(X0,v600)
    | ~ leq(v400,X0)
    | ~ leq(X0,v800) ),
    inference(resolution,[status(thm)],[d6,c28]) ).

cnf(d8,plain,
    ( ~ leq(v0,v600)
    | ~ leq(v600,v800)
    | ~ leq(v600,v600) ),
    inference(resolution,[status(thm)],[d7,d0]) ).

cnf(d9,plain,
    leq(v0,v600),
    inference(resolution,[status(thm)],[c19,c5]) ).

cnf(d10,plain,
    ( ~ leq(v600,v800)
    | ~ leq(v600,v600) ),
    inference(resolution,[status(thm)],[d9,d8]) ).

cnf(d11,plain,
    leq(v600,v800),
    inference(resolution,[status(thm)],[c19,c8]) ).

cnf(d12,plain,
    ~ leq(v600,v600),
    inference(resolution,[status(thm)],[d11,d10]) ).

cnf(d13,plain,
    leq(X0,X0),
    inference(equality_resolution,[status(thm)],[c20]) ).

cnf(d14,plain,
    $false,
    inference(resolution,[status(thm)],[d13,d12]) ).

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