TSTP Solution File: GRP142-1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : GRP142-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 : n028.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:21 EDT 2022
% Result : Unsatisfiable 0.14s 0.36s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP142-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.14/0.35 % Computer : n028.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Mon Jun 13 16:46:23 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.36 % SZS status Unsatisfiable
% 0.14/0.36 % SZS output begin IncompleteProof
% 0.14/0.36 cnf(c0, axiom,
% 0.14/0.36 a != least_upper_bound(greatest_lower_bound(a,b),a)).
% 0.14/0.36 cnf(c1, plain,
% 0.14/0.36 a != least_upper_bound(greatest_lower_bound(a,b),a),
% 0.14/0.36 inference(start, [], [c0])).
% 0.14/0.36
% 0.14/0.36 cnf(c2, axiom,
% 0.14/0.36 least_upper_bound(X0,X1) = least_upper_bound(X1,X0)).
% 0.14/0.36 cnf(a0, assumption,
% 0.14/0.36 least_upper_bound(greatest_lower_bound(a,b),a) = least_upper_bound(X0,X1)).
% 0.14/0.36 cnf(c3, plain,
% 0.14/0.36 $false,
% 0.14/0.36 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.14/0.36 cnf(c4, plain,
% 0.14/0.36 $false,
% 0.14/0.36 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.14/0.36 cnf(c5, plain,
% 0.14/0.36 X2 != least_upper_bound(X1,X0) | a != X2,
% 0.14/0.36 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.14/0.36
% 0.14/0.36 cnf(c6, axiom,
% 0.14/0.36 least_upper_bound(X3,greatest_lower_bound(X3,X4)) = X3).
% 0.14/0.36 cnf(a1, assumption,
% 0.14/0.36 least_upper_bound(X1,X0) = least_upper_bound(X3,greatest_lower_bound(X3,X4))).
% 0.14/0.36 cnf(c7, plain,
% 0.14/0.36 a != X2,
% 0.14/0.36 inference(strict_function_extension, [assumptions([a1])], [c5, c6])).
% 0.14/0.36 cnf(c8, plain,
% 0.14/0.36 $false,
% 0.14/0.36 inference(strict_function_extension, [assumptions([a1])], [c5, c6])).
% 0.14/0.36 cnf(c9, plain,
% 0.14/0.36 X5 != X3 | X2 != X5,
% 0.14/0.36 inference(strict_function_extension, [assumptions([a1])], [c5, c6])).
% 0.14/0.36
% 0.14/0.36 cnf(a2, assumption,
% 0.14/0.36 X5 = X3).
% 0.14/0.36 cnf(c10, plain,
% 0.14/0.36 X2 != X5,
% 0.14/0.36 inference(reflexivity, [assumptions([a2])], [c9])).
% 0.14/0.36
% 0.14/0.36 cnf(a3, assumption,
% 0.14/0.36 X2 = X5).
% 0.14/0.36 cnf(c11, plain,
% 0.14/0.36 $false,
% 0.14/0.36 inference(reflexivity, [assumptions([a3])], [c10])).
% 0.14/0.36
% 0.14/0.36 cnf(a4, assumption,
% 0.14/0.36 a = X2).
% 0.14/0.36 cnf(c12, plain,
% 0.14/0.36 $false,
% 0.14/0.36 inference(reflexivity, [assumptions([a4])], [c7])).
% 0.14/0.36
% 0.14/0.36 cnf(c13, plain,
% 0.14/0.36 $false,
% 0.14/0.36 inference(constraint_solving, [
% 0.14/0.36 bind(X0, greatest_lower_bound(a,b)),
% 0.14/0.36 bind(X1, a),
% 0.14/0.36 bind(X2, a),
% 0.14/0.36 bind(X3, a),
% 0.14/0.36 bind(X4, b),
% 0.14/0.36 bind(X5, a)
% 0.14/0.36 ],
% 0.14/0.36 [a0, a1, a2, a3, a4])).
% 0.14/0.36
% 0.14/0.36 % SZS output end IncompleteProof
%------------------------------------------------------------------------------