↑ Up

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

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

% Computer : n006.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 09:37:50 AM UTC 2026

% Result   : Theorem 0.10s 0.38s
% Output   : CNFRefutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   10 (   3 unt;   0 def)
%            Number of atoms       :   23 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   27 (  14   ~;   8   |;   3   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   6 con; 0-0 aty)
%            Number of variables   :   45 (   9 sgn  24   !;  12   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(kalish250,conjecture,
    ( ! [X,Y,Z] : f(X,Y,Z)
  <=> ~ ? [U,V,W] : ~ f(U,V,W) ),
    file('theBenchmark.p',kalish250) ).

fof(kalish250_neg,negated_conjecture,
    ~ ( ! [X,Y,Z] : f(X,Y,Z)
    <=> ~ ? [U,V,W] : ~ f(U,V,W) ),
    inference(assume_negation,[status(cth)],[kalish250]) ).

fof(nnf_1,plain,
    ( ( ? [U,V,W] : ~ f(U,V,W)
      | ? [X,Y,Z] : ~ f(X,Y,Z) )
    & ( ! [X3,X4,X5] : f(X3,X4,X5)
      | ! [X0,X1,X2] : f(X0,X1,X2) ) ),
    inference(fof_nnf,[status(thm)],[kalish250_neg]) ).

fof(sk_kalish250_neg_sk,plain,
    ( ( ~ f(sK3,sK4,sK5)
      | ~ f(sK0,sK1,sK2) )
    & ( ! [X3,X4,X5] : f(X3,X4,X5)
      | ! [X0,X1,X2] : f(X0,X1,X2) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5]),skolemize(X,sK0),skolemize(Y,sK1),skolemize(Z,sK2),skolemize(U,sK3),skolemize(V,sK4),skolemize(W,sK5)],[nnf_1]) ).

fof(sk_kalish250_neg,plain,
    ( ( ~ f(sK3,sK4,sK5)
      | ~ f(sK0,sK1,sK2) )
    & ! [VAR_0,VAR_1,VAR_2,VAR_3,VAR_4,VAR_5] :
        ( f(VAR_3,VAR_4,VAR_5)
        | f(VAR_0,VAR_1,VAR_2) ) ),
    inference(cnf_transformation,[status(thm)],[sk_kalish250_neg_sk]) ).

cnf(c_2,negated_conjecture,
    ( f(D,E,F)
    | f(A,B,C) ),
    inference(split_conjunct,[status(thm)],[sk_kalish250_neg]) ).

cnf(c_3,negated_conjecture,
    ( ~ f(sK3,sK4,sK5)
    | ~ f(sK0,sK1,sK2) ),
    inference(split_conjunct,[status(thm)],[sk_kalish250_neg]) ).

cnf(c_4,plain,
    f(A,B,C),
    inference(factor,[status(thm)],[c_2]) ).

cnf(c_6,negated_conjecture,
    ~ f(sK3,sK4,sK5),
    inference(resolve,[status(thm)],[c_4,c_3]) ).

cnf(c_5,negated_conjecture,
    $false,
    inference(resolve,[status(thm)],[c_4,c_6]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN411+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.36  % Computer : n006.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % 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 17:41:26 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 1805481 was started by sandbox on n006,
% 0.10/0.37  % Sat Sep 26 17:41:26 2026
% 0.10/0.37  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.10/0.37  
% 0.10/0.37  % From the command line: assign(max_seconds, 300).
% 0.10/0.38  
% 0.10/0.38  % SZS status Theorem for theBenchmark
% 0.10/0.38  
% 0.10/0.38  % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.10/0.38  % Length of proof is 5.
% 0.10/0.38  % Level of proof is 3.
% 0.10/0.38  % Maximum clause weight is 8.000.
% 0.10/0.38  % Given clauses 0.
% 0.10/0.38  
% 0.10/0.38  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------