TSTP Solution File: GRP176-1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : GRP176-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:31 EDT 2022
% Result : Unsatisfiable 0.20s 0.34s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP176-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.00/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 21:44:32 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.20/0.34 % SZS status Unsatisfiable
% 0.20/0.34 % SZS output begin IncompleteProof
% 0.20/0.34 cnf(c0, axiom,
% 0.20/0.34 multiply(c,multiply(least_upper_bound(a,b),d)) != least_upper_bound(multiply(c,multiply(a,d)),multiply(c,multiply(b,d)))).
% 0.20/0.34 cnf(c1, plain,
% 0.20/0.34 multiply(c,multiply(least_upper_bound(a,b),d)) != least_upper_bound(multiply(c,multiply(a,d)),multiply(c,multiply(b,d))),
% 0.20/0.34 inference(start, [], [c0])).
% 0.20/0.34
% 0.20/0.34 cnf(c2, axiom,
% 0.20/0.34 multiply(X0,least_upper_bound(X1,X2)) = least_upper_bound(multiply(X0,X1),multiply(X0,X2))).
% 0.20/0.34 cnf(a0, assumption,
% 0.20/0.34 least_upper_bound(multiply(c,multiply(a,d)),multiply(c,multiply(b,d))) = least_upper_bound(multiply(X0,X1),multiply(X0,X2))).
% 0.20/0.34 cnf(c3, plain,
% 0.20/0.34 $false,
% 0.20/0.34 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.20/0.34 cnf(c4, plain,
% 0.20/0.34 $false,
% 0.20/0.34 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.20/0.34 cnf(c5, plain,
% 0.20/0.34 X3 != multiply(X0,least_upper_bound(X1,X2)) | multiply(c,multiply(least_upper_bound(a,b),d)) != X3,
% 0.20/0.34 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.20/0.34
% 0.20/0.34 cnf(c6, axiom,
% 0.20/0.34 multiply(least_upper_bound(X4,X5),X6) = least_upper_bound(multiply(X4,X6),multiply(X5,X6))).
% 0.20/0.34 cnf(a1, assumption,
% 0.20/0.34 least_upper_bound(X1,X2) = least_upper_bound(multiply(X4,X6),multiply(X5,X6))).
% 0.20/0.34 cnf(c7, plain,
% 0.20/0.34 multiply(c,multiply(least_upper_bound(a,b),d)) != X3,
% 0.20/0.34 inference(strict_function_extension, [assumptions([a1])], [c5, c6])).
% 0.20/0.34 cnf(c8, plain,
% 0.20/0.34 $false,
% 0.20/0.34 inference(strict_function_extension, [assumptions([a1])], [c5, c6])).
% 0.20/0.34 cnf(c9, plain,
% 0.20/0.34 X7 != multiply(least_upper_bound(X4,X5),X6) | X3 != multiply(X0,X7),
% 0.20/0.34 inference(strict_function_extension, [assumptions([a1])], [c5, c6])).
% 0.20/0.34
% 0.20/0.34 cnf(a2, assumption,
% 0.20/0.34 X7 = multiply(least_upper_bound(X4,X5),X6)).
% 0.20/0.34 cnf(c10, plain,
% 0.20/0.34 X3 != multiply(X0,X7),
% 0.20/0.34 inference(reflexivity, [assumptions([a2])], [c9])).
% 0.20/0.34
% 0.20/0.34 cnf(a3, assumption,
% 0.20/0.34 X3 = multiply(X0,X7)).
% 0.20/0.34 cnf(c11, plain,
% 0.20/0.34 $false,
% 0.20/0.34 inference(reflexivity, [assumptions([a3])], [c10])).
% 0.20/0.34
% 0.20/0.34 cnf(a4, assumption,
% 0.20/0.34 multiply(c,multiply(least_upper_bound(a,b),d)) = X3).
% 0.20/0.34 cnf(c12, plain,
% 0.20/0.34 $false,
% 0.20/0.34 inference(reflexivity, [assumptions([a4])], [c7])).
% 0.20/0.34
% 0.20/0.34 cnf(c13, plain,
% 0.20/0.34 $false,
% 0.20/0.34 inference(constraint_solving, [
% 0.20/0.34 bind(X0, c),
% 0.20/0.34 bind(X1, multiply(a,d)),
% 0.20/0.34 bind(X2, multiply(b,d)),
% 0.20/0.34 bind(X3, multiply(X0,X7)),
% 0.20/0.34 bind(X4, a),
% 0.20/0.34 bind(X5, b),
% 0.20/0.34 bind(X6, d),
% 0.20/0.34 bind(X7, multiply(least_upper_bound(X4,X5),X6))
% 0.20/0.34 ],
% 0.20/0.34 [a0, a1, a2, a3, a4])).
% 0.20/0.34
% 0.20/0.34 % SZS output end IncompleteProof
%------------------------------------------------------------------------------