↑ Up

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

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

% Computer : n013.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:36:52 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(pel23,conjecture,
    ( ! [X] :
        ( big_f(X)
        | p )
  <=> ( ! [X1] : big_f(X1)
      | p ) ),
    file('theBenchmark.p',pel23) ).

fof(pel23_neg,negated_conjecture,
    ~ ( ! [X] :
          ( big_f(X)
          | p )
    <=> ( ! [X1] : big_f(X1)
        | p ) ),
    inference(assume_negation,[status(cth)],[pel23]) ).

fof(nnf_1,plain,
    ( ( ( ? [X1] : ~ big_f(X1)
        & ~ p )
      | ? [X] :
          ( ~ big_f(X)
          & ~ p ) )
    & ( ! [X2] : big_f(X2)
      | p
      | ! [X0] :
          ( big_f(X0)
          | p ) ) ),
    inference(fof_nnf,[status(thm)],[pel23_neg]) ).

fof(sk_pel23_neg_sk,plain,
    ( ( ( ~ big_f(sK1)
        & ~ p )
      | ( ~ big_f(sK0)
        & ~ p ) )
    & ( ! [X2] : big_f(X2)
      | p
      | ! [X0] :
          ( big_f(X0)
          | p ) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X,sK0),skolemize(X1,sK1)],[nnf_1]) ).

fof(sk_pel23_neg,plain,
    ( ( ~ big_f(sK1)
      | ~ big_f(sK0) )
    & ~ p
    & ! [VAR_0,VAR_1] :
        ( big_f(VAR_1)
        | big_f(VAR_0)
        | p ) ),
    inference(cnf_transformation,[status(thm)],[sk_pel23_neg_sk]) ).

cnf(c_2,negated_conjecture,
    ( big_f(B)
    | big_f(A)
    | p ),
    inference(split_conjunct,[status(thm)],[sk_pel23_neg]) ).

cnf(c_3,negated_conjecture,
    ~ p,
    inference(split_conjunct,[status(thm)],[sk_pel23_neg]) ).

cnf(c_4,negated_conjecture,
    ( ~ big_f(sK1)
    | ~ big_f(sK0) ),
    inference(split_conjunct,[status(thm)],[sk_pel23_neg]) ).

cnf(c_7,plain,
    ( big_f(A)
    | p ),
    inference(factor,[status(thm)],[c_2]) ).

cnf(c_5,negated_conjecture,
    big_f(A),
    inference(resolve,[status(thm)],[c_3,c_7]) ).

cnf(c_8,negated_conjecture,
    ~ big_f(sK1),
    inference(resolve,[status(thm)],[c_5,c_4]) ).

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

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