TSTP Solution File: GRP187-1 by CSE_E---1.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : GRP187-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s

% Computer : n003.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 00:17:38 EDT 2023

% Result   : Unsatisfiable 9.82s 9.91s
% Output   : CNFRefutation 9.82s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   26
%            Number of leaves      :   24
% Syntax   : Number of formulae    :  174 ( 167 unt;   7 typ;   0 def)
%            Number of atoms       :  167 ( 166 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    2 (   2   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    2 (   1 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    7 (   4   >;   3   *;   0   +;   0  <<)
%            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   :  267 (  35 sgn;   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_22,type,
    identity: $i ).

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

tff(decl_24,type,
    inverse: $i > $i ).

tff(decl_25,type,
    greatest_lower_bound: ( $i * $i ) > $i ).

tff(decl_26,type,
    least_upper_bound: ( $i * $i ) > $i ).

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

tff(decl_28,type,
    b: $i ).

cnf(associativity,axiom,
    multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
    file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',associativity) ).

cnf(left_inverse,axiom,
    multiply(inverse(X1),X1) = identity,
    file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_inverse) ).

cnf(left_identity,axiom,
    multiply(identity,X1) = X1,
    file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_identity) ).

cnf(glb_absorbtion,axiom,
    greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
    file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',glb_absorbtion) ).

cnf(symmetry_of_lub,axiom,
    least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
    file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',symmetry_of_lub) ).

cnf(associativity_of_glb,axiom,
    greatest_lower_bound(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(greatest_lower_bound(X1,X2),X3),
    file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',associativity_of_glb) ).

cnf(lub_absorbtion,axiom,
    least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
    file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',lub_absorbtion) ).

cnf(symmetry_of_glb,axiom,
    greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
    file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',symmetry_of_glb) ).

cnf(p33_1,hypothesis,
    greatest_lower_bound(least_upper_bound(a,inverse(a)),least_upper_bound(b,inverse(b))) = identity,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p33_1) ).

cnf(monotony_glb2,axiom,
    multiply(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(multiply(X1,X3),multiply(X2,X3)),
    file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_glb2) ).

cnf(idempotence_of_gld,axiom,
    greatest_lower_bound(X1,X1) = X1,
    file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',idempotence_of_gld) ).

cnf(monotony_glb1,axiom,
    multiply(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(multiply(X1,X2),multiply(X1,X3)),
    file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_glb1) ).

cnf(monotony_lub1,axiom,
    multiply(X1,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)),
    file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_lub1) ).

cnf(associativity_of_lub,axiom,
    least_upper_bound(X1,least_upper_bound(X2,X3)) = least_upper_bound(least_upper_bound(X1,X2),X3),
    file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',associativity_of_lub) ).

cnf(idempotence_of_lub,axiom,
    least_upper_bound(X1,X1) = X1,
    file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',idempotence_of_lub) ).

cnf(monotony_lub2,axiom,
    multiply(least_upper_bound(X1,X2),X3) = least_upper_bound(multiply(X1,X3),multiply(X2,X3)),
    file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_lub2) ).

cnf(prove_p33,negated_conjecture,
    multiply(a,b) != multiply(b,a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p33) ).

cnf(c_0_17,axiom,
    multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
    associativity ).

cnf(c_0_18,axiom,
    multiply(inverse(X1),X1) = identity,
    left_inverse ).

cnf(c_0_19,axiom,
    multiply(identity,X1) = X1,
    left_identity ).

cnf(c_0_20,plain,
    multiply(inverse(X1),multiply(X1,X2)) = X2,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).

cnf(c_0_21,plain,
    multiply(inverse(inverse(X1)),identity) = X1,
    inference(spm,[status(thm)],[c_0_20,c_0_18]) ).

cnf(c_0_22,plain,
    multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
    inference(spm,[status(thm)],[c_0_20,c_0_20]) ).

cnf(c_0_23,axiom,
    greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
    glb_absorbtion ).

cnf(c_0_24,axiom,
    least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
    symmetry_of_lub ).

cnf(c_0_25,plain,
    multiply(X1,identity) = X1,
    inference(rw,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_26,axiom,
    greatest_lower_bound(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(greatest_lower_bound(X1,X2),X3),
    associativity_of_glb ).

cnf(c_0_27,plain,
    greatest_lower_bound(X1,least_upper_bound(X2,X1)) = X1,
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_28,axiom,
    least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
    lub_absorbtion ).

cnf(c_0_29,plain,
    inverse(inverse(X1)) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_25]),c_0_25]) ).

cnf(c_0_30,axiom,
    greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
    symmetry_of_glb ).

cnf(c_0_31,plain,
    greatest_lower_bound(X1,greatest_lower_bound(least_upper_bound(X1,X2),X3)) = greatest_lower_bound(X1,X3),
    inference(spm,[status(thm)],[c_0_26,c_0_23]) ).

cnf(c_0_32,plain,
    greatest_lower_bound(X1,greatest_lower_bound(X2,X1)) = greatest_lower_bound(X1,X2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_26]) ).

cnf(c_0_33,plain,
    multiply(X1,inverse(X1)) = identity,
    inference(spm,[status(thm)],[c_0_18,c_0_29]) ).

cnf(c_0_34,plain,
    least_upper_bound(X1,greatest_lower_bound(X2,X1)) = X1,
    inference(spm,[status(thm)],[c_0_28,c_0_30]) ).

cnf(c_0_35,plain,
    greatest_lower_bound(X1,greatest_lower_bound(X2,least_upper_bound(X1,X3))) = greatest_lower_bound(X1,X2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_31]) ).

cnf(c_0_36,hypothesis,
    greatest_lower_bound(least_upper_bound(a,inverse(a)),least_upper_bound(b,inverse(b))) = identity,
    p33_1 ).

cnf(c_0_37,axiom,
    multiply(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(multiply(X1,X3),multiply(X2,X3)),
    monotony_glb2 ).

cnf(c_0_38,axiom,
    greatest_lower_bound(X1,X1) = X1,
    idempotence_of_gld ).

cnf(c_0_39,plain,
    multiply(X1,multiply(X2,inverse(multiply(X1,X2)))) = identity,
    inference(spm,[status(thm)],[c_0_17,c_0_33]) ).

cnf(c_0_40,plain,
    least_upper_bound(X1,greatest_lower_bound(X2,greatest_lower_bound(X3,X1))) = X1,
    inference(spm,[status(thm)],[c_0_34,c_0_26]) ).

cnf(c_0_41,hypothesis,
    greatest_lower_bound(b,least_upper_bound(a,inverse(a))) = greatest_lower_bound(identity,b),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_30]) ).

cnf(c_0_42,axiom,
    multiply(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(multiply(X1,X2),multiply(X1,X3)),
    monotony_glb1 ).

cnf(c_0_43,plain,
    multiply(greatest_lower_bound(X1,X2),inverse(X2)) = greatest_lower_bound(identity,multiply(X1,inverse(X2))),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_33]),c_0_30]) ).

cnf(c_0_44,plain,
    greatest_lower_bound(X1,greatest_lower_bound(X1,X2)) = greatest_lower_bound(X1,X2),
    inference(spm,[status(thm)],[c_0_26,c_0_38]) ).

cnf(c_0_45,plain,
    multiply(X1,inverse(multiply(X2,X1))) = inverse(X2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_39]),c_0_25]) ).

cnf(c_0_46,axiom,
    multiply(X1,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)),
    monotony_lub1 ).

cnf(c_0_47,axiom,
    least_upper_bound(X1,least_upper_bound(X2,X3)) = least_upper_bound(least_upper_bound(X1,X2),X3),
    associativity_of_lub ).

cnf(c_0_48,axiom,
    least_upper_bound(X1,X1) = X1,
    idempotence_of_lub ).

cnf(c_0_49,plain,
    least_upper_bound(X1,greatest_lower_bound(X2,greatest_lower_bound(X1,X3))) = X1,
    inference(spm,[status(thm)],[c_0_40,c_0_30]) ).

cnf(c_0_50,hypothesis,
    greatest_lower_bound(a,greatest_lower_bound(identity,b)) = greatest_lower_bound(a,b),
    inference(spm,[status(thm)],[c_0_35,c_0_41]) ).

cnf(c_0_51,plain,
    multiply(inverse(X1),greatest_lower_bound(X2,multiply(X1,X3))) = greatest_lower_bound(multiply(inverse(X1),X2),X3),
    inference(spm,[status(thm)],[c_0_42,c_0_20]) ).

cnf(c_0_52,plain,
    greatest_lower_bound(identity,multiply(X1,inverse(greatest_lower_bound(X1,X2)))) = identity,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_33]) ).

cnf(c_0_53,plain,
    multiply(inverse(X1),inverse(X2)) = inverse(multiply(X2,X1)),
    inference(spm,[status(thm)],[c_0_20,c_0_45]) ).

cnf(c_0_54,plain,
    multiply(inverse(X1),least_upper_bound(X2,X1)) = least_upper_bound(identity,multiply(inverse(X1),X2)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_18]),c_0_24]) ).

cnf(c_0_55,plain,
    least_upper_bound(X1,least_upper_bound(X1,X2)) = least_upper_bound(X1,X2),
    inference(spm,[status(thm)],[c_0_47,c_0_48]) ).

cnf(c_0_56,hypothesis,
    least_upper_bound(identity,greatest_lower_bound(a,b)) = identity,
    inference(spm,[status(thm)],[c_0_49,c_0_50]) ).

cnf(c_0_57,plain,
    greatest_lower_bound(inverse(X1),inverse(greatest_lower_bound(X1,X2))) = inverse(X1),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_25]),c_0_25]) ).

cnf(c_0_58,plain,
    greatest_lower_bound(inverse(X1),multiply(inverse(X1),X2)) = multiply(inverse(X1),greatest_lower_bound(X2,identity)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_33]),c_0_30]) ).

cnf(c_0_59,plain,
    inverse(multiply(inverse(X1),X2)) = multiply(inverse(X2),X1),
    inference(spm,[status(thm)],[c_0_53,c_0_29]) ).

cnf(c_0_60,plain,
    least_upper_bound(identity,multiply(inverse(least_upper_bound(X1,X2)),X1)) = identity,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_18]) ).

cnf(c_0_61,hypothesis,
    least_upper_bound(identity,least_upper_bound(greatest_lower_bound(a,b),X1)) = least_upper_bound(identity,X1),
    inference(spm,[status(thm)],[c_0_47,c_0_56]) ).

cnf(c_0_62,plain,
    least_upper_bound(X1,least_upper_bound(X2,X1)) = least_upper_bound(X1,X2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_23]),c_0_47]) ).

cnf(c_0_63,plain,
    greatest_lower_bound(inverse(X1),inverse(greatest_lower_bound(X2,X1))) = inverse(X1),
    inference(spm,[status(thm)],[c_0_57,c_0_30]) ).

cnf(c_0_64,plain,
    greatest_lower_bound(X1,multiply(inverse(greatest_lower_bound(X2,identity)),X1)) = X1,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_29]),c_0_59]),c_0_29]) ).

cnf(c_0_65,hypothesis,
    least_upper_bound(identity,inverse(least_upper_bound(identity,X1))) = identity,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_25]) ).

cnf(c_0_66,plain,
    least_upper_bound(X1,least_upper_bound(greatest_lower_bound(X2,X1),X3)) = least_upper_bound(X1,X3),
    inference(spm,[status(thm)],[c_0_47,c_0_34]) ).

cnf(c_0_67,plain,
    least_upper_bound(X1,least_upper_bound(X2,least_upper_bound(X3,X1))) = least_upper_bound(X1,least_upper_bound(X2,X3)),
    inference(spm,[status(thm)],[c_0_62,c_0_47]) ).

cnf(c_0_68,hypothesis,
    least_upper_bound(b,least_upper_bound(identity,inverse(b))) = least_upper_bound(b,inverse(b)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_36]),c_0_47]),c_0_24]) ).

cnf(c_0_69,plain,
    least_upper_bound(inverse(X1),inverse(greatest_lower_bound(X2,X1))) = inverse(greatest_lower_bound(X2,X1)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_63]),c_0_24]) ).

cnf(c_0_70,plain,
    greatest_lower_bound(X1,multiply(inverse(greatest_lower_bound(identity,X2)),X1)) = X1,
    inference(spm,[status(thm)],[c_0_64,c_0_30]) ).

cnf(c_0_71,hypothesis,
    greatest_lower_bound(identity,inverse(least_upper_bound(identity,X1))) = inverse(least_upper_bound(identity,X1)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_65]),c_0_30]) ).

cnf(c_0_72,plain,
    greatest_lower_bound(least_upper_bound(X1,X2),least_upper_bound(greatest_lower_bound(X3,X1),X2)) = least_upper_bound(greatest_lower_bound(X3,X1),X2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_66]),c_0_30]) ).

cnf(c_0_73,plain,
    greatest_lower_bound(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(X2,greatest_lower_bound(X3,X1)),
    inference(spm,[status(thm)],[c_0_26,c_0_30]) ).

cnf(c_0_74,plain,
    greatest_lower_bound(X1,greatest_lower_bound(X2,greatest_lower_bound(X1,X3))) = greatest_lower_bound(X1,greatest_lower_bound(X2,X3)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_32]),c_0_26]),c_0_26]) ).

cnf(c_0_75,hypothesis,
    greatest_lower_bound(identity,least_upper_bound(a,inverse(a))) = identity,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_36]),c_0_30]) ).

cnf(c_0_76,hypothesis,
    least_upper_bound(inverse(b),least_upper_bound(identity,b)) = least_upper_bound(b,inverse(b)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_62]),c_0_24]),c_0_24]) ).

cnf(c_0_77,plain,
    least_upper_bound(X1,least_upper_bound(X2,X3)) = least_upper_bound(X2,least_upper_bound(X3,X1)),
    inference(spm,[status(thm)],[c_0_47,c_0_24]) ).

cnf(c_0_78,plain,
    greatest_lower_bound(X1,least_upper_bound(X2,least_upper_bound(X3,X1))) = X1,
    inference(spm,[status(thm)],[c_0_27,c_0_47]) ).

cnf(c_0_79,plain,
    least_upper_bound(inverse(X1),inverse(least_upper_bound(X1,X2))) = inverse(X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_23]),c_0_24]) ).

cnf(c_0_80,hypothesis,
    greatest_lower_bound(X1,multiply(least_upper_bound(identity,X2),X1)) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_29]) ).

cnf(c_0_81,plain,
    multiply(X1,multiply(inverse(X1),X2)) = X2,
    inference(spm,[status(thm)],[c_0_20,c_0_29]) ).

cnf(c_0_82,plain,
    multiply(inverse(identity),X1) = X1,
    inference(spm,[status(thm)],[c_0_20,c_0_19]) ).

cnf(c_0_83,hypothesis,
    least_upper_bound(a,least_upper_bound(identity,inverse(a))) = least_upper_bound(a,inverse(a)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_36]),c_0_47]),c_0_24]) ).

cnf(c_0_84,plain,
    greatest_lower_bound(X1,greatest_lower_bound(X2,least_upper_bound(X3,greatest_lower_bound(X1,X2)))) = greatest_lower_bound(X1,X2),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_85,plain,
    greatest_lower_bound(X1,least_upper_bound(greatest_lower_bound(X2,X1),greatest_lower_bound(X3,X1))) = least_upper_bound(greatest_lower_bound(X2,X1),greatest_lower_bound(X3,X1)),
    inference(spm,[status(thm)],[c_0_72,c_0_34]) ).

cnf(c_0_86,plain,
    greatest_lower_bound(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(X3,greatest_lower_bound(X2,X1)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_32]),c_0_26]),c_0_32]) ).

cnf(c_0_87,hypothesis,
    greatest_lower_bound(identity,greatest_lower_bound(X1,least_upper_bound(a,inverse(a)))) = greatest_lower_bound(identity,X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_32]) ).

cnf(c_0_88,plain,
    greatest_lower_bound(least_upper_bound(X1,X2),least_upper_bound(X1,least_upper_bound(X2,X3))) = least_upper_bound(X1,X2),
    inference(spm,[status(thm)],[c_0_23,c_0_47]) ).

cnf(c_0_89,hypothesis,
    least_upper_bound(identity,least_upper_bound(b,inverse(b))) = least_upper_bound(b,inverse(b)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_76,c_0_77]),c_0_24]),c_0_77]),c_0_24]) ).

cnf(c_0_90,plain,
    greatest_lower_bound(X1,multiply(greatest_lower_bound(X2,identity),X1)) = multiply(greatest_lower_bound(X2,identity),X1),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_64]),c_0_29]),c_0_29]),c_0_30]) ).

cnf(c_0_91,plain,
    greatest_lower_bound(X1,greatest_lower_bound(X2,least_upper_bound(X3,X1))) = greatest_lower_bound(X1,X2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_28]),c_0_26]) ).

cnf(c_0_92,hypothesis,
    greatest_lower_bound(a,least_upper_bound(b,inverse(b))) = greatest_lower_bound(identity,a),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_36]),c_0_30]) ).

cnf(c_0_93,plain,
    least_upper_bound(X1,inverse(least_upper_bound(inverse(X1),X2))) = X1,
    inference(spm,[status(thm)],[c_0_79,c_0_29]) ).

cnf(c_0_94,hypothesis,
    least_upper_bound(X1,multiply(least_upper_bound(identity,X2),X1)) = multiply(least_upper_bound(identity,X2),X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_80]),c_0_24]) ).

cnf(c_0_95,plain,
    inverse(multiply(X1,inverse(X2))) = multiply(X2,inverse(X1)),
    inference(spm,[status(thm)],[c_0_81,c_0_45]) ).

cnf(c_0_96,plain,
    greatest_lower_bound(X1,inverse(greatest_lower_bound(inverse(X1),X2))) = X1,
    inference(spm,[status(thm)],[c_0_57,c_0_29]) ).

cnf(c_0_97,plain,
    multiply(inverse(inverse(identity)),X1) = X1,
    inference(spm,[status(thm)],[c_0_20,c_0_82]) ).

cnf(c_0_98,hypothesis,
    least_upper_bound(inverse(a),least_upper_bound(identity,a)) = least_upper_bound(a,inverse(a)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_83]),c_0_62]),c_0_24]),c_0_24]) ).

cnf(c_0_99,plain,
    greatest_lower_bound(X1,least_upper_bound(greatest_lower_bound(X2,X3),greatest_lower_bound(X1,X3))) = greatest_lower_bound(X1,X3),
    inference(spm,[status(thm)],[c_0_84,c_0_85]) ).

cnf(c_0_100,hypothesis,
    greatest_lower_bound(least_upper_bound(a,inverse(a)),greatest_lower_bound(X1,least_upper_bound(b,inverse(b)))) = greatest_lower_bound(identity,X1),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_36]),c_0_86]),c_0_87]) ).

cnf(c_0_101,hypothesis,
    greatest_lower_bound(least_upper_bound(identity,b),least_upper_bound(b,inverse(b))) = least_upper_bound(identity,b),
    inference(spm,[status(thm)],[c_0_88,c_0_89]) ).

cnf(c_0_102,plain,
    least_upper_bound(X1,multiply(greatest_lower_bound(X2,identity),X1)) = X1,
    inference(spm,[status(thm)],[c_0_28,c_0_90]) ).

cnf(c_0_103,hypothesis,
    greatest_lower_bound(inverse(b),greatest_lower_bound(identity,a)) = greatest_lower_bound(a,inverse(b)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_30]) ).

cnf(c_0_104,hypothesis,
    least_upper_bound(X1,multiply(X1,inverse(least_upper_bound(identity,X2)))) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_94]),c_0_95]) ).

cnf(c_0_105,plain,
    least_upper_bound(X1,inverse(greatest_lower_bound(inverse(X1),X2))) = inverse(greatest_lower_bound(inverse(X1),X2)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_96]),c_0_24]) ).

cnf(c_0_106,plain,
    inverse(identity) = identity,
    inference(spm,[status(thm)],[c_0_18,c_0_97]) ).

cnf(c_0_107,plain,
    greatest_lower_bound(X1,greatest_lower_bound(X2,greatest_lower_bound(X3,X1))) = greatest_lower_bound(X1,greatest_lower_bound(X2,X3)),
    inference(spm,[status(thm)],[c_0_32,c_0_26]) ).

cnf(c_0_108,hypothesis,
    least_upper_bound(identity,least_upper_bound(a,inverse(a))) = least_upper_bound(a,inverse(a)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_98,c_0_77]),c_0_24]),c_0_77]),c_0_24]) ).

cnf(c_0_109,plain,
    multiply(inverse(X1),greatest_lower_bound(X2,X1)) = greatest_lower_bound(identity,multiply(inverse(X1),X2)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_18]),c_0_30]) ).

cnf(c_0_110,plain,
    greatest_lower_bound(X1,greatest_lower_bound(least_upper_bound(X2,X1),X3)) = greatest_lower_bound(X1,X3),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_111,plain,
    greatest_lower_bound(X1,least_upper_bound(X2,greatest_lower_bound(X1,least_upper_bound(X3,X2)))) = greatest_lower_bound(X1,least_upper_bound(X3,X2)),
    inference(spm,[status(thm)],[c_0_99,c_0_27]) ).

cnf(c_0_112,hypothesis,
    greatest_lower_bound(least_upper_bound(identity,b),least_upper_bound(a,inverse(a))) = identity,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_101]),c_0_23]),c_0_30]) ).

cnf(c_0_113,plain,
    least_upper_bound(X1,multiply(greatest_lower_bound(identity,X2),X1)) = X1,
    inference(spm,[status(thm)],[c_0_102,c_0_30]) ).

cnf(c_0_114,hypothesis,
    greatest_lower_bound(identity,greatest_lower_bound(a,inverse(b))) = greatest_lower_bound(a,inverse(b)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_103,c_0_73]),c_0_30]),c_0_73]),c_0_30]) ).

cnf(c_0_115,axiom,
    multiply(least_upper_bound(X1,X2),X3) = least_upper_bound(multiply(X1,X3),multiply(X2,X3)),
    monotony_lub2 ).

cnf(c_0_116,hypothesis,
    least_upper_bound(X1,multiply(X1,greatest_lower_bound(identity,X2))) = X1,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_105]),c_0_106]),c_0_29]) ).

cnf(c_0_117,hypothesis,
    greatest_lower_bound(b,greatest_lower_bound(X1,least_upper_bound(a,inverse(a)))) = greatest_lower_bound(identity,greatest_lower_bound(X1,b)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_41]),c_0_107]),c_0_86]) ).

cnf(c_0_118,hypothesis,
    greatest_lower_bound(least_upper_bound(identity,a),least_upper_bound(a,inverse(a))) = least_upper_bound(identity,a),
    inference(spm,[status(thm)],[c_0_88,c_0_108]) ).

cnf(c_0_119,plain,
    multiply(X1,least_upper_bound(X2,inverse(X1))) = least_upper_bound(identity,multiply(X1,X2)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_33]),c_0_24]) ).

cnf(c_0_120,plain,
    multiply(inverse(greatest_lower_bound(least_upper_bound(X1,X2),X3)),greatest_lower_bound(X2,X3)) = greatest_lower_bound(identity,multiply(inverse(greatest_lower_bound(least_upper_bound(X1,X2),X3)),X2)),
    inference(spm,[status(thm)],[c_0_109,c_0_110]) ).

cnf(c_0_121,hypothesis,
    greatest_lower_bound(least_upper_bound(identity,b),least_upper_bound(identity,inverse(a))) = identity,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_112]),c_0_24]) ).

cnf(c_0_122,hypothesis,
    least_upper_bound(X1,multiply(greatest_lower_bound(a,inverse(b)),X1)) = X1,
    inference(spm,[status(thm)],[c_0_113,c_0_114]) ).

cnf(c_0_123,plain,
    multiply(least_upper_bound(X1,inverse(X2)),X2) = least_upper_bound(identity,multiply(X1,X2)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_115,c_0_18]),c_0_24]) ).

cnf(c_0_124,hypothesis,
    least_upper_bound(X1,multiply(X1,greatest_lower_bound(a,inverse(b)))) = X1,
    inference(spm,[status(thm)],[c_0_116,c_0_114]) ).

cnf(c_0_125,hypothesis,
    greatest_lower_bound(b,least_upper_bound(identity,a)) = greatest_lower_bound(identity,b),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_118]),c_0_31]) ).

cnf(c_0_126,plain,
    multiply(X1,greatest_lower_bound(X2,least_upper_bound(X3,inverse(X1)))) = greatest_lower_bound(multiply(X1,X2),least_upper_bound(identity,multiply(X1,X3))),
    inference(spm,[status(thm)],[c_0_42,c_0_119]) ).

cnf(c_0_127,hypothesis,
    greatest_lower_bound(b,least_upper_bound(identity,inverse(a))) = greatest_lower_bound(identity,b),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_120,c_0_121]),c_0_106]),c_0_19]),c_0_106]),c_0_19]) ).

cnf(c_0_128,plain,
    greatest_lower_bound(X1,multiply(X1,X2)) = multiply(X1,greatest_lower_bound(identity,X2)),
    inference(spm,[status(thm)],[c_0_42,c_0_25]) ).

cnf(c_0_129,hypothesis,
    least_upper_bound(b,greatest_lower_bound(identity,multiply(a,b))) = b,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_122,c_0_43]),c_0_29]),c_0_29]),c_0_29]) ).

cnf(c_0_130,plain,
    multiply(greatest_lower_bound(X1,least_upper_bound(X2,inverse(X3))),X3) = greatest_lower_bound(multiply(X1,X3),least_upper_bound(identity,multiply(X2,X3))),
    inference(spm,[status(thm)],[c_0_37,c_0_123]) ).

cnf(c_0_131,plain,
    greatest_lower_bound(X1,multiply(X2,X1)) = multiply(greatest_lower_bound(identity,X2),X1),
    inference(spm,[status(thm)],[c_0_37,c_0_19]) ).

cnf(c_0_132,hypothesis,
    least_upper_bound(b,greatest_lower_bound(identity,multiply(b,a))) = b,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_124,c_0_109]),c_0_29]),c_0_29]),c_0_29]) ).

cnf(c_0_133,plain,
    multiply(inverse(multiply(X1,X2)),X1) = inverse(X2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_45]),c_0_29]) ).

cnf(c_0_134,hypothesis,
    greatest_lower_bound(b,greatest_lower_bound(X1,least_upper_bound(identity,a))) = greatest_lower_bound(X1,greatest_lower_bound(identity,b)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_125]),c_0_73]) ).

cnf(c_0_135,hypothesis,
    greatest_lower_bound(multiply(a,b),least_upper_bound(identity,a)) = greatest_lower_bound(a,multiply(a,b)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_126,c_0_127]),c_0_128]),c_0_25]) ).

cnf(c_0_136,hypothesis,
    greatest_lower_bound(identity,greatest_lower_bound(b,multiply(a,b))) = greatest_lower_bound(identity,multiply(a,b)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_129]),c_0_26]),c_0_30]) ).

cnf(c_0_137,hypothesis,
    greatest_lower_bound(multiply(b,a),least_upper_bound(identity,a)) = greatest_lower_bound(a,multiply(b,a)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_130,c_0_127]),c_0_131]),c_0_19]) ).

cnf(c_0_138,hypothesis,
    greatest_lower_bound(identity,greatest_lower_bound(b,multiply(b,a))) = greatest_lower_bound(identity,multiply(b,a)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_132]),c_0_26]),c_0_30]) ).

cnf(c_0_139,plain,
    multiply(greatest_lower_bound(X1,inverse(multiply(X2,X3))),X2) = greatest_lower_bound(multiply(X1,X2),inverse(X3)),
    inference(spm,[status(thm)],[c_0_37,c_0_133]) ).

cnf(c_0_140,plain,
    greatest_lower_bound(X1,multiply(X1,X2)) = multiply(X1,greatest_lower_bound(X2,identity)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_25]),c_0_30]) ).

cnf(c_0_141,plain,
    multiply(inverse(X1),greatest_lower_bound(X1,X2)) = greatest_lower_bound(identity,multiply(inverse(X1),X2)),
    inference(spm,[status(thm)],[c_0_42,c_0_18]) ).

cnf(c_0_142,hypothesis,
    greatest_lower_bound(a,greatest_lower_bound(b,multiply(a,b))) = greatest_lower_bound(identity,multiply(a,b)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_134,c_0_135]),c_0_73]),c_0_136]),c_0_73]),c_0_30]) ).

cnf(c_0_143,hypothesis,
    greatest_lower_bound(inverse(b),least_upper_bound(a,inverse(a))) = greatest_lower_bound(identity,inverse(b)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_36]),c_0_30]) ).

cnf(c_0_144,plain,
    multiply(greatest_lower_bound(X1,X2),inverse(X1)) = greatest_lower_bound(identity,multiply(X2,inverse(X1))),
    inference(spm,[status(thm)],[c_0_37,c_0_33]) ).

cnf(c_0_145,hypothesis,
    greatest_lower_bound(a,greatest_lower_bound(b,multiply(b,a))) = greatest_lower_bound(identity,multiply(b,a)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_134,c_0_137]),c_0_73]),c_0_138]),c_0_73]),c_0_30]) ).

cnf(c_0_146,plain,
    multiply(greatest_lower_bound(X1,multiply(X2,X3)),inverse(X3)) = greatest_lower_bound(multiply(X1,inverse(X3)),X2),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_139,c_0_53]),c_0_29]),c_0_29]) ).

cnf(c_0_147,plain,
    multiply(greatest_lower_bound(X1,multiply(X1,X2)),X3) = multiply(X1,multiply(greatest_lower_bound(X2,identity),X3)),
    inference(spm,[status(thm)],[c_0_17,c_0_140]) ).

cnf(c_0_148,plain,
    multiply(greatest_lower_bound(X1,greatest_lower_bound(X2,X3)),inverse(X2)) = greatest_lower_bound(identity,multiply(greatest_lower_bound(X1,X3),inverse(X2))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_43]),c_0_26]),c_0_37]),c_0_26]) ).

cnf(c_0_149,hypothesis,
    greatest_lower_bound(identity,greatest_lower_bound(b,multiply(inverse(a),b))) = greatest_lower_bound(b,inverse(a)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_141,c_0_142]),c_0_51]),c_0_25]),c_0_30]),c_0_51]),c_0_30]) ).

cnf(c_0_150,hypothesis,
    greatest_lower_bound(identity,greatest_lower_bound(inverse(a),inverse(b))) = greatest_lower_bound(inverse(a),inverse(b)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_143]),c_0_73]),c_0_30]) ).

cnf(c_0_151,plain,
    multiply(inverse(X1),greatest_lower_bound(X2,greatest_lower_bound(X1,X3))) = greatest_lower_bound(identity,multiply(inverse(X1),greatest_lower_bound(X2,X3))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_109]),c_0_26]),c_0_42]),c_0_26]) ).

cnf(c_0_152,hypothesis,
    greatest_lower_bound(identity,greatest_lower_bound(b,multiply(b,inverse(a)))) = greatest_lower_bound(b,inverse(a)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_144,c_0_145]),c_0_146]),c_0_19]),c_0_30]),c_0_147]),c_0_30]),c_0_43]),c_0_19]),c_0_128]) ).

cnf(c_0_153,hypothesis,
    greatest_lower_bound(inverse(a),inverse(b)) = greatest_lower_bound(identity,inverse(multiply(b,a))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_148,c_0_149]),c_0_144]),c_0_53]),c_0_146]),c_0_19]),c_0_30]),c_0_150]) ).

cnf(c_0_154,hypothesis,
    greatest_lower_bound(identity,inverse(multiply(b,a))) = greatest_lower_bound(identity,inverse(multiply(a,b))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_151,c_0_152]),c_0_141]),c_0_53]),c_0_51]),c_0_25]),c_0_30]),c_0_153]),c_0_44]) ).

cnf(c_0_155,hypothesis,
    greatest_lower_bound(inverse(a),inverse(b)) = greatest_lower_bound(identity,inverse(multiply(a,b))),
    inference(rw,[status(thm)],[c_0_153,c_0_154]) ).

cnf(c_0_156,plain,
    multiply(X1,greatest_lower_bound(X2,inverse(multiply(X3,X1)))) = greatest_lower_bound(multiply(X1,X2),inverse(X3)),
    inference(spm,[status(thm)],[c_0_42,c_0_45]) ).

cnf(c_0_157,hypothesis,
    greatest_lower_bound(identity,multiply(inverse(b),a)) = greatest_lower_bound(a,inverse(b)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_144,c_0_155]),c_0_29]),c_0_139]),c_0_19]),c_0_29]) ).

cnf(c_0_158,plain,
    multiply(X1,greatest_lower_bound(X2,inverse(X1))) = greatest_lower_bound(identity,multiply(X1,X2)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_33]),c_0_30]) ).

cnf(c_0_159,hypothesis,
    greatest_lower_bound(identity,multiply(a,inverse(b))) = greatest_lower_bound(a,inverse(b)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_141,c_0_153]),c_0_29]),c_0_156]),c_0_25]),c_0_29]) ).

cnf(c_0_160,plain,
    multiply(greatest_lower_bound(X1,inverse(X2)),X2) = greatest_lower_bound(identity,multiply(X1,X2)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_18]),c_0_30]) ).

cnf(c_0_161,plain,
    multiply(greatest_lower_bound(X1,X2),inverse(greatest_lower_bound(identity,multiply(inverse(X2),X1)))) = X2,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_109]),c_0_29]) ).

cnf(c_0_162,hypothesis,
    greatest_lower_bound(identity,multiply(b,a)) = greatest_lower_bound(a,b),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_157]),c_0_29]),c_0_158]),c_0_29]),c_0_25]),c_0_30]) ).

cnf(c_0_163,plain,
    multiply(inverse(greatest_lower_bound(identity,multiply(X1,X2))),X1) = inverse(greatest_lower_bound(X2,inverse(X1))),
    inference(spm,[status(thm)],[c_0_133,c_0_158]) ).

cnf(c_0_164,hypothesis,
    greatest_lower_bound(identity,multiply(a,b)) = greatest_lower_bound(a,b),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_146,c_0_159]),c_0_29]),c_0_160]),c_0_29]),c_0_19]),c_0_30]) ).

cnf(c_0_165,negated_conjecture,
    multiply(a,b) != multiply(b,a),
    prove_p33 ).

cnf(c_0_166,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_161,c_0_162]),c_0_25]),c_0_154]),c_0_163]),c_0_25]),c_0_164]),c_0_81]),c_0_165]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : GRP187-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.03/0.12  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.12/0.33  % Computer : n003.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 300
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Tue Aug 29 01:13:40 EDT 2023
% 0.12/0.34  % CPUTime  : 
% 0.19/0.56  start to proof: theBenchmark
% 9.82/9.91  % Version  : CSE_E---1.5
% 9.82/9.91  % Problem  : theBenchmark.p
% 9.82/9.91  % Proof found
% 9.82/9.91  % SZS status Theorem for theBenchmark.p
% 9.82/9.91  % SZS output start Proof
% See solution above
% 9.82/9.92  % Total time : 9.338000 s
% 9.82/9.92  % SZS output end Proof
% 9.82/9.92  % Total time : 9.341000 s
%------------------------------------------------------------------------------