↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : RNG101+2 : 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 : n007.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:38 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(m__1933,axiom,
    ( aElement0(xz)
    & aElementOf0(xy,slsdtgt0(xc))
    & ? [W0] :
        ( sdtasdt0(xc,W0) = xy
        & aElement0(W0) )
    & aElementOf0(xx,slsdtgt0(xc))
    & ? [W0] :
        ( sdtasdt0(xc,W0) = xx
        & aElement0(W0) ) ),
    file('theBenchmark.p',m__1933) ).

fof(m__,conjecture,
    ? [W0] :
      ( sdtasdt0(xc,W0) = xx
      & aElement0(W0) ),
    file('theBenchmark.p',m__) ).

fof(m___neg,negated_conjecture,
    ~ ? [W0] :
        ( sdtasdt0(xc,W0) = xx
        & aElement0(W0) ),
    inference(assume_negation,[status(cth)],[m__]) ).

cnf(c_65,negated_conjecture,
    ( sdtasdt0(xc,A) != xx
    | ~ aElement0(A) ),
    inference(clausify,[status(thm)],[m___neg]) ).

fof(nnf_35,plain,
    ( aElement0(xz)
    & aElementOf0(xy,slsdtgt0(xc))
    & ? [W0] :
        ( sdtasdt0(xc,W0) = xy
        & aElement0(W0) )
    & aElementOf0(xx,slsdtgt0(xc))
    & ? [X0] :
        ( sdtasdt0(xc,X0) = xx
        & aElement0(X0) ) ),
    inference(fof_nnf,[status(thm)],[m__1933]) ).

fof(sk_m__1933,plain,
    ( aElement0(xz)
    & aElementOf0(xy,slsdtgt0(xc))
    & sdtasdt0(xc,sK1) = xy
    & aElement0(sK1)
    & aElementOf0(xx,slsdtgt0(xc))
    & sdtasdt0(xc,sK0) = xx
    & aElement0(sK0) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(W0,sK1)],[nnf_35]) ).

cnf(c_71,plain,
    sdtasdt0(xc,sK0) = xx,
    inference(split_conjunct,[status(thm)],[sk_m__1933]) ).

cnf(c_72,plain,
    xx = sdtasdt0(xc,sK0),
    inference(copy,[status(thm)],[c_71]) ).

cnf(c_73,plain,
    aElement0(sK0),
    inference(split_conjunct,[status(thm)],[sk_m__1933]) ).

cnf(c_256,plain,
    sdtasdt0(xc,sK0) = xx,
    inference(copy,[status(thm)],[c_72]) ).

cnf(c_257,negated_conjecture,
    ~ aElement0(sK0),
    inference(resolve,[status(thm)],[c_65,c_256]) ).

cnf(c_255,negated_conjecture,
    $false,
    inference(resolve,[status(thm)],[c_73,c_257]) ).

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