TSTP Solution File: GRP143-1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : GRP143-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 : n027.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.12s 0.36s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : GRP143-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33 % Computer : n027.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 04:52:01 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.36 % SZS status Unsatisfiable
% 0.12/0.36 % SZS output begin IncompleteProof
% 0.12/0.36 cnf(c0, axiom,
% 0.12/0.36 greatest_lower_bound(a,b) != greatest_lower_bound(greatest_lower_bound(a,b),a)).
% 0.12/0.36 cnf(c1, plain,
% 0.12/0.36 greatest_lower_bound(a,b) != greatest_lower_bound(greatest_lower_bound(a,b),a),
% 0.12/0.36 inference(start, [], [c0])).
% 0.12/0.36
% 0.12/0.36 cnf(c2, axiom,
% 0.12/0.36 greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0)).
% 0.12/0.36 cnf(a0, assumption,
% 0.12/0.36 greatest_lower_bound(greatest_lower_bound(a,b),a) = greatest_lower_bound(X0,X1)).
% 0.12/0.36 cnf(c3, plain,
% 0.12/0.36 $false,
% 0.12/0.36 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.12/0.36 cnf(c4, plain,
% 0.12/0.36 $false,
% 0.12/0.36 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.12/0.36 cnf(c5, plain,
% 0.12/0.36 X2 != greatest_lower_bound(X1,X0) | greatest_lower_bound(a,b) != X2,
% 0.12/0.36 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.12/0.36
% 0.12/0.36 cnf(c6, axiom,
% 0.12/0.36 greatest_lower_bound(X3,greatest_lower_bound(X4,X5)) = greatest_lower_bound(greatest_lower_bound(X3,X4),X5)).
% 0.12/0.36 cnf(a1, assumption,
% 0.12/0.36 greatest_lower_bound(X1,X0) = greatest_lower_bound(X3,greatest_lower_bound(X4,X5))).
% 0.12/0.36 cnf(c7, plain,
% 0.12/0.36 greatest_lower_bound(a,b) != X2,
% 0.12/0.36 inference(strict_function_extension, [assumptions([a1])], [c5, c6])).
% 0.12/0.36 cnf(c8, plain,
% 0.12/0.36 $false,
% 0.12/0.36 inference(strict_function_extension, [assumptions([a1])], [c5, c6])).
% 0.12/0.36 cnf(c9, plain,
% 0.12/0.36 X6 != greatest_lower_bound(greatest_lower_bound(X3,X4),X5) | X2 != X6,
% 0.12/0.36 inference(strict_function_extension, [assumptions([a1])], [c5, c6])).
% 0.12/0.36
% 0.12/0.36 cnf(c10, axiom,
% 0.12/0.36 greatest_lower_bound(X7,X7) = X7).
% 0.12/0.36 cnf(a2, assumption,
% 0.12/0.36 greatest_lower_bound(X3,X4) = greatest_lower_bound(X7,X7)).
% 0.12/0.36 cnf(c11, plain,
% 0.12/0.36 X2 != X6,
% 0.12/0.36 inference(strict_function_extension, [assumptions([a2])], [c9, c10])).
% 0.12/0.36 cnf(c12, plain,
% 0.12/0.36 $false,
% 0.12/0.36 inference(strict_function_extension, [assumptions([a2])], [c9, c10])).
% 0.12/0.36 cnf(c13, plain,
% 0.12/0.36 X8 != X7 | X6 != greatest_lower_bound(X8,X5),
% 0.12/0.36 inference(strict_function_extension, [assumptions([a2])], [c9, c10])).
% 0.12/0.36
% 0.12/0.36 cnf(a3, assumption,
% 0.12/0.36 X8 = X7).
% 0.12/0.36 cnf(c14, plain,
% 0.12/0.36 X6 != greatest_lower_bound(X8,X5),
% 0.12/0.36 inference(reflexivity, [assumptions([a3])], [c13])).
% 0.12/0.36
% 0.12/0.36 cnf(a4, assumption,
% 0.12/0.36 X6 = greatest_lower_bound(X8,X5)).
% 0.12/0.36 cnf(c15, plain,
% 0.12/0.36 $false,
% 0.12/0.36 inference(reflexivity, [assumptions([a4])], [c14])).
% 0.12/0.36
% 0.12/0.36 cnf(a5, assumption,
% 0.12/0.36 X2 = X6).
% 0.12/0.36 cnf(c16, plain,
% 0.12/0.36 $false,
% 0.12/0.36 inference(reflexivity, [assumptions([a5])], [c11])).
% 0.12/0.36
% 0.12/0.36 cnf(a6, assumption,
% 0.12/0.36 greatest_lower_bound(a,b) = X2).
% 0.12/0.36 cnf(c17, plain,
% 0.12/0.36 $false,
% 0.12/0.36 inference(reflexivity, [assumptions([a6])], [c7])).
% 0.12/0.36
% 0.12/0.36 cnf(c18, plain,
% 0.12/0.36 $false,
% 0.12/0.36 inference(constraint_solving, [
% 0.12/0.36 bind(X0, greatest_lower_bound(a,b)),
% 0.12/0.36 bind(X1, a),
% 0.12/0.36 bind(X2, greatest_lower_bound(X8,X5)),
% 0.12/0.36 bind(X3, a),
% 0.12/0.36 bind(X4, a),
% 0.12/0.36 bind(X5, b),
% 0.12/0.36 bind(X6, greatest_lower_bound(X8,X5)),
% 0.12/0.36 bind(X7, a),
% 0.12/0.36 bind(X8, a)
% 0.12/0.36 ],
% 0.12/0.36 [a0, a1, a2, a3, a4, a5, a6])).
% 0.12/0.36
% 0.12/0.36 % SZS output end IncompleteProof
%------------------------------------------------------------------------------