↑ Up

LisaST---0.9.THM-CRf.s

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

% Computer : n015.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:19 AM UTC 2026

% Result   : Theorem 14.97s 2.43s
% Output   : CNFRefutation 14.97s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   24 (   8 unt;   0 def)
%            Number of atoms       :   57 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   64 (  31   ~;  19   |;  12   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    7 (   6 usr;   1 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   22 (   1 sgn   6   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(mp_not_high_and_low,axiom,
    ! [X0,X1] :
      ~ ( 'number$uof$uroutines'(X0,X1,high)
        & 'number$uof$uroutines'(X0,X1,low) ) ).

fof(a14,hypothesis,
    ! [X0,X1] :
      ( ( 'founding$utime'(X0,X1)
        & 'efficient$uproducer'(X0)
        & 'organisation$uat$utime'(X0,X1) )
     => 'has$uelaborated$uroutines'(X0,X1) ) ).

fof(a15,hypothesis,
    ! [X0,X1] :
      ( ( 'founding$utime'(X0,X1)
        & 'first$umover'(X0)
        & 'organisation$uat$utime'(X0,X1) )
     => 'number$uof$uroutines'(X0,X1,low) ) ).

fof(a16,hypothesis,
    ? [X0,X1] :
      ( ~ 'has$uelaborated$uroutines'(X0,X1)
      & 'number$uof$uroutines'(X0,X1,high)
      & 'founding$utime'(X0,X1)
      & 'organisation$uat$utime'(X0,X1) ) ).

fof(prove_t10,conjecture,
    ? [X0,X1] :
      ( ~ 'efficient$uproducer'(X0)
      & ~ 'first$umover'(X0)
      & 'organisation$uat$utime'(X0,X1) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ? [X0,X1] :
        ( ~ 'efficient$uproducer'(X0)
        & ~ 'first$umover'(X0)
        & 'organisation$uat$utime'(X0,X1) ),
    inference(negate_conjecture,[status(cth)],[prove_t10]) ).

cnf(c0,plain,
    ( ~ 'number$uof$uroutines'(X0,X1,high)
    | ~ 'number$uof$uroutines'(X0,X1,low) ),
    inference(clausification,[status(esa)],[mp_not_high_and_low]) ).

cnf(c1,plain,
    ( 'has$uelaborated$uroutines'(X0,X1)
    | ~ 'founding$utime'(X0,X1)
    | ~ 'efficient$uproducer'(X0)
    | ~ 'organisation$uat$utime'(X0,X1) ),
    inference(clausification,[status(esa)],[a14]) ).

cnf(c2,plain,
    ( 'number$uof$uroutines'(X0,X1,low)
    | ~ 'founding$utime'(X0,X1)
    | ~ 'first$umover'(X0)
    | ~ 'organisation$uat$utime'(X0,X1) ),
    inference(clausification,[status(esa)],[a15]) ).

cnf(c3,plain,
    'organisation$uat$utime'(sK6,sK7),
    inference(clausification,[status(esa)],[a16]) ).

cnf(c4,plain,
    'founding$utime'(sK6,sK7),
    inference(clausification,[status(esa)],[a16]) ).

cnf(c5,plain,
    'number$uof$uroutines'(sK6,sK7,high),
    inference(clausification,[status(esa)],[a16]) ).

cnf(c6,plain,
    ~ 'has$uelaborated$uroutines'(sK6,sK7),
    inference(clausification,[status(esa)],[a16]) ).

cnf(c7,plain,
    ( 'efficient$uproducer'(X0)
    | 'first$umover'(X0)
    | ~ 'organisation$uat$utime'(X0,X1) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ( ~ 'number$uof$uroutines'(X0,X1,high)
    | ~ 'first$umover'(X0)
    | ~ 'organisation$uat$utime'(X0,X1)
    | ~ 'founding$utime'(X0,X1) ),
    inference(resolution,[status(thm)],[c2,c0]) ).

cnf(d1,plain,
    ( ~ 'first$umover'(sK6)
    | ~ 'organisation$uat$utime'(sK6,sK7)
    | ~ 'founding$utime'(sK6,sK7) ),
    inference(resolution,[status(thm)],[d0,c5]) ).

cnf(d2,plain,
    ( ~ 'first$umover'(sK6)
    | ~ 'founding$utime'(sK6,sK7) ),
    inference(resolution,[status(thm)],[c3,d1]) ).

cnf(d3,plain,
    ~ 'first$umover'(sK6),
    inference(resolution,[status(thm)],[c4,d2]) ).

cnf(d4,plain,
    ( 'first$umover'(sK6)
    | 'efficient$uproducer'(sK6) ),
    inference(resolution,[status(thm)],[c3,c7]) ).

cnf(d5,plain,
    ( 'has$uelaborated$uroutines'(sK6,sK7)
    | ~ 'efficient$uproducer'(sK6)
    | ~ 'founding$utime'(sK6,sK7) ),
    inference(resolution,[status(thm)],[c1,c3]) ).

cnf(d6,plain,
    ( 'has$uelaborated$uroutines'(sK6,sK7)
    | ~ 'efficient$uproducer'(sK6) ),
    inference(resolution,[status(thm)],[c4,d5]) ).

cnf(d7,plain,
    ~ 'efficient$uproducer'(sK6),
    inference(resolution,[status(thm)],[c6,d6]) ).

cnf(d8,plain,
    'first$umover'(sK6),
    inference(resolution,[status(thm)],[d7,d4]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : MGT041+2 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.07  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.44  % Computer : n015.cluster.edu
% 0.19/0.44  % Model    : x86_64 x86_64
% 0.19/0.44  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.44  % Memory   : 8046.5625MB
% 0.19/0.44  % OS       : Linux 6.8.0-71-generic
% 0.19/0.44  % CPULimit : 300
% 0.19/0.44  % WCLimit  : 300
% 0.19/0.44  % DateTime : Sat Sep 26 00:12:12 UTC 2026
% 0.19/0.44  % CPUTime  : 
% 0.19/0.44  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 14.97/2.43  % SZS status Theorem for theBenchmark.p
% 14.97/2.43  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------