TSTP Solution File: GRP141-1 by Metis---2.4

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Metis---2.4
% Problem  : GRP141-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : metis --show proof --show saturation %s

% Computer : n007.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  : 600s
% DateTime : Sat Jul 16 10:37:00 EDT 2022

% Result   : Unsatisfiable 0.13s 0.37s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   20
% Syntax   : Number of clauses     :   51 (  27 unt;   0 nHn;  43 RR)
%            Number of literals    :   87 (  86 equ;  39 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   36 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(symmetry_of_glb,axiom,
    greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X) ).

cnf(symmetry_of_lub,axiom,
    least_upper_bound(X,Y) = least_upper_bound(Y,X) ).

cnf(associativity_of_glb,axiom,
    greatest_lower_bound(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(greatest_lower_bound(X,Y),Z) ).

cnf(glb_absorbtion,axiom,
    greatest_lower_bound(X,least_upper_bound(X,Y)) = X ).

cnf(ax_glb1d_1,hypothesis,
    least_upper_bound(a,c) = a ).

cnf(ax_glb1d_2,hypothesis,
    least_upper_bound(b,c) = b ).

cnf(prove_ax_glb1d,negated_conjecture,
    greatest_lower_bound(greatest_lower_bound(a,b),c) != c ).

cnf(refute_0_0,plain,
    X0 = X0,
    introduced(tautology,[refl,[$fot(X0)]]) ).

cnf(refute_0_1,plain,
    ( X0 != X0
    | X0 != Y0
    | Y0 = X0 ),
    introduced(tautology,[equality,[$cnf( $equal(X0,X0) ),[0],$fot(Y0)]]) ).

cnf(refute_0_2,plain,
    ( X0 != Y0
    | Y0 = X0 ),
    inference(resolve,[$cnf( $equal(X0,X0) )],[refute_0_0,refute_0_1]) ).

cnf(refute_0_3,plain,
    ( greatest_lower_bound(X,greatest_lower_bound(Y,Z)) != greatest_lower_bound(greatest_lower_bound(X,Y),Z)
    | greatest_lower_bound(greatest_lower_bound(X,Y),Z) = greatest_lower_bound(X,greatest_lower_bound(Y,Z)) ),
    inference(subst,[],[refute_0_2:[bind(X0,$fot(greatest_lower_bound(X,greatest_lower_bound(Y,Z)))),bind(Y0,$fot(greatest_lower_bound(greatest_lower_bound(X,Y),Z)))]]) ).

cnf(refute_0_4,plain,
    greatest_lower_bound(greatest_lower_bound(X,Y),Z) = greatest_lower_bound(X,greatest_lower_bound(Y,Z)),
    inference(resolve,[$cnf( $equal(greatest_lower_bound(X,greatest_lower_bound(Y,Z)),greatest_lower_bound(greatest_lower_bound(X,Y),Z)) )],[associativity_of_glb,refute_0_3]) ).

cnf(refute_0_5,plain,
    greatest_lower_bound(greatest_lower_bound(a,b),c) = greatest_lower_bound(a,greatest_lower_bound(b,c)),
    inference(subst,[],[refute_0_4:[bind(X,$fot(a)),bind(Y,$fot(b)),bind(Z,$fot(c))]]) ).

cnf(refute_0_6,plain,
    ( greatest_lower_bound(a,greatest_lower_bound(b,c)) != c
    | greatest_lower_bound(greatest_lower_bound(a,b),c) != greatest_lower_bound(a,greatest_lower_bound(b,c))
    | greatest_lower_bound(greatest_lower_bound(a,b),c) = c ),
    introduced(tautology,[equality,[$cnf( $equal(greatest_lower_bound(greatest_lower_bound(a,b),c),greatest_lower_bound(a,greatest_lower_bound(b,c))) ),[1],$fot(c)]]) ).

cnf(refute_0_7,plain,
    ( greatest_lower_bound(a,greatest_lower_bound(b,c)) != c
    | greatest_lower_bound(greatest_lower_bound(a,b),c) = c ),
    inference(resolve,[$cnf( $equal(greatest_lower_bound(greatest_lower_bound(a,b),c),greatest_lower_bound(a,greatest_lower_bound(b,c))) )],[refute_0_5,refute_0_6]) ).

cnf(refute_0_8,plain,
    greatest_lower_bound(a,greatest_lower_bound(b,c)) != c,
    inference(resolve,[$cnf( $equal(greatest_lower_bound(greatest_lower_bound(a,b),c),c) )],[refute_0_7,prove_ax_glb1d]) ).

cnf(refute_0_9,plain,
    ( greatest_lower_bound(X,least_upper_bound(X,Y)) != X
    | least_upper_bound(X,Y) != least_upper_bound(Y,X)
    | greatest_lower_bound(X,least_upper_bound(Y,X)) = X ),
    introduced(tautology,[equality,[$cnf( $equal(greatest_lower_bound(X,least_upper_bound(X,Y)),X) ),[0,1],$fot(least_upper_bound(Y,X))]]) ).

cnf(refute_0_10,plain,
    ( greatest_lower_bound(X,least_upper_bound(X,Y)) != X
    | greatest_lower_bound(X,least_upper_bound(Y,X)) = X ),
    inference(resolve,[$cnf( $equal(least_upper_bound(X,Y),least_upper_bound(Y,X)) )],[symmetry_of_lub,refute_0_9]) ).

cnf(refute_0_11,plain,
    greatest_lower_bound(X,least_upper_bound(Y,X)) = X,
    inference(resolve,[$cnf( $equal(greatest_lower_bound(X,least_upper_bound(X,Y)),X) )],[glb_absorbtion,refute_0_10]) ).

cnf(refute_0_12,plain,
    greatest_lower_bound(c,least_upper_bound(a,c)) = c,
    inference(subst,[],[refute_0_11:[bind(X,$fot(c)),bind(Y,$fot(a))]]) ).

cnf(refute_0_13,plain,
    ( greatest_lower_bound(c,least_upper_bound(a,c)) != c
    | least_upper_bound(a,c) != a
    | greatest_lower_bound(c,a) = c ),
    introduced(tautology,[equality,[$cnf( $equal(greatest_lower_bound(c,least_upper_bound(a,c)),c) ),[0,1],$fot(a)]]) ).

cnf(refute_0_14,plain,
    ( greatest_lower_bound(c,least_upper_bound(a,c)) != c
    | greatest_lower_bound(c,a) = c ),
    inference(resolve,[$cnf( $equal(least_upper_bound(a,c),a) )],[ax_glb1d_1,refute_0_13]) ).

cnf(refute_0_15,plain,
    greatest_lower_bound(c,a) = c,
    inference(resolve,[$cnf( $equal(greatest_lower_bound(c,least_upper_bound(a,c)),c) )],[refute_0_12,refute_0_14]) ).

cnf(refute_0_16,plain,
    ( greatest_lower_bound(X,Y) != greatest_lower_bound(Y,X)
    | greatest_lower_bound(Y,X) = greatest_lower_bound(X,Y) ),
    inference(subst,[],[refute_0_2:[bind(X0,$fot(greatest_lower_bound(X,Y))),bind(Y0,$fot(greatest_lower_bound(Y,X)))]]) ).

cnf(refute_0_17,plain,
    greatest_lower_bound(Y,X) = greatest_lower_bound(X,Y),
    inference(resolve,[$cnf( $equal(greatest_lower_bound(X,Y),greatest_lower_bound(Y,X)) )],[symmetry_of_glb,refute_0_16]) ).

cnf(refute_0_18,plain,
    greatest_lower_bound(c,a) = greatest_lower_bound(a,c),
    inference(subst,[],[refute_0_17:[bind(X,$fot(a)),bind(Y,$fot(c))]]) ).

cnf(refute_0_19,plain,
    ( greatest_lower_bound(c,a) != c
    | greatest_lower_bound(c,a) != greatest_lower_bound(a,c)
    | greatest_lower_bound(a,c) = c ),
    introduced(tautology,[equality,[$cnf( $equal(greatest_lower_bound(c,a),c) ),[0],$fot(greatest_lower_bound(a,c))]]) ).

cnf(refute_0_20,plain,
    ( greatest_lower_bound(c,a) != c
    | greatest_lower_bound(a,c) = c ),
    inference(resolve,[$cnf( $equal(greatest_lower_bound(c,a),greatest_lower_bound(a,c)) )],[refute_0_18,refute_0_19]) ).

cnf(refute_0_21,plain,
    greatest_lower_bound(a,c) = c,
    inference(resolve,[$cnf( $equal(greatest_lower_bound(c,a),c) )],[refute_0_15,refute_0_20]) ).

cnf(refute_0_22,plain,
    greatest_lower_bound(c,least_upper_bound(b,c)) = c,
    inference(subst,[],[refute_0_11:[bind(X,$fot(c)),bind(Y,$fot(b))]]) ).

cnf(refute_0_23,plain,
    ( greatest_lower_bound(c,least_upper_bound(b,c)) != c
    | least_upper_bound(b,c) != b
    | greatest_lower_bound(c,b) = c ),
    introduced(tautology,[equality,[$cnf( $equal(greatest_lower_bound(c,least_upper_bound(b,c)),c) ),[0,1],$fot(b)]]) ).

cnf(refute_0_24,plain,
    ( greatest_lower_bound(c,least_upper_bound(b,c)) != c
    | greatest_lower_bound(c,b) = c ),
    inference(resolve,[$cnf( $equal(least_upper_bound(b,c),b) )],[ax_glb1d_2,refute_0_23]) ).

cnf(refute_0_25,plain,
    greatest_lower_bound(c,b) = c,
    inference(resolve,[$cnf( $equal(greatest_lower_bound(c,least_upper_bound(b,c)),c) )],[refute_0_22,refute_0_24]) ).

cnf(refute_0_26,plain,
    greatest_lower_bound(c,b) = greatest_lower_bound(b,c),
    inference(subst,[],[refute_0_17:[bind(X,$fot(b)),bind(Y,$fot(c))]]) ).

cnf(refute_0_27,plain,
    ( greatest_lower_bound(c,b) != c
    | greatest_lower_bound(c,b) != greatest_lower_bound(b,c)
    | greatest_lower_bound(b,c) = c ),
    introduced(tautology,[equality,[$cnf( $equal(greatest_lower_bound(c,b),c) ),[0],$fot(greatest_lower_bound(b,c))]]) ).

cnf(refute_0_28,plain,
    ( greatest_lower_bound(c,b) != c
    | greatest_lower_bound(b,c) = c ),
    inference(resolve,[$cnf( $equal(greatest_lower_bound(c,b),greatest_lower_bound(b,c)) )],[refute_0_26,refute_0_27]) ).

cnf(refute_0_29,plain,
    greatest_lower_bound(b,c) = c,
    inference(resolve,[$cnf( $equal(greatest_lower_bound(c,b),c) )],[refute_0_25,refute_0_28]) ).

cnf(refute_0_30,plain,
    greatest_lower_bound(a,greatest_lower_bound(b,c)) = greatest_lower_bound(a,greatest_lower_bound(b,c)),
    introduced(tautology,[refl,[$fot(greatest_lower_bound(a,greatest_lower_bound(b,c)))]]) ).

cnf(refute_0_31,plain,
    ( greatest_lower_bound(a,greatest_lower_bound(b,c)) != greatest_lower_bound(a,greatest_lower_bound(b,c))
    | greatest_lower_bound(b,c) != c
    | greatest_lower_bound(a,greatest_lower_bound(b,c)) = greatest_lower_bound(a,c) ),
    introduced(tautology,[equality,[$cnf( $equal(greatest_lower_bound(a,greatest_lower_bound(b,c)),greatest_lower_bound(a,greatest_lower_bound(b,c))) ),[1,1],$fot(c)]]) ).

cnf(refute_0_32,plain,
    ( greatest_lower_bound(b,c) != c
    | greatest_lower_bound(a,greatest_lower_bound(b,c)) = greatest_lower_bound(a,c) ),
    inference(resolve,[$cnf( $equal(greatest_lower_bound(a,greatest_lower_bound(b,c)),greatest_lower_bound(a,greatest_lower_bound(b,c))) )],[refute_0_30,refute_0_31]) ).

cnf(refute_0_33,plain,
    greatest_lower_bound(a,greatest_lower_bound(b,c)) = greatest_lower_bound(a,c),
    inference(resolve,[$cnf( $equal(greatest_lower_bound(b,c),c) )],[refute_0_29,refute_0_32]) ).

cnf(refute_0_34,plain,
    ( Y0 != X0
    | Y0 != Z0
    | X0 = Z0 ),
    introduced(tautology,[equality,[$cnf( $equal(Y0,Z0) ),[0],$fot(X0)]]) ).

cnf(refute_0_35,plain,
    ( X0 != Y0
    | Y0 != Z0
    | X0 = Z0 ),
    inference(resolve,[$cnf( $equal(Y0,X0) )],[refute_0_2,refute_0_34]) ).

cnf(refute_0_36,plain,
    ( greatest_lower_bound(a,c) != c
    | greatest_lower_bound(a,greatest_lower_bound(b,c)) != greatest_lower_bound(a,c)
    | greatest_lower_bound(a,greatest_lower_bound(b,c)) = c ),
    inference(subst,[],[refute_0_35:[bind(X0,$fot(greatest_lower_bound(a,greatest_lower_bound(b,c)))),bind(Y0,$fot(greatest_lower_bound(a,c))),bind(Z0,$fot(c))]]) ).

cnf(refute_0_37,plain,
    ( greatest_lower_bound(a,c) != c
    | greatest_lower_bound(a,greatest_lower_bound(b,c)) = c ),
    inference(resolve,[$cnf( $equal(greatest_lower_bound(a,greatest_lower_bound(b,c)),greatest_lower_bound(a,c)) )],[refute_0_33,refute_0_36]) ).

cnf(refute_0_38,plain,
    greatest_lower_bound(a,greatest_lower_bound(b,c)) = c,
    inference(resolve,[$cnf( $equal(greatest_lower_bound(a,c),c) )],[refute_0_21,refute_0_37]) ).

cnf(refute_0_39,plain,
    ( c != c
    | greatest_lower_bound(a,greatest_lower_bound(b,c)) != c
    | greatest_lower_bound(a,greatest_lower_bound(b,c)) = c ),
    introduced(tautology,[equality,[$cnf( $equal(greatest_lower_bound(a,greatest_lower_bound(b,c)),c) ),[0,1,1],$fot(c)]]) ).

cnf(refute_0_40,plain,
    ( c != c
    | greatest_lower_bound(a,greatest_lower_bound(b,c)) = c ),
    inference(resolve,[$cnf( $equal(greatest_lower_bound(a,greatest_lower_bound(b,c)),c) )],[refute_0_38,refute_0_39]) ).

cnf(refute_0_41,plain,
    c != c,
    inference(resolve,[$cnf( $equal(greatest_lower_bound(a,greatest_lower_bound(b,c)),c) )],[refute_0_40,refute_0_8]) ).

cnf(refute_0_42,plain,
    c = c,
    introduced(tautology,[refl,[$fot(c)]]) ).

cnf(refute_0_43,plain,
    $false,
    inference(resolve,[$cnf( $equal(c,c) )],[refute_0_42,refute_0_41]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : GRP141-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.13  % Command  : metis --show proof --show saturation %s
% 0.13/0.35  % Computer : n007.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Tue Jun 14 01:50:39 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.13/0.35  %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.13/0.37  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.37  
% 0.13/0.37  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 0.13/0.37  
%------------------------------------------------------------------------------