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