↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : HEN002-5 : 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 : n004.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 07:31:56 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(zero_is_smallest,axiom,
    ! [VAR_0] : divide(zero,VAR_0) = zero,
    file('theBenchmark.p',zero_is_smallest) ).

cnf(c_3,plain,
    divide(zero,A) = zero,
    inference(clausify,[status(thm)],[zero_is_smallest]) ).

fof(prove_zero_divide_anything_is_zero,axiom,
    divide(zero,a) != zero,
    file('theBenchmark.p',prove_zero_divide_anything_is_zero) ).

cnf(c_6,plain,
    divide(zero,a) != zero,
    inference(clausify,[status(thm)],[prove_zero_divide_anything_is_zero]) ).

cnf(c_7,plain,
    $false,
    inference(resolve,[status(thm)],[c_3,c_6]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : HEN002-5 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.34  % Computer : n004.cluster.edu
% 0.07/0.34  % Model    : x86_64 x86_64
% 0.07/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.34  % Memory   : 8046.5625MB
% 0.07/0.34  % OS       : Linux 6.8.0-71-generic
% 0.07/0.34  % CPULimit : 300
% 0.07/0.34  % WCLimit  : 300
% 0.07/0.34  % DateTime : Fri Sep 25 15:55:20 UTC 2026
% 0.07/0.34  % CPUTime  : 
% 0.07/0.34  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.07/0.34  % Process 3591600 was started by sandbox on n004,
% 0.07/0.34  % Fri Sep 25 15:55:20 2026
% 0.07/0.34  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.07/0.35  
% 0.07/0.35  % From the command line: assign(max_seconds, 300).
% 0.07/0.35  
% 0.07/0.35  % SZS status Unsatisfiable for theBenchmark
% 0.07/0.35  
% 0.07/0.35  % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.07/0.35  % Length of proof is 3.
% 0.07/0.35  % Level of proof is 1.
% 0.07/0.35  % Maximum clause weight is 15.000.
% 0.07/0.35  % Given clauses 0.
% 0.07/0.35  
% 0.07/0.35  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------