↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : SET876+1 : TPTP v9.3.1. Released v3.2.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:37:12 AM UTC 2026

% Result   : Theorem 0.09s 0.39s
% Output   : CNFRefutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   15 (   6 unt;   0 def)
%            Number of atoms       :   26 (  11 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   26 (  15   ~;   4   |;   2   &)
%                                         (   2 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-1 aty)
%            Number of variables   :   18 (   0 sgn   9   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(d1_tarski,axiom,
    ! [A,B] :
      ( B = singleton(A)
    <=> ! [C] :
          ( in(C,B)
        <=> C = A ) ),
    file('theBenchmark.p',d1_tarski) ).

fof(l28_zfmisc_1,axiom,
    ! [A,B] :
      ( ~ in(A,B)
     => disjoint(singleton(A),B) ),
    file('theBenchmark.p',l28_zfmisc_1) ).

fof(t17_zfmisc_1,conjecture,
    ! [A,B] :
      ( A != B
     => disjoint(singleton(A),singleton(B)) ),
    file('theBenchmark.p',t17_zfmisc_1) ).

fof(t17_zfmisc_1_neg,negated_conjecture,
    ~ ! [A,B] :
        ( A != B
       => disjoint(singleton(A),singleton(B)) ),
    inference(assume_negation,[status(cth)],[t17_zfmisc_1]) ).

cnf(c_9,plain,
    ( C = A
    | ~ in(C,B)
    | singleton(A) != B ),
    inference(clausify,[status(thm)],[d1_tarski]) ).

cnf(c_13,plain,
    ( disjoint(singleton(A),B)
    | in(A,B) ),
    inference(clausify,[status(thm)],[l28_zfmisc_1]) ).

fof(nnf_7,plain,
    ? [A,B] :
      ( ~ disjoint(singleton(A),singleton(B))
      & B != A ),
    inference(fof_nnf,[status(thm)],[t17_zfmisc_1_neg]) ).

fof(sk_t17_zfmisc_1_neg,plain,
    ( ~ disjoint(singleton(sK1),singleton(sK0))
    & sK0 != sK1 ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(A,sK1),skolemize(B,sK0)],[nnf_7]) ).

cnf(c_17,negated_conjecture,
    sK0 != sK1,
    inference(split_conjunct,[status(thm)],[sk_t17_zfmisc_1_neg]) ).

cnf(c_18,negated_conjecture,
    ~ disjoint(singleton(sK1),singleton(sK0)),
    inference(split_conjunct,[status(thm)],[sk_t17_zfmisc_1_neg]) ).

cnf(c_29,plain,
    ( A = B
    | ~ in(A,singleton(B)) ),
    inference(xxres,[status(thm)],[c_9]) ).

cnf(c_30,negated_conjecture,
    sK1 != sK0,
    inference(copy,[status(thm)],[c_17]) ).

cnf(c_27,negated_conjecture,
    ~ in(sK1,singleton(sK0)),
    inference(resolve,[status(thm)],[c_29,c_30]) ).

cnf(c_31,negated_conjecture,
    in(sK1,singleton(sK0)),
    inference(resolve,[status(thm)],[c_18,c_13]) ).

cnf(c_28,negated_conjecture,
    $false,
    inference(resolve,[status(thm)],[c_27,c_31]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET876+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.37  % Computer : n007.cluster.edu
% 0.09/0.37  % Model    : x86_64 x86_64
% 0.09/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37  % Memory   : 8046.5625MB
% 0.09/0.37  % OS       : Linux 6.8.0-71-generic
% 0.09/0.37  % CPULimit : 300
% 0.09/0.37  % WCLimit  : 300
% 0.09/0.37  % DateTime : Sat Sep 26 08:21:38 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.37  % Process 3284996 was started by sandbox on n007,
% 0.09/0.37  % Sat Sep 26 08:21:38 2026
% 0.09/0.37  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.09/0.38  
% 0.09/0.38  % From the command line: assign(max_seconds, 300).
% 0.09/0.39  
% 0.09/0.39  % SZS status Theorem for theBenchmark
% 0.09/0.39  
% 0.09/0.39  % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.09/0.39  % Length of proof is 9.
% 0.09/0.39  % Level of proof is 3.
% 0.09/0.39  % Maximum clause weight is 10.000.
% 0.09/0.39  % Given clauses 11.
% 0.09/0.39  
% 0.09/0.39  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------