TSTP Solution File: GRP186-4 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : GRP186-4 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% Computer : n019.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:09:37 EDT 2022
% Result : Unsatisfiable 72.42s 9.57s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP186-4 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.33 % Computer : n019.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.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 13 10:48:24 EDT 2022
% 0.13/0.34 % CPUTime :
% 72.42/9.57 % SZS status Unsatisfiable
% 72.42/9.57 % SZS output begin IncompleteProof
% 72.42/9.57 cnf(c0, axiom,
% 72.42/9.57 least_upper_bound(multiply(a,b),identity) != multiply(a,least_upper_bound(inverse(a),b))).
% 72.42/9.57 cnf(c1, plain,
% 72.42/9.57 least_upper_bound(multiply(a,b),identity) != multiply(a,least_upper_bound(inverse(a),b)),
% 72.42/9.57 inference(start, [], [c0])).
% 72.42/9.57
% 72.42/9.57 cnf(c2, axiom,
% 72.42/9.57 least_upper_bound(X0,X1) = least_upper_bound(X1,X0)).
% 72.42/9.57 cnf(a0, assumption,
% 72.42/9.57 least_upper_bound(multiply(a,b),identity) = least_upper_bound(X0,X1)).
% 72.42/9.57 cnf(c3, plain,
% 72.42/9.57 $false,
% 72.42/9.57 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 72.42/9.57 cnf(c4, plain,
% 72.42/9.57 $false,
% 72.42/9.57 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 72.42/9.57 cnf(c5, plain,
% 72.42/9.57 X2 != least_upper_bound(X1,X0) | X2 != multiply(a,least_upper_bound(inverse(a),b)),
% 72.42/9.57 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 72.42/9.57
% 72.42/9.57 cnf(a1, assumption,
% 72.42/9.57 X2 = least_upper_bound(X1,X0)).
% 72.42/9.57 cnf(c6, plain,
% 72.42/9.57 X2 != multiply(a,least_upper_bound(inverse(a),b)),
% 72.42/9.57 inference(reflexivity, [assumptions([a1])], [c5])).
% 72.42/9.57
% 72.42/9.57 cnf(c7, axiom,
% 72.42/9.57 multiply(X3,least_upper_bound(X4,X5)) = least_upper_bound(multiply(X3,X4),multiply(X3,X5))).
% 72.42/9.57 cnf(a2, assumption,
% 72.42/9.57 multiply(a,least_upper_bound(inverse(a),b)) = multiply(X3,least_upper_bound(X4,X5))).
% 72.42/9.57 cnf(c8, plain,
% 72.42/9.57 $false,
% 72.42/9.57 inference(strict_function_extension, [assumptions([a2])], [c6, c7])).
% 72.42/9.57 cnf(c9, plain,
% 72.42/9.57 $false,
% 72.42/9.57 inference(strict_function_extension, [assumptions([a2])], [c6, c7])).
% 72.42/9.57 cnf(c10, plain,
% 72.42/9.57 X6 != least_upper_bound(multiply(X3,X4),multiply(X3,X5)) | X2 != X6,
% 72.42/9.57 inference(strict_function_extension, [assumptions([a2])], [c6, c7])).
% 72.42/9.57
% 72.42/9.57 cnf(c11, axiom,
% 72.42/9.57 identity = multiply(inverse(X7),X7)).
% 72.42/9.57 cnf(a3, assumption,
% 72.42/9.57 multiply(X8,X9) = multiply(X3,X4)).
% 72.42/9.57 cnf(c12, plain,
% 72.42/9.57 X2 != X6,
% 72.42/9.57 inference(lazy_function_extension, [assumptions([a3])], [c10, c11])).
% 72.42/9.57 cnf(c13, plain,
% 72.42/9.57 $false,
% 72.42/9.57 inference(lazy_function_extension, [assumptions([a3])], [c10, c11])).
% 72.42/9.57 cnf(c14, plain,
% 72.42/9.57 X8 != inverse(X7) | X9 != X7 | X10 != identity | X6 != least_upper_bound(X10,multiply(X3,X5)),
% 72.42/9.57 inference(lazy_function_extension, [assumptions([a3])], [c10, c11])).
% 72.42/9.57
% 72.42/9.57 cnf(c15, axiom,
% 72.42/9.57 inverse(inverse(X11)) = X11).
% 72.42/9.57 cnf(a4, assumption,
% 72.42/9.57 inverse(X7) = inverse(inverse(X11))).
% 72.42/9.57 cnf(c16, plain,
% 72.42/9.57 X9 != X7 | X10 != identity | X6 != least_upper_bound(X10,multiply(X3,X5)),
% 72.42/9.57 inference(strict_function_extension, [assumptions([a4])], [c14, c15])).
% 72.42/9.57 cnf(c17, plain,
% 72.42/9.57 $false,
% 72.42/9.57 inference(strict_function_extension, [assumptions([a4])], [c14, c15])).
% 72.42/9.57 cnf(c18, plain,
% 72.42/9.57 X12 != X11 | X8 != X12,
% 72.42/9.57 inference(strict_function_extension, [assumptions([a4])], [c14, c15])).
% 72.42/9.57
% 72.42/9.57 cnf(a5, assumption,
% 72.42/9.57 X12 = X11).
% 72.42/9.57 cnf(c19, plain,
% 72.42/9.57 X8 != X12,
% 72.42/9.57 inference(reflexivity, [assumptions([a5])], [c18])).
% 72.42/9.57
% 72.42/9.57 cnf(a6, assumption,
% 72.42/9.57 X8 = X12).
% 72.42/9.57 cnf(c20, plain,
% 72.42/9.57 $false,
% 72.42/9.57 inference(reflexivity, [assumptions([a6])], [c19])).
% 72.42/9.57
% 72.42/9.57 cnf(a7, assumption,
% 72.42/9.57 X9 = X7).
% 72.42/9.57 cnf(c21, plain,
% 72.42/9.57 X10 != identity | X6 != least_upper_bound(X10,multiply(X3,X5)),
% 72.42/9.57 inference(reflexivity, [assumptions([a7])], [c16])).
% 72.42/9.57
% 72.42/9.57 cnf(a8, assumption,
% 72.42/9.57 X10 = identity).
% 72.42/9.57 cnf(c22, plain,
% 72.42/9.57 X6 != least_upper_bound(X10,multiply(X3,X5)),
% 72.42/9.57 inference(reflexivity, [assumptions([a8])], [c21])).
% 72.42/9.57
% 72.42/9.57 cnf(a9, assumption,
% 72.42/9.57 X6 = least_upper_bound(X10,multiply(X3,X5))).
% 72.42/9.57 cnf(c23, plain,
% 72.42/9.57 $false,
% 72.42/9.57 inference(reflexivity, [assumptions([a9])], [c22])).
% 72.42/9.57
% 72.42/9.57 cnf(a10, assumption,
% 72.42/9.57 X2 = X6).
% 72.42/9.57 cnf(c24, plain,
% 72.42/9.57 $false,
% 72.42/9.57 inference(reflexivity, [assumptions([a10])], [c12])).
% 72.42/9.57
% 72.42/9.57 cnf(c25, plain,
% 72.42/9.57 $false,
% 72.42/9.57 inference(constraint_solving, [
% 72.42/9.57 bind(X0, multiply(a,b)),
% 72.42/9.57 bind(X1, identity),
% 72.42/9.57 bind(X2, least_upper_bound(X1,X0)),
% 72.42/9.57 bind(X3, a),
% 72.42/9.57 bind(X4, inverse(a)),
% 72.42/9.57 bind(X5, b),
% 72.42/9.57 bind(X6, least_upper_bound(X10,multiply(X3,X5))),
% 72.42/9.57 bind(X7, inverse(X11)),
% 72.42/9.57 bind(X10, identity),
% 72.42/9.57 bind(X8, a),
% 72.42/9.57 bind(X9, inverse(a)),
% 72.42/9.57 bind(X11, a),
% 72.42/9.57 bind(X12, a)
% 72.42/9.57 ],
% 72.42/9.57 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10])).
% 72.42/9.57
% 72.42/9.57 % SZS output end IncompleteProof
%------------------------------------------------------------------------------