↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : RNG089+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 : n003.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:26:36 AM UTC 2026

% Result   : Theorem 0.12s 0.41s
% Output   : CNFRefutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   21 (   9 unt;   0 def)
%            Number of atoms       :   44 (   1 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   36 (  13   ~;  10   |;   9   &)
%                                         (   1 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   7 con; 0-2 aty)
%            Number of variables   :   13 (   0 sgn   4   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(mDefIdeal,axiom,
    ! [W0] :
      ( aIdeal0(W0)
    <=> ( ! [W1] :
            ( aElementOf0(W1,W0)
           => ( ! [W2] :
                  ( aElement0(W2)
                 => aElementOf0(sdtasdt0(W2,W1),W0) )
              & ! [W2] :
                  ( aElementOf0(W2,W0)
                 => aElementOf0(sdtpldt0(W1,W2),W0) ) ) )
        & aSet0(W0) ) ),
    file('theBenchmark.p',mDefIdeal) ).

fof(m__870,axiom,
    ( aIdeal0(xJ)
    & aIdeal0(xI) ),
    file('theBenchmark.p',m__870) ).

fof(m__901,axiom,
    ( aElement0(xz)
    & aElementOf0(xy,sdtpldt1(xI,xJ))
    & aElementOf0(xx,sdtpldt1(xI,xJ)) ),
    file('theBenchmark.p',m__901) ).

fof(m__934,axiom,
    ( xx = sdtpldt0(xk,xl)
    & aElementOf0(xl,xJ)
    & aElementOf0(xk,xI) ),
    file('theBenchmark.p',m__934) ).

fof(m__,conjecture,
    ( aElementOf0(sdtasdt0(xz,xl),xJ)
    & aElementOf0(sdtasdt0(xz,xk),xI) ),
    file('theBenchmark.p',m__) ).

fof(m___neg,negated_conjecture,
    ~ ( aElementOf0(sdtasdt0(xz,xl),xJ)
      & aElementOf0(sdtasdt0(xz,xk),xI) ),
    inference(assume_negation,[status(cth)],[m__]) ).

cnf(c_29,plain,
    ( aElementOf0(sdtasdt0(C,B),A)
    | ~ aElement0(C)
    | ~ aElementOf0(B,A)
    | ~ aIdeal0(A) ),
    inference(clausify,[status(thm)],[mDefIdeal]) ).

cnf(c_36,plain,
    aIdeal0(xI),
    inference(clausify,[status(thm)],[m__870]) ).

cnf(c_37,plain,
    aIdeal0(xJ),
    inference(clausify,[status(thm)],[m__870]) ).

cnf(c_40,plain,
    ( aElementOf0(sdtasdt0(B,A),xJ)
    | ~ aElement0(B)
    | ~ aElementOf0(A,xJ) ),
    inference(resolve,[status(thm)],[c_37,c_29]) ).

cnf(c_43,plain,
    ( aElementOf0(sdtasdt0(B,A),xI)
    | ~ aElement0(B)
    | ~ aElementOf0(A,xI) ),
    inference(resolve,[status(thm)],[c_36,c_29]) ).

cnf(c_54,negated_conjecture,
    ( ~ aElementOf0(sdtasdt0(xz,xl),xJ)
    | ~ aElementOf0(sdtasdt0(xz,xk),xI) ),
    inference(clausify,[status(thm)],[m___neg]) ).

cnf(c_61,plain,
    aElementOf0(xl,xJ),
    inference(clausify,[status(thm)],[m__934]) ).

cnf(c_62,plain,
    aElementOf0(xk,xI),
    inference(clausify,[status(thm)],[m__934]) ).

cnf(c_63,plain,
    aElement0(xz),
    inference(clausify,[status(thm)],[m__901]) ).

cnf(c_374,plain,
    ( aElementOf0(sdtasdt0(A,xk),xI)
    | ~ aElement0(A) ),
    inference(resolve,[status(thm)],[c_43,c_62]) ).

cnf(c_367,plain,
    aElementOf0(sdtasdt0(xz,xk),xI),
    inference(resolve,[status(thm)],[c_374,c_63]) ).

cnf(c_375,plain,
    ( aElementOf0(sdtasdt0(A,xl),xJ)
    | ~ aElement0(A) ),
    inference(resolve,[status(thm)],[c_40,c_61]) ).

cnf(c_370,plain,
    aElementOf0(sdtasdt0(xz,xl),xJ),
    inference(resolve,[status(thm)],[c_375,c_63]) ).

cnf(c_376,negated_conjecture,
    ~ aElementOf0(sdtasdt0(xz,xl),xJ),
    inference(resolve,[status(thm)],[c_367,c_54]) ).

cnf(c_373,negated_conjecture,
    $false,
    inference(resolve,[status(thm)],[c_370,c_376]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : RNG089+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.09/0.34  % Computer : n003.cluster.edu
% 0.09/0.34  % Model    : x86_64 x86_64
% 0.09/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.34  % Memory   : 8046.5625MB
% 0.09/0.34  % OS       : Linux 6.8.0-71-generic
% 0.09/0.34  % CPULimit : 300
% 0.09/0.34  % WCLimit  : 300
% 0.09/0.34  % DateTime : Sat Sep 26 06:03:24 UTC 2026
% 0.09/0.35  % CPUTime  : 
% 0.09/0.35  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.35  % Process 2190411 was started by sandbox on n003,
% 0.09/0.35  % Sat Sep 26 06:03:24 2026
% 0.09/0.35  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.09/0.36  
% 0.09/0.36  % From the command line: assign(max_seconds, 300).
% 0.12/0.41  
% 0.12/0.41  % SZS status Theorem for theBenchmark
% 0.12/0.41  
% 0.12/0.41  % Proof 1 at 0.03 (+ 0.02) seconds.
% 0.12/0.41  % Length of proof is 17.
% 0.12/0.41  % Level of proof is 4.
% 0.12/0.41  % Maximum clause weight is 20.000.
% 0.12/0.41  % Given clauses 26.
% 0.12/0.41  
% 0.12/0.41  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------