↑ Up

Prover9---2026-6A.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : LAT388+4 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n004.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 07:50:31 AM UTC 2026

% Result   : Theorem 0.10s 0.40s
% Output   : CNFRefutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   11 (   7 unt;   0 def)
%            Number of atoms       :   51 (   6 equ)
%            Maximal formula atoms :   12 (   4 avg)
%            Number of connectives :   43 (   3   ~;   6   |;  23   &)
%                                         (   0 <=>;  11  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   14 (   2 sgn  10   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(m__1144,axiom,
    ( xS = cS1142(xf)
    & ! [W0] :
        ( ( ( aFixedPointOf0(W0,xf)
            | ( sdtlpdtrp0(xf,W0) = W0
              & aElementOf0(W0,szDzozmdt0(xf)) ) )
         => aElementOf0(W0,xS) )
        & ( aElementOf0(W0,xS)
         => ( aFixedPointOf0(W0,xf)
            & sdtlpdtrp0(xf,W0) = W0
            & aElementOf0(W0,szDzozmdt0(xf)) ) ) )
    & aSet0(xS) ),
    file('theBenchmark.p',m__1144) ).

fof(m__1330,axiom,
    ( aSupremumOfIn0(xp,xT,xS)
    & ! [W0] :
        ( ( aUpperBoundOfIn0(W0,xT,xS)
          | ( ! [W1] :
                ( aElementOf0(W1,xT)
               => sdtlseqdt0(W1,W0) )
            & aElementOf0(W0,xS) ) )
       => sdtlseqdt0(xp,W0) )
    & aUpperBoundOfIn0(xp,xT,xS)
    & ! [W0] :
        ( aElementOf0(W0,xT)
       => sdtlseqdt0(W0,xp) )
    & aFixedPointOf0(xp,xf)
    & sdtlpdtrp0(xf,xp) = xp
    & aElementOf0(xp,szDzozmdt0(xf)) ),
    file('theBenchmark.p',m__1330) ).

fof(m__,conjecture,
    ? [W0] :
      ( aSupremumOfIn0(W0,xT,xS)
      | ( ! [W1] :
            ( ( aUpperBoundOfIn0(W1,xT,xS)
              & ! [W2] :
                  ( aElementOf0(W2,xT)
                 => sdtlseqdt0(W2,W1) )
              & aElementOf0(W1,xS) )
           => sdtlseqdt0(W0,W1) )
        & ( aUpperBoundOfIn0(W0,xT,xS)
          | ( ! [W1] :
                ( aElementOf0(W1,xT)
               => sdtlseqdt0(W1,W0) )
            & aElementOf0(W0,xS) ) )
        & aElementOf0(W0,xS) ) ),
    file('theBenchmark.p',m__) ).

fof(m___neg,negated_conjecture,
    ~ ? [W0] :
        ( aSupremumOfIn0(W0,xT,xS)
        | ( ! [W1] :
              ( ( aUpperBoundOfIn0(W1,xT,xS)
                & ! [W2] :
                    ( aElementOf0(W2,xT)
                   => sdtlseqdt0(W2,W1) )
                & aElementOf0(W1,xS) )
             => sdtlseqdt0(W0,W1) )
          & ( aUpperBoundOfIn0(W0,xT,xS)
            | ( ! [W1] :
                  ( aElementOf0(W1,xT)
                 => sdtlseqdt0(W1,W0) )
              & aElementOf0(W0,xS) ) )
          & aElementOf0(W0,xS) ) ),
    inference(assume_negation,[status(cth)],[m__]) ).

cnf(c_145,plain,
    cS1142(xf) = xS,
    inference(clausify,[status(thm)],[m__1144]) ).

cnf(c_146,plain,
    xS = cS1142(xf),
    inference(copy,[status(thm)],[c_145]) ).

cnf(c_184,plain,
    aSupremumOfIn0(xp,xT,xS),
    inference(clausify,[status(thm)],[m__1330]) ).

cnf(c_185,plain,
    aSupremumOfIn0(xp,xT,cS1142(xf)),
    inference(paramod,[status(thm)],[c_146,c_184]) ).

cnf(c_210,negated_conjecture,
    ~ aSupremumOfIn0(A,xT,xS),
    inference(clausify,[status(thm)],[m___neg]) ).

cnf(c_211,negated_conjecture,
    ~ aSupremumOfIn0(A,xT,cS1142(xf)),
    inference(paramod,[status(thm)],[c_146,c_210]) ).

cnf(c_212,plain,
    $false,
    inference(resolve,[status(thm)],[c_211,c_185]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LAT388+4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.36  % Computer : n004.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Fri Sep 25 21:39:22 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.37  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.37  % Process 20746 was started by sandbox on n004,
% 0.10/0.37  % Fri Sep 25 21:39:22 2026
% 0.10/0.37  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.10/0.38  
% 0.10/0.38  % From the command line: assign(max_seconds, 300).
% 0.10/0.40  
% 0.10/0.40  % SZS status Theorem for theBenchmark
% 0.10/0.40  
% 0.10/0.40  % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.10/0.40  % Length of proof is 10.
% 0.10/0.40  % Level of proof is 4.
% 0.10/0.40  % Maximum clause weight is 15.000.
% 0.10/0.40  % Given clauses 0.
% 0.10/0.40  
% 0.10/0.40  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------