↑ Up

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

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

% Result   : Unsatisfiable 0.18s 0.48s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   29 (  21 unt;   0 def)
%            Number of atoms       :   39 (  14 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   27 (  17   ~;  10   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   37 (   2 sgn  15   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
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_smaller_than_numerator,axiom,
    ! [VAR_0,VAR_1] : less_equal(divide(VAR_0,VAR_1),VAR_0),
    file('theBenchmark.p',quotient_smaller_than_numerator) ).

cnf(c_3,plain,
    less_equal(divide(A,B),A),
    inference(clausify,[status(thm)],[quotient_smaller_than_numerator]) ).

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(x_divide_x_is_zero,axiom,
    ! [VAR_0] : divide(VAR_0,VAR_0) = zero,
    file('theBenchmark.p',x_divide_x_is_zero) ).

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

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

cnf(c_12,plain,
    ( less_equal(divide(A,C),B)
    | ~ less_equal(divide(A,B),C) ),
    inference(clausify,[status(thm)],[property_of_divide1]) ).

fof(one_inversion_equals_three,axiom,
    ! [VAR_0] : divide(identity,divide(identity,divide(identity,VAR_0))) = divide(identity,VAR_0),
    file('theBenchmark.p',one_inversion_equals_three) ).

cnf(c_15,plain,
    divide(identity,divide(identity,divide(identity,A))) = divide(identity,A),
    inference(clausify,[status(thm)],[one_inversion_equals_three]) ).

fof(prove_property_of_inversion,axiom,
    divide(identity,a) != divide(divide(identity,a),divide(identity,divide(identity,a))),
    file('theBenchmark.p',prove_property_of_inversion) ).

cnf(c_16,plain,
    divide(identity,a) != divide(divide(identity,a),divide(identity,divide(identity,a))),
    inference(clausify,[status(thm)],[prove_property_of_inversion]) ).

cnf(c_17,plain,
    divide(divide(identity,a),divide(identity,divide(identity,a))) != divide(identity,a),
    inference(copy,[status(thm)],[c_16]) ).

cnf(c_23,plain,
    less_equal(divide(divide(A,B),zero),divide(divide(A,B),B)),
    inference(paramod,[status(thm)],[c_10,c_4]) ).

cnf(c_128,plain,
    ( divide(A,B) = A
    | ~ less_equal(A,divide(A,B)) ),
    inference(resolve,[status(thm)],[c_6,c_3]) ).

cnf(c_40,plain,
    ~ less_equal(divide(identity,a),divide(divide(identity,a),divide(identity,divide(identity,a)))),
    inference(resolve,[status(thm)],[c_128,c_17]) ).

cnf(c_45,plain,
    divide(divide(identity,a),divide(divide(identity,a),divide(identity,divide(identity,a)))) != zero,
    inference(resolve,[status(thm)],[c_2,c_40]) ).

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

cnf(c_47,plain,
    ~ less_equal(divide(divide(identity,a),divide(divide(identity,a),divide(identity,divide(identity,a)))),zero),
    inference(resolve,[status(thm)],[c_129,c_45]) ).

cnf(c_76,plain,
    ~ less_equal(divide(divide(identity,a),zero),divide(divide(identity,a),divide(identity,divide(identity,a)))),
    inference(resolve,[status(thm)],[c_12,c_47]) ).

cnf(c_130,plain,
    less_equal(divide(divide(identity,A),zero),divide(divide(identity,divide(identity,divide(identity,A))),divide(identity,divide(identity,A)))),
    inference(paramod,[status(thm)],[c_15,c_23]) ).

cnf(c_126,plain,
    less_equal(divide(divide(identity,A),zero),divide(divide(identity,A),divide(identity,divide(identity,A)))),
    inference(paramod,[status(thm)],[c_15,c_130]) ).

cnf(c_127,plain,
    $false,
    inference(resolve,[status(thm)],[c_126,c_76]) ).

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