TSTP Solution File: LAT035-1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : LAT035-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% Computer : n023.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 : Sun Jul 17 05:37:37 EDT 2022
% Result : Unsatisfiable 3.84s 0.83s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LAT035-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.14/0.34 % Computer : n023.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Wed Jun 29 20:22:44 EDT 2022
% 0.14/0.34 % CPUTime :
% 3.84/0.83 % SZS status Unsatisfiable
% 3.84/0.83 % SZS output begin IncompleteProof
% 3.84/0.83 cnf(c0, axiom,
% 3.84/0.83 n0 != f(k(n0)) | f(k(join(aa,bb))) != join(f(k(aa)),f(k(bb)))).
% 3.84/0.83 cnf(c1, plain,
% 3.84/0.83 n0 != f(k(n0)) | f(k(join(aa,bb))) != join(f(k(aa)),f(k(bb))),
% 3.84/0.83 inference(start, [], [c0])).
% 3.84/0.83
% 3.84/0.83 cnf(c2, axiom,
% 3.84/0.83 n1 = k(n0)).
% 3.84/0.83 cnf(a0, assumption,
% 3.84/0.83 k(n0) = k(n0)).
% 3.84/0.83 cnf(c3, plain,
% 3.84/0.83 f(k(join(aa,bb))) != join(f(k(aa)),f(k(bb))),
% 3.84/0.83 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 3.84/0.83 cnf(c4, plain,
% 3.84/0.83 $false,
% 3.84/0.83 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 3.84/0.83 cnf(c5, plain,
% 3.84/0.83 X0 != n1 | n0 != f(X0),
% 3.84/0.83 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 3.84/0.83
% 3.84/0.83 cnf(a1, assumption,
% 3.84/0.83 X0 = n1).
% 3.84/0.83 cnf(c6, plain,
% 3.84/0.83 n0 != f(X0),
% 3.84/0.83 inference(reflexivity, [assumptions([a1])], [c5])).
% 3.84/0.83
% 3.84/0.83 cnf(c7, axiom,
% 3.84/0.83 n0 = f(n1)).
% 3.84/0.83 cnf(a2, assumption,
% 3.84/0.83 f(X0) = f(n1)).
% 3.84/0.83 cnf(c8, plain,
% 3.84/0.83 $false,
% 3.84/0.83 inference(strict_function_extension, [assumptions([a2])], [c6, c7])).
% 3.84/0.83 cnf(c9, plain,
% 3.84/0.83 $false,
% 3.84/0.83 inference(strict_function_extension, [assumptions([a2])], [c6, c7])).
% 3.84/0.83 cnf(c10, plain,
% 3.84/0.83 X1 != n0 | n0 != X1,
% 3.84/0.83 inference(strict_function_extension, [assumptions([a2])], [c6, c7])).
% 3.84/0.83
% 3.84/0.83 cnf(a3, assumption,
% 3.84/0.83 X1 = n0).
% 3.84/0.83 cnf(c11, plain,
% 3.84/0.83 n0 != X1,
% 3.84/0.83 inference(reflexivity, [assumptions([a3])], [c10])).
% 3.84/0.83
% 3.84/0.83 cnf(a4, assumption,
% 3.84/0.83 n0 = X1).
% 3.84/0.83 cnf(c12, plain,
% 3.84/0.83 $false,
% 3.84/0.83 inference(reflexivity, [assumptions([a4])], [c11])).
% 3.84/0.83
% 3.84/0.83 cnf(c13, axiom,
% 3.84/0.83 f(meet(X2,X3)) = join(f(X2),f(X3))).
% 3.84/0.83 cnf(a5, assumption,
% 3.84/0.83 join(f(k(aa)),f(k(bb))) = join(f(X2),f(X3))).
% 3.84/0.83 cnf(c14, plain,
% 3.84/0.83 $false,
% 3.84/0.83 inference(strict_function_extension, [assumptions([a5])], [c3, c13])).
% 3.84/0.83 cnf(c15, plain,
% 3.84/0.83 $false,
% 3.84/0.83 inference(strict_function_extension, [assumptions([a5])], [c3, c13])).
% 3.84/0.83 cnf(c16, plain,
% 3.84/0.83 X4 != f(meet(X2,X3)) | f(k(join(aa,bb))) != X4,
% 3.84/0.83 inference(strict_function_extension, [assumptions([a5])], [c3, c13])).
% 3.84/0.83
% 3.84/0.83 cnf(a6, assumption,
% 3.84/0.83 X4 = f(meet(X2,X3))).
% 3.84/0.83 cnf(c17, plain,
% 3.84/0.83 f(k(join(aa,bb))) != X4,
% 3.84/0.83 inference(reflexivity, [assumptions([a6])], [c16])).
% 3.84/0.83
% 3.84/0.83 cnf(c18, axiom,
% 3.84/0.83 k(join(X5,X6)) = meet(k(X5),k(X6))).
% 3.84/0.83 cnf(a7, assumption,
% 3.84/0.83 k(join(aa,bb)) = k(join(X5,X6))).
% 3.84/0.83 cnf(c19, plain,
% 3.84/0.83 $false,
% 3.84/0.83 inference(strict_function_extension, [assumptions([a7])], [c17, c18])).
% 3.84/0.83 cnf(c20, plain,
% 3.84/0.83 $false,
% 3.84/0.83 inference(strict_function_extension, [assumptions([a7])], [c17, c18])).
% 3.84/0.83 cnf(c21, plain,
% 3.84/0.83 X7 != meet(k(X5),k(X6)) | f(X7) != X4,
% 3.84/0.83 inference(strict_function_extension, [assumptions([a7])], [c17, c18])).
% 3.84/0.83
% 3.84/0.83 cnf(a8, assumption,
% 3.84/0.83 X7 = meet(k(X5),k(X6))).
% 3.84/0.83 cnf(c22, plain,
% 3.84/0.83 f(X7) != X4,
% 3.84/0.83 inference(reflexivity, [assumptions([a8])], [c21])).
% 3.84/0.83
% 3.84/0.83 cnf(a9, assumption,
% 3.84/0.83 f(X7) = X4).
% 3.84/0.83 cnf(c23, plain,
% 3.84/0.83 $false,
% 3.84/0.83 inference(reflexivity, [assumptions([a9])], [c22])).
% 3.84/0.83
% 3.84/0.83 cnf(c24, plain,
% 3.84/0.83 $false,
% 3.84/0.83 inference(constraint_solving, [
% 3.84/0.83 bind(X0, n1),
% 3.84/0.83 bind(X1, n0),
% 3.84/0.83 bind(X2, k(aa)),
% 3.84/0.83 bind(X3, k(bb)),
% 3.84/0.83 bind(X4, f(meet(X2,X3))),
% 3.84/0.83 bind(X5, aa),
% 3.84/0.83 bind(X6, bb),
% 3.84/0.83 bind(X7, meet(k(X5),k(X6)))
% 3.84/0.83 ],
% 3.84/0.83 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9])).
% 3.84/0.83
% 3.84/0.83 % SZS output end IncompleteProof
%------------------------------------------------------------------------------