↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : NUM520+1 : TPTP v9.3.1. Released v4.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 08:17:15 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(m__2315,axiom,
    ~ ( xk = sz10
      | xk = sz00 ),
    file('theBenchmark.p',m__2315) ).

fof(m__2327,axiom,
    ~ ( xk != sz10
      & xk != sz00 ),
    file('theBenchmark.p',m__2327) ).

cnf(c_87,plain,
    ( xk = sz10
    | xk = sz00 ),
    inference(clausify,[status(thm)],[m__2327]) ).

cnf(c_88,plain,
    xk != sz10,
    inference(clausify,[status(thm)],[m__2315]) ).

cnf(c_89,plain,
    xk != sz00,
    inference(clausify,[status(thm)],[m__2315]) ).

cnf(c_189,plain,
    xk = sz10,
    inference(resolve,[status(thm)],[c_89,c_87]) ).

cnf(c_188,plain,
    $false,
    inference(resolve,[status(thm)],[c_88,c_189]) ).

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