%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : FLD017-1 : TPTP v8.1.0. Bugfixed v2.1.0. % 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 02:15:47 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.12 % Problem : FLD017-1 : TPTP v8.1.0. Bugfixed v2.1.0. % 0.07/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.33 % Computer : n028.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 6 17:39:14 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 equalish(a,x)). % 0.12/0.36 cnf(c1, plain, % 0.12/0.36 equalish(a,x), % 0.12/0.36 inference(start, [], [c0])). % 0.12/0.36 % 0.12/0.36 cnf(c2, axiom, % 0.12/0.36 ~equalish(X0,X1) | ~defined(X2) | equalish(add(X0,X2),add(X1,X2))). % 0.12/0.36 cnf(a0, assumption, % 0.12/0.36 a = X0). % 0.12/0.36 cnf(a1, assumption, % 0.12/0.36 x = X1). % 0.12/0.36 cnf(c3, plain, % 0.12/0.36 $false, % 0.12/0.36 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.12/0.36 cnf(c4, plain, % 0.12/0.36 ~defined(X2) | equalish(add(X0,X2),add(X1,X2)), % 0.12/0.36 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.12/0.36 % 0.12/0.36 cnf(c5, axiom, % 0.12/0.36 defined(b)). % 0.12/0.36 cnf(a2, assumption, % 0.12/0.36 X2 = b). % 0.12/0.36 cnf(c6, plain, % 0.12/0.36 equalish(add(X0,X2),add(X1,X2)), % 0.12/0.36 inference(strict_predicate_extension, [assumptions([a2])], [c4, c5])). % 0.12/0.36 cnf(c7, plain, % 0.12/0.36 $false, % 0.12/0.36 inference(strict_predicate_extension, [assumptions([a2])], [c4, c5])). % 0.12/0.36 % 0.12/0.36 cnf(c8, axiom, % 0.12/0.36 ~equalish(X3,X4) | equalish(X4,X3)). % 0.12/0.36 cnf(a3, assumption, % 0.12/0.36 add(X0,X2) = X3). % 0.12/0.36 cnf(a4, assumption, % 0.12/0.36 add(X1,X2) = X4). % 0.12/0.36 cnf(c9, plain, % 0.12/0.36 $false, % 0.12/0.36 inference(strict_predicate_extension, [assumptions([a3, a4])], [c6, c8])). % 0.12/0.36 cnf(c10, plain, % 0.12/0.36 equalish(X4,X3), % 0.12/0.36 inference(strict_predicate_extension, [assumptions([a3, a4])], [c6, c8])). % 0.12/0.36 % 0.12/0.36 cnf(c11, axiom, % 0.12/0.36 ~equalish(X5,X6) | ~equalish(X7,X5) | equalish(X7,X6)). % 0.12/0.36 cnf(a5, assumption, % 0.12/0.36 X4 = X7). % 0.12/0.36 cnf(a6, assumption, % 0.12/0.36 X3 = X5). % 0.12/0.36 cnf(c12, plain, % 0.12/0.36 $false, % 0.12/0.36 inference(strict_predicate_extension, [assumptions([a5, a6])], [c10, c11])). % 0.12/0.36 cnf(c13, plain, % 0.12/0.36 ~equalish(X5,X6) | equalish(X7,X6), % 0.12/0.36 inference(strict_predicate_extension, [assumptions([a5, a6])], [c10, c11])). % 0.12/0.36 % 0.12/0.36 cnf(c14, axiom, % 0.12/0.36 equalish(add(a,b),c)). % 0.12/0.36 cnf(a7, assumption, % 0.12/0.36 X5 = add(a,b)). % 0.12/0.36 cnf(a8, assumption, % 0.12/0.36 X6 = c). % 0.12/0.36 cnf(c15, plain, % 0.12/0.36 equalish(X7,X6), % 0.12/0.36 inference(strict_predicate_extension, [assumptions([a7, a8])], [c13, c14])). % 0.12/0.36 cnf(c16, plain, % 0.12/0.36 $false, % 0.12/0.36 inference(strict_predicate_extension, [assumptions([a7, a8])], [c13, c14])). % 0.12/0.36 % 0.12/0.36 cnf(c17, axiom, % 0.12/0.36 ~equalish(add(x,b),c)). % 0.12/0.36 cnf(a9, assumption, % 0.12/0.36 X7 = add(x,b)). % 0.12/0.36 cnf(a10, assumption, % 0.12/0.36 X6 = c). % 0.12/0.36 cnf(c18, plain, % 0.12/0.36 $false, % 0.12/0.36 inference(strict_predicate_extension, [assumptions([a9, a10])], [c15, c17])). % 0.12/0.36 cnf(c19, plain, % 0.12/0.36 $false, % 0.12/0.36 inference(strict_predicate_extension, [assumptions([a9, a10])], [c15, c17])). % 0.12/0.36 % 0.12/0.36 cnf(c20, plain, % 0.12/0.36 $false, % 0.12/0.36 inference(constraint_solving, [ % 0.12/0.36 bind(X0, a), % 0.12/0.36 bind(X1, x), % 0.12/0.36 bind(X2, b), % 0.12/0.36 bind(X3, add(X0,X2)), % 0.12/0.36 bind(X4, add(X1,X2)), % 0.12/0.36 bind(X5, add(X0,X2)), % 0.12/0.36 bind(X6, c), % 0.12/0.36 bind(X7, add(X1,X2)) % 0.12/0.36 ], % 0.12/0.36 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10])). % 0.12/0.36 % 0.12/0.36 % SZS output end IncompleteProof %------------------------------------------------------------------------------