TSTP Solution File: HEN010-6 by CSE_E---1.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : HEN010-6 : TPTP v8.1.2. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s

% Computer : n005.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Aug 31 01:54:26 EDT 2023

% Result   : Unsatisfiable 0.19s 0.61s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   35 (  21 unt;   5 typ;   0 def)
%            Number of atoms       :   41 (  15 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   24 (  13   ~;  11   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    4 (   2   >;   2   *;   0   +;   0  <<)
%            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   :   49 (   6 sgn;   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_22,type,
    less_equal: ( $i * $i ) > $o ).

tff(decl_23,type,
    divide: ( $i * $i ) > $i ).

tff(decl_24,type,
    zero: $i ).

tff(decl_25,type,
    identity: $i ).

tff(decl_26,type,
    a: $i ).

cnf(property_of_divide2,axiom,
    ( less_equal(divide(X3,X2),divide(X3,X1))
    | ~ less_equal(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',property_of_divide2) ).

cnf(zero_is_smallest,axiom,
    less_equal(zero,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/HEN002-0.ax',zero_is_smallest) ).

cnf(less_equal_and_equal,axiom,
    ( X1 = X2
    | ~ less_equal(X1,X2)
    | ~ less_equal(X2,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/HEN002-0.ax',less_equal_and_equal) ).

cnf(property_of_divide1,axiom,
    ( less_equal(divide(X1,X3),X2)
    | ~ less_equal(divide(X1,X2),X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',property_of_divide1) ).

cnf(quotient_less_equal2,axiom,
    ( less_equal(X1,X2)
    | divide(X1,X2) != zero ),
    file('/export/starexec/sandbox2/benchmark/Axioms/HEN002-0.ax',quotient_less_equal2) ).

cnf(quotient_smaller_than_numerator,axiom,
    less_equal(divide(X1,X2),X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/HEN002-0.ax',quotient_smaller_than_numerator) ).

cnf(quotient_property,axiom,
    less_equal(divide(divide(X1,X2),divide(X3,X2)),divide(divide(X1,X3),X2)),
    file('/export/starexec/sandbox2/benchmark/Axioms/HEN002-0.ax',quotient_property) ).

cnf(x_divide_x_is_zero,axiom,
    divide(X1,X1) = zero,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x_divide_x_is_zero) ).

cnf(one_inversion_equals_three,axiom,
    divide(identity,divide(identity,divide(identity,X1))) = divide(identity,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',one_inversion_equals_three) ).

cnf(prove_property_of_inversion,negated_conjecture,
    divide(identity,a) != divide(divide(identity,a),divide(identity,divide(identity,a))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_property_of_inversion) ).

cnf(c_0_10,axiom,
    ( less_equal(divide(X3,X2),divide(X3,X1))
    | ~ less_equal(X1,X2) ),
    property_of_divide2 ).

cnf(c_0_11,axiom,
    less_equal(zero,X1),
    zero_is_smallest ).

cnf(c_0_12,axiom,
    ( X1 = X2
    | ~ less_equal(X1,X2)
    | ~ less_equal(X2,X1) ),
    less_equal_and_equal ).

cnf(c_0_13,axiom,
    ( less_equal(divide(X1,X3),X2)
    | ~ less_equal(divide(X1,X2),X3) ),
    property_of_divide1 ).

cnf(c_0_14,plain,
    less_equal(divide(X1,X2),divide(X1,zero)),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_15,plain,
    ( X1 = zero
    | ~ less_equal(X1,zero) ),
    inference(spm,[status(thm)],[c_0_12,c_0_11]) ).

cnf(c_0_16,plain,
    less_equal(divide(X1,divide(X1,zero)),X2),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_17,axiom,
    ( less_equal(X1,X2)
    | divide(X1,X2) != zero ),
    quotient_less_equal2 ).

cnf(c_0_18,plain,
    divide(X1,divide(X1,zero)) = zero,
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_19,plain,
    less_equal(X1,divide(X1,zero)),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_20,axiom,
    less_equal(divide(X1,X2),X1),
    quotient_smaller_than_numerator ).

cnf(c_0_21,axiom,
    less_equal(divide(divide(X1,X2),divide(X3,X2)),divide(divide(X1,X3),X2)),
    quotient_property ).

cnf(c_0_22,axiom,
    divide(X1,X1) = zero,
    x_divide_x_is_zero ).

cnf(c_0_23,plain,
    divide(X1,zero) = X1,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_19]),c_0_20])]) ).

cnf(c_0_24,plain,
    less_equal(divide(X1,X2),divide(divide(X1,X2),X2)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).

cnf(c_0_25,plain,
    divide(divide(X1,X2),X2) = divide(X1,X2),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_24]),c_0_20])]) ).

cnf(c_0_26,axiom,
    divide(identity,divide(identity,divide(identity,X1))) = divide(identity,X1),
    one_inversion_equals_three ).

cnf(c_0_27,negated_conjecture,
    divide(identity,a) != divide(divide(identity,a),divide(identity,divide(identity,a))),
    prove_property_of_inversion ).

cnf(c_0_28,plain,
    divide(divide(identity,X1),divide(identity,divide(identity,X1))) = divide(identity,X1),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_29,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : HEN010-6 : TPTP v8.1.2. Released v1.0.0.
% 0.13/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.33  % Computer : n005.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit   : 300
% 0.13/0.33  % WCLimit    : 300
% 0.13/0.33  % DateTime   : Thu Aug 24 13:30:38 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.19/0.56  start to proof: theBenchmark
% 0.19/0.61  % Version  : CSE_E---1.5
% 0.19/0.61  % Problem  : theBenchmark.p
% 0.19/0.61  % Proof found
% 0.19/0.61  % SZS status Theorem for theBenchmark.p
% 0.19/0.61  % SZS output start Proof
% See solution above
% 0.19/0.62  % Total time : 0.041000 s
% 0.19/0.62  % SZS output end Proof
% 0.19/0.62  % Total time : 0.043000 s
%------------------------------------------------------------------------------