TSTP Solution File: GRP162-1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : GRP162-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 : n010.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:25 EDT 2022
% Result : Unsatisfiable 4.72s 0.99s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP162-1 : 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.34 % Computer : n010.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % 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 05:01:55 EDT 2022
% 0.13/0.34 % CPUTime :
% 4.72/0.99 % SZS status Unsatisfiable
% 4.72/0.99 % SZS output begin IncompleteProof
% 4.72/0.99 cnf(c0, axiom,
% 4.72/0.99 c != least_upper_bound(a,c)).
% 4.72/0.99 cnf(c1, plain,
% 4.72/0.99 c != least_upper_bound(a,c),
% 4.72/0.99 inference(start, [], [c0])).
% 4.72/0.99
% 4.72/0.99 cnf(c2, axiom,
% 4.72/0.99 least_upper_bound(X0,least_upper_bound(X1,X2)) = least_upper_bound(least_upper_bound(X0,X1),X2)).
% 4.72/0.99 cnf(a0, assumption,
% 4.72/0.99 least_upper_bound(X3,X4) = least_upper_bound(a,c)).
% 4.72/0.99 cnf(c3, plain,
% 4.72/0.99 $false,
% 4.72/0.99 inference(lazy_function_extension, [assumptions([a0])], [c1, c2])).
% 4.72/0.99 cnf(c4, plain,
% 4.72/0.99 $false,
% 4.72/0.99 inference(lazy_function_extension, [assumptions([a0])], [c1, c2])).
% 4.72/0.99 cnf(c5, plain,
% 4.72/0.99 X3 != X0 | X4 != least_upper_bound(X1,X2) | X5 != least_upper_bound(least_upper_bound(X0,X1),X2) | c != X5,
% 4.72/0.99 inference(lazy_function_extension, [assumptions([a0])], [c1, c2])).
% 4.72/0.99
% 4.72/0.99 cnf(a1, assumption,
% 4.72/0.99 X3 = X0).
% 4.72/0.99 cnf(c6, plain,
% 4.72/0.99 X4 != least_upper_bound(X1,X2) | X5 != least_upper_bound(least_upper_bound(X0,X1),X2) | c != X5,
% 4.72/0.99 inference(reflexivity, [assumptions([a1])], [c5])).
% 4.72/0.99
% 4.72/0.99 cnf(c7, axiom,
% 4.72/0.99 c = least_upper_bound(b,c)).
% 4.72/0.99 cnf(a2, assumption,
% 4.72/0.99 least_upper_bound(X1,X2) = least_upper_bound(b,c)).
% 4.72/0.99 cnf(c8, plain,
% 4.72/0.99 X5 != least_upper_bound(least_upper_bound(X0,X1),X2) | c != X5,
% 4.72/0.99 inference(strict_function_extension, [assumptions([a2])], [c6, c7])).
% 4.72/0.99 cnf(c9, plain,
% 4.72/0.99 $false,
% 4.72/0.99 inference(strict_function_extension, [assumptions([a2])], [c6, c7])).
% 4.72/0.99 cnf(c10, plain,
% 4.72/0.99 X6 != c | X4 != X6,
% 4.72/0.99 inference(strict_function_extension, [assumptions([a2])], [c6, c7])).
% 4.72/0.99
% 4.72/0.99 cnf(a3, assumption,
% 4.72/0.99 X6 = c).
% 4.72/0.99 cnf(c11, plain,
% 4.72/0.99 X4 != X6,
% 4.72/0.99 inference(reflexivity, [assumptions([a3])], [c10])).
% 4.72/0.99
% 4.72/0.99 cnf(a4, assumption,
% 4.72/0.99 X4 = X6).
% 4.72/0.99 cnf(c12, plain,
% 4.72/0.99 $false,
% 4.72/0.99 inference(reflexivity, [assumptions([a4])], [c11])).
% 4.72/0.99
% 4.72/0.99 cnf(c13, axiom,
% 4.72/0.99 b = least_upper_bound(a,b)).
% 4.72/0.99 cnf(a5, assumption,
% 4.72/0.99 least_upper_bound(X0,X1) = least_upper_bound(a,b)).
% 4.72/0.99 cnf(c14, plain,
% 4.72/0.99 c != X5,
% 4.72/0.99 inference(strict_function_extension, [assumptions([a5])], [c8, c13])).
% 4.72/0.99 cnf(c15, plain,
% 4.72/0.99 $false,
% 4.72/0.99 inference(strict_function_extension, [assumptions([a5])], [c8, c13])).
% 4.72/0.99 cnf(c16, plain,
% 4.72/0.99 X7 != b | X5 != least_upper_bound(X7,X2),
% 4.72/0.99 inference(strict_function_extension, [assumptions([a5])], [c8, c13])).
% 4.72/0.99
% 4.72/0.99 cnf(a6, assumption,
% 4.72/0.99 X7 = b).
% 4.72/0.99 cnf(c17, plain,
% 4.72/0.99 X5 != least_upper_bound(X7,X2),
% 4.72/0.99 inference(reflexivity, [assumptions([a6])], [c16])).
% 4.72/0.99
% 4.72/0.99 cnf(c18, plain,
% 4.72/0.99 X4 = least_upper_bound(X1,X2)).
% 4.72/0.99 cnf(a7, assumption,
% 4.72/0.99 least_upper_bound(X7,X2) = least_upper_bound(X1,X2)).
% 4.72/0.99 cnf(c19, plain,
% 4.72/0.99 $false,
% 4.72/0.99 inference(equality_reduction, [assumptions([a7])], [c17, c18])).
% 4.72/0.99 cnf(c20, plain,
% 4.72/0.99 X5 != X4,
% 4.72/0.99 inference(equality_reduction, [assumptions([a7])], [c17, c18])).
% 4.72/0.99
% 4.72/0.99 cnf(a8, assumption,
% 4.72/0.99 X5 = X4).
% 4.72/0.99 cnf(c21, plain,
% 4.72/0.99 $false,
% 4.72/0.99 inference(reflexivity, [assumptions([a8])], [c20])).
% 4.72/0.99
% 4.72/0.99 cnf(a9, assumption,
% 4.72/0.99 c = X5).
% 4.72/0.99 cnf(c22, plain,
% 4.72/0.99 $false,
% 4.72/0.99 inference(reflexivity, [assumptions([a9])], [c14])).
% 4.72/0.99
% 4.72/0.99 cnf(c23, plain,
% 4.72/0.99 $false,
% 4.72/0.99 inference(constraint_solving, [
% 4.72/0.99 bind(X0, a),
% 4.72/0.99 bind(X1, b),
% 4.72/0.99 bind(X2, c),
% 4.72/0.99 bind(X5, c),
% 4.72/0.99 bind(X3, a),
% 4.72/0.99 bind(X4, c),
% 4.72/0.99 bind(X6, c),
% 4.72/0.99 bind(X7, b)
% 4.72/0.99 ],
% 4.72/0.99 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9])).
% 4.72/0.99
% 4.72/0.99 % SZS output end IncompleteProof
%------------------------------------------------------------------------------