TSTP Solution File: GRP151-1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : GRP151-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 : n017.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:23 EDT 2022
% Result : Unsatisfiable 0.12s 0.34s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP151-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33 % Computer : n017.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 : Tue Jun 14 08:17:23 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 % SZS status Unsatisfiable
% 0.12/0.34 % SZS output begin IncompleteProof
% 0.12/0.34 cnf(c0, axiom,
% 0.12/0.34 a != greatest_lower_bound(a,least_upper_bound(a,b))).
% 0.12/0.34 cnf(c1, plain,
% 0.12/0.34 a != greatest_lower_bound(a,least_upper_bound(a,b)),
% 0.12/0.34 inference(start, [], [c0])).
% 0.12/0.34
% 0.12/0.34 cnf(c2, axiom,
% 0.12/0.34 greatest_lower_bound(X0,least_upper_bound(X0,X1)) = X0).
% 0.12/0.34 cnf(a0, assumption,
% 0.12/0.34 greatest_lower_bound(a,least_upper_bound(a,b)) = greatest_lower_bound(X0,least_upper_bound(X0,X1))).
% 0.12/0.34 cnf(c3, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.12/0.34 cnf(c4, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.12/0.34 cnf(c5, plain,
% 0.12/0.34 X2 != X0 | a != X2,
% 0.12/0.34 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.12/0.34
% 0.12/0.34 cnf(a1, assumption,
% 0.12/0.34 X2 = X0).
% 0.12/0.34 cnf(c6, plain,
% 0.12/0.34 a != X2,
% 0.12/0.34 inference(reflexivity, [assumptions([a1])], [c5])).
% 0.12/0.34
% 0.12/0.34 cnf(a2, assumption,
% 0.12/0.34 a = X2).
% 0.12/0.34 cnf(c7, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(reflexivity, [assumptions([a2])], [c6])).
% 0.12/0.34
% 0.12/0.34 cnf(c8, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(constraint_solving, [
% 0.12/0.34 bind(X0, a),
% 0.12/0.34 bind(X1, b),
% 0.12/0.34 bind(X2, a)
% 0.12/0.34 ],
% 0.12/0.34 [a0, a1, a2])).
% 0.12/0.34
% 0.12/0.34 % SZS output end IncompleteProof
%------------------------------------------------------------------------------