↑ Up

LisaST---0.9.THM-CRf.s

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

% Computer : n020.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:22:18 AM UTC 2026

% Result   : Theorem 11.29s 3.03s
% Output   : CNFRefutation 11.29s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   40 (  13 unt;   0 def)
%            Number of atoms       :  157 (  33 equ)
%            Maximal formula atoms :   36 (   3 avg)
%            Number of connectives :  184 (  67   ~;  47   |;  48   &)
%                                         (   0 <=>;  22  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :   12 (  12 usr;   8 con; 0-1 aty)
%            Number of variables   :   53 (   0 sgn  20   !;  20   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(prove,conjecture,
    ( ( ! [X16] :
          ( cyclist(X16)
         => ? [X17] :
              ( X16 = X17
              & person(X17) ) )
      & ! [X14] :
          ( grocer(X14)
         => ? [X15] :
              ( X14 = X15
              & person(X15) ) )
      & ! [X12] :
          ( ( property1(X12,honest,pos)
            & person(X12) )
         => ~ ? [X13] :
                ( X12 = X13
                & property1(X13,dishonest,pos) ) )
      & ! [X10] :
          ( ( property1(X10,healthy,pos)
            & person(X10) )
         => ~ ? [X11] :
                ( X10 = X11
                & property1(X11,unhealthy,pos) ) )
      & ! [X8] :
          ( ( property1(X8,unhealthy,pos)
            & cyclist(X8) )
         => ? [X9] :
              ( X8 = X9
              & property1(X9,dishonest,pos) ) )
      & ! [X6] :
          ( cyclist(X6)
         => ? [X7] :
              ( X6 = X7
              & property1(X7,industrious,pos) ) )
      & ! [X4] :
          ( ( property1(X4,industrious,pos)
            & grocer(X4) )
         => ? [X5] :
              ( X4 = X5
              & property1(X5,honest,pos) ) )
      & ! [X2] :
          ( grocer(X2)
         => ~ ? [X3] :
                ( X2 = X3
                & property1(X3,healthy,pos) ) )
      & ! [X0] :
          ( ( property1(X0,industrious,pos)
            & property1(X0,honest,pos)
            & person(X0) )
         => ? [X1] :
              ( X0 = X1
              & property1(X1,healthy,pos) ) ) )
   => ! [X18] :
        ( grocer(X18)
       => ~ ? [X19] :
              ( X18 = X19
              & cyclist(X19) ) ) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ( ( ! [X16] :
            ( cyclist(X16)
           => ? [X17] :
                ( X16 = X17
                & person(X17) ) )
        & ! [X14] :
            ( grocer(X14)
           => ? [X15] :
                ( X14 = X15
                & person(X15) ) )
        & ! [X12] :
            ( ( property1(X12,honest,pos)
              & person(X12) )
           => ~ ? [X13] :
                  ( X12 = X13
                  & property1(X13,dishonest,pos) ) )
        & ! [X10] :
            ( ( property1(X10,healthy,pos)
              & person(X10) )
           => ~ ? [X11] :
                  ( X10 = X11
                  & property1(X11,unhealthy,pos) ) )
        & ! [X8] :
            ( ( property1(X8,unhealthy,pos)
              & cyclist(X8) )
           => ? [X9] :
                ( X8 = X9
                & property1(X9,dishonest,pos) ) )
        & ! [X6] :
            ( cyclist(X6)
           => ? [X7] :
                ( X6 = X7
                & property1(X7,industrious,pos) ) )
        & ! [X4] :
            ( ( property1(X4,industrious,pos)
              & grocer(X4) )
           => ? [X5] :
                ( X4 = X5
                & property1(X5,honest,pos) ) )
        & ! [X2] :
            ( grocer(X2)
           => ~ ? [X3] :
                  ( X2 = X3
                  & property1(X3,healthy,pos) ) )
        & ! [X0] :
            ( ( property1(X0,industrious,pos)
              & property1(X0,honest,pos)
              & person(X0) )
           => ? [X1] :
                ( X0 = X1
                & property1(X1,healthy,pos) ) ) )
     => ! [X18] :
          ( grocer(X18)
         => ~ ? [X19] :
                ( X18 = X19
                & cyclist(X19) ) ) ),
    inference(negate_conjecture,[status(cth)],[prove]) ).

cnf(c0,plain,
    ( property1(sK1(X0),healthy,pos)
    | ~ property1(X0,industrious,pos)
    | ~ property1(X0,honest,pos)
    | ~ person(X0) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c1,plain,
    ( X0 = sK1(X0)
    | ~ property1(X0,industrious,pos)
    | ~ property1(X0,honest,pos)
    | ~ person(X0) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c2,plain,
    ( X0 != X1
    | ~ property1(X1,healthy,pos)
    | ~ grocer(X0) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c3,plain,
    ( property1(sK5(X0),honest,pos)
    | ~ property1(X0,industrious,pos)
    | ~ grocer(X0) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c4,plain,
    ( X0 = sK5(X0)
    | ~ property1(X0,industrious,pos)
    | ~ grocer(X0) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c5,plain,
    ( property1(sK7(X0),industrious,pos)
    | ~ cyclist(X0) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c6,plain,
    ( X0 = sK7(X0)
    | ~ cyclist(X0) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c11,plain,
    ( person(sK15(X0))
    | ~ grocer(X0) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c12,plain,
    ( X0 = sK15(X0)
    | ~ grocer(X0) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c15,plain,
    grocer(sK18),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c16,plain,
    cyclist(sK19),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c17,plain,
    sK18 = sK19,
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    cyclist(sK18),
    inference(demodulation,[status(thm)],[c16,c17]) ).

cnf(d1,plain,
    sK18 = sK7(sK18),
    inference(resolution,[status(thm)],[c6,d0]) ).

cnf(d2,plain,
    ( ~ cyclist(sK18)
    | property1(sK18,industrious,pos) ),
    inference(superposition,[status(thm)],[d1,c5]) ).

cnf(d3,plain,
    property1(sK18,industrious,pos),
    inference(resolution,[status(thm)],[d0,d2]) ).

cnf(d4,plain,
    ( ~ person(sK18)
    | ~ property1(sK18,honest,pos)
    | sK18 = sK1(sK18) ),
    inference(resolution,[status(thm)],[d3,c1]) ).

cnf(d5,plain,
    sK18 = sK15(sK18),
    inference(resolution,[status(thm)],[c12,c15]) ).

cnf(d6,plain,
    ( ~ grocer(sK18)
    | person(sK18) ),
    inference(superposition,[status(thm)],[d5,c11]) ).

cnf(d7,plain,
    person(sK18),
    inference(resolution,[status(thm)],[c15,d6]) ).

cnf(d8,plain,
    ( ~ property1(sK18,honest,pos)
    | sK18 = sK1(sK18) ),
    inference(resolution,[status(thm)],[d7,d4]) ).

cnf(d9,plain,
    ( ~ grocer(sK18)
    | sK18 = sK5(sK18) ),
    inference(resolution,[status(thm)],[d3,c4]) ).

cnf(d10,plain,
    sK18 = sK5(sK18),
    inference(resolution,[status(thm)],[c15,d9]) ).

cnf(d11,plain,
    ( ~ grocer(sK18)
    | ~ property1(sK18,industrious,pos)
    | property1(sK18,honest,pos) ),
    inference(superposition,[status(thm)],[d10,c3]) ).

cnf(d12,plain,
    ( ~ property1(sK18,industrious,pos)
    | property1(sK18,honest,pos) ),
    inference(resolution,[status(thm)],[c15,d11]) ).

cnf(d13,plain,
    property1(sK18,honest,pos),
    inference(resolution,[status(thm)],[d3,d12]) ).

cnf(d14,plain,
    sK18 = sK1(sK18),
    inference(resolution,[status(thm)],[d13,d8]) ).

cnf(d15,plain,
    ( ~ grocer(X0)
    | ~ property1(X0,healthy,pos) ),
    inference(equality_resolution,[status(thm)],[c2]) ).

cnf(d16,plain,
    ( ~ person(X0)
    | ~ property1(X0,industrious,pos)
    | ~ property1(X0,honest,pos)
    | ~ grocer(sK1(X0)) ),
    inference(resolution,[status(thm)],[d15,c0]) ).

cnf(d17,plain,
    ( ~ cyclist(X0)
    | ~ grocer(sK1(sK7(X0)))
    | ~ person(sK7(X0))
    | ~ property1(sK7(X0),honest,pos) ),
    inference(resolution,[status(thm)],[d16,c5]) ).

cnf(d18,plain,
    ( ~ cyclist(sK18)
    | ~ grocer(sK1(sK7(sK18)))
    | ~ person(sK7(sK18))
    | ~ property1(sK18,honest,pos) ),
    inference(superposition,[status(thm)],[d1,d17]) ).

cnf(d19,plain,
    ( ~ cyclist(sK18)
    | ~ grocer(sK1(sK7(sK18)))
    | ~ person(sK18)
    | ~ property1(sK18,honest,pos) ),
    inference(demodulation,[status(thm)],[d18,d1]) ).

cnf(d20,plain,
    ( ~ cyclist(sK18)
    | ~ grocer(sK1(sK18))
    | ~ person(sK18)
    | ~ property1(sK18,honest,pos) ),
    inference(demodulation,[status(thm)],[d19,d1]) ).

cnf(d21,plain,
    ( ~ cyclist(sK18)
    | ~ grocer(sK18)
    | ~ person(sK18)
    | ~ property1(sK18,honest,pos) ),
    inference(demodulation,[status(thm)],[d20,d14]) ).

cnf(d22,plain,
    ( ~ cyclist(sK18)
    | ~ person(sK18)
    | ~ property1(sK18,honest,pos) ),
    inference(resolution,[status(thm)],[c15,d21]) ).

cnf(d23,plain,
    ( ~ person(sK18)
    | ~ property1(sK18,honest,pos) ),
    inference(resolution,[status(thm)],[d0,d22]) ).

cnf(d24,plain,
    ~ property1(sK18,honest,pos),
    inference(resolution,[status(thm)],[d7,d23]) ).

cnf(d25,plain,
    $false,
    inference(resolution,[status(thm)],[d13,d24]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : PUZ129+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.33  % Computer : n020.cluster.edu
% 0.09/0.33  % Model    : x86_64 x86_64
% 0.09/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.33  % Memory   : 8046.5625MB
% 0.09/0.33  % OS       : Linux 6.8.0-71-generic
% 0.09/0.33  % CPULimit : 300
% 0.09/0.33  % WCLimit  : 300
% 0.09/0.33  % DateTime : Sat Sep 26 05:18:49 UTC 2026
% 0.09/0.34  % CPUTime  : 
% 0.09/0.34  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 11.29/3.03  % SZS status Theorem for theBenchmark.p
% 11.29/3.03  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------