↑ Up

ConnectPP---0.7.2.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : GRP175-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n019.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 : Thu Sep 24 08:41:31 AM UTC 2026

% Result   : Unsatisfiable 37.65s 38.00s
% Output   : Proof 37.65s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   16
% Syntax   : Number of clauses     :  140 (  97 unt;   0 nHn; 117 RR)
%            Number of literals    :  210 ( 149 equ;  72 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-2 aty)
%            Number of variables   :   82 (   8 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(left_identity,axiom,
    multiply(identity,X) = X,
    file('GRP004-0.ax',left_identity) ).

cnf(left_inverse,axiom,
    multiply(inverse(X),X) = identity,
    file('GRP004-0.ax',left_inverse) ).

cnf(symmetry_of_lub,axiom,
    least_upper_bound(X,Y) = least_upper_bound(Y,X),
    file('GRP004-2.ax',symmetry_of_lub) ).

cnf(glb_absorbtion,axiom,
    greatest_lower_bound(X,least_upper_bound(X,Y)) = X,
    file('GRP004-2.ax',glb_absorbtion) ).

cnf(monotony_lub1,axiom,
    multiply(X,least_upper_bound(Y,Z)) = least_upper_bound(multiply(X,Y),multiply(X,Z)),
    file('GRP004-2.ax',monotony_lub1) ).

cnf(monotony_glb1,axiom,
    multiply(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(multiply(X,Y),multiply(X,Z)),
    file('GRP004-2.ax',monotony_glb1) ).

cnf(monotony_lub2,axiom,
    multiply(least_upper_bound(Y,Z),X) = least_upper_bound(multiply(Y,X),multiply(Z,X)),
    file('GRP004-2.ax',monotony_lub2) ).

cnf(p06a_1,hypothesis,
    least_upper_bound(identity,b) = b,
    file('theBenchmark.p',p06a_1) ).

cnf(prove_p06a,negated_conjecture,
    least_upper_bound(identity,multiply(inverse(a),multiply(b,a))) != multiply(inverse(a),multiply(b,a)),
    file('theBenchmark.p',prove_p06a) ).

cnf(equality_1,axiom,
    Eq_x_0 = Eq_x_0,
    theory(equality,[reflexivity]) ).

cnf(equality_2,axiom,
    ( Eq_x_1 = Eq_x_0
    | Eq_x_0 != Eq_x_1 ),
    theory(equality,[symmetry]) ).

cnf(equality_3,axiom,
    ( Eq_x_0 = Eq_x_2
    | Eq_x_1 != Eq_x_2
    | Eq_x_0 != Eq_x_1 ),
    theory(equality,[transitivity]) ).

cnf(equality_4,axiom,
    ( multiply(Eq_x_0,Eq_x_1) = multiply(Eq_y_0,Eq_y_1)
    | Eq_x_1 != Eq_y_1
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_functions]) ).

cnf(equality_5,axiom,
    ( inverse(Eq_x_0) = inverse(Eq_y_0)
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_functions]) ).

cnf(equality_6,axiom,
    ( greatest_lower_bound(Eq_x_0,Eq_x_1) = greatest_lower_bound(Eq_y_0,Eq_y_1)
    | Eq_x_1 != Eq_y_1
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_functions]) ).

cnf(equality_7,axiom,
    ( least_upper_bound(Eq_x_0,Eq_x_1) = least_upper_bound(Eq_y_0,Eq_y_1)
    | Eq_x_1 != Eq_y_1
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_functions]) ).

cnf(t1,plain,
    least_upper_bound(identity,multiply(inverse(a),multiply(b,a))) != multiply(inverse(a),multiply(b,a)),
    inference(start,[status(thm),parent(0:0)],[prove_p06a]) ).

cnf(t2,plain,
    ( least_upper_bound(multiply(inverse(a),multiply(b,a)),identity) != multiply(inverse(a),multiply(b,a))
    | least_upper_bound(identity,multiply(inverse(a),multiply(b,a))) != least_upper_bound(multiply(inverse(a),multiply(b,a)),identity)
    | least_upper_bound(identity,multiply(inverse(a),multiply(b,a))) = multiply(inverse(a),multiply(b,a)) ),
    inference(extension,[status(thm),parent(t1:1)],[equality_3]) ).

cnf(t3,plain,
    $false,
    inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).

cnf(t4,plain,
    least_upper_bound(identity,multiply(inverse(a),multiply(b,a))) = least_upper_bound(multiply(inverse(a),multiply(b,a)),identity),
    inference(extension,[status(thm),parent(t2:2)],[symmetry_of_lub]) ).

cnf(t5,plain,
    $false,
    inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).

cnf(t6,plain,
    ( multiply(inverse(a),multiply(b,a)) != least_upper_bound(multiply(inverse(a),multiply(b,a)),identity)
    | least_upper_bound(multiply(inverse(a),multiply(b,a)),identity) = multiply(inverse(a),multiply(b,a)) ),
    inference(extension,[status(thm),parent(t2:3)],[equality_2]) ).

cnf(t7,plain,
    $false,
    inference(connection,[status(thm),parent(t6:1)],[t6:1,t2:3]) ).

cnf(t8,plain,
    ( multiply(inverse(greatest_lower_bound(a,least_upper_bound(a,U_413))),multiply(least_upper_bound(identity,b),greatest_lower_bound(a,least_upper_bound(a,U_512)))) != least_upper_bound(multiply(inverse(a),multiply(b,a)),identity)
    | multiply(inverse(a),multiply(b,a)) != multiply(inverse(greatest_lower_bound(a,least_upper_bound(a,U_413))),multiply(least_upper_bound(identity,b),greatest_lower_bound(a,least_upper_bound(a,U_512))))
    | multiply(inverse(a),multiply(b,a)) = least_upper_bound(multiply(inverse(a),multiply(b,a)),identity) ),
    inference(extension,[status(thm),parent(t6:2)],[equality_3]) ).

cnf(t9,plain,
    $false,
    inference(connection,[status(thm),parent(t8:1)],[t8:1,t6:2]) ).

cnf(t10,plain,
    ( multiply(b,a) != multiply(least_upper_bound(identity,b),greatest_lower_bound(a,least_upper_bound(a,U_512)))
    | inverse(a) != inverse(greatest_lower_bound(a,least_upper_bound(a,U_413)))
    | multiply(inverse(a),multiply(b,a)) = multiply(inverse(greatest_lower_bound(a,least_upper_bound(a,U_413))),multiply(least_upper_bound(identity,b),greatest_lower_bound(a,least_upper_bound(a,U_512)))) ),
    inference(extension,[status(thm),parent(t8:2)],[equality_4]) ).

cnf(t11,plain,
    $false,
    inference(connection,[status(thm),parent(t10:1)],[t10:1,t8:2]) ).

cnf(t12,plain,
    ( a != greatest_lower_bound(a,least_upper_bound(a,U_413))
    | inverse(a) = inverse(greatest_lower_bound(a,least_upper_bound(a,U_413))) ),
    inference(extension,[status(thm),parent(t10:2)],[equality_5]) ).

cnf(t13,plain,
    $false,
    inference(connection,[status(thm),parent(t12:1)],[t12:1,t10:2]) ).

cnf(t14,plain,
    ( greatest_lower_bound(a,least_upper_bound(a,U_413)) != a
    | a = greatest_lower_bound(a,least_upper_bound(a,U_413)) ),
    inference(extension,[status(thm),parent(t12:2)],[equality_2]) ).

cnf(t15,plain,
    $false,
    inference(connection,[status(thm),parent(t14:1)],[t14:1,t12:2]) ).

cnf(t16,plain,
    greatest_lower_bound(a,least_upper_bound(a,U_413)) = a,
    inference(extension,[status(thm),parent(t14:2)],[glb_absorbtion]) ).

cnf(t17,plain,
    $false,
    inference(connection,[status(thm),parent(t16:1)],[t16:1,t14:2]) ).

cnf(t18,plain,
    ( a != greatest_lower_bound(a,least_upper_bound(a,U_512))
    | b != least_upper_bound(identity,b)
    | multiply(b,a) = multiply(least_upper_bound(identity,b),greatest_lower_bound(a,least_upper_bound(a,U_512))) ),
    inference(extension,[status(thm),parent(t10:3)],[equality_4]) ).

cnf(t19,plain,
    $false,
    inference(connection,[status(thm),parent(t18:1)],[t18:1,t10:3]) ).

cnf(t20,plain,
    ( least_upper_bound(identity,b) != b
    | b = least_upper_bound(identity,b) ),
    inference(extension,[status(thm),parent(t18:2)],[equality_2]) ).

cnf(t21,plain,
    $false,
    inference(connection,[status(thm),parent(t20:1)],[t20:1,t18:2]) ).

cnf(t22,plain,
    least_upper_bound(identity,b) = b,
    inference(extension,[status(thm),parent(t20:2)],[p06a_1]) ).

cnf(t23,plain,
    $false,
    inference(connection,[status(thm),parent(t22:1)],[t22:1,t20:2]) ).

cnf(t24,plain,
    ( greatest_lower_bound(a,least_upper_bound(a,U_512)) != a
    | a = greatest_lower_bound(a,least_upper_bound(a,U_512)) ),
    inference(extension,[status(thm),parent(t18:3)],[equality_2]) ).

cnf(t25,plain,
    $false,
    inference(connection,[status(thm),parent(t24:1)],[t24:1,t18:3]) ).

cnf(t26,plain,
    greatest_lower_bound(a,least_upper_bound(a,U_512)) = a,
    inference(extension,[status(thm),parent(t24:2)],[glb_absorbtion]) ).

cnf(t27,plain,
    $false,
    inference(connection,[status(thm),parent(t26:1)],[t26:1,t24:2]) ).

cnf(t28,plain,
    ( multiply(inverse(a),least_upper_bound(multiply(identity,greatest_lower_bound(a,least_upper_bound(a,U_512))),multiply(b,greatest_lower_bound(a,least_upper_bound(a,U_512))))) != least_upper_bound(multiply(inverse(a),multiply(b,a)),identity)
    | multiply(inverse(greatest_lower_bound(a,least_upper_bound(a,U_413))),multiply(least_upper_bound(identity,b),greatest_lower_bound(a,least_upper_bound(a,U_512)))) != multiply(inverse(a),least_upper_bound(multiply(identity,greatest_lower_bound(a,least_upper_bound(a,U_512))),multiply(b,greatest_lower_bound(a,least_upper_bound(a,U_512)))))
    | multiply(inverse(greatest_lower_bound(a,least_upper_bound(a,U_413))),multiply(least_upper_bound(identity,b),greatest_lower_bound(a,least_upper_bound(a,U_512)))) = least_upper_bound(multiply(inverse(a),multiply(b,a)),identity) ),
    inference(extension,[status(thm),parent(t8:3)],[equality_3]) ).

cnf(t29,plain,
    $false,
    inference(connection,[status(thm),parent(t28:1)],[t28:1,t8:3]) ).

cnf(t30,plain,
    ( multiply(least_upper_bound(identity,b),greatest_lower_bound(a,least_upper_bound(a,U_512))) != least_upper_bound(multiply(identity,greatest_lower_bound(a,least_upper_bound(a,U_512))),multiply(b,greatest_lower_bound(a,least_upper_bound(a,U_512))))
    | inverse(greatest_lower_bound(a,least_upper_bound(a,U_413))) != inverse(a)
    | multiply(inverse(greatest_lower_bound(a,least_upper_bound(a,U_413))),multiply(least_upper_bound(identity,b),greatest_lower_bound(a,least_upper_bound(a,U_512)))) = multiply(inverse(a),least_upper_bound(multiply(identity,greatest_lower_bound(a,least_upper_bound(a,U_512))),multiply(b,greatest_lower_bound(a,least_upper_bound(a,U_512))))) ),
    inference(extension,[status(thm),parent(t28:2)],[equality_4]) ).

cnf(t31,plain,
    $false,
    inference(connection,[status(thm),parent(t30:1)],[t30:1,t28:2]) ).

cnf(t32,plain,
    ( greatest_lower_bound(a,least_upper_bound(a,U_413)) != a
    | inverse(greatest_lower_bound(a,least_upper_bound(a,U_413))) = inverse(a) ),
    inference(extension,[status(thm),parent(t30:2)],[equality_5]) ).

cnf(t33,plain,
    $false,
    inference(connection,[status(thm),parent(t32:1)],[t32:1,t30:2]) ).

cnf(t34,plain,
    greatest_lower_bound(a,least_upper_bound(a,U_413)) = a,
    inference(extension,[status(thm),parent(t32:2)],[glb_absorbtion]) ).

cnf(t35,plain,
    $false,
    inference(connection,[status(thm),parent(t34:1)],[t34:1,t32:2]) ).

cnf(t36,plain,
    multiply(least_upper_bound(identity,b),greatest_lower_bound(a,least_upper_bound(a,U_512))) = least_upper_bound(multiply(identity,greatest_lower_bound(a,least_upper_bound(a,U_512))),multiply(b,greatest_lower_bound(a,least_upper_bound(a,U_512)))),
    inference(extension,[status(thm),parent(t30:3)],[monotony_lub2]) ).

cnf(t37,plain,
    $false,
    inference(connection,[status(thm),parent(t36:1)],[t36:1,t30:3]) ).

cnf(t38,plain,
    ( least_upper_bound(multiply(inverse(a),multiply(identity,greatest_lower_bound(a,least_upper_bound(a,U_512)))),multiply(inverse(a),multiply(b,greatest_lower_bound(a,least_upper_bound(a,U_512))))) != least_upper_bound(multiply(inverse(a),multiply(b,a)),identity)
    | multiply(inverse(a),least_upper_bound(multiply(identity,greatest_lower_bound(a,least_upper_bound(a,U_512))),multiply(b,greatest_lower_bound(a,least_upper_bound(a,U_512))))) != least_upper_bound(multiply(inverse(a),multiply(identity,greatest_lower_bound(a,least_upper_bound(a,U_512)))),multiply(inverse(a),multiply(b,greatest_lower_bound(a,least_upper_bound(a,U_512)))))
    | multiply(inverse(a),least_upper_bound(multiply(identity,greatest_lower_bound(a,least_upper_bound(a,U_512))),multiply(b,greatest_lower_bound(a,least_upper_bound(a,U_512))))) = least_upper_bound(multiply(inverse(a),multiply(b,a)),identity) ),
    inference(extension,[status(thm),parent(t28:3)],[equality_3]) ).

cnf(t39,plain,
    $false,
    inference(connection,[status(thm),parent(t38:1)],[t38:1,t28:3]) ).

cnf(t40,plain,
    multiply(inverse(a),least_upper_bound(multiply(identity,greatest_lower_bound(a,least_upper_bound(a,U_512))),multiply(b,greatest_lower_bound(a,least_upper_bound(a,U_512))))) = least_upper_bound(multiply(inverse(a),multiply(identity,greatest_lower_bound(a,least_upper_bound(a,U_512)))),multiply(inverse(a),multiply(b,greatest_lower_bound(a,least_upper_bound(a,U_512))))),
    inference(extension,[status(thm),parent(t38:2)],[monotony_lub1]) ).

cnf(t41,plain,
    $false,
    inference(connection,[status(thm),parent(t40:1)],[t40:1,t38:2]) ).

cnf(t42,plain,
    ( least_upper_bound(multiply(inverse(a),multiply(b,greatest_lower_bound(a,least_upper_bound(a,U_512)))),multiply(inverse(a),multiply(identity,greatest_lower_bound(a,least_upper_bound(a,U_512))))) != least_upper_bound(multiply(inverse(a),multiply(b,a)),identity)
    | least_upper_bound(multiply(inverse(a),multiply(identity,greatest_lower_bound(a,least_upper_bound(a,U_512)))),multiply(inverse(a),multiply(b,greatest_lower_bound(a,least_upper_bound(a,U_512))))) != least_upper_bound(multiply(inverse(a),multiply(b,greatest_lower_bound(a,least_upper_bound(a,U_512)))),multiply(inverse(a),multiply(identity,greatest_lower_bound(a,least_upper_bound(a,U_512)))))
    | least_upper_bound(multiply(inverse(a),multiply(identity,greatest_lower_bound(a,least_upper_bound(a,U_512)))),multiply(inverse(a),multiply(b,greatest_lower_bound(a,least_upper_bound(a,U_512))))) = least_upper_bound(multiply(inverse(a),multiply(b,a)),identity) ),
    inference(extension,[status(thm),parent(t38:3)],[equality_3]) ).

cnf(t43,plain,
    $false,
    inference(connection,[status(thm),parent(t42:1)],[t42:1,t38:3]) ).

cnf(t44,plain,
    least_upper_bound(multiply(inverse(a),multiply(identity,greatest_lower_bound(a,least_upper_bound(a,U_512)))),multiply(inverse(a),multiply(b,greatest_lower_bound(a,least_upper_bound(a,U_512))))) = least_upper_bound(multiply(inverse(a),multiply(b,greatest_lower_bound(a,least_upper_bound(a,U_512)))),multiply(inverse(a),multiply(identity,greatest_lower_bound(a,least_upper_bound(a,U_512))))),
    inference(extension,[status(thm),parent(t42:2)],[symmetry_of_lub]) ).

cnf(t45,plain,
    $false,
    inference(connection,[status(thm),parent(t44:1)],[t44:1,t42:2]) ).

cnf(t46,plain,
    ( multiply(inverse(a),multiply(identity,greatest_lower_bound(a,least_upper_bound(a,U_512)))) != identity
    | multiply(inverse(a),multiply(b,greatest_lower_bound(a,least_upper_bound(a,U_512)))) != multiply(inverse(a),multiply(b,a))
    | least_upper_bound(multiply(inverse(a),multiply(b,greatest_lower_bound(a,least_upper_bound(a,U_512)))),multiply(inverse(a),multiply(identity,greatest_lower_bound(a,least_upper_bound(a,U_512))))) = least_upper_bound(multiply(inverse(a),multiply(b,a)),identity) ),
    inference(extension,[status(thm),parent(t42:3)],[equality_7]) ).

cnf(t47,plain,
    $false,
    inference(connection,[status(thm),parent(t46:1)],[t46:1,t42:3]) ).

cnf(t48,plain,
    ( multiply(b,greatest_lower_bound(a,least_upper_bound(a,U_512))) != multiply(b,a)
    | inverse(a) != inverse(a)
    | multiply(inverse(a),multiply(b,greatest_lower_bound(a,least_upper_bound(a,U_512)))) = multiply(inverse(a),multiply(b,a)) ),
    inference(extension,[status(thm),parent(t46:2)],[equality_4]) ).

cnf(t49,plain,
    $false,
    inference(connection,[status(thm),parent(t48:1)],[t48:1,t46:2]) ).

cnf(t50,plain,
    ( a != a
    | inverse(a) = inverse(a) ),
    inference(extension,[status(thm),parent(t48:2)],[equality_5]) ).

cnf(t51,plain,
    $false,
    inference(connection,[status(thm),parent(t50:1)],[t50:1,t48:2]) ).

cnf(t52,plain,
    a = a,
    inference(extension,[status(thm),parent(t50:2)],[equality_1]) ).

cnf(t53,plain,
    $false,
    inference(connection,[status(thm),parent(t52:1)],[t52:1,t50:2]) ).

cnf(t54,plain,
    ( greatest_lower_bound(a,least_upper_bound(a,U_512)) != a
    | b != b
    | multiply(b,greatest_lower_bound(a,least_upper_bound(a,U_512))) = multiply(b,a) ),
    inference(extension,[status(thm),parent(t48:3)],[equality_4]) ).

cnf(t55,plain,
    $false,
    inference(connection,[status(thm),parent(t54:1)],[t54:1,t48:3]) ).

cnf(t56,plain,
    b = b,
    inference(extension,[status(thm),parent(t54:2)],[equality_1]) ).

cnf(t57,plain,
    $false,
    inference(connection,[status(thm),parent(t56:1)],[t56:1,t54:2]) ).

cnf(t58,plain,
    greatest_lower_bound(a,least_upper_bound(a,U_512)) = a,
    inference(extension,[status(thm),parent(t54:3)],[glb_absorbtion]) ).

cnf(t59,plain,
    $false,
    inference(connection,[status(thm),parent(t58:1)],[t58:1,t54:3]) ).

cnf(t60,plain,
    ( multiply(inverse(a),greatest_lower_bound(multiply(identity,a),multiply(identity,least_upper_bound(a,U_512)))) != identity
    | multiply(inverse(a),multiply(identity,greatest_lower_bound(a,least_upper_bound(a,U_512)))) != multiply(inverse(a),greatest_lower_bound(multiply(identity,a),multiply(identity,least_upper_bound(a,U_512))))
    | multiply(inverse(a),multiply(identity,greatest_lower_bound(a,least_upper_bound(a,U_512)))) = identity ),
    inference(extension,[status(thm),parent(t46:3)],[equality_3]) ).

cnf(t61,plain,
    $false,
    inference(connection,[status(thm),parent(t60:1)],[t60:1,t46:3]) ).

cnf(t62,plain,
    ( multiply(identity,greatest_lower_bound(a,least_upper_bound(a,U_512))) != greatest_lower_bound(multiply(identity,a),multiply(identity,least_upper_bound(a,U_512)))
    | inverse(a) != inverse(a)
    | multiply(inverse(a),multiply(identity,greatest_lower_bound(a,least_upper_bound(a,U_512)))) = multiply(inverse(a),greatest_lower_bound(multiply(identity,a),multiply(identity,least_upper_bound(a,U_512)))) ),
    inference(extension,[status(thm),parent(t60:2)],[equality_4]) ).

cnf(t63,plain,
    $false,
    inference(connection,[status(thm),parent(t62:1)],[t62:1,t60:2]) ).

cnf(t64,plain,
    ( a != a
    | inverse(a) = inverse(a) ),
    inference(extension,[status(thm),parent(t62:2)],[equality_5]) ).

cnf(t65,plain,
    $false,
    inference(connection,[status(thm),parent(t64:1)],[t64:1,t62:2]) ).

cnf(t66,plain,
    ( greatest_lower_bound(a,least_upper_bound(a,U_463)) != a
    | a != greatest_lower_bound(a,least_upper_bound(a,U_463))
    | a = a ),
    inference(extension,[status(thm),parent(t64:2)],[equality_3]) ).

cnf(t67,plain,
    $false,
    inference(connection,[status(thm),parent(t66:1)],[t66:1,t64:2]) ).

cnf(t68,plain,
    ( greatest_lower_bound(a,least_upper_bound(a,U_463)) != a
    | a = greatest_lower_bound(a,least_upper_bound(a,U_463)) ),
    inference(extension,[status(thm),parent(t66:2)],[equality_2]) ).

cnf(t69,plain,
    $false,
    inference(connection,[status(thm),parent(t68:1)],[t68:1,t66:2]) ).

cnf(t70,plain,
    greatest_lower_bound(a,least_upper_bound(a,U_463)) = a,
    inference(extension,[status(thm),parent(t68:2)],[glb_absorbtion]) ).

cnf(t71,plain,
    $false,
    inference(connection,[status(thm),parent(t70:1)],[t70:1,t68:2]) ).

cnf(t72,plain,
    greatest_lower_bound(a,least_upper_bound(a,U_463)) = a,
    inference(extension,[status(thm),parent(t66:3)],[glb_absorbtion]) ).

cnf(t73,plain,
    $false,
    inference(connection,[status(thm),parent(t72:1)],[t72:1,t66:3]) ).

cnf(t74,plain,
    multiply(identity,greatest_lower_bound(a,least_upper_bound(a,U_512))) = greatest_lower_bound(multiply(identity,a),multiply(identity,least_upper_bound(a,U_512))),
    inference(extension,[status(thm),parent(t62:3)],[monotony_glb1]) ).

cnf(t75,plain,
    $false,
    inference(connection,[status(thm),parent(t74:1)],[t74:1,t62:3]) ).

cnf(t76,plain,
    ( greatest_lower_bound(multiply(inverse(a),multiply(identity,a)),multiply(inverse(a),multiply(identity,least_upper_bound(a,U_512)))) != identity
    | multiply(inverse(a),greatest_lower_bound(multiply(identity,a),multiply(identity,least_upper_bound(a,U_512)))) != greatest_lower_bound(multiply(inverse(a),multiply(identity,a)),multiply(inverse(a),multiply(identity,least_upper_bound(a,U_512))))
    | multiply(inverse(a),greatest_lower_bound(multiply(identity,a),multiply(identity,least_upper_bound(a,U_512)))) = identity ),
    inference(extension,[status(thm),parent(t60:3)],[equality_3]) ).

cnf(t77,plain,
    $false,
    inference(connection,[status(thm),parent(t76:1)],[t76:1,t60:3]) ).

cnf(t78,plain,
    multiply(inverse(a),greatest_lower_bound(multiply(identity,a),multiply(identity,least_upper_bound(a,U_512)))) = greatest_lower_bound(multiply(inverse(a),multiply(identity,a)),multiply(inverse(a),multiply(identity,least_upper_bound(a,U_512)))),
    inference(extension,[status(thm),parent(t76:2)],[monotony_glb1]) ).

cnf(t79,plain,
    $false,
    inference(connection,[status(thm),parent(t78:1)],[t78:1,t76:2]) ).

cnf(t80,plain,
    ( identity != greatest_lower_bound(multiply(inverse(a),multiply(identity,a)),multiply(inverse(a),multiply(identity,least_upper_bound(a,U_512))))
    | greatest_lower_bound(multiply(inverse(a),multiply(identity,a)),multiply(inverse(a),multiply(identity,least_upper_bound(a,U_512)))) = identity ),
    inference(extension,[status(thm),parent(t76:3)],[equality_2]) ).

cnf(t81,plain,
    $false,
    inference(connection,[status(thm),parent(t80:1)],[t80:1,t76:3]) ).

cnf(t82,plain,
    ( greatest_lower_bound(identity,least_upper_bound(identity,multiply(inverse(a),multiply(identity,U_512)))) != greatest_lower_bound(multiply(inverse(a),multiply(identity,a)),multiply(inverse(a),multiply(identity,least_upper_bound(a,U_512))))
    | identity != greatest_lower_bound(identity,least_upper_bound(identity,multiply(inverse(a),multiply(identity,U_512))))
    | identity = greatest_lower_bound(multiply(inverse(a),multiply(identity,a)),multiply(inverse(a),multiply(identity,least_upper_bound(a,U_512)))) ),
    inference(extension,[status(thm),parent(t80:2)],[equality_3]) ).

cnf(t83,plain,
    $false,
    inference(connection,[status(thm),parent(t82:1)],[t82:1,t80:2]) ).

cnf(t84,plain,
    ( greatest_lower_bound(identity,least_upper_bound(identity,multiply(inverse(a),multiply(identity,U_512)))) != identity
    | identity = greatest_lower_bound(identity,least_upper_bound(identity,multiply(inverse(a),multiply(identity,U_512)))) ),
    inference(extension,[status(thm),parent(t82:2)],[equality_2]) ).

cnf(t85,plain,
    $false,
    inference(connection,[status(thm),parent(t84:1)],[t84:1,t82:2]) ).

cnf(t86,plain,
    greatest_lower_bound(identity,least_upper_bound(identity,multiply(inverse(a),multiply(identity,U_512)))) = identity,
    inference(extension,[status(thm),parent(t84:2)],[glb_absorbtion]) ).

cnf(t87,plain,
    $false,
    inference(connection,[status(thm),parent(t86:1)],[t86:1,t84:2]) ).

cnf(t88,plain,
    ( greatest_lower_bound(multiply(inverse(a),multiply(identity,a)),multiply(inverse(a),multiply(identity,least_upper_bound(a,U_512)))) != greatest_lower_bound(identity,least_upper_bound(identity,multiply(inverse(a),multiply(identity,U_512))))
    | greatest_lower_bound(identity,least_upper_bound(identity,multiply(inverse(a),multiply(identity,U_512)))) = greatest_lower_bound(multiply(inverse(a),multiply(identity,a)),multiply(inverse(a),multiply(identity,least_upper_bound(a,U_512)))) ),
    inference(extension,[status(thm),parent(t82:3)],[equality_2]) ).

cnf(t89,plain,
    $false,
    inference(connection,[status(thm),parent(t88:1)],[t88:1,t82:3]) ).

cnf(t90,plain,
    ( multiply(inverse(a),multiply(identity,least_upper_bound(a,U_512))) != least_upper_bound(identity,multiply(inverse(a),multiply(identity,U_512)))
    | multiply(inverse(a),multiply(identity,a)) != identity
    | greatest_lower_bound(multiply(inverse(a),multiply(identity,a)),multiply(inverse(a),multiply(identity,least_upper_bound(a,U_512)))) = greatest_lower_bound(identity,least_upper_bound(identity,multiply(inverse(a),multiply(identity,U_512)))) ),
    inference(extension,[status(thm),parent(t88:2)],[equality_6]) ).

cnf(t91,plain,
    $false,
    inference(connection,[status(thm),parent(t90:1)],[t90:1,t88:2]) ).

cnf(t92,plain,
    ( multiply(inverse(a),a) != identity
    | multiply(inverse(a),multiply(identity,a)) != multiply(inverse(a),a)
    | multiply(inverse(a),multiply(identity,a)) = identity ),
    inference(extension,[status(thm),parent(t90:2)],[equality_3]) ).

cnf(t93,plain,
    $false,
    inference(connection,[status(thm),parent(t92:1)],[t92:1,t90:2]) ).

cnf(t94,plain,
    ( multiply(identity,a) != a
    | inverse(a) != inverse(a)
    | multiply(inverse(a),multiply(identity,a)) = multiply(inverse(a),a) ),
    inference(extension,[status(thm),parent(t92:2)],[equality_4]) ).

cnf(t95,plain,
    $false,
    inference(connection,[status(thm),parent(t94:1)],[t94:1,t92:2]) ).

cnf(t96,plain,
    ( a != a
    | inverse(a) = inverse(a) ),
    inference(extension,[status(thm),parent(t94:2)],[equality_5]) ).

cnf(t97,plain,
    $false,
    inference(connection,[status(thm),parent(t96:1)],[t96:1,t94:2]) ).

cnf(t98,plain,
    a = a,
    inference(extension,[status(thm),parent(t96:2)],[equality_1]) ).

cnf(t99,plain,
    $false,
    inference(connection,[status(thm),parent(t98:1)],[t98:1,t96:2]) ).

cnf(t100,plain,
    multiply(identity,a) = a,
    inference(extension,[status(thm),parent(t94:3)],[left_identity]) ).

cnf(t101,plain,
    $false,
    inference(connection,[status(thm),parent(t100:1)],[t100:1,t94:3]) ).

cnf(t102,plain,
    multiply(inverse(a),a) = identity,
    inference(extension,[status(thm),parent(t92:3)],[left_inverse]) ).

cnf(t103,plain,
    $false,
    inference(connection,[status(thm),parent(t102:1)],[t102:1,t92:3]) ).

cnf(l46,lemma,
    multiply(inverse(a),multiply(identity,a)) = identity,
    inference(lemma,[status(cth),parent(t90:2),below(t88:2)],[t90:2]) ).

cnf(t104,plain,
    ( multiply(inverse(a),least_upper_bound(multiply(identity,a),multiply(identity,U_512))) != least_upper_bound(identity,multiply(inverse(a),multiply(identity,U_512)))
    | multiply(inverse(a),multiply(identity,least_upper_bound(a,U_512))) != multiply(inverse(a),least_upper_bound(multiply(identity,a),multiply(identity,U_512)))
    | multiply(inverse(a),multiply(identity,least_upper_bound(a,U_512))) = least_upper_bound(identity,multiply(inverse(a),multiply(identity,U_512))) ),
    inference(extension,[status(thm),parent(t90:3)],[equality_3]) ).

cnf(t105,plain,
    $false,
    inference(connection,[status(thm),parent(t104:1)],[t104:1,t90:3]) ).

cnf(t106,plain,
    ( multiply(identity,least_upper_bound(a,U_512)) != least_upper_bound(multiply(identity,a),multiply(identity,U_512))
    | inverse(a) != inverse(a)
    | multiply(inverse(a),multiply(identity,least_upper_bound(a,U_512))) = multiply(inverse(a),least_upper_bound(multiply(identity,a),multiply(identity,U_512))) ),
    inference(extension,[status(thm),parent(t104:2)],[equality_4]) ).

cnf(t107,plain,
    $false,
    inference(connection,[status(thm),parent(t106:1)],[t106:1,t104:2]) ).

cnf(t108,plain,
    ( a != a
    | inverse(a) = inverse(a) ),
    inference(extension,[status(thm),parent(t106:2)],[equality_5]) ).

cnf(t109,plain,
    $false,
    inference(connection,[status(thm),parent(t108:1)],[t108:1,t106:2]) ).

cnf(t110,plain,
    a = a,
    inference(extension,[status(thm),parent(t108:2)],[equality_1]) ).

cnf(t111,plain,
    $false,
    inference(connection,[status(thm),parent(t110:1)],[t110:1,t108:2]) ).

cnf(t112,plain,
    multiply(identity,least_upper_bound(a,U_512)) = least_upper_bound(multiply(identity,a),multiply(identity,U_512)),
    inference(extension,[status(thm),parent(t106:3)],[monotony_lub1]) ).

cnf(t113,plain,
    $false,
    inference(connection,[status(thm),parent(t112:1)],[t112:1,t106:3]) ).

cnf(t114,plain,
    ( least_upper_bound(multiply(inverse(a),multiply(identity,a)),multiply(inverse(a),multiply(identity,U_512))) != least_upper_bound(identity,multiply(inverse(a),multiply(identity,U_512)))
    | multiply(inverse(a),least_upper_bound(multiply(identity,a),multiply(identity,U_512))) != least_upper_bound(multiply(inverse(a),multiply(identity,a)),multiply(inverse(a),multiply(identity,U_512)))
    | multiply(inverse(a),least_upper_bound(multiply(identity,a),multiply(identity,U_512))) = least_upper_bound(identity,multiply(inverse(a),multiply(identity,U_512))) ),
    inference(extension,[status(thm),parent(t104:3)],[equality_3]) ).

cnf(t115,plain,
    $false,
    inference(connection,[status(thm),parent(t114:1)],[t114:1,t104:3]) ).

cnf(t116,plain,
    multiply(inverse(a),least_upper_bound(multiply(identity,a),multiply(identity,U_512))) = least_upper_bound(multiply(inverse(a),multiply(identity,a)),multiply(inverse(a),multiply(identity,U_512))),
    inference(extension,[status(thm),parent(t114:2)],[monotony_lub1]) ).

cnf(t117,plain,
    $false,
    inference(connection,[status(thm),parent(t116:1)],[t116:1,t114:2]) ).

cnf(t118,plain,
    ( multiply(inverse(a),multiply(identity,U_512)) != multiply(inverse(a),multiply(identity,U_512))
    | multiply(inverse(a),multiply(identity,a)) != identity
    | least_upper_bound(multiply(inverse(a),multiply(identity,a)),multiply(inverse(a),multiply(identity,U_512))) = least_upper_bound(identity,multiply(inverse(a),multiply(identity,U_512))) ),
    inference(extension,[status(thm),parent(t114:3)],[equality_7]) ).

cnf(t119,plain,
    $false,
    inference(connection,[status(thm),parent(t118:1)],[t118:1,t114:3]) ).

cnf(t120,plain,
    multiply(inverse(a),multiply(identity,a)) = identity,
    inference(lemma_extension,[status(thm),parent(t118:2)],[l46:1]) ).

cnf(t121,plain,
    $false,
    inference(connection,[status(thm),parent(t120:1)],[t120:1,t118:2]) ).

cnf(t122,plain,
    multiply(inverse(a),multiply(identity,U_512)) = multiply(inverse(a),multiply(identity,U_512)),
    inference(extension,[status(thm),parent(t118:3)],[equality_1]) ).

cnf(t123,plain,
    $false,
    inference(connection,[status(thm),parent(t122:1)],[t122:1,t118:3]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GRP175-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.03  This is a CNF_UNS_RFO_PEQ_UEQ problem
% 0.00/0.04  % Command  : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.35  % Computer : n019.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Sat Sep 19 08:54:50 UTC 2026
% 0.12/0.36  % CPUTime  : 
% 37.65/38.00  % SZS status Unsatisfiable for theBenchmark
% 37.65/38.00  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------