↑ Up

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

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

% Computer : n018.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:57:44 AM UTC 2026

% Result   : Theorem 9.95s 1.72s
% Output   : CNFRefutation 9.95s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   15 (   7 unt;   0 def)
%            Number of atoms       :   66 (  10 equ)
%            Maximal formula atoms :   12 (   4 avg)
%            Number of connectives :   75 (  24   ~;  19   |;  22   &)
%                                         (   0 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   6 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   22 (   0 sgn  12   !;   7   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(co1,conjecture,
    ! [U] :
      ( ssList(U)
     => ! [V] :
          ( ssList(V)
         => ! [W] :
              ( ssList(W)
             => ! [X] :
                  ( ssList(X)
                 => ( ! [Z] :
                        ( ssItem(Z)
                       => ( memberP(U,Z)
                          | ~ memberP(V,Z) ) )
                    | ? [Y] :
                        ( memberP(X,Y)
                        & ~ memberP(W,Y)
                        & ssItem(Y) )
                    | U != W
                    | V != X ) ) ) ) ),
    file('theBenchmark.p',co1) ).

fof(co1_neg,negated_conjecture,
    ~ ! [U] :
        ( ssList(U)
       => ! [V] :
            ( ssList(V)
           => ! [W] :
                ( ssList(W)
               => ! [X] :
                    ( ssList(X)
                   => ( ! [Z] :
                          ( ssItem(Z)
                         => ( memberP(U,Z)
                            | ~ memberP(V,Z) ) )
                      | ? [Y] :
                          ( memberP(X,Y)
                          & ~ memberP(W,Y)
                          & ssItem(Y) )
                      | U != W
                      | V != X ) ) ) ) ),
    inference(assume_negation,[status(cth)],[co1]) ).

fof(nnf_87,plain,
    ? [U] :
      ( ? [V] :
          ( ? [W] :
              ( ? [X] :
                  ( ? [Z] :
                      ( ~ memberP(U,Z)
                      & memberP(V,Z)
                      & ssItem(Z) )
                  & ! [Y] :
                      ( ~ memberP(X,Y)
                      | memberP(W,Y)
                      | ~ ssItem(Y) )
                  & W = U
                  & X = V
                  & ssList(X) )
              & ssList(W) )
          & ssList(V) )
      & ssList(U) ),
    inference(fof_nnf,[status(thm)],[co1_neg]) ).

fof(sk_co1_neg,plain,
    ( ~ memberP(sK3,sK4)
    & memberP(sK1,sK4)
    & ssItem(sK4)
    & ! [Y] :
        ( ~ memberP(sK0,Y)
        | memberP(sK2,Y)
        | ~ ssItem(Y) )
    & sK2 = sK3
    & sK0 = sK1
    & ssList(sK0)
    & ssList(sK2)
    & ssList(sK1)
    & ssList(sK3) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK1,sK2,sK0,sK4]),skolemize(U,sK3),skolemize(V,sK1),skolemize(W,sK2),skolemize(X,sK0),skolemize(Z,sK4)],[nnf_87]) ).

cnf(c_331,negated_conjecture,
    sK0 = sK1,
    inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).

cnf(c_332,negated_conjecture,
    sK2 = sK3,
    inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).

cnf(c_333,negated_conjecture,
    ( ~ memberP(sK0,A)
    | memberP(sK2,A)
    | ~ ssItem(A) ),
    inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).

cnf(c_2363,negated_conjecture,
    ( ~ memberP(sK0,A)
    | memberP(sK3,A)
    | ~ ssItem(A) ),
    inference(paramod,[status(thm)],[c_332,c_333]) ).

cnf(c_334,negated_conjecture,
    ( ~ memberP(sK1,A)
    | memberP(sK3,A)
    | ~ ssItem(A) ),
    inference(paramod,[status(thm)],[c_331,c_2363]) ).

cnf(c_335,negated_conjecture,
    ssItem(sK4),
    inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).

cnf(c_336,negated_conjecture,
    memberP(sK1,sK4),
    inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).

cnf(c_337,negated_conjecture,
    ~ memberP(sK3,sK4),
    inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).

cnf(c_2364,negated_conjecture,
    ( ~ memberP(sK1,sK4)
    | memberP(sK3,sK4) ),
    inference(resolve,[status(thm)],[c_335,c_334]) ).

cnf(c_2365,negated_conjecture,
    ~ memberP(sK1,sK4),
    inference(resolve,[status(thm)],[c_337,c_2364]) ).

cnf(c_2362,negated_conjecture,
    $false,
    inference(resolve,[status(thm)],[c_336,c_2365]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SWC411+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.42  % Computer : n018.cluster.edu
% 0.17/0.42  % Model    : x86_64 x86_64
% 0.17/0.42  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.42  % Memory   : 8046.5625MB
% 0.17/0.42  % OS       : Linux 6.8.0-71-generic
% 0.17/0.42  % CPULimit : 300
% 0.17/0.42  % WCLimit  : 300
% 0.17/0.42  % DateTime : Sat Sep 26 13:01:52 UTC 2026
% 0.17/0.42  % CPUTime  : 
% 0.17/0.42  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.17/0.42  % Process 517729 was started by sandbox on n018,
% 0.17/0.42  % Sat Sep 26 13:01:52 2026
% 0.17/0.42  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.17/0.45  
% 0.17/0.45  % From the command line: assign(max_seconds, 300).
% 9.95/1.72  
% 9.95/1.72  % SZS status Theorem for theBenchmark
% 9.95/1.72  
% 9.95/1.72  % Proof 1 at 1.06 (+ 0.08) seconds.
% 9.95/1.72  % Length of proof is 9.
% 9.95/1.72  % Level of proof is 3.
% 9.95/1.72  % Maximum clause weight is 10.000.
% 9.95/1.72  % Given clauses 162.
% 9.95/1.72  
% 9.95/1.72  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------