↑ Up

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

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

% Computer : n010.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:10 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(m__1883,axiom,
    ( xr = sdtmndt0(xn,xp)
    & sdtpldt0(xp,xr) = xn
    & aNaturalNumber0(xr) ),
    file('theBenchmark.p',m__1883) ).

fof(m__,conjecture,
    xn = sdtpldt0(xp,xr),
    file('theBenchmark.p',m__) ).

fof(m___neg,negated_conjecture,
    xn != sdtpldt0(xp,xr),
    inference(assume_negation,[status(cth)],[m__]) ).

cnf(c_270,negated_conjecture,
    sdtpldt0(xp,xr) != xn,
    inference(clausify,[status(thm)],[m___neg]) ).

cnf(c_276,plain,
    sdtpldt0(xp,xr) = xn,
    inference(clausify,[status(thm)],[m__1883]) ).

cnf(c_277,negated_conjecture,
    $false,
    inference(resolve,[status(thm)],[c_270,c_276]) ).

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