↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : HEN008-3 : 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 : 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 07:32:01 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(quotient_less_equal1,axiom,
    ! [VAR_0,VAR_1] :
      ( divide(VAR_0,VAR_1) = zero
      | ~ less_equal(VAR_0,VAR_1) ),
    file('theBenchmark.p',quotient_less_equal1) ).

cnf(c_1,plain,
    ( divide(A,B) = zero
    | ~ less_equal(A,B) ),
    inference(clausify,[status(thm)],[quotient_less_equal1]) ).

fof(quotient_less_equal2,axiom,
    ! [VAR_0,VAR_1] :
      ( less_equal(VAR_0,VAR_1)
      | divide(VAR_0,VAR_1) != zero ),
    file('theBenchmark.p',quotient_less_equal2) ).

cnf(c_2,plain,
    ( less_equal(A,B)
    | divide(A,B) != zero ),
    inference(clausify,[status(thm)],[quotient_less_equal2]) ).

fof(quotient_property,axiom,
    ! [VAR_0,VAR_1,VAR_2] : less_equal(divide(divide(VAR_0,VAR_1),divide(VAR_2,VAR_1)),divide(divide(VAR_0,VAR_2),VAR_1)),
    file('theBenchmark.p',quotient_property) ).

cnf(c_4,plain,
    less_equal(divide(divide(A,B),divide(C,B)),divide(divide(A,C),B)),
    inference(clausify,[status(thm)],[quotient_property]) ).

fof(zero_is_smallest,axiom,
    ! [VAR_0] : less_equal(zero,VAR_0),
    file('theBenchmark.p',zero_is_smallest) ).

cnf(c_5,plain,
    less_equal(zero,A),
    inference(clausify,[status(thm)],[zero_is_smallest]) ).

fof(less_equal_and_equal,axiom,
    ! [VAR_0,VAR_1] :
      ( VAR_0 = VAR_1
      | ~ less_equal(VAR_1,VAR_0)
      | ~ less_equal(VAR_0,VAR_1) ),
    file('theBenchmark.p',less_equal_and_equal) ).

cnf(c_6,plain,
    ( A = B
    | ~ less_equal(B,A)
    | ~ less_equal(A,B) ),
    inference(clausify,[status(thm)],[less_equal_and_equal]) ).

fof(a_LE_b,axiom,
    less_equal(a,b),
    file('theBenchmark.p',a_LE_b) ).

cnf(c_8,plain,
    less_equal(a,b),
    inference(clausify,[status(thm)],[a_LE_b]) ).

fof(prove_a_divide_c_LE_b_divide_c,axiom,
    ~ less_equal(divide(a,c),divide(b,c)),
    file('theBenchmark.p',prove_a_divide_c_LE_b_divide_c) ).

cnf(c_9,plain,
    ~ less_equal(divide(a,c),divide(b,c)),
    inference(clausify,[status(thm)],[prove_a_divide_c_LE_b_divide_c]) ).

cnf(c_12,plain,
    divide(zero,A) = zero,
    inference(resolve,[status(thm)],[c_1,c_5]) ).

cnf(c_14,plain,
    divide(a,b) = zero,
    inference(resolve,[status(thm)],[c_1,c_8]) ).

cnf(c_15,plain,
    divide(divide(a,c),divide(b,c)) != zero,
    inference(resolve,[status(thm)],[c_2,c_9]) ).

cnf(c_28,plain,
    ( A = zero
    | ~ less_equal(A,zero) ),
    inference(resolve,[status(thm)],[c_6,c_5]) ).

cnf(c_19,plain,
    ~ less_equal(divide(divide(a,c),divide(b,c)),zero),
    inference(resolve,[status(thm)],[c_28,c_15]) ).

cnf(c_29,plain,
    less_equal(divide(divide(a,A),divide(b,A)),divide(zero,A)),
    inference(paramod,[status(thm)],[c_14,c_4]) ).

cnf(c_26,plain,
    less_equal(divide(divide(a,A),divide(b,A)),zero),
    inference(paramod,[status(thm)],[c_12,c_29]) ).

cnf(c_27,plain,
    $false,
    inference(resolve,[status(thm)],[c_26,c_19]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : HEN008-3 : 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/0.55  % Computer : n020.cluster.edu
% 0.09/0.55  % Model    : x86_64 x86_64
% 0.09/0.55  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.55  % Memory   : 8046.5625MB
% 0.09/0.55  % OS       : Linux 6.8.0-71-generic
% 0.09/0.55  % CPULimit : 300
% 0.09/0.55  % WCLimit  : 300
% 0.09/0.55  % DateTime : Fri Sep 25 15:58:04 UTC 2026
% 0.09/0.55  % CPUTime  : 
% 0.09/0.56  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.56  % Process 3302904 was started by sandbox on n020,
% 0.09/0.56  % Fri Sep 25 15:58:04 2026
% 0.09/0.56  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.14/0.56  
% 0.14/0.56  % From the command line: assign(max_seconds, 300).
% 0.14/0.57  
% 0.14/0.57  % SZS status Unsatisfiable for theBenchmark
% 0.14/0.57  
% 0.14/0.57  % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.14/0.57  % Length of proof is 13.
% 0.14/0.57  % Level of proof is 3.
% 0.14/0.57  % Maximum clause weight is 13.000.
% 0.14/0.57  % Given clauses 17.
% 0.14/0.57  
% 0.14/0.57  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------