↑ Up

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

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

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

% Comments : 
%------------------------------------------------------------------------------
fof(pel18,conjecture,
    ? [Y] :
    ! [X] :
      ( big_f(Y)
     => big_f(X) ),
    file('theBenchmark.p',pel18) ).

fof(pel18_neg,negated_conjecture,
    ~ ? [Y] :
      ! [X] :
        ( big_f(Y)
       => big_f(X) ),
    inference(assume_negation,[status(cth)],[pel18]) ).

fof(nnf_1,plain,
    ! [Y] :
    ? [X] :
      ( ~ big_f(X)
      & big_f(Y) ),
    inference(fof_nnf,[status(thm)],[pel18_neg]) ).

fof(sk_pel18_neg,plain,
    ! [Y] :
      ( ~ big_f(sK0(Y))
      & big_f(Y) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X,sK0(Y))],[nnf_1]) ).

cnf(c_2,negated_conjecture,
    ~ big_f(sK0(A)),
    inference(split_conjunct,[status(thm)],[sk_pel18_neg]) ).

cnf(c_3,negated_conjecture,
    big_f(A),
    inference(split_conjunct,[status(thm)],[sk_pel18_neg]) ).

cnf(c_4,negated_conjecture,
    $false,
    inference(resolve,[status(thm)],[c_2,c_3]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN048+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.08/0.35  % Computer : n026.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Sat Sep 26 17:08:56 UTC 2026
% 0.13/0.35  % CPUTime  : 
% 0.13/0.36  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.13/0.36  % Process 1524730 was started by sandbox on n026,
% 0.13/0.36  % Sat Sep 26 17:08:56 2026
% 0.13/0.36  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.13/0.36  
% 0.13/0.36  % From the command line: assign(max_seconds, 300).
% 0.13/0.36  
% 0.13/0.36  % SZS status Theorem for theBenchmark
% 0.13/0.36  
% 0.13/0.36  % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.13/0.36  % Length of proof is 4.
% 0.13/0.36  % Level of proof is 2.
% 0.13/0.36  % Maximum clause weight is 0.000.
% 0.13/0.36  % Given clauses 0.
% 0.13/0.36  
% 0.13/0.36  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------