↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : NUM614+1 : 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 : 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:17:34 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(mDefSel,axiom,
    ! [W0,W1] :
      ( ( aElementOf0(W1,szNzAzT0)
        & aSet0(W0) )
     => ! [W2] :
          ( W2 = slbdtsldtrb0(W0,W1)
        <=> ( ! [W3] :
                ( aElementOf0(W3,W2)
              <=> ( sbrdtbr0(W3) = W1
                  & aSubsetOf0(W3,W0) ) )
            & aSet0(W2) ) ) ),
    file('theBenchmark.p',mDefSel) ).

fof(m__3533,axiom,
    ( szszuzczcdt0(xk) = xK
    & aElementOf0(xk,szNzAzT0) ),
    file('theBenchmark.p',m__3533) ).

fof(m__4891,axiom,
    ( xO = sdtlcdtrc0(xe,sdtlbdtrb0(xd,szDzizrdt0(xd)))
    & aSet0(xO) ),
    file('theBenchmark.p',m__4891) ).

fof(m__,conjecture,
    aElementOf0(xP,slbdtsldtrb0(xO,xk)),
    file('theBenchmark.p',m__) ).

fof(m___neg,negated_conjecture,
    ~ aElementOf0(xP,slbdtsldtrb0(xO,xk)),
    inference(assume_negation,[status(cth)],[m__]) ).

cnf(c_192,plain,
    ( sbrdtbr0(D) != B
    | ~ aSubsetOf0(D,A)
    | aElementOf0(D,C)
    | slbdtsldtrb0(A,B) != C
    | ~ aElementOf0(B,szNzAzT0)
    | ~ aSet0(A) ),
    inference(clausify,[status(thm)],[mDefSel]) ).

cnf(c_248,plain,
    aElementOf0(xk,szNzAzT0),
    inference(clausify,[status(thm)],[m__3533]) ).

cnf(c_287,plain,
    aSet0(xO),
    inference(clausify,[status(thm)],[m__4891]) ).

fof(m__5208,axiom,
    aSubsetOf0(xP,xO),
    file('theBenchmark.p',m__5208) ).

cnf(c_307,plain,
    aSubsetOf0(xP,xO),
    inference(clausify,[status(thm)],[m__5208]) ).

fof(m__5217,axiom,
    sbrdtbr0(xP) = xk,
    file('theBenchmark.p',m__5217) ).

cnf(c_308,plain,
    sbrdtbr0(xP) = xk,
    inference(clausify,[status(thm)],[m__5217]) ).

cnf(c_309,negated_conjecture,
    ~ aElementOf0(xP,slbdtsldtrb0(xO,xk)),
    inference(clausify,[status(thm)],[m___neg]) ).

cnf(c_1061,plain,
    ( sbrdtbr0(C) != A
    | ~ aSubsetOf0(C,xO)
    | aElementOf0(C,B)
    | slbdtsldtrb0(xO,A) != B
    | ~ aElementOf0(A,szNzAzT0) ),
    inference(resolve,[status(thm)],[c_192,c_287]) ).

cnf(c_1062,plain,
    ( sbrdtbr0(B) != xk
    | ~ aSubsetOf0(B,xO)
    | aElementOf0(B,A)
    | slbdtsldtrb0(xO,xk) != A ),
    inference(resolve,[status(thm)],[c_1061,c_248]) ).

cnf(c_1063,plain,
    ( sbrdtbr0(A) != xk
    | ~ aSubsetOf0(A,xO)
    | aElementOf0(A,slbdtsldtrb0(xO,xk)) ),
    inference(xxres,[status(thm)],[c_1062]) ).

cnf(c_1064,plain,
    ( sbrdtbr0(xP) != xk
    | aElementOf0(xP,slbdtsldtrb0(xO,xk)) ),
    inference(resolve,[status(thm)],[c_1063,c_307]) ).

cnf(c_1065,plain,
    aElementOf0(xP,slbdtsldtrb0(xO,xk)),
    inference(resolve,[status(thm)],[c_1064,c_308]) ).

cnf(c_1060,negated_conjecture,
    $false,
    inference(resolve,[status(thm)],[c_309,c_1065]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM614+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.36  % Computer : n020.cluster.edu
% 0.08/0.36  % Model    : x86_64 x86_64
% 0.08/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36  % Memory   : 8046.5625MB
% 0.08/0.36  % OS       : Linux 6.8.0-71-generic
% 0.08/0.36  % CPULimit : 300
% 0.08/0.36  % WCLimit  : 300
% 0.08/0.36  % DateTime : Sat Sep 26 03:27:48 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 0.08/0.36  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/0.36  % Process 497644 was started by sandbox on n020,
% 0.08/0.36  % Sat Sep 26 03:27:48 2026
% 0.08/0.36  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.13/0.39  
% 0.13/0.39  % From the command line: assign(max_seconds, 300).
% 0.53/0.48  
% 0.53/0.48  % SZS status Theorem for theBenchmark
% 0.53/0.48  
% 0.53/0.48  % Proof 1 at 0.07 (+ 0.02) seconds.
% 0.53/0.48  % Length of proof is 11.
% 0.53/0.48  % Level of proof is 2.
% 0.53/0.48  % Maximum clause weight is 30.000.
% 0.53/0.48  % Given clauses 204.
% 0.53/0.48  
% 0.53/0.48  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------