↑ Up

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

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

% Computer : n016.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:53 AM UTC 2026

% Result   : Unsatisfiable 0.06s 15.44s
% Output   : CNFRefutation 0.06s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   26 (   5 unt;   0 def)
%            Number of atoms       :   61 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   77 (  42   ~;  35   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-1 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   23 (   6 sgn   6   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(clause_3,axiom,
    ! [VAR_0] :
      ( big_f(VAR_0)
      | ~ big_p(VAR_0) ),
    file('theBenchmark.p',clause_3) ).

cnf(c_1,plain,
    ( big_f(A)
    | ~ big_p(A) ),
    inference(clausify,[status(thm)],[clause_3]) ).

fof(clause_2,axiom,
    ! [VAR_0] :
      ( ~ big_r(VAR_0)
      | ~ big_g(VAR_0)
      | ~ big_f(VAR_0) ),
    file('theBenchmark.p',clause_2) ).

cnf(c_2,plain,
    ( ~ big_r(A)
    | ~ big_g(A)
    | ~ big_f(A) ),
    inference(clausify,[status(thm)],[clause_2]) ).

fof(clause_4,axiom,
    ! [VAR_0] :
      ( big_g(VAR_0)
      | ~ big_p(VAR_0) ),
    file('theBenchmark.p',clause_4) ).

cnf(c_3,plain,
    ( big_g(A)
    | ~ big_p(A) ),
    inference(clausify,[status(thm)],[clause_4]) ).

cnf(c_4,plain,
    ( ~ big_r(A)
    | ~ big_g(A)
    | ~ big_p(A) ),
    inference(resolve,[status(thm)],[c_1,c_2]) ).

fof(clause_6,axiom,
    ! [VAR_0] :
      ( big_r(b)
      | big_q(VAR_0)
      | ~ big_p(VAR_0) ),
    file('theBenchmark.p',clause_6) ).

cnf(c_5,plain,
    ( big_r(b)
    | big_q(A)
    | ~ big_p(A) ),
    inference(clausify,[status(thm)],[clause_6]) ).

cnf(c_6,plain,
    ( ~ big_r(A)
    | ~ big_p(A)
    | ~ big_p(A) ),
    inference(resolve,[status(thm)],[c_3,c_4]) ).

fof(clause_7,axiom,
    ! [VAR_0] :
      ( ~ big_p(VAR_0)
      | ~ big_q(VAR_0) ),
    file('theBenchmark.p',clause_7) ).

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

cnf(c_8,plain,
    ( ~ big_p(b)
    | ~ big_p(b)
    | big_q(A)
    | ~ big_p(A) ),
    inference(resolve,[status(thm)],[c_5,c_6]) ).

fof(clause_5,axiom,
    ! [VAR_0] :
      ( big_p(b)
      | big_q(VAR_0)
      | ~ big_p(VAR_0) ),
    file('theBenchmark.p',clause_5) ).

cnf(c_9,plain,
    ( big_p(b)
    | big_q(A)
    | ~ big_p(A) ),
    inference(clausify,[status(thm)],[clause_5]) ).

cnf(c_10,plain,
    ( ~ big_p(A)
    | big_p(b)
    | ~ big_p(A) ),
    inference(resolve,[status(thm)],[c_9,c_7]) ).

cnf(c_11,plain,
    ( big_p(b)
    | ~ big_p(A) ),
    inference(copy,[status(thm)],[c_10]) ).

cnf(c_12,plain,
    ( ~ big_p(b)
    | ~ big_p(b)
    | ~ big_p(A)
    | ~ big_p(A) ),
    inference(resolve,[status(thm)],[c_7,c_8]) ).

cnf(c_19,plain,
    ( ~ big_p(b)
    | ~ big_p(b)
    | ~ big_p(A) ),
    inference(copy,[status(thm)],[c_12]) ).

cnf(c_13,plain,
    ( ~ big_p(b)
    | ~ big_p(A) ),
    inference(copy,[status(thm)],[c_19]) ).

fof(clause_1,axiom,
    big_p(a),
    file('theBenchmark.p',clause_1) ).

cnf(c_14,plain,
    big_p(a),
    inference(clausify,[status(thm)],[clause_1]) ).

cnf(c_15,plain,
    ( ~ big_p(B)
    | ~ big_p(A) ),
    inference(resolve,[status(thm)],[c_13,c_11]) ).

cnf(c_16,plain,
    big_p(b),
    inference(resolve,[status(thm)],[c_11,c_14]) ).

cnf(c_17,plain,
    ~ big_p(A),
    inference(resolve,[status(thm)],[c_15,c_14]) ).

cnf(c_18,plain,
    $false,
    inference(resolve,[status(thm)],[c_17,c_16]) ).

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