↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : SYN054+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 : n020.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.15s 0.44s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   21 (   3 unt;   0 def)
%            Number of atoms       :   44 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   36 (  13   ~;  17   |;   3   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-1 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   15 (   1 sgn   2   !;   7   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(pel24_1,axiom,
    ~ ? [X] :
        ( big_q(X)
        & big_s(X) ),
    file('theBenchmark.p',pel24_1) ).

fof(pel24_2,axiom,
    ! [X] :
      ( big_p(X)
     => ( big_r(X)
        | big_q(X) ) ),
    file('theBenchmark.p',pel24_2) ).

fof(pel24_3,axiom,
    ( ~ ? [X] : big_p(X)
   => ? [Y] : big_q(Y) ),
    file('theBenchmark.p',pel24_3) ).

fof(pel24_4,axiom,
    ! [X] :
      ( ( big_r(X)
        | big_q(X) )
     => big_s(X) ),
    file('theBenchmark.p',pel24_4) ).

fof(pel24,conjecture,
    ? [X] :
      ( big_r(X)
      & big_p(X) ),
    file('theBenchmark.p',pel24) ).

fof(pel24_neg,negated_conjecture,
    ~ ? [X] :
        ( big_r(X)
        & big_p(X) ),
    inference(assume_negation,[status(cth)],[pel24]) ).

cnf(c_6,plain,
    ( big_s(A)
    | ~ big_q(A) ),
    inference(clausify,[status(thm)],[pel24_4]) ).

cnf(c_7,plain,
    ( ~ big_q(A)
    | ~ big_s(A) ),
    inference(clausify,[status(thm)],[pel24_1]) ).

fof(nnf_3,plain,
    ( ? [Y] : big_q(Y)
    | ? [X] : big_p(X) ),
    inference(fof_nnf,[status(thm)],[pel24_3]) ).

fof(sk_pel24_3,plain,
    ( big_q(sK1)
    | big_p(sK0) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X,sK0),skolemize(Y,sK1)],[nnf_3]) ).

cnf(c_9,plain,
    ( big_q(sK1)
    | big_p(sK0) ),
    inference(split_conjunct,[status(thm)],[sk_pel24_3]) ).

cnf(c_10,negated_conjecture,
    ( ~ big_r(A)
    | ~ big_p(A) ),
    inference(clausify,[status(thm)],[pel24_neg]) ).

cnf(c_11,plain,
    ( big_r(A)
    | big_q(A)
    | ~ big_p(A) ),
    inference(clausify,[status(thm)],[pel24_2]) ).

cnf(c_12,negated_conjecture,
    ( ~ big_r(sK0)
    | big_q(sK1) ),
    inference(resolve,[status(thm)],[c_9,c_10]) ).

cnf(c_13,plain,
    ( big_q(sK1)
    | big_r(sK0)
    | big_q(sK0) ),
    inference(resolve,[status(thm)],[c_11,c_9]) ).

cnf(c_14,negated_conjecture,
    ( big_q(sK1)
    | big_q(sK0)
    | big_q(sK1) ),
    inference(resolve,[status(thm)],[c_12,c_13]) ).

cnf(c_15,negated_conjecture,
    ( big_q(sK0)
    | big_q(sK1) ),
    inference(copy,[status(thm)],[c_14]) ).

cnf(c_16,plain,
    ( ~ big_q(A)
    | ~ big_q(A) ),
    inference(resolve,[status(thm)],[c_6,c_7]) ).

cnf(c_17,plain,
    ~ big_q(A),
    inference(copy,[status(thm)],[c_16]) ).

cnf(c_19,negated_conjecture,
    big_q(sK0),
    inference(resolve,[status(thm)],[c_17,c_15]) ).

cnf(c_18,negated_conjecture,
    $false,
    inference(resolve,[status(thm)],[c_17,c_19]) ).

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